bigcode/the-stack-smol-xl · Datasets at Hugging Face

8bfb996635a90e1b3e7b256b8957123ca2015c38

5,286

adb

Ada

src/asf-components-core.adb

jquorning/ada-asf

ddc697c5dfa4e22c57c6958f4cff27e14d02ce98

[ "Apache-2.0" ]

12

2015-01-18T23:02:20.000Z

2022-03-25T15:30:30.000Z

src/asf-components-core.adb

jquorning/ada-asf

ddc697c5dfa4e22c57c6958f4cff27e14d02ce98

[ "Apache-2.0" ]

3

2021-01-06T09:44:02.000Z

2022-02-04T20:20:53.000Z

src/asf-components-core.adb

jquorning/ada-asf

ddc697c5dfa4e22c57c6958f4cff27e14d02ce98

[ "Apache-2.0" ]

4

2016-04-12T05:29:00.000Z

2022-01-24T23:53:59.000Z

----------------------------------------------------------------------- -- components-core -- ASF Core Components -- Copyright (C) 2009, 2010, 2011, 2012, 2018 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Ada.Unchecked_Deallocation; package body ASF.Components.Core is use EL.Objects; -- ------------------------------ -- Return a client-side identifier for this component, generating -- one if necessary. -- ------------------------------ function Get_Client_Id (UI : UIComponentBase) return Unbounded_String is Id : constant access ASF.Views.Nodes.Tag_Attribute := UI.Get_Attribute ("id"); begin if Id /= null then return To_Unbounded_String (Views.Nodes.Get_Value (Id.all, UI.Get_Context.all)); end if; -- return UI.Id; return Base.UIComponent (UI).Get_Client_Id; end Get_Client_Id; -- ------------------------------ -- Renders the UIText evaluating the EL expressions it may contain. -- ------------------------------ procedure Encode_Begin (UI : in UIText; Context : in out Faces_Context'Class) is begin UI.Text.Encode_All (UI.Expr_Table, Context); end Encode_Begin; -- ------------------------------ -- Set the expression array that contains reduced expressions. -- ------------------------------ procedure Set_Expression_Table (UI : in out UIText; Expr_Table : in Views.Nodes.Expression_Access_Array_Access) is use type ASF.Views.Nodes.Expression_Access_Array_Access; begin if UI.Expr_Table /= null then UI.Log_Error ("Expression table already initialized"); raise Program_Error with "Expression table already initialized"; end if; UI.Expr_Table := Expr_Table; end Set_Expression_Table; -- ------------------------------ -- Finalize the object. -- ------------------------------ overriding procedure Finalize (UI : in out UIText) is use type ASF.Views.Nodes.Expression_Access_Array_Access; procedure Free is new Ada.Unchecked_Deallocation (EL.Expressions.Expression'Class, EL.Expressions.Expression_Access); procedure Free is new Ada.Unchecked_Deallocation (ASF.Views.Nodes.Expression_Access_Array, ASF.Views.Nodes.Expression_Access_Array_Access); begin if UI.Expr_Table /= null then for I in UI.Expr_Table'Range loop Free (UI.Expr_Table (I)); end loop; Free (UI.Expr_Table); end if; Base.UIComponent (UI).Finalize; end Finalize; function Create_UIText (Tag : ASF.Views.Nodes.Text_Tag_Node_Access) return UIText_Access is Result : constant UIText_Access := new UIText; begin Result.Text := Tag; return Result; end Create_UIText; -- ------------------------------ -- Get the parameter name -- ------------------------------ function Get_Name (UI : UIParameter; Context : Faces_Context'Class) return String is Name : constant EL.Objects.Object := UI.Get_Attribute (Name => "name", Context => Context); begin return EL.Objects.To_String (Name); end Get_Name; -- ------------------------------ -- Get the parameter value -- ------------------------------ function Get_Value (UI : UIParameter; Context : Faces_Context'Class) return EL.Objects.Object is begin return UI.Get_Attribute (Name => "value", Context => Context); end Get_Value; -- ------------------------------ -- Get the list of parameters associated with a component. -- ------------------------------ function Get_Parameters (UI : Base.UIComponent'Class) return UIParameter_Access_Array is Result : UIParameter_Access_Array (1 .. UI.Get_Children_Count); Last : Natural := 0; procedure Collect (Child : in Base.UIComponent_Access); pragma Inline (Collect); procedure Collect (Child : in Base.UIComponent_Access) is begin if Child.all in UIParameter'Class then Last := Last + 1; Result (Last) := UIParameter (Child.all)'Access; end if; end Collect; procedure Iter is new ASF.Components.Base.Iterate (Process => Collect); pragma Inline (Iter); begin Iter (UI); return Result (1 .. Last); end Get_Parameters; end ASF.Components.Core;

38.028777

97

0.567348

8b7b6ce1acf0f9af66be01d9af1194daa290e4af

342

ads

Ada

boards/stm32f030x8/stm32gd-board.ads

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

1

2021-04-06T07:57:56.000Z

boards/stm32f030x8/stm32gd-board.ads

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

null

boards/stm32f030x8/stm32gd-board.ads

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

2

2018-05-29T13:59:31.000Z

2019-02-03T19:48:08.000Z

with STM32GD.GPIO; use STM32GD.GPIO; with STM32GD.GPIO.Pin; package STM32GD.Board is package GPIO renames STM32GD.GPIO; package BUTTON is new GPIO.Pin (Pin => GPIO.Pin_0, Port => GPIO.Port_A); package LED is new GPIO.Pin (Pin => GPIO.Pin_6, Port => GPIO.Port_F, Mode => GPIO.Mode_Out); procedure Init; end STM32GD.Board;

22.8

98

0.701754

a0b7ac0fe1ce0488fa6f05d058fdc01f47eee88a

5,302

ads

Ada

src/util/util-refs.ads

jquorning/ada-wiki

21dcbeb3897499ee4b4a85353f8a782e154c0a43

[ "Apache-2.0" ]

18

2015-10-26T21:32:08.000Z

2021-11-30T10:38:51.000Z

src/util/util-refs.ads

jquorning/ada-wiki

21dcbeb3897499ee4b4a85353f8a782e154c0a43

[ "Apache-2.0" ]

2

2018-03-18T08:22:06.000Z

2022-02-16T22:15:05.000Z

src/util/util-refs.ads

jquorning/ada-wiki

21dcbeb3897499ee4b4a85353f8a782e154c0a43

[ "Apache-2.0" ]

2

2019-04-05T17:10:34.000Z

2022-02-13T20:50:56.000Z

----------------------------------------------------------------------- -- util-refs -- Reference Counting -- Copyright (C) 2010, 2011, 2015 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Ada.Finalization; with Util.Concurrent.Counters; -- The Util.Refs package provides support to implement object reference counting. -- -- The data type to share through reference counting has to inherit from Ref_Entity -- and the generic package References has to be instantiated. -- <pre> -- type Data is new Util.Refs.Ref_Entity with record ... end record; -- type Data_Access is access all Data; -- -- package Data_Ref is new Utils.Refs.References (Data, Data_Access); -- </pre> -- -- The reference is used as follows: -- -- <pre> -- D : Data_Ref.Ref := Data_Ref.Create; -- Allocate and get a reference -- D2 : Data_Ref.Ref := D; -- Share reference -- D.Value.all.XXXX := 0; -- Set data member XXXX -- </pre> -- -- When a reference is shared in a multi-threaded environment, the reference has to -- be protected by using the References.Atomic_Ref type. -- -- R : Data_Ref.Atomic_Ref; -- -- The reference is then obtained by the protected operation Get. -- -- D : Data_Ref.Ref := R.Get; -- package Util.Refs is pragma Preelaborate; -- Root of referenced objects. type Ref_Entity is abstract tagged limited private; -- Finalize the referenced object. This is called before the object is freed. procedure Finalize (Object : in out Ref_Entity) is null; generic type Element_Type (<>) is new Ref_Entity with private; type Element_Access is access all Element_Type; package Indefinite_References is type Ref is new Ada.Finalization.Controlled with private; -- Create an element and return a reference to that element. function Create (Value : in Element_Access) return Ref; -- Get the element access value. function Value (Object : in Ref'Class) return Element_Access; pragma Inline_Always (Value); -- Returns true if the reference does not contain any element. function Is_Null (Object : in Ref'Class) return Boolean; pragma Inline_Always (Is_Null); -- The Atomic_Ref protected type defines a reference to an -- element which can be obtained and changed atomically. The default -- Ada construct: -- -- Ref1 := Ref2; -- -- does not guarantee atomicity of the copy (assignment) and the increment -- of the reference counter (Adjust operation). To replace shared reference -- by another one, the whole assignment and Adjust have to be protected. -- This is achieved by this protected type through the Get and Set protected type Atomic_Ref is -- Get the reference function Get return Ref; -- Change the reference procedure Set (Object : in Ref); private Value : Ref; end Atomic_Ref; private type Ref is new Ada.Finalization.Controlled with record Target : Element_Access := null; end record; -- Release the reference. Invoke Finalize and free the storage if it was -- the last reference. overriding procedure Finalize (Obj : in out Ref); -- Update the reference counter after an assignment. overriding procedure Adjust (Obj : in out Ref); end Indefinite_References; generic type Element_Type is new Ref_Entity with private; type Element_Access is access all Element_Type; package References is package IR is new Indefinite_References (Element_Type, Element_Access); subtype Ref is IR.Ref; -- Create an element and return a reference to that element. function Create return Ref; -- The Atomic_Ref protected type defines a reference to an -- element which can be obtained and changed atomically. The default -- Ada construct: -- -- Ref1 := Ref2; -- -- does not guarantee atomicity of the copy (assignment) and the increment -- of the reference counter (Adjust operation). To replace shared reference -- by another one, the whole assignment and Adjust have to be protected. -- This is achieved by this protected type through the Get and Set subtype Atomic_Ref is IR.Atomic_Ref; end References; private type Ref_Entity is abstract tagged limited record Ref_Counter : Util.Concurrent.Counters.Counter; end record; end Util.Refs;

36.565517

91

0.655413

8b6268de4bd8cf5d87b9987ffdd16f496e5ecbf6

2,562

ads

Ada

1-base/math/source/generic/pure/algebra/any_math-any_algebra-any_linear-any_d2.ads

charlie5/lace-alire

9ace9682cf4daac7adb9f980c2868d6225b8111c

[ "0BSD" ]

1

2022-01-20T07:13:42.000Z

1-base/math/source/generic/pure/algebra/any_math-any_algebra-any_linear-any_d2.ads

charlie5/lace-alire

9ace9682cf4daac7adb9f980c2868d6225b8111c

[ "0BSD" ]

null

1-base/math/source/generic/pure/algebra/any_math-any_algebra-any_linear-any_d2.ads

charlie5/lace-alire

9ace9682cf4daac7adb9f980c2868d6225b8111c

[ "0BSD" ]

null

generic package any_Math.any_Algebra.any_linear.any_d2 is pragma Pure; ----------- -- Vector_2 -- function Interpolated (From, To : in Vector_2; Percent : in unit_Percentage) return Vector_2; function Distance (From, To : in Vector_2) return Real; function Midpoint (From, To : in Vector_2) return Vector_2; function Angle_between_pre_Norm (U, V : in Vector_2) return Radians; -- -- Given that the vectors 'U' and 'V' are already normalized, returns a positive angle between 0 and 180 degrees. ------------- -- Matrix_2x2 -- function to_Matrix (Row_1, Row_2 : in Vector_2) return Matrix_2x2; function to_rotation_Matrix (Angle : in Radians) return Matrix_2x2; function up_Direction (Self : in Matrix_2x2) return Vector_2; function right_Direction (Self : in Matrix_2x2) return Vector_2; ------------ -- Transform -- function to_Transform (Rotation : in Matrix_2x2; Translation : in Vector_2) return Matrix_3x3; function to_Transform (From : in Transform_2d) return Matrix_3x3; function to_translation_Transform (Translation : in Vector_2) return Matrix_3x3; function to_rotation_Transform (Rotation : in Matrix_2x2) return Matrix_3x3; function to_rotation_Transform (Angle : in Radians ) return Matrix_3x3; function to_scale_Transform (Scale : in Vector_2) return Matrix_3x3; function to_Transform_2d (From : in Matrix_3x3) return Transform_2d; function to_Transform_2d (Rotation : in Radians; Translation : in Vector_2) return Transform_2d; function "*" (Left : in Vector_2; Right : in Transform_2d) return Vector_2; function "*" (Left : in Vector_2; Right : in Matrix_3x3) return Vector_2; function Invert (Transform : in Transform_2d) return Transform_2d; function inverse_Transform (Transform : in Transform_2d; Vector : in Vector_2) return Vector_2; function get_Rotation (Transform : in Matrix_3x3) return Matrix_2x2; procedure set_Rotation (Transform : in out Matrix_3x3; To : in Matrix_2x2); function get_Translation (Transform : in Matrix_3x3) return Vector_2; procedure set_Translation (Transform : in out Matrix_3x3; To : in Vector_2); end any_Math.any_Algebra.any_linear.any_d2;

45.75

116

0.637393

04589c0103c130951e9a9b53c72657d43c60cc44

3,094

adb

Ada

tests/tkmrpc_response_tests.adb

DrenfongWong/tkm-rpc

075d22871cf81d497aac656c7f03a513278b641c

[ "BSD-3-Clause" ]

null

tests/tkmrpc_response_tests.adb

DrenfongWong/tkm-rpc

075d22871cf81d497aac656c7f03a513278b641c

[ "BSD-3-Clause" ]

null

tests/tkmrpc_response_tests.adb

DrenfongWong/tkm-rpc

075d22871cf81d497aac656c7f03a513278b641c

[ "BSD-3-Clause" ]

null

-- -- Copyright (C) 2013 Reto Buerki <[email protected]> -- Copyright (C) 2013 Adrian-Ken Rueegsegger <[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: -- 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 University 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 REGENTS 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 REGENTS 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 Tkmrpc.Operations; with Tkmrpc.Response.Convert; with Tkmrpc.Types; with Test_Utils; package body Tkmrpc_Response_Tests is use Ahven; use Tkmrpc; ------------------------------------------------------------------------- procedure Initialize (T : in out Testcase) is begin T.Set_Name (Name => "Response tests"); T.Add_Test_Routine (Routine => Stream_Conversion'Access, Name => "To/from stream conversions"); end Initialize; ------------------------------------------------------------------------- procedure Stream_Conversion is use Tkmrpc.Response; use type Tkmrpc.Operations.Operation_Type; use type Tkmrpc.Response.Padded_Data_Type; use type Tkmrpc.Types.Request_Id_Type; Stream : constant Convert.Stream_Type := Convert.To_Stream (S => Test_Utils.Test_Response); Res : constant Data_Type := Convert.From_Stream (S => Stream); Data : constant Padded_Data_Type := (others => Character'Pos ('c')); begin Assert (Condition => Res.Header.Operation = Test_Utils.Test_Operation, Message => "Operation mismatch"); Assert (Condition => Res.Header.Request_Id = 234234234, Message => "Request ID mismatch"); Assert (Condition => Res.Padded_Data = Data, Message => "Data mismatch"); end Stream_Conversion; end Tkmrpc_Response_Tests;

40.710526

78

0.676471

2e1aa99d2100ebca4ef89fde430f885b60f98bb6

18,169

adb

Ada

arbitrary.adb

joewing/arbitrary

44722a99e141f0a0916836d24ad48af228f3fc45

[ "BSD-3-Clause" ]

null

arbitrary.adb

joewing/arbitrary

44722a99e141f0a0916836d24ad48af228f3fc45

[ "BSD-3-Clause" ]

null

arbitrary.adb

joewing/arbitrary

44722a99e141f0a0916836d24ad48af228f3fc45

[ "BSD-3-Clause" ]

2

2019-01-21T02:40:56.000Z

2020-09-17T03:59:23.000Z

-------------------------------------------------------------------------- -- Arbitrary Precision Math Library -- Joe Wingbermuehle 20020320 <> 20020327 -------------------------------------------------------------------------- with Ada.Text_IO; use Ada.Text_IO; with Ada.Unchecked_Deallocation; package body Arbitrary is procedure Delete is new Ada.Unchecked_Deallocation(Mantissa_Type, Mantissa_Pointer); ----------------------------------------------------------------------- -- Initialize an Arbitrary_Type ----------------------------------------------------------------------- procedure Initialize(object : in out Arbitrary_Type) is begin object.mantissa := new Mantissa_Type(1..object.precision); object.exponent := 0; object.sign := 1; for x in object.mantissa'range loop object.mantissa(x) := 0; end loop; end Initialize; ----------------------------------------------------------------------- -- Fix an Arbitrary_Type after being assigned a value ----------------------------------------------------------------------- procedure Adjust(object : in out Arbitrary_Type) is temp : Mantissa_Pointer; begin temp := new Mantissa_Type(1..object.precision); for x in object.mantissa'range loop temp(x) := object.mantissa(x); end loop; object.mantissa := temp; end Adjust; ----------------------------------------------------------------------- -- Release an Arbitrary_Type; ----------------------------------------------------------------------- procedure Finalize(object : in out Arbitrary_Type) is begin if object.mantissa /= null then Delete(object.mantissa); end if; object.mantissa := null; end Finalize; ----------------------------------------------------------------------- -- Shift mantissa left one digit and preserve the value ----------------------------------------------------------------------- procedure Shift_Left(a : in out Arbitrary_Type) is begin for x in a.mantissa'first + 1..a.mantissa'last loop a.mantissa(x - 1) := a.mantissa(x); end loop; a.mantissa(a.mantissa'last) := 0; a.exponent := a.exponent - 1; end Shift_Left; ----------------------------------------------------------------------- -- Shift the mantissa right one digit and preserve the value ----------------------------------------------------------------------- procedure Shift_Right(a : in out Arbitrary_Type) is begin for x in reverse a.mantissa'first..a.mantissa'last - 1 loop a.mantissa(x + 1) := a.mantissa(x); end loop; a.mantissa(a.mantissa'first) := 0; a.exponent := a.exponent + 1; end Shift_Right; ----------------------------------------------------------------------- -- Fix overflows, underflows, and sign changes ----------------------------------------------------------------------- procedure Normalize(a : in out Arbitrary_Type) is changed : boolean := true; temp : integer; carry : integer; begin -- Zero is a special case temp := a.mantissa'first; while temp <= a.mantissa'last loop exit when a.mantissa(temp) /= 0; temp := temp + 1; end loop; if temp > a.mantissa'last then a.sign := 1; a.exponent := 0; return; end if; while changed loop changed := false; for x in a.mantissa'first + 1 .. a.mantissa'last loop if a.mantissa(x) >= base then temp := a.mantissa(x); a.mantissa(x) := temp mod base; a.mantissa(x - 1) := a.mantissa(x - 1) + temp / base; changed := true; end if; while a.mantissa(x) < 0 loop a.mantissa(x) := a.mantissa(x) + base; a.mantissa(x - 1) := a.mantissa(x - 1) - 1; changed := true; end loop; end loop; if a.mantissa(a.mantissa'first) >= base then carry := a.mantissa(a.mantissa'first) / base; temp := a.mantissa(a.mantissa'first) mod base; a.mantissa(a.mantissa'first) := temp; Shift_Right(a); a.mantissa(a.mantissa'first) := carry; changed := true; end if; if a.mantissa(a.mantissa'first) < 0 then for x in a.mantissa'range loop a.mantissa(x) := -a.mantissa(x); end loop; a.sign := -a.sign; changed := true; end if; while a.mantissa(a.mantissa'first) = 0 loop Shift_Left(a); changed := true; end loop; end loop; end Normalize; ----------------------------------------------------------------------- -- Display an Arbitrary_Type ----------------------------------------------------------------------- procedure Display(a : Arbitrary_Type) is begin if a.sign < 0 then Put("-"); end if; Put(character'val(a.mantissa(a.mantissa'first) + character'pos('0'))); Put("."); for x in a.mantissa'first + 1 .. a.mantissa'last loop Put(character'val(a.mantissa(x) + character'pos('0'))); end loop; if a.exponent /= 0 then Put(" E" & a.exponent'img); end if; end Display; ----------------------------------------------------------------------- -- Set an Arbitrary_Type to zero -- (This is done in the Initializer) ----------------------------------------------------------------------- procedure Clear(a : out Arbitrary_Type) is begin for x in a.mantissa'range loop a.mantissa(x) := 0; end loop; a.exponent := 0; a.sign := 1; end Clear; ----------------------------------------------------------------------- -- Convert an integer type to an Arbitrary_Type ----------------------------------------------------------------------- function To_Arbitrary(value : integer; precision : integer) return Arbitrary_Type is result : Arbitrary_Type(precision); begin result.mantissa(result.exponent + 1) := value; Normalize(result); return result; end To_Arbitrary; ----------------------------------------------------------------------- -- Test for equality ----------------------------------------------------------------------- function "="(a, b : Arbitrary_Type) return boolean is begin if a.precision = b.precision and a.exponent = b.exponent and a.sign = b.sign then for x in a.mantissa'first..a.mantissa'last loop if a.mantissa(x) /= b.mantissa(x) then return false; end if; end loop; return true; else return false; end if; end "="; ----------------------------------------------------------------------- -- Test greater than ----------------------------------------------------------------------- function ">"(a, b : Arbitrary_Type) return boolean is begin if DEBUG_CHECKS then if a.precision /= b.precision then raise Constraint_Error; end if; end if; if a.sign < 0 and b.sign > 0 then return false; elsif a.sign > 0 and b.sign < 0 then return true; elsif a.exponent > b.exponent then if a.sign < 0 then return false; else return true; end if; elsif a.exponent < b.exponent then if a.sign < 0 then return true; else return false; end if; else if a.sign < 0 then for x in a.mantissa'range loop if a.mantissa(x) < b.mantissa(x) then return true; elsif a.mantissa(x) > b.mantissa(x) then return false; end if; end loop; else for x in a.mantissa'range loop if a.mantissa(x) > b.mantissa(x) then return true; elsif a.mantissa(x) < b.mantissa(x) then return false; end if; end loop; end if; return false; end if; end ">"; ----------------------------------------------------------------------- -- Test greater or equal ----------------------------------------------------------------------- function ">="(a, b : Arbitrary_Type) return boolean is begin if DEBUG_CHECKS then if a.precision /= b.precision then raise Constraint_Error; end if; end if; if a.sign < 0 and b.sign > 0 then return false; elsif a.sign > 0 and b.sign < 0 then return true; elsif a.exponent > b.exponent then if a.sign < 0 then return false; else return true; end if; elsif a.exponent < b.exponent then if a.sign < 0 then return true; else return false; end if; else if a.sign < 0 then for x in a.mantissa'range loop if a.mantissa(x) < b.mantissa(x) then return true; elsif a.mantissa(x) > b.mantissa(x) then return false; end if; end loop; else for x in a.mantissa'range loop if a.mantissa(x) > b.mantissa(x) then return true; elsif a.mantissa(x) < b.mantissa(x) then return false; end if; end loop; end if; return true; end if; end ">="; ----------------------------------------------------------------------- -- Test if less than ----------------------------------------------------------------------- function "<"(a, b : Arbitrary_Type) return boolean is begin if DEBUG_CHECKS then if a.precision /= b.precision then raise Constraint_Error; end if; end if; if a.sign < 0 and b.sign > 0 then return true; elsif a.sign > 0 and b.sign < 0 then return false; elsif a.exponent < b.exponent then if a.sign < 0 then return false; else return true; end if; elsif a.exponent > b.exponent then if a.sign < 0 then return true; else return false; end if; else if a.sign < 0 then for x in a.mantissa'range loop if a.mantissa(x) > b.mantissa(x) then return true; elsif a.mantissa(x) < b.mantissa(x) then return false; end if; end loop; else for x in a.mantissa'range loop if a.mantissa(x) < b.mantissa(x) then return true; elsif a.mantissa(x) > b.mantissa(x) then return false; end if; end loop; end if; return false; end if; end "<"; ----------------------------------------------------------------------- -- Test if less than or equal to ----------------------------------------------------------------------- function "<="(a, b : Arbitrary_Type) return boolean is begin if DEBUG_CHECKS then if a.precision /= b.precision then raise Constraint_Error; end if; end if; if a.sign < 0 and b.sign > 0 then return true; elsif a.sign > 0 and b.sign < 0 then return false; elsif a.exponent < b.exponent then if a.sign < 0 then return false; else return true; end if; elsif a.exponent > b.exponent then if a.sign < 0 then return true; else return false; end if; else if a.sign < 0 then for x in a.mantissa'range loop if a.mantissa(x) > b.mantissa(x) then return true; elsif a.mantissa(x) < b.mantissa(x) then return false; end if; end loop; else for x in a.mantissa'range loop if a.mantissa(x) < b.mantissa(x) then return true; elsif a.mantissa(x) > b.mantissa(x) then return false; end if; end loop; end if; return true; end if; end "<="; ----------------------------------------------------------------------- -- Compute n! to precision digits ----------------------------------------------------------------------- function Factorial(n : integer; precision : integer) return Arbitrary_Type is result : Arbitrary_Type(precision); begin if n < 0 then raise Constraint_Error; end if; result := To_Arbitrary(1, precision); for x in 2 .. n loop result := result * To_Arbitrary(x, precision); end loop; return result; end Factorial; ----------------------------------------------------------------------- -- Compute 1/n! ----------------------------------------------------------------------- function One_Over_Factorial(n : integer; precision : integer) return Arbitrary_Type is result : Arbitrary_Type(precision); begin if n < 0 then raise Constraint_Error; end if; result := To_Arbitrary(1, precision); for x in 2 .. n loop result := result / To_Arbitrary(x, precision); end loop; return result; end One_Over_Factorial; ----------------------------------------------------------------------- -- Compute the square root of n to precision digits ----------------------------------------------------------------------- function Square_Root(a : Arbitrary_Type) return Arbitrary_Type is result : Arbitrary_Type(a.precision); last : Arbitrary_Type(a.precision); two : constant Arbitrary_Type(a.precision) := To_Arbitrary(2, a.precision); begin -- x(i) = (x(i-1) + n / x(i-1)) / 2 result := To_Arbitrary(1, a.precision); loop last := result; result := result + a / result; result := result / two; exit when last = result; end loop; return result; end Square_Root; ----------------------------------------------------------------------- -- Unary + operator -- do nothing ----------------------------------------------------------------------- function "+"(a : Arbitrary_Type) return Arbitrary_Type is begin return a; end "+"; ----------------------------------------------------------------------- -- Negate a ----------------------------------------------------------------------- function "-"(a : Arbitrary_Type) return Arbitrary_Type is result : Arbitrary_Type(a.precision); begin result := a; result.sign := -result.sign; return result; end "-"; ----------------------------------------------------------------------- -- Compute a + b ----------------------------------------------------------------------- function "+"(a, b : Arbitrary_Type) return Arbitrary_Type is result : Arbitrary_Type(a.precision); begin if DEBUG_CHECKS then if a.precision /= b.precision then raise Constraint_Error; end if; end if; -- If the signs are different, addition becomes subtraction if a.sign /= b.sign then if b.sign < 0 then result := b; result.sign := -result.sign; result := a - result; return result; else result := a; result.sign := -result.sign; result := b - result; return result; end if; end if; -- Set result to the additive with the least exponent and shift if a.exponent > b.exponent then result := b; for x in b.exponent .. a.exponent - 1 loop Shift_Right(result); end loop; for x in result.mantissa'range loop result.mantissa(x) := result.mantissa(x) + a.mantissa(x); end loop; else result := a; for x in a.exponent .. b.exponent - 1 loop Shift_Right(result); end loop; for x in result.mantissa'range loop result.mantissa(x) := result.mantissa(x) + b.mantissa(x); end loop; end if; Normalize(result); return result; end "+"; ----------------------------------------------------------------------- -- Compute a - b ----------------------------------------------------------------------- function "-"(a, b : Arbitrary_Type) return Arbitrary_Type is result : Arbitrary_Type(a.precision); begin if DEBUG_CHECKS then if a.precision /= b.precision then raise Constraint_Error; end if; end if; -- Use addition if the signs differ if a.sign /= b.sign then if a.sign < 0 then result := b; result.sign := -1; return a + result; else result := b; result.sign := 1; return a + result; end if; end if; if a.exponent > b.exponent then result := b; for x in b.exponent .. a.exponent - 1 loop Shift_Right(result); end loop; for x in result.mantissa'range loop result.mantissa(x) := a.mantissa(x) - result.mantissa(x); end loop; else result := a; for x in a.exponent .. b.exponent - 1 loop Shift_Right(result); end loop; for x in result.mantissa'range loop result.mantissa(x) := result.mantissa(x) - b.mantissa(x); end loop; end if; Normalize(result); return result; end "-"; ----------------------------------------------------------------------- -- Compute a * b ----------------------------------------------------------------------- function "*"(a, b : Arbitrary_Type) return Arbitrary_Type is result : Arbitrary_Type( integer'max(a.precision, b.precision)); offset : integer; -- offset in result; begin if DEBUG_CHECKS then if a.precision /= b.precision then raise Constraint_Error; end if; end if; offset := 0; for x in b.mantissa'range loop for y in a.mantissa'first .. a.mantissa'last - offset loop result.mantissa(offset + y) := result.mantissa(offset + y) + a.mantissa(y) * b.mantissa(x); end loop; offset := offset + 1; end loop; result.sign := a.sign * b.sign; result.exponent := a.exponent + b.exponent; Normalize(result); return result; end "*"; ----------------------------------------------------------------------- -- Compute a / b ----------------------------------------------------------------------- function "/"(a, b : Arbitrary_Type) return Arbitrary_Type is result : Arbitrary_Type(a.precision); denominator : Arbitrary_Type(a.precision); numerator : Arbitrary_Type(a.precision); temp : integer; begin if DEBUG_CHECKS then if a.precision /= b.precision then raise Constraint_Error; end if; if b = To_Arbitrary(0, b.precision) then raise Constraint_Error; end if; end if; if a = To_Arbitrary(0, a.precision) then return To_Arbitrary(0, a.precision); end if; numerator := a; numerator.sign := 1; denominator := b; denominator.sign := 1; -- The result's exponent will be the numerator's exponent -- minus the denominators exponent temp := numerator.exponent - denominator.exponent; result.exponent := temp; -- Now adjust the denominator's exponent such that we start getting -- digits for the result immediately -- The first digits will arise when the numerator and denominator -- have the same exponent. Since the result's exponent has already -- been calcuated, we simply adjust the denominator denominator.exponent := numerator.exponent; Magnitude: for x in result.mantissa'range loop Digit_Count: while numerator >= denominator loop -- Note that numerator must always be normalized exit Magnitude when numerator.mantissa(numerator.mantissa'first) = 0; result.mantissa(x) := result.mantissa(x) + 1; numerator := numerator - denominator; end loop Digit_Count; denominator.exponent := denominator.exponent - 1; end loop Magnitude; result.sign := a.sign * b.sign; Normalize(result); return result; end "/"; end Arbitrary;

28.657729

74

0.525896

41b302324e0e2ab7a312223e42e7d122e7d6b16e

2,081

ads

Ada

source/tasking/machine-w64-mingw32/s-nattas.ads

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

33

2015-04-04T09:19:36.000Z

2021-11-10T05:33:34.000Z

source/tasking/machine-w64-mingw32/s-nattas.ads

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

8

2017-11-14T13:05:07.000Z

2018-08-09T15:28:49.000Z

source/tasking/machine-w64-mingw32/s-nattas.ads

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

9

2015-02-03T17:09:53.000Z

2021-11-12T01:16:05.000Z

pragma License (Unrestricted); -- implementation unit specialized for Windows with System.Synchronous_Objects; with C.winbase; with C.windef; with C.winnt; package System.Native_Tasks is pragma Preelaborate; -- thread subtype Handle_Type is C.winnt.HANDLE; function Current return Handle_Type renames C.winbase.GetCurrentThread; subtype Parameter_Type is C.windef.LPVOID; subtype Result_Type is C.windef.DWORD; subtype Thread_Body_Type is C.winbase.PTHREAD_START_ROUTINE; pragma Convention_Identifier (Thread_Body_CC, WINAPI); -- WINAPI is stdcall convention on 32bit, or C convention on 64bit. procedure Create ( Handle : aliased out Handle_Type; Parameter : Parameter_Type; Thread_Body : Thread_Body_Type; Error : out Boolean); procedure Join ( Handle : Handle_Type; -- of target thread Current_Abort_Event : access Synchronous_Objects.Event; Result : aliased out Result_Type; Error : out Boolean); procedure Detach ( Handle : in out Handle_Type; Error : out Boolean); -- stack function Info_Block (Handle : Handle_Type) return C.winnt.struct_TEB_ptr; -- signals type Abort_Handler is access procedure; pragma Favor_Top_Level (Abort_Handler); procedure Install_Abort_Handler (Handler : Abort_Handler); procedure Uninstall_Abort_Handler; pragma Inline (Install_Abort_Handler); pragma Inline (Uninstall_Abort_Handler); procedure Send_Abort_Signal ( Handle : Handle_Type; Abort_Event : in out Synchronous_Objects.Event; Error : out Boolean); procedure Resend_Abort_Signal (Handle : Handle_Type; Error : out Boolean) is null; pragma Inline (Resend_Abort_Signal); -- [gcc-7] can not skip calling null procedure procedure Block_Abort_Signal (Abort_Event : Synchronous_Objects.Event); procedure Unblock_Abort_Signal is null; pragma Inline (Unblock_Abort_Signal); -- [gcc-7] can not skip calling null procedure -- scheduling procedure Yield; end System.Native_Tasks;

27.746667

79

0.728015

0354da00ea7e1c48629019840910c710c36237f6

18,716

ads

Ada

3-mid/opengl/source/platform/osmesa/private/thin/swig-pointers.ads

charlie5/lace

e9b7dc751d500ff3f559617a6fc3089ace9dc134

[ "0BSD" ]

20

2015-11-04T09:23:59.000Z

2022-01-14T10:21:42.000Z

3-mid/opengl/source/platform/osmesa/private/thin/swig-pointers.ads

charlie5/lace-alire

9ace9682cf4daac7adb9f980c2868d6225b8111c

[ "0BSD" ]

2

2015-11-04T17:05:56.000Z

2015-12-08T03:16:13.000Z

3-mid/opengl/source/platform/osmesa/private/thin/swig-pointers.ads

charlie5/lace-alire

9ace9682cf4daac7adb9f980c2868d6225b8111c

[ "0BSD" ]

1

2015-12-07T12:53:52.000Z

with interfaces.C.Pointers, interfaces.C.Strings, system.Address_To_Access_Conversions; package swig.Pointers -- -- Contains pointers to Swig related C type definitions not found in the 'interfaces.C' family. -- is -- void_ptr -- package C_void_ptr_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => swig.void_ptr, element_Array => void_ptr_Array, default_Terminator => system.null_Address); subtype void_ptr_Pointer is C_void_ptr_Pointers.Pointer; -- opaque struct_ptr -- type opaque_structure_ptr is access swig.opaque_structure; type opaque_structure_ptr_array is array (interfaces.c.Size_t range <>) of aliased opaque_structure_ptr; package C_opaque_structure_ptr_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => opaque_structure_ptr, element_Array => opaque_structure_ptr_array, default_Terminator => null); subtype opaque_structure_ptr_Pointer is C_opaque_structure_ptr_Pointers.Pointer; -- incomplete class -- type incomplete_class_ptr is access swig.incomplete_class; type incomplete_class_ptr_array is array (interfaces.c.Size_t range <>) of aliased incomplete_class_ptr; package C_incomplete_class_ptr_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => incomplete_class_ptr, element_Array => incomplete_class_ptr_array, default_Terminator => null); subtype incomplete_class_ptr_Pointer is C_incomplete_class_ptr_Pointers.Pointer; -- bool* -- package c_bool_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => swig.bool, element_Array => bool_Array, default_Terminator => 0); subtype bool_Pointer is c_bool_Pointers.Pointer; type bool_Pointer_array is array (interfaces.c.Size_t range <>) of aliased bool_Pointer; -- bool** -- package C_bool_pointer_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => bool_Pointer, element_Array => bool_Pointer_array, default_Terminator => null); subtype bool_pointer_Pointer is C_bool_pointer_Pointers.Pointer; -- char* [] -- type chars_ptr_array is array (interfaces.c.Size_t range <>) of aliased interfaces.c.strings.chars_Ptr; -- standard Ada does not have 'aliased' package C_chars_ptr_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => interfaces.c.strings.chars_ptr, element_Array => chars_ptr_array, default_Terminator => interfaces.c.strings.Null_Ptr); subtype chars_ptr_Pointer is C_chars_ptr_Pointers.Pointer; -- char** [] -- type chars_ptr_Pointer_array is array (interfaces.c.Size_t range <>) of aliased chars_ptr_Pointer; package C_chars_ptr_pointer_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => chars_ptr_Pointer, element_Array => chars_ptr_Pointer_array, default_Terminator => null); subtype chars_ptr_pointer_Pointer is C_chars_ptr_pointer_Pointers.Pointer; -- wchar_t* -- package c_wchar_t_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => interfaces.c.wchar_t, element_Array => interfaces.c.wchar_array, default_Terminator => interfaces.c.wchar_t'First); subtype wchar_t_Pointer is c_wchar_t_Pointers.Pointer; -- signed char* -- package c_signed_char_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => interfaces.c.signed_Char, element_Array => swig.signed_char_Array, default_Terminator => 0); subtype signed_char_Pointer is c_signed_char_Pointers.Pointer; -- unsigned char* -- package c_unsigned_char_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => interfaces.c.unsigned_Char, element_Array => unsigned_char_Array, default_Terminator => 0); subtype unsigned_char_Pointer is c_unsigned_char_Pointers.Pointer; -- short* -- package c_short_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => interfaces.c.Short, element_Array => short_Array, default_Terminator => 0); subtype short_Pointer is c_short_Pointers.Pointer; -- unsigned short* -- package c_unsigned_short_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => interfaces.c.unsigned_Short, element_Array => unsigned_short_Array, default_Terminator => 0); subtype unsigned_short_Pointer is c_unsigned_short_Pointers.Pointer; -- int* -- package c_int_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => interfaces.c.Int, element_Array => int_Array, default_Terminator => 0); subtype int_Pointer is c_int_Pointers.Pointer; -- int** -- type int_pointer_Array is array (interfaces.c.size_t range <>) of aliased int_Pointer; package c_int_pointer_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => int_Pointer, element_Array => int_pointer_Array, default_Terminator => null); subtype int_pointer_Pointer is c_int_pointer_Pointers.Pointer; -- size_t* -- package c_size_t_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => interfaces.c.Size_t, element_Array => size_t_Array, default_Terminator => 0); subtype size_t_Pointer is c_size_t_Pointers.Pointer; -- unsigned* -- package c_unsigned_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => interfaces.c.Unsigned, element_Array => unsigned_Array, default_Terminator => 0); subtype unsigned_Pointer is c_unsigned_Pointers.Pointer; -- long* -- package c_long_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => interfaces.c.Long, element_Array => long_Array, default_Terminator => 0); subtype long_Pointer is c_long_Pointers.Pointer; -- unsigned long* -- package c_unsigned_long_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => interfaces.c.unsigned_Long, element_Array => unsigned_long_Array, default_Terminator => 0); subtype unsigned_long_Pointer is c_unsigned_long_Pointers.Pointer; -- long long* -- package c_long_long_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => swig.long_Long, element_Array => long_long_Array, default_Terminator => 0); subtype long_long_Pointer is c_long_long_Pointers.Pointer; -- unsigned long long* -- package c_unsigned_long_long_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => swig.unsigned_long_Long, element_Array => unsigned_long_long_Array, default_Terminator => 0); subtype unsigned_long_long_Pointer is c_unsigned_long_long_Pointers.Pointer; -- int8_t* -- package c_int8_t_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => swig.int8_t, element_Array => swig.int8_t_Array, default_Terminator => 0); subtype int8_t_Pointer is c_int8_t_Pointers.Pointer; -- int16_t* -- package c_int16_t_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => swig.int16_t, element_Array => swig.int16_t_Array, default_Terminator => 0); subtype int16_t_Pointer is c_int16_t_Pointers.Pointer; -- int32_t* -- package c_int32_t_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => swig.int32_t, element_Array => swig.int32_t_Array, default_Terminator => 0); subtype int32_t_Pointer is c_int32_t_Pointers.Pointer; -- int64_t* -- package c_int64_t_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => swig.int64_t, element_Array => swig.int64_t_Array, default_Terminator => 0); subtype int64_t_Pointer is c_int64_t_Pointers.Pointer; -- uint8_t*' -- package c_uint8_t_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => swig.uint8_t, element_Array => swig.uint8_t_Array, default_Terminator => 0); subtype uint8_t_Pointer is c_uint8_t_Pointers.Pointer; -- uint16_t*' -- package c_uint16_t_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => swig.uint16_t, element_Array => swig.uint16_t_Array, default_Terminator => 0); subtype uint16_t_Pointer is c_uint16_t_Pointers.Pointer; -- uint32_t*' -- package c_uint32_t_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => swig.uint32_t, element_Array => swig.uint32_t_Array, default_Terminator => 0); subtype uint32_t_Pointer is c_uint32_t_Pointers.Pointer; -- uint64_t*' -- package c_uint64_t_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => swig.uint64_t, element_Array => swig.uint64_t_Array, default_Terminator => 0); subtype uint64_t_Pointer is c_uint64_t_Pointers.Pointer; -- float*' package c_float_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => interfaces.c.c_Float, element_Array => float_Array, default_Terminator => 0.0); subtype float_Pointer is c_float_Pointers.Pointer; -- float** -- type float_pointer_Array is array (interfaces.C.size_t range <>) of aliased float_Pointer; package c_float_pointer_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => float_Pointer, element_Array => float_pointer_Array, default_Terminator => null); subtype float_pointer_Pointer is c_float_pointer_Pointers.Pointer; -- double*' -- package c_double_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => interfaces.c.Double, element_Array => double_Array, default_Terminator => 0.0); subtype double_Pointer is c_double_Pointers.Pointer; -- double** -- type double_pointer_Array is array (interfaces.C.size_t range <>) of aliased double_Pointer; package c_double_pointer_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => double_Pointer, element_Array => double_pointer_Array, default_Terminator => null); subtype double_pointer_Pointer is c_double_pointer_Pointers.Pointer; -- long double*' -- package c_long_double_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => interfaces.c.long_Double, element_Array => long_double_Array, default_Terminator => 0.0); subtype long_double_Pointer is c_long_double_Pointers.Pointer; -- long double** -- type long_double_pointer_Array is array (interfaces.C.size_t range <>) of aliased long_double_Pointer; package c_long_double_pointer_Pointers is new interfaces.c.Pointers (Index => interfaces.c.size_t, Element => long_double_Pointer, element_Array => long_double_pointer_Array, default_Terminator => null); subtype long_double_pointer_Pointer is c_long_double_pointer_Pointers.Pointer; -- std::string -- type std_string is private; type std_string_Pointer is access all std_String; type std_string_Array is array (interfaces.c.size_t range <>) of aliased std_String; -- Utility -- package void_Conversions is new system.Address_To_Access_Conversions (swig.Void); private type std_String is record M_dataplus : swig.void_ptr; -- which is a subtype of system.Address end record; end Swig.Pointers; -- tbd: use sensible default_Terminator's.

50.720867

148

0.458378

9aba1e347072929bb64b70af2387f54251e417cd

7,210

ads

Ada

source/amf/mof/cmof/amf-internals-cmof_parameters.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/mof/cmof/amf-internals-cmof_parameters.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/mof/cmof/amf-internals-cmof_parameters.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$ ------------------------------------------------------------------------------ with AMF.CMOF.Elements.Collections; with AMF.CMOF.Multiplicity_Elements; with AMF.CMOF.Named_Elements; with AMF.CMOF.Namespaces; with AMF.CMOF.Operations; with AMF.CMOF.Parameters; with AMF.Internals.CMOF_Named_Elements; with AMF.Internals.CMOF_Multiplicity_Elements; pragma Elaborate (AMF.Internals.CMOF_Multiplicity_Elements); with AMF.Internals.CMOF_Typed_Elements; pragma Elaborate (AMF.Internals.CMOF_Typed_Elements); with AMF.Visitors; package AMF.Internals.CMOF_Parameters is package Multiplicity_Elements is new AMF.Internals.CMOF_Multiplicity_Elements (AMF.Internals.CMOF_Named_Elements.CMOF_Named_Element_Proxy); package Typed_Elements is new AMF.Internals.CMOF_Typed_Elements (Multiplicity_Elements.CMOF_Multiplicity_Element_Proxy); type CMOF_Parameter_Proxy is limited new Typed_Elements.CMOF_Typed_Element_Proxy and AMF.CMOF.Parameters.CMOF_Parameter with null record; -- XXX These subprograms are stubs overriding function All_Owned_Elements (Self : not null access constant CMOF_Parameter_Proxy) return AMF.CMOF.Elements.Collections.Set_Of_CMOF_Element; overriding procedure Set_Is_Unique (Self : not null access CMOF_Parameter_Proxy; To : Boolean); overriding function Includes_Multiplicity (Self : not null access constant CMOF_Parameter_Proxy; M : AMF.CMOF.Multiplicity_Elements.CMOF_Multiplicity_Element_Access) return Boolean; overriding function Includes_Cardinality (Self : not null access constant CMOF_Parameter_Proxy; C : Integer) return Boolean; overriding function Get_Qualified_Name (Self : not null access constant CMOF_Parameter_Proxy) return Optional_String; overriding function Is_Distinguishable_From (Self : not null access constant CMOF_Parameter_Proxy; N : AMF.CMOF.Named_Elements.CMOF_Named_Element_Access; Ns : AMF.CMOF.Namespaces.CMOF_Namespace_Access) return Boolean; overriding function Get_Default (Self : not null access constant CMOF_Parameter_Proxy) return Optional_String; overriding procedure Set_Default (Self : not null access CMOF_Parameter_Proxy; To : Optional_String); overriding function Get_Direction (Self : not null access constant CMOF_Parameter_Proxy) return CMOF.CMOF_Parameter_Direction_Kind; overriding procedure Set_Direction (Self : not null access CMOF_Parameter_Proxy; To : CMOF.CMOF_Parameter_Direction_Kind); overriding function Get_Operation (Self : not null access constant CMOF_Parameter_Proxy) return AMF.CMOF.Operations.CMOF_Operation_Access; -- Getter of Parameter::operation. -- -- References the Operation owning this parameter. overriding procedure Set_Operation (Self : not null access CMOF_Parameter_Proxy; To : AMF.CMOF.Operations.CMOF_Operation_Access); overriding procedure Enter_Element (Self : not null access constant CMOF_Parameter_Proxy; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control); -- Dispatch call to corresponding subprogram of visitor interface. overriding procedure Leave_Element (Self : not null access constant CMOF_Parameter_Proxy; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control); -- Dispatch call to corresponding subprogram of visitor interface. overriding procedure Visit_Element (Self : not null access constant CMOF_Parameter_Proxy; Iterator : in out AMF.Visitors.Abstract_Iterator'Class; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control); -- Dispatch call to corresponding subprogram of iterator interface. end AMF.Internals.CMOF_Parameters;

48.389262

78

0.592372

030c85e3ab544ca2d37e1fe3829dd078c3b464f7

2,709

ads

Ada

src/zmq-pollsets.ads

persan/zeromq-Ada

651ca44cce831c2d717338eab65a60fbfca7ec44

[ "MIT" ]

33

2015-01-16T13:42:55.000Z

2021-11-30T21:28:50.000Z

src/zmq-pollsets.ads

persan/zeromq-Ada

651ca44cce831c2d717338eab65a60fbfca7ec44

[ "MIT" ]

6

2016-03-23T01:26:36.000Z

2021-05-13T04:24:53.000Z

src/zmq-pollsets.ads

persan/zeromq-Ada

651ca44cce831c2d717338eab65a60fbfca7ec44

[ "MIT" ]

5

2016-03-09T20:20:09.000Z

2020-06-17T06:59:39.000Z

------------------------------------------------------------------------------- -- Copyright (C) 2020-2030, [email protected] -- -- -- -- Permission is hereby granted, free of charge, to any person obtaining a -- -- copy of this software and associated documentation files -- -- (the "Software"), to deal in the Software without restriction, including -- -- without limitation the rights to use, copy, modify, merge, publish, -- -- distribute, sublicense, and / or sell copies of the Software, and to -- -- permit persons to whom the Software is furnished to do so, subject to -- -- the following conditions : -- -- -- -- The above copyright notice and this permission notice shall be included -- -- in all copies or substantial portions of the Software. -- -- -- -- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -- -- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -- -- MERCHANTABILITY, -- -- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL -- -- THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR -- -- OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, -- -- ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR -- -- OTHER DEALINGS IN THE SOFTWARE. -- ------------------------------------------------------------------------------- with ZMQ.Sockets; with ZMQ.Low_Level; package ZMQ.Pollsets is pragma Elaborate_Body; type Pollitem is tagged record Socket : access ZMQ.Sockets.Socket; -- fd : aliased int; -- events : aliased short; -- revents : aliased short; end record; type Pollset (Max_Size : Natural := 32) is tagged limited private; procedure Append (This : in out Pollset; Item : Pollitem'Class); procedure Remove (This : in out Pollset; Item : Pollitem'Class); procedure Poll (This : in out Pollset; Timeout : Duration); private type Ll_Polset is array (Natural range <>) of aliased ZMQ.Low_Level.zmq_pollitem_t; type Pollset (Max_Size : Natural := 32) is tagged limited record Local_Data : aliased Ll_Polset (1 .. Max_Size); Cursor : Natural := 1; end record; end ZMQ.Pollsets;

54.18

79

0.528608

1ec87785ab0b11cb8abe97d63f6035a2e6bc2066

3,227

ads

Ada

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-pack23.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-pack23.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-pack23.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . P A C K _ 2 3 -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2021, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- -- -- -- -- -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- Handling of packed arrays with Component_Size = 23 package System.Pack_23 is pragma Preelaborate; Bits : constant := 23; type Bits_23 is mod 2 ** Bits; for Bits_23'Size use Bits; -- In all subprograms below, Rev_SSO is set True if the array has the -- non-default scalar storage order. function Get_23 (Arr : System.Address; N : Natural; Rev_SSO : Boolean) return Bits_23 with Inline; -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is extracted and returned. procedure Set_23 (Arr : System.Address; N : Natural; E : Bits_23; Rev_SSO : Boolean) with Inline; -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is set to the given value. end System.Pack_23;

52.901639

78

0.388286

1e74ff8c6e0bffc5a80b1291722335c2ef1615ae

2,707

ads

Ada

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-sestin.ads

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-sestin.ads

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-sestin.ads

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- G N A T . S E C O N D A R Y _ S T A C K _ I N F O -- -- -- -- S p e c -- -- -- -- Copyright (C) 2004-2020, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package provides facilities for obtaining information on secondary -- stack usage. See System.Secondary_Stack for documentation. with System.Secondary_Stack; package GNAT.Secondary_Stack_Info is function SS_Get_Max return Long_Long_Integer renames System.Secondary_Stack.SS_Get_Max; end GNAT.Secondary_Stack_Info;

62.953488

78

0.418914

2fbe11bddd4ac7bdf841c4fb0d18f64196c60525

2,555

ads

Ada

src/ado-sequences-hilo.ads

Letractively/ada-ado

f0863c6975ae1a2c5349daee1e98a04fe11ba11e

[ "Apache-2.0" ]

null

src/ado-sequences-hilo.ads

Letractively/ada-ado

f0863c6975ae1a2c5349daee1e98a04fe11ba11e

[ "Apache-2.0" ]

null

src/ado-sequences-hilo.ads

Letractively/ada-ado

f0863c6975ae1a2c5349daee1e98a04fe11ba11e

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- ADO Sequences Hilo-- HiLo Database sequence generator -- Copyright (C) 2009, 2010, 2011, 2012 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- -- The HiLo sequence generator. This sequence generator uses a database table -- sequence to allocate blocks of identifiers for a given sequence name. -- The sequence table contains one row for each sequence. It keeps track of -- the next available sequence identifier (in the value column). -- -- To allocate a sequence block, the HiLo generator obtains the next available -- sequence identified and updates it by adding the sequence block size. The -- HiLo sequence generator will allocate the identifiers until the block is -- full after which a new block will be allocated. package ADO.Sequences.Hilo is -- ------------------------------ -- High Low sequence generator -- ------------------------------ type HiLoGenerator is new Generator with private; DEFAULT_BLOCK_SIZE : constant Identifier := 100; -- Allocate an identifier using the generator. -- The generator allocates blocks of sequences by using a sequence -- table stored in the database. One database access is necessary -- every N allocations. overriding procedure Allocate (Gen : in out HiLoGenerator; Id : in out Objects.Object_Record'Class); -- Allocate a new sequence block. procedure Allocate_Sequence (Gen : in out HiLoGenerator); function Create_HiLo_Generator (Sess_Factory : in Session_Factory_Access) return Generator_Access; private type HiLoGenerator is new Generator with record Last_Id : Identifier := NO_IDENTIFIER; Next_Id : Identifier := NO_IDENTIFIER; Block_Size : Identifier := DEFAULT_BLOCK_SIZE; end record; end ADO.Sequences.Hilo;

41.209677

80

0.668102

9aef052bdec76e86b34dfd961064cdf0c54d836e

411

adb

Ada

project/adl/testsuite/tests/hexdump/src/tc_hexdump.adb

corentingay/adaboy

68f08afa246c8255a42897376d375edcb4e2efc2

[ "MIT" ]

null

project/adl/testsuite/tests/hexdump/src/tc_hexdump.adb

corentingay/adaboy

68f08afa246c8255a42897376d375edcb4e2efc2

[ "MIT" ]

null

project/adl/testsuite/tests/hexdump/src/tc_hexdump.adb

corentingay/adaboy

68f08afa246c8255a42897376d375edcb4e2efc2

[ "MIT" ]

null

with Ada.Text_IO; use Ada.Text_IO; with HAL; use HAL; with Hex_Dump; procedure TC_Hexdump is Data : UInt8_Array (1 .. 650); Cnt : UInt8 := 0; begin for Elt of Data loop Elt := Cnt; Cnt := Cnt + 1; end loop; Hex_Dump.Hex_Dump (Data => Data, Put_Line => Ada.Text_IO.Put_Line'Access, Base_Addr => 16#1_0000#); end TC_Hexdump;

20.55

62

0.554745

a0552ad0862b49f924044d7b0b3a60bb1683824d

7,416

ads

Ada

arch/ARM/STM32/svd/stm32f103/stm32_svd-rtc.ads

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

2

2018-05-16T03:56:39.000Z

2019-07-31T13:53:56.000Z

arch/ARM/STM32/svd/stm32f103/stm32_svd-rtc.ads

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

null

arch/ARM/STM32/svd/stm32f103/stm32_svd-rtc.ads

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

null

-- This spec has been automatically generated from STM32F103.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with HAL; with System; package STM32_SVD.RTC is pragma Preelaborate; --------------- -- Registers -- --------------- -- RTC Control Register High type CRH_Register is record -- Second interrupt Enable SECIE : Boolean := False; -- Alarm interrupt Enable ALRIE : Boolean := False; -- Overflow interrupt Enable OWIE : Boolean := False; -- unspecified Reserved_3_31 : HAL.UInt29 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CRH_Register use record SECIE at 0 range 0 .. 0; ALRIE at 0 range 1 .. 1; OWIE at 0 range 2 .. 2; Reserved_3_31 at 0 range 3 .. 31; end record; -- RTC Control Register Low type CRL_Register is record -- Second Flag SECF : Boolean := False; -- Alarm Flag ALRF : Boolean := False; -- Overflow Flag OWF : Boolean := False; -- Registers Synchronized Flag RSF : Boolean := False; -- Configuration Flag CNF : Boolean := False; -- Read-only. RTC operation OFF RTOFF : Boolean := True; -- unspecified Reserved_6_31 : HAL.UInt26 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CRL_Register use record SECF at 0 range 0 .. 0; ALRF at 0 range 1 .. 1; OWF at 0 range 2 .. 2; RSF at 0 range 3 .. 3; CNF at 0 range 4 .. 4; RTOFF at 0 range 5 .. 5; Reserved_6_31 at 0 range 6 .. 31; end record; subtype PRLH_PRLH_Field is HAL.UInt4; -- RTC Prescaler Load Register High type PRLH_Register is record -- Write-only. RTC Prescaler Load Register High PRLH : PRLH_PRLH_Field := 16#0#; -- unspecified Reserved_4_31 : HAL.UInt28 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for PRLH_Register use record PRLH at 0 range 0 .. 3; Reserved_4_31 at 0 range 4 .. 31; end record; subtype PRLL_PRLL_Field is HAL.UInt16; -- RTC Prescaler Load Register Low type PRLL_Register is record -- Write-only. RTC Prescaler Divider Register Low PRLL : PRLL_PRLL_Field := 16#8000#; -- unspecified Reserved_16_31 : HAL.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for PRLL_Register use record PRLL at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype DIVH_DIVH_Field is HAL.UInt4; -- RTC Prescaler Divider Register High type DIVH_Register is record -- Read-only. RTC prescaler divider register high DIVH : DIVH_DIVH_Field; -- unspecified Reserved_4_31 : HAL.UInt28; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for DIVH_Register use record DIVH at 0 range 0 .. 3; Reserved_4_31 at 0 range 4 .. 31; end record; subtype DIVL_DIVL_Field is HAL.UInt16; -- RTC Prescaler Divider Register Low type DIVL_Register is record -- Read-only. RTC prescaler divider register Low DIVL : DIVL_DIVL_Field; -- unspecified Reserved_16_31 : HAL.UInt16; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for DIVL_Register use record DIVL at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype CNTH_CNTH_Field is HAL.UInt16; -- RTC Counter Register High type CNTH_Register is record -- RTC counter register high CNTH : CNTH_CNTH_Field := 16#0#; -- unspecified Reserved_16_31 : HAL.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CNTH_Register use record CNTH at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype CNTL_CNTL_Field is HAL.UInt16; -- RTC Counter Register Low type CNTL_Register is record -- RTC counter register Low CNTL : CNTL_CNTL_Field := 16#0#; -- unspecified Reserved_16_31 : HAL.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CNTL_Register use record CNTL at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype ALRH_ALRH_Field is HAL.UInt16; -- RTC Alarm Register High type ALRH_Register is record -- Write-only. RTC alarm register high ALRH : ALRH_ALRH_Field := 16#FFFF#; -- unspecified Reserved_16_31 : HAL.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for ALRH_Register use record ALRH at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype ALRL_ALRL_Field is HAL.UInt16; -- RTC Alarm Register Low type ALRL_Register is record -- Write-only. RTC alarm register low ALRL : ALRL_ALRL_Field := 16#FFFF#; -- unspecified Reserved_16_31 : HAL.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for ALRL_Register use record ALRL at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Real time clock type RTC_Peripheral is record -- RTC Control Register High CRH : aliased CRH_Register; -- RTC Control Register Low CRL : aliased CRL_Register; -- RTC Prescaler Load Register High PRLH : aliased PRLH_Register; -- RTC Prescaler Load Register Low PRLL : aliased PRLL_Register; -- RTC Prescaler Divider Register High DIVH : aliased DIVH_Register; -- RTC Prescaler Divider Register Low DIVL : aliased DIVL_Register; -- RTC Counter Register High CNTH : aliased CNTH_Register; -- RTC Counter Register Low CNTL : aliased CNTL_Register; -- RTC Alarm Register High ALRH : aliased ALRH_Register; -- RTC Alarm Register Low ALRL : aliased ALRL_Register; end record with Volatile; for RTC_Peripheral use record CRH at 16#0# range 0 .. 31; CRL at 16#4# range 0 .. 31; PRLH at 16#8# range 0 .. 31; PRLL at 16#C# range 0 .. 31; DIVH at 16#10# range 0 .. 31; DIVL at 16#14# range 0 .. 31; CNTH at 16#18# range 0 .. 31; CNTL at 16#1C# range 0 .. 31; ALRH at 16#20# range 0 .. 31; ALRL at 16#24# range 0 .. 31; end record; -- Real time clock RTC_Periph : aliased RTC_Peripheral with Import, Address => System'To_Address (16#40002800#); end STM32_SVD.RTC;

29.545817

65

0.595874

225db2184086f0431341d93a06f02ea3900ea7d9

4,561

ads

Ada

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-cbsyqu.ads

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-cbsyqu.ads

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-cbsyqu.ads

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- ADA.CONTAINERS.BOUNDED_SYNCHRONIZED_QUEUES -- -- -- -- S p e c -- -- -- -- Copyright (C) 2011-2020, Free Software Foundation, Inc. -- -- -- -- This specification is derived from the Ada Reference Manual for use with -- -- GNAT. The copyright notice above, and the license provisions that follow -- -- apply solely to the contents of the part following the private keyword. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- This unit was originally developed by Matthew J Heaney. -- ------------------------------------------------------------------------------ with System; with Ada.Containers.Synchronized_Queue_Interfaces; generic with package Queue_Interfaces is new Ada.Containers.Synchronized_Queue_Interfaces (<>); Default_Capacity : Count_Type; Default_Ceiling : System.Any_Priority := System.Priority'Last; package Ada.Containers.Bounded_Synchronized_Queues with SPARK_Mode => Off is pragma Annotate (CodePeer, Skip_Analysis); pragma Preelaborate; package Implementation is -- All identifiers in this unit are implementation defined pragma Implementation_Defined; type List_Type (Capacity : Count_Type) is tagged limited private; procedure Enqueue (List : in out List_Type; New_Item : Queue_Interfaces.Element_Type); procedure Dequeue (List : in out List_Type; Element : out Queue_Interfaces.Element_Type); function Length (List : List_Type) return Count_Type; function Max_Length (List : List_Type) return Count_Type; private -- Need proper heap data structure here ??? type Element_Array is array (Count_Type range <>) of Queue_Interfaces.Element_Type; type List_Type (Capacity : Count_Type) is tagged limited record First, Last : Count_Type := 0; Length : Count_Type := 0; Max_Length : Count_Type := 0; Elements : Element_Array (1 .. Capacity); end record; end Implementation; protected type Queue (Capacity : Count_Type := Default_Capacity; Ceiling : System.Any_Priority := Default_Ceiling) with Priority => Ceiling is new Queue_Interfaces.Queue with overriding entry Enqueue (New_Item : Queue_Interfaces.Element_Type); overriding entry Dequeue (Element : out Queue_Interfaces.Element_Type); overriding function Current_Use return Count_Type; overriding function Peak_Use return Count_Type; private List : Implementation.List_Type (Capacity); end Queue; end Ada.Containers.Bounded_Synchronized_Queues;

43.028302

78

0.532778

8bd0554bf4d381ee9bfa8f9e3e22584caea526f8

1,674

adb

Ada

university/language-concepts-labs/8/ada/flow.adb

honno/code-solutions

48bba6aa5b9d77ac628de484357459e7bfb92d4b

[ "MIT" ]

null

university/language-concepts-labs/8/ada/flow.adb

honno/code-solutions

48bba6aa5b9d77ac628de484357459e7bfb92d4b

[ "MIT" ]

null

university/language-concepts-labs/8/ada/flow.adb

honno/code-solutions

48bba6aa5b9d77ac628de484357459e7bfb92d4b

[ "MIT" ]

null

with Ada.Integer_Text_IO; use Ada.Integer_Text_IO; with Ada.Float_Text_IO; use Ada.Float_Text_IO; with Text_IO; use Text_IO; procedure Flow is function Distance(Flow1 : Float; Flow2 : Float) return Float is begin return abs(Flow1 - Flow2); end Distance; -- AdjustDistance attempts to change the values -- of the parameters if they are quite close together -- so that they are more apart. -- Nevertheless, the sum of the values stays the same. procedure AdjustDistance (Flow1 : in out Float; Flow2 : in out Float) is begin if Distance(Flow1,Flow2) < 10.0 then if Flow1 > Flow2 then Flow2 := Flow2 / 3.0; Flow1 := Flow1 + Flow2; Flow1 := Flow1 + Flow2; else Flow1 := Flow1 / 3.0; Flow2 := Flow2 + Flow1; Flow2 := Flow2 + Flow1; end if; end if; end AdjustDistance; begin declare F1, F2, F3 : Float; procedure Put_F1F2F3 is begin Put("F1 = "); Put(F1,0,2,0); Put("; F2 = "); Put(F2,0,2,0); Put("; F3 = "); Put(F3,0,2,0); Put_Line(""); end Put_F1F2F3; begin F1 := 3.0; F2 := 3.0; F3 := 3.0; -- test the AdjustDistance procedure: Put_F1F2F3; AdjustDistance(F1, F2); Put_F1F2F3; AdjustDistance(F2, F3); Put_F1F2F3; AdjustDistance(F3, F3); -- this looks bad...what actually happens? Put_F1F2F3; end; end Flow;

24.26087

74

0.510753

03a062fa91c7bca9b28d50211d9f15295a97e33b

12,765

ads

Ada

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-dirope.ads

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-dirope.ads

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-dirope.ads

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- G N A T . D I R E C T O R Y _ O P E R A T I O N S -- -- -- -- S p e c -- -- -- -- Copyright (C) 1998-2020, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- Directory operations -- This package provides routines for manipulating directories. A directory -- can be treated as a file, using open and close routines, and a scanning -- routine is provided for iterating through the entries in a directory. -- See also child package GNAT.Directory_Operations.Iteration with System; with Ada.Strings.Maps; package GNAT.Directory_Operations is subtype Dir_Name_Str is String; -- A subtype used in this package to represent string values that are -- directory names. A directory name is a prefix for files that appear -- with in the directory. This means that for UNIX systems, the string -- includes a final '/', and for DOS-like systems, it includes a final -- '\' character. It can also include drive letters if the operating -- system provides for this. The final '/' or '\' in a Dir_Name_Str is -- optional when passed as a procedure or function in parameter. type Dir_Type is limited private; -- A value used to reference a directory. Conceptually this value includes -- the identity of the directory, and a sequential position within it. Null_Dir : constant Dir_Type; -- Represent the value for an uninitialized or closed directory Directory_Error : exception; -- Exception raised if the directory cannot be opened, read, closed, -- created or if it is not possible to change the current execution -- environment directory. Dir_Separator : constant Character; -- Running system default directory separator -------------------------------- -- Basic Directory operations -- -------------------------------- procedure Change_Dir (Dir_Name : Dir_Name_Str); -- Changes the working directory of the current execution environment -- to the directory named by Dir_Name. Raises Directory_Error if Dir_Name -- does not exist. procedure Make_Dir (Dir_Name : Dir_Name_Str); -- Create a new directory named Dir_Name. Raises Directory_Error if -- Dir_Name cannot be created. procedure Remove_Dir (Dir_Name : Dir_Name_Str; Recursive : Boolean := False); -- Remove the directory named Dir_Name. If Recursive is set to True, then -- Remove_Dir removes all the subdirectories and files that are in -- Dir_Name. Raises Directory_Error if Dir_Name cannot be removed. function Get_Current_Dir return Dir_Name_Str; -- Returns the current working directory for the execution environment procedure Get_Current_Dir (Dir : out Dir_Name_Str; Last : out Natural); -- Returns the current working directory for the execution environment -- The name is returned in Dir_Name. Last is the index in Dir_Name such -- that Dir_Name (Last) is the last character written. If Dir_Name is -- too small for the directory name, the name will be truncated before -- being copied to Dir_Name. ------------------------- -- Pathname Operations -- ------------------------- subtype Path_Name is String; -- All routines using Path_Name handle both styles (UNIX and DOS) of -- directory separators (either slash or back slash). function Dir_Name (Path : Path_Name) return Dir_Name_Str; -- Returns directory name for Path. This is similar to the UNIX dirname -- command. Everything after the last directory separator is removed. If -- there is no directory separator the current working directory is -- returned. Note that the contents of Path is case-sensitive on -- systems that have case-sensitive file names (like Unix), and -- non-case-sensitive on systems where the file system is also non- -- case-sensitive (such as Windows). function Base_Name (Path : Path_Name; Suffix : String := "") return String; -- Any directory prefix is removed. A directory prefix is defined as -- text up to and including the last directory separator character in -- the input string. In addition if Path ends with the string given for -- Suffix, then it is also removed. Note that Suffix here can be an -- arbitrary string (it is not required to be a file extension). This -- is equivalent to the UNIX basename command. The following rule is -- always true: -- -- 'Path' and 'Dir_Name (Path) & Dir_Separator & Base_Name (Path)' -- represent the same file. -- -- The comparison of Suffix is case-insensitive on systems like Windows -- where the file search is case-insensitive (e.g. on such systems, -- Base_Name ("/Users/AdaCore/BB12.patch", ".Patch") returns "BB12"). -- -- Note that the index bounds of the result match the corresponding indexes -- in the Path string (you cannot assume that the lower bound of the -- returned string is one). function File_Extension (Path : Path_Name) return String; -- Return the file extension. This is defined as the string after the -- last dot, including the dot itself. For example, if the file name -- is "file1.xyz.adq", then the returned value would be ".adq". If no -- dot is present in the file name, or the last character of the file -- name is a dot, then the null string is returned. function File_Name (Path : Path_Name) return String; -- Returns the file name and the file extension if present. It removes all -- path information. This is equivalent to Base_Name with default Extension -- value. type Path_Style is (UNIX, DOS, System_Default); function Format_Pathname (Path : Path_Name; Style : Path_Style := System_Default) return Path_Name; -- Removes all double directory separator and converts all '\' to '/' if -- Style is UNIX and converts all '/' to '\' if Style is set to DOS. This -- function will help to provide a consistent naming scheme running for -- different environments. If style is set to System_Default the routine -- will use the default directory separator on the running environment. -- -- The Style argument indicates the syntax to be used for path names: -- -- DOS -- Use '\' as the directory separator (default on Windows) -- -- UNIX -- Use '/' as the directory separator (default on all other systems) -- -- System_Default -- Use the default style for the current system type Environment_Style is (UNIX, DOS, Both, System_Default); function Expand_Path (Path : Path_Name; Mode : Environment_Style := System_Default) return Path_Name; -- Returns Path with environment variables replaced by the current -- environment variable value. For example, $HOME/mydir will be replaced -- by /home/joe/mydir if $HOME environment variable is set to /home/joe and -- Mode is UNIX. If an environment variable does not exist the variable -- will be replaced by the empty string. Two dollar or percent signs are -- replaced by a single dollar/percent sign. Note that a variable must -- start with a letter. -- -- The Mode argument indicates the recognized syntax for environment -- variables as follows: -- -- UNIX -- Environment variables use $ as prefix and can use curly brackets -- as in ${HOME}/mydir. If there is no closing curly bracket for an -- opening one then no translation is done, so for example ${VAR/toto -- is returned as ${VAR/toto. The use of {} brackets is required if -- the environment variable name contains other than alphanumeric -- characters. -- -- DOS -- Environment variables uses % as prefix and suffix (e.g. %HOME%/dir). -- The name DOS refer to "DOS-like" environment. This includes all -- Windows systems. -- -- Both -- Recognize both forms described above. -- -- System_Default -- Uses either DOS on Windows, and UNIX on all other systems, depending -- on the running environment. --------------- -- Iterators -- --------------- procedure Open (Dir : out Dir_Type; Dir_Name : Dir_Name_Str); -- Opens the directory named by Dir_Name and returns a Dir_Type value -- that refers to this directory, and is positioned at the first entry. -- Raises Directory_Error if Dir_Name cannot be accessed. In that case -- Dir will be set to Null_Dir. procedure Close (Dir : in out Dir_Type); -- Closes the directory stream referred to by Dir. After calling Close -- Is_Open will return False. Dir will be set to Null_Dir. -- Raises Directory_Error if Dir has not be opened (Dir = Null_Dir). function Is_Open (Dir : Dir_Type) return Boolean; -- Returns True if Dir is open, or False otherwise procedure Read (Dir : Dir_Type; Str : out String; Last : out Natural); -- Reads the next entry from the directory and sets Str to the name -- of that entry. Last is the index in Str such that Str (Last) is the -- last character written. Last is 0 when there are no more files in the -- directory. If Str is too small for the file name, the file name will -- be truncated before being copied to Str. The list of files returned -- includes directories in systems providing a hierarchical directory -- structure, including . (the current directory) and .. (the parent -- directory) in systems providing these entries. The directory is -- returned in target-OS form. Raises Directory_Error if Dir has not -- be opened (Dir = Null_Dir). function Read_Is_Thread_Safe return Boolean; -- Indicates if procedure Read is thread safe. On systems where the -- target system supports this functionality, Read is thread safe, -- and this function returns True (e.g. this will be the case on any -- UNIX or UNIX-like system providing a correct implementation of the -- function readdir_r). If the system cannot provide a thread safe -- implementation of Read, then this function returns False. private type Dir_Type_Value is new System.Address; -- Low-level address directory structure as returned by opendir in C type Dir_Type is access Dir_Type_Value; Null_Dir : constant Dir_Type := null; pragma Import (C, Dir_Separator, "__gnat_dir_separator"); Dir_Seps : constant Ada.Strings.Maps.Character_Set := Ada.Strings.Maps.To_Set ("/\"); -- UNIX and DOS style directory separators end GNAT.Directory_Operations;

48.536122

79

0.630396

1e74d628c6dce07d80cfc0f5afc36064bcbe87a3

2,523

adb

Ada

tests/secretbox.adb

yannickmoy/SPARKNaCl

c27fa811bf38b3706c1dc242f30e82967ad8f1c6

[ "BSD-2-Clause" ]

null

tests/secretbox.adb

yannickmoy/SPARKNaCl

c27fa811bf38b3706c1dc242f30e82967ad8f1c6

[ "BSD-2-Clause" ]

null

tests/secretbox.adb

yannickmoy/SPARKNaCl

c27fa811bf38b3706c1dc242f30e82967ad8f1c6

[ "BSD-2-Clause" ]

null

with SPARKNaCl; use SPARKNaCl; with SPARKNaCl.Core; use SPARKNaCl.Core; with SPARKNaCl.Debug; use SPARKNaCl.Debug; with SPARKNaCl.Secretbox; use SPARKNaCl.Secretbox; with SPARKNaCl.Stream; with Ada.Text_IO; use Ada.Text_IO; procedure Secretbox is Firstkey : constant Core.Salsa20_Key := Construct ((16#1b#, 16#27#, 16#55#, 16#64#, 16#73#, 16#e9#, 16#85#, 16#d4#, 16#62#, 16#cd#, 16#51#, 16#19#, 16#7a#, 16#9a#, 16#46#, 16#c7#, 16#60#, 16#09#, 16#54#, 16#9e#, 16#ac#, 16#64#, 16#74#, 16#f2#, 16#06#, 16#c4#, 16#ee#, 16#08#, 16#44#, 16#f6#, 16#83#, 16#89#)); Nonce : constant Stream.HSalsa20_Nonce := (16#69#, 16#69#, 16#6e#, 16#e9#, 16#55#, 16#b6#, 16#2b#, 16#73#, 16#cd#, 16#62#, 16#bd#, 16#a8#, 16#75#, 16#fc#, 16#73#, 16#d6#, 16#82#, 16#19#, 16#e0#, 16#03#, 16#6b#, 16#7a#, 16#0b#, 16#37#); M : constant Byte_Seq (0 .. 162) := (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16#be#, 16#07#, 16#5f#, 16#c5#, 16#3c#, 16#81#, 16#f2#, 16#d5#, 16#cf#, 16#14#, 16#13#, 16#16#, 16#eb#, 16#eb#, 16#0c#, 16#7b#, 16#52#, 16#28#, 16#c5#, 16#2a#, 16#4c#, 16#62#, 16#cb#, 16#d4#, 16#4b#, 16#66#, 16#84#, 16#9b#, 16#64#, 16#24#, 16#4f#, 16#fc#, 16#e5#, 16#ec#, 16#ba#, 16#af#, 16#33#, 16#bd#, 16#75#, 16#1a#, 16#1a#, 16#c7#, 16#28#, 16#d4#, 16#5e#, 16#6c#, 16#61#, 16#29#, 16#6c#, 16#dc#, 16#3c#, 16#01#, 16#23#, 16#35#, 16#61#, 16#f4#, 16#1d#, 16#b6#, 16#6c#, 16#ce#, 16#31#, 16#4a#, 16#db#, 16#31#, 16#0e#, 16#3b#, 16#e8#, 16#25#, 16#0c#, 16#46#, 16#f0#, 16#6d#, 16#ce#, 16#ea#, 16#3a#, 16#7f#, 16#a1#, 16#34#, 16#80#, 16#57#, 16#e2#, 16#f6#, 16#55#, 16#6a#, 16#d6#, 16#b1#, 16#31#, 16#8a#, 16#02#, 16#4a#, 16#83#, 16#8f#, 16#21#, 16#af#, 16#1f#, 16#de#, 16#04#, 16#89#, 16#77#, 16#eb#, 16#48#, 16#f5#, 16#9f#, 16#fd#, 16#49#, 16#24#, 16#ca#, 16#1c#, 16#60#, 16#90#, 16#2e#, 16#52#, 16#f0#, 16#a0#, 16#89#, 16#bc#, 16#76#, 16#89#, 16#70#, 16#40#, 16#e0#, 16#82#, 16#f9#, 16#37#, 16#76#, 16#38#, 16#48#, 16#64#, 16#5e#, 16#07#, 16#05#); C : Byte_Seq (0 .. 162); S : Boolean; begin Create (C, S, M, Nonce, Firstkey); Put_Line ("Status is " & S'Img); DH ("C is", C); end Secretbox;

45.872727

70

0.460563

418db6db6350e38f3b0101c2975d625d42b22f2a

16,711

adb

Ada

src/adabasexclient.adb

ray2501/AdaBaseXClient

016641d451a02015ca73cb25c5e9458f17b3904d

[ "MIT" ]

null

src/adabasexclient.adb

ray2501/AdaBaseXClient

016641d451a02015ca73cb25c5e9458f17b3904d

[ "MIT" ]

null

src/adabasexclient.adb

ray2501/AdaBaseXClient

016641d451a02015ca73cb25c5e9458f17b3904d

[ "MIT" ]

1

2021-07-08T01:14:51.000Z

---------------------------------------------------------------------------- -- -- Ada client for BaseX -- ---------------------------------------------------------------------------- with Ada.Strings; with Ada.Strings.Fixed; with Ada.Strings.Maps; with Ada.Exceptions; with Ada.Streams; with GNAT.MD5; package body AdaBaseXClient is use Ada.Strings.Unbounded; use Ada.Exceptions; use GNAT.Sockets; -- -- Inserts a document in the database at the specified path -- function Add (Path : String; Input : String) return String is Response : Ada.Strings.Unbounded.Unbounded_String; result_status : Boolean := True; begin SendCmd (9, Path, Input); Response := To_Unbounded_String (ReadString); Response := To_Unbounded_String (Slice (Response, 1, Length (Response) - 1)); result_status := Status; if result_status = False then raise BaseXException with To_String (Response); end if; return To_String (Response); exception when E : Socket_Error => raise BaseXException with Exception_Message (E); when E : BaseXException => raise BaseXException with Exception_Message (E); when others => raise BaseXException with "Unexpected exception"; end Add; -- -- Authenticate for this session -- function Authenticate (Username : String; Password : String) return Boolean is Nonce : Ada.Strings.Unbounded.Unbounded_String; Realm : Ada.Strings.Unbounded.Unbounded_String; Output : Ada.Strings.Unbounded.Unbounded_String; Ret : Ada.Strings.Unbounded.Unbounded_String; begin Ret := To_Unbounded_String (ReadString); declare Input : constant String := To_String (Ret); Start : Positive := Input'First; Finish : Natural := 0; begin Ret := To_Unbounded_String (Username); Send (To_String (Ret)); Ada.Strings.Fixed.Find_Token (Input, Ada.Strings.Maps.To_Set (':'), Start, Ada.Strings.Outside, Start, Finish); if Finish = Input'Last then Nonce := To_Unbounded_String (Input (Start .. Input'Last - 1)); Output := To_Unbounded_String (Password); Ret := To_Unbounded_String (GNAT.MD5.Digest (GNAT.MD5.Digest (To_String (Output)) & To_String (Nonce))); else Realm := To_Unbounded_String (Input (Start .. Finish)); Nonce := To_Unbounded_String (Input (Finish + 2 .. Input'Last - 1)); Output := To_Unbounded_String (Username & ":" & To_String (Realm) & ":" & Password); Ret := To_Unbounded_String (GNAT.MD5.Digest (GNAT.MD5.Digest (To_String (Output)) & To_String (Nonce))); end if; end; Send (To_String (Ret)); if Status then return True; end if; return False; exception when E : Socket_Error => raise BaseXException with Exception_Message (E); when E : BaseXException => raise BaseXException with Exception_Message (E); when others => raise BaseXException with "Unexpected exception"; end Authenticate; -- -- Bind procedure for Query class -- procedure Bind (Self : Query; Name : String; Value : String; Stype : String) is Response : Ada.Strings.Unbounded.Unbounded_String; result_status : Boolean := True; begin Send (Character'Val (3) & To_String (Self.Id) & Character'Val (0) & Name & Character'Val (0) & Value & Character'Val (0) & Stype); Response := To_Unbounded_String (ReadString); Response := To_Unbounded_String (Slice (Response, 1, Length (Response) - 1)); result_status := Status; if result_status = False then raise BaseXException with "Bind query failed"; end if; exception when E : Socket_Error => raise BaseXException with Exception_Message (E); when E : BaseXException => raise BaseXException with Exception_Message (E); when others => raise BaseXException with "Unexpected exception"; end Bind; -- -- Close a connection to the host -- procedure Close is begin Send ("exit"); Free (Channel); Close_Socket (Socket); exception when E : Socket_Error => raise BaseXException with Exception_Message (E); when E : BaseXException => raise BaseXException with Exception_Message (E); when others => raise BaseXException with "Unexpected exception"; end Close; -- -- Close procedure for Query class -- procedure Close (Self : out Query) is Response : Ada.Strings.Unbounded.Unbounded_String; result_status : Boolean := True; begin Send (Character'Val (2) & To_String (Self.Id)); Response := To_Unbounded_String (ReadString); Response := To_Unbounded_String (Slice (Response, 1, Length (Response) - 1)); result_status := Status; if result_status = False then raise BaseXException with "Close query failed"; end if; -- Delete Query Id Delete (Self.Id, 1, Length (Self.Id)); exception when E : Socket_Error => raise BaseXException with Exception_Message (E); when E : BaseXException => raise BaseXException with Exception_Message (E); when others => raise BaseXException with "Unexpected exception"; end Close; -- -- Open a connection to the host -- function Connect (Server : String; Port : Natural) return Boolean is Address : GNAT.Sockets.Sock_Addr_Type; begin Address.Addr := GNAT.Sockets.Addresses (GNAT.Sockets.Get_Host_By_Name (Server), 1); Address.Port := Port_Type (Port); GNAT.Sockets.Create_Socket (AdaBaseXClient.Socket); GNAT.Sockets.Connect_Socket (AdaBaseXClient.Socket, Address); AdaBaseXClient.Channel := Stream (AdaBaseXClient.Socket); return True; exception when E : Socket_Error => raise BaseXException with Exception_Message (E); when E : BaseXException => raise BaseXException with Exception_Message (E); when others => raise BaseXException with "Unexpected exception"; end Connect; -- -- Create a new database, inserts initial content -- function Create (Name : String; Input : String) return String is Response : Ada.Strings.Unbounded.Unbounded_String; result_status : Boolean := True; begin SendCmd (8, Name, Input); Response := To_Unbounded_String (ReadString); result_status := Status; if result_status = False then raise BaseXException with To_String (Response); end if; return To_String (Response); exception when E : Socket_Error => raise BaseXException with Exception_Message (E); when E : BaseXException => raise BaseXException with Exception_Message (E); when others => raise BaseXException with "Unexpected exception"; end Create; -- -- Create a new Query instance -- function CreateQuery (Qstring : String) return Query is MyQuery : Query; Response : Ada.Strings.Unbounded.Unbounded_String; result_status : Boolean := True; begin Send (Character'Val (0) & Qstring); Response := To_Unbounded_String (ReadString); Response := To_Unbounded_String (Slice (Response, 1, Length (Response) - 1)); result_status := Status; if result_status = False then raise BaseXException with "Create Query failed"; end if; -- Assign Id to Query class MyQuery.Initialize (To_String (Response)); return MyQuery; exception when E : Socket_Error => raise BaseXException with Exception_Message (E); when E : BaseXException => raise BaseXException with Exception_Message (E); when others => raise BaseXException with "Unexpected exception"; end CreateQuery; -- -- Execute BaseX command -- function Execute (command : String) return String is Response : Ada.Strings.Unbounded.Unbounded_String; Info : Ada.Strings.Unbounded.Unbounded_String; result_status : Boolean := True; begin Send (command); Response := To_Unbounded_String (ReadString); Response := To_Unbounded_String (Slice (Response, 1, Length (Response) - 1)); Info := To_Unbounded_String (ReadString); Info := To_Unbounded_String (Slice (Info, 1, Length (Info) - 1)); result_status := Status; if result_status = False then raise BaseXException with To_String (Info); end if; return To_String (Response); exception when E : Socket_Error => raise BaseXException with Exception_Message (E); when E : BaseXException => raise BaseXException with Exception_Message (E); when others => raise BaseXException with "Unexpected exception"; end Execute; -- -- Execute function for Query class -- function Execute (Self : Query) return String is Response : Ada.Strings.Unbounded.Unbounded_String; result_status : Boolean := True; begin Send (Character'Val (5) & To_String (Self.Id)); Response := To_Unbounded_String (ReadString); Response := To_Unbounded_String (Slice (Response, 1, Length (Response) - 1)); result_status := Status; if result_status = False then raise BaseXException with "Execute query failed"; end if; return (To_String (Response)); exception when E : Socket_Error => raise BaseXException with Exception_Message (E); when E : BaseXException => raise BaseXException with Exception_Message (E); when others => raise BaseXException with "Unexpected exception"; end Execute; -- -- Return process information -- function Info return String is Response : Ada.Strings.Unbounded.Unbounded_String; result_status : Boolean := True; begin Send ("INFO"); Response := To_Unbounded_String (ReadString); result_status := Status; if result_status = False then raise BaseXException with "Return process information failed"; end if; return To_String (Response); exception when E : Socket_Error => raise BaseXException with Exception_Message (E); when E : BaseXException => raise BaseXException with Exception_Message (E); when others => raise BaseXException with "Unexpected exception"; end Info; -- -- Initialize procedure for Query class -- procedure Initialize (Self : out Query; MyId : String) is begin Self.Id := To_Unbounded_String (MyId); end Initialize; -- -- Read data from server -- function Read return String is Data : Ada.Streams.Stream_Element_Array (1 .. 1_024); Size : Ada.Streams.Stream_Element_Offset; Res : Ada.Strings.Unbounded.Unbounded_String; begin GNAT.Sockets.Receive_Socket (Socket, Data, Size); for i in 1 .. Size loop Res := Res & Character'Val (Data (i)); end loop; return To_String (Res); exception when E : Socket_Error => raise BaseXException with Exception_Message (E); end Read; -- -- Read string from server -- function ReadString return String is Data : Ada.Streams.Stream_Element_Array (1 .. 1); Size : Ada.Streams.Stream_Element_Offset; Res : Ada.Strings.Unbounded.Unbounded_String; Chr : Character; begin loop GNAT.Sockets.Receive_Socket (Socket, Data, Size); Res := Res & Character'Val (Data (1)); Chr := Character'Val (Data (1)); if Chr = Character'Val (0) then exit; end if; end loop; return To_String (Res); exception when E : Socket_Error => raise BaseXException with Exception_Message (E); end ReadString; -- -- Replaces content at the specified path by the given document -- function Replace (Path : String; Input : String) return String is Response : Ada.Strings.Unbounded.Unbounded_String; result_status : Boolean := True; begin SendCmd (12, Path, Input); Response := To_Unbounded_String (ReadString); Response := To_Unbounded_String (Slice (Response, 1, Length (Response) - 1)); result_status := Status; if result_status = False then raise BaseXException with To_String (Response); end if; return To_String (Response); exception when E : Socket_Error => raise BaseXException with Exception_Message (E); when E : BaseXException => raise BaseXException with Exception_Message (E); when others => raise BaseXException with "Unexpected exception"; end Replace; -- -- Results function for Query class -- Returns all resulting items as strings -- function Results (Self : Query) return String_Vectors.Vector is Response : Ada.Strings.Unbounded.Unbounded_String; result_status : Boolean := True; VString : String_Vectors.Vector; begin Send (Character'Val (4) & To_String (Self.Id)); while Status = False loop Response := To_Unbounded_String (ReadString); Response := To_Unbounded_String (Slice (Response, 1, Length (Response) - 1)); VString.Append (To_String (Response)); end loop; result_status := Status; if result_status = False then Response := To_Unbounded_String (ReadString); Response := To_Unbounded_String (Slice (Response, 1, Length (Response) - 1)); raise BaseXException with To_String (Response); end if; return VString; exception when E : Socket_Error => raise BaseXException with Exception_Message (E); when E : BaseXException => raise BaseXException with Exception_Message (E); when others => raise BaseXException with "Unexpected exception"; end Results; -- -- Send data to server -- procedure Send (Command : String) is begin String'Write (AdaBaseXClient.Channel, Command & Character'Val (0)); exception when E : Socket_Error => raise BaseXException with Exception_Message (E); end Send; -- -- Send Command to server -- procedure SendCmd (Code : Natural; Arg : String; Input : String) is begin String'Write (AdaBaseXClient.Channel, Character'Val (Code) & Arg & Character'Val (0) & Input & Character'Val (0)); exception when E : Socket_Error => raise BaseXException with Exception_Message (E); end SendCmd; -- -- Read status single byte from socket. -- Server replies with \00 (success) or \01 (error). -- function Status return Boolean is Data : Ada.Streams.Stream_Element_Array (1 .. 1); Size : Ada.Streams.Stream_Element_Offset; Res : Ada.Strings.Unbounded.Unbounded_String; begin GNAT.Sockets.Receive_Socket (Socket, Data, Size); Res := Res & Character'Val (Data (1)); if Element (Res, 1) = Character'Val (0) then return True; end if; return False; exception when E : Socket_Error => raise BaseXException with Exception_Message (E); end Status; -- -- Stores a binary resource in the opened database -- function Store (Path : String; Input : String) return String is Response : Ada.Strings.Unbounded.Unbounded_String; result_status : Boolean := True; begin SendCmd (13, Path, Input); Response := To_Unbounded_String (ReadString); Response := To_Unbounded_String (Slice (Response, 1, Length (Response) - 1)); result_status := Status; if result_status = False then raise BaseXException with To_String (Response); end if; return To_String (Response); exception when E : Socket_Error => raise BaseXException with Exception_Message (E); when E : BaseXException => raise BaseXException with Exception_Message (E); when others => raise BaseXException with "Unexpected exception"; end Store; begin null; end AdaBaseXClient;

27.944816

79

0.618455

034e71adbc49128029f520fc6a1771b462d9ba1e

1,187

adb

Ada

day03/tests/day-test.adb

jwarwick/aoc_2020

b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377

[ "MIT" ]

3

2020-12-26T23:44:33.000Z

2021-12-06T16:00:54.000Z

day03/tests/day-test.adb

jwarwick/aoc_2020

b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377

[ "MIT" ]

null

day03/tests/day-test.adb

jwarwick/aoc_2020

b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377

[ "MIT" ]

null

with AUnit.Assertions; use AUnit.Assertions; package body Day.Test is procedure Test_Part1 (T : in out AUnit.Test_Cases.Test_Case'Class) is pragma Unreferenced (T); f : constant Forest := load_map("test1.txt"); slope : constant Natural := 3; hit : constant Natural := trees_hit(f, slope); begin Assert(hit = 7, "Expected to hit 7 trees, actually hit " & Natural'Image(hit)); end Test_Part1; procedure Test_Part2 (T : in out AUnit.Test_Cases.Test_Case'Class) is pragma Unreferenced (T); f : constant Forest := load_map("test1.txt"); hit : constant Natural := many_trees_hit(f); begin Assert(hit = 336, "Expected to hit 336 trees, actually hit " & Natural'Image(hit)); null; end Test_Part2; function Name (T : Test) return AUnit.Message_String is pragma Unreferenced (T); begin return AUnit.Format ("Test Day package"); end Name; procedure Register_Tests (T : in out Test) is use AUnit.Test_Cases.Registration; begin Register_Routine (T, Test_Part1'Access, "Test Part 1"); Register_Routine (T, Test_Part2'Access, "Test Part 2"); end Register_Tests; end Day.Test;

32.081081

88

0.671441

1eb7d592712961466d842541af6a4cc0eef49b8b

12,348

adb

Ada

gcc-gcc-7_3_0-release/gcc/ada/a-tasatt.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-tasatt.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/ada/a-tasatt.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 A S K _ A T T R I B U T E S -- -- -- -- B o d y -- -- -- -- Copyright (C) 2014-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/>. -- -- -- -- GNARL was developed by the GNARL team at Florida State University. -- -- Extensive contributions were provided by Ada Core Technologies, Inc. -- -- -- ------------------------------------------------------------------------------ with System.Tasking; with System.Tasking.Initialization; with System.Tasking.Task_Attributes; pragma Elaborate_All (System.Tasking.Task_Attributes); with System.Task_Primitives.Operations; with Ada.Finalization; use Ada.Finalization; with Ada.Unchecked_Conversion; with Ada.Unchecked_Deallocation; package body Ada.Task_Attributes is use System, System.Tasking.Initialization, System.Tasking, System.Tasking.Task_Attributes; package STPO renames System.Task_Primitives.Operations; type Attribute_Cleanup is new Limited_Controlled with null record; procedure Finalize (Cleanup : in out Attribute_Cleanup); -- Finalize all tasks' attributes for this package Cleanup : Attribute_Cleanup; pragma Unreferenced (Cleanup); -- Will call Finalize when this instantiation gets out of scope --------------------------- -- Unchecked Conversions -- --------------------------- type Real_Attribute is record Free : Deallocator; Value : Attribute; end record; type Real_Attribute_Access is access all Real_Attribute; pragma No_Strict_Aliasing (Real_Attribute_Access); -- Each value in the task control block's Attributes array is either -- mapped to the attribute value directly if Fast_Path is True, or -- is in effect a Real_Attribute_Access. -- -- Note: the Deallocator field must be first, for compatibility with -- System.Tasking.Task_Attributes.Attribute_Record and to allow unchecked -- conversions between Attribute_Access and Real_Attribute_Access. function New_Attribute (Val : Attribute) return Atomic_Address; -- Create a new Real_Attribute using Val, and return its address. The -- returned value can be converted via To_Real_Attribute. procedure Deallocate (Ptr : Atomic_Address); -- Free memory associated with Ptr, a Real_Attribute_Access in reality function To_Real_Attribute is new Ada.Unchecked_Conversion (Atomic_Address, Real_Attribute_Access); pragma Warnings (Off); -- Kill warning about possible size mismatch function To_Address is new Ada.Unchecked_Conversion (Attribute, Atomic_Address); function To_Attribute is new Ada.Unchecked_Conversion (Atomic_Address, Attribute); function To_Address is new Ada.Unchecked_Conversion (Attribute, System.Address); function To_Int is new Ada.Unchecked_Conversion (Attribute, Integer); pragma Warnings (On); function To_Address is new Ada.Unchecked_Conversion (Real_Attribute_Access, Atomic_Address); pragma Warnings (Off); -- Kill warning about possible aliasing function To_Handle is new Ada.Unchecked_Conversion (System.Address, Attribute_Handle); pragma Warnings (On); function To_Task_Id is new Ada.Unchecked_Conversion (Task_Identification.Task_Id, Task_Id); -- To access TCB of identified task procedure Free is new Ada.Unchecked_Deallocation (Real_Attribute, Real_Attribute_Access); Fast_Path : constant Boolean := (Attribute'Size = Integer'Size and then Attribute'Alignment <= Atomic_Address'Alignment and then To_Int (Initial_Value) = 0) or else (Attribute'Size = System.Address'Size and then Attribute'Alignment <= Atomic_Address'Alignment and then To_Address (Initial_Value) = System.Null_Address); -- If the attribute fits in an Atomic_Address (both size and alignment) -- and Initial_Value is 0 (or null), then we will map the attribute -- directly into ATCB.Attributes (Index), otherwise we will create -- a level of indirection and instead use Attributes (Index) as a -- Real_Attribute_Access. Index : constant Integer := Next_Index (Require_Finalization => not Fast_Path); -- Index in the task control block's Attributes array -------------- -- Finalize -- -------------- procedure Finalize (Cleanup : in out Attribute_Cleanup) is pragma Unreferenced (Cleanup); begin STPO.Lock_RTS; declare C : System.Tasking.Task_Id := System.Tasking.All_Tasks_List; begin while C /= null loop STPO.Write_Lock (C); if C.Attributes (Index) /= 0 and then Require_Finalization (Index) then Deallocate (C.Attributes (Index)); C.Attributes (Index) := 0; end if; STPO.Unlock (C); C := C.Common.All_Tasks_Link; end loop; end; Finalize (Index); STPO.Unlock_RTS; end Finalize; ---------------- -- Deallocate -- ---------------- procedure Deallocate (Ptr : Atomic_Address) is Obj : Real_Attribute_Access := To_Real_Attribute (Ptr); begin Free (Obj); end Deallocate; ------------------- -- New_Attribute -- ------------------- function New_Attribute (Val : Attribute) return Atomic_Address is Tmp : Real_Attribute_Access; begin Tmp := new Real_Attribute'(Free => Deallocate'Unrestricted_Access, Value => Val); return To_Address (Tmp); end New_Attribute; --------------- -- Reference -- --------------- function Reference (T : Task_Identification.Task_Id := Task_Identification.Current_Task) return Attribute_Handle is Self_Id : Task_Id; TT : constant Task_Id := To_Task_Id (T); Error_Message : constant String := "trying to get the reference of a "; Result : Attribute_Handle; begin if TT = null then raise Program_Error with Error_Message & "null task"; end if; if TT.Common.State = Terminated then raise Tasking_Error with Error_Message & "terminated task"; end if; if Fast_Path then -- Kill warning about possible alignment mismatch. If this happens, -- Fast_Path will be False anyway pragma Warnings (Off); return To_Handle (TT.Attributes (Index)'Address); pragma Warnings (On); else Self_Id := STPO.Self; Task_Lock (Self_Id); if TT.Attributes (Index) = 0 then TT.Attributes (Index) := New_Attribute (Initial_Value); end if; Result := To_Handle (To_Real_Attribute (TT.Attributes (Index)).Value'Address); Task_Unlock (Self_Id); return Result; end if; end Reference; ------------------ -- Reinitialize -- ------------------ procedure Reinitialize (T : Task_Identification.Task_Id := Task_Identification.Current_Task) is Self_Id : Task_Id; TT : constant Task_Id := To_Task_Id (T); Error_Message : constant String := "Trying to Reinitialize a "; begin if TT = null then raise Program_Error with Error_Message & "null task"; end if; if TT.Common.State = Terminated then raise Tasking_Error with Error_Message & "terminated task"; end if; if Fast_Path then -- No finalization needed, simply reset to Initial_Value TT.Attributes (Index) := To_Address (Initial_Value); else Self_Id := STPO.Self; Task_Lock (Self_Id); declare Attr : Atomic_Address renames TT.Attributes (Index); begin if Attr /= 0 then Deallocate (Attr); Attr := 0; end if; end; Task_Unlock (Self_Id); end if; end Reinitialize; --------------- -- Set_Value -- --------------- procedure Set_Value (Val : Attribute; T : Task_Identification.Task_Id := Task_Identification.Current_Task) is Self_Id : Task_Id; TT : constant Task_Id := To_Task_Id (T); Error_Message : constant String := "trying to set the value of a "; begin if TT = null then raise Program_Error with Error_Message & "null task"; end if; if TT.Common.State = Terminated then raise Tasking_Error with Error_Message & "terminated task"; end if; if Fast_Path then -- No finalization needed, simply set to Val TT.Attributes (Index) := To_Address (Val); else Self_Id := STPO.Self; Task_Lock (Self_Id); declare Attr : Atomic_Address renames TT.Attributes (Index); begin if Attr /= 0 then Deallocate (Attr); end if; Attr := New_Attribute (Val); end; Task_Unlock (Self_Id); end if; end Set_Value; ----------- -- Value -- ----------- function Value (T : Task_Identification.Task_Id := Task_Identification.Current_Task) return Attribute is Self_Id : Task_Id; TT : constant Task_Id := To_Task_Id (T); Error_Message : constant String := "trying to get the value of a "; begin if TT = null then raise Program_Error with Error_Message & "null task"; end if; if TT.Common.State = Terminated then raise Tasking_Error with Error_Message & "terminated task"; end if; if Fast_Path then return To_Attribute (TT.Attributes (Index)); else Self_Id := STPO.Self; Task_Lock (Self_Id); declare Attr : Atomic_Address renames TT.Attributes (Index); begin if Attr = 0 then Task_Unlock (Self_Id); return Initial_Value; else declare Result : constant Attribute := To_Real_Attribute (Attr).Value; begin Task_Unlock (Self_Id); return Result; end; end if; end; end if; end Value; end Ada.Task_Attributes;

32.840426

78

0.563897

c7cc5f5a1f0987b7b27459668ad2f5c7f1b9c7d3

6,533

adb

Ada

tools-src/gnu/gcc/gcc/ada/a-ticoau.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/a-ticoau.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/a-ticoau.adb

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

69

2015-01-02T10:45:56.000Z

2021-09-06T07:52:13.000Z

------------------------------------------------------------------------------ -- -- -- GNAT RUNTIME COMPONENTS -- -- -- -- A D A . T E X T _ I O . C O M P L E X _ A U X -- -- -- -- B o d y -- -- -- -- $Revision$ -- -- -- Copyright (C) 1992,1993,1994,1995,1996 Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Ada.Text_IO.Generic_Aux; use Ada.Text_IO.Generic_Aux; with Ada.Text_IO.Float_Aux; with System.Img_Real; use System.Img_Real; package body Ada.Text_IO.Complex_Aux is package Aux renames Ada.Text_IO.Float_Aux; --------- -- Get -- --------- procedure Get (File : in File_Type; ItemR : out Long_Long_Float; ItemI : out Long_Long_Float; Width : Field) is Buf : String (1 .. Field'Last); Stop : Integer := 0; Ptr : aliased Integer; Paren : Boolean := False; begin -- General note for following code, exceptions from the calls to -- Get for components of the complex value are propagated. if Width /= 0 then Load_Width (File, Width, Buf, Stop); Gets (Buf (1 .. Stop), ItemR, ItemI, Ptr); for J in Ptr + 1 .. Stop loop if not Is_Blank (Buf (J)) then raise Data_Error; end if; end loop; -- Case of width = 0 else Load_Skip (File); Ptr := 0; Load (File, Buf, Ptr, '(', Paren); Aux.Get (File, ItemR, 0); Load_Skip (File); Load (File, Buf, Ptr, ','); Aux.Get (File, ItemI, 0); if Paren then Load_Skip (File); Load (File, Buf, Ptr, ')', Paren); if not Paren then raise Data_Error; end if; end if; end if; end Get; ---------- -- Gets -- ---------- procedure Gets (From : in String; ItemR : out Long_Long_Float; ItemI : out Long_Long_Float; Last : out Positive) is Paren : Boolean; Pos : Integer; begin String_Skip (From, Pos); if From (Pos) = '(' then Pos := Pos + 1; Paren := True; else Paren := False; end if; Aux.Gets (From (Pos .. From'Last), ItemR, Pos); String_Skip (From (Pos + 1 .. From'Last), Pos); if From (Pos) = ',' then Pos := Pos + 1; end if; Aux.Gets (From (Pos .. From'Last), ItemI, Pos); if Paren then String_Skip (From (Pos + 1 .. From'Last), Pos); if From (Pos) /= ')' then raise Data_Error; end if; end if; Last := Pos; end Gets; --------- -- Put -- --------- procedure Put (File : File_Type; ItemR : Long_Long_Float; ItemI : Long_Long_Float; Fore : Field; Aft : Field; Exp : Field) is begin Put (File, '('); Aux.Put (File, ItemR, Fore, Aft, Exp); Put (File, ','); Aux.Put (File, ItemI, Fore, Aft, Exp); Put (File, ')'); end Put; ---------- -- Puts -- ---------- procedure Puts (To : out String; ItemR : Long_Long_Float; ItemI : Long_Long_Float; Aft : in Field; Exp : in Field) is I_String : String (1 .. 3 * Field'Last); R_String : String (1 .. 3 * Field'Last); Iptr : Natural; Rptr : Natural; begin -- Both parts are initially converted with a Fore of 0 Rptr := 0; Set_Image_Real (ItemR, R_String, Rptr, 0, Aft, Exp); Iptr := 0; Set_Image_Real (ItemI, I_String, Iptr, 0, Aft, Exp); -- Check room for both parts plus parens plus comma (RM G.1.3(34)) if Rptr + Iptr + 3 > To'Length then raise Layout_Error; end if; -- If there is room, layout result according to (RM G.1.3(31-33)) To (To'First) := '('; To (To'First + 1 .. To'First + Rptr) := R_String (1 .. Rptr); To (To'First + Rptr + 1) := ','; To (To'Last) := ')'; To (To'Last - Iptr .. To'Last - 1) := I_String (1 .. Iptr); for J in To'First + Rptr + 2 .. To'Last - Iptr - 1 loop To (J) := ' '; end loop; end Puts; end Ada.Text_IO.Complex_Aux;

31.560386

78

0.457983

8b6a838c101e4182b239a85edb60ba2ff021cf92

6,636

ads

Ada

llvm-gcc-4.2-2.9/gcc/ada/a-intnam-tru64.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

llvm-gcc-4.2-2.9/gcc/ada/a-intnam-tru64.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

llvm-gcc-4.2-2.9/gcc/ada/a-intnam-tru64.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- A D A . I N T E R R U P T S . N A M E S -- -- -- -- S p e c -- -- -- -- Copyright (C) 1991-2005, Free Software Foundation, Inc. -- -- -- -- GNARL is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNARL is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNARL; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNARL was developed by the GNARL team at Florida State University. -- -- Extensive contributions were provided by Ada Core Technologies, Inc. -- -- -- ------------------------------------------------------------------------------ -- This is the DEC Unix 4.0 version of this package -- The following signals are reserved by the run time: -- SIGFPE, SIGILL, SIGSEGV, SIGBUS, SIGABRT, SIGTRAP, SIGINT, SIGALRM, -- SIGSTOP, SIGKILL -- The pragma Unreserve_All_Interrupts affects the following signal(s): -- SIGINT: made available for Ada handler with System.OS_Interface; -- used for names of interrupts package Ada.Interrupts.Names is -- Beware that the mapping of names to signals may be many-to-one. There -- may be aliases. Also, for all signal names that are not supported on the -- current system the value of the corresponding constant will be zero. SIGHUP : constant Interrupt_ID := System.OS_Interface.SIGHUP; -- hangup SIGINT : constant Interrupt_ID := System.OS_Interface.SIGINT; -- interrupt (rubout) SIGQUIT : constant Interrupt_ID := System.OS_Interface.SIGQUIT; -- quit (ASCD FS) SIGILL : constant Interrupt_ID := System.OS_Interface.SIGILL; -- illegal instruction (not reset) SIGTRAP : constant Interrupt_ID := System.OS_Interface.SIGTRAP; -- trace trap (not reset) SIGIOT : constant Interrupt_ID := System.OS_Interface.SIGIOT; -- IOT instruction SIGABRT : constant Interrupt_ID := -- used by abort, System.OS_Interface.SIGABRT; -- replace SIGIOT in the future SIGEMT : constant Interrupt_ID := System.OS_Interface.SIGEMT; -- EMT instruction SIGFPE : constant Interrupt_ID := System.OS_Interface.SIGFPE; -- floating point exception SIGKILL : constant Interrupt_ID := System.OS_Interface.SIGKILL; -- kill (cannot be caught or ignored) SIGBUS : constant Interrupt_ID := System.OS_Interface.SIGBUS; -- bus error SIGSEGV : constant Interrupt_ID := System.OS_Interface.SIGSEGV; -- segmentation violation SIGSYS : constant Interrupt_ID := System.OS_Interface.SIGSYS; -- bad argument to system call SIGPIPE : constant Interrupt_ID := -- write on a pipe with System.OS_Interface.SIGPIPE; -- no one to read it SIGALRM : constant Interrupt_ID := System.OS_Interface.SIGALRM; -- alarm clock SIGTERM : constant Interrupt_ID := System.OS_Interface.SIGTERM; -- software termination signal from kill SIGUSR1 : constant Interrupt_ID := System.OS_Interface.SIGUSR1; -- user defined signal 1 SIGUSR2 : constant Interrupt_ID := System.OS_Interface.SIGUSR2; -- user defined signal 2 SIGCHLD : constant Interrupt_ID := System.OS_Interface.SIGCHLD; -- 4.3BSD's/POSIX name for SIGCLD SIGWINCH : constant Interrupt_ID := System.OS_Interface.SIGWINCH; -- window size change SIGURG : constant Interrupt_ID := System.OS_Interface.SIGURG; -- urgent condition on IO channel SIGPOLL : constant Interrupt_ID := System.OS_Interface.SIGPOLL; -- pollable event occurred SIGIO : constant Interrupt_ID := -- input/output possible, System.OS_Interface.SIGIO; -- SIGPOLL alias (Solaris) SIGSTOP : constant Interrupt_ID := System.OS_Interface.SIGSTOP; -- stop (cannot be caught or ignored) SIGTSTP : constant Interrupt_ID := System.OS_Interface.SIGTSTP; -- user stop requested from tty SIGCONT : constant Interrupt_ID := System.OS_Interface.SIGCONT; -- stopped process has been continued SIGTTIN : constant Interrupt_ID := System.OS_Interface.SIGTTIN; -- background tty read attempted SIGTTOU : constant Interrupt_ID := System.OS_Interface.SIGTTOU; -- background tty write attempted SIGVTALRM : constant Interrupt_ID := System.OS_Interface.SIGVTALRM; -- virtual timer expired SIGPROF : constant Interrupt_ID := System.OS_Interface.SIGPROF; -- profiling timer expired SIGXCPU : constant Interrupt_ID := System.OS_Interface.SIGXCPU; -- CPU time limit exceeded SIGXFSZ : constant Interrupt_ID := System.OS_Interface.SIGXFSZ; -- filesize limit exceeded end Ada.Interrupts.Names;

43.94702

79

0.584991

8bb3f2c97233df35cd5ae58d94f6084ad9ca9d91

253

adb

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/addr4.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/addr4.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/addr4.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- { dg-do compile } -- { dg-options "-g" } procedure Addr4 is function F return String is begin return ""; end F; S1 : String renames F; subtype ST is String (1 .. S1'Length); S2 : ST; for S2'Address use S1'Address; begin null; end;

19.461538

54

0.620553

1a3bec177646c8875e20a428420dd109fdef0e57

1,248

ads

Ada

src/ada-core/src/linted-controls.ads

mstewartgallus/linted

4d4cf9390353ea045b95671474ab278456793a35

[ "Apache-2.0" ]

null

src/ada-core/src/linted-controls.ads

mstewartgallus/linted

4d4cf9390353ea045b95671474ab278456793a35

[ "Apache-2.0" ]

null

src/ada-core/src/linted-controls.ads

mstewartgallus/linted

4d4cf9390353ea045b95671474ab278456793a35

[ "Apache-2.0" ]

null

-- Copyright 2015,2016 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. with System.Storage_Elements; package Linted.Controls is pragma Pure; type Int is range -2**(32 - 1) .. 2**(32 - 1) - 1; type Packet is record Z_Tilt : Int := 0; X_Tilt : Int := 0; Left : Boolean := False; Right : Boolean := False; Forward : Boolean := False; Back : Boolean := False; Jumping : Boolean := False; end record; Storage_Size : constant := 2 * 4 + 1; subtype Storage is System.Storage_Elements.Storage_Array (1 .. Storage_Size); procedure From_Storage (S : Storage; C : out Packet) with Global => null, Depends => (C => S); end Linted.Controls;

30.439024

70

0.668269

13bfda846667ba8483c1fd6cd5559aa436a3562e

1,251

ads

Ada

gcc-gcc-7_3_0-release/gcc/ada/a-ssizti.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/ada/a-ssizti.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/ada/a-ssizti.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . S H O R T _ S H O R T _ I N T E G E R _ W I D E _ T E X T _ I O -- -- -- -- S p e c -- -- -- -- This specification is derived from the Ada Reference Manual for use with -- -- GNAT. In accordance with the copyright of that document, you can freely -- -- copy and modify this specification, provided that if you redistribute a -- -- modified version, any changes that you have made are clearly indicated. -- -- -- ------------------------------------------------------------------------------ with Ada.Wide_Wide_Text_IO; package Ada.Short_Short_Integer_Wide_Wide_Text_IO is new Ada.Wide_Wide_Text_IO.Integer_IO (Short_Short_Integer);

62.55

78

0.338129

13e28afdf04b6b3601a7e84963ffaccaf463d29a

798

adb

Ada

gdb/testsuite/gdb.ada/mi_exc_info/foo.adb

greyblue9/binutils-gdb

05377632b124fe7600eea7f4ee0e9a35d1b0cbdc

[ "BSD-3-Clause" ]

1

2020-10-14T03:24:35.000Z

gdb/testsuite/gdb.ada/mi_exc_info/foo.adb

greyblue9/binutils-gdb

05377632b124fe7600eea7f4ee0e9a35d1b0cbdc

[ "BSD-3-Clause" ]

null

gdb/testsuite/gdb.ada/mi_exc_info/foo.adb

greyblue9/binutils-gdb

05377632b124fe7600eea7f4ee0e9a35d1b0cbdc

[ "BSD-3-Clause" ]

null

-- Copyright 2013-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/>. with Const; use Const; procedure Foo is begin raise Aint_Global_GDB_E; end Foo;

38

73

0.741855

8bdcb84e933a291efa885a187df24d9f195cb321

314

adb

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/boolean_expr2.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/boolean_expr2.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/boolean_expr2.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- { dg-do run } procedure Boolean_Expr2 is function Ident_Bool (B : Boolean) return Boolean is begin return B; end; begin if Boolean'Succ (Ident_Bool(False)) /= True then raise Program_Error; end if; if Boolean'Pred (Ident_Bool(True)) /= False then raise Program_Error; end if; end;

16.526316

53

0.678344

a0c237d8b42bf309f34f62c799bb3e223b0f5967

4,062

adb

Ada

tools-src/gnu/gcc/gcc/ada/a-comlin.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/a-comlin.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/a-comlin.adb

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

69

2015-01-02T10:45:56.000Z

2021-09-06T07:52:13.000Z

------------------------------------------------------------------------------ -- -- -- GNAT RUNTIME COMPONENTS -- -- -- -- A D A . C O M M A N D _ L I N E -- -- -- -- B o d y -- -- -- -- $Revision$ -- -- -- Copyright (C) 1992-2001 Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with System; package body Ada.Command_Line is function Arg_Count return Natural; pragma Import (C, Arg_Count, "__gnat_arg_count"); procedure Fill_Arg (A : System.Address; Arg_Num : Integer); pragma Import (C, Fill_Arg, "__gnat_fill_arg"); function Len_Arg (Arg_Num : Integer) return Integer; pragma Import (C, Len_Arg, "__gnat_len_arg"); -------------- -- Argument -- -------------- function Argument (Number : in Positive) return String is Num : Positive; begin if Number > Argument_Count then raise Constraint_Error; end if; if Remove_Args = null then Num := Number; else Num := Remove_Args (Number); end if; declare Arg : aliased String (1 .. Len_Arg (Num)); begin Fill_Arg (Arg'Address, Num); return Arg; end; end Argument; -------------------- -- Argument_Count -- -------------------- function Argument_Count return Natural is begin if Remove_Args = null then return Arg_Count - 1; else return Remove_Count; end if; end Argument_Count; ------------------ -- Command_Name -- ------------------ function Command_Name return String is Arg : aliased String (1 .. Len_Arg (0)); begin Fill_Arg (Arg'Address, 0); return Arg; end Command_Name; end Ada.Command_Line;

40.217822

78

0.45224

ad2cbcc062f496dbb769ecdcfd2c7c5fae2284b0

7,307

adb

Ada

src/common/sp-file_system.adb

jquorning/septum

6c9ccb6ed58429a144f44db0f3e2e72028655890

[ "Apache-2.0" ]

236

2021-05-31T00:08:00.000Z

2022-03-31T20:11:31.000Z

src/common/sp-file_system.adb

jquorning/septum

6c9ccb6ed58429a144f44db0f3e2e72028655890

[ "Apache-2.0" ]

34

2021-05-25T02:02:46.000Z

2022-02-01T11:58:09.000Z

src/common/sp-file_system.adb

jquorning/septum

6c9ccb6ed58429a144f44db0f3e2e72028655890

[ "Apache-2.0" ]

2

2022-01-31T22:47:20.000Z

2022-03-27T21:43:35.000Z

------------------------------------------------------------------------------- -- Copyright 2021, The Septum Developers (see AUTHORS file) -- 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.IO_Exceptions; with Ada.Strings.Unbounded.Text_IO; with Ada.Text_IO; with SP.Platform; with SP.Terminal; package body SP.File_System is package AD renames Ada.Directories; function Is_File (Target : String) return Boolean is use type Ada.Directories.File_Kind; begin return AD.Exists (Target) and then AD.Kind (Target) = AD.Ordinary_File; exception when others => return False; end Is_File; function Is_Dir (Target : String) return Boolean is use type Ada.Directories.File_Kind; begin return AD.Exists (Target) and then AD.Kind (Target) = AD.Directory; exception when others => return False; end Is_Dir; function Is_Current_Or_Parent_Directory (Dir_Entry : Ada.Directories.Directory_Entry_Type) return Boolean is -- Return true if the entry is "." or "..". Name : constant String := Ada.Directories.Simple_Name (Dir_Entry); begin return Name = "." or else Name = ".."; end Is_Current_Or_Parent_Directory; function Contents (Dir_Name : String) return Dir_Contents is use Ada.Directories; Dir_Search : Search_Type; Next_Entry : Directory_Entry_Type; Filter : constant Filter_Type := (Ordinary_File | Directory => True, others => False); begin return Result : Dir_Contents do Ada.Directories.Start_Search (Search => Dir_Search, Directory => Dir_Name, Pattern => "*", Filter => Filter); while More_Entries (Dir_Search) loop Get_Next_Entry (Dir_Search, Next_Entry); if not Is_Current_Or_Parent_Directory (Next_Entry) then case Kind (Next_Entry) is when Directory => Result.Subdirs.Append (Ada.Strings.Unbounded.To_Unbounded_String(Full_Name (Next_Entry))); when Ordinary_File => Result.Files.Append (Ada.Strings.Unbounded.To_Unbounded_String(Full_Name (Next_Entry))); when others => null; end case; end if; end loop; End_Search (Dir_Search); end return; end Contents; -- Reads all the lines from a file. function Read_Lines (File_Name : String; Result : out String_Vectors.Vector) return Boolean is File : Ada.Text_IO.File_Type; Line : Ada.Strings.Unbounded.Unbounded_String; begin String_Vectors.Clear (Result); Ada.Text_IO.Open (File => File, Mode => Ada.Text_IO.In_File, Name => File_Name); while not Ada.Text_IO.End_Of_File (File) loop Line := Ada.Strings.Unbounded.Text_IO.Get_Line (File); Result.Append (Line); end loop; Ada.Text_IO.Close (File); return True; exception when Ada.Text_IO.End_Error => if Ada.Text_IO.Is_Open (File) then Ada.Text_IO.Close (File); end if; return True; when others => SP.Terminal.Put_Line ("Unable to read contents of: " & File_Name); return False; end Read_Lines; -- Finds a path similar to the given one with the same basic stem. function Similar_Path (Path : String) return String is begin -- TODO: This is bad. -- Naive loop cutting off the end of the string one character at a time. for Last_Index in reverse 2 .. Path'Length loop declare Shortened_Path : constant String := Path (Path'First .. Last_Index); begin if Is_File (Shortened_Path) then return Shortened_Path; elsif Is_Dir (Shortened_Path) then return Shortened_Path; end if; end; end loop; return ""; exception when others => return ""; end Similar_Path; -- Rewrite a path with all forward slashes for simplicity. function Rewrite_Path (Path : String) return String is S : String := Path; Opposite : constant Character := SP.Platform.Path_Opposite_Separator; Local : constant Character := SP.Platform.Path_Separator; begin for I in 1 .. S'Length loop if (Path (I) = Opposite) then S(I) := Local; else S(I) := Path (I); end if; end loop; return S; end Rewrite_Path; -- Produces all of the possible options for a path. function File_Completions (Path : String) return SP.Strings.String_Vectors.Vector is Result : SP.Strings.String_Vectors.Vector; Files : Dir_Contents; Rewritten : ASU.Unbounded_String := ASU.To_Unbounded_String (Rewrite_Path (Path)); Similar : ASU.Unbounded_String := ASU.To_Unbounded_String (Similar_Path (ASU.To_String (Rewritten))); begin -- Has no higher directory. if ASU.Length (Similar) = 0 then return Result; end if; begin if (Is_Dir (ASU.To_String (Similar)) and then ASU.Element (Similar, ASU.Length (Similar)) = SP.Platform.Path_Separator) or else ASU.Length (Similar) = 1 then Files := Contents (ASU.To_String (Similar)); else declare Parent : constant ASU.Unbounded_String := ASU.To_Unbounded_String (Similar_Path (ASU.Slice (Similar, 1, ASU.Length (Similar) - 1))); begin if not Is_Dir (ASU.To_String (Parent)) then return Result; end if; Files := Contents (ASU.To_String (Parent)); Similar := Parent; Rewritten := ASU.To_Unbounded_String (Rewrite_Path (ASU.To_String (Similar))); end; end if; exception -- Skip over files we're not allowed to read. when Ada.IO_Exceptions.Use_Error => null; end; -- The directory file contain paths with similar completions to the name. -- Filter out paths which don't have a matching prefix with the original. for Dir of Files.Subdirs loop if SP.Strings.Common_Prefix_Length (Rewritten, Dir) = ASU.Length (Rewritten) then Result.Append (Dir); end if; end loop; return Result; end File_Completions; end SP.File_System;

38.661376

152

0.588203

8b3bfbba6ae309a24a8273a953b811b8edcec5ab

3,639

ada

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c35904a.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c35904a.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c35904a.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- C35904A.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 INCOMPATIBLE FIXED POINT CONSTRAINTS RAISE -- APPROPRIATE EXCEPTIONS. -- HISTORY: -- RJK 05/17/83 CREATED ORIGINAL TEST. -- PWB 02/03/86 CORRECTED TEST ERROR: -- ADDED POSSIBLITY OF NUMERIC_ERROR -- IN DECLARATIONS OF SFX3 AND SFX4. -- BCB 10/21/87 CHANGED HEADER TO STANDARD FORMAT. CHANGED RANGE -- CONSTRAINTS OF SUBTYPE SFX1. CHANGED UPPER BOUND -- OF THE CONSTRAINT OF SFX4. CHANGED RANGE -- CONSTRAINTS OF FIX. -- JRL 03/30/93 REMOVED NUMERIC_ERROR FROM TEST. -- PWN 10/27/95 REMOVED OUT OF RANGE STATIC VALUE CHECKS. -- EDS 07/16/98 AVOID OPTIMIZATION WITH REPORT; USE REPORT; PROCEDURE C35904A IS TYPE FIX IS DELTA 0.5 RANGE -3.0 .. 3.0; BEGIN TEST ("C35904A", "CHECK THAT INCOMPATIBLE FIXED POINT " & "CONSTRAINTS RAISE APPROPRIATE EXCEPTION"); -- TEST FOR CORRECT SUBTYPE DEFINITION FOR COMPATIBILITY BETWEEN TYPE -- AND SUBTYPE CONSTRAINTS. BEGIN DECLARE SUBTYPE SFX1 IS FIX DELTA 1.0 RANGE 0.0 .. 2.0; -- OK. SFX1_VAR : SFX1; BEGIN SFX1_VAR := 1.0; END; EXCEPTION WHEN CONSTRAINT_ERROR => FAILED ("FIXED POINT CONSTRAINTS ARE NOT IN ERROR"); WHEN OTHERS => FAILED ("EXCEPTION SHOULD NOT BE RAISED WHILE " & "CHECKING DELTA CONSTRAINT"); END; -- TEST FOR INCORRECT SUBTYPE DEFINITION ON ACCURACY BETWEEN TYPE AND -- SUBTYPE DEFINITIONS. BEGIN DECLARE SUBTYPE SFX IS FIX DELTA 0.1; -- DELTA IS SMALLER FOR -- SUBTYPE THAN FOR TYPE. -- DEFINE AN OBJECT OF SUBTYPE SFX AND USE IT TO AVOID -- OPTIMIZATION OF SUBTYPE SFX_VAR : SFX := FIX(IDENT_INT(1)); BEGIN FAILED ("NO EXCEPTION RAISED FOR INCOMPATABLE DELTA " & FIX'IMAGE(SFX_VAR) ); --USE SFX_VAR END; EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ("INCORRECT EXCEPTION RAISED WHILE CHECKING " & "DELTA CONSTRAINT"); END; RESULT; END C35904A;

34.990385

79

0.594119

22f3fb5e93fc46e108f4073d83272590ee8404f4

3,895

ads

Ada

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-pack46.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-pack46.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-pack46.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . P A C K _ 4 6 -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2021, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- -- -- -- -- -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- Handling of packed arrays with Component_Size = 46 package System.Pack_46 is pragma Preelaborate; Bits : constant := 46; type Bits_46 is mod 2 ** Bits; for Bits_46'Size use Bits; -- In all subprograms below, Rev_SSO is set True if the array has the -- non-default scalar storage order. function Get_46 (Arr : System.Address; N : Natural; Rev_SSO : Boolean) return Bits_46 with Inline; -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is extracted and returned. procedure Set_46 (Arr : System.Address; N : Natural; E : Bits_46; Rev_SSO : Boolean) with Inline; -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is set to the given value. function GetU_46 (Arr : System.Address; N : Natural; Rev_SSO : Boolean) return Bits_46 with Inline; -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is extracted and returned. This version -- is used when Arr may represent an unaligned address. procedure SetU_46 (Arr : System.Address; N : Natural; E : Bits_46; Rev_SSO : Boolean) with Inline; -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is set to the given value. This version -- is used when Arr may represent an unaligned address end System.Pack_46;

49.935897

78

0.432092

2ec3742e0ebc21ce8291b47d7ba56f1864323ef4

1,261

adb

Ada

day01/day01.adb

thorstel/Advent-of-Code-2018

d67cb7ffeac9e68560af34ca1bc29928bad1d3b9

[ "BSD-3-Clause" ]

2

2019-09-15T04:52:09.000Z

2020-11-17T16:46:46.000Z

day01/day01.adb

thorstel/Advent-of-Code-2018

d67cb7ffeac9e68560af34ca1bc29928bad1d3b9

[ "BSD-3-Clause" ]

null

day01/day01.adb

thorstel/Advent-of-Code-2018

d67cb7ffeac9e68560af34ca1bc29928bad1d3b9

[ "BSD-3-Clause" ]

null

with Ada.Containers.Ordered_Sets; with Ada.Containers.Vectors; with Ada.Text_IO; use Ada.Containers; use Ada.Text_IO; procedure Day01 is package Integer_Sets is new Ordered_Sets (Element_Type => Integer); package Integer_Vectors is new Vectors (Index_Type => Natural, Element_Type => Integer); Frequency : Integer := 0; Seen_Frequs : Integer_Sets.Set; Inputs : Integer_Vectors.Vector; begin -- Parsing input file & Part 1 declare Input : Integer; File : File_Type; begin Open (File, In_File, "input.txt"); while not End_Of_File (File) loop Input := Integer'Value (Get_Line (File)); Frequency := Frequency + Input; Inputs.Append (Input); end loop; Close (File); end; Put_Line ("Part 1 =" & Integer'Image (Frequency)); -- Part 2 Seen_Frequs.Include (0); Frequency := 0; Infinite_Loop : loop for I in Inputs.Iterate loop Frequency := Frequency + Inputs (I); exit Infinite_Loop when Seen_Frequs.Contains (Frequency); Seen_Frequs.Include (Frequency); end loop; end loop Infinite_Loop; Put_Line ("Part 2 =" & Integer'Image (Frequency)); end Day01;

26.829787

73

0.623315

03a68b498265cf0823125e932d18a22f3e85b881

49,128

adb

Ada

source/amf/uml/amf-internals-tables-umldi_metamodel.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/uml/amf-internals-tables-umldi_metamodel.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/uml/amf-internals-tables-umldi_metamodel.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2012, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ -- This file is generated, don't edit it. ------------------------------------------------------------------------------ package body AMF.Internals.Tables.UMLDI_Metamodel is -------------------- -- MM_UMLDI_UMLDI -- -------------------- function MM_UMLDI_UMLDI return AMF.Internals.CMOF_Element is begin return Base + 96; end MM_UMLDI_UMLDI; -------------------------------------------------------------- -- MC_UMLDI_UML_Association_Or_Connector_Or_Link_Shape_Kind -- -------------------------------------------------------------- function MC_UMLDI_UML_Association_Or_Connector_Or_Link_Shape_Kind return AMF.Internals.CMOF_Element is begin return Base + 272; end MC_UMLDI_UML_Association_Or_Connector_Or_Link_Shape_Kind; ---------------------------------------------- -- MC_UMLDI_UML_Inherited_State_Border_Kind -- ---------------------------------------------- function MC_UMLDI_UML_Inherited_State_Border_Kind return AMF.Internals.CMOF_Element is begin return Base + 275; end MC_UMLDI_UML_Inherited_State_Border_Kind; ------------------------------------------- -- MC_UMLDI_UML_Interaction_Diagram_Kind -- ------------------------------------------- function MC_UMLDI_UML_Interaction_Diagram_Kind return AMF.Internals.CMOF_Element is begin return Base + 281; end MC_UMLDI_UML_Interaction_Diagram_Kind; ----------------------------------------------- -- MC_UMLDI_UML_Interaction_Table_Label_Kind -- ----------------------------------------------- function MC_UMLDI_UML_Interaction_Table_Label_Kind return AMF.Internals.CMOF_Element is begin return Base + 293; end MC_UMLDI_UML_Interaction_Table_Label_Kind; --------------------------------------------- -- MC_UMLDI_UML_Navigability_Notation_Kind -- --------------------------------------------- function MC_UMLDI_UML_Navigability_Notation_Kind return AMF.Internals.CMOF_Element is begin return Base + 309; end MC_UMLDI_UML_Navigability_Notation_Kind; ----------------------------------- -- MC_UMLDI_UML_Activity_Diagram -- ----------------------------------- function MC_UMLDI_UML_Activity_Diagram return AMF.Internals.CMOF_Element is begin return Base + 1; end MC_UMLDI_UML_Activity_Diagram; ---------------------------------------- -- MC_UMLDI_UML_Association_End_Label -- ---------------------------------------- function MC_UMLDI_UML_Association_End_Label return AMF.Internals.CMOF_Element is begin return Base + 2; end MC_UMLDI_UML_Association_End_Label; --------------------------------------------------------- -- MC_UMLDI_UML_Association_Or_Connector_Or_Link_Shape -- --------------------------------------------------------- function MC_UMLDI_UML_Association_Or_Connector_Or_Link_Shape return AMF.Internals.CMOF_Element is begin return Base + 3; end MC_UMLDI_UML_Association_Or_Connector_Or_Link_Shape; ----------------------------------- -- MC_UMLDI_UML_Behavior_Diagram -- ----------------------------------- function MC_UMLDI_UML_Behavior_Diagram return AMF.Internals.CMOF_Element is begin return Base + 4; end MC_UMLDI_UML_Behavior_Diagram; -------------------------------- -- MC_UMLDI_UML_Class_Diagram -- -------------------------------- function MC_UMLDI_UML_Class_Diagram return AMF.Internals.CMOF_Element is begin return Base + 5; end MC_UMLDI_UML_Class_Diagram; ------------------------------------------------------- -- MC_UMLDI_UML_Class_Or_Composite_Structure_Diagram -- ------------------------------------------------------- function MC_UMLDI_UML_Class_Or_Composite_Structure_Diagram return AMF.Internals.CMOF_Element is begin return Base + 6; end MC_UMLDI_UML_Class_Or_Composite_Structure_Diagram; ----------------------------------- -- MC_UMLDI_UML_Classifier_Shape -- ----------------------------------- function MC_UMLDI_UML_Classifier_Shape return AMF.Internals.CMOF_Element is begin return Base + 7; end MC_UMLDI_UML_Classifier_Shape; ------------------------------ -- MC_UMLDI_UML_Compartment -- ------------------------------ function MC_UMLDI_UML_Compartment return AMF.Internals.CMOF_Element is begin return Base + 8; end MC_UMLDI_UML_Compartment; ---------------------------------------- -- MC_UMLDI_UML_Compartmentable_Shape -- ---------------------------------------- function MC_UMLDI_UML_Compartmentable_Shape return AMF.Internals.CMOF_Element is begin return Base + 9; end MC_UMLDI_UML_Compartmentable_Shape; ------------------------------------ -- MC_UMLDI_UML_Component_Diagram -- ------------------------------------ function MC_UMLDI_UML_Component_Diagram return AMF.Internals.CMOF_Element is begin return Base + 10; end MC_UMLDI_UML_Component_Diagram; ---------------------------------------------- -- MC_UMLDI_UML_Composite_Structure_Diagram -- ---------------------------------------------- function MC_UMLDI_UML_Composite_Structure_Diagram return AMF.Internals.CMOF_Element is begin return Base + 11; end MC_UMLDI_UML_Composite_Structure_Diagram; ------------------------------------- -- MC_UMLDI_UML_Deployment_Diagram -- ------------------------------------- function MC_UMLDI_UML_Deployment_Diagram return AMF.Internals.CMOF_Element is begin return Base + 12; end MC_UMLDI_UML_Deployment_Diagram; -------------------------- -- MC_UMLDI_UML_Diagram -- -------------------------- function MC_UMLDI_UML_Diagram return AMF.Internals.CMOF_Element is begin return Base + 13; end MC_UMLDI_UML_Diagram; ---------------------------------- -- MC_UMLDI_UML_Diagram_Element -- ---------------------------------- function MC_UMLDI_UML_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 14; end MC_UMLDI_UML_Diagram_Element; ----------------------- -- MC_UMLDI_UML_Edge -- ----------------------- function MC_UMLDI_UML_Edge return AMF.Internals.CMOF_Element is begin return Base + 15; end MC_UMLDI_UML_Edge; -------------------------------------- -- MC_UMLDI_UML_Interaction_Diagram -- -------------------------------------- function MC_UMLDI_UML_Interaction_Diagram return AMF.Internals.CMOF_Element is begin return Base + 16; end MC_UMLDI_UML_Interaction_Diagram; ------------------------------------------ -- MC_UMLDI_UML_Interaction_Table_Label -- ------------------------------------------ function MC_UMLDI_UML_Interaction_Table_Label return AMF.Internals.CMOF_Element is begin return Base + 17; end MC_UMLDI_UML_Interaction_Table_Label; -------------------------------- -- MC_UMLDI_UML_Keyword_Label -- -------------------------------- function MC_UMLDI_UML_Keyword_Label return AMF.Internals.CMOF_Element is begin return Base + 18; end MC_UMLDI_UML_Keyword_Label; ------------------------ -- MC_UMLDI_UML_Label -- ------------------------ function MC_UMLDI_UML_Label return AMF.Internals.CMOF_Element is begin return Base + 19; end MC_UMLDI_UML_Label; ------------------------------------- -- MC_UMLDI_UML_Multiplicity_Label -- ------------------------------------- function MC_UMLDI_UML_Multiplicity_Label return AMF.Internals.CMOF_Element is begin return Base + 20; end MC_UMLDI_UML_Multiplicity_Label; ----------------------------- -- MC_UMLDI_UML_Name_Label -- ----------------------------- function MC_UMLDI_UML_Name_Label return AMF.Internals.CMOF_Element is begin return Base + 21; end MC_UMLDI_UML_Name_Label; --------------------------------- -- MC_UMLDI_UML_Object_Diagram -- --------------------------------- function MC_UMLDI_UML_Object_Diagram return AMF.Internals.CMOF_Element is begin return Base + 22; end MC_UMLDI_UML_Object_Diagram; ---------------------------------- -- MC_UMLDI_UML_Package_Diagram -- ---------------------------------- function MC_UMLDI_UML_Package_Diagram return AMF.Internals.CMOF_Element is begin return Base + 23; end MC_UMLDI_UML_Package_Diagram; ---------------------------------- -- MC_UMLDI_UML_Profile_Diagram -- ---------------------------------- function MC_UMLDI_UML_Profile_Diagram return AMF.Internals.CMOF_Element is begin return Base + 24; end MC_UMLDI_UML_Profile_Diagram; ---------------------------------- -- MC_UMLDI_UML_Redefines_Label -- ---------------------------------- function MC_UMLDI_UML_Redefines_Label return AMF.Internals.CMOF_Element is begin return Base + 25; end MC_UMLDI_UML_Redefines_Label; ------------------------ -- MC_UMLDI_UML_Shape -- ------------------------ function MC_UMLDI_UML_Shape return AMF.Internals.CMOF_Element is begin return Base + 26; end MC_UMLDI_UML_Shape; ---------------------------------------- -- MC_UMLDI_UML_State_Machine_Diagram -- ---------------------------------------- function MC_UMLDI_UML_State_Machine_Diagram return AMF.Internals.CMOF_Element is begin return Base + 27; end MC_UMLDI_UML_State_Machine_Diagram; ------------------------------ -- MC_UMLDI_UML_State_Shape -- ------------------------------ function MC_UMLDI_UML_State_Shape return AMF.Internals.CMOF_Element is begin return Base + 28; end MC_UMLDI_UML_State_Shape; -------------------------------------------------- -- MC_UMLDI_UML_Stereotype_Property_Value_Label -- -------------------------------------------------- function MC_UMLDI_UML_Stereotype_Property_Value_Label return AMF.Internals.CMOF_Element is begin return Base + 29; end MC_UMLDI_UML_Stereotype_Property_Value_Label; ------------------------------------ -- MC_UMLDI_UML_Structure_Diagram -- ------------------------------------ function MC_UMLDI_UML_Structure_Diagram return AMF.Internals.CMOF_Element is begin return Base + 30; end MC_UMLDI_UML_Structure_Diagram; ------------------------ -- MC_UMLDI_UML_Style -- ------------------------ function MC_UMLDI_UML_Style return AMF.Internals.CMOF_Element is begin return Base + 31; end MC_UMLDI_UML_Style; -------------------------------------- -- MC_UMLDI_UML_Typed_Element_Label -- -------------------------------------- function MC_UMLDI_UML_Typed_Element_Label return AMF.Internals.CMOF_Element is begin return Base + 32; end MC_UMLDI_UML_Typed_Element_Label; ----------------------------------- -- MC_UMLDI_UML_Use_Case_Diagram -- ----------------------------------- function MC_UMLDI_UML_Use_Case_Diagram return AMF.Internals.CMOF_Element is begin return Base + 33; end MC_UMLDI_UML_Use_Case_Diagram; ----------------------------------------------------- -- MP_UMLDI_UML_Activity_Diagram_Is_Activity_Frame -- ----------------------------------------------------- function MP_UMLDI_UML_Activity_Diagram_Is_Activity_Frame return AMF.Internals.CMOF_Element is begin return Base + 39; end MP_UMLDI_UML_Activity_Diagram_Is_Activity_Frame; ----------------------------------------------------------------------- -- MP_UMLDI_UML_Activity_Diagram_Model_Element_A_Uml_Diagram_Element -- ----------------------------------------------------------------------- function MP_UMLDI_UML_Activity_Diagram_Model_Element_A_Uml_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 40; end MP_UMLDI_UML_Activity_Diagram_Model_Element_A_Uml_Diagram_Element; ---------------------------------------------------------------------------- -- MP_UMLDI_UML_Association_End_Label_Model_Element_A_Uml_Diagram_Element -- ---------------------------------------------------------------------------- function MP_UMLDI_UML_Association_End_Label_Model_Element_A_Uml_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 41; end MP_UMLDI_UML_Association_End_Label_Model_Element_A_Uml_Diagram_Element; -------------------------------------------------------------- -- MP_UMLDI_UML_Association_Or_Connector_Or_Link_Shape_Kind -- -------------------------------------------------------------- function MP_UMLDI_UML_Association_Or_Connector_Or_Link_Shape_Kind return AMF.Internals.CMOF_Element is begin return Base + 42; end MP_UMLDI_UML_Association_Or_Connector_Or_Link_Shape_Kind; ----------------------------------------------------------------------- -- MP_UMLDI_UML_Behavior_Diagram_Model_Element_A_Uml_Diagram_Element -- ----------------------------------------------------------------------- function MP_UMLDI_UML_Behavior_Diagram_Model_Element_A_Uml_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 43; end MP_UMLDI_UML_Behavior_Diagram_Model_Element_A_Uml_Diagram_Element; -------------------------------------------------------------------------------- -- MP_UMLDI_UML_Class_Or_Composite_Structure_Diagram_Is_Association_Dot_Shown -- -------------------------------------------------------------------------------- function MP_UMLDI_UML_Class_Or_Composite_Structure_Diagram_Is_Association_Dot_Shown return AMF.Internals.CMOF_Element is begin return Base + 44; end MP_UMLDI_UML_Class_Or_Composite_Structure_Diagram_Is_Association_Dot_Shown; ----------------------------------------------------------------------------- -- MP_UMLDI_UML_Class_Or_Composite_Structure_Diagram_Navigability_Notation -- ----------------------------------------------------------------------------- function MP_UMLDI_UML_Class_Or_Composite_Structure_Diagram_Navigability_Notation return AMF.Internals.CMOF_Element is begin return Base + 45; end MP_UMLDI_UML_Class_Or_Composite_Structure_Diagram_Navigability_Notation; --------------------------------------------------------------------------------- -- MP_UMLDI_UML_Class_Or_Composite_Structure_Diagram_Non_Navigability_Notation -- --------------------------------------------------------------------------------- function MP_UMLDI_UML_Class_Or_Composite_Structure_Diagram_Non_Navigability_Notation return AMF.Internals.CMOF_Element is begin return Base + 46; end MP_UMLDI_UML_Class_Or_Composite_Structure_Diagram_Non_Navigability_Notation; --------------------------------------------------- -- MP_UMLDI_UML_Classifier_Shape_Is_Double_Sided -- --------------------------------------------------- function MP_UMLDI_UML_Classifier_Shape_Is_Double_Sided return AMF.Internals.CMOF_Element is begin return Base + 47; end MP_UMLDI_UML_Classifier_Shape_Is_Double_Sided; ------------------------------------------------------------ -- MP_UMLDI_UML_Classifier_Shape_Is_Indent_For_Visibility -- ------------------------------------------------------------ function MP_UMLDI_UML_Classifier_Shape_Is_Indent_For_Visibility return AMF.Internals.CMOF_Element is begin return Base + 48; end MP_UMLDI_UML_Classifier_Shape_Is_Indent_For_Visibility; ----------------------------------------------------------------------- -- MP_UMLDI_UML_Classifier_Shape_Model_Element_A_Uml_Diagram_Element -- ----------------------------------------------------------------------- function MP_UMLDI_UML_Classifier_Shape_Model_Element_A_Uml_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 49; end MP_UMLDI_UML_Classifier_Shape_Model_Element_A_Uml_Diagram_Element; -------------------------------------------------------------------------- -- MP_UMLDI_UML_Compartment_Element_In_Compartment_A_Owning_Compartment -- -------------------------------------------------------------------------- function MP_UMLDI_UML_Compartment_Element_In_Compartment_A_Owning_Compartment return AMF.Internals.CMOF_Element is begin return Base + 34; end MP_UMLDI_UML_Compartment_Element_In_Compartment_A_Owning_Compartment; -------------------------------------------------------------------------- -- MP_UMLDI_UML_Compartmentable_Shape_Compartment_A_Compartmented_Shape -- -------------------------------------------------------------------------- function MP_UMLDI_UML_Compartmentable_Shape_Compartment_A_Compartmented_Shape return AMF.Internals.CMOF_Element is begin return Base + 35; end MP_UMLDI_UML_Compartmentable_Shape_Compartment_A_Compartmented_Shape; --------------------------------------------------- -- MP_UMLDI_UML_Diagram_Heading_A_Headed_Diagram -- --------------------------------------------------- function MP_UMLDI_UML_Diagram_Heading_A_Headed_Diagram return AMF.Internals.CMOF_Element is begin return Base + 50; end MP_UMLDI_UML_Diagram_Heading_A_Headed_Diagram; ----------------------------------- -- MP_UMLDI_UML_Diagram_Is_Frame -- ----------------------------------- function MP_UMLDI_UML_Diagram_Is_Frame return AMF.Internals.CMOF_Element is begin return Base + 51; end MP_UMLDI_UML_Diagram_Is_Frame; --------------------------------- -- MP_UMLDI_UML_Diagram_Is_Iso -- --------------------------------- function MP_UMLDI_UML_Diagram_Is_Iso return AMF.Internals.CMOF_Element is begin return Base + 52; end MP_UMLDI_UML_Diagram_Is_Iso; ------------------------------------------ -- MP_UMLDI_UML_Diagram_Element_Is_Icon -- ------------------------------------------ function MP_UMLDI_UML_Diagram_Element_Is_Icon return AMF.Internals.CMOF_Element is begin return Base + 53; end MP_UMLDI_UML_Diagram_Element_Is_Icon; --------------------------------------------------------------- -- MP_UMLDI_UML_Diagram_Element_Local_Style_A_Styled_Element -- --------------------------------------------------------------- function MP_UMLDI_UML_Diagram_Element_Local_Style_A_Styled_Element return AMF.Internals.CMOF_Element is begin return Base + 54; end MP_UMLDI_UML_Diagram_Element_Local_Style_A_Styled_Element; ---------------------------------------------------------------------- -- MP_UMLDI_UML_Diagram_Element_Model_Element_A_Uml_Diagram_Element -- ---------------------------------------------------------------------- function MP_UMLDI_UML_Diagram_Element_Model_Element_A_Uml_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 36; end MP_UMLDI_UML_Diagram_Element_Model_Element_A_Uml_Diagram_Element; ----------------------------------------------------------------------------------- -- MP_UMLDI_UML_Diagram_Element_Owned_Element_UML_Diagram_Element_Owning_Element -- ----------------------------------------------------------------------------------- function MP_UMLDI_UML_Diagram_Element_Owned_Element_UML_Diagram_Element_Owning_Element return AMF.Internals.CMOF_Element is begin return Base + 37; end MP_UMLDI_UML_Diagram_Element_Owned_Element_UML_Diagram_Element_Owning_Element; ----------------------------------------------------------------------------------- -- MP_UMLDI_UML_Diagram_Element_Owning_Element_UML_Diagram_Element_Owned_Element -- ----------------------------------------------------------------------------------- function MP_UMLDI_UML_Diagram_Element_Owning_Element_UML_Diagram_Element_Owned_Element return AMF.Internals.CMOF_Element is begin return Base + 55; end MP_UMLDI_UML_Diagram_Element_Owning_Element_UML_Diagram_Element_Owned_Element; ---------------------------------------------------------------- -- MP_UMLDI_UML_Diagram_Element_Shared_Style_A_Styled_Element -- ---------------------------------------------------------------- function MP_UMLDI_UML_Diagram_Element_Shared_Style_A_Styled_Element return AMF.Internals.CMOF_Element is begin return Base + 56; end MP_UMLDI_UML_Diagram_Element_Shared_Style_A_Styled_Element; -------------------------------------------- -- MP_UMLDI_UML_Edge_Source_A_Source_Edge -- -------------------------------------------- function MP_UMLDI_UML_Edge_Source_A_Source_Edge return AMF.Internals.CMOF_Element is begin return Base + 57; end MP_UMLDI_UML_Edge_Source_A_Source_Edge; -------------------------------------------- -- MP_UMLDI_UML_Edge_Target_A_Target_Edge -- -------------------------------------------- function MP_UMLDI_UML_Edge_Target_A_Target_Edge return AMF.Internals.CMOF_Element is begin return Base + 58; end MP_UMLDI_UML_Edge_Target_A_Target_Edge; ------------------------------------------- -- MP_UMLDI_UML_Interaction_Diagram_Kind -- ------------------------------------------- function MP_UMLDI_UML_Interaction_Diagram_Kind return AMF.Internals.CMOF_Element is begin return Base + 59; end MP_UMLDI_UML_Interaction_Diagram_Kind; -------------------------------------------------------------------------- -- MP_UMLDI_UML_Interaction_Diagram_Model_Element_A_Uml_Diagram_Element -- -------------------------------------------------------------------------- function MP_UMLDI_UML_Interaction_Diagram_Model_Element_A_Uml_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 60; end MP_UMLDI_UML_Interaction_Diagram_Model_Element_A_Uml_Diagram_Element; ----------------------------------------------- -- MP_UMLDI_UML_Interaction_Table_Label_Kind -- ----------------------------------------------- function MP_UMLDI_UML_Interaction_Table_Label_Kind return AMF.Internals.CMOF_Element is begin return Base + 61; end MP_UMLDI_UML_Interaction_Table_Label_Kind; ----------------------------- -- MP_UMLDI_UML_Label_Text -- ----------------------------- function MP_UMLDI_UML_Label_Text return AMF.Internals.CMOF_Element is begin return Base + 62; end MP_UMLDI_UML_Label_Text; ------------------------------------------------------------------------- -- MP_UMLDI_UML_Multiplicity_Label_Model_Element_A_Uml_Diagram_Element -- ------------------------------------------------------------------------- function MP_UMLDI_UML_Multiplicity_Label_Model_Element_A_Uml_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 63; end MP_UMLDI_UML_Multiplicity_Label_Model_Element_A_Uml_Diagram_Element; ---------------------------------------------------------------- -- MP_UMLDI_UML_Name_Label_Mode_Element_A_Uml_Diagram_Element -- ---------------------------------------------------------------- function MP_UMLDI_UML_Name_Label_Mode_Element_A_Uml_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 64; end MP_UMLDI_UML_Name_Label_Mode_Element_A_Uml_Diagram_Element; ---------------------------------------------------------------------- -- MP_UMLDI_UML_Redefines_Label_Model_Element_A_Uml_Diagram_Element -- ---------------------------------------------------------------------- function MP_UMLDI_UML_Redefines_Label_Model_Element_A_Uml_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 65; end MP_UMLDI_UML_Redefines_Label_Model_Element_A_Uml_Diagram_Element; --------------------------------------------------------------- -- MP_UMLDI_UML_State_Machine_Diagram_Inherited_State_Border -- --------------------------------------------------------------- function MP_UMLDI_UML_State_Machine_Diagram_Inherited_State_Border return AMF.Internals.CMOF_Element is begin return Base + 66; end MP_UMLDI_UML_State_Machine_Diagram_Inherited_State_Border; --------------------------------------------------------------- -- MP_UMLDI_UML_State_Machine_Diagram_Is_Collapse_State_Icon -- --------------------------------------------------------------- function MP_UMLDI_UML_State_Machine_Diagram_Is_Collapse_State_Icon return AMF.Internals.CMOF_Element is begin return Base + 67; end MP_UMLDI_UML_State_Machine_Diagram_Is_Collapse_State_Icon; --------------------------------------------------------------- -- MP_UMLDI_UML_State_Machine_Diagram_Is_Transition_Oriented -- --------------------------------------------------------------- function MP_UMLDI_UML_State_Machine_Diagram_Is_Transition_Oriented return AMF.Internals.CMOF_Element is begin return Base + 68; end MP_UMLDI_UML_State_Machine_Diagram_Is_Transition_Oriented; ---------------------------------------------------------------------------- -- MP_UMLDI_UML_State_Machine_Diagram_Model_Element_A_Uml_Diagram_Element -- ---------------------------------------------------------------------------- function MP_UMLDI_UML_State_Machine_Diagram_Model_Element_A_Uml_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 69; end MP_UMLDI_UML_State_Machine_Diagram_Model_Element_A_Uml_Diagram_Element; ---------------------------------------- -- MP_UMLDI_UML_State_Shape_Is_Tabbed -- ---------------------------------------- function MP_UMLDI_UML_State_Shape_Is_Tabbed return AMF.Internals.CMOF_Element is begin return Base + 70; end MP_UMLDI_UML_State_Shape_Is_Tabbed; ------------------------------------------------------------------ -- MP_UMLDI_UML_State_Shape_Model_Element_A_Uml_Diagram_Element -- ------------------------------------------------------------------ function MP_UMLDI_UML_State_Shape_Model_Element_A_Uml_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 38; end MP_UMLDI_UML_State_Shape_Model_Element_A_Uml_Diagram_Element; -------------------------------------------------------------------------------------- -- MP_UMLDI_UML_Stereotype_Property_Value_Label_Model_Element_A_Uml_Diagram_Element -- -------------------------------------------------------------------------------------- function MP_UMLDI_UML_Stereotype_Property_Value_Label_Model_Element_A_Uml_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 71; end MP_UMLDI_UML_Stereotype_Property_Value_Label_Model_Element_A_Uml_Diagram_Element; ------------------------------------------------------------------------------------------------------- -- MP_UMLDI_UML_Stereotype_Property_Value_Label_Stereotyped_Element_A_Label_Showing_Stereotype_Value -- ------------------------------------------------------------------------------------------------------- function MP_UMLDI_UML_Stereotype_Property_Value_Label_Stereotyped_Element_A_Label_Showing_Stereotype_Value return AMF.Internals.CMOF_Element is begin return Base + 72; end MP_UMLDI_UML_Stereotype_Property_Value_Label_Stereotyped_Element_A_Label_Showing_Stereotype_Value; ---------------------------------- -- MP_UMLDI_UML_Style_Font_Name -- ---------------------------------- function MP_UMLDI_UML_Style_Font_Name return AMF.Internals.CMOF_Element is begin return Base + 73; end MP_UMLDI_UML_Style_Font_Name; ---------------------------------- -- MP_UMLDI_UML_Style_Font_Size -- ---------------------------------- function MP_UMLDI_UML_Style_Font_Size return AMF.Internals.CMOF_Element is begin return Base + 74; end MP_UMLDI_UML_Style_Font_Size; ----------------------------------------------------------------------- -- MP_UMLDI_A_Uml_Diagram_Element_UML_Activity_Diagram_Model_Element -- ----------------------------------------------------------------------- function MP_UMLDI_A_Uml_Diagram_Element_UML_Activity_Diagram_Model_Element return AMF.Internals.CMOF_Element is begin return Base + 97; end MP_UMLDI_A_Uml_Diagram_Element_UML_Activity_Diagram_Model_Element; ---------------------------------------------------------------------------- -- MP_UMLDI_A_Uml_Diagram_Element_UML_Association_End_Label_Model_Element -- ---------------------------------------------------------------------------- function MP_UMLDI_A_Uml_Diagram_Element_UML_Association_End_Label_Model_Element return AMF.Internals.CMOF_Element is begin return Base + 98; end MP_UMLDI_A_Uml_Diagram_Element_UML_Association_End_Label_Model_Element; ----------------------------------------------------------------------- -- MP_UMLDI_A_Uml_Diagram_Element_UML_Behavior_Diagram_Model_Element -- ----------------------------------------------------------------------- function MP_UMLDI_A_Uml_Diagram_Element_UML_Behavior_Diagram_Model_Element return AMF.Internals.CMOF_Element is begin return Base + 99; end MP_UMLDI_A_Uml_Diagram_Element_UML_Behavior_Diagram_Model_Element; ----------------------------------------------------------------------- -- MP_UMLDI_A_Uml_Diagram_Element_UML_Classifier_Shape_Model_Element -- ----------------------------------------------------------------------- function MP_UMLDI_A_Uml_Diagram_Element_UML_Classifier_Shape_Model_Element return AMF.Internals.CMOF_Element is begin return Base + 100; end MP_UMLDI_A_Uml_Diagram_Element_UML_Classifier_Shape_Model_Element; -------------------------------------------------------------------------- -- MP_UMLDI_A_Owning_Compartment_UML_Compartment_Element_In_Compartment -- -------------------------------------------------------------------------- function MP_UMLDI_A_Owning_Compartment_UML_Compartment_Element_In_Compartment return AMF.Internals.CMOF_Element is begin return Base + 101; end MP_UMLDI_A_Owning_Compartment_UML_Compartment_Element_In_Compartment; -------------------------------------------------------------------------- -- MP_UMLDI_A_Compartmented_Shape_UML_Compartmentable_Shape_Compartment -- -------------------------------------------------------------------------- function MP_UMLDI_A_Compartmented_Shape_UML_Compartmentable_Shape_Compartment return AMF.Internals.CMOF_Element is begin return Base + 103; end MP_UMLDI_A_Compartmented_Shape_UML_Compartmentable_Shape_Compartment; --------------------------------------------------------------- -- MP_UMLDI_A_Styled_Element_UML_Diagram_Element_Local_Style -- --------------------------------------------------------------- function MP_UMLDI_A_Styled_Element_UML_Diagram_Element_Local_Style return AMF.Internals.CMOF_Element is begin return Base + 104; end MP_UMLDI_A_Styled_Element_UML_Diagram_Element_Local_Style; ---------------------------------------------------------------------- -- MP_UMLDI_A_Uml_Diagram_Element_UML_Diagram_Element_Model_Element -- ---------------------------------------------------------------------- function MP_UMLDI_A_Uml_Diagram_Element_UML_Diagram_Element_Model_Element return AMF.Internals.CMOF_Element is begin return Base + 105; end MP_UMLDI_A_Uml_Diagram_Element_UML_Diagram_Element_Model_Element; ---------------------------------------------------------------- -- MP_UMLDI_A_Styled_Element_UML_Diagram_Element_Shared_Style -- ---------------------------------------------------------------- function MP_UMLDI_A_Styled_Element_UML_Diagram_Element_Shared_Style return AMF.Internals.CMOF_Element is begin return Base + 106; end MP_UMLDI_A_Styled_Element_UML_Diagram_Element_Shared_Style; --------------------------------------------------- -- MP_UMLDI_A_Headed_Diagram_UML_Diagram_Heading -- --------------------------------------------------- function MP_UMLDI_A_Headed_Diagram_UML_Diagram_Heading return AMF.Internals.CMOF_Element is begin return Base + 107; end MP_UMLDI_A_Headed_Diagram_UML_Diagram_Heading; -------------------------------------------- -- MP_UMLDI_A_Source_Edge_UML_Edge_Source -- -------------------------------------------- function MP_UMLDI_A_Source_Edge_UML_Edge_Source return AMF.Internals.CMOF_Element is begin return Base + 108; end MP_UMLDI_A_Source_Edge_UML_Edge_Source; -------------------------------------------- -- MP_UMLDI_A_Target_Edge_UML_Edge_Target -- -------------------------------------------- function MP_UMLDI_A_Target_Edge_UML_Edge_Target return AMF.Internals.CMOF_Element is begin return Base + 109; end MP_UMLDI_A_Target_Edge_UML_Edge_Target; -------------------------------------------------------------------------- -- MP_UMLDI_A_Uml_Diagram_Element_UML_Interaction_Diagram_Model_Element -- -------------------------------------------------------------------------- function MP_UMLDI_A_Uml_Diagram_Element_UML_Interaction_Diagram_Model_Element return AMF.Internals.CMOF_Element is begin return Base + 110; end MP_UMLDI_A_Uml_Diagram_Element_UML_Interaction_Diagram_Model_Element; ------------------------------------------------------------------------- -- MP_UMLDI_A_Uml_Diagram_Element_UML_Multiplicity_Label_Model_Element -- ------------------------------------------------------------------------- function MP_UMLDI_A_Uml_Diagram_Element_UML_Multiplicity_Label_Model_Element return AMF.Internals.CMOF_Element is begin return Base + 111; end MP_UMLDI_A_Uml_Diagram_Element_UML_Multiplicity_Label_Model_Element; ---------------------------------------------------------------- -- MP_UMLDI_A_Uml_Diagram_Element_UML_Name_Label_Mode_Element -- ---------------------------------------------------------------- function MP_UMLDI_A_Uml_Diagram_Element_UML_Name_Label_Mode_Element return AMF.Internals.CMOF_Element is begin return Base + 112; end MP_UMLDI_A_Uml_Diagram_Element_UML_Name_Label_Mode_Element; ---------------------------------------------------------------------- -- MP_UMLDI_A_Uml_Diagram_Element_UML_Redefines_Label_Model_Element -- ---------------------------------------------------------------------- function MP_UMLDI_A_Uml_Diagram_Element_UML_Redefines_Label_Model_Element return AMF.Internals.CMOF_Element is begin return Base + 113; end MP_UMLDI_A_Uml_Diagram_Element_UML_Redefines_Label_Model_Element; ---------------------------------------------------------------------------- -- MP_UMLDI_A_Uml_Diagram_Element_UML_State_Machine_Diagram_Model_Element -- ---------------------------------------------------------------------------- function MP_UMLDI_A_Uml_Diagram_Element_UML_State_Machine_Diagram_Model_Element return AMF.Internals.CMOF_Element is begin return Base + 114; end MP_UMLDI_A_Uml_Diagram_Element_UML_State_Machine_Diagram_Model_Element; ------------------------------------------------------------------ -- MP_UMLDI_A_Uml_Diagram_Element_UML_State_Shape_Model_Element -- ------------------------------------------------------------------ function MP_UMLDI_A_Uml_Diagram_Element_UML_State_Shape_Model_Element return AMF.Internals.CMOF_Element is begin return Base + 115; end MP_UMLDI_A_Uml_Diagram_Element_UML_State_Shape_Model_Element; -------------------------------------------------------------------------------------- -- MP_UMLDI_A_Uml_Diagram_Element_UML_Stereotype_Property_Value_Label_Model_Element -- -------------------------------------------------------------------------------------- function MP_UMLDI_A_Uml_Diagram_Element_UML_Stereotype_Property_Value_Label_Model_Element return AMF.Internals.CMOF_Element is begin return Base + 116; end MP_UMLDI_A_Uml_Diagram_Element_UML_Stereotype_Property_Value_Label_Model_Element; ------------------------------------------------------------------------------------------------------- -- MP_UMLDI_A_Label_Showing_Stereotype_Value_UML_Stereotype_Property_Value_Label_Stereotyped_Element -- ------------------------------------------------------------------------------------------------------- function MP_UMLDI_A_Label_Showing_Stereotype_Value_UML_Stereotype_Property_Value_Label_Stereotyped_Element return AMF.Internals.CMOF_Element is begin return Base + 117; end MP_UMLDI_A_Label_Showing_Stereotype_Value_UML_Stereotype_Property_Value_Label_Stereotyped_Element; --------------------------------------------------------------------- -- MA_UMLDI_UML_Activity_Diagram_Model_Element_Uml_Diagram_Element -- --------------------------------------------------------------------- function MA_UMLDI_UML_Activity_Diagram_Model_Element_Uml_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 75; end MA_UMLDI_UML_Activity_Diagram_Model_Element_Uml_Diagram_Element; -------------------------------------------------------------------------- -- MA_UMLDI_UML_Association_End_Label_Model_Element_Uml_Diagram_Element -- -------------------------------------------------------------------------- function MA_UMLDI_UML_Association_End_Label_Model_Element_Uml_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 76; end MA_UMLDI_UML_Association_End_Label_Model_Element_Uml_Diagram_Element; --------------------------------------------------------------------- -- MA_UMLDI_UML_Behavior_Diagram_Model_Element_Uml_Diagram_Element -- --------------------------------------------------------------------- function MA_UMLDI_UML_Behavior_Diagram_Model_Element_Uml_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 77; end MA_UMLDI_UML_Behavior_Diagram_Model_Element_Uml_Diagram_Element; --------------------------------------------------------------------- -- MA_UMLDI_UML_Classifier_Shape_Model_Element_Uml_Diagram_Element -- --------------------------------------------------------------------- function MA_UMLDI_UML_Classifier_Shape_Model_Element_Uml_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 78; end MA_UMLDI_UML_Classifier_Shape_Model_Element_Uml_Diagram_Element; ------------------------------------------------------------------------ -- MA_UMLDI_UML_Compartment_Element_In_Compartment_Owning_Compartment -- ------------------------------------------------------------------------ function MA_UMLDI_UML_Compartment_Element_In_Compartment_Owning_Compartment return AMF.Internals.CMOF_Element is begin return Base + 79; end MA_UMLDI_UML_Compartment_Element_In_Compartment_Owning_Compartment; ------------------------------------------------------------------------ -- MA_UMLDI_UML_Compartmentable_Shape_Compartment_Compartmented_Shape -- ------------------------------------------------------------------------ function MA_UMLDI_UML_Compartmentable_Shape_Compartment_Compartmented_Shape return AMF.Internals.CMOF_Element is begin return Base + 80; end MA_UMLDI_UML_Compartmentable_Shape_Compartment_Compartmented_Shape; ------------------------------------------------------------- -- MA_UMLDI_UML_Diagram_Element_Local_Style_Styled_Element -- ------------------------------------------------------------- function MA_UMLDI_UML_Diagram_Element_Local_Style_Styled_Element return AMF.Internals.CMOF_Element is begin return Base + 81; end MA_UMLDI_UML_Diagram_Element_Local_Style_Styled_Element; -------------------------------------------------------------------- -- MA_UMLDI_UML_Diagram_Element_Model_Element_Uml_Diagram_Element -- -------------------------------------------------------------------- function MA_UMLDI_UML_Diagram_Element_Model_Element_Uml_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 82; end MA_UMLDI_UML_Diagram_Element_Model_Element_Uml_Diagram_Element; --------------------------------------------------------------- -- MA_UMLDI_UML_Diagram_Element_Owned_Element_Owning_Element -- --------------------------------------------------------------- function MA_UMLDI_UML_Diagram_Element_Owned_Element_Owning_Element return AMF.Internals.CMOF_Element is begin return Base + 83; end MA_UMLDI_UML_Diagram_Element_Owned_Element_Owning_Element; -------------------------------------------------------------- -- MA_UMLDI_UML_Diagram_Element_Shared_Style_Styled_Element -- -------------------------------------------------------------- function MA_UMLDI_UML_Diagram_Element_Shared_Style_Styled_Element return AMF.Internals.CMOF_Element is begin return Base + 84; end MA_UMLDI_UML_Diagram_Element_Shared_Style_Styled_Element; ------------------------------------------------- -- MA_UMLDI_UML_Diagram_Heading_Headed_Diagram -- ------------------------------------------------- function MA_UMLDI_UML_Diagram_Heading_Headed_Diagram return AMF.Internals.CMOF_Element is begin return Base + 85; end MA_UMLDI_UML_Diagram_Heading_Headed_Diagram; ------------------------------------------ -- MA_UMLDI_UML_Edge_Source_Source_Edge -- ------------------------------------------ function MA_UMLDI_UML_Edge_Source_Source_Edge return AMF.Internals.CMOF_Element is begin return Base + 86; end MA_UMLDI_UML_Edge_Source_Source_Edge; ------------------------------------------ -- MA_UMLDI_UML_Edge_Target_Target_Edge -- ------------------------------------------ function MA_UMLDI_UML_Edge_Target_Target_Edge return AMF.Internals.CMOF_Element is begin return Base + 87; end MA_UMLDI_UML_Edge_Target_Target_Edge; ------------------------------------------------------------------------ -- MA_UMLDI_UML_Interaction_Diagram_Model_Element_Uml_Diagram_Element -- ------------------------------------------------------------------------ function MA_UMLDI_UML_Interaction_Diagram_Model_Element_Uml_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 88; end MA_UMLDI_UML_Interaction_Diagram_Model_Element_Uml_Diagram_Element; ----------------------------------------------------------------------- -- MA_UMLDI_UML_Multiplicity_Label_Model_Element_Uml_Diagram_Element -- ----------------------------------------------------------------------- function MA_UMLDI_UML_Multiplicity_Label_Model_Element_Uml_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 89; end MA_UMLDI_UML_Multiplicity_Label_Model_Element_Uml_Diagram_Element; -------------------------------------------------------------- -- MA_UMLDI_UML_Name_Label_Mode_Element_Uml_Diagram_Element -- -------------------------------------------------------------- function MA_UMLDI_UML_Name_Label_Mode_Element_Uml_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 90; end MA_UMLDI_UML_Name_Label_Mode_Element_Uml_Diagram_Element; -------------------------------------------------------------------- -- MA_UMLDI_UML_Redefines_Label_Model_Element_Uml_Diagram_Element -- -------------------------------------------------------------------- function MA_UMLDI_UML_Redefines_Label_Model_Element_Uml_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 91; end MA_UMLDI_UML_Redefines_Label_Model_Element_Uml_Diagram_Element; -------------------------------------------------------------------------- -- MA_UMLDI_UML_State_Machine_Diagram_Model_Element_Uml_Diagram_Element -- -------------------------------------------------------------------------- function MA_UMLDI_UML_State_Machine_Diagram_Model_Element_Uml_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 92; end MA_UMLDI_UML_State_Machine_Diagram_Model_Element_Uml_Diagram_Element; ---------------------------------------------------------------- -- MA_UMLDI_UML_State_Shape_Model_Element_Uml_Diagram_Element -- ---------------------------------------------------------------- function MA_UMLDI_UML_State_Shape_Model_Element_Uml_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 93; end MA_UMLDI_UML_State_Shape_Model_Element_Uml_Diagram_Element; ------------------------------------------------------------------------------------ -- MA_UMLDI_UML_Stereotype_Property_Value_Label_Model_Element_Uml_Diagram_Element -- ------------------------------------------------------------------------------------ function MA_UMLDI_UML_Stereotype_Property_Value_Label_Model_Element_Uml_Diagram_Element return AMF.Internals.CMOF_Element is begin return Base + 94; end MA_UMLDI_UML_Stereotype_Property_Value_Label_Model_Element_Uml_Diagram_Element; ----------------------------------------------------------------------------------------------------- -- MA_UMLDI_UML_Stereotype_Property_Value_Label_Stereotyped_Element_Label_Showing_Stereotype_Value -- ----------------------------------------------------------------------------------------------------- function MA_UMLDI_UML_Stereotype_Property_Value_Label_Stereotyped_Element_Label_Showing_Stereotype_Value return AMF.Internals.CMOF_Element is begin return Base + 95; end MA_UMLDI_UML_Stereotype_Property_Value_Label_Stereotyped_Element_Label_Showing_Stereotype_Value; -------------- -- MB_UMLDI -- -------------- function MB_UMLDI return AMF.Internals.AMF_Element is begin return Base; end MB_UMLDI; -------------- -- MB_UMLDI -- -------------- function ML_UMLDI return AMF.Internals.AMF_Element is begin return Base + 319; end ML_UMLDI; end AMF.Internals.Tables.UMLDI_Metamodel;

42.461538

146

0.5493

38da61fbf2e3d8ab46046c005b4104ff98e8d523

14,115

ads

Ada

arch/ARM/STM32/svd/stm32l151/stm32_svd-dac.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/stm32l151/stm32_svd-dac.ads

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

null

arch/ARM/STM32/svd/stm32l151/stm32_svd-dac.ads

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

null

-- This spec has been automatically generated from STM32L151.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with HAL; with System; package STM32_SVD.DAC is pragma Preelaborate; --------------- -- Registers -- --------------- subtype CR_TSEL1_Field is HAL.UInt3; subtype CR_WAVE1_Field is HAL.UInt2; subtype CR_MAMP1_Field is HAL.UInt4; subtype CR_TSEL2_Field is HAL.UInt3; subtype CR_WAVE2_Field is HAL.UInt2; subtype CR_MAMP2_Field is HAL.UInt4; -- control register type CR_Register is record -- DAC channel1 enable EN1 : Boolean := False; -- DAC channel1 output buffer disable BOFF1 : Boolean := False; -- DAC channel1 trigger enable TEN1 : Boolean := False; -- DAC channel1 trigger selection TSEL1 : CR_TSEL1_Field := 16#0#; -- DAC channel1 noise/triangle wave generation enable WAVE1 : CR_WAVE1_Field := 16#0#; -- DAC channel1 mask/amplitude selector MAMP1 : CR_MAMP1_Field := 16#0#; -- DAC channel1 DMA enable DMAEN1 : Boolean := False; -- DAC channel1 DMA Underrun Interrupt enable DMAUDRIE1 : Boolean := False; -- unspecified Reserved_14_15 : HAL.UInt2 := 16#0#; -- DAC channel2 enable EN2 : Boolean := False; -- DAC channel2 output buffer disable BOFF2 : Boolean := False; -- DAC channel2 trigger enable TEN2 : Boolean := False; -- DAC channel2 trigger selection TSEL2 : CR_TSEL2_Field := 16#0#; -- DAC channel2 noise/triangle wave generation enable WAVE2 : CR_WAVE2_Field := 16#0#; -- DAC channel2 mask/amplitude selector MAMP2 : CR_MAMP2_Field := 16#0#; -- DAC channel2 DMA enable DMAEN2 : Boolean := False; -- DAC channel2 DMA underrun interrupt enable DMAUDRIE2 : Boolean := False; -- unspecified Reserved_30_31 : HAL.UInt2 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR_Register use record EN1 at 0 range 0 .. 0; BOFF1 at 0 range 1 .. 1; TEN1 at 0 range 2 .. 2; TSEL1 at 0 range 3 .. 5; WAVE1 at 0 range 6 .. 7; MAMP1 at 0 range 8 .. 11; DMAEN1 at 0 range 12 .. 12; DMAUDRIE1 at 0 range 13 .. 13; Reserved_14_15 at 0 range 14 .. 15; EN2 at 0 range 16 .. 16; BOFF2 at 0 range 17 .. 17; TEN2 at 0 range 18 .. 18; TSEL2 at 0 range 19 .. 21; WAVE2 at 0 range 22 .. 23; MAMP2 at 0 range 24 .. 27; DMAEN2 at 0 range 28 .. 28; DMAUDRIE2 at 0 range 29 .. 29; Reserved_30_31 at 0 range 30 .. 31; end record; -- SWTRIGR_SWTRIG array type SWTRIGR_SWTRIG_Field_Array is array (1 .. 2) of Boolean with Component_Size => 1, Size => 2; -- Type definition for SWTRIGR_SWTRIG type SWTRIGR_SWTRIG_Field (As_Array : Boolean := False) is record case As_Array is when False => -- SWTRIG as a value Val : HAL.UInt2; when True => -- SWTRIG as an array Arr : SWTRIGR_SWTRIG_Field_Array; end case; end record with Unchecked_Union, Size => 2; for SWTRIGR_SWTRIG_Field use record Val at 0 range 0 .. 1; Arr at 0 range 0 .. 1; end record; -- software trigger register type SWTRIGR_Register is record -- Write-only. DAC channel1 software trigger SWTRIG : SWTRIGR_SWTRIG_Field := (As_Array => False, Val => 16#0#); -- unspecified Reserved_2_31 : HAL.UInt30 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for SWTRIGR_Register use record SWTRIG at 0 range 0 .. 1; Reserved_2_31 at 0 range 2 .. 31; end record; subtype DHR12R1_DACC1DHR_Field is HAL.UInt12; -- channel1 12-bit right-aligned data holding register type DHR12R1_Register is record -- DAC channel1 12-bit right-aligned data DACC1DHR : DHR12R1_DACC1DHR_Field := 16#0#; -- unspecified Reserved_12_31 : HAL.UInt20 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for DHR12R1_Register use record DACC1DHR at 0 range 0 .. 11; Reserved_12_31 at 0 range 12 .. 31; end record; subtype DHR12L1_DACC1DHR_Field is HAL.UInt12; -- channel1 12-bit left aligned data holding register type DHR12L1_Register is record -- unspecified Reserved_0_3 : HAL.UInt4 := 16#0#; -- DAC channel1 12-bit left-aligned data DACC1DHR : DHR12L1_DACC1DHR_Field := 16#0#; -- unspecified Reserved_16_31 : HAL.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for DHR12L1_Register use record Reserved_0_3 at 0 range 0 .. 3; DACC1DHR at 0 range 4 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype DHR8R1_DACC1DHR_Field is HAL.UInt8; -- channel1 8-bit right aligned data holding register type DHR8R1_Register is record -- DAC channel1 8-bit right-aligned data DACC1DHR : DHR8R1_DACC1DHR_Field := 16#0#; -- unspecified Reserved_8_31 : HAL.UInt24 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for DHR8R1_Register use record DACC1DHR at 0 range 0 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; subtype DHR12R2_DACC2DHR_Field is HAL.UInt12; -- channel2 12-bit right aligned data holding register type DHR12R2_Register is record -- DAC channel2 12-bit right-aligned data DACC2DHR : DHR12R2_DACC2DHR_Field := 16#0#; -- unspecified Reserved_12_31 : HAL.UInt20 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for DHR12R2_Register use record DACC2DHR at 0 range 0 .. 11; Reserved_12_31 at 0 range 12 .. 31; end record; subtype DHR12L2_DACC2DHR_Field is HAL.UInt12; -- channel2 12-bit left aligned data holding register type DHR12L2_Register is record -- unspecified Reserved_0_3 : HAL.UInt4 := 16#0#; -- DAC channel2 12-bit left-aligned data DACC2DHR : DHR12L2_DACC2DHR_Field := 16#0#; -- unspecified Reserved_16_31 : HAL.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for DHR12L2_Register use record Reserved_0_3 at 0 range 0 .. 3; DACC2DHR at 0 range 4 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype DHR8R2_DACC2DHR_Field is HAL.UInt8; -- channel2 8-bit right-aligned data holding register type DHR8R2_Register is record -- DAC channel2 8-bit right-aligned data DACC2DHR : DHR8R2_DACC2DHR_Field := 16#0#; -- unspecified Reserved_8_31 : HAL.UInt24 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for DHR8R2_Register use record DACC2DHR at 0 range 0 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; subtype DHR12RD_DACC1DHR_Field is HAL.UInt12; subtype DHR12RD_DACC2DHR_Field is HAL.UInt12; -- Dual DAC 12-bit right-aligned data holding register type DHR12RD_Register is record -- DAC channel1 12-bit right-aligned data DACC1DHR : DHR12RD_DACC1DHR_Field := 16#0#; -- unspecified Reserved_12_15 : HAL.UInt4 := 16#0#; -- DAC channel2 12-bit right-aligned data DACC2DHR : DHR12RD_DACC2DHR_Field := 16#0#; -- unspecified Reserved_28_31 : HAL.UInt4 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for DHR12RD_Register use record DACC1DHR at 0 range 0 .. 11; Reserved_12_15 at 0 range 12 .. 15; DACC2DHR at 0 range 16 .. 27; Reserved_28_31 at 0 range 28 .. 31; end record; subtype DHR12LD_DACC1DHR_Field is HAL.UInt12; subtype DHR12LD_DACC2DHR_Field is HAL.UInt12; -- DUAL DAC 12-bit left aligned data holding register type DHR12LD_Register is record -- unspecified Reserved_0_3 : HAL.UInt4 := 16#0#; -- DAC channel1 12-bit left-aligned data DACC1DHR : DHR12LD_DACC1DHR_Field := 16#0#; -- unspecified Reserved_16_19 : HAL.UInt4 := 16#0#; -- DAC channel2 12-bit left-aligned data DACC2DHR : DHR12LD_DACC2DHR_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for DHR12LD_Register use record Reserved_0_3 at 0 range 0 .. 3; DACC1DHR at 0 range 4 .. 15; Reserved_16_19 at 0 range 16 .. 19; DACC2DHR at 0 range 20 .. 31; end record; subtype DHR8RD_DACC1DHR_Field is HAL.UInt8; subtype DHR8RD_DACC2DHR_Field is HAL.UInt8; -- DUAL DAC 8-bit right aligned data holding register type DHR8RD_Register is record -- DAC channel1 8-bit right-aligned data DACC1DHR : DHR8RD_DACC1DHR_Field := 16#0#; -- DAC channel2 8-bit right-aligned data DACC2DHR : DHR8RD_DACC2DHR_Field := 16#0#; -- unspecified Reserved_16_31 : HAL.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for DHR8RD_Register use record DACC1DHR at 0 range 0 .. 7; DACC2DHR at 0 range 8 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype DOR1_DACC1DOR_Field is HAL.UInt12; -- channel1 data output register type DOR1_Register is record -- Read-only. DAC channel1 data output DACC1DOR : DOR1_DACC1DOR_Field; -- unspecified Reserved_12_31 : HAL.UInt20; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for DOR1_Register use record DACC1DOR at 0 range 0 .. 11; Reserved_12_31 at 0 range 12 .. 31; end record; subtype DOR2_DACC2DOR_Field is HAL.UInt12; -- channel2 data output register type DOR2_Register is record -- Read-only. DAC channel2 data output DACC2DOR : DOR2_DACC2DOR_Field; -- unspecified Reserved_12_31 : HAL.UInt20; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for DOR2_Register use record DACC2DOR at 0 range 0 .. 11; Reserved_12_31 at 0 range 12 .. 31; end record; -- status register type SR_Register is record -- unspecified Reserved_0_12 : HAL.UInt13 := 16#0#; -- DAC channel1 DMA underrun flag DMAUDR1 : Boolean := False; -- unspecified Reserved_14_28 : HAL.UInt15 := 16#0#; -- DAC channel2 DMA underrun flag DMAUDR2 : Boolean := False; -- unspecified Reserved_30_31 : HAL.UInt2 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for SR_Register use record Reserved_0_12 at 0 range 0 .. 12; DMAUDR1 at 0 range 13 .. 13; Reserved_14_28 at 0 range 14 .. 28; DMAUDR2 at 0 range 29 .. 29; Reserved_30_31 at 0 range 30 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Digital-to-analog converter type DAC_Peripheral is record -- control register CR : aliased CR_Register; -- software trigger register SWTRIGR : aliased SWTRIGR_Register; -- channel1 12-bit right-aligned data holding register DHR12R1 : aliased DHR12R1_Register; -- channel1 12-bit left aligned data holding register DHR12L1 : aliased DHR12L1_Register; -- channel1 8-bit right aligned data holding register DHR8R1 : aliased DHR8R1_Register; -- channel2 12-bit right aligned data holding register DHR12R2 : aliased DHR12R2_Register; -- channel2 12-bit left aligned data holding register DHR12L2 : aliased DHR12L2_Register; -- channel2 8-bit right-aligned data holding register DHR8R2 : aliased DHR8R2_Register; -- Dual DAC 12-bit right-aligned data holding register DHR12RD : aliased DHR12RD_Register; -- DUAL DAC 12-bit left aligned data holding register DHR12LD : aliased DHR12LD_Register; -- DUAL DAC 8-bit right aligned data holding register DHR8RD : aliased DHR8RD_Register; -- channel1 data output register DOR1 : aliased DOR1_Register; -- channel2 data output register DOR2 : aliased DOR2_Register; -- status register SR : aliased SR_Register; end record with Volatile; for DAC_Peripheral use record CR at 16#0# range 0 .. 31; SWTRIGR at 16#4# range 0 .. 31; DHR12R1 at 16#8# range 0 .. 31; DHR12L1 at 16#C# range 0 .. 31; DHR8R1 at 16#10# range 0 .. 31; DHR12R2 at 16#14# range 0 .. 31; DHR12L2 at 16#18# range 0 .. 31; DHR8R2 at 16#1C# range 0 .. 31; DHR12RD at 16#20# range 0 .. 31; DHR12LD at 16#24# range 0 .. 31; DHR8RD at 16#28# range 0 .. 31; DOR1 at 16#2C# range 0 .. 31; DOR2 at 16#30# range 0 .. 31; SR at 16#34# range 0 .. 31; end record; -- Digital-to-analog converter DAC_Periph : aliased DAC_Peripheral with Import, Address => System'To_Address (16#40007400#); end STM32_SVD.DAC;

33.527316

65

0.615374

38ac1b02a8cdc8786bde0af6eca2d485863dc830

13,681

ads

Ada

tools-src/gnu/gcc/gcc/ada/targparm.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/targparm.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/targparm.ads

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

69

2015-01-02T10:45:56.000Z

2021-09-06T07:52:13.000Z

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- T A R G P A R M -- -- -- -- S p e c -- -- -- -- $Revision$ -- -- -- Copyright (C) 1999-2001 Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package obtains parameters from the target runtime version of -- System, to indicate parameters relevant to the target environment. -- Conceptually, these parameters could be obtained using rtsfind, but -- we do not do this for three reasons: -- 1. Compiling System for every compilation wastes time -- 2. This compilation impedes debugging by adding extra compile steps -- 3. There are recursion problems coming from compiling System itself -- or any of its children. -- For all these reasons, we read in the source of System, and then scan -- it at the text level to extract the parameter values. -- Note however, that later on, when the ali file is written, we make sure -- that the System file is at least parsed, so that the checksum is properly -- computed and set in the ali file. This partially negates points 1 and 2 -- above although just parsing is quick and does not impact debugging much. package Targparm is -- The following parameters correspond to the variables defined in the -- private part of System (without the terminating _On_Target). Note -- that it is required that all parameters be specified in system.ads. ----------------------------------- -- Control of Exception Handling -- ----------------------------------- -- GNAT provides two methods of implementing exceptions: -- Longjmp/Setjmp (-gnatL) -- This approach uses longjmp/setjmp to handle exceptions. It -- uses less storage, and can often propagate exceptions faster, -- at the expense of (sometimes considerable) overhead in setting -- up an exception handler. This approach is available on all -- targets, and is the default where it is the only approach. -- Zero Cost (-gnatZ) -- This approach uses separate exception tables. These use extra -- storage, and exception propagation can be quite slow, but there -- is no overhead in setting up an exception handler (it is to this -- latter operation that the phrase zero-cost refers). This approach -- is only available on some targets, and is the default where it is -- available. ZCX_By_Default_On_Target : Boolean; -- Indicates if zero cost exceptions are active by default. Can be modified -- by the use of -gnatZ and -gnatL switches. GCC_ZCX_Support_On_Target : Boolean; -- Indicates that when ZCX is active the mechanism to be used is the -- standard GCC ZCX mechanism (introduced in GCC 3.1) Front_End_ZCX_Support_On_Target : Boolean; -- Indicates that when ZCX is active (and GCC_ZCX_Support is not set) -- the mechanism to be used is the GNAT front end specific ZCX mechanism --------------------------------------- -- High_Integrity (No Run Time) Mode -- --------------------------------------- -- In High_Integrity mode, there is no system run-time, and the flag -- Opt.No_Run_Time is set so that the language is appropriately -- restricted to forbid construct that would generate run-time calls. High_Integrity_Mode_On_Target : Boolean; -- Indicates that this build is for a high integrity mode version of -- GNAT, so that no run time is permitted. ------------------------------- -- Control of Stack Checking -- ------------------------------- -- GNAT provides two methods of implementing exceptions: -- GCC Probing Mechanism -- This approach uses the standard GCC mechanism for -- stack checking. The method assumes that accessing -- storage immediately beyond the end of the stack -- will result in a trap that is converted to a storage -- error by the runtime system. This mechanism has -- minimal overhead, but requires complex hardware, -- operating system and run-time support. Probing is -- the default method where it is available. The stack -- size for the environment task depends on the operating -- system and cannot be set in a system-independent way. -- GNAT Stack-limit Checking -- This method relies on comparing the stack pointer -- with per-task stack limits. If the check fails, an -- exception is explicitly raised. The advantage is -- that the method requires no extra system dependent -- runtime support and can be used on systems without -- memory protection as well, but at the cost of more -- overhead for doing the check. This method is the -- default on systems that lack complete support for -- probing. Stack_Check_Probes_On_Target : Boolean; -- Indicates if stack check probes are used, as opposed to the standard -- target independent comparison method. Stack_Check_Default_On_Target : Boolean; -- Indicates if stack checking is on by default ---------------------------- -- Command Line Arguments -- ---------------------------- -- For most ports of GNAT, command line arguments are supported. The -- following flag is set to False for targets that do not support -- command line arguments (notably VxWorks). Command_Line_Args_On_Target : Boolean; -- Set False if no command line arguments on target -- Note: this is prepared for future use, but not yet used, since we -- do not yet have a way of propagating Targparm params to the binder ----------------------- -- Main Program Name -- ----------------------- -- When the binder generates the main program to be used to create the -- executable, the main program name is main by default (to match the -- usual Unix practice). If this parameter is set to True, then the -- name is instead by default taken from the actual Ada main program -- name (just the name of the child if the main program is a child unit). -- In either case, this value can be overridden using -M name. Use_Ada_Main_Program_Name_On_Target : Boolean; -- Set True to use the Ada main program name as the main name -- Note: this is prepared for future use, but not yet used, since we -- do not yet have a way of propagating Targparm params to the binder ---------------------------- -- Support of Long Shifts -- ---------------------------- -- In GNORT mode, we cannot call library routines, and in particular -- we cannot call routines for long (64-bit) shifts if such routines -- are required on the target. This comes up in the context of support -- of packed arrays. We can only represent packed arrays whose length -- is in the range 33- to 64-bits as modular types if long shifts are -- done with inline code. -- For the default version, for now we set long shifts inlined as True -- This may not be quite accurate, but until we get proper separate -- System's for each target, it is a safer choice. Long_Shifts_Inlined_On_Target : Boolean; -- Indicates if long (double word) shifts are generated using inlined -- code (and thus are permissible in No_Run_Time mode). ---------------------------------------------- -- Boolean-Valued Floating-Point Attributes -- ---------------------------------------------- -- The constants below give the values for representation oriented -- floating-point attributes that are the same for all float types -- on the target. These are all boolean values. -- A value is only True if the target reliably supports the corresponding -- feature. Reliably here means that support is guaranteed for all -- possible settings of the relevant compiler switches (like -mieee), -- since we cannot control the user setting of those switches. -- The attributes cannot dependent on the current setting of compiler -- switches, since the values must be static and consistent throughout -- the partition. We probably should add such consistency checks in future, -- but for now we don't do this. AAMP_On_Target : Boolean; -- Set to True if target is AAMP. Denorm_On_Target : Boolean; -- Set to False on targets that do not reliably support denormals. -- Reliably here means for all settings of the relevant -m flag, so -- for example, this is False on the Alpha where denormals are not -- supported unless -mieee is used. Machine_Rounds_On_Target : Boolean; -- Set to False for targets where S'Machine_Rounds is False Machine_Overflows_On_Target : Boolean; -- Set to True for targets where S'Machine_Overflows is True Signed_Zeros_On_Target : Boolean; -- Set to False on targets that do not reliably support signed zeros. OpenVMS_On_Target : Boolean; -- Set to True if target is OpenVMS. -------------------------------------------------------------- -- Handling of Unconstrained Values Returned from Functions -- -------------------------------------------------------------- -- Functions that return variable length objects, notably unconstrained -- arrays are a special case, because there is no simple obvious way of -- implementing this feature. Furthermore, this capability is not present -- in C++ or C, so typically the system ABI does not handle this case. -- GNAT uses two different approaches -- The Secondary Stack -- The secondary stack is a special storage pool that is used for -- this purpose. The called function places the result on the -- secondary stack, and the caller uses or copies the value from -- the secondary stack, and pops the secondary stack after the -- value is consumed. The secondary stack is outside the system -- ABI, and the important point is that although generally it is -- handled in a stack like manner corresponding to the subprogram -- call structure, a return from a function does NOT pop the stack. -- DSP (Depressed Stack Pointer) -- Some targets permit the implementation of a function call/return -- protocol in which the function does not pop the main stack pointer -- on return, but rather returns with the stack pointer depressed. -- This is not generally permitted by any ABI, but for at least some -- targets, the implementation of alloca provides a model for this -- approach. If return-with-DSP is implemented, then functions that -- return variable length objects do it by returning with the stack -- pointer depressed, and the returned object is a pointer to the -- area within the stack frame of the called procedure that contains -- the returned value. The caller must then pop the main stack when -- this value is consumed. Functions_Return_By_DSP_On_Target : Boolean; -- Set to True if target permits functions to return with using the -- DSP (depressed stack pointer) approach. ----------------- -- Data Layout -- ----------------- -- Normally when using the GCC backend, Gigi and GCC perform much of the -- data layout using the standard layout capabilities of GCC. If the -- parameter Backend_Layout is set to False, then the front end must -- perform all data layout. For further details see the package Layout. Frontend_Layout_On_Target : Boolean; -- Set True if front end does layout ----------------- -- Subprograms -- ----------------- procedure Get_Target_Parameters; -- Called at the start of execution to read the source of System and -- obtain and set the values of the above parameters. end Targparm;

47.3391

79

0.614356

38cfe4ca3b85929d0db3ccd9130d591d15b51dd3

2,735

adb

Ada

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-undesu.adb

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-undesu.adb

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-undesu.adb

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- A D A . U N C H E C K E D _ D E A L L O C A T E _ S U B P O O L -- -- -- -- B o d y -- -- -- -- Copyright (C) 2011-2021, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- -- -- -- -- -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with System.Storage_Pools.Subpools, System.Storage_Pools.Subpools.Finalization; use System.Storage_Pools.Subpools, System.Storage_Pools.Subpools.Finalization; procedure Ada.Unchecked_Deallocate_Subpool (Subpool : in out System.Storage_Pools.Subpools.Subpool_Handle) is begin Finalize_And_Deallocate (Subpool); end Ada.Unchecked_Deallocate_Subpool;

62.159091

78

0.372943

38239e4d1f6e803f18d9eda939edff19c757faaa

16,087

adb

Ada

src/asis/asis-iterator.adb

jquorning/dynamo

10d68571476c270b8e45a9c5ef585fa9139b0d05

[ "Apache-2.0" ]

15

2015-01-18T23:04:19.000Z

2022-03-01T20:27:08.000Z

src/asis/asis-iterator.adb

jquorning/dynamo

10d68571476c270b8e45a9c5ef585fa9139b0d05

[ "Apache-2.0" ]

16

2018-06-10T07:09:30.000Z

2022-03-26T18:28:40.000Z

src/asis/asis-iterator.adb

jquorning/dynamo

10d68571476c270b8e45a9c5ef585fa9139b0d05

[ "Apache-2.0" ]

3

2015-11-11T18:00:14.000Z

2022-01-30T23:08:45.000Z

------------------------------------------------------------------------------ -- -- -- ASIS-for-GNAT IMPLEMENTATION COMPONENTS -- -- -- -- A S I S . I T E R A T O R -- -- -- -- B o d y -- -- -- -- Copyright (C) 1995-2010, Free Software Foundation, Inc. -- -- -- -- ASIS-for-GNAT is free software; you can redistribute it and/or modify it -- -- under terms of the GNU General Public License as published by the Free -- -- Software Foundation; either version 2, or (at your option) any later -- -- version. ASIS-for-GNAT is distributed in the hope that it will be use- -- -- ful, but WITHOUT ANY WARRANTY; without even the implied warranty of MER- -- -- CHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General -- -- Public License for more details. You should have received a copy of the -- -- GNU General Public License distributed with ASIS-for-GNAT; see file -- -- COPYING. If not, write to the Free Software Foundation, 51 Franklin -- -- Street, Fifth Floor, Boston, MA 02110-1301, USA. -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- ASIS-for-GNAT was originally developed by the ASIS-for-GNAT team at the -- -- Software Engineering Laboratory of the Swiss Federal Institute of -- -- Technology (LGL-EPFL) in Lausanne, Switzerland, in cooperation with the -- -- Scientific Research Computer Center of Moscow State University (SRCC -- -- MSU), Russia, with funding partially provided by grants from the Swiss -- -- National Science Foundation and the Swiss Academy of Engineering -- -- Sciences. ASIS-for-GNAT is now maintained by AdaCore -- -- (http://www.adacore.com). -- -- -- ------------------------------------------------------------------------------ with Asis.Elements; with Asis.Exceptions; use Asis.Exceptions; with A4G.Vcheck; use A4G.Vcheck; with A4G.Queries; use A4G.Queries; ----------------------------------------------------------------- -- -- -- Process_Children is the function that gets all the children -- -- and calls Recursive_Traversal on them. To get the children -- -- it uses a function that takes an element and returns all -- -- the queries that can obtain children from this element. -- -- (see asis_elements-queries.ads) -- -- -- -- This way, the generic body to instanciate doesn't contain -- -- the procedures that obtain the children, the code is not -- -- duplicated, and so we have a gain in performance (time & -- -- memory). -- -- -- -- Concerning the Control, all Pre and Post-conditions have -- -- been put at the begining and end of the procedures and -- -- blocks that deal with them. -- -- -- -- The (Control = Terminate_Immediatly) has been handled by -- -- returning from all the recursive calls ... -- -- -- ----------------------------------------------------------------- package body Asis.Iterator is procedure Traverse_Element (Element : Asis.Element; Control : in out Traverse_Control; State : in out State_Information) is procedure Recursive_Traversal (Element : Asis.Element; Control : in out Traverse_Control); -- This procedure does the main job procedure Traverse_Children (Element : Asis.Element; Control : in out Traverse_Control); -- Traverses children of a given construct ------------------------------------------------------ -- Pre-condition: any value of Control is possible -- ------------------------------------------------------ procedure Traverse_Children (Element : Asis.Element; Control : in out Traverse_Control) is -- The value of Control has been set by Pre_Operation -- Child access is an array containing access to the functions -- needed to access element's children Child_Access : constant Query_Array := Appropriate_Queries (Element); function Do_Return return Boolean; -- Check and reset the Control value on return from the traverse. -- the boolean returned says wether or not the program should -- return function Do_Return return Boolean is begin -------------------------------------------------------- -- Post-condition: Control = Continue -- -- or Control = Abandon_Siblings -- -- or Control = Terminate_Immediately -- -------------------------------------------------------- case Control is when Terminate_Immediately => return True; when Continue => return False; when Abandon_Siblings => Control := Continue; -- to continue the traversal of the parent -- of the Each_Child (that is, Element) with -- its Post_Operation return True; -- to prevent traversal of Each_Child siblings when Abandon_Children => -- this choice could never been chosen!!! return False; end case; --------------------------------------------------------------- -- Post-Condition : Control = Continue (True or False) -- -- or Control = Terminate_Immediately (True) -- --------------------------------------------------------------- end Do_Return; begin -- Traverse_Children -- Validity Check has already been done ------------------------------------------ -- Pre-condition: Control = Continue -- ------------------------------------------ -- Classify the Element using the various kinds queries. -- Query for all children of the Element in left-to-right order. -- Perform a depth-first traversal on each child. -- The only possibility for Control is to be equal to Continue here! -- If the current Element has no children, Control remains to be -- equal to Continue for Each_Query in Child_Access'Range loop case Child_Access (Each_Query).Query_Kind is when Bug => raise Internal_Implementation_Error; when Single_Element_Query => declare Child : constant Asis.Element := Child_Access (Each_Query).Func_Simple (Element); begin if Asis.Elements.Element_Kind (Child) /= Not_An_Element then Recursive_Traversal (Child, Control); if Do_Return then return; end if; end if; end; when Element_List_Query => declare Child_List : constant Asis.Element_List := Child_Access (Each_Query).Func_List (Element); begin -- If the list is empty, it's ok ... nothing is processed for Each_Element in Child_List'Range loop Recursive_Traversal (Child_List (Each_Element), Control); if Do_Return then return; end if; end loop; end; when Element_List_Query_With_Boolean => declare Child_List : constant Asis.Element_List := Child_Access (Each_Query).Func_List_Boolean (Element, Child_Access (Each_Query).Bool); begin -- If the list is empty, it's ok ... nothing is processed for Each_Element in Child_List'Range loop Recursive_Traversal (Child_List (Each_Element), Control); if Do_Return then return; end if; end loop; end; end case; end loop; ------------------------------------------- -- Post-condition: Control = Continue -- ------------------------------------------- -- if Terminate_Immediately was set, we -- -- just do not entry this procedure ... -- ------------------------------------------- end Traverse_Children; -------------------------------------------------------- -- Post-condition: any value of Control is possible, -- -------------------------------------------------------- ------------------------- -- Recursive_Traversal -- ------------------------- ---------------------------------------- -- Pre-condition: Control = Continue -- ---------------------------------------- procedure Recursive_Traversal (Element : Asis.Element; Control : in out Traverse_Control) is begin ---------------------------------------- -- Pre-condition: Control = Continue -- ---------------------------------------- begin Pre_Operation (Element, Control, State); -- Visit the Element. exception when ASIS_Inappropriate_Context | ASIS_Inappropriate_Container | ASIS_Inappropriate_Compilation_Unit | ASIS_Inappropriate_Element | ASIS_Inappropriate_Line | ASIS_Inappropriate_Line_Number | ASIS_Failed => Add_Call_Information ( Argument => Element, Outer_Call => "Actual procedure for Pre_Operation"); raise; end; -------------------------------------------------------- -- Post-condition: any value of Control is possible -- -------------------------------------------------------- if Control = Continue then Traverse_Children (Element, Control); end if; -------------------------------------------------------- -- Pre-condition: any value of Control is possible, -- -------------------------------------------------------- case Control is when Terminate_Immediately => return; when Continue => begin -- Revisit the Element Post_Operation (Element, Control, State); exception when ASIS_Inappropriate_Context | ASIS_Inappropriate_Container | ASIS_Inappropriate_Compilation_Unit | ASIS_Inappropriate_Element | ASIS_Inappropriate_Line | ASIS_Inappropriate_Line_Number | ASIS_Failed => Add_Call_Information ( Argument => Element, Outer_Call => "Actual procedure for Post_Operation"); raise; end; -- reset the Control set by Post_Operation: case Control is when Terminate_Immediately => return; when Continue => null; when Abandon_Children => Control := Continue; -- the current Element has no children to traverse -- anymore! when Abandon_Siblings => null; end case; when Abandon_Children => -- OK, we abandonned the children, now we go up and continue Control := Continue; when Abandon_Siblings => null; end case; --------------------------------------------------------- -- Post-condition: Control = Continue -- -- or Control = Abandon_Siblings -- -- or Control = Terminate_Immediately -- --------------------------------------------------------- end Recursive_Traversal; --------------------------------------------------------- -- Post-condition: Control = Continue -- -- or Control = Abandon_Siblings -- -- or Control = Terminate_Immediately -- --------------------------------------------------------- --------------------------------- -- Traversal_Element Main body -- --------------------------------- begin Check_Validity (Element, "Asis.Elements.Traverse_Element"); if Asis.Elements.Is_Nil (Element) then Raise_ASIS_Inappropriate_Element ("Asis.Iterator.Traverse_Element", Wrong_Kind => Not_An_Element); elsif Control /= Continue then return; end if; ---------------------------------------- -- Pre-condition: Control = Continue -- ---------------------------------------- Recursive_Traversal (Element => Element, Control => Control); exception when ASIS_Inappropriate_Element | ASIS_Inappropriate_Context | ASIS_Inappropriate_Container | ASIS_Inappropriate_Compilation_Unit | ASIS_Inappropriate_Line | ASIS_Inappropriate_Line_Number | ASIS_Failed => Add_Call_Information (Argument => Element, Outer_Call => "Asis.Iterator.Traverse_Element"); raise; -- when others => -- Actual Pre- and Postoperations can raise whatever they want, and -- at the level of Traverse_Element we can (and should) do nothing -- with this. So we just let this exception go ahead -- raise; end Traverse_Element; end Asis.Iterator;

43.953552

79

0.412818

4bf3f3f52cf83acc725ad7ccb2ccbf8592b68aac

3,461

adb

Ada

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-expuns.adb

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

[ "CNRI-Python-GPL-Compatible", "MIT" ]

null

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-expuns.adb

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

[ "CNRI-Python-GPL-Compatible", "MIT" ]

null

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-expuns.adb

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

[ "CNRI-Python-GPL-Compatible", "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . E X P _ U N S -- -- -- -- B o d y -- -- -- -- 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. -- -- -- ------------------------------------------------------------------------------ with System.Unsigned_Types; use System.Unsigned_Types; package body System.Exp_Uns is ------------------ -- Exp_Unsigned -- ------------------ function Exp_Unsigned (Left : Unsigned; Right : Natural) return Unsigned is Result : Unsigned := 1; Factor : Unsigned := Left; Exp : Natural := Right; begin -- We use the standard logarithmic approach, Exp gets shifted right -- testing successive low order bits and Factor is the value of the -- base raised to the next power of 2. -- Note: it is not worth special casing the cases of base values -1,0,+1 -- since the expander does this when the base is a literal, and other -- cases will be extremely rare. if Exp /= 0 then loop if Exp rem 2 /= 0 then Result := Result * Factor; end if; Exp := Exp / 2; exit when Exp = 0; Factor := Factor * Factor; end loop; end if; return Result; end Exp_Unsigned; end System.Exp_Uns;

46.77027

79

0.424155

039f5aaf0fbd56bd30a19ef2889aaee77b6748b0

4,352

ads

Ada

source/amf/utp/amf-utp-start_timer_actions.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/utp/amf-utp-start_timer_actions.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/utp/amf-utp-start_timer_actions.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2012, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ -- This file is generated, don't edit it. ------------------------------------------------------------------------------ limited with AMF.UML.Call_Operation_Actions; package AMF.Utp.Start_Timer_Actions is pragma Preelaborate; type Utp_Start_Timer_Action is limited interface; type Utp_Start_Timer_Action_Access is access all Utp_Start_Timer_Action'Class; for Utp_Start_Timer_Action_Access'Storage_Size use 0; not overriding function Get_Base_Call_Operation_Action (Self : not null access constant Utp_Start_Timer_Action) return AMF.UML.Call_Operation_Actions.UML_Call_Operation_Action_Access is abstract; -- Getter of StartTimerAction::base_CallOperationAction. -- not overriding procedure Set_Base_Call_Operation_Action (Self : not null access Utp_Start_Timer_Action; To : AMF.UML.Call_Operation_Actions.UML_Call_Operation_Action_Access) is abstract; -- Setter of StartTimerAction::base_CallOperationAction. -- end AMF.Utp.Start_Timer_Actions;

61.295775

90

0.46852

1af014edb3fe122abee00072660527e7c38c57ed

129

ada

Ada

Task/Flow-control-structures/Ada/flow-control-structures-3.ada

mullikine/RosettaCodeData

4f0027c6ce83daa36118ee8b67915a13cd23ab67

[ "Info-ZIP" ]

1

2018-11-09T22:08:38.000Z

Task/Flow-control-structures/Ada/flow-control-structures-3.ada

mullikine/RosettaCodeData

4f0027c6ce83daa36118ee8b67915a13cd23ab67

[ "Info-ZIP" ]

null

Task/Flow-control-structures/Ada/flow-control-structures-3.ada

mullikine/RosettaCodeData

4f0027c6ce83daa36118ee8b67915a13cd23ab67

[ "Info-ZIP" ]

1

2018-11-09T22:08:40.000Z

select delay 10.0; Put_Line ("Cannot finish this in 10s"); then abort -- do some lengthy calculation ... end select;

16.125

42

0.658915

38debb7119e3235b6442e811e4aea8d81a361833

1,446

ads

Ada

src/syscalls/ewok-syscalls-cfg-gpio.ads

vdh-anssi/ewok-kernel

9a88dcae16659c212c4123b7a9272c9dfa51f85a

[ "Apache-2.0" ]

65

2018-09-26T09:10:11.000Z

2022-01-30T21:17:37.000Z

src/syscalls/ewok-syscalls-cfg-gpio.ads

vdh-anssi/ewok-kernel

9a88dcae16659c212c4123b7a9272c9dfa51f85a

[ "Apache-2.0" ]

22

2019-04-07T15:15:54.000Z

2020-10-15T12:45:54.000Z

src/syscalls/ewok-syscalls-cfg-gpio.ads

vdh-anssi/ewok-kernel

9a88dcae16659c212c4123b7a9272c9dfa51f85a

[ "Apache-2.0" ]

10

2018-09-27T09:43:08.000Z

2021-01-29T22:50:17.000Z

-- -- Copyright 2018 The wookey project team <[email protected]> -- - Ryad Benadjila -- - Arnauld Michelizza -- - Mathieu Renard -- - Philippe Thierry -- - Philippe Trebuchet -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. -- -- with ewok.tasks_shared; package ewok.syscalls.cfg.gpio with spark_mode => on is procedure svc_gpio_set (caller_id : in ewok.tasks_shared.t_task_id; params : in out t_parameters; mode : in ewok.tasks_shared.t_task_mode); procedure svc_gpio_get (caller_id : in ewok.tasks_shared.t_task_id; params : in out t_parameters; mode : in ewok.tasks_shared.t_task_mode); procedure svc_gpio_unlock_exti (caller_id : in ewok.tasks_shared.t_task_id; params : in out t_parameters; mode : in ewok.tasks_shared.t_task_mode); end ewok.syscalls.cfg.gpio;

32.863636

79

0.672199

a0db0393dcabe4c93768fab3846ab1119af3f51d

1,971

adb

Ada

ada/examples/pre-post-conditions/show_type_invariant.adb

carter-e-veldhuizen/RACK

8ae9b4ecd17d812966aed985d6bc51b1b7ca6e79

[ "BSD-3-Clause" ]

4

2021-07-02T08:58:05.000Z

2022-02-02T03:02:32.000Z

ada/examples/pre-post-conditions/show_type_invariant.adb

carter-e-veldhuizen/RACK

8ae9b4ecd17d812966aed985d6bc51b1b7ca6e79

[ "BSD-3-Clause" ]

309

2020-11-02T19:46:14.000Z

2022-03-24T21:35:28.000Z

ada/examples/pre-post-conditions/show_type_invariant.adb

carter-e-veldhuizen/RACK

8ae9b4ecd17d812966aed985d6bc51b1b7ca6e79

[ "BSD-3-Clause" ]

7

2020-11-30T22:22:06.000Z

2022-02-02T03:09:12.000Z

with Ada.Text_IO; use Ada.Text_IO; with Ada.Strings.Unbounded; use Ada.Strings.Unbounded; with Ada.Calendar; use Ada.Calendar; with Ada.Containers.Vectors; procedure Show_Type_Invariant is package Courses is type Course is private with Type_Invariant => Check (Course); type Course_Container is private; procedure Add (CC : in out Course_Container; C : Course); function Init (Name : String; Start_Date, End_Date : Time) return Course; function Check (C : Course) return Boolean; private type Course is record Name : Unbounded_String; Start_Date : Time; End_Date : Time; end record; function Check (C : Course) return Boolean is (C.Start_Date <= C.End_Date); package Course_Vectors is new Ada.Containers.Vectors (Index_Type => Natural, Element_Type => Course); type Course_Container is record V : Course_Vectors.Vector; end record; end Courses; package body Courses is procedure Add (CC : in out Course_Container; C : Course) is begin CC.V.Append (C); end Add; function Init (Name : String; Start_Date, End_Date : Time) return Course is begin return Course'(Name => To_Unbounded_String (Name), Start_Date => Start_Date, End_Date => End_Date); end Init; end Courses; use Courses; CC : Course_Container; begin Add (CC, Init (Name => "Intro to Photography", Start_Date => Time_Of (2018, 5, 1), End_Date => Time_Of (2018, 5, 10))); -- This should trigger an error in the type-invariant check Add (CC, Init (Name => "Intro to Video Recording", Start_Date => Time_Of (2019, 5, 1), End_Date => Time_Of (2018, 5, 10))); end Show_Type_Invariant;

27

69

0.588534

03428d2d6c0899651108c24e2b380c9d705acdfb

50,986

adb

Ada

testsuite/tests/NA17-007__first_line_comment/comment-ko-1.adb

AdaCore/style_checker

17108ebfc44375498063ecdad6c6e4430458e60a

[ "CNRI-Python" ]

2

2017-10-22T18:04:26.000Z

2020-03-06T11:07:41.000Z

testsuite/tests/NA17-007__first_line_comment/comment-ko-1.adb

AdaCore/style_checker

17108ebfc44375498063ecdad6c6e4430458e60a

[ "CNRI-Python" ]

null

testsuite/tests/NA17-007__first_line_comment/comment-ko-1.adb

AdaCore/style_checker

17108ebfc44375498063ecdad6c6e4430458e60a

[ "CNRI-Python" ]

4

2018-05-22T12:08:54.000Z

2020-12-14T15:25:27.000Z

-- Copyright (C) 2006, AdaCore -- with Ada.Command_Line; use Ada.Command_Line; with ALI; use ALI; with Csets; with Gnatvsn; with Hostparm; with Makeutl; use Makeutl; with MLib.Tgt; use MLib.Tgt; with Namet; use Namet; with Opt; use Opt; with Osint; use Osint; with Osint.M; use Osint.M; with Prj; use Prj; with Prj.Com; with Prj.Env; with Prj.Ext; with Prj.Pars; with Prj.Util; use Prj.Util; with Snames; with System; with Table; with Types; use Types; with GNAT.Directory_Operations; use GNAT.Directory_Operations; with GNAT.IO; use GNAT.IO; with GNAT.OS_Lib; use GNAT.OS_Lib; package body Clean is Initialized : Boolean := False; -- Set to True by the first call to Initialize. -- To avoid reinitialization of some packages. -- Suffixes of various files Assembly_Suffix : constant String := ".s"; ALI_Suffix : constant String := ".ali"; Tree_Suffix : constant String := ".adt"; Object_Suffix : constant String := Get_Object_Suffix.all; Debug_Suffix : String := ".dg"; -- Changed to "_dg" for VMS in the body of the package Repinfo_Suffix : String := ".rep"; -- Changed to "_rep" for VMS in the body of the package B_Start : String := "b~"; -- Prefix of binder generated file. -- Changed to "b$" for VMS in the body of the package. Object_Directory_Path : String_Access := null; -- The path name of the object directory, set with switch -D Do_Nothing : Boolean := False; -- Set to True when switch -n is specified. -- When True, no file is deleted. gnatclean only lists the files that -- would have been deleted if the switch -n had not been specified. File_Deleted : Boolean := False; -- Set to True if at least one file has been deleted Copyright_Displayed : Boolean := False; Usage_Displayed : Boolean := False; Project_File_Name : String_Access := null; Main_Project : Prj.Project_Id := Prj.No_Project; All_Projects : Boolean := False; -- Packages of project files where unknown attributes are errors. Naming_String : aliased String := "naming"; Builder_String : aliased String := "builder"; Compiler_String : aliased String := "compiler"; Binder_String : aliased String := "binder"; Linker_String : aliased String := "linker"; Gnatmake_Packages : aliased String_List := (Naming_String 'Access, Builder_String 'Access, Compiler_String 'Access, Binder_String 'Access, Linker_String 'Access); Packages_To_Check_By_Gnatmake : constant String_List_Access := Gnatmake_Packages'Access; package Processed_Projects is new Table.Table (Table_Component_Type => Project_Id, Table_Index_Type => Natural, Table_Low_Bound => 0, Table_Initial => 10, Table_Increment => 10, Table_Name => "Clean.Processed_Projects"); -- Table to keep track of what project files have been processed, when -- switch -r is specified. package Sources is new Table.Table (Table_Component_Type => File_Name_Type, Table_Index_Type => Natural, Table_Low_Bound => 0, Table_Initial => 10, Table_Increment => 10, Table_Name => "Clean.Processed_Projects"); -- Table to store all the source files of a library unit: spec, body and -- subunits, to detect .dg files and delete them. ---------------------------- -- Queue (Q) manipulation -- ---------------------------- procedure Init_Q; -- Must be called to initialize the Q procedure Insert_Q (Lib_File : File_Name_Type); -- If Lib_File is not marked, inserts it at the end of Q and mark it function Empty_Q return Boolean; -- Returns True if Q is empty. procedure Extract_From_Q (Lib_File : out File_Name_Type); -- Extracts the first element from the Q. Q_Front : Natural; -- Points to the first valid element in the Q. package Q is new Table.Table ( Table_Component_Type => File_Name_Type, Table_Index_Type => Natural, Table_Low_Bound => 0, Table_Initial => 4000, Table_Increment => 100, Table_Name => "Clean.Q"); -- This is the actual queue ----------------------------- -- Other local subprograms -- ----------------------------- procedure Add_Source_Dir (N : String); -- Call Add_Src_Search_Dir. -- Output one line when in verbose mode. procedure Add_Source_Directories is new Prj.Env.For_All_Source_Dirs (Action => Add_Source_Dir); procedure Add_Object_Dir (N : String); -- Call Add_Lib_Search_Dir. -- Output one line when in verbose mode. procedure Add_Object_Directories is new Prj.Env.For_All_Object_Dirs (Action => Add_Object_Dir); function ALI_File_Name (Source : Name_Id) return String; -- Returns the name of the ALI file corresponding to Source function Assembly_File_Name (Source : Name_Id) return String; -- Returns the assembly file name corresponding to Source procedure Clean_Archive (Project : Project_Id); -- Delete a global archive or a fake library project archive and the -- dependency file, if they exist. procedure Clean_Directory (Dir : Name_Id); -- Delete all regular files in a library directory or in a library -- interface dir. procedure Clean_Executables; -- Do the cleaning work when no project file is specified procedure Clean_Project (Project : Project_Id); -- Do the cleaning work when a project file is specified. -- This procedure calls itself recursively when there are several -- project files in the tree rooted at the main project file and switch -r -- has been specified. function Debug_File_Name (Source : Name_Id) return String; -- Name of the expanded source file corresponding to Source procedure Delete (In_Directory : String; File : String); -- Delete one file, or list the file name if switch -n is specified procedure Delete_Binder_Generated_Files (Dir : String; Source : Name_Id); -- Delete the binder generated file in directory Dir for Source, if they -- exist: for Unix these are b~<source>.ads, b~<source>.adb, -- b~<source>.ali and b~<source>.o. procedure Display_Copyright; -- Display the Copyright notice. -- If called several times, display the Copyright notice only the first -- time. procedure Initialize; -- Call the necessary package initializations function Object_File_Name (Source : Name_Id) return String; -- Returns the object file name corresponding to Source procedure Parse_Cmd_Line; -- Parse the command line function Repinfo_File_Name (Source : Name_Id) return String; -- Returns the repinfo file name corresponding to Source function Tree_File_Name (Source : Name_Id) return String; -- Returns the tree file name corresponding to Source function In_Extension_Chain (Of_Project : Project_Id; Prj : Project_Id) return Boolean; -- Returns True iff Prj is an extension of Of_Project or if Of_Project is -- an extension of Prj. procedure Usage; -- Display the usage. -- If called several times, the usage is displayed only the first time. -------------------- -- Add_Object_Dir -- -------------------- procedure Add_Object_Dir (N : String) is begin Add_Lib_Search_Dir (N); if Opt.Verbose_Mode then Put ("Adding object directory """); Put (N); Put ("""."); New_Line; end if; end Add_Object_Dir; -------------------- -- Add_Source_Dir -- -------------------- procedure Add_Source_Dir (N : String) is begin Add_Src_Search_Dir (N); if Opt.Verbose_Mode then Put ("Adding source directory """); Put (N); Put ("""."); New_Line; end if; end Add_Source_Dir; ------------------- -- ALI_File_Name -- ------------------- function ALI_File_Name (Source : Name_Id) return String is Src : constant String := Get_Name_String (Source); begin -- If the source name has an extension, then replace it with -- the ALI suffix. for Index in reverse Src'First + 1 .. Src'Last loop if Src (Index) = '.' then return Src (Src'First .. Index - 1) & ALI_Suffix; end if; end loop; -- If there is no dot, or if it is the first character, just add the -- ALI suffix. return Src & ALI_Suffix; end ALI_File_Name; ------------------------ -- Assembly_File_Name -- ------------------------ function Assembly_File_Name (Source : Name_Id) return String is Src : constant String := Get_Name_String (Source); begin -- If the source name has an extension, then replace it with -- the assembly suffix. for Index in reverse Src'First + 1 .. Src'Last loop if Src (Index) = '.' then return Src (Src'First .. Index - 1) & Assembly_Suffix; end if; end loop; -- If there is no dot, or if it is the first character, just add the -- assembly suffix. return Src & Assembly_Suffix; end Assembly_File_Name; ------------------- -- Clean_Archive -- ------------------- procedure Clean_Archive (Project : Project_Id) is Current_Dir : constant Dir_Name_Str := Get_Current_Dir; Data : constant Project_Data := Projects.Table (Project); Archive_Name : constant String := "lib" & Get_Name_String (Data.Name) & '.' & Archive_Ext; -- The name of the archive file for this project Archive_Dep_Name : constant String := "lib" & Get_Name_String (Data.Name) & ".deps"; -- The name of the archive dependency file for this project Obj_Dir : constant String := Get_Name_String (Data.Object_Directory); begin Change_Dir (Obj_Dir); if Is_Regular_File (Archive_Name) then Delete (Obj_Dir, Archive_Name); end if; if Is_Regular_File (Archive_Dep_Name) then Delete (Obj_Dir, Archive_Dep_Name); end if; Change_Dir (Current_Dir); end Clean_Archive; --------------------- -- Clean_Directory -- --------------------- procedure Clean_Directory (Dir : Name_Id) is Directory : constant String := Get_Name_String (Dir); Current : constant Dir_Name_Str := Get_Current_Dir; Direc : Dir_Type; Name : String (1 .. 200); Last : Natural; procedure Set_Writable (Name : System.Address); pragma Import (C, Set_Writable, "__gnat_set_writable"); begin Change_Dir (Directory); Open (Direc, "."); -- For each regular file in the directory, if switch -n has not been -- specified, make it writable and delete the file. loop Read (Direc, Name, Last); exit when Last = 0; if Is_Regular_File (Name (1 .. Last)) then if not Do_Nothing then Name (Last + 1) := ASCII.NUL; Set_Writable (Name (1)'Address); end if; Delete (Directory, Name (1 .. Last)); end if; end loop; Close (Direc); -- Restore the initial working directory Change_Dir (Current); end Clean_Directory; ----------------------- -- Clean_Executables -- ----------------------- procedure Clean_Executables is Main_Source_File : File_Name_Type; -- Current main source Main_Lib_File : File_Name_Type; -- ALI file of the current main Lib_File : File_Name_Type; -- Current ALI file Full_Lib_File : File_Name_Type; -- Full name of the current ALI file Text : Text_Buffer_Ptr; The_ALI : ALI_Id; begin Init_Q; -- It does not really matter if there is or not an object file -- corresponding to an ALI file: if there is one, it will be deleted. Opt.Check_Object_Consistency := False; -- Proceed each executable one by one. Each source is marked as it is -- processed, so common sources between executables will not be -- processed several times. for N_File in 1 .. Osint.Number_Of_Files loop Main_Source_File := Next_Main_Source; Main_Lib_File := Osint.Lib_File_Name (Main_Source_File, Current_File_Index); Insert_Q (Main_Lib_File); while not Empty_Q loop Sources.Set_Last (0); Extract_From_Q (Lib_File); Full_Lib_File := Osint.Full_Lib_File_Name (Lib_File); -- If we have existing ALI file that is not read-only, process it if Full_Lib_File /= No_File and then not Is_Readonly_Library (Full_Lib_File) then Text := Read_Library_Info (Lib_File); if Text /= null then The_ALI := Scan_ALI (Lib_File, Text, Ignore_ED => False, Err => True); Free (Text); -- If no error was produced while loading this ALI file, -- insert into the queue all the unmarked withed sources. if The_ALI /= No_ALI_Id then for J in ALIs.Table (The_ALI).First_Unit .. ALIs.Table (The_ALI).Last_Unit loop Sources.Increment_Last; Sources.Table (Sources.Last) := ALI.Units.Table (J).Sfile; for K in ALI.Units.Table (J).First_With .. ALI.Units.Table (J).Last_With loop Insert_Q (Withs.Table (K).Afile); end loop; end loop; -- Look for subunits and put them in the Sources table for J in ALIs.Table (The_ALI).First_Sdep .. ALIs.Table (The_ALI).Last_Sdep loop if Sdep.Table (J).Subunit_Name /= No_Name then Sources.Increment_Last; Sources.Table (Sources.Last) := Sdep.Table (J).Sfile; end if; end loop; end if; end if; -- Now delete all existing files corresponding to this ALI file declare Obj_Dir : constant String := Dir_Name (Get_Name_String (Full_Lib_File)); Obj : constant String := Object_File_Name (Lib_File); Adt : constant String := Tree_File_Name (Lib_File); Asm : constant String := Assembly_File_Name (Lib_File); begin Delete (Obj_Dir, Get_Name_String (Lib_File)); if Is_Regular_File (Obj_Dir & Dir_Separator & Obj) then Delete (Obj_Dir, Obj); end if; if Is_Regular_File (Obj_Dir & Dir_Separator & Adt) then Delete (Obj_Dir, Adt); end if; if Is_Regular_File (Obj_Dir & Dir_Separator & Asm) then Delete (Obj_Dir, Asm); end if; -- Delete expanded source files (.dg) and/or repinfo files -- (.rep) if any for J in 1 .. Sources.Last loop declare Deb : constant String := Debug_File_Name (Sources.Table (J)); Rep : constant String := Repinfo_File_Name (Sources.Table (J)); begin if Is_Regular_File (Obj_Dir & Dir_Separator & Deb) then Delete (Obj_Dir, Deb); end if; if Is_Regular_File (Obj_Dir & Dir_Separator & Rep) then Delete (Obj_Dir, Rep); end if; end; end loop; end; end if; end loop; -- Delete the executable, if it exists, and the binder generated -- files, if any. if not Compile_Only then declare Source : constant Name_Id := Strip_Suffix (Main_Lib_File); Executable : constant String := Get_Name_String (Executable_Name (Source)); begin if Is_Regular_File (Executable) then Delete ("", Executable); end if; Delete_Binder_Generated_Files (Get_Current_Dir, Source); end; end if; end loop; end Clean_Executables; ------------------- -- Clean_Project -- ------------------- procedure Clean_Project (Project : Project_Id) is Main_Source_File : File_Name_Type; -- Name of executable on the command line without directory info Executable : Name_Id; -- Name of the executable file Current_Dir : constant Dir_Name_Str := Get_Current_Dir; Data : constant Project_Data := Projects.Table (Project); U_Data : Prj.Com.Unit_Data; File_Name1 : Name_Id; Index1 : Int; File_Name2 : Name_Id; Index2 : Int; Lib_File : File_Name_Type; Source_Id : Other_Source_Id; Source : Other_Source; Global_Archive : Boolean := False; use Prj.Com; begin -- Check that we don't specify executable on the command line for -- a main library project. if Project = Main_Project and then Osint.Number_Of_Files /= 0 and then Data.Library then Osint.Fail ("Cannot specify executable(s) for a Library Project File"); end if; if Verbose_Mode then Put ("Cleaning project """); Put (Get_Name_String (Data.Name)); Put_Line (""""); end if; -- Add project to the list of proceesed projects Processed_Projects.Increment_Last; Processed_Projects.Table (Processed_Projects.Last) := Project; if Data.Object_Directory /= No_Name then declare Obj_Dir : constant String := Get_Name_String (Data.Object_Directory); begin Change_Dir (Obj_Dir); -- First, deal with Ada -- Look through the units to find those that are either immediate -- sources or inherited sources of the project. if Data.Languages (Lang_Ada) then for Unit in 1 .. Prj.Com.Units.Last loop U_Data := Prj.Com.Units.Table (Unit); File_Name1 := No_Name; File_Name2 := No_Name; -- If either the spec or the body is a source of the -- project, check for the corresponding ALI file in the -- object directory. if In_Extension_Chain (U_Data.File_Names (Body_Part).Project, Project) or else In_Extension_Chain (U_Data.File_Names (Specification).Project, Project) then File_Name1 := U_Data.File_Names (Body_Part).Name; Index1 := U_Data.File_Names (Body_Part).Index; File_Name2 := U_Data.File_Names (Specification).Name; Index2 := U_Data.File_Names (Specification).Index; -- If there is no body file name, then there may be only -- a spec. if File_Name1 = No_Name then File_Name1 := File_Name2; Index1 := Index2; File_Name2 := No_Name; Index2 := 0; end if; end if; -- If there is either a spec or a body, look for files -- in the object directory. if File_Name1 /= No_Name then Lib_File := Osint.Lib_File_Name (File_Name1, Index1); declare Asm : constant String := Assembly_File_Name (Lib_File); ALI : constant String := ALI_File_Name (Lib_File); Obj : constant String := Object_File_Name (Lib_File); Adt : constant String := Tree_File_Name (Lib_File); Deb : constant String := Debug_File_Name (File_Name1); Rep : constant String := Repinfo_File_Name (File_Name1); Del : Boolean := True; begin -- If the ALI file exists and is read-only, no file -- is deleted. if Is_Regular_File (ALI) then if Is_Writable_File (ALI) then Delete (Obj_Dir, ALI); else Del := False; if Verbose_Mode then Put ('"'); Put (Obj_Dir); if Obj_Dir (Obj_Dir'Last) /= Dir_Separator then Put (Dir_Separator); end if; Put (ALI); Put_Line (""" is read-only"); end if; end if; end if; if Del then -- Object file if Is_Regular_File (Obj) then Delete (Obj_Dir, Obj); end if; -- Assembly file if Is_Regular_File (Asm) then Delete (Obj_Dir, Asm); end if; -- Tree file if Is_Regular_File (Adt) then Delete (Obj_Dir, Adt); end if; -- First expanded source file if Is_Regular_File (Deb) then Delete (Obj_Dir, Deb); end if; -- Repinfo file if Is_Regular_File (Rep) then Delete (Obj_Dir, Rep); end if; -- Second expanded source file if File_Name2 /= No_Name then declare Deb : constant String := Debug_File_Name (File_Name2); Rep : constant String := Repinfo_File_Name (File_Name2); begin if Is_Regular_File (Deb) then Delete (Obj_Dir, Deb); end if; if Is_Regular_File (Rep) then Delete (Obj_Dir, Rep); end if; end; end if; end if; end; end if; end loop; end if; -- Check if a global archive and it dependency file could have -- been created and, if they exist, delete them. if Project = Main_Project and then not Data.Library then Global_Archive := False; for Proj in 1 .. Projects.Last loop if Projects.Table (Proj).Other_Sources_Present then Global_Archive := True; exit; end if; end loop; if Global_Archive then Clean_Archive (Project); end if; end if; if Data.Other_Sources_Present then -- There is non-Ada code: delete the object files and -- the dependency files if they exist. Source_Id := Data.First_Other_Source; while Source_Id /= No_Other_Source loop Source := Other_Sources.Table (Source_Id); if Is_Regular_File (Get_Name_String (Source.Object_Name)) then Delete (Obj_Dir, Get_Name_String (Source.Object_Name)); end if; if Is_Regular_File (Get_Name_String (Source.Dep_Name)) then Delete (Obj_Dir, Get_Name_String (Source.Dep_Name)); end if; Source_Id := Source.Next; end loop; -- If it is a library with only non Ada sources, delete -- the fake archive and the dependency file, if they exist. if Data.Library and then not Data.Languages (Lang_Ada) then Clean_Archive (Project); end if; end if; end; end if; -- If this is a library project, clean the library directory, the -- interface copy dir and, for a Stand-Alone Library, the binder -- generated files of the library. -- The directories are cleaned only if switch -c is not specified. if Data.Library then if not Compile_Only then Clean_Directory (Data.Library_Dir); if Data.Library_Src_Dir /= No_Name and then Data.Library_Src_Dir /= Data.Library_Dir then Clean_Directory (Data.Library_Src_Dir); end if; end if; if Data.Standalone_Library and then Data.Object_Directory /= No_Name then Delete_Binder_Generated_Files (Get_Name_String (Data.Object_Directory), Data.Library_Name); end if; end if; if Verbose_Mode then New_Line; end if; -- If switch -r is specified, call Clean_Project recursively for the -- imported projects and the project being extended. if All_Projects then declare Imported : Project_List := Data.Imported_Projects; Element : Project_Element; Process : Boolean; begin -- For each imported project, call Clean_Project if the project -- has not been processed already. while Imported /= Empty_Project_List loop Element := Project_Lists.Table (Imported); Imported := Element.Next; Process := True; for J in Processed_Projects.First .. Processed_Projects.Last loop if Element.Project = Processed_Projects.Table (J) then Process := False; exit; end if; end loop; if Process then Clean_Project (Element.Project); end if; end loop; -- If this project extends another project, call Clean_Project for -- the project being extended. It is guaranteed that it has not -- called before, because no other project may import or extend -- this project. if Data.Extends /= No_Project then Clean_Project (Data.Extends); end if; end; end if; -- For the main project, delete the executables and the -- binder generated files. -- The executables are deleted only if switch -c is not specified. if Project = Main_Project and then Data.Exec_Directory /= No_Name then declare Exec_Dir : constant String := Get_Name_String (Data.Exec_Directory); begin Change_Dir (Exec_Dir); for N_File in 1 .. Osint.Number_Of_Files loop Main_Source_File := Next_Main_Source; if not Compile_Only then Executable := Executable_Of (Main_Project, Main_Source_File, Current_File_Index); if Is_Regular_File (Get_Name_String (Executable)) then Delete (Exec_Dir, Get_Name_String (Executable)); end if; end if; if Data.Object_Directory /= No_Name then Delete_Binder_Generated_Files (Get_Name_String (Data.Object_Directory), Strip_Suffix (Main_Source_File)); end if; end loop; end; end if; -- Change back to previous directory Change_Dir (Current_Dir); end Clean_Project; --------------------- -- Debug_File_Name -- --------------------- function Debug_File_Name (Source : Name_Id) return String is begin return Get_Name_String (Source) & Debug_Suffix; end Debug_File_Name; ------------ -- Delete -- ------------ procedure Delete (In_Directory : String; File : String) is Full_Name : String (1 .. In_Directory'Length + File'Length + 1); Last : Natural := 0; Success : Boolean; begin -- Indicate that at least one file is deleted or is to be deleted File_Deleted := True; -- Build the path name of the file to delete Last := In_Directory'Length; Full_Name (1 .. Last) := In_Directory; if Last > 0 and then Full_Name (Last) /= Directory_Separator then Last := Last + 1; Full_Name (Last) := Directory_Separator; end if; Full_Name (Last + 1 .. Last + File'Length) := File; Last := Last + File'Length; -- If switch -n was used, simply output the path name if Do_Nothing then Put_Line (Full_Name (1 .. Last)); -- Otherwise, delete the file else Delete_File (Full_Name (1 .. Last), Success); if not Success then Put ("Warning: """); Put (Full_Name (1 .. Last)); Put_Line (""" could not be deleted"); elsif Verbose_Mode or else not Quiet_Output then Put (""""); Put (Full_Name (1 .. Last)); Put_Line (""" has been deleted"); end if; end if; end Delete; ----------------------------------- -- Delete_Binder_Generated_Files -- ----------------------------------- procedure Delete_Binder_Generated_Files (Dir : String; Source : Name_Id) is Source_Name : constant String := Get_Name_String (Source); Current : constant String := Get_Current_Dir; Last : constant Positive := B_Start'Length + Source_Name'Length; File_Name : String (1 .. Last + 4); begin Change_Dir (Dir); -- Build the file name (before the extension) File_Name (1 .. B_Start'Length) := B_Start; File_Name (B_Start'Length + 1 .. Last) := Source_Name; -- Spec File_Name (Last + 1 .. Last + 4) := ".ads"; if Is_Regular_File (File_Name (1 .. Last + 4)) then Delete (Dir, File_Name (1 .. Last + 4)); end if; -- Body File_Name (Last + 1 .. Last + 4) := ".adb"; if Is_Regular_File (File_Name (1 .. Last + 4)) then Delete (Dir, File_Name (1 .. Last + 4)); end if; -- ALI file File_Name (Last + 1 .. Last + 4) := ".ali"; if Is_Regular_File (File_Name (1 .. Last + 4)) then Delete (Dir, File_Name (1 .. Last + 4)); end if; -- Object file File_Name (Last + 1 .. Last + Object_Suffix'Length) := Object_Suffix; if Is_Regular_File (File_Name (1 .. Last + Object_Suffix'Length)) then Delete (Dir, File_Name (1 .. Last + Object_Suffix'Length)); end if; -- Change back to previous directory Change_Dir (Current); end Delete_Binder_Generated_Files; ----------------------- -- Display_Copyright -- ----------------------- procedure Display_Copyright is begin if not Copyright_Displayed then Copyright_Displayed := True; Put_Line ("GNATCLEAN " & Gnatvsn.Gnat_Version_String & " Copyright 2003-2005 Free Software Foundation, Inc."); end if; end Display_Copyright; ------------- -- Empty_Q -- ------------- function Empty_Q return Boolean is begin return Q_Front >= Q.Last; end Empty_Q; -------------------- -- Extract_From_Q -- -------------------- procedure Extract_From_Q (Lib_File : out File_Name_Type) is Lib : constant File_Name_Type := Q.Table (Q_Front); begin Q_Front := Q_Front + 1; Lib_File := Lib; end Extract_From_Q; --------------- -- Gnatclean -- --------------- procedure Gnatclean is begin -- Do the necessary initializations Initialize; -- Parse the command line, getting the switches and the executable names Parse_Cmd_Line; if Verbose_Mode then Display_Copyright; end if; if Project_File_Name /= null then -- A project file was specified by a -P switch if Opt.Verbose_Mode then New_Line; Put ("Parsing Project File """); Put (Project_File_Name.all); Put_Line ("""."); New_Line; end if; -- Set the project parsing verbosity to whatever was specified -- by a possible -vP switch. Prj.Pars.Set_Verbosity (To => Prj.Com.Current_Verbosity); -- Parse the project file. If there is an error, Main_Project -- will still be No_Project. Prj.Pars.Parse (Project => Main_Project, Project_File_Name => Project_File_Name.all, Packages_To_Check => Packages_To_Check_By_Gnatmake, Process_Languages => All_Languages); if Main_Project = No_Project then Fail ("""" & Project_File_Name.all & """ processing failed"); end if; if Opt.Verbose_Mode then New_Line; Put ("Parsing of Project File """); Put (Project_File_Name.all); Put (""" is finished."); New_Line; end if; -- We add the source directories and the object directories -- to the search paths. Add_Source_Directories (Main_Project); Add_Object_Directories (Main_Project); end if; Osint.Add_Default_Search_Dirs; -- If a project file was specified, but no executable name, put all -- the mains of the project file (if any) as if there were on the -- command line. if Main_Project /= No_Project and then Osint.Number_Of_Files = 0 then declare Value : String_List_Id := Projects.Table (Main_Project).Mains; Main : String_Element; begin while Value /= Prj.Nil_String loop Main := String_Elements.Table (Value); Osint.Add_File (File_Name => Get_Name_String (Main.Value), Index => Main.Index); Value := Main.Next; end loop; end; end if; -- If neither a project file nor an executable were specified, -- output the usage and exit. if Main_Project = No_Project and then Osint.Number_Of_Files = 0 then Usage; return; end if; if Verbose_Mode then New_Line; end if; if Main_Project /= No_Project then -- If a project file has been specified, call Clean_Project with the -- project id of this project file, after resetting the list of -- processed projects. Processed_Projects.Init; Clean_Project (Main_Project); else -- If no project file has been specified, the work is done in -- Clean_Executables. Clean_Executables; end if; -- In verbose mode, if Delete has not been called, indicate that -- no file needs to be deleted. if Verbose_Mode and (not File_Deleted) then New_Line; if Do_Nothing then Put_Line ("No file needs to be deleted"); else Put_Line ("No file has been deleted"); end if; end if; end Gnatclean; ------------------------ -- In_Extension_Chain -- ------------------------ function In_Extension_Chain (Of_Project : Project_Id; Prj : Project_Id) return Boolean is Data : Project_Data; begin if Of_Project = Prj then return True; end if; Data := Projects.Table (Of_Project); while Data.Extends /= No_Project loop if Data.Extends = Prj then return True; end if; Data := Projects.Table (Data.Extends); end loop; Data := Projects.Table (Prj); while Data.Extends /= No_Project loop if Data.Extends = Of_Project then return True; end if; Data := Projects.Table (Data.Extends); end loop; return False; end In_Extension_Chain; ------------ -- Init_Q -- ------------ procedure Init_Q is begin Q_Front := Q.First; Q.Set_Last (Q.First); end Init_Q; ---------------- -- Initialize -- ---------------- procedure Initialize is begin if not Initialized then Initialized := True; -- Initialize some packages Csets.Initialize; Namet.Initialize; Snames.Initialize; Prj.Initialize; end if; -- Reset global variables Free (Object_Directory_Path); Do_Nothing := False; File_Deleted := False; Copyright_Displayed := False; Usage_Displayed := False; Free (Project_File_Name); Main_Project := Prj.No_Project; All_Projects := False; end Initialize; -------------- -- Insert_Q -- -------------- procedure Insert_Q (Lib_File : File_Name_Type) is begin -- Do not insert an empty name or an already marked source if Lib_File /= No_Name and then not Is_Marked (Lib_File) then Q.Table (Q.Last) := Lib_File; Q.Increment_Last; -- Mark the source that has been just added to the Q Mark (Lib_File); end if; end Insert_Q; ---------------------- -- Object_File_Name -- ---------------------- function Object_File_Name (Source : Name_Id) return String is Src : constant String := Get_Name_String (Source); begin -- If the source name has an extension, then replace it with -- the Object suffix. for Index in reverse Src'First + 1 .. Src'Last loop if Src (Index) = '.' then return Src (Src'First .. Index - 1) & Object_Suffix; end if; end loop; -- If there is no dot, or if it is the first character, just add the -- ALI suffix. return Src & Object_Suffix; end Object_File_Name; -------------------- -- Parse_Cmd_Line -- -------------------- procedure Parse_Cmd_Line is Source_Index : Int := 0; Index : Positive := 1; Last : constant Natural := Argument_Count; begin while Index <= Last loop declare Arg : constant String := Argument (Index); procedure Bad_Argument; -- Signal bad argument ------------------ -- Bad_Argument -- ------------------ procedure Bad_Argument is begin Fail ("invalid argument """, Arg, """"); end Bad_Argument; begin if Arg'Length /= 0 then if Arg (1) = '-' then if Arg'Length = 1 then Bad_Argument; end if; case Arg (2) is when 'a' => if Arg'Length < 4 or else Arg (3) /= 'O' then Bad_Argument; end if; Add_Lib_Search_Dir (Arg (3 .. Arg'Last)); when 'c' => Compile_Only := True; when 'D' => if Object_Directory_Path /= null then Fail ("duplicate -D switch"); elsif Project_File_Name /= null then Fail ("-P and -D cannot be used simultaneously"); end if; if Arg'Length > 2 then declare Dir : constant String := Arg (3 .. Arg'Last); begin if not Is_Directory (Dir) then Fail (Dir, " is not a directory"); else Add_Lib_Search_Dir (Dir); end if; end; else if Index = Last then Fail ("no directory specified after -D"); end if; Index := Index + 1; declare Dir : constant String := Argument (Index); begin if not Is_Directory (Dir) then Fail (Dir, " is not a directory"); else Add_Lib_Search_Dir (Dir); end if; end; end if; when 'F' => Full_Path_Name_For_Brief_Errors := True; when 'h' => Usage; when 'i' => if Arg'Length = 2 then Bad_Argument; end if; Source_Index := 0; for J in 3 .. Arg'Last loop if Arg (J) not in '0' .. '9' then Bad_Argument; end if; Source_Index := (20 * Source_Index) + (Character'Pos (Arg (J)) - Character'Pos ('0')); end loop; when 'I' => if Arg = "-I-" then Opt.Look_In_Primary_Dir := False; else if Arg'Length = 2 then Bad_Argument; end if; Add_Lib_Search_Dir (Arg (3 .. Arg'Last)); end if; when 'n' => Do_Nothing := True; when 'P' => if Project_File_Name /= null then Fail ("multiple -P switches"); elsif Object_Directory_Path /= null then Fail ("-D and -P cannot be used simultaneously"); end if; if Arg'Length > 2 then declare Prj : constant String := Arg (3 .. Arg'Last); begin if Prj'Length > 1 and then Prj (Prj'First) = '=' then Project_File_Name := new String' (Prj (Prj'First + 1 .. Prj'Last)); else Project_File_Name := new String'(Prj); end if; end; else if Index = Last then Fail ("no project specified after -P"); end if; Index := Index + 1; Project_File_Name := new String'(Argument (Index)); end if; when 'q' => Quiet_Output := True; when 'r' => All_Projects := True; when 'v' => if Arg = "-v" then Verbose_Mode := True; elsif Arg = "-vP0" then Prj.Com.Current_Verbosity := Prj.Default; elsif Arg = "-vP1" then Prj.Com.Current_Verbosity := Prj.Medium; elsif Arg = "-vP2" then Prj.Com.Current_Verbosity := Prj.High; else Bad_Argument; end if; when 'X' => if Arg'Length = 2 then Bad_Argument; end if; declare Ext_Asgn : constant String := Arg (3 .. Arg'Last); Start : Positive := Ext_Asgn'First; Stop : Natural := Ext_Asgn'Last; Equal_Pos : Natural; OK : Boolean := True; begin if Ext_Asgn (Start) = '"' then if Ext_Asgn (Stop) = '"' then Start := Start + 1; Stop := Stop - 1; else OK := False; end if; end if; Equal_Pos := Start; while Equal_Pos <= Stop and then Ext_Asgn (Equal_Pos) /= '=' loop Equal_Pos := Equal_Pos + 1; end loop; if Equal_Pos = Start or else Equal_Pos > Stop then OK := False; end if; if OK then Prj.Ext.Add (External_Name => Ext_Asgn (Start .. Equal_Pos - 1), Value => Ext_Asgn (Equal_Pos + 1 .. Stop)); else Fail ("illegal external assignment '", Ext_Asgn, "'"); end if; end; when others => Bad_Argument; end case; else Add_File (Arg, Source_Index); end if; end if; end; Index := Index + 1; end loop; end Parse_Cmd_Line; ----------------------- -- Repinfo_File_Name -- ----------------------- function Repinfo_File_Name (Source : Name_Id) return String is begin return Get_Name_String (Source) & Repinfo_Suffix; end Repinfo_File_Name; -------------------- -- Tree_File_Name -- -------------------- function Tree_File_Name (Source : Name_Id) return String is Src : constant String := Get_Name_String (Source); begin -- If the source name has an extension, then replace it with -- the tree suffix. for Index in reverse Src'First + 1 .. Src'Last loop if Src (Index) = '.' then return Src (Src'First .. Index - 1) & Tree_Suffix; end if; end loop; -- If there is no dot, or if it is the first character, just add the -- tree suffix. return Src & Tree_Suffix; end Tree_File_Name; ----------- -- Usage -- ----------- procedure Usage is begin if not Usage_Displayed then Usage_Displayed := True; Display_Copyright; Put_Line ("Usage: gnatclean [switches] {[-innn] name}"); New_Line; Put_Line (" names is one or more file names from which " & "the .adb or .ads suffix may be omitted"); Put_Line (" names may be omitted if -P<project> is specified"); New_Line; Put_Line (" -c Only delete compiler generated files"); Put_Line (" -D dir Specify dir as the object library"); Put_Line (" -F Full project path name " & "in brief error messages"); Put_Line (" -h Display this message"); Put_Line (" -innn Index of unit in source for following names"); Put_Line (" -n Nothing to do: only list files to delete"); Put_Line (" -Pproj Use GNAT Project File proj"); Put_Line (" -q Be quiet/terse"); Put_Line (" -r Clean all projects recursively"); Put_Line (" -v Verbose mode"); Put_Line (" -vPx Specify verbosity when parsing " & "GNAT Project Files"); Put_Line (" -Xnm=val Specify an external reference " & "for GNAT Project Files"); New_Line; Put_Line (" -aOdir Specify ALI/object files search path"); Put_Line (" -Idir Like -aOdir"); Put_Line (" -I- Don't look for source/library files " & "in the default directory"); New_Line; end if; end Usage; begin if Hostparm.OpenVMS then Debug_Suffix (Debug_Suffix'First) := '_'; Repinfo_Suffix (Repinfo_Suffix'First) := '_'; B_Start (B_Start'Last) := '$'; end if; end Clean;

31.846346

79

0.498451

a094432ab007d66faa17812e433e3cc91627aeb5

1,477

ads

Ada

src/ada/src/services/route_aggregator/route_aggregator_communication.ads

VVCAS-Sean/OpenUxAS

dcd7be29d182d278a5387908f568d6f8a06b79ee

[ "NASA-1.3" ]

88

2017-08-24T07:02:01.000Z

2022-03-18T04:34:17.000Z

src/ada/src/services/route_aggregator/route_aggregator_communication.ads

VVCAS-Sean/OpenUxAS

dcd7be29d182d278a5387908f568d6f8a06b79ee

[ "NASA-1.3" ]

46

2017-06-08T18:18:08.000Z

2022-03-15T18:24:43.000Z

src/ada/src/services/route_aggregator/route_aggregator_communication.ads

VVCAS-Sean/OpenUxAS

dcd7be29d182d278a5387908f568d6f8a06b79ee

[ "NASA-1.3" ]

53

2017-06-22T14:48:05.000Z

2022-02-15T16:59:38.000Z

with Common; use Common; with LMCP_Messages; use LMCP_Messages; private with Ada.Strings.Unbounded; private with UxAS.Comms.LMCP_Object_Message_Sender_Pipes; -- Package only concerned with message passing. It defines its own state, -- named Mailbox here, which is not mixed with the state of the service. package Route_Aggregator_Communication with SPARK_Mode is type Route_Aggregator_Mailbox is limited private; type MessageGroup is (GroundPathPlanner, AircraftPathPlanner); procedure Initialize (This : out Route_Aggregator_Mailbox; Source_Group : String; Unique_Id : Int64; Entity_Id : UInt32; Service_Id : UInt32); procedure sendLimitedCastMessage (This : in out Route_Aggregator_Mailbox; Group : MessageGroup; Msg : Message_Root'Class); procedure sendBroadcastMessage (This : in out Route_Aggregator_Mailbox; Msg : Message_Root'Class); procedure Get_Next_Unique_Sending_Message_Id (This : in out Route_Aggregator_Mailbox; Value : out Int64); private pragma SPARK_Mode (Off); use Ada.Strings.Unbounded; use UxAS.Comms.LMCP_Object_Message_Sender_Pipes; type Route_Aggregator_Mailbox is tagged limited record Message_Sender_Pipe : LMCP_Object_Message_Sender_Pipe; Source_Group : Unbounded_String; Unique_Entity_Send_Message_Id : Int64; end record; end Route_Aggregator_Communication;

29.54

74

0.729858

3856a02a93eb4c8b0d8719c790cb1237e753717d

3,611

ads

Ada

source/amf/mof/cmof/amf-cmof-enumerations-hash.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/mof/cmof/amf-cmof-enumerations-hash.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/mof/cmof/amf-cmof-enumerations-hash.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2012, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ -- This file is generated, don't edit it. ------------------------------------------------------------------------------ with AMF.Elements.Generic_Hash; function AMF.CMOF.Enumerations.Hash is new AMF.Elements.Generic_Hash (CMOF_Enumeration, CMOF_Enumeration_Access);

72.22

78

0.402382

1e08a2d9a35e8e4a043edcc665fd2dca7734a6c8

1,233

ads

Ada

tier-1/xcb/source/thin/xcb-xcb_alloc_error_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_alloc_error_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_alloc_error_t.ads

charlie5/cBound

741be08197a61ad9c72553e3302f3b669902216d

[ "0BSD" ]

null

-- This file is generated by SWIG. Please do not modify by hand. -- with xcb.xcb_request_error_t; with Interfaces.C; with Interfaces.C.Pointers; package xcb.xcb_alloc_error_t is -- Item -- subtype Item is xcb.xcb_request_error_t.Item; -- Item_Array -- type Item_Array is array (Interfaces.C.size_t range <>) of aliased xcb.xcb_alloc_error_t.Item; -- Pointer -- package C_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_alloc_error_t.Item, Element_Array => xcb.xcb_alloc_error_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_alloc_error_t.Pointer; -- Pointer_Pointer -- package C_Pointer_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_alloc_error_t.Pointer, Element_Array => xcb.xcb_alloc_error_t.Pointer_Array, Default_Terminator => null); subtype Pointer_Pointer is C_Pointer_Pointers.Pointer; end xcb.xcb_alloc_error_t;

26.804348

79

0.669911

044c79fb022c0bd011b369f1cac1d4934cff2d17

838

ads

Ada

ada-asynchronous_task_control.ads

mgrojo/adalib

dc1355a5b65c2843e702ac76252addb2caf3c56b

[ "BSD-3-Clause" ]

15

2018-07-08T07:09:19.000Z

2021-11-21T09:58:55.000Z

ada-asynchronous_task_control.ads

mgrojo/adalib

dc1355a5b65c2843e702ac76252addb2caf3c56b

[ "BSD-3-Clause" ]

4

2019-11-17T20:04:33.000Z

2021-08-29T21:24:55.000Z

ada-asynchronous_task_control.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.Task_Identification; package Ada.Asynchronous_Task_Control is pragma Preelaborate (Asynchronous_Task_Control); procedure Hold (T : in Ada.Task_Identification.Task_Id); procedure Continue (T : in Ada.Task_Identification.Task_Id); function Is_Held (T : in Ada.Task_Identification.Task_Id) return Boolean; end Ada.Asynchronous_Task_Control;

36.434783

76

0.678998

03b9811a918eb04ce57f9d8fdc97dff1f9b372c3

11,761

adb

Ada

configuration-step_2.adb

annexi-strayline/AURA

fbbc4bc963ee82872a67e088b68f0565ba5b50a7

[ "BSD-3-Clause" ]

13

2021-09-28T18:14:32.000Z

2022-02-09T17:48:53.000Z

configuration-step_2.adb

annexi-strayline/AURA

fbbc4bc963ee82872a67e088b68f0565ba5b50a7

[ "BSD-3-Clause" ]

9

2021-09-28T19:18:25.000Z

2022-01-14T22:54:06.000Z

configuration-step_2.adb

annexi-strayline/AURA

fbbc4bc963ee82872a67e088b68f0565ba5b50a7

[ "BSD-3-Clause" ]

1

2021-10-21T21:19:08.000Z

------------------------------------------------------------------------------ -- -- -- Ada User Repository Annex (AURA) -- -- ANNEXI-STRAYLINE Reference Implementation -- -- -- -- Command Line Interface -- -- -- -- ------------------------------------------------------------------------ -- -- -- -- Copyright (C) 2020, ANNEXI-STRAYLINE Trans-Human Ltd. -- -- All rights reserved. -- -- -- -- Original Contributors: -- -- * Richard Wai (ANNEXI-STRAYLINE) -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions are -- -- met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in -- -- the documentation and/or other materials provided with the -- -- distribution. -- -- -- -- * Neither the name of the copyright holder nor the names of its -- -- contributors may be used to endorse or promote products derived -- -- from this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A -- -- PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT -- -- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, -- -- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY -- -- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -- -- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -- -- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ with Ada.Directories; with Ada.Streams.Stream_IO; with Ada.Strings.UTF_Encoding.Wide_Wide_Strings; with Registrar.Source_Files; with Unicode.UTF8_Stream_Decoder; with Unicode.Case_Folding.Simple; separate (Configuration) -- Step 2 - we are creating a new configuration unit from the manifest. -- -- This means both that the registry does not contain a unit corresponding to -- the configuration unit, and that the registry does cointain a unit -- corresponding to the manifest. We need to process the entire manifest unit. -- -- The biggest part of this job is replacing the manifest's package name from -- Target.AURA to AURA.Target. We will do text substituation, but we need to -- comply with the Ada standard to 1) allow unicode (utf-8) identifiers, and -- 2) apply case-folding. -- -- The Ada standard requires all content to be in Normalization Form 'C' (202X) -- but we don't need to check for that here as the Ada Lexical Parser will -- pick that out during unit entry procedure Step_2 (Target: in out Subsystem) is use type Registrar.Source_Files.Source_File_Access; -- These are already case folded Manifest_Name: constant Unit_Name := Manifest_Unit_Name (Target); Config_Name : constant Unit_Name := Config_Unit_Name (Target); -- The manifest has to exist before a call to Step_2, so we don't need -- to worry about pulling it out of the registry. Manifest: constant Library_Unit := Reg_Qs.Lookup_Unit (Manifest_Name); -- The basic gyst is: we are reading the manifest as a utf-8 stream, -- looking for Expected_Name, and if we find it (we should at least -- one), we replace that in the output stream with Substitute name. -- Everything else passes through unchanged. Expected_Name: constant Wide_Wide_String := Manifest_Name.To_String; Substitute_Name: constant Wide_Wide_String := Config_Name.To_String; Scan_Buffer : Wide_Wide_String (1 .. Expected_Name'Length); Match_Buffer: Wide_Wide_String (Scan_Buffer'Range); Match_Depth: Positive; procedure Find_And_Replace (In_Stream : not null access Ada.Streams.Root_Stream_Type'Class; Out_Stream: not null access Ada.Streams.Root_Stream_Type'Class) is subtype UTF_8_String is Ada.Strings.UTF_Encoding.UTF_8_String; use type UTF_8_String; package UTF_8 renames Ada.Strings.UTF_Encoding.Wide_Wide_Strings; function Decode_Next (UTF8_Stream: not null access Ada.Streams.Root_Stream_Type'Class := In_Stream) return Wide_Wide_Character renames Unicode.UTF8_Stream_Decoder.Decode_Next; begin Match_Depth := Scan_Buffer'First; loop -- The Scan_Buffer will hold the source while we see if it matches -- the expected name, however to match accoring to the Ada rules, -- we need to first do simple case folding before checking for a -- match. Since we don't want to apply that case folding to the -- source itself, we need to have a parallel case-folded buffer Scan_Buffer(Match_Depth) := Decode_Next; Match_Buffer(Match_Depth) := Unicode.Case_Folding.Simple (Scan_Buffer(Match_Depth)); if Match_Buffer(Match_Depth) = Expected_Name(Match_Depth) then if Match_Depth = Scan_Buffer'Last then -- It is not really worth the effort to check for weird things -- showing up where this naieve replace might mangle the middle -- of something that happens to match. It should be rare enough -- (especially in a manifest) to not often cause a problem. -- -- The Ada compiler will almost certainly spot it later. -- -- If we wanted to check for that, we'd really want to bring -- in the Ada lexical parser since we really should not be -- handling the various rules ourselves and creating redundant -- code. However using the parser would mess up our stream. -- -- We considered possibly "rewriting" the unit via the parser, -- but since the Configuration unit really should be human -- -readable and human-changable, this seemed like the wrong -- approach. -- -- If this really becomes a problem, we can always make -- improvements. UTF_8_String'Write (Out_Stream, UTF_8.Encode (Substitute_Name)); Match_Depth := Scan_Buffer'First; else -- Keep trying Match_Depth := Match_Depth + 1; end if; else -- Flush buffer UTF_8_String'Write (Out_Stream, UTF_8.Encode (Scan_Buffer(Scan_Buffer'First .. Match_Depth))); Match_Depth := Scan_Buffer'First; end if; end loop; exception when Ada.Streams.Stream_IO.End_Error => -- The Ada lexical parser on entry is not used to dig down through the -- whole spec, lets do a little check for funny business while we're -- at it (we shouldn't get here if we were in the middle of the -- Expected_Name) Assert (Check => Match_Depth = Scan_Buffer'First, Message => "Unexpected end of manifest"); return; when others => raise; end Find_And_Replace; procedure Register (Name: in String) is use Ada.Directories; Search : Search_Type; New_Reg: Directory_Entry_Type; begin Start_Search (Search => Search, Directory => Current_Directory, Pattern => Name); Assert (Check => More_Entries (Search), Message => "Error registering configuration unit - cannot find " & "generated file " & Name & '!'); Get_Next_Entry (Search => Search, Directory_Entry => New_Reg); Registrar.Registration.Enter_Unit (New_Reg); End_Search (Search); end Register; begin -- The following could be generic, but the parameters would be pretty -- complex, and the code is so simple, it doesn't seem worth it. -- Spec declare use Ada.Streams.Stream_IO; use Registrar.Source_Files; Spec_Name: constant String := "aura-" & Target.Name.To_UTF8_String & ".ads"; File : File_Type; M_Stream : aliased Source_Stream := Checkout_Read_Stream (Manifest.Spec_File); begin Create (File => File, Mode => Out_File, Name => Spec_Name); Find_And_Replace (In_Stream => M_Stream'Access, Out_Stream => Stream (File)); Close (File); Register (Spec_Name); end; if Manifest.Body_File /= null then -- Body declare use Ada.Streams.Stream_IO; use Registrar.Source_Files; Body_Name: constant String := "aura-" & Target.Name.To_UTF8_String & ".adb"; File : File_Type; M_Stream : aliased Source_Stream := Checkout_Read_Stream (Manifest.Body_File); begin Create (File => File, Mode => Out_File, Name => Body_Name); Find_And_Replace (In_Stream => M_Stream'Access, Out_Stream => Stream (File)); Close (File); Register (Body_Name); end; end if; -- Next is Step 3, but we need to wait for the registrar to register the -- configuration unit before we can process it, so we need to defer -- Step_3 Workers.Disable_Completion_Reports; Configuration_Progress.Increment_Total_Items; Workers.Defer_Order (Order => Step_3a_Deferral'(Tracker => Configuration_Progress'Access, Target => Target), Wait_Tracker => Registrar.Registration.Entry_Progress'Access); end Step_2;

42.612319

79

0.548423

038bc747647f34a4ebc7f3a51d7234b69a3e354e

1,930

adb

Ada

ada homework2/src/aircraft.adb

jamalakhaligova/ADA

f4ad841052620f998f7d4e7d23b0457aea0a7565

[ "Apache-2.0" ]

null

ada homework2/src/aircraft.adb

jamalakhaligova/ADA

f4ad841052620f998f7d4e7d23b0457aea0a7565

[ "Apache-2.0" ]

null

ada homework2/src/aircraft.adb

jamalakhaligova/ADA

f4ad841052620f998f7d4e7d23b0457aea0a7565

[ "Apache-2.0" ]

null

package body Aircraft is procedure Ascend(AirC: in out Aircraft_Type) is begin AirC.Is_In_The_Air := True; end; procedure Land(AirC: in out Aircraft_Type) is begin AirC.Is_In_The_Air := False; end; function Get_Is_In_The_Air(AirC: in Aircraft_Type) return Boolean is begin return AirC.Is_In_The_Air; end; function Get_Coord(AirC: in Aircraft_Type) return Coord is begin return AirC.Pos_Airplane; end; procedure Set_Coord(AirC: in out Aircraft_Type; new_Coor: in Coord) is begin AirC.Pos_Airplane := new_Coor; end; procedure Set_Card_Dir_Coord(AirC: in out Aircraft_Type; Car_Dir : in Cardinal_Direction) is begin Change_To_Direction(Car_Dir,AirC.Pos_Airplane); end; procedure Start(AirC: in out Aircraft_Type) is package Random_int is new Ada.Numerics.Discrete_Random (Integer); G : Random_int.Generator; x1 : Integer; y1 : Integer ; begin Random_int.Reset(G); x1 := Random_int.Random(G) mod 100; y1 := Random_int.Random(G) mod 100; Set_X(AirC.Pos_Airplane,x1); Set_Y(AirC.Pos_Airplane,y1); end; procedure Compare(AirC1,AirC2: in out Aircraft_Type) is begin if AirC1.Name < AirC2.Name then Ada.Text_IO.Put_Line("Smaller"); elsif AirC1.Name = AirC2.Name then Ada.Text_IO.Put_Line("Equal"); else Ada.Text_IO.Put_Line("Bigger"); end if; end; function Get_Distance(AirC1,AirC2: Aircraft_Type) return Integer is Cord1 : Coord := AirC1.Pos_Airplane; Cord2 : Coord := AirC2.Pos_Airplane; begin return Get_Distance(Cord1,Cord2); exception when others => return -1; end; procedure Action(Airc: in out Aircraft_Type) is newId : Id := Airc.Name; begin Change(newId => newId,inAir => Airc.Is_In_The_Air, airPos => Airc.Pos_Airplane); end; end Aircraft;

23.82716

95

0.666321

8b670fda50b0a5c8fb45499c51f5c76b25e1837d

1,702

ads

Ada

aosvs/aosvs-multitasking.ads

SMerrony/dgemua

138b09f814c3576e45fe8d25303a6c2329999757

[ "MIT" ]

2

2021-03-26T08:25:38.000Z

2021-06-08T03:10:12.000Z

aosvs/aosvs-multitasking.ads

SMerrony/dgemua

138b09f814c3576e45fe8d25303a6c2329999757

[ "MIT" ]

null

aosvs/aosvs-multitasking.ads

SMerrony/dgemua

138b09f814c3576e45fe8d25303a6c2329999757

[ "MIT" ]

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 DG_Types; use DG_Types; with Processor; use Processor; package AOSVS.Multitasking is function Sys_IFPU (CPU : in out CPU_T) return Boolean; function Sys_KILAD (CPU : in out CPU_T; PID : in Word_T; Kill_Addr : out Phys_Addr_T) return Boolean; function Sys_REC (CPU : in out CPU_T; PID : in Word_T; TID : in Word_T) return Boolean; function Sys_UIDSTAT (CPU : in out CPU_T; PID : in Word_T; TID : in Word_T) return Boolean; function Sys_WDELAY (CPU : in out CPU_T; PID : in Word_T; TID : in Word_T) return Boolean; end AOSVS.Multitasking;

50.058824

106

0.747944

8b6fd686ac77ec02919b60d0039254559b8af7a0

20,400

adb

Ada

NFTools/NFFileProcess/zlib/contrib/ada/zlib.adb

wangxiaobai-dd/NoahGameFrame

7369033de7ab143d79f85cafd188ddecc85207df

[ "Apache-2.0" ]

16,989

2015-09-01T19:57:15.000Z

2022-03-31T23:54:00.000Z

NFTools/NFFileProcess/zlib/contrib/ada/zlib.adb

wangxiaobai-dd/NoahGameFrame

7369033de7ab143d79f85cafd188ddecc85207df

[ "Apache-2.0" ]

12,562

2015-09-01T09:06:01.000Z

2022-03-31T22:26:20.000Z

NFTools/NFFileProcess/zlib/contrib/ada/zlib.adb

wangxiaobai-dd/NoahGameFrame

7369033de7ab143d79f85cafd188ddecc85207df

[ "Apache-2.0" ]

3,707

2015-09-02T19:20:01.000Z

2022-03-31T17:06:14.000Z

---------------------------------------------------------------- -- ZLib for Ada thick binding. -- -- -- -- Copyright (C) 2002-2004 Dmitriy Anisimkov -- -- -- -- Open source license information is in the zlib.ads file. -- ---------------------------------------------------------------- -- $Id: zlib.adb,v 1.31 2004/09/06 06:53:19 vagul Exp $ with Ada.Exceptions; with Ada.Unchecked_Conversion; with Ada.Unchecked_Deallocation; with Interfaces.C.Strings; with ZLib.Thin; package body ZLib is use type Thin.Int; type Z_Stream is new Thin.Z_Stream; type Return_Code_Enum is (OK, STREAM_END, NEED_DICT, ERRNO, STREAM_ERROR, DATA_ERROR, MEM_ERROR, BUF_ERROR, VERSION_ERROR); type Flate_Step_Function is access function (Strm : in Thin.Z_Streamp; Flush : in Thin.Int) return Thin.Int; pragma Convention (C, Flate_Step_Function); type Flate_End_Function is access function (Ctrm : in Thin.Z_Streamp) return Thin.Int; pragma Convention (C, Flate_End_Function); type Flate_Type is record Step : Flate_Step_Function; Done : Flate_End_Function; end record; subtype Footer_Array is Stream_Element_Array (1 .. 8); Simple_GZip_Header : constant Stream_Element_Array (1 .. 10) := (16#1f#, 16#8b#, -- Magic header 16#08#, -- Z_DEFLATED 16#00#, -- Flags 16#00#, 16#00#, 16#00#, 16#00#, -- Time 16#00#, -- XFlags 16#03# -- OS code ); -- The simplest gzip header is not for informational, but just for -- gzip format compatibility. -- Note that some code below is using assumption -- Simple_GZip_Header'Last > Footer_Array'Last, so do not make -- Simple_GZip_Header'Last <= Footer_Array'Last. Return_Code : constant array (Thin.Int range <>) of Return_Code_Enum := (0 => OK, 1 => STREAM_END, 2 => NEED_DICT, -1 => ERRNO, -2 => STREAM_ERROR, -3 => DATA_ERROR, -4 => MEM_ERROR, -5 => BUF_ERROR, -6 => VERSION_ERROR); Flate : constant array (Boolean) of Flate_Type := (True => (Step => Thin.Deflate'Access, Done => Thin.DeflateEnd'Access), False => (Step => Thin.Inflate'Access, Done => Thin.InflateEnd'Access)); Flush_Finish : constant array (Boolean) of Flush_Mode := (True => Finish, False => No_Flush); procedure Raise_Error (Stream : in Z_Stream); pragma Inline (Raise_Error); procedure Raise_Error (Message : in String); pragma Inline (Raise_Error); procedure Check_Error (Stream : in Z_Stream; Code : in Thin.Int); procedure Free is new Ada.Unchecked_Deallocation (Z_Stream, Z_Stream_Access); function To_Thin_Access is new Ada.Unchecked_Conversion (Z_Stream_Access, Thin.Z_Streamp); procedure Translate_GZip (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); -- Separate translate routine for make gzip header. procedure Translate_Auto (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); -- translate routine without additional headers. ----------------- -- Check_Error -- ----------------- procedure Check_Error (Stream : in Z_Stream; Code : in Thin.Int) is use type Thin.Int; begin if Code /= Thin.Z_OK then Raise_Error (Return_Code_Enum'Image (Return_Code (Code)) & ": " & Last_Error_Message (Stream)); end if; end Check_Error; ----------- -- Close -- ----------- procedure Close (Filter : in out Filter_Type; Ignore_Error : in Boolean := False) is Code : Thin.Int; begin if not Ignore_Error and then not Is_Open (Filter) then raise Status_Error; end if; Code := Flate (Filter.Compression).Done (To_Thin_Access (Filter.Strm)); if Ignore_Error or else Code = Thin.Z_OK then Free (Filter.Strm); else declare Error_Message : constant String := Last_Error_Message (Filter.Strm.all); begin Free (Filter.Strm); Ada.Exceptions.Raise_Exception (ZLib_Error'Identity, Return_Code_Enum'Image (Return_Code (Code)) & ": " & Error_Message); end; end if; end Close; ----------- -- CRC32 -- ----------- function CRC32 (CRC : in Unsigned_32; Data : in Ada.Streams.Stream_Element_Array) return Unsigned_32 is use Thin; begin return Unsigned_32 (crc32 (ULong (CRC), Data'Address, Data'Length)); end CRC32; procedure CRC32 (CRC : in out Unsigned_32; Data : in Ada.Streams.Stream_Element_Array) is begin CRC := CRC32 (CRC, Data); end CRC32; ------------------ -- Deflate_Init -- ------------------ 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) is use type Thin.Int; Win_Bits : Thin.Int := Thin.Int (Window_Bits); begin if Is_Open (Filter) then raise Status_Error; end if; -- We allow ZLib to make header only in case of default header type. -- Otherwise we would either do header by ourselfs, or do not do -- header at all. if Header = None or else Header = GZip then Win_Bits := -Win_Bits; end if; -- For the GZip CRC calculation and make headers. if Header = GZip then Filter.CRC := 0; Filter.Offset := Simple_GZip_Header'First; else Filter.Offset := Simple_GZip_Header'Last + 1; end if; Filter.Strm := new Z_Stream; Filter.Compression := True; Filter.Stream_End := False; Filter.Header := Header; if Thin.Deflate_Init (To_Thin_Access (Filter.Strm), Level => Thin.Int (Level), method => Thin.Int (Method), windowBits => Win_Bits, memLevel => Thin.Int (Memory_Level), strategy => Thin.Int (Strategy)) /= Thin.Z_OK then Raise_Error (Filter.Strm.all); end if; end Deflate_Init; ----------- -- Flush -- ----------- 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) is No_Data : Stream_Element_Array := (1 .. 0 => 0); Last : Stream_Element_Offset; begin Translate (Filter, No_Data, Last, Out_Data, Out_Last, Flush); end Flush; ----------------------- -- Generic_Translate -- ----------------------- procedure Generic_Translate (Filter : in out ZLib.Filter_Type; In_Buffer_Size : in Integer := Default_Buffer_Size; Out_Buffer_Size : in Integer := Default_Buffer_Size) is In_Buffer : Stream_Element_Array (1 .. Stream_Element_Offset (In_Buffer_Size)); Out_Buffer : Stream_Element_Array (1 .. Stream_Element_Offset (Out_Buffer_Size)); Last : Stream_Element_Offset; In_Last : Stream_Element_Offset; In_First : Stream_Element_Offset; Out_Last : Stream_Element_Offset; begin Main : loop Data_In (In_Buffer, Last); In_First := In_Buffer'First; loop Translate (Filter => Filter, In_Data => In_Buffer (In_First .. Last), In_Last => In_Last, Out_Data => Out_Buffer, Out_Last => Out_Last, Flush => Flush_Finish (Last < In_Buffer'First)); if Out_Buffer'First <= Out_Last then Data_Out (Out_Buffer (Out_Buffer'First .. Out_Last)); end if; exit Main when Stream_End (Filter); -- The end of in buffer. exit when In_Last = Last; In_First := In_Last + 1; end loop; end loop Main; end Generic_Translate; ------------------ -- Inflate_Init -- ------------------ procedure Inflate_Init (Filter : in out Filter_Type; Window_Bits : in Window_Bits_Type := Default_Window_Bits; Header : in Header_Type := Default) is use type Thin.Int; Win_Bits : Thin.Int := Thin.Int (Window_Bits); procedure Check_Version; -- Check the latest header types compatibility. procedure Check_Version is begin if Version <= "1.1.4" then Raise_Error ("Inflate header type " & Header_Type'Image (Header) & " incompatible with ZLib version " & Version); end if; end Check_Version; begin if Is_Open (Filter) then raise Status_Error; end if; case Header is when None => Check_Version; -- Inflate data without headers determined -- by negative Win_Bits. Win_Bits := -Win_Bits; when GZip => Check_Version; -- Inflate gzip data defined by flag 16. Win_Bits := Win_Bits + 16; when Auto => Check_Version; -- Inflate with automatic detection -- of gzip or native header defined by flag 32. Win_Bits := Win_Bits + 32; when Default => null; end case; Filter.Strm := new Z_Stream; Filter.Compression := False; Filter.Stream_End := False; Filter.Header := Header; if Thin.Inflate_Init (To_Thin_Access (Filter.Strm), Win_Bits) /= Thin.Z_OK then Raise_Error (Filter.Strm.all); end if; end Inflate_Init; ------------- -- Is_Open -- ------------- function Is_Open (Filter : in Filter_Type) return Boolean is begin return Filter.Strm /= null; end Is_Open; ----------------- -- Raise_Error -- ----------------- procedure Raise_Error (Message : in String) is begin Ada.Exceptions.Raise_Exception (ZLib_Error'Identity, Message); end Raise_Error; procedure Raise_Error (Stream : in Z_Stream) is begin Raise_Error (Last_Error_Message (Stream)); end Raise_Error; ---------- -- Read -- ---------- 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) is In_Last : Stream_Element_Offset; Item_First : Ada.Streams.Stream_Element_Offset := Item'First; V_Flush : Flush_Mode := Flush; begin pragma Assert (Rest_First in Buffer'First .. Buffer'Last + 1); pragma Assert (Rest_Last in Buffer'First - 1 .. Buffer'Last); loop if Rest_Last = Buffer'First - 1 then V_Flush := Finish; elsif Rest_First > Rest_Last then Read (Buffer, Rest_Last); Rest_First := Buffer'First; if Rest_Last < Buffer'First then V_Flush := Finish; end if; end if; Translate (Filter => Filter, In_Data => Buffer (Rest_First .. Rest_Last), In_Last => In_Last, Out_Data => Item (Item_First .. Item'Last), Out_Last => Last, Flush => V_Flush); Rest_First := In_Last + 1; exit when Stream_End (Filter) or else Last = Item'Last or else (Last >= Item'First and then Allow_Read_Some); Item_First := Last + 1; end loop; end Read; ---------------- -- Stream_End -- ---------------- function Stream_End (Filter : in Filter_Type) return Boolean is begin if Filter.Header = GZip and Filter.Compression then return Filter.Stream_End and then Filter.Offset = Footer_Array'Last + 1; else return Filter.Stream_End; end if; end Stream_End; -------------- -- Total_In -- -------------- function Total_In (Filter : in Filter_Type) return Count is begin return Count (Thin.Total_In (To_Thin_Access (Filter.Strm).all)); end Total_In; --------------- -- Total_Out -- --------------- function Total_Out (Filter : in Filter_Type) return Count is begin return Count (Thin.Total_Out (To_Thin_Access (Filter.Strm).all)); end Total_Out; --------------- -- Translate -- --------------- 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) is begin if Filter.Header = GZip and then Filter.Compression then Translate_GZip (Filter => Filter, In_Data => In_Data, In_Last => In_Last, Out_Data => Out_Data, Out_Last => Out_Last, Flush => Flush); else Translate_Auto (Filter => Filter, In_Data => In_Data, In_Last => In_Last, Out_Data => Out_Data, Out_Last => Out_Last, Flush => Flush); end if; end Translate; -------------------- -- Translate_Auto -- -------------------- procedure Translate_Auto (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) is use type Thin.Int; Code : Thin.Int; begin if not Is_Open (Filter) then raise Status_Error; end if; if Out_Data'Length = 0 and then In_Data'Length = 0 then raise Constraint_Error; end if; Set_Out (Filter.Strm.all, Out_Data'Address, Out_Data'Length); Set_In (Filter.Strm.all, In_Data'Address, In_Data'Length); Code := Flate (Filter.Compression).Step (To_Thin_Access (Filter.Strm), Thin.Int (Flush)); if Code = Thin.Z_STREAM_END then Filter.Stream_End := True; else Check_Error (Filter.Strm.all, Code); end if; In_Last := In_Data'Last - Stream_Element_Offset (Avail_In (Filter.Strm.all)); Out_Last := Out_Data'Last - Stream_Element_Offset (Avail_Out (Filter.Strm.all)); end Translate_Auto; -------------------- -- Translate_GZip -- -------------------- procedure Translate_GZip (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) is Out_First : Stream_Element_Offset; procedure Add_Data (Data : in Stream_Element_Array); -- Add data to stream from the Filter.Offset till necessary, -- used for add gzip headr/footer. procedure Put_32 (Item : in out Stream_Element_Array; Data : in Unsigned_32); pragma Inline (Put_32); -------------- -- Add_Data -- -------------- procedure Add_Data (Data : in Stream_Element_Array) is Data_First : Stream_Element_Offset renames Filter.Offset; Data_Last : Stream_Element_Offset; Data_Len : Stream_Element_Offset; -- -1 Out_Len : Stream_Element_Offset; -- -1 begin Out_First := Out_Last + 1; if Data_First > Data'Last then return; end if; Data_Len := Data'Last - Data_First; Out_Len := Out_Data'Last - Out_First; if Data_Len <= Out_Len then Out_Last := Out_First + Data_Len; Data_Last := Data'Last; else Out_Last := Out_Data'Last; Data_Last := Data_First + Out_Len; end if; Out_Data (Out_First .. Out_Last) := Data (Data_First .. Data_Last); Data_First := Data_Last + 1; Out_First := Out_Last + 1; end Add_Data; ------------ -- Put_32 -- ------------ procedure Put_32 (Item : in out Stream_Element_Array; Data : in Unsigned_32) is D : Unsigned_32 := Data; begin for J in Item'First .. Item'First + 3 loop Item (J) := Stream_Element (D and 16#FF#); D := Shift_Right (D, 8); end loop; end Put_32; begin Out_Last := Out_Data'First - 1; if not Filter.Stream_End then Add_Data (Simple_GZip_Header); Translate_Auto (Filter => Filter, In_Data => In_Data, In_Last => In_Last, Out_Data => Out_Data (Out_First .. Out_Data'Last), Out_Last => Out_Last, Flush => Flush); CRC32 (Filter.CRC, In_Data (In_Data'First .. In_Last)); end if; if Filter.Stream_End and then Out_Last <= Out_Data'Last then -- This detection method would work only when -- Simple_GZip_Header'Last > Footer_Array'Last if Filter.Offset = Simple_GZip_Header'Last + 1 then Filter.Offset := Footer_Array'First; end if; declare Footer : Footer_Array; begin Put_32 (Footer, Filter.CRC); Put_32 (Footer (Footer'First + 4 .. Footer'Last), Unsigned_32 (Total_In (Filter))); Add_Data (Footer); end; end if; end Translate_GZip; ------------- -- Version -- ------------- function Version return String is begin return Interfaces.C.Strings.Value (Thin.zlibVersion); end Version; ----------- -- Write -- ----------- procedure Write (Filter : in out Filter_Type; Item : in Ada.Streams.Stream_Element_Array; Flush : in Flush_Mode := No_Flush) is Buffer : Stream_Element_Array (1 .. Buffer_Size); In_Last : Stream_Element_Offset; Out_Last : Stream_Element_Offset; In_First : Stream_Element_Offset := Item'First; begin if Item'Length = 0 and Flush = No_Flush then return; end if; loop Translate (Filter => Filter, In_Data => Item (In_First .. Item'Last), In_Last => In_Last, Out_Data => Buffer, Out_Last => Out_Last, Flush => Flush); if Out_Last >= Buffer'First then Write (Buffer (1 .. Out_Last)); end if; exit when In_Last = Item'Last or Stream_End (Filter); In_First := In_Last + 1; end loop; end Write; end ZLib;

29.059829

78

0.551225

1ec086170371217aedb5f8cd63211550d9eaf37b

22,160

adb

Ada

tools-src/gnu/gcc/gcc/ada/s-imgrea.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-imgrea.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-imgrea.adb

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

69

2015-01-02T10:45:56.000Z

2021-09-06T07:52:13.000Z

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . I M G _ R E A L -- -- -- -- B o d y -- -- -- -- $Revision$ -- -- -- Copyright (C) 1992-2001 Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with System.Img_LLU; use System.Img_LLU; with System.Img_Uns; use System.Img_Uns; with System.Powten_Table; use System.Powten_Table; with System.Unsigned_Types; use System.Unsigned_Types; package body System.Img_Real is -- The following defines the maximum number of digits that we can convert -- accurately. This is limited by the precision of Long_Long_Float, and -- also by the number of digits we can hold in Long_Long_Unsigned, which -- is the integer type we use as an intermediate for the result. -- We assume that in practice, the limitation will come from the digits -- value, rather than the integer value. This is true for typical IEEE -- implementations, and at worst, the only loss is for some precision -- in very high precision floating-point output. -- Note that in the following, the "-2" accounts for the sign and one -- extra digits, since we need the maximum number of 9's that can be -- supported, e.g. for the normal 64 bit case, Long_Long_Integer'Width -- is 21, since the maximum value (approx 1.6 * 10**19) has 20 digits, -- but the maximum number of 9's that can be supported is 19. Maxdigs : constant := Natural'Min (Long_Long_Unsigned'Width - 2, Long_Long_Float'Digits); Unsdigs : constant := Unsigned'Width - 2; -- Number of digits that can be converted using type Unsigned -- See above for the explanation of the -2. Maxscaling : constant := 5000; -- Max decimal scaling required during conversion of floating-point -- numbers to decimal. This is used to defend against infinite -- looping in the conversion, as can be caused by erroneous executions. -- The largest exponent used on any current system is 2**16383, which -- is approximately 10**4932, and the highest number of decimal digits -- is about 35 for 128-bit floating-point formats, so 5000 leaves -- enough room for scaling such values function Is_Negative (V : Long_Long_Float) return Boolean; pragma Import (Intrinsic, Is_Negative); -------------------------- -- Image_Floating_Point -- -------------------------- function Image_Floating_Point (V : Long_Long_Float; Digs : Natural) return String is P : Natural := 0; S : String (1 .. Long_Long_Float'Width); begin if not Is_Negative (V) then S (1) := ' '; P := 1; end if; Set_Image_Real (V, S, P, 1, Digs - 1, 3); return S (1 .. P); end Image_Floating_Point; -------------------------------- -- Image_Ordinary_Fixed_Point -- -------------------------------- function Image_Ordinary_Fixed_Point (V : Long_Long_Float; Aft : Natural) return String is P : Natural := 0; S : String (1 .. Long_Long_Float'Width); begin if V >= 0.0 then S (1) := ' '; P := 1; end if; Set_Image_Real (V, S, P, 1, Aft, 0); return S (1 .. P); end Image_Ordinary_Fixed_Point; -------------------- -- Set_Image_Real -- -------------------- procedure Set_Image_Real (V : Long_Long_Float; S : out String; P : in out Natural; Fore : Natural; Aft : Natural; Exp : Natural) is procedure Reset; pragma Import (C, Reset, "__gnat_init_float"); -- We import the floating-point processor reset routine so that we can -- be sure the floating-point processor is properly set for conversion -- calls (see description of Reset in GNAT.Float_Control (g-flocon.ads). -- This is notably need on Windows, where calls to the operating system -- randomly reset the processor into 64-bit mode. NFrac : constant Natural := Natural'Max (Aft, 1); Sign : Character; X : aliased Long_Long_Float; -- This is declared aliased because the expansion of X'Valid passes -- X by access and JGNAT requires all access parameters to be aliased. -- The Valid attribute probably needs to be handled via a different -- expansion for JGNAT, and this use of aliased should be removed -- once Valid is handled properly. ??? Scale : Integer; Expon : Integer; Field_Max : constant := 255; -- This should be the same value as Ada.[Wide_]Text_IO.Field'Last. -- It is not worth dragging in Ada.Text_IO to pick up this value, -- since it really should never be necessary to change it! Digs : String (1 .. 2 * Field_Max + 16); -- Array used to hold digits of converted integer value. This is a -- large enough buffer to accommodate ludicrous values of Fore and Aft. Ndigs : Natural; -- Number of digits stored in Digs (and also subscript of last digit) procedure Adjust_Scale (S : Natural); -- Adjusts the value in X by multiplying or dividing by a power of -- ten so that it is in the range 10**(S-1) <= X < 10**S. Includes -- adding 0.5 to round the result, readjusting if the rounding causes -- the result to wander out of the range. Scale is adjusted to reflect -- the power of ten used to divide the result (i.e. one is added to -- the scale value for each division by 10.0, or one is subtracted -- for each multiplication by 10.0). procedure Convert_Integer; -- Takes the value in X, outputs integer digits into Digs. On return, -- Ndigs is set to the number of digits stored. The digits are stored -- in Digs (1 .. Ndigs), procedure Set (C : Character); -- Sets character C in output buffer procedure Set_Blanks_And_Sign (N : Integer); -- Sets leading blanks and minus sign if needed. N is the number of -- positions to be filled (a minus sign is output even if N is zero -- or negative, but for a positive value, if N is non-positive, then -- the call has no effect). procedure Set_Digs (S, E : Natural); -- Set digits S through E from Digs buffer. No effect if S > E procedure Set_Special_Fill (N : Natural); -- After outputting +Inf, -Inf or NaN, this routine fills out the -- rest of the field with * characters. The argument is the number -- of characters output so far (either 3 or 4) procedure Set_Zeros (N : Integer); -- Set N zeros, no effect if N is negative pragma Inline (Set); pragma Inline (Set_Digs); pragma Inline (Set_Zeros); ------------------ -- Adjust_Scale -- ------------------ procedure Adjust_Scale (S : Natural) is Lo : Natural; Hi : Natural; Mid : Natural; XP : Long_Long_Float; begin -- Cases where scaling up is required if X < Powten (S - 1) then -- What we are looking for is a power of ten to multiply X by -- so that the result lies within the required range. loop XP := X * Powten (Maxpow); exit when XP >= Powten (S - 1) or Scale < -Maxscaling; X := XP; Scale := Scale - Maxpow; end loop; -- The following exception is only raised in case of erroneous -- execution, where a number was considered valid but still -- fails to scale up. One situation where this can happen is -- when a system which is supposed to be IEEE-compliant, but -- has been reconfigured to flush denormals to zero. if Scale < -Maxscaling then raise Constraint_Error; end if; -- Here we know that we must multiply by at least 10**1 and that -- 10**Maxpow takes us too far: binary search to find right one. -- Because of roundoff errors, it is possible for the value -- of XP to be just outside of the interval when Lo >= Hi. In -- that case we adjust explicitly by a factor of 10. This -- can only happen with a value that is very close to an -- exact power of 10. Lo := 1; Hi := Maxpow; loop Mid := (Lo + Hi) / 2; XP := X * Powten (Mid); if XP < Powten (S - 1) then if Lo >= Hi then Mid := Mid + 1; XP := XP * 10.0; exit; else Lo := Mid + 1; end if; elsif XP >= Powten (S) then if Lo >= Hi then Mid := Mid - 1; XP := XP / 10.0; exit; else Hi := Mid - 1; end if; else exit; end if; end loop; X := XP; Scale := Scale - Mid; -- Cases where scaling down is required elsif X >= Powten (S) then -- What we are looking for is a power of ten to divide X by -- so that the result lies within the required range. loop XP := X / Powten (Maxpow); exit when XP < Powten (S) or Scale > Maxscaling; X := XP; Scale := Scale + Maxpow; end loop; -- The following exception is only raised in case of erroneous -- execution, where a number was considered valid but still -- fails to scale up. One situation where this can happen is -- when a system which is supposed to be IEEE-compliant, but -- has been reconfigured to flush denormals to zero. if Scale > Maxscaling then raise Constraint_Error; end if; -- Here we know that we must divide by at least 10**1 and that -- 10**Maxpow takes us too far, binary search to find right one. Lo := 1; Hi := Maxpow; loop Mid := (Lo + Hi) / 2; XP := X / Powten (Mid); if XP < Powten (S - 1) then if Lo >= Hi then XP := XP * 10.0; Mid := Mid - 1; exit; else Hi := Mid - 1; end if; elsif XP >= Powten (S) then if Lo >= Hi then XP := XP / 10.0; Mid := Mid + 1; exit; else Lo := Mid + 1; end if; else exit; end if; end loop; X := XP; Scale := Scale + Mid; -- Here we are already scaled right else null; end if; -- Round, readjusting scale if needed. Note that if a readjustment -- occurs, then it is never necessary to round again, because there -- is no possibility of such a second rounding causing a change. X := X + 0.5; if X >= Powten (S) then X := X / 10.0; Scale := Scale + 1; end if; end Adjust_Scale; --------------------- -- Convert_Integer -- --------------------- procedure Convert_Integer is begin -- Use Unsigned routine if possible, since on many machines it will -- be significantly more efficient than the Long_Long_Unsigned one. if X < Powten (Unsdigs) then Ndigs := 0; Set_Image_Unsigned (Unsigned (Long_Long_Float'Truncation (X)), Digs, Ndigs); -- But if we want more digits than fit in Unsigned, we have to use -- the Long_Long_Unsigned routine after all. else Ndigs := 0; Set_Image_Long_Long_Unsigned (Long_Long_Unsigned (Long_Long_Float'Truncation (X)), Digs, Ndigs); end if; end Convert_Integer; --------- -- Set -- --------- procedure Set (C : Character) is begin P := P + 1; S (P) := C; end Set; ------------------------- -- Set_Blanks_And_Sign -- ------------------------- procedure Set_Blanks_And_Sign (N : Integer) is begin if Sign = '-' then for J in 1 .. N - 1 loop Set (' '); end loop; Set ('-'); else for J in 1 .. N loop Set (' '); end loop; end if; end Set_Blanks_And_Sign; -------------- -- Set_Digs -- -------------- procedure Set_Digs (S, E : Natural) is begin for J in S .. E loop Set (Digs (J)); end loop; end Set_Digs; ---------------------- -- Set_Special_Fill -- ---------------------- procedure Set_Special_Fill (N : Natural) is F : Natural; begin F := Fore + 1 + Aft - N; if Exp /= 0 then F := F + Exp + 1; end if; for J in 1 .. F loop Set ('*'); end loop; end Set_Special_Fill; --------------- -- Set_Zeros -- --------------- procedure Set_Zeros (N : Integer) is begin for J in 1 .. N loop Set ('0'); end loop; end Set_Zeros; -- Start of processing for Set_Image_Real begin Reset; Scale := 0; -- Positive values if V > 0.0 then X := V; Sign := '+'; -- Negative values elsif V < 0.0 then X := -V; Sign := '-'; -- Zero values elsif V = 0.0 then if Long_Long_Float'Signed_Zeros and then Is_Negative (V) then Sign := '-'; else Sign := '+'; end if; Set_Blanks_And_Sign (Fore - 1); Set ('0'); Set ('.'); Set_Zeros (NFrac); if Exp /= 0 then Set ('E'); Set ('+'); Set_Zeros (Natural'Max (1, Exp - 1)); end if; return; end if; -- Deal with invalid values if not X'Valid then -- Note that we're taking our chances here, as X might be -- an invalid bit pattern resulting from erroneous execution -- (caused by using uninitialized variables for example). -- No matter what, we'll at least get reasonable behaviour, -- converting to infinity or some other value, or causing an -- exception to be raised is fine. -- If the following test succeeds, then we definitely have -- an infinite value, so we print Inf. if X > Long_Long_Float'Last then Set (Sign); Set ('I'); Set ('n'); Set ('f'); Set_Special_Fill (4); -- In all other cases we print NaN else Set ('N'); Set ('a'); Set ('N'); Set_Special_Fill (3); end if; return; -- Case of non-zero value with Exp = 0 elsif Exp = 0 then -- First step is to multiply by 10 ** Nfrac to get an integer -- value to be output, an then add 0.5 to round the result. declare NF : Natural := NFrac; begin loop -- If we are larger than Powten (Maxdigs) now, then -- we have too many significant digits, and we have -- not even finished multiplying by NFrac (NF shows -- the number of unaccounted-for digits). if X >= Powten (Maxdigs) then -- In this situation, we only to generate a reasonable -- number of significant digits, and then zeroes after. -- So first we rescale to get: -- 10 ** (Maxdigs - 1) <= X < 10 ** Maxdigs -- and then convert the resulting integer Adjust_Scale (Maxdigs); Convert_Integer; -- If that caused rescaling, then add zeros to the end -- of the number to account for this scaling. Also add -- zeroes to account for the undone multiplications for J in 1 .. Scale + NF loop Ndigs := Ndigs + 1; Digs (Ndigs) := '0'; end loop; exit; -- If multiplication is complete, then convert the resulting -- integer after rounding (note that X is non-negative) elsif NF = 0 then X := X + 0.5; Convert_Integer; exit; -- Otherwise we can go ahead with the multiplication. If it -- can be done in one step, then do it in one step. elsif NF < Maxpow then X := X * Powten (NF); NF := 0; -- If it cannot be done in one step, then do partial scaling else X := X * Powten (Maxpow); NF := NF - Maxpow; end if; end loop; end; -- If number of available digits is less or equal to NFrac, -- then we need an extra zero before the decimal point. if Ndigs <= NFrac then Set_Blanks_And_Sign (Fore - 1); Set ('0'); Set ('.'); Set_Zeros (NFrac - Ndigs); Set_Digs (1, Ndigs); -- Normal case with some digits before the decimal point else Set_Blanks_And_Sign (Fore - (Ndigs - NFrac)); Set_Digs (1, Ndigs - NFrac); Set ('.'); Set_Digs (Ndigs - NFrac + 1, Ndigs); end if; -- Case of non-zero value with non-zero Exp value else -- If NFrac is less than Maxdigs, then all the fraction digits are -- significant, so we can scale the resulting integer accordingly. if NFrac < Maxdigs then Adjust_Scale (NFrac + 1); Convert_Integer; -- Otherwise, we get the maximum number of digits available else Adjust_Scale (Maxdigs); Convert_Integer; for J in 1 .. NFrac - Maxdigs + 1 loop Ndigs := Ndigs + 1; Digs (Ndigs) := '0'; Scale := Scale - 1; end loop; end if; Set_Blanks_And_Sign (Fore - 1); Set (Digs (1)); Set ('.'); Set_Digs (2, Ndigs); -- The exponent is the scaling factor adjusted for the digits -- that we output after the decimal point, since these were -- included in the scaled digits that we output. Expon := Scale + NFrac; Set ('E'); Ndigs := 0; if Expon >= 0 then Set ('+'); Set_Image_Unsigned (Unsigned (Expon), Digs, Ndigs); else Set ('-'); Set_Image_Unsigned (Unsigned (-Expon), Digs, Ndigs); end if; Set_Zeros (Exp - Ndigs - 1); Set_Digs (1, Ndigs); end if; end Set_Image_Real; end System.Img_Real;

32.82963

79

0.496706

adaf59838f7737caa20ba28695fb83ee6c0cf9f2

1,771

adb

Ada

examples/nrf24/main.adb

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

1

2021-04-06T07:57:56.000Z

examples/nrf24/main.adb

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

null

examples/nrf24/main.adb

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

2

2018-05-29T13:59:31.000Z

2019-02-03T19:48:08.000Z

with Ada.Real_Time; use Ada.Real_Time; with STM32GD.Board; with STM32GD.GPIO; with STM32GD.GPIO.Pin; with Peripherals; use Peripherals; procedure Main is package GPIO renames STM32GD.GPIO; package Board renames STM32GD.Board; package Text_IO renames Board.Text_IO; procedure Print_Registers is new Peripherals.Radio.Print_Registers ( Put_Line => Text_IO.Put_Line); procedure RX_Test is RX_Address : constant Radio.Address_Type := ( 16#00#, 16#F0#, 16#F0#, 16#F0#, 16#F0#); begin Text_IO.Put_Line ("Starting RX test"); Radio.Set_RX_Address (RX_Address); Radio.RX_Mode; Print_Registers; loop STM32GD.Board.LED.Toggle; Peripherals.Timer.After (Seconds (10), Radio.Cancel'Access); if Radio.Wait_For_RX then Text_IO.New_Line; Text_IO.Put_Line ("Packet received"); else Text_IO.Put_Line ("*"); end if; Print_Registers; end loop; end RX_Test; procedure TX_Test is Period : constant Time_Span := Seconds (3); Broadcast_Address : constant Radio.Address_Type := ( 16#00#, 16#F0#, 16#F0#, 16#F0#, 16#F0#); TX_Data : constant Radio.Packet_Type := ( 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#55#); begin Text_IO.Put_Line ("Starting TX test"); Radio.Set_TX_Address (Broadcast_Address); Radio.TX_Mode; loop STM32GD.Board.LED.Toggle; Radio.TX (TX_Data); Print_Registers; delay until Clock + Period; end loop; end TX_Test; begin STM32GD.Board.Init; Peripherals.Init; Radio.Set_Channel (70); loop RX_Test; end loop; end Main;

26.833333

72

0.614342

a0cdeb19c7f87364706dc019a4ef08b862f044bc

1,003

ada

Ada

aflex/src/vaxvms/handle_foreign_command_.ada

irion7/aflex-ayacc-mirror

6c8e444ca735a1e2149beb14c5a85759d05403fe

[ "Unlicense" ]

1

2015-01-18T23:09:29.000Z

aflex/src/vaxvms/handle_foreign_command_.ada

irion7/aflex-ayacc-mirror

6c8e444ca735a1e2149beb14c5a85759d05403fe

[ "Unlicense" ]

null

aflex/src/vaxvms/handle_foreign_command_.ada

irion7/aflex-ayacc-mirror

6c8e444ca735a1e2149beb14c5a85759d05403fe

[ "Unlicense" ]

null

-- Handle Foreign Command -- -- This procedure supports the use of the VAX/VMS Foreign Command facility -- in a way similar to that used by the VAX C runtime argc/argv mechanism. -- -- The program is to be 'installed as a foreign command': -- -- $ foo :== $disk:[directories]foo -- -- after which the parameters to a command such as -- -- $ foo -x bar -- -- are obtainable. -- -- In this case, Handle_Argument is called as: -- -- Handle_Argument (Argument_count'First, "-x"); -- Handle_Argument (Argument_Count'First + 1, "bar"); -- -- As with VAX C, -- (a) one level of quotes '"' is stripped. -- (b) arguments not in quotes are converted to lower-case (so, if you -- need upper-case, you _must_ quote the argument). -- (c) only white space delimits arguments, so "-x" and -"x" are the same. -- -- 2.9.92 sjw; orig generic type Argument_Count is range <>; with procedure Handle_Argument (Count : Argument_Count; Argument : String); procedure Handle_Foreign_Command;

27.861111

77

0.673978

8b9902d07271896c4cd28658603339e2127243d2

516,117

adb

Ada

Validation/pyFrame3DD-master/gcc-master/gcc/ada/sem_res.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/sem_res.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/sem_res.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S E M _ R E S -- -- -- -- 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 Aspects; use Aspects; with Atree; use Atree; with Checks; use Checks; with Debug; use Debug; with Debug_A; use Debug_A; with Einfo; use Einfo; with Errout; use Errout; with Expander; use Expander; with Exp_Ch6; use Exp_Ch6; with Exp_Ch7; use Exp_Ch7; with Exp_Disp; use Exp_Disp; with Exp_Tss; use Exp_Tss; with Exp_Util; use Exp_Util; with Freeze; use Freeze; with Ghost; use Ghost; with Inline; use Inline; with Itypes; use Itypes; with Lib; use Lib; with Lib.Xref; use Lib.Xref; with Namet; use Namet; with Nmake; use Nmake; with Nlists; use Nlists; with Opt; use Opt; with Output; use Output; with Par_SCO; use Par_SCO; with Restrict; use Restrict; with Rident; use Rident; with Rtsfind; use Rtsfind; with Sem; use Sem; with Sem_Aggr; use Sem_Aggr; with Sem_Attr; use Sem_Attr; with Sem_Aux; use Sem_Aux; with Sem_Cat; use Sem_Cat; with Sem_Ch3; use Sem_Ch3; with Sem_Ch4; use Sem_Ch4; with Sem_Ch6; use Sem_Ch6; with Sem_Ch8; use Sem_Ch8; with Sem_Ch13; use Sem_Ch13; with Sem_Dim; use Sem_Dim; with Sem_Disp; use Sem_Disp; with Sem_Dist; use Sem_Dist; with Sem_Elab; use Sem_Elab; with Sem_Elim; use Sem_Elim; with Sem_Eval; use Sem_Eval; with Sem_Intr; use Sem_Intr; with Sem_Mech; use Sem_Mech; with Sem_Type; use Sem_Type; with Sem_Util; use Sem_Util; with Sem_Warn; use Sem_Warn; with Sinfo; use Sinfo; with Sinfo.CN; use Sinfo.CN; with Snames; use Snames; with Stand; use Stand; with Stringt; use Stringt; with Style; use Style; with Targparm; use Targparm; with Tbuild; use Tbuild; with Uintp; use Uintp; with Urealp; use Urealp; package body Sem_Res is ----------------------- -- Local Subprograms -- ----------------------- -- Second pass (top-down) type checking and overload resolution procedures -- Typ is the type required by context. These procedures propagate the -- type information recursively to the descendants of N. If the node is not -- overloaded, its Etype is established in the first pass. If overloaded, -- the Resolve routines set the correct type. For arithmetic operators, the -- Etype is the base type of the context. -- Note that Resolve_Attribute is separated off in Sem_Attr procedure Check_Discriminant_Use (N : Node_Id); -- Enforce the restrictions on the use of discriminants when constraining -- a component of a discriminated type (record or concurrent type). procedure Check_For_Visible_Operator (N : Node_Id; T : Entity_Id); -- Given a node for an operator associated with type T, check that the -- operator is visible. Operators all of whose operands are universal must -- be checked for visibility during resolution because their type is not -- determinable based on their operands. procedure Check_Fully_Declared_Prefix (Typ : Entity_Id; Pref : Node_Id); -- Check that the type of the prefix of a dereference is not incomplete function Check_Infinite_Recursion (Call : Node_Id) return Boolean; -- Given a call node, Call, which is known to occur immediately within the -- subprogram being called, determines whether it is a detectable case of -- an infinite recursion, and if so, outputs appropriate messages. Returns -- True if an infinite recursion is detected, and False otherwise. procedure Check_No_Direct_Boolean_Operators (N : Node_Id); -- N is the node for a logical operator. If the operator is predefined, and -- the root type of the operands is Standard.Boolean, then a check is made -- for restriction No_Direct_Boolean_Operators. This procedure also handles -- the style check for Style_Check_Boolean_And_Or. function Is_Atomic_Ref_With_Address (N : Node_Id) return Boolean; -- N is either an indexed component or a selected component. This function -- returns true if the prefix refers to an object that has an address -- clause (the case in which we may want to issue a warning). function Is_Definite_Access_Type (E : Entity_Id) return Boolean; -- Determine whether E is an access type declared by an access declaration, -- and not an (anonymous) allocator type. function Is_Predefined_Op (Nam : Entity_Id) return Boolean; -- Utility to check whether the entity for an operator is a predefined -- operator, in which case the expression is left as an operator in the -- tree (else it is rewritten into a call). An instance of an intrinsic -- conversion operation may be given an operator name, but is not treated -- like an operator. Note that an operator that is an imported back-end -- builtin has convention Intrinsic, but is expected to be rewritten into -- a call, so such an operator is not treated as predefined by this -- predicate. procedure Preanalyze_And_Resolve (N : Node_Id; T : Entity_Id; With_Freezing : Boolean); -- Subsidiary of public versions of Preanalyze_And_Resolve. procedure Replace_Actual_Discriminants (N : Node_Id; Default : Node_Id); -- If a default expression in entry call N depends on the discriminants -- of the task, it must be replaced with a reference to the discriminant -- of the task being called. procedure Resolve_Op_Concat_Arg (N : Node_Id; Arg : Node_Id; Typ : Entity_Id; Is_Comp : Boolean); -- Internal procedure for Resolve_Op_Concat to resolve one operand of -- concatenation operator. The operand is either of the array type or of -- the component type. If the operand is an aggregate, and the component -- type is composite, this is ambiguous if component type has aggregates. procedure Resolve_Op_Concat_First (N : Node_Id; Typ : Entity_Id); -- Does the first part of the work of Resolve_Op_Concat procedure Resolve_Op_Concat_Rest (N : Node_Id; Typ : Entity_Id); -- Does the "rest" of the work of Resolve_Op_Concat, after the left operand -- has been resolved. See Resolve_Op_Concat for details. procedure Resolve_Allocator (N : Node_Id; Typ : Entity_Id); procedure Resolve_Arithmetic_Op (N : Node_Id; Typ : Entity_Id); procedure Resolve_Call (N : Node_Id; Typ : Entity_Id); procedure Resolve_Case_Expression (N : Node_Id; Typ : Entity_Id); procedure Resolve_Character_Literal (N : Node_Id; Typ : Entity_Id); procedure Resolve_Comparison_Op (N : Node_Id; Typ : Entity_Id); procedure Resolve_Declare_Expression (N : Node_Id; Typ : Entity_Id); procedure Resolve_Entity_Name (N : Node_Id; Typ : Entity_Id); procedure Resolve_Equality_Op (N : Node_Id; Typ : Entity_Id); procedure Resolve_Explicit_Dereference (N : Node_Id; Typ : Entity_Id); procedure Resolve_Expression_With_Actions (N : Node_Id; Typ : Entity_Id); procedure Resolve_If_Expression (N : Node_Id; Typ : Entity_Id); procedure Resolve_Generalized_Indexing (N : Node_Id; Typ : Entity_Id); procedure Resolve_Indexed_Component (N : Node_Id; Typ : Entity_Id); procedure Resolve_Integer_Literal (N : Node_Id; Typ : Entity_Id); procedure Resolve_Logical_Op (N : Node_Id; Typ : Entity_Id); procedure Resolve_Membership_Op (N : Node_Id; Typ : Entity_Id); procedure Resolve_Null (N : Node_Id; Typ : Entity_Id); procedure Resolve_Operator_Symbol (N : Node_Id; Typ : Entity_Id); procedure Resolve_Op_Concat (N : Node_Id; Typ : Entity_Id); procedure Resolve_Op_Expon (N : Node_Id; Typ : Entity_Id); procedure Resolve_Op_Not (N : Node_Id; Typ : Entity_Id); procedure Resolve_Qualified_Expression (N : Node_Id; Typ : Entity_Id); procedure Resolve_Raise_Expression (N : Node_Id; Typ : Entity_Id); procedure Resolve_Range (N : Node_Id; Typ : Entity_Id); procedure Resolve_Real_Literal (N : Node_Id; Typ : Entity_Id); procedure Resolve_Reference (N : Node_Id; Typ : Entity_Id); procedure Resolve_Selected_Component (N : Node_Id; Typ : Entity_Id); procedure Resolve_Shift (N : Node_Id; Typ : Entity_Id); procedure Resolve_Short_Circuit (N : Node_Id; Typ : Entity_Id); procedure Resolve_Slice (N : Node_Id; Typ : Entity_Id); procedure Resolve_String_Literal (N : Node_Id; Typ : Entity_Id); procedure Resolve_Target_Name (N : Node_Id; Typ : Entity_Id); procedure Resolve_Type_Conversion (N : Node_Id; Typ : Entity_Id); procedure Resolve_Unary_Op (N : Node_Id; Typ : Entity_Id); procedure Resolve_Unchecked_Expression (N : Node_Id; Typ : Entity_Id); procedure Resolve_Unchecked_Type_Conversion (N : Node_Id; Typ : Entity_Id); function Operator_Kind (Op_Name : Name_Id; Is_Binary : Boolean) return Node_Kind; -- Utility to map the name of an operator into the corresponding Node. Used -- by other node rewriting procedures. procedure Resolve_Actuals (N : Node_Id; Nam : Entity_Id); -- Resolve actuals of call, and add default expressions for missing ones. -- N is the Node_Id for the subprogram call, and Nam is the entity of the -- called subprogram. procedure Resolve_Entry_Call (N : Node_Id; Typ : Entity_Id); -- Called from Resolve_Call, when the prefix denotes an entry or element -- of entry family. Actuals are resolved as for subprograms, and the node -- is rebuilt as an entry call. Also called for protected operations. Typ -- is the context type, which is used when the operation is a protected -- function with no arguments, and the return value is indexed. procedure Resolve_Implicit_Dereference (P : Node_Id); -- Called when P is the prefix of an indexed component, or of a selected -- component, or of a slice. If P is of an access type, we unconditionally -- rewrite it as an explicit dereference. This ensures that the expander -- and the code generator have a fully explicit tree to work with. procedure Resolve_Intrinsic_Operator (N : Node_Id; Typ : Entity_Id); -- A call to a user-defined intrinsic operator is rewritten as a call to -- the corresponding predefined operator, with suitable conversions. Note -- that this applies only for intrinsic operators that denote predefined -- operators, not ones that are intrinsic imports of back-end builtins. procedure Resolve_Intrinsic_Unary_Operator (N : Node_Id; Typ : Entity_Id); -- Ditto, for arithmetic unary operators procedure Rewrite_Operator_As_Call (N : Node_Id; Nam : Entity_Id); -- If an operator node resolves to a call to a user-defined operator, -- rewrite the node as a function call. procedure Make_Call_Into_Operator (N : Node_Id; Typ : Entity_Id; Op_Id : Entity_Id); -- Inverse transformation: if an operator is given in functional notation, -- then after resolving the node, transform into an operator node, so that -- operands are resolved properly. Recall that predefined operators do not -- have a full signature and special resolution rules apply. procedure Rewrite_Renamed_Operator (N : Node_Id; Op : Entity_Id; Typ : Entity_Id); -- An operator can rename another, e.g. in an instantiation. In that -- case, the proper operator node must be constructed and resolved. procedure Set_String_Literal_Subtype (N : Node_Id; Typ : Entity_Id); -- The String_Literal_Subtype is built for all strings that are not -- operands of a static concatenation operation. If the argument is not -- a N_String_Literal node, then the call has no effect. procedure Set_Slice_Subtype (N : Node_Id); -- Build subtype of array type, with the range specified by the slice procedure Simplify_Type_Conversion (N : Node_Id); -- Called after N has been resolved and evaluated, but before range checks -- have been applied. This rewrites the conversion into a simpler form. function Unique_Fixed_Point_Type (N : Node_Id) return Entity_Id; -- A universal_fixed expression in an universal context is unambiguous if -- there is only one applicable fixed point type. Determining whether there -- is only one requires a search over all visible entities, and happens -- only in very pathological cases (see 6115-006). ------------------------- -- Ambiguous_Character -- ------------------------- procedure Ambiguous_Character (C : Node_Id) is E : Entity_Id; begin if Nkind (C) = N_Character_Literal then Error_Msg_N ("ambiguous character literal", C); -- First the ones in Standard Error_Msg_N ("\\possible interpretation: Character!", C); Error_Msg_N ("\\possible interpretation: Wide_Character!", C); -- Include Wide_Wide_Character in Ada 2005 mode if Ada_Version >= Ada_2005 then Error_Msg_N ("\\possible interpretation: Wide_Wide_Character!", C); end if; -- Now any other types that match E := Current_Entity (C); while Present (E) loop Error_Msg_NE ("\\possible interpretation:}!", C, Etype (E)); E := Homonym (E); end loop; end if; end Ambiguous_Character; ------------------------- -- Analyze_And_Resolve -- ------------------------- procedure Analyze_And_Resolve (N : Node_Id) is begin Analyze (N); Resolve (N); end Analyze_And_Resolve; procedure Analyze_And_Resolve (N : Node_Id; Typ : Entity_Id) is begin Analyze (N); Resolve (N, Typ); end Analyze_And_Resolve; -- Versions with check(s) suppressed procedure Analyze_And_Resolve (N : Node_Id; Typ : Entity_Id; Suppress : Check_Id) is Scop : constant Entity_Id := Current_Scope; begin if Suppress = All_Checks then declare Sva : constant Suppress_Array := Scope_Suppress.Suppress; begin Scope_Suppress.Suppress := (others => True); Analyze_And_Resolve (N, Typ); Scope_Suppress.Suppress := Sva; end; else declare Svg : constant Boolean := Scope_Suppress.Suppress (Suppress); begin Scope_Suppress.Suppress (Suppress) := True; Analyze_And_Resolve (N, Typ); Scope_Suppress.Suppress (Suppress) := Svg; end; end if; if Current_Scope /= Scop and then Scope_Is_Transient then -- This can only happen if a transient scope was created for an inner -- expression, which will be removed upon completion of the analysis -- of an enclosing construct. The transient scope must have the -- suppress status of the enclosing environment, not of this Analyze -- call. Scope_Stack.Table (Scope_Stack.Last).Save_Scope_Suppress := Scope_Suppress; end if; end Analyze_And_Resolve; procedure Analyze_And_Resolve (N : Node_Id; Suppress : Check_Id) is Scop : constant Entity_Id := Current_Scope; begin if Suppress = All_Checks then declare Sva : constant Suppress_Array := Scope_Suppress.Suppress; begin Scope_Suppress.Suppress := (others => True); Analyze_And_Resolve (N); Scope_Suppress.Suppress := Sva; end; else declare Svg : constant Boolean := Scope_Suppress.Suppress (Suppress); begin Scope_Suppress.Suppress (Suppress) := True; Analyze_And_Resolve (N); Scope_Suppress.Suppress (Suppress) := Svg; end; end if; if Current_Scope /= Scop and then Scope_Is_Transient then Scope_Stack.Table (Scope_Stack.Last).Save_Scope_Suppress := Scope_Suppress; end if; end Analyze_And_Resolve; ---------------------------- -- Check_Discriminant_Use -- ---------------------------- procedure Check_Discriminant_Use (N : Node_Id) is PN : constant Node_Id := Parent (N); Disc : constant Entity_Id := Entity (N); P : Node_Id; D : Node_Id; begin -- Any use in a spec-expression is legal if In_Spec_Expression then null; elsif Nkind (PN) = N_Range then -- Discriminant cannot be used to constrain a scalar type P := Parent (PN); if Nkind (P) = N_Range_Constraint and then Nkind (Parent (P)) = N_Subtype_Indication and then Nkind (Parent (Parent (P))) = N_Component_Definition then Error_Msg_N ("discriminant cannot constrain scalar type", N); elsif Nkind (P) = N_Index_Or_Discriminant_Constraint then -- The following check catches the unusual case where a -- discriminant appears within an index constraint that is part -- of a larger expression within a constraint on a component, -- e.g. "C : Int range 1 .. F (new A(1 .. D))". For now we only -- check case of record components, and note that a similar check -- should also apply in the case of discriminant constraints -- below. ??? -- Note that the check for N_Subtype_Declaration below is to -- detect the valid use of discriminants in the constraints of a -- subtype declaration when this subtype declaration appears -- inside the scope of a record type (which is syntactically -- illegal, but which may be created as part of derived type -- processing for records). See Sem_Ch3.Build_Derived_Record_Type -- for more info. if Ekind (Current_Scope) = E_Record_Type and then Scope (Disc) = Current_Scope and then not (Nkind (Parent (P)) = N_Subtype_Indication and then Nkind (Parent (Parent (P))) in N_Component_Definition | N_Subtype_Declaration and then Paren_Count (N) = 0) then Error_Msg_N ("discriminant must appear alone in component constraint", N); return; end if; -- Detect a common error: -- type R (D : Positive := 100) is record -- Name : String (1 .. D); -- end record; -- The default value causes an object of type R to be allocated -- with room for Positive'Last characters. The RM does not mandate -- the allocation of the maximum size, but that is what GNAT does -- so we should warn the programmer that there is a problem. Check_Large : declare SI : Node_Id; T : Entity_Id; TB : Node_Id; CB : Entity_Id; function Large_Storage_Type (T : Entity_Id) return Boolean; -- Return True if type T has a large enough range that any -- array whose index type covered the whole range of the type -- would likely raise Storage_Error. ------------------------ -- Large_Storage_Type -- ------------------------ function Large_Storage_Type (T : Entity_Id) return Boolean is begin -- The type is considered large if its bounds are known at -- compile time and if it requires at least as many bits as -- a Positive to store the possible values. return Compile_Time_Known_Value (Type_Low_Bound (T)) and then Compile_Time_Known_Value (Type_High_Bound (T)) and then Minimum_Size (T, Biased => True) >= RM_Size (Standard_Positive); end Large_Storage_Type; -- Start of processing for Check_Large begin -- Check that the Disc has a large range if not Large_Storage_Type (Etype (Disc)) then goto No_Danger; end if; -- If the enclosing type is limited, we allocate only the -- default value, not the maximum, and there is no need for -- a warning. if Is_Limited_Type (Scope (Disc)) then goto No_Danger; end if; -- Check that it is the high bound if N /= High_Bound (PN) or else No (Discriminant_Default_Value (Disc)) then goto No_Danger; end if; -- Check the array allows a large range at this bound. First -- find the array SI := Parent (P); if Nkind (SI) /= N_Subtype_Indication then goto No_Danger; end if; T := Entity (Subtype_Mark (SI)); if not Is_Array_Type (T) then goto No_Danger; end if; -- Next, find the dimension TB := First_Index (T); CB := First (Constraints (P)); while True and then Present (TB) and then Present (CB) and then CB /= PN loop Next_Index (TB); Next (CB); end loop; if CB /= PN then goto No_Danger; end if; -- Now, check the dimension has a large range if not Large_Storage_Type (Etype (TB)) then goto No_Danger; end if; -- Warn about the danger Error_Msg_N ("??creation of & object may raise Storage_Error!", Scope (Disc)); <<No_Danger>> null; end Check_Large; end if; -- Legal case is in index or discriminant constraint elsif Nkind (PN) in N_Index_Or_Discriminant_Constraint | N_Discriminant_Association then if Paren_Count (N) > 0 then Error_Msg_N ("discriminant in constraint must appear alone", N); elsif Nkind (N) = N_Expanded_Name and then Comes_From_Source (N) then Error_Msg_N ("discriminant must appear alone as a direct name", N); end if; return; -- Otherwise, context is an expression. It should not be within (i.e. a -- subexpression of) a constraint for a component. else D := PN; P := Parent (PN); while Nkind (P) not in N_Component_Declaration | N_Subtype_Indication | N_Entry_Declaration loop D := P; P := Parent (P); exit when No (P); end loop; -- If the discriminant is used in an expression that is a bound of a -- scalar type, an Itype is created and the bounds are attached to -- its range, not to the original subtype indication. Such use is of -- course a double fault. if (Nkind (P) = N_Subtype_Indication and then Nkind (Parent (P)) in N_Component_Definition | N_Derived_Type_Definition and then D = Constraint (P)) -- The constraint itself may be given by a subtype indication, -- rather than by a more common discrete range. or else (Nkind (P) = N_Subtype_Indication and then Nkind (Parent (P)) = N_Index_Or_Discriminant_Constraint) or else Nkind (P) = N_Entry_Declaration or else Nkind (D) = N_Defining_Identifier then Error_Msg_N ("discriminant in constraint must appear alone", N); end if; end if; end Check_Discriminant_Use; -------------------------------- -- Check_For_Visible_Operator -- -------------------------------- procedure Check_For_Visible_Operator (N : Node_Id; T : Entity_Id) is begin if Is_Invisible_Operator (N, T) then Error_Msg_NE -- CODEFIX ("operator for} is not directly visible!", N, First_Subtype (T)); Error_Msg_N -- CODEFIX ("use clause would make operation legal!", N); end if; end Check_For_Visible_Operator; ---------------------------------- -- Check_Fully_Declared_Prefix -- ---------------------------------- procedure Check_Fully_Declared_Prefix (Typ : Entity_Id; Pref : Node_Id) is begin -- Check that the designated type of the prefix of a dereference is -- not an incomplete type. This cannot be done unconditionally, because -- dereferences of private types are legal in default expressions. This -- case is taken care of in Check_Fully_Declared, called below. There -- are also 2005 cases where it is legal for the prefix to be unfrozen. -- This consideration also applies to similar checks for allocators, -- qualified expressions, and type conversions. -- An additional exception concerns other per-object expressions that -- are not directly related to component declarations, in particular -- representation pragmas for tasks. These will be per-object -- expressions if they depend on discriminants or some global entity. -- If the task has access discriminants, the designated type may be -- incomplete at the point the expression is resolved. This resolution -- takes place within the body of the initialization procedure, where -- the discriminant is replaced by its discriminal. if Is_Entity_Name (Pref) and then Ekind (Entity (Pref)) = E_In_Parameter then null; -- Ada 2005 (AI-326): Tagged incomplete types allowed. The wrong usages -- are handled by Analyze_Access_Attribute, Analyze_Assignment, -- Analyze_Object_Renaming, and Freeze_Entity. elsif Ada_Version >= Ada_2005 and then Is_Entity_Name (Pref) and then Is_Access_Type (Etype (Pref)) and then Ekind (Directly_Designated_Type (Etype (Pref))) = E_Incomplete_Type and then Is_Tagged_Type (Directly_Designated_Type (Etype (Pref))) then null; else Check_Fully_Declared (Typ, Parent (Pref)); end if; end Check_Fully_Declared_Prefix; ------------------------------ -- Check_Infinite_Recursion -- ------------------------------ function Check_Infinite_Recursion (Call : Node_Id) return Boolean is function Enclosing_Declaration_Or_Statement (N : Node_Id) return Node_Id; -- Return the nearest enclosing declaration or statement that houses -- arbitrary node N. function Invoked_With_Different_Arguments (N : Node_Id) return Boolean; -- Determine whether call N invokes the related enclosing subprogram -- with actuals that differ from the subprogram's formals. function Is_Conditional_Statement (N : Node_Id) return Boolean; -- Determine whether arbitrary node N denotes a conditional construct function Is_Control_Flow_Statement (N : Node_Id) return Boolean; -- Determine whether arbitrary node N denotes a control flow statement -- or a construct that may contains such a statement. function Is_Immediately_Within_Body (N : Node_Id) return Boolean; -- Determine whether arbitrary node N appears immediately within the -- statements of an entry or subprogram body. function Is_Raise_Idiom (N : Node_Id) return Boolean; -- Determine whether arbitrary node N appears immediately within the -- body of an entry or subprogram, and is preceded by a single raise -- statement. function Is_Raise_Statement (N : Node_Id) return Boolean; -- Determine whether arbitrary node N denotes a raise statement function Is_Sole_Statement (N : Node_Id) return Boolean; -- Determine whether arbitrary node N is the sole source statement in -- the body of the enclosing subprogram. function Preceded_By_Control_Flow_Statement (N : Node_Id) return Boolean; -- Determine whether arbitrary node N is preceded by a control flow -- statement. function Within_Conditional_Statement (N : Node_Id) return Boolean; -- Determine whether arbitrary node N appears within a conditional -- construct. ---------------------------------------- -- Enclosing_Declaration_Or_Statement -- ---------------------------------------- function Enclosing_Declaration_Or_Statement (N : Node_Id) return Node_Id is Par : Node_Id; begin Par := N; while Present (Par) loop if Is_Declaration (Par) or else Is_Statement (Par) then return Par; -- Prevent the search from going too far elsif Is_Body_Or_Package_Declaration (Par) then exit; end if; Par := Parent (Par); end loop; return N; end Enclosing_Declaration_Or_Statement; -------------------------------------- -- Invoked_With_Different_Arguments -- -------------------------------------- function Invoked_With_Different_Arguments (N : Node_Id) return Boolean is Subp : constant Entity_Id := Entity (Name (N)); Actual : Node_Id; Formal : Entity_Id; begin -- Determine whether the formals of the invoked subprogram are not -- used as actuals in the call. Actual := First_Actual (Call); Formal := First_Formal (Subp); while Present (Actual) and then Present (Formal) loop -- The current actual does not match the current formal if not (Is_Entity_Name (Actual) and then Entity (Actual) = Formal) then return True; end if; Next_Actual (Actual); Next_Formal (Formal); end loop; return False; end Invoked_With_Different_Arguments; ------------------------------ -- Is_Conditional_Statement -- ------------------------------ function Is_Conditional_Statement (N : Node_Id) return Boolean is begin return Nkind (N) in N_And_Then | N_Case_Expression | N_Case_Statement | N_If_Expression | N_If_Statement | N_Or_Else; end Is_Conditional_Statement; ------------------------------- -- Is_Control_Flow_Statement -- ------------------------------- function Is_Control_Flow_Statement (N : Node_Id) return Boolean is begin -- It is assumed that all statements may affect the control flow in -- some way. A raise statement may be expanded into a non-statement -- node. return Is_Statement (N) or else Is_Raise_Statement (N); end Is_Control_Flow_Statement; -------------------------------- -- Is_Immediately_Within_Body -- -------------------------------- function Is_Immediately_Within_Body (N : Node_Id) return Boolean is HSS : constant Node_Id := Parent (N); begin return Nkind (HSS) = N_Handled_Sequence_Of_Statements and then Nkind (Parent (HSS)) in N_Entry_Body | N_Subprogram_Body and then Is_List_Member (N) and then List_Containing (N) = Statements (HSS); end Is_Immediately_Within_Body; -------------------- -- Is_Raise_Idiom -- -------------------- function Is_Raise_Idiom (N : Node_Id) return Boolean is Raise_Stmt : Node_Id; Stmt : Node_Id; begin if Is_Immediately_Within_Body (N) then -- Assume that no raise statement has been seen yet Raise_Stmt := Empty; -- Examine the statements preceding the input node, skipping -- internally-generated constructs. Stmt := Prev (N); while Present (Stmt) loop -- Multiple raise statements violate the idiom if Is_Raise_Statement (Stmt) then if Present (Raise_Stmt) then return False; end if; Raise_Stmt := Stmt; elsif Comes_From_Source (Stmt) then exit; end if; Stmt := Prev (Stmt); end loop; -- At this point the node must be preceded by a raise statement, -- and the raise statement has to be the sole statement within -- the enclosing entry or subprogram body. return Present (Raise_Stmt) and then Is_Sole_Statement (Raise_Stmt); end if; return False; end Is_Raise_Idiom; ------------------------ -- Is_Raise_Statement -- ------------------------ function Is_Raise_Statement (N : Node_Id) return Boolean is begin -- A raise statement may be transfomed into a Raise_xxx_Error node return Nkind (N) = N_Raise_Statement or else Nkind (N) in N_Raise_xxx_Error; end Is_Raise_Statement; ----------------------- -- Is_Sole_Statement -- ----------------------- function Is_Sole_Statement (N : Node_Id) return Boolean is Stmt : Node_Id; begin -- The input node appears within the statements of an entry or -- subprogram body. Examine the statements preceding the node. if Is_Immediately_Within_Body (N) then Stmt := Prev (N); while Present (Stmt) loop -- The statement is preceded by another statement or a source -- construct. This indicates that the node does not appear by -- itself. if Is_Control_Flow_Statement (Stmt) or else Comes_From_Source (Stmt) then return False; end if; Stmt := Prev (Stmt); end loop; return True; end if; -- The input node is within a construct nested inside the entry or -- subprogram body. return False; end Is_Sole_Statement; ---------------------------------------- -- Preceded_By_Control_Flow_Statement -- ---------------------------------------- function Preceded_By_Control_Flow_Statement (N : Node_Id) return Boolean is Stmt : Node_Id; begin if Is_List_Member (N) then Stmt := Prev (N); -- Examine the statements preceding the input node while Present (Stmt) loop if Is_Control_Flow_Statement (Stmt) then return True; end if; Stmt := Prev (Stmt); end loop; return False; end if; -- Assume that the node is part of some control flow statement return True; end Preceded_By_Control_Flow_Statement; ---------------------------------- -- Within_Conditional_Statement -- ---------------------------------- function Within_Conditional_Statement (N : Node_Id) return Boolean is Stmt : Node_Id; begin Stmt := Parent (N); while Present (Stmt) loop if Is_Conditional_Statement (Stmt) then return True; -- Prevent the search from going too far elsif Is_Body_Or_Package_Declaration (Stmt) then exit; end if; Stmt := Parent (Stmt); end loop; return False; end Within_Conditional_Statement; -- Local variables Call_Context : constant Node_Id := Enclosing_Declaration_Or_Statement (Call); -- Start of processing for Check_Infinite_Recursion begin -- The call is assumed to be safe when the enclosing subprogram is -- invoked with actuals other than its formals. -- -- procedure Proc (F1 : ...; F2 : ...; ...; FN : ...) is -- begin -- ... -- Proc (A1, A2, ..., AN); -- ... -- end Proc; if Invoked_With_Different_Arguments (Call) then return False; -- The call is assumed to be safe when the invocation of the enclosing -- subprogram depends on a conditional statement. -- -- procedure Proc (F1 : ...; F2 : ...; ...; FN : ...) is -- begin -- ... -- if Some_Condition then -- Proc (F1, F2, ..., FN); -- end if; -- ... -- end Proc; elsif Within_Conditional_Statement (Call) then return False; -- The context of the call is assumed to be safe when the invocation of -- the enclosing subprogram is preceded by some control flow statement. -- -- procedure Proc (F1 : ...; F2 : ...; ...; FN : ...) is -- begin -- ... -- if Some_Condition then -- ... -- end if; -- ... -- Proc (F1, F2, ..., FN); -- ... -- end Proc; elsif Preceded_By_Control_Flow_Statement (Call_Context) then return False; -- Detect an idiom where the context of the call is preceded by a single -- raise statement. -- -- procedure Proc (F1 : ...; F2 : ...; ...; FN : ...) is -- begin -- raise ...; -- Proc (F1, F2, ..., FN); -- end Proc; elsif Is_Raise_Idiom (Call_Context) then return False; end if; -- At this point it is certain that infinite recursion will take place -- as long as the call is executed. Detect a case where the context of -- the call is the sole source statement within the subprogram body. -- -- procedure Proc (F1 : ...; F2 : ...; ...; FN : ...) is -- begin -- Proc (F1, F2, ..., FN); -- end Proc; -- -- Install an explicit raise to prevent the infinite recursion. if Is_Sole_Statement (Call_Context) then Error_Msg_Warn := SPARK_Mode /= On; Error_Msg_N ("!infinite recursion<<", Call); Error_Msg_N ("\!Storage_Error [<<", Call); Insert_Action (Call, Make_Raise_Storage_Error (Sloc (Call), Reason => SE_Infinite_Recursion)); -- Otherwise infinite recursion could take place, considering other flow -- control constructs such as gotos, exit statements, etc. else Error_Msg_Warn := SPARK_Mode /= On; Error_Msg_N ("!possible infinite recursion<<", Call); Error_Msg_N ("\!??Storage_Error ]<<", Call); end if; return True; end Check_Infinite_Recursion; --------------------------------------- -- Check_No_Direct_Boolean_Operators -- --------------------------------------- procedure Check_No_Direct_Boolean_Operators (N : Node_Id) is begin if Scope (Entity (N)) = Standard_Standard and then Root_Type (Etype (Left_Opnd (N))) = Standard_Boolean then -- Restriction only applies to original source code if Comes_From_Source (N) then Check_Restriction (No_Direct_Boolean_Operators, N); end if; end if; -- Do style check (but skip if in instance, error is on template) if Style_Check then if not In_Instance then Check_Boolean_Operator (N); end if; end if; end Check_No_Direct_Boolean_Operators; ------------------------------ -- Check_Parameterless_Call -- ------------------------------ procedure Check_Parameterless_Call (N : Node_Id) is Nam : Node_Id; function Prefix_Is_Access_Subp return Boolean; -- If the prefix is of an access_to_subprogram type, the node must be -- rewritten as a call. Ditto if the prefix is overloaded and all its -- interpretations are access to subprograms. --------------------------- -- Prefix_Is_Access_Subp -- --------------------------- function Prefix_Is_Access_Subp return Boolean is I : Interp_Index; It : Interp; begin -- If the context is an attribute reference that can apply to -- functions, this is never a parameterless call (RM 4.1.4(6)). if Nkind (Parent (N)) = N_Attribute_Reference and then Attribute_Name (Parent (N)) in Name_Address | Name_Code_Address | Name_Access then return False; end if; if not Is_Overloaded (N) then return Ekind (Etype (N)) = E_Subprogram_Type and then Base_Type (Etype (Etype (N))) /= Standard_Void_Type; else Get_First_Interp (N, I, It); while Present (It.Typ) loop if Ekind (It.Typ) /= E_Subprogram_Type or else Base_Type (Etype (It.Typ)) = Standard_Void_Type then return False; end if; Get_Next_Interp (I, It); end loop; return True; end if; end Prefix_Is_Access_Subp; -- Start of processing for Check_Parameterless_Call begin -- Defend against junk stuff if errors already detected if Total_Errors_Detected /= 0 then if Nkind (N) in N_Has_Etype and then Etype (N) = Any_Type then return; elsif Nkind (N) in N_Has_Chars and then not Is_Valid_Name (Chars (N)) then return; end if; Require_Entity (N); end if; -- If the context expects a value, and the name is a procedure, this is -- most likely a missing 'Access. Don't try to resolve the parameterless -- call, error will be caught when the outer call is analyzed. if Is_Entity_Name (N) and then Ekind (Entity (N)) = E_Procedure and then not Is_Overloaded (N) and then Nkind (Parent (N)) in N_Parameter_Association | N_Function_Call | N_Procedure_Call_Statement then return; end if; -- Rewrite as call if overloadable entity that is (or could be, in the -- overloaded case) a function call. If we know for sure that the entity -- is an enumeration literal, we do not rewrite it. -- If the entity is the name of an operator, it cannot be a call because -- operators cannot have default parameters. In this case, this must be -- a string whose contents coincide with an operator name. Set the kind -- of the node appropriately. if (Is_Entity_Name (N) and then Nkind (N) /= N_Operator_Symbol and then Is_Overloadable (Entity (N)) and then (Ekind (Entity (N)) /= E_Enumeration_Literal or else Is_Overloaded (N))) -- Rewrite as call if it is an explicit dereference of an expression of -- a subprogram access type, and the subprogram type is not that of a -- procedure or entry. or else (Nkind (N) = N_Explicit_Dereference and then Prefix_Is_Access_Subp) -- Rewrite as call if it is a selected component which is a function, -- this is the case of a call to a protected function (which may be -- overloaded with other protected operations). or else (Nkind (N) = N_Selected_Component and then (Ekind (Entity (Selector_Name (N))) = E_Function or else (Ekind (Entity (Selector_Name (N))) in E_Entry | E_Procedure and then Is_Overloaded (Selector_Name (N))))) -- If one of the above three conditions is met, rewrite as call. Apply -- the rewriting only once. then if Nkind (Parent (N)) /= N_Function_Call or else N /= Name (Parent (N)) then -- This may be a prefixed call that was not fully analyzed, e.g. -- an actual in an instance. if Ada_Version >= Ada_2005 and then Nkind (N) = N_Selected_Component and then Is_Dispatching_Operation (Entity (Selector_Name (N))) then Analyze_Selected_Component (N); if Nkind (N) /= N_Selected_Component then return; end if; end if; -- The node is the name of the parameterless call. Preserve its -- descendants, which may be complex expressions. Nam := Relocate_Node (N); -- If overloaded, overload set belongs to new copy Save_Interps (N, Nam); -- Change node to parameterless function call (note that the -- Parameter_Associations associations field is left set to Empty, -- its normal default value since there are no parameters) Change_Node (N, N_Function_Call); Set_Name (N, Nam); Set_Sloc (N, Sloc (Nam)); Analyze_Call (N); end if; elsif Nkind (N) = N_Parameter_Association then Check_Parameterless_Call (Explicit_Actual_Parameter (N)); elsif Nkind (N) = N_Operator_Symbol then Change_Operator_Symbol_To_String_Literal (N); Set_Is_Overloaded (N, False); Set_Etype (N, Any_String); end if; end Check_Parameterless_Call; -------------------------------- -- Is_Atomic_Ref_With_Address -- -------------------------------- function Is_Atomic_Ref_With_Address (N : Node_Id) return Boolean is Pref : constant Node_Id := Prefix (N); begin if not Is_Entity_Name (Pref) then return False; else declare Pent : constant Entity_Id := Entity (Pref); Ptyp : constant Entity_Id := Etype (Pent); begin return not Is_Access_Type (Ptyp) and then (Is_Atomic (Ptyp) or else Is_Atomic (Pent)) and then Present (Address_Clause (Pent)); end; end if; end Is_Atomic_Ref_With_Address; ----------------------------- -- Is_Definite_Access_Type -- ----------------------------- function Is_Definite_Access_Type (E : Entity_Id) return Boolean is Btyp : constant Entity_Id := Base_Type (E); begin return Ekind (Btyp) = E_Access_Type or else (Ekind (Btyp) = E_Access_Subprogram_Type and then Comes_From_Source (Btyp)); end Is_Definite_Access_Type; ---------------------- -- Is_Predefined_Op -- ---------------------- function Is_Predefined_Op (Nam : Entity_Id) return Boolean is begin -- Predefined operators are intrinsic subprograms if not Is_Intrinsic_Subprogram (Nam) then return False; end if; -- A call to a back-end builtin is never a predefined operator if Is_Imported (Nam) and then Present (Interface_Name (Nam)) then return False; end if; return not Is_Generic_Instance (Nam) and then Chars (Nam) in Any_Operator_Name and then (No (Alias (Nam)) or else Is_Predefined_Op (Alias (Nam))); end Is_Predefined_Op; ----------------------------- -- Make_Call_Into_Operator -- ----------------------------- procedure Make_Call_Into_Operator (N : Node_Id; Typ : Entity_Id; Op_Id : Entity_Id) is Op_Name : constant Name_Id := Chars (Op_Id); Act1 : Node_Id := First_Actual (N); Act2 : Node_Id := Next_Actual (Act1); Error : Boolean := False; Func : constant Entity_Id := Entity (Name (N)); Is_Binary : constant Boolean := Present (Act2); Op_Node : Node_Id; Opnd_Type : Entity_Id := Empty; Orig_Type : Entity_Id := Empty; Pack : Entity_Id; type Kind_Test is access function (E : Entity_Id) return Boolean; function Operand_Type_In_Scope (S : Entity_Id) return Boolean; -- If the operand is not universal, and the operator is given by an -- expanded name, verify that the operand has an interpretation with a -- type defined in the given scope of the operator. function Type_In_P (Test : Kind_Test) return Entity_Id; -- Find a type of the given class in package Pack that contains the -- operator. --------------------------- -- Operand_Type_In_Scope -- --------------------------- function Operand_Type_In_Scope (S : Entity_Id) return Boolean is Nod : constant Node_Id := Right_Opnd (Op_Node); I : Interp_Index; It : Interp; begin if not Is_Overloaded (Nod) then return Scope (Base_Type (Etype (Nod))) = S; else Get_First_Interp (Nod, I, It); while Present (It.Typ) loop if Scope (Base_Type (It.Typ)) = S then return True; end if; Get_Next_Interp (I, It); end loop; return False; end if; end Operand_Type_In_Scope; --------------- -- Type_In_P -- --------------- function Type_In_P (Test : Kind_Test) return Entity_Id is E : Entity_Id; function In_Decl return Boolean; -- Verify that node is not part of the type declaration for the -- candidate type, which would otherwise be invisible. ------------- -- In_Decl -- ------------- function In_Decl return Boolean is Decl_Node : constant Node_Id := Parent (E); N2 : Node_Id; begin N2 := N; if Etype (E) = Any_Type then return True; elsif No (Decl_Node) then return False; else while Present (N2) and then Nkind (N2) /= N_Compilation_Unit loop if N2 = Decl_Node then return True; else N2 := Parent (N2); end if; end loop; return False; end if; end In_Decl; -- Start of processing for Type_In_P begin -- If the context type is declared in the prefix package, this is the -- desired base type. if Scope (Base_Type (Typ)) = Pack and then Test (Typ) then return Base_Type (Typ); else E := First_Entity (Pack); while Present (E) loop if Test (E) and then not In_Decl then return E; end if; Next_Entity (E); end loop; return Empty; end if; end Type_In_P; -- Start of processing for Make_Call_Into_Operator begin Op_Node := New_Node (Operator_Kind (Op_Name, Is_Binary), Sloc (N)); -- Ensure that the corresponding operator has the same parent as the -- original call. This guarantees that parent traversals performed by -- the ABE mechanism succeed. Set_Parent (Op_Node, Parent (N)); -- Binary operator if Is_Binary then Set_Left_Opnd (Op_Node, Relocate_Node (Act1)); Set_Right_Opnd (Op_Node, Relocate_Node (Act2)); Save_Interps (Act1, Left_Opnd (Op_Node)); Save_Interps (Act2, Right_Opnd (Op_Node)); Act1 := Left_Opnd (Op_Node); Act2 := Right_Opnd (Op_Node); -- Unary operator else Set_Right_Opnd (Op_Node, Relocate_Node (Act1)); Save_Interps (Act1, Right_Opnd (Op_Node)); Act1 := Right_Opnd (Op_Node); end if; -- If the operator is denoted by an expanded name, and the prefix is -- not Standard, but the operator is a predefined one whose scope is -- Standard, then this is an implicit_operator, inserted as an -- interpretation by the procedure of the same name. This procedure -- overestimates the presence of implicit operators, because it does -- not examine the type of the operands. Verify now that the operand -- type appears in the given scope. If right operand is universal, -- check the other operand. In the case of concatenation, either -- argument can be the component type, so check the type of the result. -- If both arguments are literals, look for a type of the right kind -- defined in the given scope. This elaborate nonsense is brought to -- you courtesy of b33302a. The type itself must be frozen, so we must -- find the type of the proper class in the given scope. -- A final wrinkle is the multiplication operator for fixed point types, -- which is defined in Standard only, and not in the scope of the -- fixed point type itself. if Nkind (Name (N)) = N_Expanded_Name then Pack := Entity (Prefix (Name (N))); -- If this is a package renaming, get renamed entity, which will be -- the scope of the operands if operaton is type-correct. if Present (Renamed_Entity (Pack)) then Pack := Renamed_Entity (Pack); end if; -- If the entity being called is defined in the given package, it is -- a renaming of a predefined operator, and known to be legal. if Scope (Entity (Name (N))) = Pack and then Pack /= Standard_Standard then null; -- Visibility does not need to be checked in an instance: if the -- operator was not visible in the generic it has been diagnosed -- already, else there is an implicit copy of it in the instance. elsif In_Instance then null; elsif Op_Name in Name_Op_Multiply | Name_Op_Divide and then Is_Fixed_Point_Type (Etype (Act1)) and then Is_Fixed_Point_Type (Etype (Act2)) then if Pack /= Standard_Standard then Error := True; end if; -- Ada 2005 AI-420: Predefined equality on Universal_Access is -- available. elsif Ada_Version >= Ada_2005 and then Op_Name in Name_Op_Eq | Name_Op_Ne and then (Is_Anonymous_Access_Type (Etype (Act1)) or else Is_Anonymous_Access_Type (Etype (Act2))) then null; else Opnd_Type := Base_Type (Etype (Right_Opnd (Op_Node))); if Op_Name = Name_Op_Concat then Opnd_Type := Base_Type (Typ); elsif (Scope (Opnd_Type) = Standard_Standard and then Is_Binary) or else (Nkind (Right_Opnd (Op_Node)) = N_Attribute_Reference and then Is_Binary and then not Comes_From_Source (Opnd_Type)) then Opnd_Type := Base_Type (Etype (Left_Opnd (Op_Node))); end if; if Scope (Opnd_Type) = Standard_Standard then -- Verify that the scope contains a type that corresponds to -- the given literal. Optimize the case where Pack is Standard. if Pack /= Standard_Standard then if Opnd_Type = Universal_Integer then Orig_Type := Type_In_P (Is_Integer_Type'Access); elsif Opnd_Type = Universal_Real then Orig_Type := Type_In_P (Is_Real_Type'Access); elsif Opnd_Type = Any_String then Orig_Type := Type_In_P (Is_String_Type'Access); elsif Opnd_Type = Any_Access then Orig_Type := Type_In_P (Is_Definite_Access_Type'Access); elsif Opnd_Type = Any_Composite then Orig_Type := Type_In_P (Is_Composite_Type'Access); if Present (Orig_Type) then if Has_Private_Component (Orig_Type) then Orig_Type := Empty; else Set_Etype (Act1, Orig_Type); if Is_Binary then Set_Etype (Act2, Orig_Type); end if; end if; end if; else Orig_Type := Empty; end if; Error := No (Orig_Type); end if; elsif Ekind (Opnd_Type) = E_Allocator_Type and then No (Type_In_P (Is_Definite_Access_Type'Access)) then Error := True; -- If the type is defined elsewhere, and the operator is not -- defined in the given scope (by a renaming declaration, e.g.) -- then this is an error as well. If an extension of System is -- present, and the type may be defined there, Pack must be -- System itself. elsif Scope (Opnd_Type) /= Pack and then Scope (Op_Id) /= Pack and then (No (System_Aux_Id) or else Scope (Opnd_Type) /= System_Aux_Id or else Pack /= Scope (System_Aux_Id)) then if not Is_Overloaded (Right_Opnd (Op_Node)) then Error := True; else Error := not Operand_Type_In_Scope (Pack); end if; elsif Pack = Standard_Standard and then not Operand_Type_In_Scope (Standard_Standard) then Error := True; end if; end if; if Error then Error_Msg_Node_2 := Pack; Error_Msg_NE ("& not declared in&", N, Selector_Name (Name (N))); Set_Etype (N, Any_Type); return; -- Detect a mismatch between the context type and the result type -- in the named package, which is otherwise not detected if the -- operands are universal. Check is only needed if source entity is -- an operator, not a function that renames an operator. elsif Nkind (Parent (N)) /= N_Type_Conversion and then Ekind (Entity (Name (N))) = E_Operator and then Is_Numeric_Type (Typ) and then not Is_Universal_Numeric_Type (Typ) and then Scope (Base_Type (Typ)) /= Pack and then not In_Instance then if Is_Fixed_Point_Type (Typ) and then Op_Name in Name_Op_Multiply | Name_Op_Divide then -- Already checked above null; -- Operator may be defined in an extension of System elsif Present (System_Aux_Id) and then Present (Opnd_Type) and then Scope (Opnd_Type) = System_Aux_Id then null; else -- Could we use Wrong_Type here??? (this would require setting -- Etype (N) to the actual type found where Typ was expected). Error_Msg_NE ("expect }", N, Typ); end if; end if; end if; Set_Chars (Op_Node, Op_Name); if not Is_Private_Type (Etype (N)) then Set_Etype (Op_Node, Base_Type (Etype (N))); else Set_Etype (Op_Node, Etype (N)); end if; -- If this is a call to a function that renames a predefined equality, -- the renaming declaration provides a type that must be used to -- resolve the operands. This must be done now because resolution of -- the equality node will not resolve any remaining ambiguity, and it -- assumes that the first operand is not overloaded. if Op_Name in Name_Op_Eq | Name_Op_Ne and then Ekind (Func) = E_Function and then Is_Overloaded (Act1) then Resolve (Act1, Base_Type (Etype (First_Formal (Func)))); Resolve (Act2, Base_Type (Etype (First_Formal (Func)))); end if; Set_Entity (Op_Node, Op_Id); Generate_Reference (Op_Id, N, ' '); -- Do rewrite setting Comes_From_Source on the result if the original -- call came from source. Although it is not strictly the case that the -- operator as such comes from the source, logically it corresponds -- exactly to the function call in the source, so it should be marked -- this way (e.g. to make sure that validity checks work fine). declare CS : constant Boolean := Comes_From_Source (N); begin Rewrite (N, Op_Node); Set_Comes_From_Source (N, CS); end; -- If this is an arithmetic operator and the result type is private, -- the operands and the result must be wrapped in conversion to -- expose the underlying numeric type and expand the proper checks, -- e.g. on division. if Is_Private_Type (Typ) then case Nkind (N) is when N_Op_Add | N_Op_Divide | N_Op_Expon | N_Op_Mod | N_Op_Multiply | N_Op_Rem | N_Op_Subtract => Resolve_Intrinsic_Operator (N, Typ); when N_Op_Abs | N_Op_Minus | N_Op_Plus => Resolve_Intrinsic_Unary_Operator (N, Typ); when others => Resolve (N, Typ); end case; else Resolve (N, Typ); end if; end Make_Call_Into_Operator; ------------------- -- Operator_Kind -- ------------------- function Operator_Kind (Op_Name : Name_Id; Is_Binary : Boolean) return Node_Kind is Kind : Node_Kind; begin -- Use CASE statement or array??? if Is_Binary then if Op_Name = Name_Op_And then Kind := N_Op_And; elsif Op_Name = Name_Op_Or then Kind := N_Op_Or; elsif Op_Name = Name_Op_Xor then Kind := N_Op_Xor; elsif Op_Name = Name_Op_Eq then Kind := N_Op_Eq; elsif Op_Name = Name_Op_Ne then Kind := N_Op_Ne; elsif Op_Name = Name_Op_Lt then Kind := N_Op_Lt; elsif Op_Name = Name_Op_Le then Kind := N_Op_Le; elsif Op_Name = Name_Op_Gt then Kind := N_Op_Gt; elsif Op_Name = Name_Op_Ge then Kind := N_Op_Ge; elsif Op_Name = Name_Op_Add then Kind := N_Op_Add; elsif Op_Name = Name_Op_Subtract then Kind := N_Op_Subtract; elsif Op_Name = Name_Op_Concat then Kind := N_Op_Concat; elsif Op_Name = Name_Op_Multiply then Kind := N_Op_Multiply; elsif Op_Name = Name_Op_Divide then Kind := N_Op_Divide; elsif Op_Name = Name_Op_Mod then Kind := N_Op_Mod; elsif Op_Name = Name_Op_Rem then Kind := N_Op_Rem; elsif Op_Name = Name_Op_Expon then Kind := N_Op_Expon; else raise Program_Error; end if; -- Unary operators else if Op_Name = Name_Op_Add then Kind := N_Op_Plus; elsif Op_Name = Name_Op_Subtract then Kind := N_Op_Minus; elsif Op_Name = Name_Op_Abs then Kind := N_Op_Abs; elsif Op_Name = Name_Op_Not then Kind := N_Op_Not; else raise Program_Error; end if; end if; return Kind; end Operator_Kind; ---------------------------- -- Preanalyze_And_Resolve -- ---------------------------- procedure Preanalyze_And_Resolve (N : Node_Id; T : Entity_Id; With_Freezing : Boolean) is Save_Full_Analysis : constant Boolean := Full_Analysis; Save_Must_Not_Freeze : constant Boolean := Must_Not_Freeze (N); Save_Preanalysis_Count : constant Nat := Inside_Preanalysis_Without_Freezing; begin pragma Assert (Nkind (N) in N_Subexpr); if not With_Freezing then Set_Must_Not_Freeze (N); Inside_Preanalysis_Without_Freezing := Inside_Preanalysis_Without_Freezing + 1; end if; Full_Analysis := False; Expander_Mode_Save_And_Set (False); -- Normally, we suppress all checks for this preanalysis. There is no -- point in processing them now, since they will be applied properly -- and in the proper location when the default expressions reanalyzed -- and reexpanded later on. We will also have more information at that -- point for possible suppression of individual checks. -- However, in SPARK mode, most expansion is suppressed, and this -- later reanalysis and reexpansion may not occur. SPARK mode does -- require the setting of checking flags for proof purposes, so we -- do the SPARK preanalysis without suppressing checks. -- This special handling for SPARK mode is required for example in the -- case of Ada 2012 constructs such as quantified expressions, which are -- expanded in two separate steps. if GNATprove_Mode then Analyze_And_Resolve (N, T); else Analyze_And_Resolve (N, T, Suppress => All_Checks); end if; Expander_Mode_Restore; Full_Analysis := Save_Full_Analysis; Set_Must_Not_Freeze (N, Save_Must_Not_Freeze); if not With_Freezing then Inside_Preanalysis_Without_Freezing := Inside_Preanalysis_Without_Freezing - 1; end if; pragma Assert (Inside_Preanalysis_Without_Freezing = Save_Preanalysis_Count); end Preanalyze_And_Resolve; ---------------------------- -- Preanalyze_And_Resolve -- ---------------------------- procedure Preanalyze_And_Resolve (N : Node_Id; T : Entity_Id) is begin Preanalyze_And_Resolve (N, T, With_Freezing => False); end Preanalyze_And_Resolve; -- Version without context type procedure Preanalyze_And_Resolve (N : Node_Id) is Save_Full_Analysis : constant Boolean := Full_Analysis; begin Full_Analysis := False; Expander_Mode_Save_And_Set (False); Analyze (N); Resolve (N, Etype (N), Suppress => All_Checks); Expander_Mode_Restore; Full_Analysis := Save_Full_Analysis; end Preanalyze_And_Resolve; ------------------------------------------ -- Preanalyze_With_Freezing_And_Resolve -- ------------------------------------------ procedure Preanalyze_With_Freezing_And_Resolve (N : Node_Id; T : Entity_Id) is begin Preanalyze_And_Resolve (N, T, With_Freezing => True); end Preanalyze_With_Freezing_And_Resolve; ---------------------------------- -- Replace_Actual_Discriminants -- ---------------------------------- procedure Replace_Actual_Discriminants (N : Node_Id; Default : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Tsk : Node_Id := Empty; function Process_Discr (Nod : Node_Id) return Traverse_Result; -- Comment needed??? ------------------- -- Process_Discr -- ------------------- function Process_Discr (Nod : Node_Id) return Traverse_Result is Ent : Entity_Id; begin if Nkind (Nod) = N_Identifier then Ent := Entity (Nod); if Present (Ent) and then Ekind (Ent) = E_Discriminant then Rewrite (Nod, Make_Selected_Component (Loc, Prefix => New_Copy_Tree (Tsk, New_Sloc => Loc), Selector_Name => Make_Identifier (Loc, Chars (Ent)))); Set_Etype (Nod, Etype (Ent)); end if; end if; return OK; end Process_Discr; procedure Replace_Discrs is new Traverse_Proc (Process_Discr); -- Start of processing for Replace_Actual_Discriminants begin if Expander_Active then null; -- Allow the replacement of concurrent discriminants in GNATprove even -- though this is a light expansion activity. Note that generic units -- are not modified. elsif GNATprove_Mode and not Inside_A_Generic then null; else return; end if; if Nkind (Name (N)) = N_Selected_Component then Tsk := Prefix (Name (N)); elsif Nkind (Name (N)) = N_Indexed_Component then Tsk := Prefix (Prefix (Name (N))); end if; if Present (Tsk) then Replace_Discrs (Default); end if; end Replace_Actual_Discriminants; ------------- -- Resolve -- ------------- procedure Resolve (N : Node_Id; Typ : Entity_Id) is Ambiguous : Boolean := False; Ctx_Type : Entity_Id := Typ; Expr_Type : Entity_Id := Empty; -- prevent junk warning Err_Type : Entity_Id := Empty; Found : Boolean := False; From_Lib : Boolean; I : Interp_Index; I1 : Interp_Index := 0; -- prevent junk warning It : Interp; It1 : Interp; Seen : Entity_Id := Empty; -- prevent junk warning function Comes_From_Predefined_Lib_Unit (Nod : Node_Id) return Boolean; -- Determine whether a node comes from a predefined library unit or -- Standard. procedure Patch_Up_Value (N : Node_Id; Typ : Entity_Id); -- Try and fix up a literal so that it matches its expected type. New -- literals are manufactured if necessary to avoid cascaded errors. procedure Report_Ambiguous_Argument; -- Additional diagnostics when an ambiguous call has an ambiguous -- argument (typically a controlling actual). procedure Resolution_Failed; -- Called when attempt at resolving current expression fails ------------------------------------ -- Comes_From_Predefined_Lib_Unit -- ------------------------------------- function Comes_From_Predefined_Lib_Unit (Nod : Node_Id) return Boolean is begin return Sloc (Nod) = Standard_Location or else In_Predefined_Unit (Nod); end Comes_From_Predefined_Lib_Unit; -------------------- -- Patch_Up_Value -- -------------------- procedure Patch_Up_Value (N : Node_Id; Typ : Entity_Id) is begin if Nkind (N) = N_Integer_Literal and then Is_Real_Type (Typ) then Rewrite (N, Make_Real_Literal (Sloc (N), Realval => UR_From_Uint (Intval (N)))); Set_Etype (N, Universal_Real); Set_Is_Static_Expression (N); elsif Nkind (N) = N_Real_Literal and then Is_Integer_Type (Typ) then Rewrite (N, Make_Integer_Literal (Sloc (N), Intval => UR_To_Uint (Realval (N)))); Set_Etype (N, Universal_Integer); Set_Is_Static_Expression (N); elsif Nkind (N) = N_String_Literal and then Is_Character_Type (Typ) then Set_Character_Literal_Name (Char_Code (Character'Pos ('A'))); Rewrite (N, Make_Character_Literal (Sloc (N), Chars => Name_Find, Char_Literal_Value => UI_From_Int (Character'Pos ('A')))); Set_Etype (N, Any_Character); Set_Is_Static_Expression (N); elsif Nkind (N) /= N_String_Literal and then Is_String_Type (Typ) then Rewrite (N, Make_String_Literal (Sloc (N), Strval => End_String)); elsif Nkind (N) = N_Range then Patch_Up_Value (Low_Bound (N), Typ); Patch_Up_Value (High_Bound (N), Typ); end if; end Patch_Up_Value; ------------------------------- -- Report_Ambiguous_Argument -- ------------------------------- procedure Report_Ambiguous_Argument is Arg : constant Node_Id := First (Parameter_Associations (N)); I : Interp_Index; It : Interp; begin if Nkind (Arg) = N_Function_Call and then Is_Entity_Name (Name (Arg)) and then Is_Overloaded (Name (Arg)) then Error_Msg_NE ("ambiguous call to&", Arg, Name (Arg)); -- Could use comments on what is going on here??? Get_First_Interp (Name (Arg), I, It); while Present (It.Nam) loop Error_Msg_Sloc := Sloc (It.Nam); if Nkind (Parent (It.Nam)) = N_Full_Type_Declaration then Error_Msg_N ("interpretation (inherited) #!", Arg); else Error_Msg_N ("interpretation #!", Arg); end if; Get_Next_Interp (I, It); end loop; end if; end Report_Ambiguous_Argument; ----------------------- -- Resolution_Failed -- ----------------------- procedure Resolution_Failed is begin Patch_Up_Value (N, Typ); -- Set the type to the desired one to minimize cascaded errors. Note -- that this is an approximation and does not work in all cases. Set_Etype (N, Typ); Debug_A_Exit ("resolving ", N, " (done, resolution failed)"); Set_Is_Overloaded (N, False); -- The caller will return without calling the expander, so we need -- to set the analyzed flag. Note that it is fine to set Analyzed -- to True even if we are in the middle of a shallow analysis, -- (see the spec of sem for more details) since this is an error -- situation anyway, and there is no point in repeating the -- analysis later (indeed it won't work to repeat it later, since -- we haven't got a clear resolution of which entity is being -- referenced.) Set_Analyzed (N, True); return; end Resolution_Failed; Literal_Aspect_Map : constant array (N_Numeric_Or_String_Literal) of Aspect_Id := (N_Integer_Literal => Aspect_Integer_Literal, N_Real_Literal => Aspect_Real_Literal, N_String_Literal => Aspect_String_Literal); -- Start of processing for Resolve begin if N = Error then return; end if; -- Access attribute on remote subprogram cannot be used for a non-remote -- access-to-subprogram type. if Nkind (N) = N_Attribute_Reference and then Attribute_Name (N) in Name_Access | Name_Unrestricted_Access | Name_Unchecked_Access and then Comes_From_Source (N) and then Is_Entity_Name (Prefix (N)) and then Is_Subprogram (Entity (Prefix (N))) and then Is_Remote_Call_Interface (Entity (Prefix (N))) and then not Is_Remote_Access_To_Subprogram_Type (Typ) then Error_Msg_N ("prefix must statically denote a non-remote subprogram", N); end if; From_Lib := Comes_From_Predefined_Lib_Unit (N); -- If the context is a Remote_Access_To_Subprogram, access attributes -- must be resolved with the corresponding fat pointer. There is no need -- to check for the attribute name since the return type of an -- attribute is never a remote type. if Nkind (N) = N_Attribute_Reference and then Comes_From_Source (N) and then (Is_Remote_Call_Interface (Typ) or else Is_Remote_Types (Typ)) then declare Attr : constant Attribute_Id := Get_Attribute_Id (Attribute_Name (N)); Pref : constant Node_Id := Prefix (N); Decl : Node_Id; Spec : Node_Id; Is_Remote : Boolean := True; begin -- Check that Typ is a remote access-to-subprogram type if Is_Remote_Access_To_Subprogram_Type (Typ) then -- Prefix (N) must statically denote a remote subprogram -- declared in a package specification. if Attr = Attribute_Access or else Attr = Attribute_Unchecked_Access or else Attr = Attribute_Unrestricted_Access then Decl := Unit_Declaration_Node (Entity (Pref)); if Nkind (Decl) = N_Subprogram_Body then Spec := Corresponding_Spec (Decl); if Present (Spec) then Decl := Unit_Declaration_Node (Spec); end if; end if; Spec := Parent (Decl); if not Is_Entity_Name (Prefix (N)) or else Nkind (Spec) /= N_Package_Specification or else not Is_Remote_Call_Interface (Defining_Entity (Spec)) then Is_Remote := False; Error_Msg_N ("prefix must statically denote a remote subprogram ", N); end if; -- If we are generating code in distributed mode, perform -- semantic checks against corresponding remote entities. if Expander_Active and then Get_PCS_Name /= Name_No_DSA then Check_Subtype_Conformant (New_Id => Entity (Prefix (N)), Old_Id => Designated_Type (Corresponding_Remote_Type (Typ)), Err_Loc => N); if Is_Remote then Process_Remote_AST_Attribute (N, Typ); end if; end if; end if; end if; end; end if; Debug_A_Entry ("resolving ", N); if Debug_Flag_V then Write_Overloads (N); end if; if Comes_From_Source (N) then if Is_Fixed_Point_Type (Typ) then Check_Restriction (No_Fixed_Point, N); elsif Is_Floating_Point_Type (Typ) and then Typ /= Universal_Real and then Typ /= Any_Real then Check_Restriction (No_Floating_Point, N); end if; end if; -- Return if already analyzed if Analyzed (N) then Debug_A_Exit ("resolving ", N, " (done, already analyzed)"); Analyze_Dimension (N); return; -- Any case of Any_Type as the Etype value means that we had a -- previous error. elsif Etype (N) = Any_Type then Debug_A_Exit ("resolving ", N, " (done, Etype = Any_Type)"); return; end if; Check_Parameterless_Call (N); -- The resolution of an Expression_With_Actions is determined by -- its Expression, but if the node comes from source it is a -- Declare_Expression and requires scope management. if Nkind (N) = N_Expression_With_Actions then if Comes_From_Source (N) and then N = Original_Node (N) then Resolve_Declare_Expression (N, Typ); else Resolve (Expression (N), Typ); end if; Found := True; Expr_Type := Etype (Expression (N)); -- If not overloaded, then we know the type, and all that needs doing -- is to check that this type is compatible with the context. elsif not Is_Overloaded (N) then Found := Covers (Typ, Etype (N)); Expr_Type := Etype (N); -- In the overloaded case, we must select the interpretation that -- is compatible with the context (i.e. the type passed to Resolve) else -- Loop through possible interpretations Get_First_Interp (N, I, It); Interp_Loop : while Present (It.Typ) loop if Debug_Flag_V then Write_Str ("Interp: "); Write_Interp (It); end if; -- We are only interested in interpretations that are compatible -- with the expected type, any other interpretations are ignored. if not Covers (Typ, It.Typ) then if Debug_Flag_V then Write_Str (" interpretation incompatible with context"); Write_Eol; end if; else -- Skip the current interpretation if it is disabled by an -- abstract operator. This action is performed only when the -- type against which we are resolving is the same as the -- type of the interpretation. if Ada_Version >= Ada_2005 and then It.Typ = Typ and then Typ /= Universal_Integer and then Typ /= Universal_Real and then Present (It.Abstract_Op) then if Debug_Flag_V then Write_Line ("Skip."); end if; goto Continue; end if; -- First matching interpretation if not Found then Found := True; I1 := I; Seen := It.Nam; Expr_Type := It.Typ; -- Matching interpretation that is not the first, maybe an -- error, but there are some cases where preference rules are -- used to choose between the two possibilities. These and -- some more obscure cases are handled in Disambiguate. else -- If the current statement is part of a predefined library -- unit, then all interpretations which come from user level -- packages should not be considered. Check previous and -- current one. if From_Lib then if not Comes_From_Predefined_Lib_Unit (It.Nam) then goto Continue; elsif not Comes_From_Predefined_Lib_Unit (Seen) then -- Previous interpretation must be discarded I1 := I; Seen := It.Nam; Expr_Type := It.Typ; Set_Entity (N, Seen); goto Continue; end if; end if; -- Otherwise apply further disambiguation steps Error_Msg_Sloc := Sloc (Seen); It1 := Disambiguate (N, I1, I, Typ); -- Disambiguation has succeeded. Skip the remaining -- interpretations. if It1 /= No_Interp then Seen := It1.Nam; Expr_Type := It1.Typ; while Present (It.Typ) loop Get_Next_Interp (I, It); end loop; else -- Before we issue an ambiguity complaint, check for the -- case of a subprogram call where at least one of the -- arguments is Any_Type, and if so suppress the message, -- since it is a cascaded error. This can also happen for -- a generalized indexing operation. if Nkind (N) in N_Subprogram_Call or else (Nkind (N) = N_Indexed_Component and then Present (Generalized_Indexing (N))) then declare A : Node_Id; E : Node_Id; begin if Nkind (N) = N_Indexed_Component then Rewrite (N, Generalized_Indexing (N)); end if; A := First_Actual (N); while Present (A) loop E := A; if Nkind (E) = N_Parameter_Association then E := Explicit_Actual_Parameter (E); end if; if Etype (E) = Any_Type then if Debug_Flag_V then Write_Str ("Any_Type in call"); Write_Eol; end if; exit Interp_Loop; end if; Next_Actual (A); end loop; end; elsif Nkind (N) in N_Binary_Op and then (Etype (Left_Opnd (N)) = Any_Type or else Etype (Right_Opnd (N)) = Any_Type) then exit Interp_Loop; elsif Nkind (N) in N_Unary_Op and then Etype (Right_Opnd (N)) = Any_Type then exit Interp_Loop; end if; -- Not that special case, so issue message using the flag -- Ambiguous to control printing of the header message -- only at the start of an ambiguous set. if not Ambiguous then if Nkind (N) = N_Function_Call and then Nkind (Name (N)) = N_Explicit_Dereference then Error_Msg_N ("ambiguous expression (cannot resolve indirect " & "call)!", N); else Error_Msg_NE -- CODEFIX ("ambiguous expression (cannot resolve&)!", N, It.Nam); end if; Ambiguous := True; if Nkind (Parent (Seen)) = N_Full_Type_Declaration then Error_Msg_N ("\\possible interpretation (inherited)#!", N); else Error_Msg_N -- CODEFIX ("\\possible interpretation#!", N); end if; if Nkind (N) in N_Subprogram_Call and then Present (Parameter_Associations (N)) then Report_Ambiguous_Argument; end if; end if; Error_Msg_Sloc := Sloc (It.Nam); -- By default, the error message refers to the candidate -- interpretation. But if it is a predefined operator, it -- is implicitly declared at the declaration of the type -- of the operand. Recover the sloc of that declaration -- for the error message. if Nkind (N) in N_Op and then Scope (It.Nam) = Standard_Standard and then not Is_Overloaded (Right_Opnd (N)) and then Scope (Base_Type (Etype (Right_Opnd (N)))) /= Standard_Standard then Err_Type := First_Subtype (Etype (Right_Opnd (N))); if Comes_From_Source (Err_Type) and then Present (Parent (Err_Type)) then Error_Msg_Sloc := Sloc (Parent (Err_Type)); end if; elsif Nkind (N) in N_Binary_Op and then Scope (It.Nam) = Standard_Standard and then not Is_Overloaded (Left_Opnd (N)) and then Scope (Base_Type (Etype (Left_Opnd (N)))) /= Standard_Standard then Err_Type := First_Subtype (Etype (Left_Opnd (N))); if Comes_From_Source (Err_Type) and then Present (Parent (Err_Type)) then Error_Msg_Sloc := Sloc (Parent (Err_Type)); end if; -- If this is an indirect call, use the subprogram_type -- in the message, to have a meaningful location. Also -- indicate if this is an inherited operation, created -- by a type declaration. elsif Nkind (N) = N_Function_Call and then Nkind (Name (N)) = N_Explicit_Dereference and then Is_Type (It.Nam) then Err_Type := It.Nam; Error_Msg_Sloc := Sloc (Associated_Node_For_Itype (Err_Type)); else Err_Type := Empty; end if; if Nkind (N) in N_Op and then Scope (It.Nam) = Standard_Standard and then Present (Err_Type) then -- Special-case the message for universal_fixed -- operators, which are not declared with the type -- of the operand, but appear forever in Standard. if It.Typ = Universal_Fixed and then Scope (It.Nam) = Standard_Standard then Error_Msg_N ("\\possible interpretation as universal_fixed " & "operation (RM 4.5.5 (19))", N); else Error_Msg_N ("\\possible interpretation (predefined)#!", N); end if; elsif Nkind (Parent (It.Nam)) = N_Full_Type_Declaration then Error_Msg_N ("\\possible interpretation (inherited)#!", N); else Error_Msg_N -- CODEFIX ("\\possible interpretation#!", N); end if; end if; end if; -- We have a matching interpretation, Expr_Type is the type -- from this interpretation, and Seen is the entity. -- For an operator, just set the entity name. The type will be -- set by the specific operator resolution routine. if Nkind (N) in N_Op then Set_Entity (N, Seen); Generate_Reference (Seen, N); elsif Nkind (N) in N_Case_Expression | N_Character_Literal | N_Delta_Aggregate | N_If_Expression then Set_Etype (N, Expr_Type); -- AI05-0139-2: Expression is overloaded because type has -- implicit dereference. The context may be the one that -- requires implicit dereferemce. elsif Has_Implicit_Dereference (Expr_Type) then Set_Etype (N, Expr_Type); Set_Is_Overloaded (N, False); -- If the expression is an entity, generate a reference -- to it, as this is not done for an overloaded construct -- during analysis. if Is_Entity_Name (N) and then Comes_From_Source (N) then Generate_Reference (Entity (N), N); -- Examine access discriminants of entity type, -- to check whether one of them yields the -- expected type. declare Disc : Entity_Id := First_Discriminant (Etype (Entity (N))); begin while Present (Disc) loop exit when Is_Access_Type (Etype (Disc)) and then Has_Implicit_Dereference (Disc) and then Designated_Type (Etype (Disc)) = Typ; Next_Discriminant (Disc); end loop; if Present (Disc) then Build_Explicit_Dereference (N, Disc); end if; end; end if; exit Interp_Loop; elsif Is_Overloaded (N) and then Present (It.Nam) and then Ekind (It.Nam) = E_Discriminant and then Has_Implicit_Dereference (It.Nam) then -- If the node is a general indexing, the dereference is -- is inserted when resolving the rewritten form, else -- insert it now. if Nkind (N) /= N_Indexed_Component or else No (Generalized_Indexing (N)) then Build_Explicit_Dereference (N, It.Nam); end if; -- For an explicit dereference, attribute reference, range, -- short-circuit form (which is not an operator node), or call -- with a name that is an explicit dereference, there is -- nothing to be done at this point. elsif Nkind (N) in N_Attribute_Reference | N_And_Then | N_Explicit_Dereference | N_Identifier | N_Indexed_Component | N_Or_Else | N_Range | N_Selected_Component | N_Slice or else Nkind (Name (N)) = N_Explicit_Dereference then null; -- For procedure or function calls, set the type of the name, -- and also the entity pointer for the prefix. elsif Nkind (N) in N_Subprogram_Call and then Is_Entity_Name (Name (N)) then Set_Etype (Name (N), Expr_Type); Set_Entity (Name (N), Seen); Generate_Reference (Seen, Name (N)); elsif Nkind (N) = N_Function_Call and then Nkind (Name (N)) = N_Selected_Component then Set_Etype (Name (N), Expr_Type); Set_Entity (Selector_Name (Name (N)), Seen); Generate_Reference (Seen, Selector_Name (Name (N))); -- For all other cases, just set the type of the Name else Set_Etype (Name (N), Expr_Type); end if; end if; <<Continue>> -- Move to next interpretation exit Interp_Loop when No (It.Typ); Get_Next_Interp (I, It); end loop Interp_Loop; end if; -- At this stage Found indicates whether or not an acceptable -- interpretation exists. If not, then we have an error, except that if -- the context is Any_Type as a result of some other error, then we -- suppress the error report. if not Found then if Typ /= Any_Type then -- If type we are looking for is Void, then this is the procedure -- call case, and the error is simply that what we gave is not a -- procedure name (we think of procedure calls as expressions with -- types internally, but the user doesn't think of them this way). if Typ = Standard_Void_Type then -- Special case message if function used as a procedure if Nkind (N) = N_Procedure_Call_Statement and then Is_Entity_Name (Name (N)) and then Ekind (Entity (Name (N))) = E_Function then Error_Msg_NE ("cannot use call to function & as a statement", Name (N), Entity (Name (N))); Error_Msg_N ("\return value of a function call cannot be ignored", Name (N)); -- Otherwise give general message (not clear what cases this -- covers, but no harm in providing for them). else Error_Msg_N ("expect procedure name in procedure call", N); end if; Found := True; -- Otherwise we do have a subexpression with the wrong type -- Check for the case of an allocator which uses an access type -- instead of the designated type. This is a common error and we -- specialize the message, posting an error on the operand of the -- allocator, complaining that we expected the designated type of -- the allocator. elsif Nkind (N) = N_Allocator and then Is_Access_Type (Typ) and then Is_Access_Type (Etype (N)) and then Designated_Type (Etype (N)) = Typ then Wrong_Type (Expression (N), Designated_Type (Typ)); Found := True; -- Check for view mismatch on Null in instances, for which the -- view-swapping mechanism has no identifier. elsif (In_Instance or else In_Inlined_Body) and then (Nkind (N) = N_Null) and then Is_Private_Type (Typ) and then Is_Access_Type (Full_View (Typ)) then Resolve (N, Full_View (Typ)); Set_Etype (N, Typ); return; -- Check for an aggregate. Sometimes we can get bogus aggregates -- from misuse of parentheses, and we are about to complain about -- the aggregate without even looking inside it. -- Instead, if we have an aggregate of type Any_Composite, then -- analyze and resolve the component fields, and then only issue -- another message if we get no errors doing this (otherwise -- assume that the errors in the aggregate caused the problem). elsif Nkind (N) = N_Aggregate and then Etype (N) = Any_Composite then if Ada_Version >= Ada_2020 and then Has_Aspect (Typ, Aspect_Aggregate) then Resolve_Container_Aggregate (N, Typ); if Expander_Active then Expand (N); end if; return; end if; -- Disable expansion in any case. If there is a type mismatch -- it may be fatal to try to expand the aggregate. The flag -- would otherwise be set to false when the error is posted. Expander_Active := False; declare procedure Check_Aggr (Aggr : Node_Id); -- Check one aggregate, and set Found to True if we have a -- definite error in any of its elements procedure Check_Elmt (Aelmt : Node_Id); -- Check one element of aggregate and set Found to True if -- we definitely have an error in the element. ---------------- -- Check_Aggr -- ---------------- procedure Check_Aggr (Aggr : Node_Id) is Elmt : Node_Id; begin if Present (Expressions (Aggr)) then Elmt := First (Expressions (Aggr)); while Present (Elmt) loop Check_Elmt (Elmt); Next (Elmt); end loop; end if; if Present (Component_Associations (Aggr)) then Elmt := First (Component_Associations (Aggr)); while Present (Elmt) loop -- If this is a default-initialized component, then -- there is nothing to check. The box will be -- replaced by the appropriate call during late -- expansion. if Nkind (Elmt) /= N_Iterated_Component_Association and then not Box_Present (Elmt) then Check_Elmt (Expression (Elmt)); end if; Next (Elmt); end loop; end if; end Check_Aggr; ---------------- -- Check_Elmt -- ---------------- procedure Check_Elmt (Aelmt : Node_Id) is begin -- If we have a nested aggregate, go inside it (to -- attempt a naked analyze-resolve of the aggregate can -- cause undesirable cascaded errors). Do not resolve -- expression if it needs a type from context, as for -- integer * fixed expression. if Nkind (Aelmt) = N_Aggregate then Check_Aggr (Aelmt); else Analyze (Aelmt); if not Is_Overloaded (Aelmt) and then Etype (Aelmt) /= Any_Fixed then Resolve (Aelmt); end if; if Etype (Aelmt) = Any_Type then Found := True; end if; end if; end Check_Elmt; begin Check_Aggr (N); end; end if; -- Rewrite Literal as a call if the corresponding literal aspect -- is set. if Nkind (N) in N_Numeric_Or_String_Literal and then Present (Find_Aspect (Typ, Literal_Aspect_Map (Nkind (N)))) then declare function Literal_Text (N : Node_Id) return String_Id; -- Returns the text of a literal node ------------------- -- Literal_Text -- ------------------- function Literal_Text (N : Node_Id) return String_Id is begin pragma Assert (Nkind (N) in N_Numeric_Or_String_Literal); if Nkind (N) = N_String_Literal then return Strval (N); else return String_From_Numeric_Literal (N); end if; end Literal_Text; Lit_Aspect : constant Aspect_Id := Literal_Aspect_Map (Nkind (N)); Callee : constant Entity_Id := Entity (Expression (Find_Aspect (Typ, Lit_Aspect))); Loc : constant Source_Ptr := Sloc (N); Name : constant Node_Id := Make_Identifier (Loc, Chars (Callee)); Param : constant Node_Id := Make_String_Literal (Loc, Literal_Text (N)); Params : constant List_Id := New_List (Param); Call : Node_Id := Make_Function_Call (Sloc => Loc, Name => Name, Parameter_Associations => Params); begin Set_Entity (Name, Callee); Set_Is_Overloaded (Name, False); if Lit_Aspect = Aspect_String_Literal then Set_Etype (Param, Standard_Wide_Wide_String); else Set_Etype (Param, Standard_String); end if; Set_Etype (Call, Etype (Callee)); -- Conversion needed in case of an inherited aspect -- of a derived type. -- -- ??? Need to do something different here for downward -- tagged conversion case (which is only possible in the -- case of a null extension); the current call to -- Convert_To results in an error message about an illegal -- downward conversion. Call := Convert_To (Typ, Call); Rewrite (N, Call); end; Analyze_And_Resolve (N, Typ); return; end if; -- Looks like we have a type error, but check for special case -- of Address wanted, integer found, with the configuration pragma -- Allow_Integer_Address active. If we have this case, introduce -- an unchecked conversion to allow the integer expression to be -- treated as an Address. The reverse case of integer wanted, -- Address found, is treated in an analogous manner. if Address_Integer_Convert_OK (Typ, Etype (N)) then Rewrite (N, Unchecked_Convert_To (Typ, Relocate_Node (N))); Analyze_And_Resolve (N, Typ); return; -- Under relaxed RM semantics silently replace occurrences of null -- by System.Null_Address. elsif Null_To_Null_Address_Convert_OK (N, Typ) then Replace_Null_By_Null_Address (N); Analyze_And_Resolve (N, Typ); return; end if; -- That special Allow_Integer_Address check did not apply, so we -- have a real type error. If an error message was issued already, -- Found got reset to True, so if it's still False, issue standard -- Wrong_Type message. if not Found then if Is_Overloaded (N) and then Nkind (N) = N_Function_Call then declare Subp_Name : Node_Id; begin if Is_Entity_Name (Name (N)) then Subp_Name := Name (N); elsif Nkind (Name (N)) = N_Selected_Component then -- Protected operation: retrieve operation name Subp_Name := Selector_Name (Name (N)); else raise Program_Error; end if; Error_Msg_Node_2 := Typ; Error_Msg_NE ("no visible interpretation of& matches expected type&", N, Subp_Name); end; if All_Errors_Mode then declare Index : Interp_Index; It : Interp; begin Error_Msg_N ("\\possible interpretations:", N); Get_First_Interp (Name (N), Index, It); while Present (It.Nam) loop Error_Msg_Sloc := Sloc (It.Nam); Error_Msg_Node_2 := It.Nam; Error_Msg_NE ("\\ type& for & declared#", N, It.Typ); Get_Next_Interp (Index, It); end loop; end; else Error_Msg_N ("\use -gnatf for details", N); end if; else Wrong_Type (N, Typ); end if; end if; end if; Resolution_Failed; return; -- Test if we have more than one interpretation for the context elsif Ambiguous then Resolution_Failed; return; -- Only one interpretation else -- In Ada 2005, if we have something like "X : T := 2 + 2;", where -- the "+" on T is abstract, and the operands are of universal type, -- the above code will have (incorrectly) resolved the "+" to the -- universal one in Standard. Therefore check for this case and give -- an error. We can't do this earlier, because it would cause legal -- cases to get errors (when some other type has an abstract "+"). if Ada_Version >= Ada_2005 and then Nkind (N) in N_Op and then Is_Overloaded (N) and then Is_Universal_Numeric_Type (Etype (Entity (N))) then Get_First_Interp (N, I, It); while Present (It.Typ) loop if Present (It.Abstract_Op) and then Etype (It.Abstract_Op) = Typ then Error_Msg_NE ("cannot call abstract subprogram &!", N, It.Abstract_Op); return; end if; Get_Next_Interp (I, It); end loop; end if; -- Here we have an acceptable interpretation for the context -- Propagate type information and normalize tree for various -- predefined operations. If the context only imposes a class of -- types, rather than a specific type, propagate the actual type -- downward. if Typ = Any_Integer or else Typ = Any_Boolean or else Typ = Any_Modular or else Typ = Any_Real or else Typ = Any_Discrete then Ctx_Type := Expr_Type; -- Any_Fixed is legal in a real context only if a specific fixed- -- point type is imposed. If Norman Cohen can be confused by this, -- it deserves a separate message. if Typ = Any_Real and then Expr_Type = Any_Fixed then Error_Msg_N ("illegal context for mixed mode operation", N); Set_Etype (N, Universal_Real); Ctx_Type := Universal_Real; end if; end if; -- A user-defined operator is transformed into a function call at -- this point, so that further processing knows that operators are -- really operators (i.e. are predefined operators). User-defined -- operators that are intrinsic are just renamings of the predefined -- ones, and need not be turned into calls either, but if they rename -- a different operator, we must transform the node accordingly. -- Instantiations of Unchecked_Conversion are intrinsic but are -- treated as functions, even if given an operator designator. if Nkind (N) in N_Op and then Present (Entity (N)) and then Ekind (Entity (N)) /= E_Operator then if not Is_Predefined_Op (Entity (N)) then Rewrite_Operator_As_Call (N, Entity (N)); elsif Present (Alias (Entity (N))) and then Nkind (Parent (Parent (Entity (N)))) = N_Subprogram_Renaming_Declaration then Rewrite_Renamed_Operator (N, Alias (Entity (N)), Typ); -- If the node is rewritten, it will be fully resolved in -- Rewrite_Renamed_Operator. if Analyzed (N) then return; end if; end if; end if; case N_Subexpr'(Nkind (N)) is when N_Aggregate => Resolve_Aggregate (N, Ctx_Type); when N_Allocator => Resolve_Allocator (N, Ctx_Type); when N_Short_Circuit => Resolve_Short_Circuit (N, Ctx_Type); when N_Attribute_Reference => Resolve_Attribute (N, Ctx_Type); when N_Case_Expression => Resolve_Case_Expression (N, Ctx_Type); when N_Character_Literal => Resolve_Character_Literal (N, Ctx_Type); when N_Delta_Aggregate => Resolve_Delta_Aggregate (N, Ctx_Type); when N_Expanded_Name => Resolve_Entity_Name (N, Ctx_Type); when N_Explicit_Dereference => Resolve_Explicit_Dereference (N, Ctx_Type); when N_Expression_With_Actions => Resolve_Expression_With_Actions (N, Ctx_Type); when N_Extension_Aggregate => Resolve_Extension_Aggregate (N, Ctx_Type); when N_Function_Call => Resolve_Call (N, Ctx_Type); when N_Identifier => Resolve_Entity_Name (N, Ctx_Type); when N_If_Expression => Resolve_If_Expression (N, Ctx_Type); when N_Indexed_Component => Resolve_Indexed_Component (N, Ctx_Type); when N_Integer_Literal => Resolve_Integer_Literal (N, Ctx_Type); when N_Membership_Test => Resolve_Membership_Op (N, Ctx_Type); when N_Null => Resolve_Null (N, Ctx_Type); when N_Op_And | N_Op_Or | N_Op_Xor => Resolve_Logical_Op (N, Ctx_Type); when N_Op_Eq | N_Op_Ne => Resolve_Equality_Op (N, Ctx_Type); when N_Op_Ge | N_Op_Gt | N_Op_Le | N_Op_Lt => Resolve_Comparison_Op (N, Ctx_Type); when N_Op_Not => Resolve_Op_Not (N, Ctx_Type); when N_Op_Add | N_Op_Divide | N_Op_Mod | N_Op_Multiply | N_Op_Rem | N_Op_Subtract => Resolve_Arithmetic_Op (N, Ctx_Type); when N_Op_Concat => Resolve_Op_Concat (N, Ctx_Type); when N_Op_Expon => Resolve_Op_Expon (N, Ctx_Type); when N_Op_Abs | N_Op_Minus | N_Op_Plus => Resolve_Unary_Op (N, Ctx_Type); when N_Op_Shift => Resolve_Shift (N, Ctx_Type); when N_Procedure_Call_Statement => Resolve_Call (N, Ctx_Type); when N_Operator_Symbol => Resolve_Operator_Symbol (N, Ctx_Type); when N_Qualified_Expression => Resolve_Qualified_Expression (N, Ctx_Type); -- Why is the following null, needs a comment ??? when N_Quantified_Expression => null; when N_Raise_Expression => Resolve_Raise_Expression (N, Ctx_Type); when N_Raise_xxx_Error => Set_Etype (N, Ctx_Type); when N_Range => Resolve_Range (N, Ctx_Type); when N_Real_Literal => Resolve_Real_Literal (N, Ctx_Type); when N_Reference => Resolve_Reference (N, Ctx_Type); when N_Selected_Component => Resolve_Selected_Component (N, Ctx_Type); when N_Slice => Resolve_Slice (N, Ctx_Type); when N_String_Literal => Resolve_String_Literal (N, Ctx_Type); when N_Target_Name => Resolve_Target_Name (N, Ctx_Type); when N_Type_Conversion => Resolve_Type_Conversion (N, Ctx_Type); when N_Unchecked_Expression => Resolve_Unchecked_Expression (N, Ctx_Type); when N_Unchecked_Type_Conversion => Resolve_Unchecked_Type_Conversion (N, Ctx_Type); end case; -- Mark relevant use-type and use-package clauses as effective using -- the original node because constant folding may have occured and -- removed references that need to be examined. if Nkind (Original_Node (N)) in N_Op then Mark_Use_Clauses (Original_Node (N)); end if; -- Ada 2012 (AI05-0149): Apply an (implicit) conversion to an -- expression of an anonymous access type that occurs in the context -- of a named general access type, except when the expression is that -- of a membership test. This ensures proper legality checking in -- terms of allowed conversions (expressions that would be illegal to -- convert implicitly are allowed in membership tests). if Ada_Version >= Ada_2012 and then Ekind (Base_Type (Ctx_Type)) = E_General_Access_Type and then Ekind (Etype (N)) = E_Anonymous_Access_Type and then Nkind (Parent (N)) not in N_Membership_Test then Rewrite (N, Convert_To (Ctx_Type, Relocate_Node (N))); Analyze_And_Resolve (N, Ctx_Type); end if; -- If the subexpression was replaced by a non-subexpression, then -- all we do is to expand it. The only legitimate case we know of -- is converting procedure call statement to entry call statements, -- but there may be others, so we are making this test general. if Nkind (N) not in N_Subexpr then Debug_A_Exit ("resolving ", N, " (done)"); Expand (N); return; end if; -- The expression is definitely NOT overloaded at this point, so -- we reset the Is_Overloaded flag to avoid any confusion when -- reanalyzing the node. Set_Is_Overloaded (N, False); -- Freeze expression type, entity if it is a name, and designated -- type if it is an allocator (RM 13.14(10,11,13)). -- Now that the resolution of the type of the node is complete, and -- we did not detect an error, we can expand this node. We skip the -- expand call if we are in a default expression, see section -- "Handling of Default Expressions" in Sem spec. Debug_A_Exit ("resolving ", N, " (done)"); -- We unconditionally freeze the expression, even if we are in -- default expression mode (the Freeze_Expression routine tests this -- flag and only freezes static types if it is set). -- Ada 2012 (AI05-177): The declaration of an expression function -- does not cause freezing, but we never reach here in that case. -- Here we are resolving the corresponding expanded body, so we do -- need to perform normal freezing. -- As elsewhere we do not emit freeze node within a generic. We make -- an exception for entities that are expressions, only to detect -- misuses of deferred constants and preserve the output of various -- tests. if not Inside_A_Generic or else Is_Entity_Name (N) then Freeze_Expression (N); end if; -- Now we can do the expansion Expand (N); end if; end Resolve; ------------- -- Resolve -- ------------- -- Version with check(s) suppressed procedure Resolve (N : Node_Id; Typ : Entity_Id; Suppress : Check_Id) is begin if Suppress = All_Checks then declare Sva : constant Suppress_Array := Scope_Suppress.Suppress; begin Scope_Suppress.Suppress := (others => True); Resolve (N, Typ); Scope_Suppress.Suppress := Sva; end; else declare Svg : constant Boolean := Scope_Suppress.Suppress (Suppress); begin Scope_Suppress.Suppress (Suppress) := True; Resolve (N, Typ); Scope_Suppress.Suppress (Suppress) := Svg; end; end if; end Resolve; ------------- -- Resolve -- ------------- -- Version with implicit type procedure Resolve (N : Node_Id) is begin Resolve (N, Etype (N)); end Resolve; --------------------- -- Resolve_Actuals -- --------------------- procedure Resolve_Actuals (N : Node_Id; Nam : Entity_Id) is Loc : constant Source_Ptr := Sloc (N); A : Node_Id; A_Id : Entity_Id; A_Typ : Entity_Id := Empty; -- init to avoid warning F : Entity_Id; F_Typ : Entity_Id; Prev : Node_Id := Empty; Orig_A : Node_Id; Real_F : Entity_Id := Empty; -- init to avoid warning Real_Subp : Entity_Id; -- If the subprogram being called is an inherited operation for -- a formal derived type in an instance, Real_Subp is the subprogram -- that will be called. It may have different formal names than the -- operation of the formal in the generic, so after actual is resolved -- the name of the actual in a named association must carry the name -- of the actual of the subprogram being called. procedure Check_Aliased_Parameter; -- Check rules on aliased parameters and related accessibility rules -- in (RM 3.10.2 (10.2-10.4)). procedure Check_Argument_Order; -- Performs a check for the case where the actuals are all simple -- identifiers that correspond to the formal names, but in the wrong -- order, which is considered suspicious and cause for a warning. procedure Check_Prefixed_Call; -- If the original node is an overloaded call in prefix notation, -- insert an 'Access or a dereference as needed over the first actual. -- Try_Object_Operation has already verified that there is a valid -- interpretation, but the form of the actual can only be determined -- once the primitive operation is identified. procedure Flag_Effectively_Volatile_Objects (Expr : Node_Id); -- Emit an error concerning the illegal usage of an effectively volatile -- object for reading in interfering context (SPARK RM 7.1.3(10)). procedure Insert_Default; -- If the actual is missing in a call, insert in the actuals list -- an instance of the default expression. The insertion is always -- a named association. function Same_Ancestor (T1, T2 : Entity_Id) return Boolean; -- Check whether T1 and T2, or their full views, are derived from a -- common type. Used to enforce the restrictions on array conversions -- of AI95-00246. function Static_Concatenation (N : Node_Id) return Boolean; -- Predicate to determine whether an actual that is a concatenation -- will be evaluated statically and does not need a transient scope. -- This must be determined before the actual is resolved and expanded -- because if needed the transient scope must be introduced earlier. ----------------------------- -- Check_Aliased_Parameter -- ----------------------------- procedure Check_Aliased_Parameter is Nominal_Subt : Entity_Id; begin if Is_Aliased (F) then if Is_Tagged_Type (A_Typ) then null; elsif Is_Aliased_View (A) then if Is_Constr_Subt_For_U_Nominal (A_Typ) then Nominal_Subt := Base_Type (A_Typ); else Nominal_Subt := A_Typ; end if; if Subtypes_Statically_Match (F_Typ, Nominal_Subt) then null; -- In a generic body assume the worst for generic formals: -- they can have a constrained partial view (AI05-041). elsif Has_Discriminants (F_Typ) and then not Is_Constrained (F_Typ) and then not Has_Constrained_Partial_View (F_Typ) and then not Is_Generic_Type (F_Typ) then null; else Error_Msg_NE ("untagged actual does not match " & "aliased formal&", A, F); end if; else Error_Msg_NE ("actual for aliased formal& must be " & "aliased object", A, F); end if; if Ekind (Nam) = E_Procedure then null; elsif Ekind (Etype (Nam)) = E_Anonymous_Access_Type then if Nkind (Parent (N)) = N_Type_Conversion and then Type_Access_Level (Etype (Parent (N))) < Object_Access_Level (A) then Error_Msg_N ("aliased actual has wrong accessibility", A); end if; elsif Nkind (Parent (N)) = N_Qualified_Expression and then Nkind (Parent (Parent (N))) = N_Allocator and then Type_Access_Level (Etype (Parent (Parent (N)))) < Object_Access_Level (A) then Error_Msg_N ("aliased actual in allocator has wrong accessibility", A); end if; end if; end Check_Aliased_Parameter; -------------------------- -- Check_Argument_Order -- -------------------------- procedure Check_Argument_Order is begin -- Nothing to do if no parameters, or original node is neither a -- function call nor a procedure call statement (happens in the -- operator-transformed-to-function call case), or the call is to an -- operator symbol (which is usually in infix form), or the call does -- not come from source, or this warning is off. if not Warn_On_Parameter_Order or else No (Parameter_Associations (N)) or else Nkind (Original_Node (N)) not in N_Subprogram_Call or else (Nkind (Name (N)) = N_Identifier and then Present (Entity (Name (N))) and then Nkind (Entity (Name (N))) = N_Defining_Operator_Symbol) or else not Comes_From_Source (N) then return; end if; declare Nargs : constant Nat := List_Length (Parameter_Associations (N)); begin -- Nothing to do if only one parameter if Nargs < 2 then return; end if; -- Here if at least two arguments declare Actuals : array (1 .. Nargs) of Node_Id; Actual : Node_Id; Formal : Node_Id; Wrong_Order : Boolean := False; -- Set True if an out of order case is found begin -- Collect identifier names of actuals, fail if any actual is -- not a simple identifier, and record max length of name. Actual := First (Parameter_Associations (N)); for J in Actuals'Range loop if Nkind (Actual) /= N_Identifier then return; else Actuals (J) := Actual; Next (Actual); end if; end loop; -- If we got this far, all actuals are identifiers and the list -- of their names is stored in the Actuals array. Formal := First_Formal (Nam); for J in Actuals'Range loop -- If we ran out of formals, that's odd, probably an error -- which will be detected elsewhere, but abandon the search. if No (Formal) then return; end if; -- If name matches and is in order OK if Chars (Formal) = Chars (Actuals (J)) then null; else -- If no match, see if it is elsewhere in list and if so -- flag potential wrong order if type is compatible. for K in Actuals'Range loop if Chars (Formal) = Chars (Actuals (K)) and then Has_Compatible_Type (Actuals (K), Etype (Formal)) then Wrong_Order := True; goto Continue; end if; end loop; -- No match return; end if; <<Continue>> Next_Formal (Formal); end loop; -- If Formals left over, also probably an error, skip warning if Present (Formal) then return; end if; -- Here we give the warning if something was out of order if Wrong_Order then Error_Msg_N ("?P?actuals for this call may be in wrong order", N); end if; end; end; end Check_Argument_Order; ------------------------- -- Check_Prefixed_Call -- ------------------------- procedure Check_Prefixed_Call is Act : constant Node_Id := First_Actual (N); A_Type : constant Entity_Id := Etype (Act); F_Type : constant Entity_Id := Etype (First_Formal (Nam)); Orig : constant Node_Id := Original_Node (N); New_A : Node_Id; begin -- Check whether the call is a prefixed call, with or without -- additional actuals. if Nkind (Orig) = N_Selected_Component or else (Nkind (Orig) = N_Indexed_Component and then Nkind (Prefix (Orig)) = N_Selected_Component and then Is_Entity_Name (Prefix (Prefix (Orig))) and then Is_Entity_Name (Act) and then Chars (Act) = Chars (Prefix (Prefix (Orig)))) then if Is_Access_Type (A_Type) and then not Is_Access_Type (F_Type) then -- Introduce dereference on object in prefix New_A := Make_Explicit_Dereference (Sloc (Act), Prefix => Relocate_Node (Act)); Rewrite (Act, New_A); Analyze (Act); elsif Is_Access_Type (F_Type) and then not Is_Access_Type (A_Type) then -- Introduce an implicit 'Access in prefix if not Is_Aliased_View (Act) then Error_Msg_NE ("object in prefixed call to& must be aliased " & "(RM 4.1.3 (13 1/2))", Prefix (Act), Nam); end if; Rewrite (Act, Make_Attribute_Reference (Loc, Attribute_Name => Name_Access, Prefix => Relocate_Node (Act))); end if; Analyze (Act); end if; end Check_Prefixed_Call; --------------------------------------- -- Flag_Effectively_Volatile_Objects -- --------------------------------------- procedure Flag_Effectively_Volatile_Objects (Expr : Node_Id) is function Flag_Object (N : Node_Id) return Traverse_Result; -- Determine whether arbitrary node N denotes an effectively volatile -- object for reading and if it does, emit an error. ----------------- -- Flag_Object -- ----------------- function Flag_Object (N : Node_Id) return Traverse_Result is Id : Entity_Id; begin -- Do not consider nested function calls because they have already -- been processed during their own resolution. if Nkind (N) = N_Function_Call then return Skip; elsif Is_Entity_Name (N) and then Present (Entity (N)) then Id := Entity (N); if Is_Object (Id) and then Is_Effectively_Volatile_For_Reading (Id) then Error_Msg_N ("volatile object cannot appear in this context (SPARK " & "RM 7.1.3(10))", N); return Skip; end if; end if; return OK; end Flag_Object; procedure Flag_Objects is new Traverse_Proc (Flag_Object); -- Start of processing for Flag_Effectively_Volatile_Objects begin Flag_Objects (Expr); end Flag_Effectively_Volatile_Objects; -------------------- -- Insert_Default -- -------------------- procedure Insert_Default is Actval : Node_Id; Assoc : Node_Id; begin -- Missing argument in call, nothing to insert if No (Default_Value (F)) then return; else -- Note that we do a full New_Copy_Tree, so that any associated -- Itypes are properly copied. This may not be needed any more, -- but it does no harm as a safety measure. Defaults of a generic -- formal may be out of bounds of the corresponding actual (see -- cc1311b) and an additional check may be required. Actval := New_Copy_Tree (Default_Value (F), New_Scope => Current_Scope, New_Sloc => Loc); -- Propagate dimension information, if any. Copy_Dimensions (Default_Value (F), Actval); if Is_Concurrent_Type (Scope (Nam)) and then Has_Discriminants (Scope (Nam)) then Replace_Actual_Discriminants (N, Actval); end if; if Is_Overloadable (Nam) and then Present (Alias (Nam)) then if Base_Type (Etype (F)) /= Base_Type (Etype (Actval)) and then not Is_Tagged_Type (Etype (F)) then -- If default is a real literal, do not introduce a -- conversion whose effect may depend on the run-time -- size of universal real. if Nkind (Actval) = N_Real_Literal then Set_Etype (Actval, Base_Type (Etype (F))); else Actval := Unchecked_Convert_To (Etype (F), Actval); end if; end if; if Is_Scalar_Type (Etype (F)) then Enable_Range_Check (Actval); end if; Set_Parent (Actval, N); -- Resolve aggregates with their base type, to avoid scope -- anomalies: the subtype was first built in the subprogram -- declaration, and the current call may be nested. if Nkind (Actval) = N_Aggregate then Analyze_And_Resolve (Actval, Etype (F)); else Analyze_And_Resolve (Actval, Etype (Actval)); end if; else Set_Parent (Actval, N); -- See note above concerning aggregates if Nkind (Actval) = N_Aggregate and then Has_Discriminants (Etype (Actval)) then Analyze_And_Resolve (Actval, Base_Type (Etype (Actval))); -- Resolve entities with their own type, which may differ from -- the type of a reference in a generic context (the view -- swapping mechanism did not anticipate the re-analysis of -- default values in calls). elsif Is_Entity_Name (Actval) then Analyze_And_Resolve (Actval, Etype (Entity (Actval))); else Analyze_And_Resolve (Actval, Etype (Actval)); end if; end if; -- If default is a tag indeterminate function call, propagate tag -- to obtain proper dispatching. if Is_Controlling_Formal (F) and then Nkind (Default_Value (F)) = N_Function_Call then Set_Is_Controlling_Actual (Actval); end if; end if; -- If the default expression raises constraint error, then just -- silently replace it with an N_Raise_Constraint_Error node, since -- we already gave the warning on the subprogram spec. If node is -- already a Raise_Constraint_Error leave as is, to prevent loops in -- the warnings removal machinery. if Raises_Constraint_Error (Actval) and then Nkind (Actval) /= N_Raise_Constraint_Error then Rewrite (Actval, Make_Raise_Constraint_Error (Loc, Reason => CE_Range_Check_Failed)); Set_Raises_Constraint_Error (Actval); Set_Etype (Actval, Etype (F)); end if; Assoc := Make_Parameter_Association (Loc, Explicit_Actual_Parameter => Actval, Selector_Name => Make_Identifier (Loc, Chars (F))); -- Case of insertion is first named actual if No (Prev) or else Nkind (Parent (Prev)) /= N_Parameter_Association then Set_Next_Named_Actual (Assoc, First_Named_Actual (N)); Set_First_Named_Actual (N, Actval); if No (Prev) then if No (Parameter_Associations (N)) then Set_Parameter_Associations (N, New_List (Assoc)); else Append (Assoc, Parameter_Associations (N)); end if; else Insert_After (Prev, Assoc); end if; -- Case of insertion is not first named actual else Set_Next_Named_Actual (Assoc, Next_Named_Actual (Parent (Prev))); Set_Next_Named_Actual (Parent (Prev), Actval); Append (Assoc, Parameter_Associations (N)); end if; Mark_Rewrite_Insertion (Assoc); Mark_Rewrite_Insertion (Actval); Prev := Actval; end Insert_Default; ------------------- -- Same_Ancestor -- ------------------- function Same_Ancestor (T1, T2 : Entity_Id) return Boolean is FT1 : Entity_Id := T1; FT2 : Entity_Id := T2; begin if Is_Private_Type (T1) and then Present (Full_View (T1)) then FT1 := Full_View (T1); end if; if Is_Private_Type (T2) and then Present (Full_View (T2)) then FT2 := Full_View (T2); end if; return Root_Type (Base_Type (FT1)) = Root_Type (Base_Type (FT2)); end Same_Ancestor; -------------------------- -- Static_Concatenation -- -------------------------- function Static_Concatenation (N : Node_Id) return Boolean is begin case Nkind (N) is when N_String_Literal => return True; when N_Op_Concat => -- Concatenation is static when both operands are static and -- the concatenation operator is a predefined one. return Scope (Entity (N)) = Standard_Standard and then Static_Concatenation (Left_Opnd (N)) and then Static_Concatenation (Right_Opnd (N)); when others => if Is_Entity_Name (N) then declare Ent : constant Entity_Id := Entity (N); begin return Ekind (Ent) = E_Constant and then Present (Constant_Value (Ent)) and then Is_OK_Static_Expression (Constant_Value (Ent)); end; else return False; end if; end case; end Static_Concatenation; -- Start of processing for Resolve_Actuals begin Check_Argument_Order; if Is_Overloadable (Nam) and then Is_Inherited_Operation (Nam) and then In_Instance and then Present (Alias (Nam)) and then Present (Overridden_Operation (Alias (Nam))) then Real_Subp := Alias (Nam); else Real_Subp := Empty; end if; if Present (First_Actual (N)) then Check_Prefixed_Call; end if; A := First_Actual (N); F := First_Formal (Nam); if Present (Real_Subp) then Real_F := First_Formal (Real_Subp); end if; while Present (F) loop if No (A) and then Needs_No_Actuals (Nam) then null; -- If we have an error in any actual or formal, indicated by a type -- of Any_Type, then abandon resolution attempt, and set result type -- to Any_Type. Skip this if the actual is a Raise_Expression, whose -- type is imposed from context. elsif (Present (A) and then Etype (A) = Any_Type) or else Etype (F) = Any_Type then if Nkind (A) /= N_Raise_Expression then Set_Etype (N, Any_Type); return; end if; end if; -- Case where actual is present -- If the actual is an entity, generate a reference to it now. We -- do this before the actual is resolved, because a formal of some -- protected subprogram, or a task discriminant, will be rewritten -- during expansion, and the source entity reference may be lost. if Present (A) and then Is_Entity_Name (A) and then Comes_From_Source (A) then -- Annotate the tree by creating a variable reference marker when -- the actual denotes a variable reference, in case the reference -- is folded or optimized away. The variable reference marker is -- automatically saved for later examination by the ABE Processing -- phase. The status of the reference is set as follows: -- status mode -- read IN, IN OUT -- write IN OUT, OUT if Needs_Variable_Reference_Marker (N => A, Calls_OK => True) then Build_Variable_Reference_Marker (N => A, Read => Ekind (F) /= E_Out_Parameter, Write => Ekind (F) /= E_In_Parameter); end if; Orig_A := Entity (A); if Present (Orig_A) then if Is_Formal (Orig_A) and then Ekind (F) /= E_In_Parameter then Generate_Reference (Orig_A, A, 'm'); elsif not Is_Overloaded (A) then if Ekind (F) /= E_Out_Parameter then Generate_Reference (Orig_A, A); -- RM 6.4.1(12): For an out parameter that is passed by -- copy, the formal parameter object is created, and: -- * For an access type, the formal parameter is initialized -- from the value of the actual, without checking that the -- value satisfies any constraint, any predicate, or any -- exclusion of the null value. -- * For a scalar type that has the Default_Value aspect -- specified, the formal parameter is initialized from the -- value of the actual, without checking that the value -- satisfies any constraint or any predicate. -- I do not understand why this case is included??? this is -- not a case where an OUT parameter is treated as IN OUT. -- * For a composite type with discriminants or that has -- implicit initial values for any subcomponents, the -- behavior is as for an in out parameter passed by copy. -- Hence for these cases we generate the read reference now -- (the write reference will be generated later by -- Note_Possible_Modification). elsif Is_By_Copy_Type (Etype (F)) and then (Is_Access_Type (Etype (F)) or else (Is_Scalar_Type (Etype (F)) and then Present (Default_Aspect_Value (Etype (F)))) or else (Is_Composite_Type (Etype (F)) and then (Has_Discriminants (Etype (F)) or else Is_Partially_Initialized_Type (Etype (F))))) then Generate_Reference (Orig_A, A); end if; end if; end if; end if; if Present (A) and then (Nkind (Parent (A)) /= N_Parameter_Association or else Chars (Selector_Name (Parent (A))) = Chars (F)) then -- If style checking mode on, check match of formal name if Style_Check then if Nkind (Parent (A)) = N_Parameter_Association then Check_Identifier (Selector_Name (Parent (A)), F); end if; end if; -- If the formal is Out or In_Out, do not resolve and expand the -- conversion, because it is subsequently expanded into explicit -- temporaries and assignments. However, the object of the -- conversion can be resolved. An exception is the case of tagged -- type conversion with a class-wide actual. In that case we want -- the tag check to occur and no temporary will be needed (no -- representation change can occur) and the parameter is passed by -- reference, so we go ahead and resolve the type conversion. -- Another exception is the case of reference to component or -- subcomponent of a bit-packed array, in which case we want to -- defer expansion to the point the in and out assignments are -- performed. if Ekind (F) /= E_In_Parameter and then Nkind (A) = N_Type_Conversion and then not Is_Class_Wide_Type (Etype (Expression (A))) and then not Is_Interface (Etype (A)) then declare Expr_Typ : constant Entity_Id := Etype (Expression (A)); begin -- Check RM 4.6 (24.2/2) if Is_Array_Type (Etype (F)) and then Is_View_Conversion (A) then -- In a view conversion, the conversion must be legal in -- both directions, and thus both component types must be -- aliased, or neither (4.6 (8)). -- Check RM 4.6 (24.8/2) if Has_Aliased_Components (Expr_Typ) /= Has_Aliased_Components (Etype (F)) then -- This normally illegal conversion is legal in an -- expanded instance body because of RM 12.3(11). -- At runtime, conversion must create a new object. if not In_Instance then Error_Msg_N ("both component types in a view conversion must" & " be aliased, or neither", A); end if; -- Check RM 4.6 (24/3) elsif not Same_Ancestor (Etype (F), Expr_Typ) then -- Check view conv between unrelated by ref array -- types. if Is_By_Reference_Type (Etype (F)) or else Is_By_Reference_Type (Expr_Typ) then Error_Msg_N ("view conversion between unrelated by reference " & "array types not allowed ('A'I-00246)", A); -- In Ada 2005 mode, check view conversion component -- type cannot be private, tagged, or volatile. Note -- that we only apply this to source conversions. The -- generated code can contain conversions which are -- not subject to this test, and we cannot extract the -- component type in such cases since it is not -- present. elsif Comes_From_Source (A) and then Ada_Version >= Ada_2005 then declare Comp_Type : constant Entity_Id := Component_Type (Expr_Typ); begin if (Is_Private_Type (Comp_Type) and then not Is_Generic_Type (Comp_Type)) or else Is_Tagged_Type (Comp_Type) or else Is_Volatile (Comp_Type) then Error_Msg_N ("component type of a view conversion " & "cannot be private, tagged, or volatile" & " (RM 4.6 (24))", Expression (A)); end if; end; end if; end if; -- AI12-0074 & AI12-0377 -- Check 6.4.1: If the mode is out, the actual parameter is -- a view conversion, and the type of the formal parameter -- is a scalar type, then either: -- - the target and operand type both do not have the -- Default_Value aspect specified; or -- - the target and operand type both have the -- Default_Value aspect specified, and there shall exist -- a type (other than a root numeric type) that is an -- ancestor of both the target type and the operand -- type. elsif Ekind (F) = E_Out_Parameter and then Is_Scalar_Type (Etype (F)) then if Has_Default_Aspect (Etype (F)) /= Has_Default_Aspect (Expr_Typ) then Error_Msg_N ("view conversion requires Default_Value on both " & "types (RM 6.4.1)", A); elsif Has_Default_Aspect (Expr_Typ) and then not Same_Ancestor (Etype (F), Expr_Typ) then Error_Msg_N ("view conversion between unrelated types with " & "Default_Value not allowed (RM 6.4.1)", A); end if; end if; end; -- Resolve expression if conversion is all OK if (Conversion_OK (A) or else Valid_Conversion (A, Etype (A), Expression (A))) and then not Is_Ref_To_Bit_Packed_Array (Expression (A)) then Resolve (Expression (A)); end if; -- If the actual is a function call that returns a limited -- unconstrained object that needs finalization, create a -- transient scope for it, so that it can receive the proper -- finalization list. elsif Expander_Active and then Nkind (A) = N_Function_Call and then Is_Limited_Record (Etype (F)) and then not Is_Constrained (Etype (F)) and then (Needs_Finalization (Etype (F)) or else Has_Task (Etype (F))) then Establish_Transient_Scope (A, Manage_Sec_Stack => False); Resolve (A, Etype (F)); -- A small optimization: if one of the actuals is a concatenation -- create a block around a procedure call to recover stack space. -- This alleviates stack usage when several procedure calls in -- the same statement list use concatenation. We do not perform -- this wrapping for code statements, where the argument is a -- static string, and we want to preserve warnings involving -- sequences of such statements. elsif Expander_Active and then Nkind (A) = N_Op_Concat and then Nkind (N) = N_Procedure_Call_Statement and then not (Is_Intrinsic_Subprogram (Nam) and then Chars (Nam) = Name_Asm) and then not Static_Concatenation (A) then Establish_Transient_Scope (A, Manage_Sec_Stack => False); Resolve (A, Etype (F)); else if Nkind (A) = N_Type_Conversion and then Is_Array_Type (Etype (F)) and then not Same_Ancestor (Etype (F), Etype (Expression (A))) and then (Is_Limited_Type (Etype (F)) or else Is_Limited_Type (Etype (Expression (A)))) then Error_Msg_N ("conversion between unrelated limited array types not " & "allowed ('A'I-00246)", A); if Is_Limited_Type (Etype (F)) then Explain_Limited_Type (Etype (F), A); end if; if Is_Limited_Type (Etype (Expression (A))) then Explain_Limited_Type (Etype (Expression (A)), A); end if; end if; -- (Ada 2005: AI-251): If the actual is an allocator whose -- directly designated type is a class-wide interface, we build -- an anonymous access type to use it as the type of the -- allocator. Later, when the subprogram call is expanded, if -- the interface has a secondary dispatch table the expander -- will add a type conversion to force the correct displacement -- of the pointer. if Nkind (A) = N_Allocator then declare DDT : constant Entity_Id := Directly_Designated_Type (Base_Type (Etype (F))); begin -- Displace the pointer to the object to reference its -- secondary dispatch table. if Is_Class_Wide_Type (DDT) and then Is_Interface (DDT) then Rewrite (A, Convert_To (Etype (F), Relocate_Node (A))); Analyze_And_Resolve (A, Etype (F), Suppress => Access_Check); end if; -- Ada 2005, AI-162:If the actual is an allocator, the -- innermost enclosing statement is the master of the -- created object. This needs to be done with expansion -- enabled only, otherwise the transient scope will not -- be removed in the expansion of the wrapped construct. if Expander_Active and then (Needs_Finalization (DDT) or else Has_Task (DDT)) then Establish_Transient_Scope (A, Manage_Sec_Stack => False); end if; end; if Ekind (Etype (F)) = E_Anonymous_Access_Type then Check_Restriction (No_Access_Parameter_Allocators, A); end if; end if; -- (Ada 2005): The call may be to a primitive operation of a -- tagged synchronized type, declared outside of the type. In -- this case the controlling actual must be converted to its -- corresponding record type, which is the formal type. The -- actual may be a subtype, either because of a constraint or -- because it is a generic actual, so use base type to locate -- concurrent type. F_Typ := Base_Type (Etype (F)); if Is_Tagged_Type (F_Typ) and then (Is_Concurrent_Type (F_Typ) or else Is_Concurrent_Record_Type (F_Typ)) then -- If the actual is overloaded, look for an interpretation -- that has a synchronized type. if not Is_Overloaded (A) then A_Typ := Base_Type (Etype (A)); else declare Index : Interp_Index; It : Interp; begin Get_First_Interp (A, Index, It); while Present (It.Typ) loop if Is_Concurrent_Type (It.Typ) or else Is_Concurrent_Record_Type (It.Typ) then A_Typ := Base_Type (It.Typ); exit; end if; Get_Next_Interp (Index, It); end loop; end; end if; declare Full_A_Typ : Entity_Id; begin if Present (Full_View (A_Typ)) then Full_A_Typ := Base_Type (Full_View (A_Typ)); else Full_A_Typ := A_Typ; end if; -- Tagged synchronized type (case 1): the actual is a -- concurrent type. if Is_Concurrent_Type (A_Typ) and then Corresponding_Record_Type (A_Typ) = F_Typ then Rewrite (A, Unchecked_Convert_To (Corresponding_Record_Type (A_Typ), A)); Resolve (A, Etype (F)); -- Tagged synchronized type (case 2): the formal is a -- concurrent type. elsif Ekind (Full_A_Typ) = E_Record_Type and then Present (Corresponding_Concurrent_Type (Full_A_Typ)) and then Is_Concurrent_Type (F_Typ) and then Present (Corresponding_Record_Type (F_Typ)) and then Full_A_Typ = Corresponding_Record_Type (F_Typ) then Resolve (A, Corresponding_Record_Type (F_Typ)); -- Common case else Resolve (A, Etype (F)); end if; end; -- Not a synchronized operation else Resolve (A, Etype (F)); end if; end if; A_Typ := Etype (A); F_Typ := Etype (F); -- An actual cannot be an untagged formal incomplete type if Ekind (A_Typ) = E_Incomplete_Type and then not Is_Tagged_Type (A_Typ) and then Is_Generic_Type (A_Typ) then Error_Msg_N ("invalid use of untagged formal incomplete type", A); end if; -- has warnings suppressed, then we reset Never_Set_In_Source for -- the calling entity. The reason for this is to catch cases like -- GNAT.Spitbol.Patterns.Vstring_Var where the called subprogram -- uses trickery to modify an IN parameter. if Ekind (F) = E_In_Parameter and then Is_Entity_Name (A) and then Present (Entity (A)) and then Ekind (Entity (A)) = E_Variable and then Has_Warnings_Off (F_Typ) then Set_Never_Set_In_Source (Entity (A), False); end if; -- Perform error checks for IN and IN OUT parameters if Ekind (F) /= E_Out_Parameter then -- Check unset reference. For scalar parameters, it is clearly -- wrong to pass an uninitialized value as either an IN or -- IN-OUT parameter. For composites, it is also clearly an -- error to pass a completely uninitialized value as an IN -- parameter, but the case of IN OUT is trickier. We prefer -- not to give a warning here. For example, suppose there is -- a routine that sets some component of a record to False. -- It is perfectly reasonable to make this IN-OUT and allow -- either initialized or uninitialized records to be passed -- in this case. -- For partially initialized composite values, we also avoid -- warnings, since it is quite likely that we are passing a -- partially initialized value and only the initialized fields -- will in fact be read in the subprogram. if Is_Scalar_Type (A_Typ) or else (Ekind (F) = E_In_Parameter and then not Is_Partially_Initialized_Type (A_Typ)) then Check_Unset_Reference (A); end if; -- In Ada 83 we cannot pass an OUT parameter as an IN or IN OUT -- actual to a nested call, since this constitutes a reading of -- the parameter, which is not allowed. if Ada_Version = Ada_83 and then Is_Entity_Name (A) and then Ekind (Entity (A)) = E_Out_Parameter then Error_Msg_N ("(Ada 83) illegal reading of out parameter", A); end if; end if; -- In -gnatd.q mode, forget that a given array is constant when -- it is passed as an IN parameter to a foreign-convention -- subprogram. This is in case the subprogram evilly modifies the -- object. Of course, correct code would use IN OUT. if Debug_Flag_Dot_Q and then Ekind (F) = E_In_Parameter and then Has_Foreign_Convention (Nam) and then Is_Array_Type (F_Typ) and then Nkind (A) in N_Has_Entity and then Present (Entity (A)) then Set_Is_True_Constant (Entity (A), False); end if; -- Case of OUT or IN OUT parameter if Ekind (F) /= E_In_Parameter then -- For an Out parameter, check for useless assignment. Note -- that we can't set Last_Assignment this early, because we may -- kill current values in Resolve_Call, and that call would -- clobber the Last_Assignment field. -- Note: call Warn_On_Useless_Assignment before doing the check -- below for Is_OK_Variable_For_Out_Formal so that the setting -- of Referenced_As_LHS/Referenced_As_Out_Formal properly -- reflects the last assignment, not this one. if Ekind (F) = E_Out_Parameter then if Warn_On_Modified_As_Out_Parameter (F) and then Is_Entity_Name (A) and then Present (Entity (A)) and then Comes_From_Source (N) then Warn_On_Useless_Assignment (Entity (A), A); end if; end if; -- Validate the form of the actual. Note that the call to -- Is_OK_Variable_For_Out_Formal generates the required -- reference in this case. -- A call to an initialization procedure for an aggregate -- component may initialize a nested component of a constant -- designated object. In this context the object is variable. if not Is_OK_Variable_For_Out_Formal (A) and then not Is_Init_Proc (Nam) then Error_Msg_NE ("actual for& must be a variable", A, F); if Is_Subprogram (Current_Scope) then if Is_Invariant_Procedure (Current_Scope) or else Is_Partial_Invariant_Procedure (Current_Scope) then Error_Msg_N ("function used in invariant cannot modify its " & "argument", F); elsif Is_Predicate_Function (Current_Scope) then Error_Msg_N ("function used in predicate cannot modify its " & "argument", F); end if; end if; end if; -- What's the following about??? if Is_Entity_Name (A) then Kill_Checks (Entity (A)); else Kill_All_Checks; end if; end if; if A_Typ = Any_Type then Set_Etype (N, Any_Type); return; end if; -- Apply appropriate constraint/predicate checks for IN [OUT] case if Ekind (F) in E_In_Parameter | E_In_Out_Parameter then -- Apply predicate tests except in certain special cases. Note -- that it might be more consistent to apply these only when -- expansion is active (in Exp_Ch6.Expand_Actuals), as we do -- for the outbound predicate tests ??? In any case indicate -- the function being called, for better warnings if the call -- leads to an infinite recursion. if Predicate_Tests_On_Arguments (Nam) then Apply_Predicate_Check (A, F_Typ, Nam); end if; -- Apply required constraint checks if Is_Scalar_Type (A_Typ) then Apply_Scalar_Range_Check (A, F_Typ); elsif Is_Array_Type (A_Typ) then Apply_Length_Check (A, F_Typ); elsif Is_Record_Type (F_Typ) and then Has_Discriminants (F_Typ) and then Is_Constrained (F_Typ) and then (not Is_Derived_Type (F_Typ) or else Comes_From_Source (Nam)) then Apply_Discriminant_Check (A, F_Typ); -- For view conversions of a discriminated object, apply -- check to object itself, the conversion alreay has the -- proper type. if Nkind (A) = N_Type_Conversion and then Is_Constrained (Etype (Expression (A))) then Apply_Discriminant_Check (Expression (A), F_Typ); end if; elsif Is_Access_Type (F_Typ) and then Is_Array_Type (Designated_Type (F_Typ)) and then Is_Constrained (Designated_Type (F_Typ)) then Apply_Length_Check (A, F_Typ); elsif Is_Access_Type (F_Typ) and then Has_Discriminants (Designated_Type (F_Typ)) and then Is_Constrained (Designated_Type (F_Typ)) then Apply_Discriminant_Check (A, F_Typ); else Apply_Range_Check (A, F_Typ); end if; -- Ada 2005 (AI-231): Note that the controlling parameter case -- already existed in Ada 95, which is partially checked -- elsewhere (see Checks), and we don't want the warning -- message to differ. if Is_Access_Type (F_Typ) and then Can_Never_Be_Null (F_Typ) and then Known_Null (A) then if Is_Controlling_Formal (F) then Apply_Compile_Time_Constraint_Error (N => A, Msg => "null value not allowed here??", Reason => CE_Access_Check_Failed); elsif Ada_Version >= Ada_2005 then Apply_Compile_Time_Constraint_Error (N => A, Msg => "(Ada 2005) null not allowed in " & "null-excluding formal??", Reason => CE_Null_Not_Allowed); end if; end if; end if; -- Checks for OUT parameters and IN OUT parameters if Ekind (F) in E_Out_Parameter | E_In_Out_Parameter then -- If there is a type conversion, make sure the return value -- meets the constraints of the variable before the conversion. if Nkind (A) = N_Type_Conversion then if Is_Scalar_Type (A_Typ) then -- Special case here tailored to Exp_Ch6.Is_Legal_Copy, -- which would prevent the check from being generated. -- This is for Starlet only though, so long obsolete. if Mechanism (F) = By_Reference and then Ekind (Nam) = E_Procedure and then Is_Valued_Procedure (Nam) then null; else Apply_Scalar_Range_Check (Expression (A), Etype (Expression (A)), A_Typ); end if; -- In addition the return value must meet the constraints -- of the object type (see the comment below). Apply_Scalar_Range_Check (A, A_Typ, F_Typ); else Apply_Range_Check (Expression (A), Etype (Expression (A)), A_Typ); end if; -- If no conversion, apply scalar range checks and length check -- based on the subtype of the actual (NOT that of the formal). -- This indicates that the check takes place on return from the -- call. During expansion the required constraint checks are -- inserted. In GNATprove mode, in the absence of expansion, -- the flag indicates that the returned value is valid. else if Is_Scalar_Type (F_Typ) then Apply_Scalar_Range_Check (A, A_Typ, F_Typ); elsif Is_Array_Type (F_Typ) and then Ekind (F) = E_Out_Parameter then Apply_Length_Check (A, F_Typ); else Apply_Range_Check (A, A_Typ, F_Typ); end if; end if; -- Note: we do not apply the predicate checks for the case of -- OUT and IN OUT parameters. They are instead applied in the -- Expand_Actuals routine in Exp_Ch6. end if; -- An actual associated with an access parameter is implicitly -- converted to the anonymous access type of the formal and must -- satisfy the legality checks for access conversions. if Ekind (F_Typ) = E_Anonymous_Access_Type then if not Valid_Conversion (A, F_Typ, A) then Error_Msg_N ("invalid implicit conversion for access parameter", A); end if; -- If the actual is an access selected component of a variable, -- the call may modify its designated object. It is reasonable -- to treat this as a potential modification of the enclosing -- record, to prevent spurious warnings that it should be -- declared as a constant, because intuitively programmers -- regard the designated subcomponent as part of the record. if Nkind (A) = N_Selected_Component and then Is_Entity_Name (Prefix (A)) and then not Is_Constant_Object (Entity (Prefix (A))) then Note_Possible_Modification (A, Sure => False); end if; end if; -- Check illegal cases of atomic/volatile actual (RM C.6(12,13)) if (Is_By_Reference_Type (Etype (F)) or else Is_Aliased (F)) and then Comes_From_Source (N) then if Is_Atomic_Object (A) and then not Is_Atomic (Etype (F)) then Error_Msg_NE ("cannot pass atomic object to nonatomic formal&", A, F); Error_Msg_N ("\which is passed by reference (RM C.6(12))", A); elsif Is_Volatile_Object (A) and then not Is_Volatile (Etype (F)) then Error_Msg_NE ("cannot pass volatile object to nonvolatile formal&", A, F); Error_Msg_N ("\which is passed by reference (RM C.6(12))", A); end if; if Ada_Version >= Ada_2020 and then Is_Subcomponent_Of_Atomic_Object (A) and then not Is_Atomic_Object (A) then Error_Msg_N ("cannot pass nonatomic subcomponent of atomic object", A); Error_Msg_NE ("\to formal & which is passed by reference (RM C.6(13))", A, F); end if; end if; -- Check that subprograms don't have improper controlling -- arguments (RM 3.9.2 (9)). -- A primitive operation may have an access parameter of an -- incomplete tagged type, but a dispatching call is illegal -- if the type is still incomplete. if Is_Controlling_Formal (F) then Set_Is_Controlling_Actual (A); if Ekind (Etype (F)) = E_Anonymous_Access_Type then declare Desig : constant Entity_Id := Designated_Type (Etype (F)); begin if Ekind (Desig) = E_Incomplete_Type and then No (Full_View (Desig)) and then No (Non_Limited_View (Desig)) then Error_Msg_NE ("premature use of incomplete type& " & "in dispatching call", A, Desig); end if; end; end if; elsif Nkind (A) = N_Explicit_Dereference then Validate_Remote_Access_To_Class_Wide_Type (A); end if; -- Apply legality rule 3.9.2 (9/1) if (Is_Class_Wide_Type (A_Typ) or else Is_Dynamically_Tagged (A)) and then not Is_Class_Wide_Type (F_Typ) and then not Is_Controlling_Formal (F) and then not In_Instance then Error_Msg_N ("class-wide argument not allowed here!", A); if Is_Subprogram (Nam) and then Comes_From_Source (Nam) then Error_Msg_Node_2 := F_Typ; Error_Msg_NE ("& is not a dispatching operation of &!", A, Nam); end if; -- Apply the checks described in 3.10.2(27): if the context is a -- specific access-to-object, the actual cannot be class-wide. -- Use base type to exclude access_to_subprogram cases. elsif Is_Access_Type (A_Typ) and then Is_Access_Type (F_Typ) and then not Is_Access_Subprogram_Type (Base_Type (F_Typ)) and then (Is_Class_Wide_Type (Designated_Type (A_Typ)) or else (Nkind (A) = N_Attribute_Reference and then Is_Class_Wide_Type (Etype (Prefix (A))))) and then not Is_Class_Wide_Type (Designated_Type (F_Typ)) and then not Is_Controlling_Formal (F) -- Disable these checks for call to imported C++ subprograms and then not (Is_Entity_Name (Name (N)) and then Is_Imported (Entity (Name (N))) and then Convention (Entity (Name (N))) = Convention_CPP) then Error_Msg_N ("access to class-wide argument not allowed here!", A); if Is_Subprogram (Nam) and then Comes_From_Source (Nam) then Error_Msg_Node_2 := Designated_Type (F_Typ); Error_Msg_NE ("& is not a dispatching operation of &!", A, Nam); end if; end if; Check_Aliased_Parameter; Eval_Actual (A); -- If it is a named association, treat the selector_name as a -- proper identifier, and mark the corresponding entity. if Nkind (Parent (A)) = N_Parameter_Association -- Ignore reference in SPARK mode, as it refers to an entity not -- in scope at the point of reference, so the reference should -- be ignored for computing effects of subprograms. and then not GNATprove_Mode then -- If subprogram is overridden, use name of formal that -- is being called. if Present (Real_Subp) then Set_Entity (Selector_Name (Parent (A)), Real_F); Set_Etype (Selector_Name (Parent (A)), Etype (Real_F)); else Set_Entity (Selector_Name (Parent (A)), F); Generate_Reference (F, Selector_Name (Parent (A))); Set_Etype (Selector_Name (Parent (A)), F_Typ); Generate_Reference (F_Typ, N, ' '); end if; end if; Prev := A; if Ekind (F) /= E_Out_Parameter then Check_Unset_Reference (A); end if; -- The following checks are only relevant when SPARK_Mode is on as -- they are not standard Ada legality rule. Internally generated -- temporaries are ignored. if SPARK_Mode = On and then Comes_From_Source (A) then -- An effectively volatile object for reading may act as an -- actual when the corresponding formal is of a non-scalar -- effectively volatile type for reading (SPARK RM 7.1.3(10)). if not Is_Scalar_Type (Etype (F)) and then Is_Effectively_Volatile_For_Reading (Etype (F)) then null; -- An effectively volatile object for reading may act as an -- actual in a call to an instance of Unchecked_Conversion. -- (SPARK RM 7.1.3(10)). elsif Is_Unchecked_Conversion_Instance (Nam) then null; -- The actual denotes an object elsif Is_Effectively_Volatile_Object_For_Reading (A) then Error_Msg_N ("volatile object cannot act as actual in a call (SPARK " & "RM 7.1.3(10))", A); -- Otherwise the actual denotes an expression. Inspect the -- expression and flag each effectively volatile object -- for reading as illegal because it apprears within an -- interfering context. Note that this is usually done in -- Resolve_Entity_Name, but when the effectively volatile -- object for reading appears as an actual in a call, the -- call must be resolved first. else Flag_Effectively_Volatile_Objects (A); end if; -- An effectively volatile variable cannot act as an actual -- parameter in a procedure call when the variable has enabled -- property Effective_Reads and the corresponding formal is of -- mode IN (SPARK RM 7.1.3(10)). if Ekind (Nam) = E_Procedure and then Ekind (F) = E_In_Parameter and then Is_Entity_Name (A) then A_Id := Entity (A); if Ekind (A_Id) = E_Variable and then Is_Effectively_Volatile_For_Reading (Etype (A_Id)) and then Effective_Reads_Enabled (A_Id) then Error_Msg_NE ("effectively volatile variable & cannot appear as " & "actual in procedure call", A, A_Id); Error_Msg_Name_1 := Name_Effective_Reads; Error_Msg_N ("\\variable has enabled property %", A); Error_Msg_N ("\\corresponding formal has mode IN", A); end if; end if; end if; -- A formal parameter of a specific tagged type whose related -- subprogram is subject to pragma Extensions_Visible with value -- "False" cannot act as an actual in a subprogram with value -- "True" (SPARK RM 6.1.7(3)). if Is_EVF_Expression (A) and then Extensions_Visible_Status (Nam) = Extensions_Visible_True then Error_Msg_N ("formal parameter cannot act as actual parameter when " & "Extensions_Visible is False", A); Error_Msg_NE ("\subprogram & has Extensions_Visible True", A, Nam); end if; -- The actual parameter of a Ghost subprogram whose formal is of -- mode IN OUT or OUT must be a Ghost variable (SPARK RM 6.9(12)). if Comes_From_Source (Nam) and then Is_Ghost_Entity (Nam) and then Ekind (F) in E_In_Out_Parameter | E_Out_Parameter and then Is_Entity_Name (A) and then Present (Entity (A)) and then not Is_Ghost_Entity (Entity (A)) then Error_Msg_NE ("non-ghost variable & cannot appear as actual in call to " & "ghost procedure", A, Entity (A)); if Ekind (F) = E_In_Out_Parameter then Error_Msg_N ("\corresponding formal has mode `IN OUT`", A); else Error_Msg_N ("\corresponding formal has mode OUT", A); end if; end if; Next_Actual (A); -- Case where actual is not present else Insert_Default; end if; Next_Formal (F); if Present (Real_Subp) then Next_Formal (Real_F); end if; end loop; end Resolve_Actuals; ----------------------- -- Resolve_Allocator -- ----------------------- procedure Resolve_Allocator (N : Node_Id; Typ : Entity_Id) is Desig_T : constant Entity_Id := Designated_Type (Typ); E : constant Node_Id := Expression (N); Subtyp : Entity_Id; Discrim : Entity_Id; Constr : Node_Id; Aggr : Node_Id; Assoc : Node_Id := Empty; Disc_Exp : Node_Id; procedure Check_Allocator_Discrim_Accessibility (Disc_Exp : Node_Id; Alloc_Typ : Entity_Id); -- Check that accessibility level associated with an access discriminant -- initialized in an allocator by the expression Disc_Exp is not deeper -- than the level of the allocator type Alloc_Typ. An error message is -- issued if this condition is violated. Specialized checks are done for -- the cases of a constraint expression which is an access attribute or -- an access discriminant. procedure Check_Allocator_Discrim_Accessibility_Exprs (Curr_Exp : Node_Id; Alloc_Typ : Entity_Id); -- Dispatch checks performed by Check_Allocator_Discrim_Accessibility -- across all expressions within a given conditional expression. function In_Dispatching_Context return Boolean; -- If the allocator is an actual in a call, it is allowed to be class- -- wide when the context is not because it is a controlling actual. ------------------------------------------- -- Check_Allocator_Discrim_Accessibility -- ------------------------------------------- procedure Check_Allocator_Discrim_Accessibility (Disc_Exp : Node_Id; Alloc_Typ : Entity_Id) is begin if Type_Access_Level (Etype (Disc_Exp)) > Deepest_Type_Access_Level (Alloc_Typ) then Error_Msg_N ("operand type has deeper level than allocator type", Disc_Exp); -- When the expression is an Access attribute the level of the prefix -- object must not be deeper than that of the allocator's type. elsif Nkind (Disc_Exp) = N_Attribute_Reference and then Get_Attribute_Id (Attribute_Name (Disc_Exp)) = Attribute_Access and then Object_Access_Level (Prefix (Disc_Exp)) > Deepest_Type_Access_Level (Alloc_Typ) then Error_Msg_N ("prefix of attribute has deeper level than allocator type", Disc_Exp); -- When the expression is an access discriminant the check is against -- the level of the prefix object. elsif Ekind (Etype (Disc_Exp)) = E_Anonymous_Access_Type and then Nkind (Disc_Exp) = N_Selected_Component and then Object_Access_Level (Prefix (Disc_Exp)) > Deepest_Type_Access_Level (Alloc_Typ) then Error_Msg_N ("access discriminant has deeper level than allocator type", Disc_Exp); -- All other cases are legal else null; end if; end Check_Allocator_Discrim_Accessibility; ------------------------------------------------- -- Check_Allocator_Discrim_Accessibility_Exprs -- ------------------------------------------------- procedure Check_Allocator_Discrim_Accessibility_Exprs (Curr_Exp : Node_Id; Alloc_Typ : Entity_Id) is Alt : Node_Id; Expr : Node_Id; Disc_Exp : constant Node_Id := Original_Node (Curr_Exp); begin -- When conditional expressions are constant folded we know at -- compile time which expression to check - so don't bother with -- the rest of the cases. if Nkind (Curr_Exp) = N_Attribute_Reference then Check_Allocator_Discrim_Accessibility (Curr_Exp, Alloc_Typ); -- Non-constant-folded if expressions elsif Nkind (Disc_Exp) = N_If_Expression then -- Check both expressions if they are still present in the face -- of expansion. Expr := Next (First (Expressions (Disc_Exp))); if Present (Expr) then Check_Allocator_Discrim_Accessibility_Exprs (Expr, Alloc_Typ); Next (Expr); if Present (Expr) then Check_Allocator_Discrim_Accessibility_Exprs (Expr, Alloc_Typ); end if; end if; -- Non-constant-folded case expressions elsif Nkind (Disc_Exp) = N_Case_Expression then -- Check all alternatives Alt := First (Alternatives (Disc_Exp)); while Present (Alt) loop Check_Allocator_Discrim_Accessibility_Exprs (Expression (Alt), Alloc_Typ); Next (Alt); end loop; -- Base case, check the accessibility of the original node of the -- expression. else Check_Allocator_Discrim_Accessibility (Disc_Exp, Alloc_Typ); end if; end Check_Allocator_Discrim_Accessibility_Exprs; ---------------------------- -- In_Dispatching_Context -- ---------------------------- function In_Dispatching_Context return Boolean is Par : constant Node_Id := Parent (N); begin return Nkind (Par) in N_Subprogram_Call and then Is_Entity_Name (Name (Par)) and then Is_Dispatching_Operation (Entity (Name (Par))); end In_Dispatching_Context; -- Start of processing for Resolve_Allocator begin -- Replace general access with specific type if Ekind (Etype (N)) = E_Allocator_Type then Set_Etype (N, Base_Type (Typ)); end if; if Is_Abstract_Type (Typ) then Error_Msg_N ("type of allocator cannot be abstract", N); end if; -- For qualified expression, resolve the expression using the given -- subtype (nothing to do for type mark, subtype indication) if Nkind (E) = N_Qualified_Expression then if Is_Class_Wide_Type (Etype (E)) and then not Is_Class_Wide_Type (Desig_T) and then not In_Dispatching_Context then Error_Msg_N ("class-wide allocator not allowed for this access type", N); end if; -- Do a full resolution to apply constraint and predicate checks Resolve_Qualified_Expression (E, Etype (E)); Check_Unset_Reference (Expression (E)); -- Allocators generated by the build-in-place expansion mechanism -- are explicitly marked as coming from source but do not need to be -- checked for limited initialization. To exclude this case, ensure -- that the parent of the allocator is a source node. -- The return statement constructed for an Expression_Function does -- not come from source but requires a limited check. if Is_Limited_Type (Etype (E)) and then Comes_From_Source (N) and then (Comes_From_Source (Parent (N)) or else (Ekind (Current_Scope) = E_Function and then Nkind (Original_Node (Unit_Declaration_Node (Current_Scope))) = N_Expression_Function)) and then not In_Instance_Body then if not OK_For_Limited_Init (Etype (E), Expression (E)) then if Nkind (Parent (N)) = N_Assignment_Statement then Error_Msg_N ("illegal expression for initialized allocator of a " & "limited type (RM 7.5 (2.7/2))", N); else Error_Msg_N ("initialization not allowed for limited types", N); end if; Explain_Limited_Type (Etype (E), N); end if; end if; -- Calls to build-in-place functions are not currently supported in -- allocators for access types associated with a simple storage pool. -- Supporting such allocators may require passing additional implicit -- parameters to build-in-place functions (or a significant revision -- of the current b-i-p implementation to unify the handling for -- multiple kinds of storage pools). ??? if Is_Limited_View (Desig_T) and then Nkind (Expression (E)) = N_Function_Call then declare Pool : constant Entity_Id := Associated_Storage_Pool (Root_Type (Typ)); begin if Present (Pool) and then Present (Get_Rep_Pragma (Etype (Pool), Name_Simple_Storage_Pool_Type)) then Error_Msg_N ("limited function calls not yet supported in simple " & "storage pool allocators", Expression (E)); end if; end; end if; -- A special accessibility check is needed for allocators that -- constrain access discriminants. The level of the type of the -- expression used to constrain an access discriminant cannot be -- deeper than the type of the allocator (in contrast to access -- parameters, where the level of the actual can be arbitrary). -- We can't use Valid_Conversion to perform this check because in -- general the type of the allocator is unrelated to the type of -- the access discriminant. if Ekind (Typ) /= E_Anonymous_Access_Type or else Is_Local_Anonymous_Access (Typ) then Subtyp := Entity (Subtype_Mark (E)); Aggr := Original_Node (Expression (E)); if Has_Discriminants (Subtyp) and then Nkind (Aggr) in N_Aggregate | N_Extension_Aggregate then Discrim := First_Discriminant (Base_Type (Subtyp)); -- Get the first component expression of the aggregate if Present (Expressions (Aggr)) then Disc_Exp := First (Expressions (Aggr)); elsif Present (Component_Associations (Aggr)) then Assoc := First (Component_Associations (Aggr)); if Present (Assoc) then Disc_Exp := Expression (Assoc); else Disc_Exp := Empty; end if; else Disc_Exp := Empty; end if; while Present (Discrim) and then Present (Disc_Exp) loop if Ekind (Etype (Discrim)) = E_Anonymous_Access_Type then Check_Allocator_Discrim_Accessibility_Exprs (Disc_Exp, Typ); end if; Next_Discriminant (Discrim); if Present (Discrim) then if Present (Assoc) then Next (Assoc); Disc_Exp := Expression (Assoc); elsif Present (Next (Disc_Exp)) then Next (Disc_Exp); else Assoc := First (Component_Associations (Aggr)); if Present (Assoc) then Disc_Exp := Expression (Assoc); else Disc_Exp := Empty; end if; end if; end if; end loop; end if; end if; -- For a subtype mark or subtype indication, freeze the subtype else Freeze_Expression (E); if Is_Access_Constant (Typ) and then not No_Initialization (N) then Error_Msg_N ("initialization required for access-to-constant allocator", N); end if; -- A special accessibility check is needed for allocators that -- constrain access discriminants. The level of the type of the -- expression used to constrain an access discriminant cannot be -- deeper than the type of the allocator (in contrast to access -- parameters, where the level of the actual can be arbitrary). -- We can't use Valid_Conversion to perform this check because -- in general the type of the allocator is unrelated to the type -- of the access discriminant. if Nkind (Original_Node (E)) = N_Subtype_Indication and then (Ekind (Typ) /= E_Anonymous_Access_Type or else Is_Local_Anonymous_Access (Typ)) then Subtyp := Entity (Subtype_Mark (Original_Node (E))); if Has_Discriminants (Subtyp) then Discrim := First_Discriminant (Base_Type (Subtyp)); Constr := First (Constraints (Constraint (Original_Node (E)))); while Present (Discrim) and then Present (Constr) loop if Ekind (Etype (Discrim)) = E_Anonymous_Access_Type then if Nkind (Constr) = N_Discriminant_Association then Disc_Exp := Expression (Constr); else Disc_Exp := Constr; end if; Check_Allocator_Discrim_Accessibility_Exprs (Disc_Exp, Typ); end if; Next_Discriminant (Discrim); Next (Constr); end loop; end if; end if; end if; -- Ada 2005 (AI-344): A class-wide allocator requires an accessibility -- check that the level of the type of the created object is not deeper -- than the level of the allocator's access type, since extensions can -- now occur at deeper levels than their ancestor types. This is a -- static accessibility level check; a run-time check is also needed in -- the case of an initialized allocator with a class-wide argument (see -- Expand_Allocator_Expression). if Ada_Version >= Ada_2005 and then Is_Class_Wide_Type (Desig_T) then declare Exp_Typ : Entity_Id; begin if Nkind (E) = N_Qualified_Expression then Exp_Typ := Etype (E); elsif Nkind (E) = N_Subtype_Indication then Exp_Typ := Entity (Subtype_Mark (Original_Node (E))); else Exp_Typ := Entity (E); end if; if Type_Access_Level (Exp_Typ) > Deepest_Type_Access_Level (Typ) then if In_Instance_Body then Error_Msg_Warn := SPARK_Mode /= On; Error_Msg_N ("type in allocator has deeper level than designated " & "class-wide type<<", E); Error_Msg_N ("\Program_Error [<<", E); Rewrite (N, Make_Raise_Program_Error (Sloc (N), Reason => PE_Accessibility_Check_Failed)); Set_Etype (N, Typ); -- Do not apply Ada 2005 accessibility checks on a class-wide -- allocator if the type given in the allocator is a formal -- type. A run-time check will be performed in the instance. elsif not Is_Generic_Type (Exp_Typ) then Error_Msg_N ("type in allocator has deeper level than designated " & "class-wide type", E); end if; end if; end; end if; -- Check for allocation from an empty storage pool. But do not complain -- if it's a return statement for a build-in-place function, because the -- allocator is there just in case the caller uses an allocator. If the -- caller does use an allocator, it will be caught at the call site. if No_Pool_Assigned (Typ) and then not Alloc_For_BIP_Return (N) then Error_Msg_N ("allocation from empty storage pool!", N); -- If the context is an unchecked conversion, as may happen within an -- inlined subprogram, the allocator is being resolved with its own -- anonymous type. In that case, if the target type has a specific -- storage pool, it must be inherited explicitly by the allocator type. elsif Nkind (Parent (N)) = N_Unchecked_Type_Conversion and then No (Associated_Storage_Pool (Typ)) then Set_Associated_Storage_Pool (Typ, Associated_Storage_Pool (Etype (Parent (N)))); end if; if Ekind (Etype (N)) = E_Anonymous_Access_Type then Check_Restriction (No_Anonymous_Allocators, N); end if; -- Check that an allocator with task parts isn't for a nested access -- type when restriction No_Task_Hierarchy applies. if not Is_Library_Level_Entity (Base_Type (Typ)) and then Has_Task (Base_Type (Desig_T)) then Check_Restriction (No_Task_Hierarchy, N); end if; -- An illegal allocator may be rewritten as a raise Program_Error -- statement. if Nkind (N) = N_Allocator then -- Avoid coextension processing for an allocator that is the -- expansion of a build-in-place function call. if Nkind (Original_Node (N)) = N_Allocator and then Nkind (Expression (Original_Node (N))) = N_Qualified_Expression and then Nkind (Expression (Expression (Original_Node (N)))) = N_Function_Call and then Is_Expanded_Build_In_Place_Call (Expression (Expression (Original_Node (N)))) then null; -- b-i-p function call case else -- An anonymous access discriminant is the definition of a -- coextension. if Ekind (Typ) = E_Anonymous_Access_Type and then Nkind (Associated_Node_For_Itype (Typ)) = N_Discriminant_Specification then declare Discr : constant Entity_Id := Defining_Identifier (Associated_Node_For_Itype (Typ)); begin Check_Restriction (No_Coextensions, N); -- Ada 2012 AI05-0052: If the designated type of the -- allocator is limited, then the allocator shall not -- be used to define the value of an access discriminant -- unless the discriminated type is immutably limited. if Ada_Version >= Ada_2012 and then Is_Limited_Type (Desig_T) and then not Is_Limited_View (Scope (Discr)) then Error_Msg_N ("only immutably limited types can have anonymous " & "access discriminants designating a limited type", N); end if; end; -- Avoid marking an allocator as a dynamic coextension if it is -- within a static construct. if not Is_Static_Coextension (N) then Set_Is_Dynamic_Coextension (N); -- Finalization and deallocation of coextensions utilizes an -- approximate implementation which does not directly adhere -- to the semantic rules. Warn on potential issues involving -- coextensions. if Is_Controlled (Desig_T) then Error_Msg_N ("??coextension will not be finalized when its " & "associated owner is deallocated or finalized", N); else Error_Msg_N ("??coextension will not be deallocated when its " & "associated owner is deallocated", N); end if; end if; -- Cleanup for potential static coextensions else Set_Is_Dynamic_Coextension (N, False); Set_Is_Static_Coextension (N, False); -- Anonymous access-to-controlled objects are not finalized on -- time because this involves run-time ownership and currently -- this property is not available. In rare cases the object may -- not be finalized at all. Warn on potential issues involving -- anonymous access-to-controlled objects. if Ekind (Typ) = E_Anonymous_Access_Type and then Is_Controlled_Active (Desig_T) then Error_Msg_N ("??object designated by anonymous access object might " & "not be finalized until its enclosing library unit " & "goes out of scope", N); Error_Msg_N ("\use named access type instead", N); end if; end if; end if; end if; -- Report a simple error: if the designated object is a local task, -- its body has not been seen yet, and its activation will fail an -- elaboration check. if Is_Task_Type (Desig_T) and then Scope (Base_Type (Desig_T)) = Current_Scope and then Is_Compilation_Unit (Current_Scope) and then Ekind (Current_Scope) = E_Package and then not In_Package_Body (Current_Scope) then Error_Msg_Warn := SPARK_Mode /= On; Error_Msg_N ("cannot activate task before body seen<<", N); Error_Msg_N ("\Program_Error [<<", N); end if; -- Ada 2012 (AI05-0111-3): Detect an attempt to allocate a task or a -- type with a task component on a subpool. This action must raise -- Program_Error at runtime. if Ada_Version >= Ada_2012 and then Nkind (N) = N_Allocator and then Present (Subpool_Handle_Name (N)) and then Has_Task (Desig_T) then Error_Msg_Warn := SPARK_Mode /= On; Error_Msg_N ("cannot allocate task on subpool<<", N); Error_Msg_N ("\Program_Error [<<", N); Rewrite (N, Make_Raise_Program_Error (Sloc (N), Reason => PE_Explicit_Raise)); Set_Etype (N, Typ); end if; end Resolve_Allocator; --------------------------- -- Resolve_Arithmetic_Op -- --------------------------- -- Used for resolving all arithmetic operators except exponentiation procedure Resolve_Arithmetic_Op (N : Node_Id; Typ : Entity_Id) is L : constant Node_Id := Left_Opnd (N); R : constant Node_Id := Right_Opnd (N); TL : constant Entity_Id := Base_Type (Etype (L)); TR : constant Entity_Id := Base_Type (Etype (R)); T : Entity_Id; Rop : Node_Id; B_Typ : constant Entity_Id := Base_Type (Typ); -- We do the resolution using the base type, because intermediate values -- in expressions always are of the base type, not a subtype of it. function Expected_Type_Is_Any_Real (N : Node_Id) return Boolean; -- Returns True if N is in a context that expects "any real type" function Is_Integer_Or_Universal (N : Node_Id) return Boolean; -- Return True iff given type is Integer or universal real/integer procedure Set_Mixed_Mode_Operand (N : Node_Id; T : Entity_Id); -- Choose type of integer literal in fixed-point operation to conform -- to available fixed-point type. T is the type of the other operand, -- which is needed to determine the expected type of N. procedure Set_Operand_Type (N : Node_Id); -- Set operand type to T if universal ------------------------------- -- Expected_Type_Is_Any_Real -- ------------------------------- function Expected_Type_Is_Any_Real (N : Node_Id) return Boolean is begin -- N is the expression after "delta" in a fixed_point_definition; -- see RM-3.5.9(6): return Nkind (Parent (N)) in N_Ordinary_Fixed_Point_Definition | N_Decimal_Fixed_Point_Definition -- N is one of the bounds in a real_range_specification; -- see RM-3.5.7(5): | N_Real_Range_Specification -- N is the expression of a delta_constraint; -- see RM-J.3(3): | N_Delta_Constraint; end Expected_Type_Is_Any_Real; ----------------------------- -- Is_Integer_Or_Universal -- ----------------------------- function Is_Integer_Or_Universal (N : Node_Id) return Boolean is T : Entity_Id; Index : Interp_Index; It : Interp; begin if not Is_Overloaded (N) then T := Etype (N); return Base_Type (T) = Base_Type (Standard_Integer) or else T = Universal_Integer or else T = Universal_Real; else Get_First_Interp (N, Index, It); while Present (It.Typ) loop if Base_Type (It.Typ) = Base_Type (Standard_Integer) or else It.Typ = Universal_Integer or else It.Typ = Universal_Real then return True; end if; Get_Next_Interp (Index, It); end loop; end if; return False; end Is_Integer_Or_Universal; ---------------------------- -- Set_Mixed_Mode_Operand -- ---------------------------- procedure Set_Mixed_Mode_Operand (N : Node_Id; T : Entity_Id) is Index : Interp_Index; It : Interp; begin if Universal_Interpretation (N) = Universal_Integer then -- A universal integer literal is resolved as standard integer -- except in the case of a fixed-point result, where we leave it -- as universal (to be handled by Exp_Fixd later on) if Is_Fixed_Point_Type (T) then Resolve (N, Universal_Integer); else Resolve (N, Standard_Integer); end if; elsif Universal_Interpretation (N) = Universal_Real and then (T = Base_Type (Standard_Integer) or else T = Universal_Integer or else T = Universal_Real) then -- A universal real can appear in a fixed-type context. We resolve -- the literal with that context, even though this might raise an -- exception prematurely (the other operand may be zero). Resolve (N, B_Typ); elsif Etype (N) = Base_Type (Standard_Integer) and then T = Universal_Real and then Is_Overloaded (N) then -- Integer arg in mixed-mode operation. Resolve with universal -- type, in case preference rule must be applied. Resolve (N, Universal_Integer); elsif Etype (N) = T and then B_Typ /= Universal_Fixed then -- If the operand is part of a fixed multiplication operation, -- a conversion will be applied to each operand, so resolve it -- with its own type. if Nkind (Parent (N)) in N_Op_Divide | N_Op_Multiply then Resolve (N); else -- Not a mixed-mode operation, resolve with context Resolve (N, B_Typ); end if; elsif Etype (N) = Any_Fixed then -- N may itself be a mixed-mode operation, so use context type Resolve (N, B_Typ); elsif Is_Fixed_Point_Type (T) and then B_Typ = Universal_Fixed and then Is_Overloaded (N) then -- Must be (fixed * fixed) operation, operand must have one -- compatible interpretation. Resolve (N, Any_Fixed); elsif Is_Fixed_Point_Type (B_Typ) and then (T = Universal_Real or else Is_Fixed_Point_Type (T)) and then Is_Overloaded (N) then -- C * F(X) in a fixed context, where C is a real literal or a -- fixed-point expression. F must have either a fixed type -- interpretation or an integer interpretation, but not both. Get_First_Interp (N, Index, It); while Present (It.Typ) loop if Base_Type (It.Typ) = Base_Type (Standard_Integer) then if Analyzed (N) then Error_Msg_N ("ambiguous operand in fixed operation", N); else Resolve (N, Standard_Integer); end if; elsif Is_Fixed_Point_Type (It.Typ) then if Analyzed (N) then Error_Msg_N ("ambiguous operand in fixed operation", N); else Resolve (N, It.Typ); end if; end if; Get_Next_Interp (Index, It); end loop; -- Reanalyze the literal with the fixed type of the context. If -- context is Universal_Fixed, we are within a conversion, leave -- the literal as a universal real because there is no usable -- fixed type, and the target of the conversion plays no role in -- the resolution. declare Op2 : Node_Id; T2 : Entity_Id; begin if N = L then Op2 := R; else Op2 := L; end if; if B_Typ = Universal_Fixed and then Nkind (Op2) = N_Real_Literal then T2 := Universal_Real; else T2 := B_Typ; end if; Set_Analyzed (Op2, False); Resolve (Op2, T2); end; -- A universal real conditional expression can appear in a fixed-type -- context and must be resolved with that context to facilitate the -- code generation in the back end. However, If the context is -- Universal_fixed (i.e. as an operand of a multiplication/division -- involving a fixed-point operand) the conditional expression must -- resolve to a unique visible fixed_point type, normally Duration. elsif Nkind (N) in N_Case_Expression | N_If_Expression and then Etype (N) = Universal_Real and then Is_Fixed_Point_Type (B_Typ) then if B_Typ = Universal_Fixed then Resolve (N, Unique_Fixed_Point_Type (N)); else Resolve (N, B_Typ); end if; else Resolve (N); end if; end Set_Mixed_Mode_Operand; ---------------------- -- Set_Operand_Type -- ---------------------- procedure Set_Operand_Type (N : Node_Id) is begin if Etype (N) = Universal_Integer or else Etype (N) = Universal_Real then Set_Etype (N, T); end if; end Set_Operand_Type; -- Start of processing for Resolve_Arithmetic_Op begin if Comes_From_Source (N) and then Ekind (Entity (N)) = E_Function and then Is_Imported (Entity (N)) and then Is_Intrinsic_Subprogram (Entity (N)) then Resolve_Intrinsic_Operator (N, Typ); return; -- Special-case for mixed-mode universal expressions or fixed point type -- operation: each argument is resolved separately. The same treatment -- is required if one of the operands of a fixed point operation is -- universal real, since in this case we don't do a conversion to a -- specific fixed-point type (instead the expander handles the case). -- Set the type of the node to its universal interpretation because -- legality checks on an exponentiation operand need the context. elsif (B_Typ = Universal_Integer or else B_Typ = Universal_Real) and then Present (Universal_Interpretation (L)) and then Present (Universal_Interpretation (R)) then Set_Etype (N, B_Typ); Resolve (L, Universal_Interpretation (L)); Resolve (R, Universal_Interpretation (R)); elsif (B_Typ = Universal_Real or else Etype (N) = Universal_Fixed or else (Etype (N) = Any_Fixed and then Is_Fixed_Point_Type (B_Typ)) or else (Is_Fixed_Point_Type (B_Typ) and then (Is_Integer_Or_Universal (L) or else Is_Integer_Or_Universal (R)))) and then Nkind (N) in N_Op_Multiply | N_Op_Divide then if TL = Universal_Integer or else TR = Universal_Integer then Check_For_Visible_Operator (N, B_Typ); end if; -- If context is a fixed type and one operand is integer, the other -- is resolved with the type of the context. if Is_Fixed_Point_Type (B_Typ) and then (Base_Type (TL) = Base_Type (Standard_Integer) or else TL = Universal_Integer) then Resolve (R, B_Typ); Resolve (L, TL); elsif Is_Fixed_Point_Type (B_Typ) and then (Base_Type (TR) = Base_Type (Standard_Integer) or else TR = Universal_Integer) then Resolve (L, B_Typ); Resolve (R, TR); -- If both operands are universal and the context is a floating -- point type, the operands are resolved to the type of the context. elsif Is_Floating_Point_Type (B_Typ) then Resolve (L, B_Typ); Resolve (R, B_Typ); else Set_Mixed_Mode_Operand (L, TR); Set_Mixed_Mode_Operand (R, TL); end if; -- Check the rule in RM05-4.5.5(19.1/2) disallowing universal_fixed -- multiplying operators from being used when the expected type is -- also universal_fixed. Note that B_Typ will be Universal_Fixed in -- some cases where the expected type is actually Any_Real; -- Expected_Type_Is_Any_Real takes care of that case. if Etype (N) = Universal_Fixed or else Etype (N) = Any_Fixed then if B_Typ = Universal_Fixed and then not Expected_Type_Is_Any_Real (N) and then Nkind (Parent (N)) not in N_Type_Conversion | N_Unchecked_Type_Conversion then Error_Msg_N ("type cannot be determined from context!", N); Error_Msg_N ("\explicit conversion to result type required", N); Set_Etype (L, Any_Type); Set_Etype (R, Any_Type); else if Ada_Version = Ada_83 and then Etype (N) = Universal_Fixed and then Nkind (Parent (N)) not in N_Type_Conversion | N_Unchecked_Type_Conversion then Error_Msg_N ("(Ada 83) fixed-point operation needs explicit " & "conversion", N); end if; -- The expected type is "any real type" in contexts like -- type T is delta <universal_fixed-expression> ... -- in which case we need to set the type to Universal_Real -- so that static expression evaluation will work properly. if Expected_Type_Is_Any_Real (N) then Set_Etype (N, Universal_Real); else Set_Etype (N, B_Typ); end if; end if; elsif Is_Fixed_Point_Type (B_Typ) and then (Is_Integer_Or_Universal (L) or else Nkind (L) = N_Real_Literal or else Nkind (R) = N_Real_Literal or else Is_Integer_Or_Universal (R)) then Set_Etype (N, B_Typ); elsif Etype (N) = Any_Fixed then -- If no previous errors, this is only possible if one operand is -- overloaded and the context is universal. Resolve as such. Set_Etype (N, B_Typ); end if; else if (TL = Universal_Integer or else TL = Universal_Real) and then (TR = Universal_Integer or else TR = Universal_Real) then Check_For_Visible_Operator (N, B_Typ); end if; -- If the context is Universal_Fixed and the operands are also -- universal fixed, this is an error, unless there is only one -- applicable fixed_point type (usually Duration). if B_Typ = Universal_Fixed and then Etype (L) = Universal_Fixed then T := Unique_Fixed_Point_Type (N); if T = Any_Type then Set_Etype (N, T); return; else Resolve (L, T); Resolve (R, T); end if; else Resolve (L, B_Typ); Resolve (R, B_Typ); end if; -- If one of the arguments was resolved to a non-universal type. -- label the result of the operation itself with the same type. -- Do the same for the universal argument, if any. T := Intersect_Types (L, R); Set_Etype (N, Base_Type (T)); Set_Operand_Type (L); Set_Operand_Type (R); end if; Generate_Operator_Reference (N, Typ); Analyze_Dimension (N); Eval_Arithmetic_Op (N); -- Set overflow and division checking bit if Nkind (N) in N_Op then if not Overflow_Checks_Suppressed (Etype (N)) then Enable_Overflow_Check (N); end if; -- Give warning if explicit division by zero if Nkind (N) in N_Op_Divide | N_Op_Rem | N_Op_Mod and then not Division_Checks_Suppressed (Etype (N)) then Rop := Right_Opnd (N); if Compile_Time_Known_Value (Rop) and then ((Is_Integer_Type (Etype (Rop)) and then Expr_Value (Rop) = Uint_0) or else (Is_Real_Type (Etype (Rop)) and then Expr_Value_R (Rop) = Ureal_0)) then -- Specialize the warning message according to the operation. -- When SPARK_Mode is On, force a warning instead of an error -- in that case, as this likely corresponds to deactivated -- code. The following warnings are for the case case Nkind (N) is when N_Op_Divide => -- For division, we have two cases, for float division -- of an unconstrained float type, on a machine where -- Machine_Overflows is false, we don't get an exception -- at run-time, but rather an infinity or Nan. The Nan -- case is pretty obscure, so just warn about infinities. if Is_Floating_Point_Type (Typ) and then not Is_Constrained (Typ) and then not Machine_Overflows_On_Target then Error_Msg_N ("float division by zero, may generate " & "'+'/'- infinity??", Right_Opnd (N)); -- For all other cases, we get a Constraint_Error else Apply_Compile_Time_Constraint_Error (N, "division by zero??", CE_Divide_By_Zero, Loc => Sloc (Right_Opnd (N)), Warn => SPARK_Mode = On); end if; when N_Op_Rem => Apply_Compile_Time_Constraint_Error (N, "rem with zero divisor??", CE_Divide_By_Zero, Loc => Sloc (Right_Opnd (N)), Warn => SPARK_Mode = On); when N_Op_Mod => Apply_Compile_Time_Constraint_Error (N, "mod with zero divisor??", CE_Divide_By_Zero, Loc => Sloc (Right_Opnd (N)), Warn => SPARK_Mode = On); -- Division by zero can only happen with division, rem, -- and mod operations. when others => raise Program_Error; end case; -- In GNATprove mode, we enable the division check so that -- GNATprove will issue a message if it cannot be proved. if GNATprove_Mode then Activate_Division_Check (N); end if; -- Otherwise just set the flag to check at run time else Activate_Division_Check (N); end if; end if; -- If Restriction No_Implicit_Conditionals is active, then it is -- violated if either operand can be negative for mod, or for rem -- if both operands can be negative. if Restriction_Check_Required (No_Implicit_Conditionals) and then Nkind (N) in N_Op_Rem | N_Op_Mod then declare Lo : Uint; Hi : Uint; OK : Boolean; LNeg : Boolean; RNeg : Boolean; -- Set if corresponding operand might be negative begin Determine_Range (Left_Opnd (N), OK, Lo, Hi, Assume_Valid => True); LNeg := (not OK) or else Lo < 0; Determine_Range (Right_Opnd (N), OK, Lo, Hi, Assume_Valid => True); RNeg := (not OK) or else Lo < 0; -- Check if we will be generating conditionals. There are two -- cases where that can happen, first for REM, the only case -- is largest negative integer mod -1, where the division can -- overflow, but we still have to give the right result. The -- front end generates a test for this annoying case. Here we -- just test if both operands can be negative (that's what the -- expander does, so we match its logic here). -- The second case is mod where either operand can be negative. -- In this case, the back end has to generate additional tests. if (Nkind (N) = N_Op_Rem and then (LNeg and RNeg)) or else (Nkind (N) = N_Op_Mod and then (LNeg or RNeg)) then Check_Restriction (No_Implicit_Conditionals, N); end if; end; end if; end if; Check_Unset_Reference (L); Check_Unset_Reference (R); end Resolve_Arithmetic_Op; ------------------ -- Resolve_Call -- ------------------ procedure Resolve_Call (N : Node_Id; Typ : Entity_Id) is Loc : constant Source_Ptr := Sloc (N); Subp : constant Node_Id := Name (N); Body_Id : Entity_Id; I : Interp_Index; It : Interp; Nam : Entity_Id; Nam_Decl : Node_Id; Nam_UA : Entity_Id; Norm_OK : Boolean; Rtype : Entity_Id; Scop : Entity_Id; begin -- Preserve relevant elaboration-related attributes of the context which -- are no longer available or very expensive to recompute once analysis, -- resolution, and expansion are over. Mark_Elaboration_Attributes (N_Id => N, Checks => True, Modes => True, Warnings => True); -- The context imposes a unique interpretation with type Typ on a -- procedure or function call. Find the entity of the subprogram that -- yields the expected type, and propagate the corresponding formal -- constraints on the actuals. The caller has established that an -- interpretation exists, and emitted an error if not unique. -- First deal with the case of a call to an access-to-subprogram, -- dereference made explicit in Analyze_Call. if Ekind (Etype (Subp)) = E_Subprogram_Type then if not Is_Overloaded (Subp) then Nam := Etype (Subp); else -- Find the interpretation whose type (a subprogram type) has a -- return type that is compatible with the context. Analysis of -- the node has established that one exists. Nam := Empty; Get_First_Interp (Subp, I, It); while Present (It.Typ) loop if Covers (Typ, Etype (It.Typ)) then Nam := It.Typ; exit; end if; Get_Next_Interp (I, It); end loop; if No (Nam) then raise Program_Error; end if; end if; -- If the prefix is not an entity, then resolve it if not Is_Entity_Name (Subp) then Resolve (Subp, Nam); end if; -- For an indirect call, we always invalidate checks, since we do not -- know whether the subprogram is local or global. Yes we could do -- better here, e.g. by knowing that there are no local subprograms, -- but it does not seem worth the effort. Similarly, we kill all -- knowledge of current constant values. Kill_Current_Values; -- If this is a procedure call which is really an entry call, do -- the conversion of the procedure call to an entry call. Protected -- operations use the same circuitry because the name in the call -- can be an arbitrary expression with special resolution rules. elsif Nkind (Subp) in N_Selected_Component | N_Indexed_Component or else (Is_Entity_Name (Subp) and then Is_Entry (Entity (Subp))) then Resolve_Entry_Call (N, Typ); if Legacy_Elaboration_Checks then Check_Elab_Call (N); end if; -- Annotate the tree by creating a call marker in case the original -- call is transformed by expansion. The call marker is automatically -- saved for later examination by the ABE Processing phase. Build_Call_Marker (N); -- Kill checks and constant values, as above for indirect case -- Who knows what happens when another task is activated? Kill_Current_Values; return; -- Normal subprogram call with name established in Resolve elsif not (Is_Type (Entity (Subp))) then Nam := Entity (Subp); Set_Entity_With_Checks (Subp, Nam); -- Otherwise we must have the case of an overloaded call else pragma Assert (Is_Overloaded (Subp)); -- Initialize Nam to prevent warning (we know it will be assigned -- in the loop below, but the compiler does not know that). Nam := Empty; Get_First_Interp (Subp, I, It); while Present (It.Typ) loop if Covers (Typ, It.Typ) then Nam := It.Nam; Set_Entity_With_Checks (Subp, Nam); exit; end if; Get_Next_Interp (I, It); end loop; end if; -- Check that a call to Current_Task does not occur in an entry body if Is_RTE (Nam, RE_Current_Task) then declare P : Node_Id; begin P := N; loop P := Parent (P); -- Exclude calls that occur within the default of a formal -- parameter of the entry, since those are evaluated outside -- of the body. exit when No (P) or else Nkind (P) = N_Parameter_Specification; if Nkind (P) = N_Entry_Body or else (Nkind (P) = N_Subprogram_Body and then Is_Entry_Barrier_Function (P)) then Rtype := Etype (N); Error_Msg_Warn := SPARK_Mode /= On; Error_Msg_NE ("& should not be used in entry body (RM C.7(17))<<", N, Nam); Error_Msg_NE ("\Program_Error [<<", N, Nam); Rewrite (N, Make_Raise_Program_Error (Loc, Reason => PE_Current_Task_In_Entry_Body)); Set_Etype (N, Rtype); return; end if; end loop; end; end if; -- Check that a procedure call does not occur in the context of the -- entry call statement of a conditional or timed entry call. Note that -- the case of a call to a subprogram renaming of an entry will also be -- rejected. The test for N not being an N_Entry_Call_Statement is -- defensive, covering the possibility that the processing of entry -- calls might reach this point due to later modifications of the code -- above. if Nkind (Parent (N)) = N_Entry_Call_Alternative and then Nkind (N) /= N_Entry_Call_Statement and then Entry_Call_Statement (Parent (N)) = N then if Ada_Version < Ada_2005 then Error_Msg_N ("entry call required in select statement", N); -- Ada 2005 (AI-345): If a procedure_call_statement is used -- for a procedure_or_entry_call, the procedure_name or -- procedure_prefix of the procedure_call_statement shall denote -- an entry renamed by a procedure, or (a view of) a primitive -- subprogram of a limited interface whose first parameter is -- a controlling parameter. elsif Nkind (N) = N_Procedure_Call_Statement and then not Is_Renamed_Entry (Nam) and then not Is_Controlling_Limited_Procedure (Nam) then Error_Msg_N ("entry call or dispatching primitive of interface required", N); end if; end if; -- Check that this is not a call to a protected procedure or entry from -- within a protected function. Check_Internal_Protected_Use (N, Nam); -- Freeze the subprogram name if not in a spec-expression. Note that -- we freeze procedure calls as well as function calls. Procedure calls -- are not frozen according to the rules (RM 13.14(14)) because it is -- impossible to have a procedure call to a non-frozen procedure in -- pure Ada, but in the code that we generate in the expander, this -- rule needs extending because we can generate procedure calls that -- need freezing. -- In Ada 2012, expression functions may be called within pre/post -- conditions of subsequent functions or expression functions. Such -- calls do not freeze when they appear within generated bodies, -- (including the body of another expression function) which would -- place the freeze node in the wrong scope. An expression function -- is frozen in the usual fashion, by the appearance of a real body, -- or at the end of a declarative part. However an implicit call to -- an expression function may appear when it is part of a default -- expression in a call to an initialization procedure, and must be -- frozen now, even if the body is inserted at a later point. -- Otherwise, the call freezes the expression if expander is active, -- for example as part of an object declaration. if Is_Entity_Name (Subp) and then not In_Spec_Expression and then not Is_Expression_Function_Or_Completion (Current_Scope) and then (not Is_Expression_Function_Or_Completion (Entity (Subp)) or else Expander_Active) then if Is_Expression_Function (Entity (Subp)) then -- Force freeze of expression function in call Set_Comes_From_Source (Subp, True); Set_Must_Not_Freeze (Subp, False); end if; Freeze_Expression (Subp); end if; -- For a predefined operator, the type of the result is the type imposed -- by context, except for a predefined operation on universal fixed. -- Otherwise the type of the call is the type returned by the subprogram -- being called. if Is_Predefined_Op (Nam) then if Etype (N) /= Universal_Fixed then Set_Etype (N, Typ); end if; -- If the subprogram returns an array type, and the context requires the -- component type of that array type, the node is really an indexing of -- the parameterless call. Resolve as such. A pathological case occurs -- when the type of the component is an access to the array type. In -- this case the call is truly ambiguous. If the call is to an intrinsic -- subprogram, it can't be an indexed component. This check is necessary -- because if it's Unchecked_Conversion, and we have "type T_Ptr is -- access T;" and "type T is array (...) of T_Ptr;" (i.e. an array of -- pointers to the same array), the compiler gets confused and does an -- infinite recursion. elsif (Needs_No_Actuals (Nam) or else Needs_One_Actual (Nam)) and then ((Is_Array_Type (Etype (Nam)) and then Covers (Typ, Component_Type (Etype (Nam)))) or else (Is_Access_Type (Etype (Nam)) and then Is_Array_Type (Designated_Type (Etype (Nam))) and then Covers (Typ, Component_Type (Designated_Type (Etype (Nam)))) and then not Is_Intrinsic_Subprogram (Entity (Subp)))) then declare Index_Node : Node_Id; New_Subp : Node_Id; Ret_Type : constant Entity_Id := Etype (Nam); begin -- If this is a parameterless call there is no ambiguity and the -- call has the type of the function. if No (First_Actual (N)) then Set_Etype (N, Etype (Nam)); if Present (First_Formal (Nam)) then Resolve_Actuals (N, Nam); end if; -- Annotate the tree by creating a call marker in case the -- original call is transformed by expansion. The call marker -- is automatically saved for later examination by the ABE -- Processing phase. Build_Call_Marker (N); elsif Is_Access_Type (Ret_Type) and then Ret_Type = Component_Type (Designated_Type (Ret_Type)) then Error_Msg_N ("cannot disambiguate function call and indexing", N); else New_Subp := Relocate_Node (Subp); -- The called entity may be an explicit dereference, in which -- case there is no entity to set. if Nkind (New_Subp) /= N_Explicit_Dereference then Set_Entity (Subp, Nam); end if; if (Is_Array_Type (Ret_Type) and then Component_Type (Ret_Type) /= Any_Type) or else (Is_Access_Type (Ret_Type) and then Component_Type (Designated_Type (Ret_Type)) /= Any_Type) then if Needs_No_Actuals (Nam) then -- Indexed call to a parameterless function Index_Node := Make_Indexed_Component (Loc, Prefix => Make_Function_Call (Loc, Name => New_Subp), Expressions => Parameter_Associations (N)); else -- An Ada 2005 prefixed call to a primitive operation -- whose first parameter is the prefix. This prefix was -- prepended to the parameter list, which is actually a -- list of indexes. Remove the prefix in order to build -- the proper indexed component. Index_Node := Make_Indexed_Component (Loc, Prefix => Make_Function_Call (Loc, Name => New_Subp, Parameter_Associations => New_List (Remove_Head (Parameter_Associations (N)))), Expressions => Parameter_Associations (N)); end if; -- Preserve the parenthesis count of the node Set_Paren_Count (Index_Node, Paren_Count (N)); -- Since we are correcting a node classification error made -- by the parser, we call Replace rather than Rewrite. Replace (N, Index_Node); Set_Etype (Prefix (N), Ret_Type); Set_Etype (N, Typ); if Legacy_Elaboration_Checks then Check_Elab_Call (Prefix (N)); end if; -- Annotate the tree by creating a call marker in case -- the original call is transformed by expansion. The call -- marker is automatically saved for later examination by -- the ABE Processing phase. Build_Call_Marker (Prefix (N)); Resolve_Indexed_Component (N, Typ); end if; end if; return; end; else -- If the called function is not declared in the main unit and it -- returns the limited view of type then use the available view (as -- is done in Try_Object_Operation) to prevent back-end confusion; -- for the function entity itself. The call must appear in a context -- where the nonlimited view is available. If the function entity is -- in the extended main unit then no action is needed, because the -- back end handles this case. In either case the type of the call -- is the nonlimited view. if From_Limited_With (Etype (Nam)) and then Present (Available_View (Etype (Nam))) then Set_Etype (N, Available_View (Etype (Nam))); if not In_Extended_Main_Code_Unit (Nam) then Set_Etype (Nam, Available_View (Etype (Nam))); end if; else Set_Etype (N, Etype (Nam)); end if; end if; -- In the case where the call is to an overloaded subprogram, Analyze -- calls Normalize_Actuals once per overloaded subprogram. Therefore in -- such a case Normalize_Actuals needs to be called once more to order -- the actuals correctly. Otherwise the call will have the ordering -- given by the last overloaded subprogram whether this is the correct -- one being called or not. if Is_Overloaded (Subp) then Normalize_Actuals (N, Nam, False, Norm_OK); pragma Assert (Norm_OK); end if; -- In any case, call is fully resolved now. Reset Overload flag, to -- prevent subsequent overload resolution if node is analyzed again Set_Is_Overloaded (Subp, False); Set_Is_Overloaded (N, False); -- A Ghost entity must appear in a specific context if Is_Ghost_Entity (Nam) and then Comes_From_Source (N) then Check_Ghost_Context (Nam, N); end if; -- If we are calling the current subprogram from immediately within its -- body, then that is the case where we can sometimes detect cases of -- infinite recursion statically. Do not try this in case restriction -- No_Recursion is in effect anyway, and do it only for source calls. if Comes_From_Source (N) then Scop := Current_Scope; -- Issue warning for possible infinite recursion in the absence -- of the No_Recursion restriction. if Same_Or_Aliased_Subprograms (Nam, Scop) and then not Restriction_Active (No_Recursion) and then not Is_Static_Function (Scop) and then Check_Infinite_Recursion (N) then -- Here we detected and flagged an infinite recursion, so we do -- not need to test the case below for further warnings. Also we -- are all done if we now have a raise SE node. if Nkind (N) = N_Raise_Storage_Error then return; end if; -- If call is to immediately containing subprogram, then check for -- the case of a possible run-time detectable infinite recursion. else Scope_Loop : while Scop /= Standard_Standard loop if Same_Or_Aliased_Subprograms (Nam, Scop) then -- Ada 202x (AI12-0075): Static functions are never allowed -- to make a recursive call, as specified by 6.8(5.4/5). if Is_Static_Function (Scop) then Error_Msg_N ("recursive call not allowed in static expression " & "function", N); Set_Error_Posted (Scop); exit Scope_Loop; end if; -- Although in general case, recursion is not statically -- checkable, the case of calling an immediately containing -- subprogram is easy to catch. if not Is_Ignored_Ghost_Entity (Nam) then Check_Restriction (No_Recursion, N); end if; -- If the recursive call is to a parameterless subprogram, -- then even if we can't statically detect infinite -- recursion, this is pretty suspicious, and we output a -- warning. Furthermore, we will try later to detect some -- cases here at run time by expanding checking code (see -- Detect_Infinite_Recursion in package Exp_Ch6). -- If the recursive call is within a handler, do not emit a -- warning, because this is a common idiom: loop until input -- is correct, catch illegal input in handler and restart. if No (First_Formal (Nam)) and then Etype (Nam) = Standard_Void_Type and then not Error_Posted (N) and then Nkind (Parent (N)) /= N_Exception_Handler then -- For the case of a procedure call. We give the message -- only if the call is the first statement in a sequence -- of statements, or if all previous statements are -- simple assignments. This is simply a heuristic to -- decrease false positives, without losing too many good -- warnings. The idea is that these previous statements -- may affect global variables the procedure depends on. -- We also exclude raise statements, that may arise from -- constraint checks and are probably unrelated to the -- intended control flow. if Nkind (N) = N_Procedure_Call_Statement and then Is_List_Member (N) then declare P : Node_Id; begin P := Prev (N); while Present (P) loop if Nkind (P) not in N_Assignment_Statement | N_Raise_Constraint_Error then exit Scope_Loop; end if; Prev (P); end loop; end; end if; -- Do not give warning if we are in a conditional context declare K : constant Node_Kind := Nkind (Parent (N)); begin if (K = N_Loop_Statement and then Present (Iteration_Scheme (Parent (N)))) or else K = N_If_Statement or else K = N_Elsif_Part or else K = N_Case_Statement_Alternative then exit Scope_Loop; end if; end; -- Here warning is to be issued Set_Has_Recursive_Call (Nam); Error_Msg_Warn := SPARK_Mode /= On; Error_Msg_N ("possible infinite recursion<<!", N); Error_Msg_N ("\Storage_Error ]<<!", N); end if; exit Scope_Loop; end if; Scop := Scope (Scop); end loop Scope_Loop; end if; end if; -- Check obsolescent reference to Ada.Characters.Handling subprogram Check_Obsolescent_2005_Entity (Nam, Subp); -- If subprogram name is a predefined operator, it was given in -- functional notation. Replace call node with operator node, so -- that actuals can be resolved appropriately. if Is_Predefined_Op (Nam) or else Ekind (Nam) = E_Operator then Make_Call_Into_Operator (N, Typ, Entity (Name (N))); return; elsif Present (Alias (Nam)) and then Is_Predefined_Op (Alias (Nam)) then Resolve_Actuals (N, Nam); Make_Call_Into_Operator (N, Typ, Alias (Nam)); return; end if; -- Create a transient scope if the resulting type requires it -- There are several notable exceptions: -- a) In init procs, the transient scope overhead is not needed, and is -- even incorrect when the call is a nested initialization call for a -- component whose expansion may generate adjust calls. However, if the -- call is some other procedure call within an initialization procedure -- (for example a call to Create_Task in the init_proc of the task -- run-time record) a transient scope must be created around this call. -- b) Enumeration literal pseudo-calls need no transient scope -- c) Intrinsic subprograms (Unchecked_Conversion and source info -- functions) do not use the secondary stack even though the return -- type may be unconstrained. -- d) Calls to a build-in-place function, since such functions may -- allocate their result directly in a target object, and cases where -- the result does get allocated in the secondary stack are checked for -- within the specialized Exp_Ch6 procedures for expanding those -- build-in-place calls. -- e) Calls to inlinable expression functions do not use the secondary -- stack (since the call will be replaced by its returned object). -- f) If the subprogram is marked Inline_Always, then even if it returns -- an unconstrained type the call does not require use of the secondary -- stack. However, inlining will only take place if the body to inline -- is already present. It may not be available if e.g. the subprogram is -- declared in a child instance. -- g) If the subprogram is a static expression function and the call is -- a static call (the actuals are all static expressions), then we never -- want to create a transient scope (this could occur in the case of a -- static string-returning call). if Is_Inlined (Nam) and then Has_Pragma_Inline (Nam) and then Nkind (Unit_Declaration_Node (Nam)) = N_Subprogram_Declaration and then Present (Body_To_Inline (Unit_Declaration_Node (Nam))) then null; elsif Ekind (Nam) = E_Enumeration_Literal or else Is_Build_In_Place_Function (Nam) or else Is_Intrinsic_Subprogram (Nam) or else Is_Inlinable_Expression_Function (Nam) or else Is_Static_Function_Call (N) then null; -- A return statement from an ignored Ghost function does not use the -- secondary stack (or any other one). elsif Expander_Active and then Ekind (Nam) in E_Function | E_Subprogram_Type and then Requires_Transient_Scope (Etype (Nam)) and then not Is_Ignored_Ghost_Entity (Nam) then Establish_Transient_Scope (N, Manage_Sec_Stack => True); -- If the call appears within the bounds of a loop, it will be -- rewritten and reanalyzed, nothing left to do here. if Nkind (N) /= N_Function_Call then return; end if; end if; -- A protected function cannot be called within the definition of the -- enclosing protected type, unless it is part of a pre/postcondition -- on another protected operation. This may appear in the entry wrapper -- created for an entry with preconditions. if Is_Protected_Type (Scope (Nam)) and then In_Open_Scopes (Scope (Nam)) and then not Has_Completion (Scope (Nam)) and then not In_Spec_Expression and then not Is_Entry_Wrapper (Current_Scope) then Error_Msg_NE ("& cannot be called before end of protected definition", N, Nam); end if; -- Propagate interpretation to actuals, and add default expressions -- where needed. if Present (First_Formal (Nam)) then Resolve_Actuals (N, Nam); -- Overloaded literals are rewritten as function calls, for purpose of -- resolution. After resolution, we can replace the call with the -- literal itself. elsif Ekind (Nam) = E_Enumeration_Literal then Copy_Node (Subp, N); Resolve_Entity_Name (N, Typ); -- Avoid validation, since it is a static function call Generate_Reference (Nam, Subp); return; end if; -- If the subprogram is not global, then kill all saved values and -- checks. This is a bit conservative, since in many cases we could do -- better, but it is not worth the effort. Similarly, we kill constant -- values. However we do not need to do this for internal entities -- (unless they are inherited user-defined subprograms), since they -- are not in the business of molesting local values. -- If the flag Suppress_Value_Tracking_On_Calls is set, then we also -- kill all checks and values for calls to global subprograms. This -- takes care of the case where an access to a local subprogram is -- taken, and could be passed directly or indirectly and then called -- from almost any context. -- Note: we do not do this step till after resolving the actuals. That -- way we still take advantage of the current value information while -- scanning the actuals. -- We suppress killing values if we are processing the nodes associated -- with N_Freeze_Entity nodes. Otherwise the declaration of a tagged -- type kills all the values as part of analyzing the code that -- initializes the dispatch tables. if Inside_Freezing_Actions = 0 and then (not Is_Library_Level_Entity (Nam) or else Suppress_Value_Tracking_On_Call (Nearest_Dynamic_Scope (Current_Scope))) and then (Comes_From_Source (Nam) or else (Present (Alias (Nam)) and then Comes_From_Source (Alias (Nam)))) then Kill_Current_Values; end if; -- If we are warning about unread OUT parameters, this is the place to -- set Last_Assignment for OUT and IN OUT parameters. We have to do this -- after the above call to Kill_Current_Values (since that call clears -- the Last_Assignment field of all local variables). if (Warn_On_Modified_Unread or Warn_On_All_Unread_Out_Parameters) and then Comes_From_Source (N) and then In_Extended_Main_Source_Unit (N) then declare F : Entity_Id; A : Node_Id; begin F := First_Formal (Nam); A := First_Actual (N); while Present (F) and then Present (A) loop if Ekind (F) in E_Out_Parameter | E_In_Out_Parameter and then Warn_On_Modified_As_Out_Parameter (F) and then Is_Entity_Name (A) and then Present (Entity (A)) and then Comes_From_Source (N) and then Safe_To_Capture_Value (N, Entity (A)) then Set_Last_Assignment (Entity (A), A); end if; Next_Formal (F); Next_Actual (A); end loop; end; end if; -- If the subprogram is a primitive operation, check whether or not -- it is a correct dispatching call. if Is_Overloadable (Nam) and then Is_Dispatching_Operation (Nam) then Check_Dispatching_Call (N); elsif Ekind (Nam) /= E_Subprogram_Type and then Is_Abstract_Subprogram (Nam) and then not In_Instance then Error_Msg_NE ("cannot call abstract subprogram &!", N, Nam); end if; -- If this is a dispatching call, generate the appropriate reference, -- for better source navigation in GNAT Studio. if Is_Overloadable (Nam) and then Present (Controlling_Argument (N)) then Generate_Reference (Nam, Subp, 'R'); -- Normal case, not a dispatching call: generate a call reference else Generate_Reference (Nam, Subp, 's'); end if; if Is_Intrinsic_Subprogram (Nam) then Check_Intrinsic_Call (N); end if; -- Check for violation of restriction No_Specific_Termination_Handlers -- and warn on a potentially blocking call to Abort_Task. if Restriction_Check_Required (No_Specific_Termination_Handlers) and then (Is_RTE (Nam, RE_Set_Specific_Handler) or else Is_RTE (Nam, RE_Specific_Handler)) then Check_Restriction (No_Specific_Termination_Handlers, N); elsif Is_RTE (Nam, RE_Abort_Task) then Check_Potentially_Blocking_Operation (N); end if; -- A call to Ada.Real_Time.Timing_Events.Set_Handler to set a relative -- timing event violates restriction No_Relative_Delay (AI-0211). We -- need to check the second argument to determine whether it is an -- absolute or relative timing event. if Restriction_Check_Required (No_Relative_Delay) and then Is_RTE (Nam, RE_Set_Handler) and then Is_RTE (Etype (Next_Actual (First_Actual (N))), RE_Time_Span) then Check_Restriction (No_Relative_Delay, N); end if; -- Issue an error for a call to an eliminated subprogram. This routine -- will not perform the check if the call appears within a default -- expression. Check_For_Eliminated_Subprogram (Subp, Nam); -- Implement rule in 12.5.1 (23.3/2): In an instance, if the actual is -- class-wide and the call dispatches on result in a context that does -- not provide a tag, the call raises Program_Error. if Nkind (N) = N_Function_Call and then In_Instance and then Is_Generic_Actual_Type (Typ) and then Is_Class_Wide_Type (Typ) and then Has_Controlling_Result (Nam) and then Nkind (Parent (N)) = N_Object_Declaration then -- Verify that none of the formals are controlling declare Call_OK : Boolean := False; F : Entity_Id; begin F := First_Formal (Nam); while Present (F) loop if Is_Controlling_Formal (F) then Call_OK := True; exit; end if; Next_Formal (F); end loop; if not Call_OK then Error_Msg_Warn := SPARK_Mode /= On; Error_Msg_N ("!cannot determine tag of result<<", N); Error_Msg_N ("\Program_Error [<<!", N); Insert_Action (N, Make_Raise_Program_Error (Sloc (N), Reason => PE_Explicit_Raise)); end if; end; end if; -- Check for calling a function with OUT or IN OUT parameter when the -- calling context (us right now) is not Ada 2012, so does not allow -- OUT or IN OUT parameters in function calls. Functions declared in -- a predefined unit are OK, as they may be called indirectly from a -- user-declared instantiation. if Ada_Version < Ada_2012 and then Ekind (Nam) = E_Function and then Has_Out_Or_In_Out_Parameter (Nam) and then not In_Predefined_Unit (Nam) then Error_Msg_NE ("& has at least one OUT or `IN OUT` parameter", N, Nam); Error_Msg_N ("\call to this function only allowed in Ada 2012", N); end if; -- Check the dimensions of the actuals in the call. For function calls, -- propagate the dimensions from the returned type to N. Analyze_Dimension_Call (N, Nam); -- All done, evaluate call and deal with elaboration issues Eval_Call (N); if Legacy_Elaboration_Checks then Check_Elab_Call (N); end if; -- Annotate the tree by creating a call marker in case the original call -- is transformed by expansion. The call marker is automatically saved -- for later examination by the ABE Processing phase. Build_Call_Marker (N); Mark_Use_Clauses (Subp); Warn_On_Overlapping_Actuals (Nam, N); -- Ada 202x (AI12-0075): If the call is a static call to a static -- expression function, then we want to "inline" the call, replacing -- it with the folded static result. This is not done if the checking -- for a potentially static expression is enabled or if an error has -- been posted on the call (which may be due to the check for recursive -- calls, in which case we don't want to fall into infinite recursion -- when doing the inlining). if not Checking_Potentially_Static_Expression and then Is_Static_Function_Call (N) and then not Is_Intrinsic_Subprogram (Ultimate_Alias (Nam)) and then not Error_Posted (Ultimate_Alias (Nam)) then Inline_Static_Function_Call (N, Ultimate_Alias (Nam)); -- In GNATprove mode, expansion is disabled, but we want to inline some -- subprograms to facilitate formal verification. Indirect calls through -- a subprogram type or within a generic cannot be inlined. Inlining is -- performed only for calls subject to SPARK_Mode on. elsif GNATprove_Mode and then SPARK_Mode = On and then Is_Overloadable (Nam) and then not Inside_A_Generic then Nam_UA := Ultimate_Alias (Nam); Nam_Decl := Unit_Declaration_Node (Nam_UA); if Nkind (Nam_Decl) = N_Subprogram_Declaration then Body_Id := Corresponding_Body (Nam_Decl); -- Nothing to do if the subprogram is not eligible for inlining in -- GNATprove mode, or inlining is disabled with switch -gnatdm if not Is_Inlined_Always (Nam_UA) or else not Can_Be_Inlined_In_GNATprove_Mode (Nam_UA, Body_Id) or else Debug_Flag_M then null; -- Calls cannot be inlined inside assertions, as GNATprove treats -- assertions as logic expressions. Only issue a message when the -- body has been seen, otherwise this leads to spurious messages -- on expression functions. elsif In_Assertion_Expr /= 0 then if Present (Body_Id) then Cannot_Inline ("cannot inline & (in assertion expression)?", N, Nam_UA); end if; -- Calls cannot be inlined inside default expressions elsif In_Default_Expr then Cannot_Inline ("cannot inline & (in default expression)?", N, Nam_UA); -- Calls cannot be inlined inside quantified expressions, which -- are left in expression form for GNATprove. Since these -- expressions are only preanalyzed, we need to detect the failure -- to inline outside of the case for Full_Analysis below. elsif In_Quantified_Expression (N) then Cannot_Inline ("cannot inline & (in quantified expression)?", N, Nam_UA); -- Inlining should not be performed during preanalysis elsif Full_Analysis then -- Do not inline calls inside expression functions or functions -- generated by the front end for subtype predicates, as this -- would prevent interpreting them as logical formulas in -- GNATprove. Only issue a message when the body has been seen, -- otherwise this leads to spurious messages on callees that -- are themselves expression functions. if Present (Current_Subprogram) and then (Is_Expression_Function_Or_Completion (Current_Subprogram) or else Is_Predicate_Function (Current_Subprogram) or else Is_Invariant_Procedure (Current_Subprogram) or else Is_DIC_Procedure (Current_Subprogram)) then if Present (Body_Id) and then Present (Body_To_Inline (Nam_Decl)) then if Is_Predicate_Function (Current_Subprogram) then Cannot_Inline ("cannot inline & (inside predicate)?", N, Nam_UA); elsif Is_Invariant_Procedure (Current_Subprogram) then Cannot_Inline ("cannot inline & (inside invariant)?", N, Nam_UA); elsif Is_DIC_Procedure (Current_Subprogram) then Cannot_Inline ("cannot inline & (inside Default_Initial_Condition)?", N, Nam_UA); else Cannot_Inline ("cannot inline & (inside expression function)?", N, Nam_UA); end if; end if; -- Cannot inline a call inside the definition of a record type, -- typically inside the constraints of the type. Calls in -- default expressions are also not inlined, but this is -- filtered out above when testing In_Default_Expr. elsif Is_Record_Type (Current_Scope) then Cannot_Inline ("cannot inline & (inside record type)?", N, Nam_UA); -- With the one-pass inlining technique, a call cannot be -- inlined if the corresponding body has not been seen yet. elsif No (Body_Id) then Cannot_Inline ("cannot inline & (body not seen yet)?", N, Nam_UA); -- Nothing to do if there is no body to inline, indicating that -- the subprogram is not suitable for inlining in GNATprove -- mode. elsif No (Body_To_Inline (Nam_Decl)) then null; -- Calls cannot be inlined inside potentially unevaluated -- expressions, as this would create complex actions inside -- expressions, that are not handled by GNATprove. elsif Is_Potentially_Unevaluated (N) then Cannot_Inline ("cannot inline & (in potentially unevaluated context)?", N, Nam_UA); -- Calls cannot be inlined inside the conditions of while -- loops, as this would create complex actions inside -- the condition, that are not handled by GNATprove. elsif In_While_Loop_Condition (N) then Cannot_Inline ("cannot inline & (in while loop condition)?", N, Nam_UA); -- Do not inline calls which would possibly lead to missing a -- type conversion check on an input parameter. elsif not Call_Can_Be_Inlined_In_GNATprove_Mode (N, Nam) then Cannot_Inline ("cannot inline & (possible check on input parameters)?", N, Nam_UA); -- Otherwise, inline the call, issuing an info message when -- -gnatd_f is set. else if Debug_Flag_Underscore_F then Error_Msg_NE ("info: analyzing call to & in context?", N, Nam_UA); end if; Expand_Inlined_Call (N, Nam_UA, Nam); end if; end if; end if; end if; end Resolve_Call; ----------------------------- -- Resolve_Case_Expression -- ----------------------------- procedure Resolve_Case_Expression (N : Node_Id; Typ : Entity_Id) is Alt : Node_Id; Alt_Expr : Node_Id; Alt_Typ : Entity_Id; Is_Dyn : Boolean; begin Alt := First (Alternatives (N)); while Present (Alt) loop Alt_Expr := Expression (Alt); if Error_Posted (Alt_Expr) then return; end if; Resolve (Alt_Expr, Typ); Alt_Typ := Etype (Alt_Expr); -- When the expression is of a scalar subtype different from the -- result subtype, then insert a conversion to ensure the generation -- of a constraint check. if Is_Scalar_Type (Alt_Typ) and then Alt_Typ /= Typ then Rewrite (Alt_Expr, Convert_To (Typ, Alt_Expr)); Analyze_And_Resolve (Alt_Expr, Typ); end if; Next (Alt); end loop; -- Apply RM 4.5.7 (17/3): whether the expression is statically or -- dynamically tagged must be known statically. if Is_Tagged_Type (Typ) and then not Is_Class_Wide_Type (Typ) then Alt := First (Alternatives (N)); Is_Dyn := Is_Dynamically_Tagged (Expression (Alt)); while Present (Alt) loop if Is_Dynamically_Tagged (Expression (Alt)) /= Is_Dyn then Error_Msg_N ("all or none of the dependent expressions can be " & "dynamically tagged", N); end if; Next (Alt); end loop; end if; Set_Etype (N, Typ); Eval_Case_Expression (N); Analyze_Dimension (N); end Resolve_Case_Expression; ------------------------------- -- Resolve_Character_Literal -- ------------------------------- procedure Resolve_Character_Literal (N : Node_Id; Typ : Entity_Id) is B_Typ : constant Entity_Id := Base_Type (Typ); C : Entity_Id; begin -- Verify that the character does belong to the type of the context Set_Etype (N, B_Typ); Eval_Character_Literal (N); -- Wide_Wide_Character literals must always be defined, since the set -- of wide wide character literals is complete, i.e. if a character -- literal is accepted by the parser, then it is OK for wide wide -- character (out of range character literals are rejected). if Root_Type (B_Typ) = Standard_Wide_Wide_Character then return; -- Always accept character literal for type Any_Character, which -- occurs in error situations and in comparisons of literals, both -- of which should accept all literals. elsif B_Typ = Any_Character then return; -- For Standard.Character or a type derived from it, check that the -- literal is in range. elsif Root_Type (B_Typ) = Standard_Character then if In_Character_Range (UI_To_CC (Char_Literal_Value (N))) then return; end if; -- For Standard.Wide_Character or a type derived from it, check that the -- literal is in range. elsif Root_Type (B_Typ) = Standard_Wide_Character then if In_Wide_Character_Range (UI_To_CC (Char_Literal_Value (N))) then return; end if; -- If the entity is already set, this has already been resolved in a -- generic context, or comes from expansion. Nothing else to do. elsif Present (Entity (N)) then return; -- Otherwise we have a user defined character type, and we can use the -- standard visibility mechanisms to locate the referenced entity. else C := Current_Entity (N); while Present (C) loop if Etype (C) = B_Typ then Set_Entity_With_Checks (N, C); Generate_Reference (C, N); return; end if; C := Homonym (C); end loop; end if; -- If we fall through, then the literal does not match any of the -- entries of the enumeration type. This isn't just a constraint error -- situation, it is an illegality (see RM 4.2). Error_Msg_NE ("character not defined for }", N, First_Subtype (B_Typ)); end Resolve_Character_Literal; --------------------------- -- Resolve_Comparison_Op -- --------------------------- -- Context requires a boolean type, and plays no role in resolution. -- Processing identical to that for equality operators. The result type is -- the base type, which matters when pathological subtypes of booleans with -- limited ranges are used. procedure Resolve_Comparison_Op (N : Node_Id; Typ : Entity_Id) is L : constant Node_Id := Left_Opnd (N); R : constant Node_Id := Right_Opnd (N); T : Entity_Id; begin -- If this is an intrinsic operation which is not predefined, use the -- types of its declared arguments to resolve the possibly overloaded -- operands. Otherwise the operands are unambiguous and specify the -- expected type. if Scope (Entity (N)) /= Standard_Standard then T := Etype (First_Entity (Entity (N))); else T := Find_Unique_Type (L, R); if T = Any_Fixed then T := Unique_Fixed_Point_Type (L); end if; end if; Set_Etype (N, Base_Type (Typ)); Generate_Reference (T, N, ' '); -- Skip remaining processing if already set to Any_Type if T = Any_Type then return; end if; -- Deal with other error cases if T = Any_String or else T = Any_Composite or else T = Any_Character then if T = Any_Character then Ambiguous_Character (L); else Error_Msg_N ("ambiguous operands for comparison", N); end if; Set_Etype (N, Any_Type); return; end if; -- Resolve the operands if types OK Resolve (L, T); Resolve (R, T); Check_Unset_Reference (L); Check_Unset_Reference (R); Generate_Operator_Reference (N, T); Check_Low_Bound_Tested (N); -- Check comparison on unordered enumeration if Bad_Unordered_Enumeration_Reference (N, Etype (L)) then Error_Msg_Sloc := Sloc (Etype (L)); Error_Msg_NE ("comparison on unordered enumeration type& declared#?U?", N, Etype (L)); end if; Analyze_Dimension (N); -- Evaluate the relation (note we do this after the above check since -- this Eval call may change N to True/False. Skip this evaluation -- inside assertions, in order to keep assertions as written by users -- for tools that rely on these, e.g. GNATprove for loop invariants. -- Except evaluation is still performed even inside assertions for -- comparisons between values of universal type, which are useless -- for static analysis tools, and not supported even by GNATprove. if In_Assertion_Expr = 0 or else (Is_Universal_Numeric_Type (Etype (L)) and then Is_Universal_Numeric_Type (Etype (R))) then Eval_Relational_Op (N); end if; end Resolve_Comparison_Op; -------------------------------- -- Resolve_Declare_Expression -- -------------------------------- procedure Resolve_Declare_Expression (N : Node_Id; Typ : Entity_Id) is Decl : Node_Id; begin -- Install the scope created for local declarations, if -- any. The syntax allows a Declare_Expression with no -- declarations, in analogy with block statements. -- Note that that scope has no explicit declaration, but -- appears as the scope of all entities declared therein. Decl := First (Actions (N)); while Present (Decl) loop exit when Nkind (Decl) in N_Object_Declaration | N_Object_Renaming_Declaration; Next (Decl); end loop; if Present (Decl) then Push_Scope (Scope (Defining_Identifier (Decl))); declare E : Entity_Id := First_Entity (Current_Scope); begin while Present (E) loop Set_Current_Entity (E); Set_Is_Immediately_Visible (E); Next_Entity (E); end loop; end; Resolve (Expression (N), Typ); End_Scope; else Resolve (Expression (N), Typ); end if; end Resolve_Declare_Expression; ----------------------------------------- -- Resolve_Discrete_Subtype_Indication -- ----------------------------------------- procedure Resolve_Discrete_Subtype_Indication (N : Node_Id; Typ : Entity_Id) is R : Node_Id; S : Entity_Id; begin Analyze (Subtype_Mark (N)); S := Entity (Subtype_Mark (N)); if Nkind (Constraint (N)) /= N_Range_Constraint then Error_Msg_N ("expect range constraint for discrete type", N); Set_Etype (N, Any_Type); else R := Range_Expression (Constraint (N)); if R = Error then return; end if; Analyze (R); if Base_Type (S) /= Base_Type (Typ) then Error_Msg_NE ("expect subtype of }", N, First_Subtype (Typ)); -- Rewrite the constraint as a range of Typ -- to allow compilation to proceed further. Set_Etype (N, Typ); Rewrite (Low_Bound (R), Make_Attribute_Reference (Sloc (Low_Bound (R)), Prefix => New_Occurrence_Of (Typ, Sloc (R)), Attribute_Name => Name_First)); Rewrite (High_Bound (R), Make_Attribute_Reference (Sloc (High_Bound (R)), Prefix => New_Occurrence_Of (Typ, Sloc (R)), Attribute_Name => Name_First)); else Resolve (R, Typ); Set_Etype (N, Etype (R)); -- Additionally, we must check that the bounds are compatible -- with the given subtype, which might be different from the -- type of the context. Apply_Range_Check (R, S); -- ??? If the above check statically detects a Constraint_Error -- it replaces the offending bound(s) of the range R with a -- Constraint_Error node. When the itype which uses these bounds -- is frozen the resulting call to Duplicate_Subexpr generates -- a new temporary for the bounds. -- Unfortunately there are other itypes that are also made depend -- on these bounds, so when Duplicate_Subexpr is called they get -- a forward reference to the newly created temporaries and Gigi -- aborts on such forward references. This is probably sign of a -- more fundamental problem somewhere else in either the order of -- itype freezing or the way certain itypes are constructed. -- To get around this problem we call Remove_Side_Effects right -- away if either bounds of R are a Constraint_Error. declare L : constant Node_Id := Low_Bound (R); H : constant Node_Id := High_Bound (R); begin if Nkind (L) = N_Raise_Constraint_Error then Remove_Side_Effects (L); end if; if Nkind (H) = N_Raise_Constraint_Error then Remove_Side_Effects (H); end if; end; Check_Unset_Reference (Low_Bound (R)); Check_Unset_Reference (High_Bound (R)); end if; end if; end Resolve_Discrete_Subtype_Indication; ------------------------- -- Resolve_Entity_Name -- ------------------------- -- Used to resolve identifiers and expanded names procedure Resolve_Entity_Name (N : Node_Id; Typ : Entity_Id) is function Is_Assignment_Or_Object_Expression (Context : Node_Id; Expr : Node_Id) return Boolean; -- Determine whether node Context denotes an assignment statement or an -- object declaration whose expression is node Expr. function Is_Attribute_Expression (Expr : Node_Id) return Boolean; -- Determine whether Expr is part of an N_Attribute_Reference -- expression. ---------------------------------------- -- Is_Assignment_Or_Object_Expression -- ---------------------------------------- function Is_Assignment_Or_Object_Expression (Context : Node_Id; Expr : Node_Id) return Boolean is begin if Nkind (Context) in N_Assignment_Statement | N_Object_Declaration and then Expression (Context) = Expr then return True; -- Check whether a construct that yields a name is the expression of -- an assignment statement or an object declaration. elsif (Nkind (Context) in N_Attribute_Reference | N_Explicit_Dereference | N_Indexed_Component | N_Selected_Component | N_Slice and then Prefix (Context) = Expr) or else (Nkind (Context) in N_Type_Conversion | N_Unchecked_Type_Conversion and then Expression (Context) = Expr) then return Is_Assignment_Or_Object_Expression (Context => Parent (Context), Expr => Context); -- Otherwise the context is not an assignment statement or an object -- declaration. else return False; end if; end Is_Assignment_Or_Object_Expression; ----------------------------- -- Is_Attribute_Expression -- ----------------------------- function Is_Attribute_Expression (Expr : Node_Id) return Boolean is N : Node_Id := Expr; begin while Present (N) loop if Nkind (N) = N_Attribute_Reference then return True; end if; N := Parent (N); end loop; return False; end Is_Attribute_Expression; -- Local variables E : constant Entity_Id := Entity (N); Par : Node_Id; -- Start of processing for Resolve_Entity_Name begin -- If garbage from errors, set to Any_Type and return if No (E) and then Total_Errors_Detected /= 0 then Set_Etype (N, Any_Type); return; end if; -- Replace named numbers by corresponding literals. Note that this is -- the one case where Resolve_Entity_Name must reset the Etype, since -- it is currently marked as universal. if Ekind (E) = E_Named_Integer then Set_Etype (N, Typ); Eval_Named_Integer (N); elsif Ekind (E) = E_Named_Real then Set_Etype (N, Typ); Eval_Named_Real (N); -- For enumeration literals, we need to make sure that a proper style -- check is done, since such literals are overloaded, and thus we did -- not do a style check during the first phase of analysis. elsif Ekind (E) = E_Enumeration_Literal then Set_Entity_With_Checks (N, E); Eval_Entity_Name (N); -- Case of (sub)type name appearing in a context where an expression -- is expected. This is legal if occurrence is a current instance. -- See RM 8.6 (17/3). elsif Is_Type (E) then if Is_Current_Instance (N) then null; -- Any other use is an error else Error_Msg_N ("invalid use of subtype mark in expression or call", N); end if; -- Check discriminant use if entity is discriminant in current scope, -- i.e. discriminant of record or concurrent type currently being -- analyzed. Uses in corresponding body are unrestricted. elsif Ekind (E) = E_Discriminant and then Scope (E) = Current_Scope and then not Has_Completion (Current_Scope) then Check_Discriminant_Use (N); -- A parameterless generic function cannot appear in a context that -- requires resolution. elsif Ekind (E) = E_Generic_Function then Error_Msg_N ("illegal use of generic function", N); -- In Ada 83 an OUT parameter cannot be read, but attributes of -- array types (i.e. bounds and length) are legal. elsif Ekind (E) = E_Out_Parameter and then (Is_Scalar_Type (Etype (E)) or else not Is_Attribute_Expression (Parent (N))) and then (Nkind (Parent (N)) in N_Op or else Nkind (Parent (N)) = N_Explicit_Dereference or else Is_Assignment_Or_Object_Expression (Context => Parent (N), Expr => N)) then if Ada_Version = Ada_83 then Error_Msg_N ("(Ada 83) illegal reading of out parameter", N); end if; -- In all other cases, just do the possible static evaluation else -- A deferred constant that appears in an expression must have a -- completion, unless it has been removed by in-place expansion of -- an aggregate. A constant that is a renaming does not need -- initialization. if Ekind (E) = E_Constant and then Comes_From_Source (E) and then No (Constant_Value (E)) and then Is_Frozen (Etype (E)) and then not In_Spec_Expression and then not Is_Imported (E) and then Nkind (Parent (E)) /= N_Object_Renaming_Declaration then if No_Initialization (Parent (E)) or else (Present (Full_View (E)) and then No_Initialization (Parent (Full_View (E)))) then null; else Error_Msg_N ("deferred constant is frozen before completion", N); end if; end if; Eval_Entity_Name (N); end if; Par := Parent (N); -- When the entity appears in a parameter association, retrieve the -- related subprogram call. if Nkind (Par) = N_Parameter_Association then Par := Parent (Par); end if; if Comes_From_Source (N) then -- The following checks are only relevant when SPARK_Mode is on as -- they are not standard Ada legality rules. if SPARK_Mode = On then -- An effectively volatile object for reading must appear in -- non-interfering context (SPARK RM 7.1.3(10)). if Is_Object (E) and then Is_Effectively_Volatile_For_Reading (E) and then not Is_OK_Volatile_Context (Par, N) then SPARK_Msg_N ("volatile object cannot appear in this context " & "(SPARK RM 7.1.3(10))", N); end if; -- Check for possible elaboration issues with respect to reads of -- variables. The act of renaming the variable is not considered a -- read as it simply establishes an alias. if Legacy_Elaboration_Checks and then Ekind (E) = E_Variable and then Dynamic_Elaboration_Checks and then Nkind (Par) /= N_Object_Renaming_Declaration then Check_Elab_Call (N); end if; end if; -- The variable may eventually become a constituent of a single -- protected/task type. Record the reference now and verify its -- legality when analyzing the contract of the variable -- (SPARK RM 9.3). if Ekind (E) = E_Variable then Record_Possible_Part_Of_Reference (E, N); end if; -- A Ghost entity must appear in a specific context if Is_Ghost_Entity (E) then Check_Ghost_Context (E, N); end if; end if; -- We may be resolving an entity within expanded code, so a reference to -- an entity should be ignored when calculating effective use clauses to -- avoid inappropriate marking. if Comes_From_Source (N) then Mark_Use_Clauses (E); end if; end Resolve_Entity_Name; ------------------- -- Resolve_Entry -- ------------------- procedure Resolve_Entry (Entry_Name : Node_Id) is Loc : constant Source_Ptr := Sloc (Entry_Name); Nam : Entity_Id; New_N : Node_Id; S : Entity_Id; Tsk : Entity_Id; E_Name : Node_Id; Index : Node_Id; function Actual_Index_Type (E : Entity_Id) return Entity_Id; -- If the bounds of the entry family being called depend on task -- discriminants, build a new index subtype where a discriminant is -- replaced with the value of the discriminant of the target task. -- The target task is the prefix of the entry name in the call. ----------------------- -- Actual_Index_Type -- ----------------------- function Actual_Index_Type (E : Entity_Id) return Entity_Id is Typ : constant Entity_Id := Entry_Index_Type (E); Tsk : constant Entity_Id := Scope (E); Lo : constant Node_Id := Type_Low_Bound (Typ); Hi : constant Node_Id := Type_High_Bound (Typ); New_T : Entity_Id; function Actual_Discriminant_Ref (Bound : Node_Id) return Node_Id; -- If the bound is given by a discriminant, replace with a reference -- to the discriminant of the same name in the target task. If the -- entry name is the target of a requeue statement and the entry is -- in the current protected object, the bound to be used is the -- discriminal of the object (see Apply_Range_Check for details of -- the transformation). ----------------------------- -- Actual_Discriminant_Ref -- ----------------------------- function Actual_Discriminant_Ref (Bound : Node_Id) return Node_Id is Typ : constant Entity_Id := Etype (Bound); Ref : Node_Id; begin Remove_Side_Effects (Bound); if not Is_Entity_Name (Bound) or else Ekind (Entity (Bound)) /= E_Discriminant then return Bound; elsif Is_Protected_Type (Tsk) and then In_Open_Scopes (Tsk) and then Nkind (Parent (Entry_Name)) = N_Requeue_Statement then -- Note: here Bound denotes a discriminant of the corresponding -- record type tskV, whose discriminal is a formal of the -- init-proc tskVIP. What we want is the body discriminal, -- which is associated to the discriminant of the original -- concurrent type tsk. return New_Occurrence_Of (Find_Body_Discriminal (Entity (Bound)), Loc); else Ref := Make_Selected_Component (Loc, Prefix => New_Copy_Tree (Prefix (Prefix (Entry_Name))), Selector_Name => New_Occurrence_Of (Entity (Bound), Loc)); Analyze (Ref); Resolve (Ref, Typ); return Ref; end if; end Actual_Discriminant_Ref; -- Start of processing for Actual_Index_Type begin if not Has_Discriminants (Tsk) or else (not Is_Entity_Name (Lo) and then not Is_Entity_Name (Hi)) then return Entry_Index_Type (E); else New_T := Create_Itype (Ekind (Typ), Parent (Entry_Name)); Set_Etype (New_T, Base_Type (Typ)); Set_Size_Info (New_T, Typ); Set_RM_Size (New_T, RM_Size (Typ)); Set_Scalar_Range (New_T, Make_Range (Sloc (Entry_Name), Low_Bound => Actual_Discriminant_Ref (Lo), High_Bound => Actual_Discriminant_Ref (Hi))); return New_T; end if; end Actual_Index_Type; -- Start of processing for Resolve_Entry begin -- Find name of entry being called, and resolve prefix of name with its -- own type. The prefix can be overloaded, and the name and signature of -- the entry must be taken into account. if Nkind (Entry_Name) = N_Indexed_Component then -- Case of dealing with entry family within the current tasks E_Name := Prefix (Entry_Name); else E_Name := Entry_Name; end if; if Is_Entity_Name (E_Name) then -- Entry call to an entry (or entry family) in the current task. This -- is legal even though the task will deadlock. Rewrite as call to -- current task. -- This can also be a call to an entry in an enclosing task. If this -- is a single task, we have to retrieve its name, because the scope -- of the entry is the task type, not the object. If the enclosing -- task is a task type, the identity of the task is given by its own -- self variable. -- Finally this can be a requeue on an entry of the same task or -- protected object. S := Scope (Entity (E_Name)); for J in reverse 0 .. Scope_Stack.Last loop if Is_Task_Type (Scope_Stack.Table (J).Entity) and then not Comes_From_Source (S) then -- S is an enclosing task or protected object. The concurrent -- declaration has been converted into a type declaration, and -- the object itself has an object declaration that follows -- the type in the same declarative part. Tsk := Next_Entity (S); while Etype (Tsk) /= S loop Next_Entity (Tsk); end loop; S := Tsk; exit; elsif S = Scope_Stack.Table (J).Entity then -- Call to current task. Will be transformed into call to Self exit; end if; end loop; New_N := Make_Selected_Component (Loc, Prefix => New_Occurrence_Of (S, Loc), Selector_Name => New_Occurrence_Of (Entity (E_Name), Loc)); Rewrite (E_Name, New_N); Analyze (E_Name); elsif Nkind (Entry_Name) = N_Selected_Component and then Is_Overloaded (Prefix (Entry_Name)) then -- Use the entry name (which must be unique at this point) to find -- the prefix that returns the corresponding task/protected type. declare Pref : constant Node_Id := Prefix (Entry_Name); Ent : constant Entity_Id := Entity (Selector_Name (Entry_Name)); I : Interp_Index; It : Interp; begin Get_First_Interp (Pref, I, It); while Present (It.Typ) loop if Scope (Ent) = It.Typ then Set_Etype (Pref, It.Typ); exit; end if; Get_Next_Interp (I, It); end loop; end; end if; if Nkind (Entry_Name) = N_Selected_Component then Resolve (Prefix (Entry_Name)); Resolve_Implicit_Dereference (Prefix (Entry_Name)); else pragma Assert (Nkind (Entry_Name) = N_Indexed_Component); Nam := Entity (Selector_Name (Prefix (Entry_Name))); Resolve (Prefix (Prefix (Entry_Name))); Resolve_Implicit_Dereference (Prefix (Prefix (Entry_Name))); -- We do not resolve the prefix because an Entry_Family has no type, -- although it has the semantics of an array since it can be indexed. -- In order to perform the associated range check, we would need to -- build an array type on the fly and set it on the prefix, but this -- would be wasteful since only the index type matters. Therefore we -- attach this index type directly, so that Actual_Index_Expression -- can pick it up later in order to generate the range check. Set_Etype (Prefix (Entry_Name), Actual_Index_Type (Nam)); Index := First (Expressions (Entry_Name)); Resolve (Index, Entry_Index_Type (Nam)); -- Generate a reference for the index when it denotes an entity if Is_Entity_Name (Index) then Generate_Reference (Entity (Index), Nam); end if; -- Up to this point the expression could have been the actual in a -- simple entry call, and be given by a named association. if Nkind (Index) = N_Parameter_Association then Error_Msg_N ("expect expression for entry index", Index); else Apply_Scalar_Range_Check (Index, Etype (Prefix (Entry_Name))); end if; end if; end Resolve_Entry; ------------------------ -- Resolve_Entry_Call -- ------------------------ procedure Resolve_Entry_Call (N : Node_Id; Typ : Entity_Id) is Entry_Name : constant Node_Id := Name (N); Loc : constant Source_Ptr := Sloc (Entry_Name); Nam : Entity_Id; Norm_OK : Boolean; Obj : Node_Id; Was_Over : Boolean; begin -- We kill all checks here, because it does not seem worth the effort to -- do anything better, an entry call is a big operation. Kill_All_Checks; -- Processing of the name is similar for entry calls and protected -- operation calls. Once the entity is determined, we can complete -- the resolution of the actuals. -- The selector may be overloaded, in the case of a protected object -- with overloaded functions. The type of the context is used for -- resolution. if Nkind (Entry_Name) = N_Selected_Component and then Is_Overloaded (Selector_Name (Entry_Name)) and then Typ /= Standard_Void_Type then declare I : Interp_Index; It : Interp; begin Get_First_Interp (Selector_Name (Entry_Name), I, It); while Present (It.Typ) loop if Covers (Typ, It.Typ) then Set_Entity (Selector_Name (Entry_Name), It.Nam); Set_Etype (Entry_Name, It.Typ); Generate_Reference (It.Typ, N, ' '); end if; Get_Next_Interp (I, It); end loop; end; end if; Resolve_Entry (Entry_Name); if Nkind (Entry_Name) = N_Selected_Component then -- Simple entry or protected operation call Nam := Entity (Selector_Name (Entry_Name)); Obj := Prefix (Entry_Name); if Is_Subprogram (Nam) then Check_For_Eliminated_Subprogram (Entry_Name, Nam); end if; Was_Over := Is_Overloaded (Selector_Name (Entry_Name)); else pragma Assert (Nkind (Entry_Name) = N_Indexed_Component); -- Call to member of entry family Nam := Entity (Selector_Name (Prefix (Entry_Name))); Obj := Prefix (Prefix (Entry_Name)); Was_Over := Is_Overloaded (Selector_Name (Prefix (Entry_Name))); end if; -- We cannot in general check the maximum depth of protected entry calls -- at compile time. But we can tell that any protected entry call at all -- violates a specified nesting depth of zero. if Is_Protected_Type (Scope (Nam)) then Check_Restriction (Max_Entry_Queue_Length, N); end if; -- Use context type to disambiguate a protected function that can be -- called without actuals and that returns an array type, and where the -- argument list may be an indexing of the returned value. if Ekind (Nam) = E_Function and then Needs_No_Actuals (Nam) and then Present (Parameter_Associations (N)) and then ((Is_Array_Type (Etype (Nam)) and then Covers (Typ, Component_Type (Etype (Nam)))) or else (Is_Access_Type (Etype (Nam)) and then Is_Array_Type (Designated_Type (Etype (Nam))) and then Covers (Typ, Component_Type (Designated_Type (Etype (Nam)))))) then declare Index_Node : Node_Id; begin Index_Node := Make_Indexed_Component (Loc, Prefix => Make_Function_Call (Loc, Name => Relocate_Node (Entry_Name)), Expressions => Parameter_Associations (N)); -- Since we are correcting a node classification error made by the -- parser, we call Replace rather than Rewrite. Replace (N, Index_Node); Set_Etype (Prefix (N), Etype (Nam)); Set_Etype (N, Typ); Resolve_Indexed_Component (N, Typ); return; end; end if; if Is_Entry (Nam) and then Present (Contract_Wrapper (Nam)) and then Current_Scope /= Contract_Wrapper (Nam) then -- Note the entity being called before rewriting the call, so that -- it appears used at this point. Generate_Reference (Nam, Entry_Name, 'r'); -- Rewrite as call to the precondition wrapper, adding the task -- object to the list of actuals. If the call is to a member of an -- entry family, include the index as well. declare New_Call : Node_Id; New_Actuals : List_Id; begin New_Actuals := New_List (Obj); if Nkind (Entry_Name) = N_Indexed_Component then Append_To (New_Actuals, New_Copy_Tree (First (Expressions (Entry_Name)))); end if; Append_List (Parameter_Associations (N), New_Actuals); New_Call := Make_Procedure_Call_Statement (Loc, Name => New_Occurrence_Of (Contract_Wrapper (Nam), Loc), Parameter_Associations => New_Actuals); Rewrite (N, New_Call); -- Preanalyze and resolve new call. Current procedure is called -- from Resolve_Call, after which expansion will take place. Preanalyze_And_Resolve (N); return; end; end if; -- The operation name may have been overloaded. Order the actuals -- according to the formals of the resolved entity, and set the return -- type to that of the operation. if Was_Over then Normalize_Actuals (N, Nam, False, Norm_OK); pragma Assert (Norm_OK); Set_Etype (N, Etype (Nam)); -- Reset the Is_Overloaded flag, since resolution is now completed -- Simple entry call if Nkind (Entry_Name) = N_Selected_Component then Set_Is_Overloaded (Selector_Name (Entry_Name), False); -- Call to a member of an entry family else pragma Assert (Nkind (Entry_Name) = N_Indexed_Component); Set_Is_Overloaded (Selector_Name (Prefix (Entry_Name)), False); end if; end if; Resolve_Actuals (N, Nam); Check_Internal_Protected_Use (N, Nam); -- Create a call reference to the entry Generate_Reference (Nam, Entry_Name, 's'); if Is_Entry (Nam) then Check_Potentially_Blocking_Operation (N); end if; -- Verify that a procedure call cannot masquerade as an entry -- call where an entry call is expected. if Ekind (Nam) = E_Procedure then if Nkind (Parent (N)) = N_Entry_Call_Alternative and then N = Entry_Call_Statement (Parent (N)) then Error_Msg_N ("entry call required in select statement", N); elsif Nkind (Parent (N)) = N_Triggering_Alternative and then N = Triggering_Statement (Parent (N)) then Error_Msg_N ("triggering statement cannot be procedure call", N); elsif Ekind (Scope (Nam)) = E_Task_Type and then not In_Open_Scopes (Scope (Nam)) then Error_Msg_N ("task has no entry with this name", Entry_Name); end if; end if; -- After resolution, entry calls and protected procedure calls are -- changed into entry calls, for expansion. The structure of the node -- does not change, so it can safely be done in place. Protected -- function calls must keep their structure because they are -- subexpressions. if Ekind (Nam) /= E_Function then -- A protected operation that is not a function may modify the -- corresponding object, and cannot apply to a constant. If this -- is an internal call, the prefix is the type itself. if Is_Protected_Type (Scope (Nam)) and then not Is_Variable (Obj) and then (not Is_Entity_Name (Obj) or else not Is_Type (Entity (Obj))) then Error_Msg_N ("prefix of protected procedure or entry call must be variable", Entry_Name); end if; declare Entry_Call : Node_Id; begin Entry_Call := Make_Entry_Call_Statement (Loc, Name => Entry_Name, Parameter_Associations => Parameter_Associations (N)); -- Inherit relevant attributes from the original call Set_First_Named_Actual (Entry_Call, First_Named_Actual (N)); Set_Is_Elaboration_Checks_OK_Node (Entry_Call, Is_Elaboration_Checks_OK_Node (N)); Set_Is_Elaboration_Warnings_OK_Node (Entry_Call, Is_Elaboration_Warnings_OK_Node (N)); Set_Is_SPARK_Mode_On_Node (Entry_Call, Is_SPARK_Mode_On_Node (N)); Rewrite (N, Entry_Call); Set_Analyzed (N, True); end; -- Protected functions can return on the secondary stack, in which case -- we must trigger the transient scope mechanism. elsif Expander_Active and then Requires_Transient_Scope (Etype (Nam)) then Establish_Transient_Scope (N, Manage_Sec_Stack => True); end if; -- Now we know that this is not a call to a function that returns an -- array type; moreover, we know the name of the called entry. Detect -- overlapping actuals, just like for a subprogram call. Warn_On_Overlapping_Actuals (Nam, N); end Resolve_Entry_Call; ------------------------- -- Resolve_Equality_Op -- ------------------------- -- Both arguments must have the same type, and the boolean context does -- not participate in the resolution. The first pass verifies that the -- interpretation is not ambiguous, and the type of the left argument is -- correctly set, or is Any_Type in case of ambiguity. If both arguments -- are strings or aggregates, allocators, or Null, they are ambiguous even -- though they carry a single (universal) type. Diagnose this case here. procedure Resolve_Equality_Op (N : Node_Id; Typ : Entity_Id) is L : constant Node_Id := Left_Opnd (N); R : constant Node_Id := Right_Opnd (N); T : Entity_Id := Find_Unique_Type (L, R); procedure Check_If_Expression (Cond : Node_Id); -- The resolution rule for if expressions requires that each such must -- have a unique type. This means that if several dependent expressions -- are of a non-null anonymous access type, and the context does not -- impose an expected type (as can be the case in an equality operation) -- the expression must be rejected. procedure Explain_Redundancy (N : Node_Id); -- Attempt to explain the nature of a redundant comparison with True. If -- the expression N is too complex, this routine issues a general error -- message. function Find_Unique_Access_Type return Entity_Id; -- In the case of allocators and access attributes, the context must -- provide an indication of the specific access type to be used. If -- one operand is of such a "generic" access type, check whether there -- is a specific visible access type that has the same designated type. -- This is semantically dubious, and of no interest to any real code, -- but c48008a makes it all worthwhile. ------------------------- -- Check_If_Expression -- ------------------------- procedure Check_If_Expression (Cond : Node_Id) is Then_Expr : Node_Id; Else_Expr : Node_Id; begin if Nkind (Cond) = N_If_Expression then Then_Expr := Next (First (Expressions (Cond))); Else_Expr := Next (Then_Expr); if Nkind (Then_Expr) /= N_Null and then Nkind (Else_Expr) /= N_Null then Error_Msg_N ("cannot determine type of if expression", Cond); end if; end if; end Check_If_Expression; ------------------------ -- Explain_Redundancy -- ------------------------ procedure Explain_Redundancy (N : Node_Id) is Error : Name_Id; Val : Node_Id; Val_Id : Entity_Id; begin Val := N; -- Strip the operand down to an entity loop if Nkind (Val) = N_Selected_Component then Val := Selector_Name (Val); else exit; end if; end loop; -- The construct denotes an entity if Is_Entity_Name (Val) and then Present (Entity (Val)) then Val_Id := Entity (Val); -- Do not generate an error message when the comparison is done -- against the enumeration literal Standard.True. if Ekind (Val_Id) /= E_Enumeration_Literal then -- Build a customized error message Name_Len := 0; Add_Str_To_Name_Buffer ("?r?"); if Ekind (Val_Id) = E_Component then Add_Str_To_Name_Buffer ("component "); elsif Ekind (Val_Id) = E_Constant then Add_Str_To_Name_Buffer ("constant "); elsif Ekind (Val_Id) = E_Discriminant then Add_Str_To_Name_Buffer ("discriminant "); elsif Is_Formal (Val_Id) then Add_Str_To_Name_Buffer ("parameter "); elsif Ekind (Val_Id) = E_Variable then Add_Str_To_Name_Buffer ("variable "); end if; Add_Str_To_Name_Buffer ("& is always True!"); Error := Name_Find; Error_Msg_NE (Get_Name_String (Error), Val, Val_Id); end if; -- The construct is too complex to disect, issue a general message else Error_Msg_N ("?r?expression is always True!", Val); end if; end Explain_Redundancy; ----------------------------- -- Find_Unique_Access_Type -- ----------------------------- function Find_Unique_Access_Type return Entity_Id is Acc : Entity_Id; E : Entity_Id; S : Entity_Id; begin if Ekind (Etype (R)) in E_Allocator_Type | E_Access_Attribute_Type then Acc := Designated_Type (Etype (R)); elsif Ekind (Etype (L)) in E_Allocator_Type | E_Access_Attribute_Type then Acc := Designated_Type (Etype (L)); else return Empty; end if; S := Current_Scope; while S /= Standard_Standard loop E := First_Entity (S); while Present (E) loop if Is_Type (E) and then Is_Access_Type (E) and then Ekind (E) /= E_Allocator_Type and then Designated_Type (E) = Base_Type (Acc) then return E; end if; Next_Entity (E); end loop; S := Scope (S); end loop; return Empty; end Find_Unique_Access_Type; -- Start of processing for Resolve_Equality_Op begin Set_Etype (N, Base_Type (Typ)); Generate_Reference (T, N, ' '); if T = Any_Fixed then T := Unique_Fixed_Point_Type (L); end if; if T /= Any_Type then if T = Any_String or else T = Any_Composite or else T = Any_Character then if T = Any_Character then Ambiguous_Character (L); else Error_Msg_N ("ambiguous operands for equality", N); end if; Set_Etype (N, Any_Type); return; elsif T = Any_Access or else Ekind (T) in E_Allocator_Type | E_Access_Attribute_Type then T := Find_Unique_Access_Type; if No (T) then Error_Msg_N ("ambiguous operands for equality", N); Set_Etype (N, Any_Type); return; end if; -- If expressions must have a single type, and if the context does -- not impose one the dependent expressions cannot be anonymous -- access types. -- Why no similar processing for case expressions??? elsif Ada_Version >= Ada_2012 and then Is_Anonymous_Access_Type (Etype (L)) and then Is_Anonymous_Access_Type (Etype (R)) then Check_If_Expression (L); Check_If_Expression (R); end if; Resolve (L, T); Resolve (R, T); -- If the unique type is a class-wide type then it will be expanded -- into a dispatching call to the predefined primitive. Therefore we -- check here for potential violation of such restriction. if Is_Class_Wide_Type (T) then Check_Restriction (No_Dispatching_Calls, N); end if; -- Only warn for redundant equality comparison to True for objects -- (e.g. "X = True") and operations (e.g. "(X < Y) = True"). For -- other expressions, it may be a matter of preference to write -- "Expr = True" or "Expr". if Warn_On_Redundant_Constructs and then Comes_From_Source (N) and then Comes_From_Source (R) and then Is_Entity_Name (R) and then Entity (R) = Standard_True and then ((Is_Entity_Name (L) and then Is_Object (Entity (L))) or else Nkind (L) in N_Op) then Error_Msg_N -- CODEFIX ("?r?comparison with True is redundant!", N); Explain_Redundancy (Original_Node (R)); end if; -- If the equality is overloaded and the operands have resolved -- properly, set the proper equality operator on the node. The -- current setting is the first one found during analysis, which -- is not necessarily the one to which the node has resolved. if Is_Overloaded (N) then declare I : Interp_Index; It : Interp; begin Get_First_Interp (N, I, It); -- If the equality is user-defined, the type of the operands -- matches that of the formals. For a predefined operator, -- it is the scope that matters, given that the predefined -- equality has Any_Type formals. In either case the result -- type (most often Boolean) must match the context. The scope -- is either that of the type, if there is a generated equality -- (when there is an equality for the component type), or else -- Standard otherwise. while Present (It.Typ) loop if Etype (It.Nam) = Typ and then (Etype (First_Entity (It.Nam)) = Etype (L) or else Scope (It.Nam) = Standard_Standard or else Scope (It.Nam) = Scope (T)) then Set_Entity (N, It.Nam); Set_Is_Overloaded (N, False); exit; end if; Get_Next_Interp (I, It); end loop; -- If expansion is active and this is an inherited operation, -- replace it with its ancestor. This must not be done during -- preanalysis because the type may not be frozen yet, as when -- the context is a precondition or postcondition. if Present (Alias (Entity (N))) and then Expander_Active then Set_Entity (N, Alias (Entity (N))); end if; end; end if; Check_Unset_Reference (L); Check_Unset_Reference (R); Generate_Operator_Reference (N, T); Check_Low_Bound_Tested (N); -- If this is an inequality, it may be the implicit inequality -- created for a user-defined operation, in which case the corres- -- ponding equality operation is not intrinsic, and the operation -- cannot be constant-folded. Else fold. if Nkind (N) = N_Op_Eq or else Comes_From_Source (Entity (N)) or else Ekind (Entity (N)) = E_Operator or else Is_Intrinsic_Subprogram (Corresponding_Equality (Entity (N))) then Analyze_Dimension (N); Eval_Relational_Op (N); elsif Nkind (N) = N_Op_Ne and then Is_Abstract_Subprogram (Entity (N)) then Error_Msg_NE ("cannot call abstract subprogram &!", N, Entity (N)); end if; -- Ada 2005: If one operand is an anonymous access type, convert the -- other operand to it, to ensure that the underlying types match in -- the back-end. Same for access_to_subprogram, and the conversion -- verifies that the types are subtype conformant. -- We apply the same conversion in the case one of the operands is a -- private subtype of the type of the other. -- Why the Expander_Active test here ??? if Expander_Active and then (Ekind (T) in E_Anonymous_Access_Type | E_Anonymous_Access_Subprogram_Type or else Is_Private_Type (T)) then if Etype (L) /= T then Rewrite (L, Make_Unchecked_Type_Conversion (Sloc (L), Subtype_Mark => New_Occurrence_Of (T, Sloc (L)), Expression => Relocate_Node (L))); Analyze_And_Resolve (L, T); end if; if (Etype (R)) /= T then Rewrite (R, Make_Unchecked_Type_Conversion (Sloc (R), Subtype_Mark => New_Occurrence_Of (Etype (L), Sloc (R)), Expression => Relocate_Node (R))); Analyze_And_Resolve (R, T); end if; end if; end if; end Resolve_Equality_Op; ---------------------------------- -- Resolve_Explicit_Dereference -- ---------------------------------- procedure Resolve_Explicit_Dereference (N : Node_Id; Typ : Entity_Id) is Loc : constant Source_Ptr := Sloc (N); New_N : Node_Id; P : constant Node_Id := Prefix (N); P_Typ : Entity_Id; -- The candidate prefix type, if overloaded I : Interp_Index; It : Interp; begin Check_Fully_Declared_Prefix (Typ, P); P_Typ := Empty; -- A useful optimization: check whether the dereference denotes an -- element of a container, and if so rewrite it as a call to the -- corresponding Element function. -- Disabled for now, on advice of ARG. A more restricted form of the -- predicate might be acceptable ??? -- if Is_Container_Element (N) then -- return; -- end if; if Is_Overloaded (P) then -- Use the context type to select the prefix that has the correct -- designated type. Keep the first match, which will be the inner- -- most. Get_First_Interp (P, I, It); while Present (It.Typ) loop if Is_Access_Type (It.Typ) and then Covers (Typ, Designated_Type (It.Typ)) then if No (P_Typ) then P_Typ := It.Typ; end if; -- Remove access types that do not match, but preserve access -- to subprogram interpretations, in case a further dereference -- is needed (see below). elsif Ekind (It.Typ) /= E_Access_Subprogram_Type then Remove_Interp (I); end if; Get_Next_Interp (I, It); end loop; if Present (P_Typ) then Resolve (P, P_Typ); Set_Etype (N, Designated_Type (P_Typ)); else -- If no interpretation covers the designated type of the prefix, -- this is the pathological case where not all implementations of -- the prefix allow the interpretation of the node as a call. Now -- that the expected type is known, Remove other interpretations -- from prefix, rewrite it as a call, and resolve again, so that -- the proper call node is generated. Get_First_Interp (P, I, It); while Present (It.Typ) loop if Ekind (It.Typ) /= E_Access_Subprogram_Type then Remove_Interp (I); end if; Get_Next_Interp (I, It); end loop; New_N := Make_Function_Call (Loc, Name => Make_Explicit_Dereference (Loc, Prefix => P), Parameter_Associations => New_List); Save_Interps (N, New_N); Rewrite (N, New_N); Analyze_And_Resolve (N, Typ); return; end if; -- If not overloaded, resolve P with its own type else Resolve (P); end if; -- If the prefix might be null, add an access check if Is_Access_Type (Etype (P)) and then not Can_Never_Be_Null (Etype (P)) then Apply_Access_Check (N); end if; -- If the designated type is a packed unconstrained array type, and the -- explicit dereference is not in the context of an attribute reference, -- then we must compute and set the actual subtype, since it is needed -- by Gigi. The reason we exclude the attribute case is that this is -- handled fine by Gigi, and in fact we use such attributes to build the -- actual subtype. We also exclude generated code (which builds actual -- subtypes directly if they are needed). if Is_Array_Type (Etype (N)) and then Is_Packed (Etype (N)) and then not Is_Constrained (Etype (N)) and then Nkind (Parent (N)) /= N_Attribute_Reference and then Comes_From_Source (N) then Set_Etype (N, Get_Actual_Subtype (N)); end if; Analyze_Dimension (N); -- Note: No Eval processing is required for an explicit dereference, -- because such a name can never be static. end Resolve_Explicit_Dereference; ------------------------------------- -- Resolve_Expression_With_Actions -- ------------------------------------- procedure Resolve_Expression_With_Actions (N : Node_Id; Typ : Entity_Id) is function OK_For_Static (Act : Node_Id) return Boolean; -- True if Act is an action of a declare_expression that is allowed in a -- static declare_expression. function All_OK_For_Static return Boolean; -- True if all actions of N are allowed in a static declare_expression. function Get_Literal (Expr : Node_Id) return Node_Id; -- Expr is an expression with compile-time-known value. This returns the -- literal node that reprsents that value. function OK_For_Static (Act : Node_Id) return Boolean is begin case Nkind (Act) is when N_Object_Declaration => if Constant_Present (Act) and then Is_Static_Expression (Expression (Act)) then return True; end if; when N_Object_Renaming_Declaration => if Statically_Names_Object (Name (Act)) then return True; end if; when others => -- No other declarations, nor even pragmas, are allowed in a -- declare expression, so if we see something else, it must be -- an internally generated expression_with_actions. null; end case; return False; end OK_For_Static; function All_OK_For_Static return Boolean is Act : Node_Id := First (Actions (N)); begin while Present (Act) loop if not OK_For_Static (Act) then return False; end if; Next (Act); end loop; return True; end All_OK_For_Static; function Get_Literal (Expr : Node_Id) return Node_Id is pragma Assert (Compile_Time_Known_Value (Expr)); Result : Node_Id; begin case Nkind (Expr) is when N_Has_Entity => if Ekind (Entity (Expr)) = E_Enumeration_Literal then Result := Expr; else Result := Constant_Value (Entity (Expr)); end if; when N_Numeric_Or_String_Literal => Result := Expr; when others => raise Program_Error; end case; pragma Assert (Nkind (Result) in N_Numeric_Or_String_Literal or else Ekind (Entity (Result)) = E_Enumeration_Literal); return Result; end Get_Literal; Loc : constant Source_Ptr := Sloc (N); begin Set_Etype (N, Typ); if Is_Empty_List (Actions (N)) then pragma Assert (All_OK_For_Static); null; end if; -- If the value of the expression is known at compile time, and all -- of the actions (if any) are suitable, then replace the declare -- expression with its expression. This allows the declare expression -- as a whole to be static if appropriate. See AI12-0368. if Compile_Time_Known_Value (Expression (N)) then if Is_Empty_List (Actions (N)) then Rewrite (N, Expression (N)); elsif All_OK_For_Static then Rewrite (N, New_Copy_Tree (Get_Literal (Expression (N)), New_Sloc => Loc)); end if; end if; end Resolve_Expression_With_Actions; ---------------------------------- -- Resolve_Generalized_Indexing -- ---------------------------------- procedure Resolve_Generalized_Indexing (N : Node_Id; Typ : Entity_Id) is Indexing : constant Node_Id := Generalized_Indexing (N); begin Rewrite (N, Indexing); Resolve (N, Typ); end Resolve_Generalized_Indexing; --------------------------- -- Resolve_If_Expression -- --------------------------- procedure Resolve_If_Expression (N : Node_Id; Typ : Entity_Id) is procedure Apply_Check (Expr : Node_Id); -- When a dependent expression is of a subtype different from -- the context subtype, then insert a qualification to ensure -- the generation of a constraint check. This was previously -- for scalar types. For array types apply a length check, given -- that the context in general allows sliding, while a qualified -- expression forces equality of bounds. ----------------- -- Apply_Check -- ----------------- procedure Apply_Check (Expr : Node_Id) is Expr_Typ : constant Entity_Id := Etype (Expr); Loc : constant Source_Ptr := Sloc (Expr); begin if Expr_Typ = Typ or else Is_Tagged_Type (Typ) or else Is_Access_Type (Typ) or else not Is_Constrained (Typ) or else Inside_A_Generic then null; elsif Is_Array_Type (Typ) then Apply_Length_Check (Expr, Typ); else Rewrite (Expr, Make_Qualified_Expression (Loc, Subtype_Mark => New_Occurrence_Of (Typ, Loc), Expression => Relocate_Node (Expr))); Analyze_And_Resolve (Expr, Typ); end if; end Apply_Check; -- Local variables Condition : constant Node_Id := First (Expressions (N)); Else_Expr : Node_Id; Then_Expr : Node_Id; -- Start of processing for Resolve_If_Expression begin -- Defend against malformed expressions if No (Condition) then return; end if; Then_Expr := Next (Condition); if No (Then_Expr) then return; end if; Else_Expr := Next (Then_Expr); Resolve (Condition, Any_Boolean); Resolve (Then_Expr, Typ); Apply_Check (Then_Expr); -- If ELSE expression present, just resolve using the determined type -- If type is universal, resolve to any member of the class. if Present (Else_Expr) then if Typ = Universal_Integer then Resolve (Else_Expr, Any_Integer); elsif Typ = Universal_Real then Resolve (Else_Expr, Any_Real); else Resolve (Else_Expr, Typ); end if; Apply_Check (Else_Expr); -- Apply RM 4.5.7 (17/3): whether the expression is statically or -- dynamically tagged must be known statically. if Is_Tagged_Type (Typ) and then not Is_Class_Wide_Type (Typ) then if Is_Dynamically_Tagged (Then_Expr) /= Is_Dynamically_Tagged (Else_Expr) then Error_Msg_N ("all or none of the dependent expressions " & "can be dynamically tagged", N); end if; end if; -- If no ELSE expression is present, root type must be Standard.Boolean -- and we provide a Standard.True result converted to the appropriate -- Boolean type (in case it is a derived boolean type). elsif Root_Type (Typ) = Standard_Boolean then Else_Expr := Convert_To (Typ, New_Occurrence_Of (Standard_True, Sloc (N))); Analyze_And_Resolve (Else_Expr, Typ); Append_To (Expressions (N), Else_Expr); else Error_Msg_N ("can only omit ELSE expression in Boolean case", N); Append_To (Expressions (N), Error); end if; Set_Etype (N, Typ); if not Error_Posted (N) then Eval_If_Expression (N); end if; Analyze_Dimension (N); end Resolve_If_Expression; ---------------------------------- -- Resolve_Implicit_Dereference -- ---------------------------------- procedure Resolve_Implicit_Dereference (P : Node_Id) is Desig_Typ : Entity_Id; begin -- In an instance the proper view may not always be correct for -- private types, see e.g. Sem_Type.Covers for similar handling. if Is_Private_Type (Etype (P)) and then Present (Full_View (Etype (P))) and then Is_Access_Type (Full_View (Etype (P))) and then In_Instance then Set_Etype (P, Full_View (Etype (P))); end if; if Is_Access_Type (Etype (P)) then Desig_Typ := Implicitly_Designated_Type (Etype (P)); Insert_Explicit_Dereference (P); Analyze_And_Resolve (P, Desig_Typ); end if; end Resolve_Implicit_Dereference; ------------------------------- -- Resolve_Indexed_Component -- ------------------------------- procedure Resolve_Indexed_Component (N : Node_Id; Typ : Entity_Id) is Name : constant Node_Id := Prefix (N); Expr : Node_Id; Array_Type : Entity_Id := Empty; -- to prevent junk warning Index : Node_Id; begin if Present (Generalized_Indexing (N)) then Resolve_Generalized_Indexing (N, Typ); return; end if; if Is_Overloaded (Name) then -- Use the context type to select the prefix that yields the correct -- component type. declare I : Interp_Index; It : Interp; I1 : Interp_Index := 0; P : constant Node_Id := Prefix (N); Found : Boolean := False; begin Get_First_Interp (P, I, It); while Present (It.Typ) loop if (Is_Array_Type (It.Typ) and then Covers (Typ, Component_Type (It.Typ))) or else (Is_Access_Type (It.Typ) and then Is_Array_Type (Designated_Type (It.Typ)) and then Covers (Typ, Component_Type (Designated_Type (It.Typ)))) then if Found then It := Disambiguate (P, I1, I, Any_Type); if It = No_Interp then Error_Msg_N ("ambiguous prefix for indexing", N); Set_Etype (N, Typ); return; else Found := True; Array_Type := It.Typ; I1 := I; end if; else Found := True; Array_Type := It.Typ; I1 := I; end if; end if; Get_Next_Interp (I, It); end loop; end; else Array_Type := Etype (Name); end if; Resolve (Name, Array_Type); Array_Type := Get_Actual_Subtype_If_Available (Name); -- If the prefix's type is an access type, get to the real array type. -- Note: we do not apply an access check because an explicit dereference -- will be introduced later, and the check will happen there. if Is_Access_Type (Array_Type) then Array_Type := Implicitly_Designated_Type (Array_Type); end if; -- If name was overloaded, set component type correctly now. -- If a misplaced call to an entry family (which has no index types) -- return. Error will be diagnosed from calling context. if Is_Array_Type (Array_Type) then Set_Etype (N, Component_Type (Array_Type)); else return; end if; Index := First_Index (Array_Type); Expr := First (Expressions (N)); -- The prefix may have resolved to a string literal, in which case its -- etype has a special representation. This is only possible currently -- if the prefix is a static concatenation, written in functional -- notation. if Ekind (Array_Type) = E_String_Literal_Subtype then Resolve (Expr, Standard_Positive); else while Present (Index) and then Present (Expr) loop Resolve (Expr, Etype (Index)); Check_Unset_Reference (Expr); Apply_Scalar_Range_Check (Expr, Etype (Index)); Next_Index (Index); Next (Expr); end loop; end if; Resolve_Implicit_Dereference (Prefix (N)); Analyze_Dimension (N); -- Do not generate the warning on suspicious index if we are analyzing -- package Ada.Tags; otherwise we will report the warning with the -- Prims_Ptr field of the dispatch table. if Scope (Etype (Prefix (N))) = Standard_Standard or else not Is_RTU (Cunit_Entity (Get_Source_Unit (Etype (Prefix (N)))), Ada_Tags) then Warn_On_Suspicious_Index (Name, First (Expressions (N))); Eval_Indexed_Component (N); end if; -- If the array type is atomic and the component is not, then this is -- worth a warning before Ada 2020, since we have a situation where the -- access to the component may cause extra read/writes of the atomic -- object, or partial word accesses, both of which may be unexpected. if Nkind (N) = N_Indexed_Component and then Is_Atomic_Ref_With_Address (N) and then not (Has_Atomic_Components (Array_Type) or else (Is_Entity_Name (Prefix (N)) and then Has_Atomic_Components (Entity (Prefix (N))))) and then not Is_Atomic (Component_Type (Array_Type)) and then Ada_Version < Ada_2020 then Error_Msg_N ("??access to non-atomic component of atomic array", Prefix (N)); Error_Msg_N ("??\may cause unexpected accesses to atomic object", Prefix (N)); end if; end Resolve_Indexed_Component; ----------------------------- -- Resolve_Integer_Literal -- ----------------------------- procedure Resolve_Integer_Literal (N : Node_Id; Typ : Entity_Id) is begin Set_Etype (N, Typ); Eval_Integer_Literal (N); end Resolve_Integer_Literal; -------------------------------- -- Resolve_Intrinsic_Operator -- -------------------------------- procedure Resolve_Intrinsic_Operator (N : Node_Id; Typ : Entity_Id) is Btyp : constant Entity_Id := Base_Type (Underlying_Type (Typ)); Op : Entity_Id; Arg1 : Node_Id; Arg2 : Node_Id; function Convert_Operand (Opnd : Node_Id) return Node_Id; -- If the operand is a literal, it cannot be the expression in a -- conversion. Use a qualified expression instead. --------------------- -- Convert_Operand -- --------------------- function Convert_Operand (Opnd : Node_Id) return Node_Id is Loc : constant Source_Ptr := Sloc (Opnd); Res : Node_Id; begin if Nkind (Opnd) in N_Integer_Literal | N_Real_Literal then Res := Make_Qualified_Expression (Loc, Subtype_Mark => New_Occurrence_Of (Btyp, Loc), Expression => Relocate_Node (Opnd)); Analyze (Res); else Res := Unchecked_Convert_To (Btyp, Opnd); end if; return Res; end Convert_Operand; -- Start of processing for Resolve_Intrinsic_Operator begin -- We must preserve the original entity in a generic setting, so that -- the legality of the operation can be verified in an instance. if not Expander_Active then return; end if; Op := Entity (N); while Scope (Op) /= Standard_Standard loop Op := Homonym (Op); pragma Assert (Present (Op)); end loop; Set_Entity (N, Op); Set_Is_Overloaded (N, False); -- If the result or operand types are private, rewrite with unchecked -- conversions on the operands and the result, to expose the proper -- underlying numeric type. if Is_Private_Type (Typ) or else Is_Private_Type (Etype (Left_Opnd (N))) or else Is_Private_Type (Etype (Right_Opnd (N))) then Arg1 := Convert_Operand (Left_Opnd (N)); if Nkind (N) = N_Op_Expon then Arg2 := Unchecked_Convert_To (Standard_Integer, Right_Opnd (N)); else Arg2 := Convert_Operand (Right_Opnd (N)); end if; if Nkind (Arg1) = N_Type_Conversion then Save_Interps (Left_Opnd (N), Expression (Arg1)); end if; if Nkind (Arg2) = N_Type_Conversion then Save_Interps (Right_Opnd (N), Expression (Arg2)); end if; Set_Left_Opnd (N, Arg1); Set_Right_Opnd (N, Arg2); Set_Etype (N, Btyp); Rewrite (N, Unchecked_Convert_To (Typ, N)); Resolve (N, Typ); elsif Typ /= Etype (Left_Opnd (N)) or else Typ /= Etype (Right_Opnd (N)) then -- Add explicit conversion where needed, and save interpretations in -- case operands are overloaded. Arg1 := Convert_To (Typ, Left_Opnd (N)); Arg2 := Convert_To (Typ, Right_Opnd (N)); if Nkind (Arg1) = N_Type_Conversion then Save_Interps (Left_Opnd (N), Expression (Arg1)); else Save_Interps (Left_Opnd (N), Arg1); end if; if Nkind (Arg2) = N_Type_Conversion then Save_Interps (Right_Opnd (N), Expression (Arg2)); else Save_Interps (Right_Opnd (N), Arg2); end if; Rewrite (Left_Opnd (N), Arg1); Rewrite (Right_Opnd (N), Arg2); Analyze (Arg1); Analyze (Arg2); Resolve_Arithmetic_Op (N, Typ); else Resolve_Arithmetic_Op (N, Typ); end if; end Resolve_Intrinsic_Operator; -------------------------------------- -- Resolve_Intrinsic_Unary_Operator -- -------------------------------------- procedure Resolve_Intrinsic_Unary_Operator (N : Node_Id; Typ : Entity_Id) is Btyp : constant Entity_Id := Base_Type (Underlying_Type (Typ)); Op : Entity_Id; Arg2 : Node_Id; begin Op := Entity (N); while Scope (Op) /= Standard_Standard loop Op := Homonym (Op); pragma Assert (Present (Op)); end loop; Set_Entity (N, Op); if Is_Private_Type (Typ) then Arg2 := Unchecked_Convert_To (Btyp, Right_Opnd (N)); Save_Interps (Right_Opnd (N), Expression (Arg2)); Set_Right_Opnd (N, Arg2); Set_Etype (N, Btyp); Rewrite (N, Unchecked_Convert_To (Typ, N)); Resolve (N, Typ); else Resolve_Unary_Op (N, Typ); end if; end Resolve_Intrinsic_Unary_Operator; ------------------------ -- Resolve_Logical_Op -- ------------------------ procedure Resolve_Logical_Op (N : Node_Id; Typ : Entity_Id) is B_Typ : Entity_Id; begin Check_No_Direct_Boolean_Operators (N); -- Predefined operations on scalar types yield the base type. On the -- other hand, logical operations on arrays yield the type of the -- arguments (and the context). if Is_Array_Type (Typ) then B_Typ := Typ; else B_Typ := Base_Type (Typ); end if; -- The following test is required because the operands of the operation -- may be literals, in which case the resulting type appears to be -- compatible with a signed integer type, when in fact it is compatible -- only with modular types. If the context itself is universal, the -- operation is illegal. if not Valid_Boolean_Arg (Typ) then Error_Msg_N ("invalid context for logical operation", N); Set_Etype (N, Any_Type); return; elsif Typ = Any_Modular then Error_Msg_N ("no modular type available in this context", N); Set_Etype (N, Any_Type); return; elsif Is_Modular_Integer_Type (Typ) and then Etype (Left_Opnd (N)) = Universal_Integer and then Etype (Right_Opnd (N)) = Universal_Integer then Check_For_Visible_Operator (N, B_Typ); end if; -- Replace AND by AND THEN, or OR by OR ELSE, if Short_Circuit_And_Or -- is active and the result type is standard Boolean (do not mess with -- ops that return a nonstandard Boolean type, because something strange -- is going on). -- Note: you might expect this replacement to be done during expansion, -- but that doesn't work, because when the pragma Short_Circuit_And_Or -- is used, no part of the right operand of an "and" or "or" operator -- should be executed if the left operand would short-circuit the -- evaluation of the corresponding "and then" or "or else". If we left -- the replacement to expansion time, then run-time checks associated -- with such operands would be evaluated unconditionally, due to being -- before the condition prior to the rewriting as short-circuit forms -- during expansion. if Short_Circuit_And_Or and then B_Typ = Standard_Boolean and then Nkind (N) in N_Op_And | N_Op_Or then -- Mark the corresponding putative SCO operator as truly a logical -- (and short-circuit) operator. if Generate_SCO and then Comes_From_Source (N) then Set_SCO_Logical_Operator (N); end if; if Nkind (N) = N_Op_And then Rewrite (N, Make_And_Then (Sloc (N), Left_Opnd => Relocate_Node (Left_Opnd (N)), Right_Opnd => Relocate_Node (Right_Opnd (N)))); Analyze_And_Resolve (N, B_Typ); -- Case of OR changed to OR ELSE else Rewrite (N, Make_Or_Else (Sloc (N), Left_Opnd => Relocate_Node (Left_Opnd (N)), Right_Opnd => Relocate_Node (Right_Opnd (N)))); Analyze_And_Resolve (N, B_Typ); end if; -- Return now, since analysis of the rewritten ops will take care of -- other reference bookkeeping and expression folding. return; end if; Resolve (Left_Opnd (N), B_Typ); Resolve (Right_Opnd (N), B_Typ); Check_Unset_Reference (Left_Opnd (N)); Check_Unset_Reference (Right_Opnd (N)); Set_Etype (N, B_Typ); Generate_Operator_Reference (N, B_Typ); Eval_Logical_Op (N); end Resolve_Logical_Op; --------------------------- -- Resolve_Membership_Op -- --------------------------- -- The context can only be a boolean type, and does not determine the -- arguments. Arguments should be unambiguous, but the preference rule for -- universal types applies. procedure Resolve_Membership_Op (N : Node_Id; Typ : Entity_Id) is pragma Warnings (Off, Typ); L : constant Node_Id := Left_Opnd (N); R : constant Node_Id := Right_Opnd (N); T : Entity_Id; procedure Resolve_Set_Membership; -- Analysis has determined a unique type for the left operand. Use it as -- the basis to resolve the disjuncts. ---------------------------- -- Resolve_Set_Membership -- ---------------------------- procedure Resolve_Set_Membership is Alt : Node_Id; begin -- If the left operand is overloaded, find type compatible with not -- overloaded alternative of the right operand. Alt := First (Alternatives (N)); if Is_Overloaded (L) then T := Empty; while Present (Alt) loop if not Is_Overloaded (Alt) then T := Intersect_Types (L, Alt); exit; else Next (Alt); end if; end loop; -- Unclear how to resolve expression if all alternatives are also -- overloaded. if No (T) then Error_Msg_N ("ambiguous expression", N); end if; else T := Intersect_Types (L, Alt); end if; Resolve (L, T); Alt := First (Alternatives (N)); while Present (Alt) loop -- Alternative is an expression, a range -- or a subtype mark. if not Is_Entity_Name (Alt) or else not Is_Type (Entity (Alt)) then Resolve (Alt, T); end if; Next (Alt); end loop; -- Check for duplicates for discrete case if Is_Discrete_Type (T) then declare type Ent is record Alt : Node_Id; Val : Uint; end record; Alts : array (0 .. List_Length (Alternatives (N))) of Ent; Nalts : Nat; begin -- Loop checking duplicates. This is quadratic, but giant sets -- are unlikely in this context so it's a reasonable choice. Nalts := 0; Alt := First (Alternatives (N)); while Present (Alt) loop if Is_OK_Static_Expression (Alt) and then Nkind (Alt) in N_Integer_Literal | N_Character_Literal | N_Has_Entity then Nalts := Nalts + 1; Alts (Nalts) := (Alt, Expr_Value (Alt)); for J in 1 .. Nalts - 1 loop if Alts (J).Val = Alts (Nalts).Val then Error_Msg_Sloc := Sloc (Alts (J).Alt); Error_Msg_N ("duplicate of value given#??", Alt); end if; end loop; end if; Next (Alt); end loop; end; end if; -- RM 4.5.2 (28.1/3) specifies that for types other than records or -- limited types, evaluation of a membership test uses the predefined -- equality for the type. This may be confusing to users, and the -- following warning appears useful for the most common case. if Is_Scalar_Type (Etype (L)) and then Present (Get_User_Defined_Eq (Etype (L))) then Error_Msg_NE ("membership test on& uses predefined equality?", N, Etype (L)); Error_Msg_N ("\even if user-defined equality exists (RM 4.5.2 (28.1/3)?", N); end if; end Resolve_Set_Membership; -- Start of processing for Resolve_Membership_Op begin if L = Error or else R = Error then return; end if; if Present (Alternatives (N)) then Resolve_Set_Membership; goto SM_Exit; elsif not Is_Overloaded (R) and then (Etype (R) = Universal_Integer or else Etype (R) = Universal_Real) and then Is_Overloaded (L) then T := Etype (R); -- Ada 2005 (AI-251): Support the following case: -- type I is interface; -- type T is tagged ... -- function Test (O : I'Class) is -- begin -- return O in T'Class. -- end Test; -- In this case we have nothing else to do. The membership test will be -- done at run time. elsif Ada_Version >= Ada_2005 and then Is_Class_Wide_Type (Etype (L)) and then Is_Interface (Etype (L)) and then not Is_Interface (Etype (R)) then return; else T := Intersect_Types (L, R); end if; -- If mixed-mode operations are present and operands are all literal, -- the only interpretation involves Duration, which is probably not -- the intention of the programmer. if T = Any_Fixed then T := Unique_Fixed_Point_Type (N); if T = Any_Type then return; end if; end if; Resolve (L, T); Check_Unset_Reference (L); if Nkind (R) = N_Range and then not Is_Scalar_Type (T) then Error_Msg_N ("scalar type required for range", R); end if; if Is_Entity_Name (R) then Freeze_Expression (R); else Resolve (R, T); Check_Unset_Reference (R); end if; -- Here after resolving membership operation <<SM_Exit>> Eval_Membership_Op (N); end Resolve_Membership_Op; ------------------ -- Resolve_Null -- ------------------ procedure Resolve_Null (N : Node_Id; Typ : Entity_Id) is Loc : constant Source_Ptr := Sloc (N); begin -- Handle restriction against anonymous null access values This -- restriction can be turned off using -gnatdj. -- Ada 2005 (AI-231): Remove restriction if Ada_Version < Ada_2005 and then not Debug_Flag_J and then Ekind (Typ) = E_Anonymous_Access_Type and then Comes_From_Source (N) then -- In the common case of a call which uses an explicitly null value -- for an access parameter, give specialized error message. if Nkind (Parent (N)) in N_Subprogram_Call then Error_Msg_N ("null is not allowed as argument for an access parameter", N); -- Standard message for all other cases (are there any?) else Error_Msg_N ("null cannot be of an anonymous access type", N); end if; end if; -- Ada 2005 (AI-231): Generate the null-excluding check in case of -- assignment to a null-excluding object. if Ada_Version >= Ada_2005 and then Can_Never_Be_Null (Typ) and then Nkind (Parent (N)) = N_Assignment_Statement then if Inside_Init_Proc then -- Decide whether to generate an if_statement around our -- null-excluding check to avoid them on certain internal object -- declarations by looking at the type the current Init_Proc -- belongs to. -- Generate: -- if T1b_skip_null_excluding_check then -- [constraint_error "access check failed"] -- end if; if Needs_Conditional_Null_Excluding_Check (Etype (First_Formal (Enclosing_Init_Proc))) then Insert_Action (N, Make_If_Statement (Loc, Condition => Make_Identifier (Loc, New_External_Name (Chars (Typ), "_skip_null_excluding_check")), Then_Statements => New_List ( Make_Raise_Constraint_Error (Loc, Reason => CE_Access_Check_Failed)))); -- Otherwise, simply create the check else Insert_Action (N, Make_Raise_Constraint_Error (Loc, Reason => CE_Access_Check_Failed)); end if; else Insert_Action (Compile_Time_Constraint_Error (N, "(Ada 2005) null not allowed in null-excluding objects??"), Make_Raise_Constraint_Error (Loc, Reason => CE_Access_Check_Failed)); end if; end if; -- In a distributed context, null for a remote access to subprogram may -- need to be replaced with a special record aggregate. In this case, -- return after having done the transformation. if (Ekind (Typ) = E_Record_Type or else Is_Remote_Access_To_Subprogram_Type (Typ)) and then Remote_AST_Null_Value (N, Typ) then return; end if; -- The null literal takes its type from the context Set_Etype (N, Typ); end Resolve_Null; ----------------------- -- Resolve_Op_Concat -- ----------------------- procedure Resolve_Op_Concat (N : Node_Id; Typ : Entity_Id) is -- We wish to avoid deep recursion, because concatenations are often -- deeply nested, as in A&B&...&Z. Therefore, we walk down the left -- operands nonrecursively until we find something that is not a simple -- concatenation (A in this case). We resolve that, and then walk back -- up the tree following Parent pointers, calling Resolve_Op_Concat_Rest -- to do the rest of the work at each level. The Parent pointers allow -- us to avoid recursion, and thus avoid running out of memory. See also -- Sem_Ch4.Analyze_Concatenation, where a similar approach is used. NN : Node_Id := N; Op1 : Node_Id; begin -- The following code is equivalent to: -- Resolve_Op_Concat_First (NN, Typ); -- Resolve_Op_Concat_Arg (N, ...); -- Resolve_Op_Concat_Rest (N, Typ); -- where the Resolve_Op_Concat_Arg call recurses back here if the left -- operand is a concatenation. -- Walk down left operands loop Resolve_Op_Concat_First (NN, Typ); Op1 := Left_Opnd (NN); exit when not (Nkind (Op1) = N_Op_Concat and then not Is_Array_Type (Component_Type (Typ)) and then Entity (Op1) = Entity (NN)); NN := Op1; end loop; -- Now (given the above example) NN is A&B and Op1 is A -- First resolve Op1 ... Resolve_Op_Concat_Arg (NN, Op1, Typ, Is_Component_Left_Opnd (NN)); -- ... then walk NN back up until we reach N (where we started), calling -- Resolve_Op_Concat_Rest along the way. loop Resolve_Op_Concat_Rest (NN, Typ); exit when NN = N; NN := Parent (NN); end loop; end Resolve_Op_Concat; --------------------------- -- Resolve_Op_Concat_Arg -- --------------------------- procedure Resolve_Op_Concat_Arg (N : Node_Id; Arg : Node_Id; Typ : Entity_Id; Is_Comp : Boolean) is Btyp : constant Entity_Id := Base_Type (Typ); Ctyp : constant Entity_Id := Component_Type (Typ); begin if In_Instance then if Is_Comp or else (not Is_Overloaded (Arg) and then Etype (Arg) /= Any_Composite and then Covers (Ctyp, Etype (Arg))) then Resolve (Arg, Ctyp); else Resolve (Arg, Btyp); end if; -- If both Array & Array and Array & Component are visible, there is a -- potential ambiguity that must be reported. elsif Has_Compatible_Type (Arg, Ctyp) then if Nkind (Arg) = N_Aggregate and then Is_Composite_Type (Ctyp) then if Is_Private_Type (Ctyp) then Resolve (Arg, Btyp); -- If the operation is user-defined and not overloaded use its -- profile. The operation may be a renaming, in which case it has -- been rewritten, and we want the original profile. elsif not Is_Overloaded (N) and then Comes_From_Source (Entity (Original_Node (N))) and then Ekind (Entity (Original_Node (N))) = E_Function then Resolve (Arg, Etype (Next_Formal (First_Formal (Entity (Original_Node (N)))))); return; -- Otherwise an aggregate may match both the array type and the -- component type. else Error_Msg_N ("ambiguous aggregate must be qualified", Arg); Set_Etype (Arg, Any_Type); end if; else if Is_Overloaded (Arg) and then Has_Compatible_Type (Arg, Typ) and then Etype (Arg) /= Any_Type then declare I : Interp_Index; It : Interp; Func : Entity_Id; begin Get_First_Interp (Arg, I, It); Func := It.Nam; Get_Next_Interp (I, It); -- Special-case the error message when the overloading is -- caused by a function that yields an array and can be -- called without parameters. if It.Nam = Func then Error_Msg_Sloc := Sloc (Func); Error_Msg_N ("ambiguous call to function#", Arg); Error_Msg_NE ("\\interpretation as call yields&", Arg, Typ); Error_Msg_NE ("\\interpretation as indexing of call yields&", Arg, Component_Type (Typ)); else Error_Msg_N ("ambiguous operand for concatenation!", Arg); Get_First_Interp (Arg, I, It); while Present (It.Nam) loop Error_Msg_Sloc := Sloc (It.Nam); if Base_Type (It.Typ) = Btyp or else Base_Type (It.Typ) = Base_Type (Ctyp) then Error_Msg_N -- CODEFIX ("\\possible interpretation#", Arg); end if; Get_Next_Interp (I, It); end loop; end if; end; end if; Resolve (Arg, Component_Type (Typ)); if Nkind (Arg) = N_String_Literal then Set_Etype (Arg, Component_Type (Typ)); end if; if Arg = Left_Opnd (N) then Set_Is_Component_Left_Opnd (N); else Set_Is_Component_Right_Opnd (N); end if; end if; else Resolve (Arg, Btyp); end if; Check_Unset_Reference (Arg); end Resolve_Op_Concat_Arg; ----------------------------- -- Resolve_Op_Concat_First -- ----------------------------- procedure Resolve_Op_Concat_First (N : Node_Id; Typ : Entity_Id) is Btyp : constant Entity_Id := Base_Type (Typ); Op1 : constant Node_Id := Left_Opnd (N); Op2 : constant Node_Id := Right_Opnd (N); begin -- The parser folds an enormous sequence of concatenations of string -- literals into "" & "...", where the Is_Folded_In_Parser flag is set -- in the right operand. If the expression resolves to a predefined "&" -- operator, all is well. Otherwise, the parser's folding is wrong, so -- we give an error. See P_Simple_Expression in Par.Ch4. if Nkind (Op2) = N_String_Literal and then Is_Folded_In_Parser (Op2) and then Ekind (Entity (N)) = E_Function then pragma Assert (Nkind (Op1) = N_String_Literal -- should be "" and then String_Length (Strval (Op1)) = 0); Error_Msg_N ("too many user-defined concatenations", N); return; end if; Set_Etype (N, Btyp); if Is_Limited_Composite (Btyp) then Error_Msg_N ("concatenation not available for limited array", N); Explain_Limited_Type (Btyp, N); end if; end Resolve_Op_Concat_First; ---------------------------- -- Resolve_Op_Concat_Rest -- ---------------------------- procedure Resolve_Op_Concat_Rest (N : Node_Id; Typ : Entity_Id) is Op1 : constant Node_Id := Left_Opnd (N); Op2 : constant Node_Id := Right_Opnd (N); begin Resolve_Op_Concat_Arg (N, Op2, Typ, Is_Component_Right_Opnd (N)); Generate_Operator_Reference (N, Typ); if Is_String_Type (Typ) then Eval_Concatenation (N); end if; -- If this is not a static concatenation, but the result is a string -- type (and not an array of strings) ensure that static string operands -- have their subtypes properly constructed. if Nkind (N) /= N_String_Literal and then Is_Character_Type (Component_Type (Typ)) then Set_String_Literal_Subtype (Op1, Typ); Set_String_Literal_Subtype (Op2, Typ); end if; end Resolve_Op_Concat_Rest; ---------------------- -- Resolve_Op_Expon -- ---------------------- procedure Resolve_Op_Expon (N : Node_Id; Typ : Entity_Id) is B_Typ : constant Entity_Id := Base_Type (Typ); begin -- Catch attempts to do fixed-point exponentiation with universal -- operands, which is a case where the illegality is not caught during -- normal operator analysis. This is not done in preanalysis mode -- since the tree is not fully decorated during preanalysis. if Full_Analysis then if Is_Fixed_Point_Type (Typ) and then Comes_From_Source (N) then Error_Msg_N ("exponentiation not available for fixed point", N); return; elsif Nkind (Parent (N)) in N_Op and then Present (Etype (Parent (N))) and then Is_Fixed_Point_Type (Etype (Parent (N))) and then Etype (N) = Universal_Real and then Comes_From_Source (N) then Error_Msg_N ("exponentiation not available for fixed point", N); return; end if; end if; if Comes_From_Source (N) and then Ekind (Entity (N)) = E_Function and then Is_Imported (Entity (N)) and then Is_Intrinsic_Subprogram (Entity (N)) then Resolve_Intrinsic_Operator (N, Typ); return; end if; if Etype (Left_Opnd (N)) = Universal_Integer or else Etype (Left_Opnd (N)) = Universal_Real then Check_For_Visible_Operator (N, B_Typ); end if; -- We do the resolution using the base type, because intermediate values -- in expressions are always of the base type, not a subtype of it. Resolve (Left_Opnd (N), B_Typ); Resolve (Right_Opnd (N), Standard_Integer); -- For integer types, right argument must be in Natural range if Is_Integer_Type (Typ) then Apply_Scalar_Range_Check (Right_Opnd (N), Standard_Natural); end if; Check_Unset_Reference (Left_Opnd (N)); Check_Unset_Reference (Right_Opnd (N)); Set_Etype (N, B_Typ); Generate_Operator_Reference (N, B_Typ); Analyze_Dimension (N); if Ada_Version >= Ada_2012 and then Has_Dimension_System (B_Typ) then -- Evaluate the exponentiation operator for dimensioned type Eval_Op_Expon_For_Dimensioned_Type (N, B_Typ); else Eval_Op_Expon (N); end if; -- Set overflow checking bit. Much cleverer code needed here eventually -- and perhaps the Resolve routines should be separated for the various -- arithmetic operations, since they will need different processing. ??? if Nkind (N) in N_Op then if not Overflow_Checks_Suppressed (Etype (N)) then Enable_Overflow_Check (N); end if; end if; end Resolve_Op_Expon; -------------------- -- Resolve_Op_Not -- -------------------- procedure Resolve_Op_Not (N : Node_Id; Typ : Entity_Id) is B_Typ : Entity_Id; function Parent_Is_Boolean return Boolean; -- This function determines if the parent node is a boolean operator or -- operation (comparison op, membership test, or short circuit form) and -- the not in question is the left operand of this operation. Note that -- if the not is in parens, then false is returned. ----------------------- -- Parent_Is_Boolean -- ----------------------- function Parent_Is_Boolean return Boolean is begin if Paren_Count (N) /= 0 then return False; else case Nkind (Parent (N)) is when N_And_Then | N_In | N_Not_In | N_Op_And | N_Op_Eq | N_Op_Ge | N_Op_Gt | N_Op_Le | N_Op_Lt | N_Op_Ne | N_Op_Or | N_Op_Xor | N_Or_Else => return Left_Opnd (Parent (N)) = N; when others => return False; end case; end if; end Parent_Is_Boolean; -- Start of processing for Resolve_Op_Not begin -- Predefined operations on scalar types yield the base type. On the -- other hand, logical operations on arrays yield the type of the -- arguments (and the context). if Is_Array_Type (Typ) then B_Typ := Typ; else B_Typ := Base_Type (Typ); end if; -- Straightforward case of incorrect arguments if not Valid_Boolean_Arg (Typ) then Error_Msg_N ("invalid operand type for operator&", N); Set_Etype (N, Any_Type); return; -- Special case of probable missing parens elsif Typ = Universal_Integer or else Typ = Any_Modular then if Parent_Is_Boolean then Error_Msg_N ("operand of not must be enclosed in parentheses", Right_Opnd (N)); else Error_Msg_N ("no modular type available in this context", N); end if; Set_Etype (N, Any_Type); return; -- OK resolution of NOT else -- Warn if non-boolean types involved. This is a case like not a < b -- where a and b are modular, where we will get (not a) < b and most -- likely not (a < b) was intended. if Warn_On_Questionable_Missing_Parens and then not Is_Boolean_Type (Typ) and then Parent_Is_Boolean then Error_Msg_N ("?q?not expression should be parenthesized here!", N); end if; -- Warn on double negation if checking redundant constructs if Warn_On_Redundant_Constructs and then Comes_From_Source (N) and then Comes_From_Source (Right_Opnd (N)) and then Root_Type (Typ) = Standard_Boolean and then Nkind (Right_Opnd (N)) = N_Op_Not then Error_Msg_N ("redundant double negation?r?", N); end if; -- Complete resolution and evaluation of NOT -- If argument is an equality and expected type is boolean, that -- expected type has no effect on resolution, and there are -- special rules for resolution of Eq, Neq in the presence of -- overloaded operands, so we directly call its resolution routines. declare Opnd : constant Node_Id := Right_Opnd (N); Op_Id : Entity_Id; begin if B_Typ = Standard_Boolean and then Nkind (Opnd) in N_Op_Eq | N_Op_Ne and then Is_Overloaded (Opnd) then Resolve_Equality_Op (Opnd, B_Typ); Op_Id := Entity (Opnd); if Ekind (Op_Id) = E_Function and then not Is_Intrinsic_Subprogram (Op_Id) then Rewrite_Operator_As_Call (Opnd, Op_Id); end if; if not Inside_A_Generic or else Is_Entity_Name (Opnd) then Freeze_Expression (Opnd); end if; Expand (Opnd); else Resolve (Opnd, B_Typ); end if; Check_Unset_Reference (Opnd); end; Set_Etype (N, B_Typ); Generate_Operator_Reference (N, B_Typ); Eval_Op_Not (N); end if; end Resolve_Op_Not; ----------------------------- -- Resolve_Operator_Symbol -- ----------------------------- -- Nothing to be done, all resolved already procedure Resolve_Operator_Symbol (N : Node_Id; Typ : Entity_Id) is pragma Warnings (Off, N); pragma Warnings (Off, Typ); begin null; end Resolve_Operator_Symbol; ---------------------------------- -- Resolve_Qualified_Expression -- ---------------------------------- procedure Resolve_Qualified_Expression (N : Node_Id; Typ : Entity_Id) is pragma Warnings (Off, Typ); Target_Typ : constant Entity_Id := Entity (Subtype_Mark (N)); Expr : constant Node_Id := Expression (N); begin Resolve (Expr, Target_Typ); -- A qualified expression requires an exact match of the type, class- -- wide matching is not allowed. However, if the qualifying type is -- specific and the expression has a class-wide type, it may still be -- okay, since it can be the result of the expansion of a call to a -- dispatching function, so we also have to check class-wideness of the -- type of the expression's original node. if (Is_Class_Wide_Type (Target_Typ) or else (Is_Class_Wide_Type (Etype (Expr)) and then Is_Class_Wide_Type (Etype (Original_Node (Expr))))) and then Base_Type (Etype (Expr)) /= Base_Type (Target_Typ) then Wrong_Type (Expr, Target_Typ); end if; -- If the target type is unconstrained, then we reset the type of the -- result from the type of the expression. For other cases, the actual -- subtype of the expression is the target type. But we avoid doing it -- for an allocator since this is not needed and might be problematic. if Is_Composite_Type (Target_Typ) and then not Is_Constrained (Target_Typ) and then Nkind (Parent (N)) /= N_Allocator then Set_Etype (N, Etype (Expr)); end if; Analyze_Dimension (N); Eval_Qualified_Expression (N); -- If we still have a qualified expression after the static evaluation, -- then apply a scalar range check if needed. The reason that we do this -- after the Eval call is that otherwise, the application of the range -- check may convert an illegal static expression and result in warning -- rather than giving an error (e.g Integer'(Integer'Last + 1)). if Nkind (N) = N_Qualified_Expression and then Is_Scalar_Type (Target_Typ) then Apply_Scalar_Range_Check (Expr, Target_Typ); end if; -- AI12-0100: Once the qualified expression is resolved, check whether -- operand statisfies a static predicate of the target subtype, if any. -- In the static expression case, a predicate check failure is an error. if Has_Predicates (Target_Typ) then Check_Expression_Against_Static_Predicate (Expr, Target_Typ, Static_Failure_Is_Error => True); end if; end Resolve_Qualified_Expression; ------------------------------ -- Resolve_Raise_Expression -- ------------------------------ procedure Resolve_Raise_Expression (N : Node_Id; Typ : Entity_Id) is begin if Typ = Raise_Type then Error_Msg_N ("cannot find unique type for raise expression", N); Set_Etype (N, Any_Type); else Set_Etype (N, Typ); end if; end Resolve_Raise_Expression; ------------------- -- Resolve_Range -- ------------------- procedure Resolve_Range (N : Node_Id; Typ : Entity_Id) is L : constant Node_Id := Low_Bound (N); H : constant Node_Id := High_Bound (N); function First_Last_Ref return Boolean; -- Returns True if N is of the form X'First .. X'Last where X is the -- same entity for both attributes. -------------------- -- First_Last_Ref -- -------------------- function First_Last_Ref return Boolean is Lorig : constant Node_Id := Original_Node (L); Horig : constant Node_Id := Original_Node (H); begin if Nkind (Lorig) = N_Attribute_Reference and then Nkind (Horig) = N_Attribute_Reference and then Attribute_Name (Lorig) = Name_First and then Attribute_Name (Horig) = Name_Last then declare PL : constant Node_Id := Prefix (Lorig); PH : constant Node_Id := Prefix (Horig); begin if Is_Entity_Name (PL) and then Is_Entity_Name (PH) and then Entity (PL) = Entity (PH) then return True; end if; end; end if; return False; end First_Last_Ref; -- Start of processing for Resolve_Range begin Set_Etype (N, Typ); Resolve (L, Typ); Resolve (H, Typ); -- Reanalyze the lower bound after both bounds have been analyzed, so -- that the range is known to be static or not by now. This may trigger -- more compile-time evaluation, which is useful for static analysis -- with GNATprove. This is not needed for compilation or static analysis -- with CodePeer, as full expansion does that evaluation then. if GNATprove_Mode then Set_Analyzed (L, False); Resolve (L, Typ); end if; -- Check for inappropriate range on unordered enumeration type if Bad_Unordered_Enumeration_Reference (N, Typ) -- Exclude X'First .. X'Last if X is the same entity for both and then not First_Last_Ref then Error_Msg_Sloc := Sloc (Typ); Error_Msg_NE ("subrange of unordered enumeration type& declared#?U?", N, Typ); end if; Check_Unset_Reference (L); Check_Unset_Reference (H); -- We have to check the bounds for being within the base range as -- required for a non-static context. Normally this is automatic and -- done as part of evaluating expressions, but the N_Range node is an -- exception, since in GNAT we consider this node to be a subexpression, -- even though in Ada it is not. The circuit in Sem_Eval could check for -- this, but that would put the test on the main evaluation path for -- expressions. Check_Non_Static_Context (L); Check_Non_Static_Context (H); -- Check for an ambiguous range over character literals. This will -- happen with a membership test involving only literals. if Typ = Any_Character then Ambiguous_Character (L); Set_Etype (N, Any_Type); return; end if; -- If bounds are static, constant-fold them, so size computations are -- identical between front-end and back-end. Do not perform this -- transformation while analyzing generic units, as type information -- would be lost when reanalyzing the constant node in the instance. if Is_Discrete_Type (Typ) and then Expander_Active then if Is_OK_Static_Expression (L) then Fold_Uint (L, Expr_Value (L), Is_OK_Static_Expression (L)); end if; if Is_OK_Static_Expression (H) then Fold_Uint (H, Expr_Value (H), Is_OK_Static_Expression (H)); end if; end if; end Resolve_Range; -------------------------- -- Resolve_Real_Literal -- -------------------------- procedure Resolve_Real_Literal (N : Node_Id; Typ : Entity_Id) is Actual_Typ : constant Entity_Id := Etype (N); begin -- Special processing for fixed-point literals to make sure that the -- value is an exact multiple of small where this is required. We skip -- this for the universal real case, and also for generic types. if Is_Fixed_Point_Type (Typ) and then Typ /= Universal_Fixed and then Typ /= Any_Fixed and then not Is_Generic_Type (Typ) then declare Val : constant Ureal := Realval (N); Cintr : constant Ureal := Val / Small_Value (Typ); Cint : constant Uint := UR_Trunc (Cintr); Den : constant Uint := Norm_Den (Cintr); Stat : Boolean; begin -- Case of literal is not an exact multiple of the Small if Den /= 1 then -- For a source program literal for a decimal fixed-point type, -- this is statically illegal (RM 4.9(36)). if Is_Decimal_Fixed_Point_Type (Typ) and then Actual_Typ = Universal_Real and then Comes_From_Source (N) then Error_Msg_N ("value has extraneous low order digits", N); end if; -- Generate a warning if literal from source if Is_OK_Static_Expression (N) and then Warn_On_Bad_Fixed_Value then Error_Msg_N ("?b?static fixed-point value is not a multiple of Small!", N); end if; -- Replace literal by a value that is the exact representation -- of a value of the type, i.e. a multiple of the small value, -- by truncation, since Machine_Rounds is false for all GNAT -- fixed-point types (RM 4.9(38)). Stat := Is_OK_Static_Expression (N); Rewrite (N, Make_Real_Literal (Sloc (N), Realval => Small_Value (Typ) * Cint)); Set_Is_Static_Expression (N, Stat); end if; -- In all cases, set the corresponding integer field Set_Corresponding_Integer_Value (N, Cint); end; end if; -- Now replace the actual type by the expected type as usual Set_Etype (N, Typ); Eval_Real_Literal (N); end Resolve_Real_Literal; ----------------------- -- Resolve_Reference -- ----------------------- procedure Resolve_Reference (N : Node_Id; Typ : Entity_Id) is P : constant Node_Id := Prefix (N); begin -- Replace general access with specific type if Ekind (Etype (N)) = E_Allocator_Type then Set_Etype (N, Base_Type (Typ)); end if; Resolve (P, Designated_Type (Etype (N))); -- If we are taking the reference of a volatile entity, then treat it as -- a potential modification of this entity. This is too conservative, -- but necessary because remove side effects can cause transformations -- of normal assignments into reference sequences that otherwise fail to -- notice the modification. if Is_Entity_Name (P) and then Treat_As_Volatile (Entity (P)) then Note_Possible_Modification (P, Sure => False); end if; end Resolve_Reference; -------------------------------- -- Resolve_Selected_Component -- -------------------------------- procedure Resolve_Selected_Component (N : Node_Id; Typ : Entity_Id) is Comp : Entity_Id; Comp1 : Entity_Id := Empty; -- prevent junk warning P : constant Node_Id := Prefix (N); S : constant Node_Id := Selector_Name (N); T : Entity_Id := Etype (P); I : Interp_Index; I1 : Interp_Index := 0; -- prevent junk warning It : Interp; It1 : Interp; Found : Boolean; function Init_Component return Boolean; -- Check whether this is the initialization of a component within an -- init proc (by assignment or call to another init proc). If true, -- there is no need for a discriminant check. -------------------- -- Init_Component -- -------------------- function Init_Component return Boolean is begin return Inside_Init_Proc and then Nkind (Prefix (N)) = N_Identifier and then Chars (Prefix (N)) = Name_uInit and then Nkind (Parent (Parent (N))) = N_Case_Statement_Alternative; end Init_Component; -- Start of processing for Resolve_Selected_Component begin if Is_Overloaded (P) then -- Use the context type to select the prefix that has a selector -- of the correct name and type. Found := False; Get_First_Interp (P, I, It); Search : while Present (It.Typ) loop if Is_Access_Type (It.Typ) then T := Designated_Type (It.Typ); else T := It.Typ; end if; -- Locate selected component. For a private prefix the selector -- can denote a discriminant. if Is_Record_Type (T) or else Is_Private_Type (T) then -- The visible components of a class-wide type are those of -- the root type. if Is_Class_Wide_Type (T) then T := Etype (T); end if; Comp := First_Entity (T); while Present (Comp) loop if Chars (Comp) = Chars (S) and then Covers (Typ, Etype (Comp)) then if not Found then Found := True; I1 := I; It1 := It; Comp1 := Comp; else It := Disambiguate (P, I1, I, Any_Type); if It = No_Interp then Error_Msg_N ("ambiguous prefix for selected component", N); Set_Etype (N, Typ); return; else It1 := It; -- There may be an implicit dereference. Retrieve -- designated record type. if Is_Access_Type (It1.Typ) then T := Designated_Type (It1.Typ); else T := It1.Typ; end if; if Scope (Comp1) /= T then -- Resolution chooses the new interpretation. -- Find the component with the right name. Comp1 := First_Entity (T); while Present (Comp1) and then Chars (Comp1) /= Chars (S) loop Next_Entity (Comp1); end loop; end if; exit Search; end if; end if; end if; Next_Entity (Comp); end loop; end if; Get_Next_Interp (I, It); end loop Search; -- There must be a legal interpretation at this point pragma Assert (Found); Resolve (P, It1.Typ); -- In general the expected type is the type of the context, not the -- type of the candidate selected component. Set_Etype (N, Typ); Set_Entity_With_Checks (S, Comp1); -- The type of the context and that of the component are -- compatible and in general identical, but if they are anonymous -- access-to-subprogram types, the relevant type is that of the -- component. This matters in Unnest_Subprograms mode, where the -- relevant context is the one in which the type is declared, not -- the point of use. This determines what activation record to use. if Ekind (Typ) = E_Anonymous_Access_Subprogram_Type then Set_Etype (N, Etype (Comp1)); -- When the type of the component is an access to a class-wide type -- the relevant type is that of the component (since in such case we -- may need to generate implicit type conversions or dispatching -- calls). elsif Is_Access_Type (Typ) and then not Is_Class_Wide_Type (Designated_Type (Typ)) and then Is_Class_Wide_Type (Designated_Type (Etype (Comp1))) then Set_Etype (N, Etype (Comp1)); end if; else -- Resolve prefix with its type Resolve (P, T); end if; -- Generate cross-reference. We needed to wait until full overloading -- resolution was complete to do this, since otherwise we can't tell if -- we are an lvalue or not. if May_Be_Lvalue (N) then Generate_Reference (Entity (S), S, 'm'); else Generate_Reference (Entity (S), S, 'r'); end if; -- If the prefix's type is an access type, get to the real record type. -- Note: we do not apply an access check because an explicit dereference -- will be introduced later, and the check will happen there. if Is_Access_Type (Etype (P)) then T := Implicitly_Designated_Type (Etype (P)); Check_Fully_Declared_Prefix (T, P); else T := Etype (P); -- If the prefix is an entity it may have a deferred reference set -- during analysis of the selected component. After resolution we -- can transform it into a proper reference. This prevents spurious -- warnings on useless assignments when the same selected component -- is the actual for an out parameter in a subsequent call. if Is_Entity_Name (P) and then Has_Deferred_Reference (Entity (P)) then if May_Be_Lvalue (N) then Generate_Reference (Entity (P), P, 'm'); else Generate_Reference (Entity (P), P, 'r'); end if; end if; end if; -- Set flag for expander if discriminant check required on a component -- appearing within a variant. if Has_Discriminants (T) and then Ekind (Entity (S)) = E_Component and then Present (Original_Record_Component (Entity (S))) and then Ekind (Original_Record_Component (Entity (S))) = E_Component and then Is_Declared_Within_Variant (Original_Record_Component (Entity (S))) and then not Discriminant_Checks_Suppressed (T) and then not Init_Component then Set_Do_Discriminant_Check (N); end if; if Ekind (Entity (S)) = E_Void then Error_Msg_N ("premature use of component", S); end if; -- If the prefix is a record conversion, this may be a renamed -- discriminant whose bounds differ from those of the original -- one, so we must ensure that a range check is performed. if Nkind (P) = N_Type_Conversion and then Ekind (Entity (S)) = E_Discriminant and then Is_Discrete_Type (Typ) then Set_Etype (N, Base_Type (Typ)); end if; -- Note: No Eval processing is required, because the prefix is of a -- record type, or protected type, and neither can possibly be static. -- If the record type is atomic and the component is not, then this is -- worth a warning before Ada 2020, since we have a situation where the -- access to the component may cause extra read/writes of the atomic -- object, or partial word accesses, both of which may be unexpected. if Nkind (N) = N_Selected_Component and then Is_Atomic_Ref_With_Address (N) and then not Is_Atomic (Entity (S)) and then not Is_Atomic (Etype (Entity (S))) and then Ada_Version < Ada_2020 then Error_Msg_N ("??access to non-atomic component of atomic record", Prefix (N)); Error_Msg_N ("\??may cause unexpected accesses to atomic object", Prefix (N)); end if; Resolve_Implicit_Dereference (Prefix (N)); Analyze_Dimension (N); end Resolve_Selected_Component; ------------------- -- Resolve_Shift -- ------------------- procedure Resolve_Shift (N : Node_Id; Typ : Entity_Id) is B_Typ : constant Entity_Id := Base_Type (Typ); L : constant Node_Id := Left_Opnd (N); R : constant Node_Id := Right_Opnd (N); begin -- We do the resolution using the base type, because intermediate values -- in expressions always are of the base type, not a subtype of it. Resolve (L, B_Typ); Resolve (R, Standard_Natural); Check_Unset_Reference (L); Check_Unset_Reference (R); Set_Etype (N, B_Typ); Generate_Operator_Reference (N, B_Typ); Eval_Shift (N); end Resolve_Shift; --------------------------- -- Resolve_Short_Circuit -- --------------------------- procedure Resolve_Short_Circuit (N : Node_Id; Typ : Entity_Id) is B_Typ : constant Entity_Id := Base_Type (Typ); L : constant Node_Id := Left_Opnd (N); R : constant Node_Id := Right_Opnd (N); begin -- Ensure all actions associated with the left operand (e.g. -- finalization of transient objects) are fully evaluated locally within -- an expression with actions. This is particularly helpful for coverage -- analysis. However this should not happen in generics or if option -- Minimize_Expression_With_Actions is set. if Expander_Active and not Minimize_Expression_With_Actions then declare Reloc_L : constant Node_Id := Relocate_Node (L); begin Save_Interps (Old_N => L, New_N => Reloc_L); Rewrite (L, Make_Expression_With_Actions (Sloc (L), Actions => New_List, Expression => Reloc_L)); -- Set Comes_From_Source on L to preserve warnings for unset -- reference. Preserve_Comes_From_Source (L, Reloc_L); end; end if; Resolve (L, B_Typ); Resolve (R, B_Typ); -- Check for issuing warning for always False assert/check, this happens -- when assertions are turned off, in which case the pragma Assert/Check -- was transformed into: -- if False and then <condition> then ... -- and we detect this pattern if Warn_On_Assertion_Failure and then Is_Entity_Name (R) and then Entity (R) = Standard_False and then Nkind (Parent (N)) = N_If_Statement and then Nkind (N) = N_And_Then and then Is_Entity_Name (L) and then Entity (L) = Standard_False then declare Orig : constant Node_Id := Original_Node (Parent (N)); begin -- Special handling of Asssert pragma if Nkind (Orig) = N_Pragma and then Pragma_Name (Orig) = Name_Assert then declare Expr : constant Node_Id := Original_Node (Expression (First (Pragma_Argument_Associations (Orig)))); begin -- Don't warn if original condition is explicit False, -- since obviously the failure is expected in this case. if Is_Entity_Name (Expr) and then Entity (Expr) = Standard_False then null; -- Issue warning. We do not want the deletion of the -- IF/AND-THEN to take this message with it. We achieve this -- by making sure that the expanded code points to the Sloc -- of the expression, not the original pragma. else -- Note: Use Error_Msg_F here rather than Error_Msg_N. -- The source location of the expression is not usually -- the best choice here. For example, it gets located on -- the last AND keyword in a chain of boolean expressiond -- AND'ed together. It is best to put the message on the -- first character of the assertion, which is the effect -- of the First_Node call here. Error_Msg_F ("?A?assertion would fail at run time!", Expression (First (Pragma_Argument_Associations (Orig)))); end if; end; -- Similar processing for Check pragma elsif Nkind (Orig) = N_Pragma and then Pragma_Name (Orig) = Name_Check then -- Don't want to warn if original condition is explicit False declare Expr : constant Node_Id := Original_Node (Expression (Next (First (Pragma_Argument_Associations (Orig))))); begin if Is_Entity_Name (Expr) and then Entity (Expr) = Standard_False then null; -- Post warning else -- Again use Error_Msg_F rather than Error_Msg_N, see -- comment above for an explanation of why we do this. Error_Msg_F ("?A?check would fail at run time!", Expression (Last (Pragma_Argument_Associations (Orig)))); end if; end; end if; end; end if; -- Continue with processing of short circuit Check_Unset_Reference (L); Check_Unset_Reference (R); Set_Etype (N, B_Typ); Eval_Short_Circuit (N); end Resolve_Short_Circuit; ------------------- -- Resolve_Slice -- ------------------- procedure Resolve_Slice (N : Node_Id; Typ : Entity_Id) is Drange : constant Node_Id := Discrete_Range (N); Name : constant Node_Id := Prefix (N); Array_Type : Entity_Id := Empty; Dexpr : Node_Id := Empty; Index_Type : Entity_Id; begin if Is_Overloaded (Name) then -- Use the context type to select the prefix that yields the correct -- array type. declare I : Interp_Index; I1 : Interp_Index := 0; It : Interp; P : constant Node_Id := Prefix (N); Found : Boolean := False; begin Get_First_Interp (P, I, It); while Present (It.Typ) loop if (Is_Array_Type (It.Typ) and then Covers (Typ, It.Typ)) or else (Is_Access_Type (It.Typ) and then Is_Array_Type (Designated_Type (It.Typ)) and then Covers (Typ, Designated_Type (It.Typ))) then if Found then It := Disambiguate (P, I1, I, Any_Type); if It = No_Interp then Error_Msg_N ("ambiguous prefix for slicing", N); Set_Etype (N, Typ); return; else Found := True; Array_Type := It.Typ; I1 := I; end if; else Found := True; Array_Type := It.Typ; I1 := I; end if; end if; Get_Next_Interp (I, It); end loop; end; else Array_Type := Etype (Name); end if; Resolve (Name, Array_Type); -- If the prefix's type is an access type, get to the real array type. -- Note: we do not apply an access check because an explicit dereference -- will be introduced later, and the check will happen there. if Is_Access_Type (Array_Type) then Array_Type := Implicitly_Designated_Type (Array_Type); -- If the prefix is an access to an unconstrained array, we must use -- the actual subtype of the object to perform the index checks. The -- object denoted by the prefix is implicit in the node, so we build -- an explicit representation for it in order to compute the actual -- subtype. if not Is_Constrained (Array_Type) then Remove_Side_Effects (Prefix (N)); declare Obj : constant Node_Id := Make_Explicit_Dereference (Sloc (N), Prefix => New_Copy_Tree (Prefix (N))); begin Set_Etype (Obj, Array_Type); Set_Parent (Obj, Parent (N)); Array_Type := Get_Actual_Subtype (Obj); end; end if; elsif Is_Entity_Name (Name) or else Nkind (Name) = N_Explicit_Dereference or else (Nkind (Name) = N_Function_Call and then not Is_Constrained (Etype (Name))) then Array_Type := Get_Actual_Subtype (Name); -- If the name is a selected component that depends on discriminants, -- build an actual subtype for it. This can happen only when the name -- itself is overloaded; otherwise the actual subtype is created when -- the selected component is analyzed. elsif Nkind (Name) = N_Selected_Component and then Full_Analysis and then Depends_On_Discriminant (First_Index (Array_Type)) then declare Act_Decl : constant Node_Id := Build_Actual_Subtype_Of_Component (Array_Type, Name); begin Insert_Action (N, Act_Decl); Array_Type := Defining_Identifier (Act_Decl); end; -- Maybe this should just be "else", instead of checking for the -- specific case of slice??? This is needed for the case where the -- prefix is an Image attribute, which gets expanded to a slice, and so -- has a constrained subtype which we want to use for the slice range -- check applied below (the range check won't get done if the -- unconstrained subtype of the 'Image is used). elsif Nkind (Name) = N_Slice then Array_Type := Etype (Name); end if; -- Obtain the type of the array index if Ekind (Array_Type) = E_String_Literal_Subtype then Index_Type := Etype (String_Literal_Low_Bound (Array_Type)); else Index_Type := Etype (First_Index (Array_Type)); end if; -- If name was overloaded, set slice type correctly now Set_Etype (N, Array_Type); -- Handle the generation of a range check that compares the array index -- against the discrete_range. The check is not applied to internally -- built nodes associated with the expansion of dispatch tables. Check -- that Ada.Tags has already been loaded to avoid extra dependencies on -- the unit. if Tagged_Type_Expansion and then RTU_Loaded (Ada_Tags) and then Nkind (Prefix (N)) = N_Selected_Component and then Present (Entity (Selector_Name (Prefix (N)))) and then Entity (Selector_Name (Prefix (N))) = RTE_Record_Component (RE_Prims_Ptr) then null; -- The discrete_range is specified by a subtype indication. Create a -- shallow copy and inherit the type, parent and source location from -- the discrete_range. This ensures that the range check is inserted -- relative to the slice and that the runtime exception points to the -- proper construct. elsif Is_Entity_Name (Drange) then Dexpr := New_Copy (Scalar_Range (Entity (Drange))); Set_Etype (Dexpr, Etype (Drange)); Set_Parent (Dexpr, Parent (Drange)); Set_Sloc (Dexpr, Sloc (Drange)); -- The discrete_range is a regular range. Resolve the bounds and remove -- their side effects. else Resolve (Drange, Base_Type (Index_Type)); if Nkind (Drange) = N_Range then Force_Evaluation (Low_Bound (Drange)); Force_Evaluation (High_Bound (Drange)); Dexpr := Drange; end if; end if; if Present (Dexpr) then Apply_Range_Check (Dexpr, Index_Type); end if; Set_Slice_Subtype (N); -- Check bad use of type with predicates declare Subt : Entity_Id; begin if Nkind (Drange) = N_Subtype_Indication and then Has_Predicates (Entity (Subtype_Mark (Drange))) then Subt := Entity (Subtype_Mark (Drange)); else Subt := Etype (Drange); end if; if Has_Predicates (Subt) then Bad_Predicated_Subtype_Use ("subtype& has predicate, not allowed in slice", Drange, Subt); end if; end; -- Otherwise here is where we check suspicious indexes if Nkind (Drange) = N_Range then Warn_On_Suspicious_Index (Name, Low_Bound (Drange)); Warn_On_Suspicious_Index (Name, High_Bound (Drange)); end if; Resolve_Implicit_Dereference (Prefix (N)); Analyze_Dimension (N); Eval_Slice (N); end Resolve_Slice; ---------------------------- -- Resolve_String_Literal -- ---------------------------- procedure Resolve_String_Literal (N : Node_Id; Typ : Entity_Id) is C_Typ : constant Entity_Id := Component_Type (Typ); R_Typ : constant Entity_Id := Root_Type (C_Typ); Loc : constant Source_Ptr := Sloc (N); Str : constant String_Id := Strval (N); Strlen : constant Nat := String_Length (Str); Subtype_Id : Entity_Id; Need_Check : Boolean; begin -- For a string appearing in a concatenation, defer creation of the -- string_literal_subtype until the end of the resolution of the -- concatenation, because the literal may be constant-folded away. This -- is a useful optimization for long concatenation expressions. -- If the string is an aggregate built for a single character (which -- happens in a non-static context) or a is null string to which special -- checks may apply, we build the subtype. Wide strings must also get a -- string subtype if they come from a one character aggregate. Strings -- generated by attributes might be static, but it is often hard to -- determine whether the enclosing context is static, so we generate -- subtypes for them as well, thus losing some rarer optimizations ??? -- Same for strings that come from a static conversion. Need_Check := (Strlen = 0 and then Typ /= Standard_String) or else Nkind (Parent (N)) /= N_Op_Concat or else (N /= Left_Opnd (Parent (N)) and then N /= Right_Opnd (Parent (N))) or else ((Typ = Standard_Wide_String or else Typ = Standard_Wide_Wide_String) and then Nkind (Original_Node (N)) /= N_String_Literal); -- If the resolving type is itself a string literal subtype, we can just -- reuse it, since there is no point in creating another. if Ekind (Typ) = E_String_Literal_Subtype then Subtype_Id := Typ; elsif Nkind (Parent (N)) = N_Op_Concat and then not Need_Check and then Nkind (Original_Node (N)) not in N_Character_Literal | N_Attribute_Reference | N_Qualified_Expression | N_Type_Conversion then Subtype_Id := Typ; -- Do not generate a string literal subtype for the default expression -- of a formal parameter in GNATprove mode. This is because the string -- subtype is associated with the freezing actions of the subprogram, -- however freezing is disabled in GNATprove mode and as a result the -- subtype is unavailable. elsif GNATprove_Mode and then Nkind (Parent (N)) = N_Parameter_Specification then Subtype_Id := Typ; -- Otherwise we must create a string literal subtype. Note that the -- whole idea of string literal subtypes is simply to avoid the need -- for building a full fledged array subtype for each literal. else Set_String_Literal_Subtype (N, Typ); Subtype_Id := Etype (N); end if; if Nkind (Parent (N)) /= N_Op_Concat or else Need_Check then Set_Etype (N, Subtype_Id); Eval_String_Literal (N); end if; if Is_Limited_Composite (Typ) or else Is_Private_Composite (Typ) then Error_Msg_N ("string literal not available for private array", N); Set_Etype (N, Any_Type); return; end if; -- The validity of a null string has been checked in the call to -- Eval_String_Literal. if Strlen = 0 then return; -- Always accept string literal with component type Any_Character, which -- occurs in error situations and in comparisons of literals, both of -- which should accept all literals. elsif R_Typ = Any_Character then return; -- If the type is bit-packed, then we always transform the string -- literal into a full fledged aggregate. elsif Is_Bit_Packed_Array (Typ) then null; -- Deal with cases of Wide_Wide_String, Wide_String, and String else -- For Standard.Wide_Wide_String, or any other type whose component -- type is Standard.Wide_Wide_Character, we know that all the -- characters in the string must be acceptable, since the parser -- accepted the characters as valid character literals. if R_Typ = Standard_Wide_Wide_Character then null; -- For the case of Standard.String, or any other type whose component -- type is Standard.Character, we must make sure that there are no -- wide characters in the string, i.e. that it is entirely composed -- of characters in range of type Character. -- If the string literal is the result of a static concatenation, the -- test has already been performed on the components, and need not be -- repeated. elsif R_Typ = Standard_Character and then Nkind (Original_Node (N)) /= N_Op_Concat then for J in 1 .. Strlen loop if not In_Character_Range (Get_String_Char (Str, J)) then -- If we are out of range, post error. This is one of the -- very few places that we place the flag in the middle of -- a token, right under the offending wide character. Not -- quite clear if this is right wrt wide character encoding -- sequences, but it's only an error message. Error_Msg ("literal out of range of type Standard.Character", Source_Ptr (Int (Loc) + J)); return; end if; end loop; -- For the case of Standard.Wide_String, or any other type whose -- component type is Standard.Wide_Character, we must make sure that -- there are no wide characters in the string, i.e. that it is -- entirely composed of characters in range of type Wide_Character. -- If the string literal is the result of a static concatenation, -- the test has already been performed on the components, and need -- not be repeated. elsif R_Typ = Standard_Wide_Character and then Nkind (Original_Node (N)) /= N_Op_Concat then for J in 1 .. Strlen loop if not In_Wide_Character_Range (Get_String_Char (Str, J)) then -- If we are out of range, post error. This is one of the -- very few places that we place the flag in the middle of -- a token, right under the offending wide character. -- This is not quite right, because characters in general -- will take more than one character position ??? Error_Msg ("literal out of range of type Standard.Wide_Character", Source_Ptr (Int (Loc) + J)); return; end if; end loop; -- If the root type is not a standard character, then we will convert -- the string into an aggregate and will let the aggregate code do -- the checking. Standard Wide_Wide_Character is also OK here. else null; end if; -- See if the component type of the array corresponding to the string -- has compile time known bounds. If yes we can directly check -- whether the evaluation of the string will raise constraint error. -- Otherwise we need to transform the string literal into the -- corresponding character aggregate and let the aggregate code do -- the checking. We use the same transformation if the component -- type has a static predicate, which will be applied to each -- character when the aggregate is resolved. if Is_Standard_Character_Type (R_Typ) then -- Check for the case of full range, where we are definitely OK if Component_Type (Typ) = Base_Type (Component_Type (Typ)) then return; end if; -- Here the range is not the complete base type range, so check declare Comp_Typ_Lo : constant Node_Id := Type_Low_Bound (Component_Type (Typ)); Comp_Typ_Hi : constant Node_Id := Type_High_Bound (Component_Type (Typ)); Char_Val : Uint; begin if Compile_Time_Known_Value (Comp_Typ_Lo) and then Compile_Time_Known_Value (Comp_Typ_Hi) then for J in 1 .. Strlen loop Char_Val := UI_From_Int (Int (Get_String_Char (Str, J))); if Char_Val < Expr_Value (Comp_Typ_Lo) or else Char_Val > Expr_Value (Comp_Typ_Hi) then Apply_Compile_Time_Constraint_Error (N, "character out of range??", CE_Range_Check_Failed, Loc => Source_Ptr (Int (Loc) + J)); end if; end loop; if not Has_Static_Predicate (C_Typ) then return; end if; end if; end; end if; end if; -- If we got here we meed to transform the string literal into the -- equivalent qualified positional array aggregate. This is rather -- heavy artillery for this situation, but it is hard work to avoid. declare Lits : constant List_Id := New_List; P : Source_Ptr := Loc + 1; C : Char_Code; begin -- Build the character literals, we give them source locations that -- correspond to the string positions, which is a bit tricky given -- the possible presence of wide character escape sequences. for J in 1 .. Strlen loop C := Get_String_Char (Str, J); Set_Character_Literal_Name (C); Append_To (Lits, Make_Character_Literal (P, Chars => Name_Find, Char_Literal_Value => UI_From_CC (C))); if In_Character_Range (C) then P := P + 1; -- Should we have a call to Skip_Wide here ??? -- ??? else -- Skip_Wide (P); end if; end loop; Rewrite (N, Make_Qualified_Expression (Loc, Subtype_Mark => New_Occurrence_Of (Typ, Loc), Expression => Make_Aggregate (Loc, Expressions => Lits))); Analyze_And_Resolve (N, Typ); end; end Resolve_String_Literal; ------------------------- -- Resolve_Target_Name -- ------------------------- procedure Resolve_Target_Name (N : Node_Id; Typ : Entity_Id) is begin Set_Etype (N, Typ); end Resolve_Target_Name; ----------------------------- -- Resolve_Type_Conversion -- ----------------------------- procedure Resolve_Type_Conversion (N : Node_Id; Typ : Entity_Id) is Conv_OK : constant Boolean := Conversion_OK (N); Operand : constant Node_Id := Expression (N); Operand_Typ : constant Entity_Id := Etype (Operand); Target_Typ : constant Entity_Id := Etype (N); Rop : Node_Id; Orig_N : Node_Id; Orig_T : Node_Id; Test_Redundant : Boolean := Warn_On_Redundant_Constructs; -- Set to False to suppress cases where we want to suppress the test -- for redundancy to avoid possible false positives on this warning. begin if not Conv_OK and then not Valid_Conversion (N, Target_Typ, Operand) then return; end if; -- If the Operand Etype is Universal_Fixed, then the conversion is -- never redundant. We need this check because by the time we have -- finished the rather complex transformation, the conversion looks -- redundant when it is not. if Operand_Typ = Universal_Fixed then Test_Redundant := False; -- If the operand is marked as Any_Fixed, then special processing is -- required. This is also a case where we suppress the test for a -- redundant conversion, since most certainly it is not redundant. elsif Operand_Typ = Any_Fixed then Test_Redundant := False; -- Mixed-mode operation involving a literal. Context must be a fixed -- type which is applied to the literal subsequently. -- Multiplication and division involving two fixed type operands must -- yield a universal real because the result is computed in arbitrary -- precision. if Is_Fixed_Point_Type (Typ) and then Nkind (Operand) in N_Op_Divide | N_Op_Multiply and then Etype (Left_Opnd (Operand)) = Any_Fixed and then Etype (Right_Opnd (Operand)) = Any_Fixed then Set_Etype (Operand, Universal_Real); elsif Is_Numeric_Type (Typ) and then Nkind (Operand) in N_Op_Multiply | N_Op_Divide and then (Etype (Right_Opnd (Operand)) = Universal_Real or else Etype (Left_Opnd (Operand)) = Universal_Real) then -- Return if expression is ambiguous if Unique_Fixed_Point_Type (N) = Any_Type then return; -- If nothing else, the available fixed type is Duration else Set_Etype (Operand, Standard_Duration); end if; -- Resolve the real operand with largest available precision if Etype (Right_Opnd (Operand)) = Universal_Real then Rop := New_Copy_Tree (Right_Opnd (Operand)); else Rop := New_Copy_Tree (Left_Opnd (Operand)); end if; Resolve (Rop, Universal_Real); -- If the operand is a literal (it could be a non-static and -- illegal exponentiation) check whether the use of Duration -- is potentially inaccurate. if Nkind (Rop) = N_Real_Literal and then Realval (Rop) /= Ureal_0 and then abs (Realval (Rop)) < Delta_Value (Standard_Duration) then Error_Msg_N ("??universal real operand can only " & "be interpreted as Duration!", Rop); Error_Msg_N ("\??precision will be lost in the conversion!", Rop); end if; elsif Is_Numeric_Type (Typ) and then Nkind (Operand) in N_Op and then Unique_Fixed_Point_Type (N) /= Any_Type then Set_Etype (Operand, Standard_Duration); else Error_Msg_N ("invalid context for mixed mode operation", N); Set_Etype (Operand, Any_Type); return; end if; end if; Resolve (Operand); Analyze_Dimension (N); -- Note: we do the Eval_Type_Conversion call before applying the -- required checks for a subtype conversion. This is important, since -- both are prepared under certain circumstances to change the type -- conversion to a constraint error node, but in the case of -- Eval_Type_Conversion this may reflect an illegality in the static -- case, and we would miss the illegality (getting only a warning -- message), if we applied the type conversion checks first. Eval_Type_Conversion (N); -- Even when evaluation is not possible, we may be able to simplify the -- conversion or its expression. This needs to be done before applying -- checks, since otherwise the checks may use the original expression -- and defeat the simplifications. This is specifically the case for -- elimination of the floating-point Truncation attribute in -- float-to-int conversions. Simplify_Type_Conversion (N); -- If after evaluation we still have a type conversion, then we may need -- to apply checks required for a subtype conversion. -- Skip these type conversion checks if universal fixed operands -- are involved, since range checks are handled separately for -- these cases (in the appropriate Expand routines in unit Exp_Fixd). if Nkind (N) = N_Type_Conversion and then not Is_Generic_Type (Root_Type (Target_Typ)) and then Target_Typ /= Universal_Fixed and then Operand_Typ /= Universal_Fixed then Apply_Type_Conversion_Checks (N); end if; -- Issue warning for conversion of simple object to its own type. We -- have to test the original nodes, since they may have been rewritten -- by various optimizations. Orig_N := Original_Node (N); -- Here we test for a redundant conversion if the warning mode is -- active (and was not locally reset), and we have a type conversion -- from source not appearing in a generic instance. if Test_Redundant and then Nkind (Orig_N) = N_Type_Conversion and then Comes_From_Source (Orig_N) and then not In_Instance then Orig_N := Original_Node (Expression (Orig_N)); Orig_T := Target_Typ; -- If the node is part of a larger expression, the Target_Type -- may not be the original type of the node if the context is a -- condition. Recover original type to see if conversion is needed. if Is_Boolean_Type (Orig_T) and then Nkind (Parent (N)) in N_Op then Orig_T := Etype (Parent (N)); end if; -- If we have an entity name, then give the warning if the entity -- is the right type, or if it is a loop parameter covered by the -- original type (that's needed because loop parameters have an -- odd subtype coming from the bounds). if (Is_Entity_Name (Orig_N) and then Present (Entity (Orig_N)) and then (Etype (Entity (Orig_N)) = Orig_T or else (Ekind (Entity (Orig_N)) = E_Loop_Parameter and then Covers (Orig_T, Etype (Entity (Orig_N)))))) -- If not an entity, then type of expression must match or else Etype (Orig_N) = Orig_T then -- One more check, do not give warning if the analyzed conversion -- has an expression with non-static bounds, and the bounds of the -- target are static. This avoids junk warnings in cases where the -- conversion is necessary to establish staticness, for example in -- a case statement. if not Is_OK_Static_Subtype (Operand_Typ) and then Is_OK_Static_Subtype (Target_Typ) then null; -- Finally, if this type conversion occurs in a context requiring -- a prefix, and the expression is a qualified expression then the -- type conversion is not redundant, since a qualified expression -- is not a prefix, whereas a type conversion is. For example, "X -- := T'(Funx(...)).Y;" is illegal because a selected component -- requires a prefix, but a type conversion makes it legal: "X := -- T(T'(Funx(...))).Y;" -- In Ada 2012, a qualified expression is a name, so this idiom is -- no longer needed, but we still suppress the warning because it -- seems unfriendly for warnings to pop up when you switch to the -- newer language version. elsif Nkind (Orig_N) = N_Qualified_Expression and then Nkind (Parent (N)) in N_Attribute_Reference | N_Indexed_Component | N_Selected_Component | N_Slice | N_Explicit_Dereference then null; -- Never warn on conversion to Long_Long_Integer'Base since -- that is most likely an artifact of the extended overflow -- checking and comes from complex expanded code. elsif Orig_T = Base_Type (Standard_Long_Long_Integer) then null; -- Here we give the redundant conversion warning. If it is an -- entity, give the name of the entity in the message. If not, -- just mention the expression. else if Is_Entity_Name (Orig_N) then Error_Msg_Node_2 := Orig_T; Error_Msg_NE -- CODEFIX ("?r?redundant conversion, & is of type &!", N, Entity (Orig_N)); else Error_Msg_NE ("?r?redundant conversion, expression is of type&!", N, Orig_T); end if; end if; end if; end if; -- Ada 2005 (AI-251): Handle class-wide interface type conversions. -- No need to perform any interface conversion if the type of the -- expression coincides with the target type. if Ada_Version >= Ada_2005 and then Expander_Active and then Operand_Typ /= Target_Typ then declare Opnd : Entity_Id := Operand_Typ; Target : Entity_Id := Target_Typ; begin -- If the type of the operand is a limited view, use nonlimited -- view when available. If it is a class-wide type, recover the -- class-wide type of the nonlimited view. if From_Limited_With (Opnd) and then Has_Non_Limited_View (Opnd) then Opnd := Non_Limited_View (Opnd); Set_Etype (Expression (N), Opnd); end if; -- It seems that Non_Limited_View should also be applied for -- Target when it has a limited view, but that leads to missing -- error checks on interface conversions further below. ??? if Is_Access_Type (Opnd) then Opnd := Designated_Type (Opnd); -- If the type of the operand is a limited view, use nonlimited -- view when available. If it is a class-wide type, recover the -- class-wide type of the nonlimited view. if From_Limited_With (Opnd) and then Has_Non_Limited_View (Opnd) then Opnd := Non_Limited_View (Opnd); end if; end if; if Is_Access_Type (Target_Typ) then Target := Designated_Type (Target); -- If the target type is a limited view, use nonlimited view -- when available. if From_Limited_With (Target) and then Has_Non_Limited_View (Target) then Target := Non_Limited_View (Target); end if; end if; if Opnd = Target then null; -- Conversion from interface type -- It seems that it would be better for the error checks below -- to be performed as part of Validate_Conversion (and maybe some -- of the error checks above could be moved as well?). ??? elsif Is_Interface (Opnd) then -- Ada 2005 (AI-217): Handle entities from limited views if From_Limited_With (Opnd) then Error_Msg_Qual_Level := 99; Error_Msg_NE -- CODEFIX ("missing WITH clause on package &", N, Cunit_Entity (Get_Source_Unit (Base_Type (Opnd)))); Error_Msg_N ("type conversions require visibility of the full view", N); elsif From_Limited_With (Target) and then not (Is_Access_Type (Target_Typ) and then Present (Non_Limited_View (Etype (Target)))) then Error_Msg_Qual_Level := 99; Error_Msg_NE -- CODEFIX ("missing WITH clause on package &", N, Cunit_Entity (Get_Source_Unit (Base_Type (Target)))); Error_Msg_N ("type conversions require visibility of the full view", N); else Expand_Interface_Conversion (N); end if; -- Conversion to interface type elsif Is_Interface (Target) then -- Handle subtypes if Ekind (Opnd) in E_Protected_Subtype | E_Task_Subtype then Opnd := Etype (Opnd); end if; if Is_Class_Wide_Type (Opnd) or else Interface_Present_In_Ancestor (Typ => Opnd, Iface => Target) then Expand_Interface_Conversion (N); else Error_Msg_Name_1 := Chars (Etype (Target)); Error_Msg_Name_2 := Chars (Opnd); Error_Msg_N ("wrong interface conversion (% is not a progenitor " & "of %)", N); end if; end if; end; end if; -- Ada 2012: Once the type conversion is resolved, check whether the -- operand statisfies a static predicate of the target subtype, if any. -- In the static expression case, a predicate check failure is an error. if Has_Predicates (Target_Typ) then Check_Expression_Against_Static_Predicate (N, Target_Typ, Static_Failure_Is_Error => True); end if; -- If at this stage we have a fixed point to integer conversion, make -- sure that the Do_Range_Check flag is set which is not always done -- by exp_fixd.adb. if Nkind (N) = N_Type_Conversion and then Is_Integer_Type (Target_Typ) and then Is_Fixed_Point_Type (Operand_Typ) and then not Range_Checks_Suppressed (Target_Typ) and then not Range_Checks_Suppressed (Operand_Typ) then Set_Do_Range_Check (Operand); end if; -- Generating C code a type conversion of an access to constrained -- array type to access to unconstrained array type involves building -- a fat pointer which in general cannot be generated on the fly. We -- remove side effects in order to store the result of the conversion -- into a temporary. if Modify_Tree_For_C and then Nkind (N) = N_Type_Conversion and then Nkind (Parent (N)) /= N_Object_Declaration and then Is_Access_Type (Etype (N)) and then Is_Array_Type (Designated_Type (Etype (N))) and then not Is_Constrained (Designated_Type (Etype (N))) and then Is_Constrained (Designated_Type (Etype (Expression (N)))) then Remove_Side_Effects (N); end if; end Resolve_Type_Conversion; ---------------------- -- Resolve_Unary_Op -- ---------------------- procedure Resolve_Unary_Op (N : Node_Id; Typ : Entity_Id) is B_Typ : constant Entity_Id := Base_Type (Typ); R : constant Node_Id := Right_Opnd (N); OK : Boolean; Lo : Uint; Hi : Uint; begin -- Deal with intrinsic unary operators if Comes_From_Source (N) and then Ekind (Entity (N)) = E_Function and then Is_Imported (Entity (N)) and then Is_Intrinsic_Subprogram (Entity (N)) then Resolve_Intrinsic_Unary_Operator (N, Typ); return; end if; -- Deal with universal cases if Etype (R) = Universal_Integer or else Etype (R) = Universal_Real then Check_For_Visible_Operator (N, B_Typ); end if; Set_Etype (N, B_Typ); Resolve (R, B_Typ); -- Generate warning for expressions like abs (x mod 2) if Warn_On_Redundant_Constructs and then Nkind (N) = N_Op_Abs then Determine_Range (Right_Opnd (N), OK, Lo, Hi); if OK and then Hi >= Lo and then Lo >= 0 then Error_Msg_N -- CODEFIX ("?r?abs applied to known non-negative value has no effect", N); end if; end if; -- Deal with reference generation Check_Unset_Reference (R); Generate_Operator_Reference (N, B_Typ); Analyze_Dimension (N); Eval_Unary_Op (N); -- Set overflow checking bit. Much cleverer code needed here eventually -- and perhaps the Resolve routines should be separated for the various -- arithmetic operations, since they will need different processing ??? if Nkind (N) in N_Op then if not Overflow_Checks_Suppressed (Etype (N)) then Enable_Overflow_Check (N); end if; end if; -- Generate warning for expressions like -5 mod 3 for integers. No need -- to worry in the floating-point case, since parens do not affect the -- result so there is no point in giving in a warning. declare Norig : constant Node_Id := Original_Node (N); Rorig : Node_Id; Val : Uint; HB : Uint; LB : Uint; Lval : Uint; Opnd : Node_Id; begin if Warn_On_Questionable_Missing_Parens and then Comes_From_Source (Norig) and then Is_Integer_Type (Typ) and then Nkind (Norig) = N_Op_Minus then Rorig := Original_Node (Right_Opnd (Norig)); -- We are looking for cases where the right operand is not -- parenthesized, and is a binary operator, multiply, divide, or -- mod. These are the cases where the grouping can affect results. if Paren_Count (Rorig) = 0 and then Nkind (Rorig) in N_Op_Mod | N_Op_Multiply | N_Op_Divide then -- For mod, we always give the warning, since the value is -- affected by the parenthesization (e.g. (-5) mod 315 /= -- -(5 mod 315)). But for the other cases, the only concern is -- overflow, e.g. for the case of 8 big signed (-(2 * 64) -- overflows, but (-2) * 64 does not). So we try to give the -- message only when overflow is possible. if Nkind (Rorig) /= N_Op_Mod and then Compile_Time_Known_Value (R) then Val := Expr_Value (R); if Compile_Time_Known_Value (Type_High_Bound (Typ)) then HB := Expr_Value (Type_High_Bound (Typ)); else HB := Expr_Value (Type_High_Bound (Base_Type (Typ))); end if; if Compile_Time_Known_Value (Type_Low_Bound (Typ)) then LB := Expr_Value (Type_Low_Bound (Typ)); else LB := Expr_Value (Type_Low_Bound (Base_Type (Typ))); end if; -- Note that the test below is deliberately excluding the -- largest negative number, since that is a potentially -- troublesome case (e.g. -2 * x, where the result is the -- largest negative integer has an overflow with 2 * x). if Val > LB and then Val <= HB then return; end if; end if; -- For the multiplication case, the only case we have to worry -- about is when (-a)*b is exactly the largest negative number -- so that -(a*b) can cause overflow. This can only happen if -- a is a power of 2, and more generally if any operand is a -- constant that is not a power of 2, then the parentheses -- cannot affect whether overflow occurs. We only bother to -- test the left most operand -- Loop looking at left operands for one that has known value Opnd := Rorig; Opnd_Loop : while Nkind (Opnd) = N_Op_Multiply loop if Compile_Time_Known_Value (Left_Opnd (Opnd)) then Lval := UI_Abs (Expr_Value (Left_Opnd (Opnd))); -- Operand value of 0 or 1 skips warning if Lval <= 1 then return; -- Otherwise check power of 2, if power of 2, warn, if -- anything else, skip warning. else while Lval /= 2 loop if Lval mod 2 = 1 then return; else Lval := Lval / 2; end if; end loop; exit Opnd_Loop; end if; end if; -- Keep looking at left operands Opnd := Left_Opnd (Opnd); end loop Opnd_Loop; -- For rem or "/" we can only have a problematic situation -- if the divisor has a value of minus one or one. Otherwise -- overflow is impossible (divisor > 1) or we have a case of -- division by zero in any case. if Nkind (Rorig) in N_Op_Divide | N_Op_Rem and then Compile_Time_Known_Value (Right_Opnd (Rorig)) and then UI_Abs (Expr_Value (Right_Opnd (Rorig))) /= 1 then return; end if; -- If we fall through warning should be issued -- Shouldn't we test Warn_On_Questionable_Missing_Parens ??? Error_Msg_N ("??unary minus expression should be parenthesized here!", N); end if; end if; end; end Resolve_Unary_Op; ---------------------------------- -- Resolve_Unchecked_Expression -- ---------------------------------- procedure Resolve_Unchecked_Expression (N : Node_Id; Typ : Entity_Id) is begin Resolve (Expression (N), Typ, Suppress => All_Checks); Set_Etype (N, Typ); end Resolve_Unchecked_Expression; --------------------------------------- -- Resolve_Unchecked_Type_Conversion -- --------------------------------------- procedure Resolve_Unchecked_Type_Conversion (N : Node_Id; Typ : Entity_Id) is pragma Warnings (Off, Typ); Operand : constant Node_Id := Expression (N); Opnd_Type : constant Entity_Id := Etype (Operand); begin -- Resolve operand using its own type Resolve (Operand, Opnd_Type); -- If the expression is a conversion to universal integer of an -- an expression with an integer type, then we can eliminate the -- intermediate conversion to universal integer. if Nkind (Operand) = N_Type_Conversion and then Entity (Subtype_Mark (Operand)) = Universal_Integer and then Is_Integer_Type (Etype (Expression (Operand))) then Rewrite (Operand, Relocate_Node (Expression (Operand))); Analyze_And_Resolve (Operand); end if; -- In an inlined context, the unchecked conversion may be applied -- to a literal, in which case its type is the type of the context. -- (In other contexts conversions cannot apply to literals). if In_Inlined_Body and then (Opnd_Type = Any_Character or else Opnd_Type = Any_Integer or else Opnd_Type = Any_Real) then Set_Etype (Operand, Typ); end if; Analyze_Dimension (N); Eval_Unchecked_Conversion (N); end Resolve_Unchecked_Type_Conversion; ------------------------------ -- Rewrite_Operator_As_Call -- ------------------------------ procedure Rewrite_Operator_As_Call (N : Node_Id; Nam : Entity_Id) is Loc : constant Source_Ptr := Sloc (N); Actuals : constant List_Id := New_List; New_N : Node_Id; begin if Nkind (N) in N_Binary_Op then Append (Left_Opnd (N), Actuals); end if; Append (Right_Opnd (N), Actuals); New_N := Make_Function_Call (Sloc => Loc, Name => New_Occurrence_Of (Nam, Loc), Parameter_Associations => Actuals); Preserve_Comes_From_Source (New_N, N); Preserve_Comes_From_Source (Name (New_N), N); Rewrite (N, New_N); Set_Etype (N, Etype (Nam)); end Rewrite_Operator_As_Call; ------------------------------ -- Rewrite_Renamed_Operator -- ------------------------------ procedure Rewrite_Renamed_Operator (N : Node_Id; Op : Entity_Id; Typ : Entity_Id) is Nam : constant Name_Id := Chars (Op); Is_Binary : constant Boolean := Nkind (N) in N_Binary_Op; Op_Node : Node_Id; begin -- Do not perform this transformation within a pre/postcondition, -- because the expression will be reanalyzed, and the transformation -- might affect the visibility of the operator, e.g. in an instance. -- Note that fully analyzed and expanded pre/postconditions appear as -- pragma Check equivalents. if In_Pre_Post_Condition (N) then return; end if; -- Likewise when an expression function is being preanalyzed, since the -- expression will be reanalyzed as part of the generated body. if In_Spec_Expression then declare S : constant Entity_Id := Current_Scope_No_Loops; begin if Ekind (S) = E_Function and then Nkind (Original_Node (Unit_Declaration_Node (S))) = N_Expression_Function then return; end if; end; end if; -- Rewrite the operator node using the real operator, not its renaming. -- Exclude user-defined intrinsic operations of the same name, which are -- treated separately and rewritten as calls. if Ekind (Op) /= E_Function or else Chars (N) /= Nam then Op_Node := New_Node (Operator_Kind (Nam, Is_Binary), Sloc (N)); Set_Chars (Op_Node, Nam); Set_Etype (Op_Node, Etype (N)); Set_Entity (Op_Node, Op); Set_Right_Opnd (Op_Node, Right_Opnd (N)); -- Indicate that both the original entity and its renaming are -- referenced at this point. Generate_Reference (Entity (N), N); Generate_Reference (Op, N); if Is_Binary then Set_Left_Opnd (Op_Node, Left_Opnd (N)); end if; Rewrite (N, Op_Node); -- If the context type is private, add the appropriate conversions so -- that the operator is applied to the full view. This is done in the -- routines that resolve intrinsic operators. if Is_Intrinsic_Subprogram (Op) and then Is_Private_Type (Typ) then case Nkind (N) is when N_Op_Add | N_Op_Divide | N_Op_Expon | N_Op_Mod | N_Op_Multiply | N_Op_Rem | N_Op_Subtract => Resolve_Intrinsic_Operator (N, Typ); when N_Op_Abs | N_Op_Minus | N_Op_Plus => Resolve_Intrinsic_Unary_Operator (N, Typ); when others => Resolve (N, Typ); end case; end if; elsif Ekind (Op) = E_Function and then Is_Intrinsic_Subprogram (Op) then -- Operator renames a user-defined operator of the same name. Use the -- original operator in the node, which is the one Gigi knows about. Set_Entity (N, Op); Set_Is_Overloaded (N, False); end if; end Rewrite_Renamed_Operator; ----------------------- -- Set_Slice_Subtype -- ----------------------- -- Build an implicit subtype declaration to represent the type delivered by -- the slice. This is an abbreviated version of an array subtype. We define -- an index subtype for the slice, using either the subtype name or the -- discrete range of the slice. To be consistent with index usage elsewhere -- we create a list header to hold the single index. This list is not -- otherwise attached to the syntax tree. procedure Set_Slice_Subtype (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Index_List : constant List_Id := New_List; Index : Node_Id; Index_Subtype : Entity_Id; Index_Type : Entity_Id; Slice_Subtype : Entity_Id; Drange : constant Node_Id := Discrete_Range (N); begin Index_Type := Base_Type (Etype (Drange)); if Is_Entity_Name (Drange) then Index_Subtype := Entity (Drange); else -- We force the evaluation of a range. This is definitely needed in -- the renamed case, and seems safer to do unconditionally. Note in -- any case that since we will create and insert an Itype referring -- to this range, we must make sure any side effect removal actions -- are inserted before the Itype definition. if Nkind (Drange) = N_Range then Force_Evaluation (Low_Bound (Drange)); Force_Evaluation (High_Bound (Drange)); -- If the discrete range is given by a subtype indication, the -- type of the slice is the base of the subtype mark. elsif Nkind (Drange) = N_Subtype_Indication then declare R : constant Node_Id := Range_Expression (Constraint (Drange)); begin Index_Type := Base_Type (Entity (Subtype_Mark (Drange))); Force_Evaluation (Low_Bound (R)); Force_Evaluation (High_Bound (R)); end; end if; Index_Subtype := Create_Itype (Subtype_Kind (Ekind (Index_Type)), N); -- Take a new copy of Drange (where bounds have been rewritten to -- reference side-effect-free names). Using a separate tree ensures -- that further expansion (e.g. while rewriting a slice assignment -- into a FOR loop) does not attempt to remove side effects on the -- bounds again (which would cause the bounds in the index subtype -- definition to refer to temporaries before they are defined) (the -- reason is that some names are considered side effect free here -- for the subtype, but not in the context of a loop iteration -- scheme). Set_Scalar_Range (Index_Subtype, New_Copy_Tree (Drange)); Set_Parent (Scalar_Range (Index_Subtype), Index_Subtype); Set_Etype (Index_Subtype, Index_Type); Set_Size_Info (Index_Subtype, Index_Type); Set_RM_Size (Index_Subtype, RM_Size (Index_Type)); Set_Is_Constrained (Index_Subtype); end if; Slice_Subtype := Create_Itype (E_Array_Subtype, N); Index := New_Occurrence_Of (Index_Subtype, Loc); Set_Etype (Index, Index_Subtype); Append (Index, Index_List); Set_First_Index (Slice_Subtype, Index); Set_Etype (Slice_Subtype, Base_Type (Etype (N))); Set_Is_Constrained (Slice_Subtype, True); Check_Compile_Time_Size (Slice_Subtype); -- The Etype of the existing Slice node is reset to this slice subtype. -- Its bounds are obtained from its first index. Set_Etype (N, Slice_Subtype); -- For bit-packed slice subtypes, freeze immediately (except in the case -- of being in a "spec expression" where we never freeze when we first -- see the expression). if Is_Bit_Packed_Array (Slice_Subtype) and not In_Spec_Expression then Freeze_Itype (Slice_Subtype, N); -- For all other cases insert an itype reference in the slice's actions -- so that the itype is frozen at the proper place in the tree (i.e. at -- the point where actions for the slice are analyzed). Note that this -- is different from freezing the itype immediately, which might be -- premature (e.g. if the slice is within a transient scope). This needs -- to be done only if expansion is enabled. elsif Expander_Active then Ensure_Defined (Typ => Slice_Subtype, N => N); end if; end Set_Slice_Subtype; -------------------------------- -- Set_String_Literal_Subtype -- -------------------------------- procedure Set_String_Literal_Subtype (N : Node_Id; Typ : Entity_Id) is Loc : constant Source_Ptr := Sloc (N); Low_Bound : constant Node_Id := Type_Low_Bound (Etype (First_Index (Typ))); Subtype_Id : Entity_Id; begin if Nkind (N) /= N_String_Literal then return; end if; Subtype_Id := Create_Itype (E_String_Literal_Subtype, N); Set_String_Literal_Length (Subtype_Id, UI_From_Int (String_Length (Strval (N)))); Set_Etype (Subtype_Id, Base_Type (Typ)); Set_Is_Constrained (Subtype_Id); Set_Etype (N, Subtype_Id); -- The low bound is set from the low bound of the corresponding index -- type. Note that we do not store the high bound in the string literal -- subtype, but it can be deduced if necessary from the length and the -- low bound. if Is_OK_Static_Expression (Low_Bound) then Set_String_Literal_Low_Bound (Subtype_Id, Low_Bound); -- If the lower bound is not static we create a range for the string -- literal, using the index type and the known length of the literal. -- If the length is 1, then the upper bound is set to a mere copy of -- the lower bound; or else, if the index type is a signed integer, -- then the upper bound is computed as Low_Bound + L - 1; otherwise, -- the upper bound is computed as T'Val (T'Pos (Low_Bound) + L - 1). else declare Length : constant Nat := String_Length (Strval (N)); Index_List : constant List_Id := New_List; Index_Type : constant Entity_Id := Etype (First_Index (Typ)); Array_Subtype : Entity_Id; Drange : Node_Id; High_Bound : Node_Id; Index : Node_Id; Index_Subtype : Entity_Id; begin if Length = 1 then High_Bound := New_Copy_Tree (Low_Bound); elsif Is_Signed_Integer_Type (Index_Type) then High_Bound := Make_Op_Add (Loc, Left_Opnd => New_Copy_Tree (Low_Bound), Right_Opnd => Make_Integer_Literal (Loc, Length - 1)); else High_Bound := Make_Attribute_Reference (Loc, Attribute_Name => Name_Val, Prefix => New_Occurrence_Of (Index_Type, Loc), Expressions => New_List ( Make_Op_Add (Loc, Left_Opnd => Make_Attribute_Reference (Loc, Attribute_Name => Name_Pos, Prefix => New_Occurrence_Of (Index_Type, Loc), Expressions => New_List (New_Copy_Tree (Low_Bound))), Right_Opnd => Make_Integer_Literal (Loc, Length - 1)))); end if; if Is_Integer_Type (Index_Type) then Set_String_Literal_Low_Bound (Subtype_Id, Make_Integer_Literal (Loc, 1)); else -- If the index type is an enumeration type, build bounds -- expression with attributes. Set_String_Literal_Low_Bound (Subtype_Id, Make_Attribute_Reference (Loc, Attribute_Name => Name_First, Prefix => New_Occurrence_Of (Base_Type (Index_Type), Loc))); end if; Analyze_And_Resolve (String_Literal_Low_Bound (Subtype_Id), Base_Type (Index_Type)); -- Build bona fide subtype for the string, and wrap it in an -- unchecked conversion, because the back end expects the -- String_Literal_Subtype to have a static lower bound. Index_Subtype := Create_Itype (Subtype_Kind (Ekind (Index_Type)), N); Drange := Make_Range (Loc, New_Copy_Tree (Low_Bound), High_Bound); Set_Scalar_Range (Index_Subtype, Drange); Set_Parent (Drange, N); Analyze_And_Resolve (Drange, Index_Type); -- In this context, the Index_Type may already have a constraint, -- so use common base type on string subtype. The base type may -- be used when generating attributes of the string, for example -- in the context of a slice assignment. Set_Etype (Index_Subtype, Base_Type (Index_Type)); Set_Size_Info (Index_Subtype, Index_Type); Set_RM_Size (Index_Subtype, RM_Size (Index_Type)); Array_Subtype := Create_Itype (E_Array_Subtype, N); Index := New_Occurrence_Of (Index_Subtype, Loc); Set_Etype (Index, Index_Subtype); Append (Index, Index_List); Set_First_Index (Array_Subtype, Index); Set_Etype (Array_Subtype, Base_Type (Typ)); Set_Is_Constrained (Array_Subtype, True); Rewrite (N, Make_Unchecked_Type_Conversion (Loc, Subtype_Mark => New_Occurrence_Of (Array_Subtype, Loc), Expression => Relocate_Node (N))); Set_Etype (N, Array_Subtype); end; end if; end Set_String_Literal_Subtype; ------------------------------ -- Simplify_Type_Conversion -- ------------------------------ procedure Simplify_Type_Conversion (N : Node_Id) is begin if Nkind (N) = N_Type_Conversion then declare Operand : constant Node_Id := Expression (N); Target_Typ : constant Entity_Id := Etype (N); Opnd_Typ : constant Entity_Id := Etype (Operand); begin -- Special processing if the conversion is the expression of a -- Rounding or Truncation attribute reference. In this case we -- replace: -- ityp (ftyp'Rounding (x)) or ityp (ftyp'Truncation (x)) -- by -- ityp (x) -- with the Float_Truncate flag set to False or True respectively, -- which is more efficient. We reuse Rounding for Machine_Rounding -- as System.Fat_Gen, which is a permissible behavior. if Is_Floating_Point_Type (Opnd_Typ) and then (Is_Integer_Type (Target_Typ) or else (Is_Fixed_Point_Type (Target_Typ) and then Conversion_OK (N))) and then Nkind (Operand) = N_Attribute_Reference and then Attribute_Name (Operand) in Name_Rounding | Name_Machine_Rounding | Name_Truncation then declare Truncate : constant Boolean := Attribute_Name (Operand) = Name_Truncation; begin Rewrite (Operand, Relocate_Node (First (Expressions (Operand)))); Set_Float_Truncate (N, Truncate); end; -- Special processing for the conversion of an integer literal to -- a dynamic type: we first convert the literal to the root type -- and then convert the result to the target type, the goal being -- to avoid doing range checks in universal integer. elsif Is_Integer_Type (Target_Typ) and then not Is_Generic_Type (Root_Type (Target_Typ)) and then Nkind (Operand) = N_Integer_Literal and then Opnd_Typ = Universal_Integer then Convert_To_And_Rewrite (Root_Type (Target_Typ), Operand); Analyze_And_Resolve (Operand); -- If the expression is a conversion to universal integer of an -- an expression with an integer type, then we can eliminate the -- intermediate conversion to universal integer. elsif Nkind (Operand) = N_Type_Conversion and then Entity (Subtype_Mark (Operand)) = Universal_Integer and then Is_Integer_Type (Etype (Expression (Operand))) then Rewrite (Operand, Relocate_Node (Expression (Operand))); Analyze_And_Resolve (Operand); end if; end; end if; end Simplify_Type_Conversion; ----------------------------- -- Unique_Fixed_Point_Type -- ----------------------------- function Unique_Fixed_Point_Type (N : Node_Id) return Entity_Id is procedure Fixed_Point_Error (T1 : Entity_Id; T2 : Entity_Id); -- Give error messages for true ambiguity. Messages are posted on node -- N, and entities T1, T2 are the possible interpretations. ----------------------- -- Fixed_Point_Error -- ----------------------- procedure Fixed_Point_Error (T1 : Entity_Id; T2 : Entity_Id) is begin Error_Msg_N ("ambiguous universal_fixed_expression", N); Error_Msg_NE ("\\possible interpretation as}", N, T1); Error_Msg_NE ("\\possible interpretation as}", N, T2); end Fixed_Point_Error; -- Local variables ErrN : Node_Id; Item : Node_Id; Scop : Entity_Id; T1 : Entity_Id; T2 : Entity_Id; -- Start of processing for Unique_Fixed_Point_Type begin -- The operations on Duration are visible, so Duration is always a -- possible interpretation. T1 := Standard_Duration; -- Look for fixed-point types in enclosing scopes Scop := Current_Scope; while Scop /= Standard_Standard loop T2 := First_Entity (Scop); while Present (T2) loop if Is_Fixed_Point_Type (T2) and then Current_Entity (T2) = T2 and then Scope (Base_Type (T2)) = Scop then if Present (T1) then Fixed_Point_Error (T1, T2); return Any_Type; else T1 := T2; end if; end if; Next_Entity (T2); end loop; Scop := Scope (Scop); end loop; -- Look for visible fixed type declarations in the context Item := First (Context_Items (Cunit (Current_Sem_Unit))); while Present (Item) loop if Nkind (Item) = N_With_Clause then Scop := Entity (Name (Item)); T2 := First_Entity (Scop); while Present (T2) loop if Is_Fixed_Point_Type (T2) and then Scope (Base_Type (T2)) = Scop and then (Is_Potentially_Use_Visible (T2) or else In_Use (T2)) then if Present (T1) then Fixed_Point_Error (T1, T2); return Any_Type; else T1 := T2; end if; end if; Next_Entity (T2); end loop; end if; Next (Item); end loop; if Nkind (N) = N_Real_Literal then Error_Msg_NE ("??real literal interpreted as }!", N, T1); else -- When the context is a type conversion, issue the warning on the -- expression of the conversion because it is the actual operation. if Nkind (N) in N_Type_Conversion | N_Unchecked_Type_Conversion then ErrN := Expression (N); else ErrN := N; end if; Error_Msg_NE ("??universal_fixed expression interpreted as }!", ErrN, T1); end if; return T1; end Unique_Fixed_Point_Type; ---------------------- -- Valid_Conversion -- ---------------------- function Valid_Conversion (N : Node_Id; Target : Entity_Id; Operand : Node_Id; Report_Errs : Boolean := True) return Boolean is Target_Type : constant Entity_Id := Base_Type (Target); Opnd_Type : Entity_Id := Etype (Operand); Inc_Ancestor : Entity_Id; function Conversion_Check (Valid : Boolean; Msg : String) return Boolean; -- Little routine to post Msg if Valid is False, returns Valid value procedure Conversion_Error_N (Msg : String; N : Node_Or_Entity_Id); -- If Report_Errs, then calls Errout.Error_Msg_N with its arguments procedure Conversion_Error_NE (Msg : String; N : Node_Or_Entity_Id; E : Node_Or_Entity_Id); -- If Report_Errs, then calls Errout.Error_Msg_NE with its arguments function In_Instance_Code return Boolean; -- Return True if expression is within an instance but is not in one of -- the actuals of the instantiation. Type conversions within an instance -- are not rechecked because type visbility may lead to spurious errors, -- but conversions in an actual for a formal object must be checked. function Is_Discrim_Of_Bad_Access_Conversion_Argument (Expr : Node_Id) return Boolean; -- Implicit anonymous-to-named access type conversions are not allowed -- if the "statically deeper than" relationship does not apply to the -- type of the conversion operand. See RM 8.6(28.1) and AARM 8.6(28.d). -- We deal with most such cases elsewhere so that we can emit more -- specific error messages (e.g., if the operand is an access parameter -- or a saooaaat (stand-alone object of an anonymous access type)), but -- here is where we catch the case where the operand is an access -- discriminant selected from a dereference of another such "bad" -- conversion argument. function Valid_Tagged_Conversion (Target_Type : Entity_Id; Opnd_Type : Entity_Id) return Boolean; -- Specifically test for validity of tagged conversions function Valid_Array_Conversion return Boolean; -- Check index and component conformance, and accessibility levels if -- the component types are anonymous access types (Ada 2005). ---------------------- -- Conversion_Check -- ---------------------- function Conversion_Check (Valid : Boolean; Msg : String) return Boolean is begin if not Valid -- A generic unit has already been analyzed and we have verified -- that a particular conversion is OK in that context. Since the -- instance is reanalyzed without relying on the relationships -- established during the analysis of the generic, it is possible -- to end up with inconsistent views of private types. Do not emit -- the error message in such cases. The rest of the machinery in -- Valid_Conversion still ensures the proper compatibility of -- target and operand types. and then not In_Instance_Code then Conversion_Error_N (Msg, Operand); end if; return Valid; end Conversion_Check; ------------------------ -- Conversion_Error_N -- ------------------------ procedure Conversion_Error_N (Msg : String; N : Node_Or_Entity_Id) is begin if Report_Errs then Error_Msg_N (Msg, N); end if; end Conversion_Error_N; ------------------------- -- Conversion_Error_NE -- ------------------------- procedure Conversion_Error_NE (Msg : String; N : Node_Or_Entity_Id; E : Node_Or_Entity_Id) is begin if Report_Errs then Error_Msg_NE (Msg, N, E); end if; end Conversion_Error_NE; ---------------------- -- In_Instance_Code -- ---------------------- function In_Instance_Code return Boolean is Par : Node_Id; begin if not In_Instance then return False; else Par := Parent (N); while Present (Par) loop -- The expression is part of an actual object if it appears in -- the generated object declaration in the instance. if Nkind (Par) = N_Object_Declaration and then Present (Corresponding_Generic_Association (Par)) then return False; else exit when Nkind (Par) in N_Statement_Other_Than_Procedure_Call or else Nkind (Par) in N_Subprogram_Call or else Nkind (Par) in N_Declaration; end if; Par := Parent (Par); end loop; -- Otherwise the expression appears within the instantiated unit return True; end if; end In_Instance_Code; -------------------------------------------------- -- Is_Discrim_Of_Bad_Access_Conversion_Argument -- -------------------------------------------------- function Is_Discrim_Of_Bad_Access_Conversion_Argument (Expr : Node_Id) return Boolean is Exp_Type : Entity_Id := Base_Type (Etype (Expr)); pragma Assert (Is_Access_Type (Exp_Type)); Associated_Node : Node_Id; Deref_Prefix : Node_Id; begin if not Is_Anonymous_Access_Type (Exp_Type) then return False; end if; pragma Assert (Is_Itype (Exp_Type)); Associated_Node := Associated_Node_For_Itype (Exp_Type); if Nkind (Associated_Node) /= N_Discriminant_Specification then return False; -- not the type of an access discriminant end if; -- return False if Expr not of form <prefix>.all.Some_Component if (Nkind (Expr) /= N_Selected_Component) or else (Nkind (Prefix (Expr)) /= N_Explicit_Dereference) then -- conditional expressions, declare expressions ??? return False; end if; Deref_Prefix := Prefix (Prefix (Expr)); Exp_Type := Base_Type (Etype (Deref_Prefix)); -- The "statically deeper relationship" does not apply -- to generic formal access types, so a prefix of such -- a type is a "bad" prefix. if Is_Generic_Formal (Exp_Type) then return True; -- The "statically deeper relationship" does apply to -- any other named access type. elsif not Is_Anonymous_Access_Type (Exp_Type) then return False; end if; pragma Assert (Is_Itype (Exp_Type)); Associated_Node := Associated_Node_For_Itype (Exp_Type); -- The "statically deeper relationship" applies to some -- anonymous access types and not to others. Return -- True for the cases where it does not apply. Also check -- recursively for the -- <prefix>.all.Access_Discrim.all.Access_Discrim case, -- where the correct result depends on <prefix>. return Nkind (Associated_Node) in N_Procedure_Specification | -- access parameter N_Function_Specification | -- access parameter N_Object_Declaration -- saooaaat or else Is_Discrim_Of_Bad_Access_Conversion_Argument (Deref_Prefix); end Is_Discrim_Of_Bad_Access_Conversion_Argument; ---------------------------- -- Valid_Array_Conversion -- ---------------------------- function Valid_Array_Conversion return Boolean is Opnd_Comp_Type : constant Entity_Id := Component_Type (Opnd_Type); Opnd_Comp_Base : constant Entity_Id := Base_Type (Opnd_Comp_Type); Opnd_Index : Node_Id; Opnd_Index_Type : Entity_Id; Target_Comp_Type : constant Entity_Id := Component_Type (Target_Type); Target_Comp_Base : constant Entity_Id := Base_Type (Target_Comp_Type); Target_Index : Node_Id; Target_Index_Type : Entity_Id; begin -- Error if wrong number of dimensions if Number_Dimensions (Target_Type) /= Number_Dimensions (Opnd_Type) then Conversion_Error_N ("incompatible number of dimensions for conversion", Operand); return False; -- Number of dimensions matches else -- Loop through indexes of the two arrays Target_Index := First_Index (Target_Type); Opnd_Index := First_Index (Opnd_Type); while Present (Target_Index) and then Present (Opnd_Index) loop Target_Index_Type := Etype (Target_Index); Opnd_Index_Type := Etype (Opnd_Index); -- Error if index types are incompatible if not (Is_Integer_Type (Target_Index_Type) and then Is_Integer_Type (Opnd_Index_Type)) and then (Root_Type (Target_Index_Type) /= Root_Type (Opnd_Index_Type)) then Conversion_Error_N ("incompatible index types for array conversion", Operand); return False; end if; Next_Index (Target_Index); Next_Index (Opnd_Index); end loop; -- If component types have same base type, all set if Target_Comp_Base = Opnd_Comp_Base then null; -- Here if base types of components are not the same. The only -- time this is allowed is if we have anonymous access types. -- The conversion of arrays of anonymous access types can lead -- to dangling pointers. AI-392 formalizes the accessibility -- checks that must be applied to such conversions to prevent -- out-of-scope references. elsif Ekind (Target_Comp_Base) in E_Anonymous_Access_Type | E_Anonymous_Access_Subprogram_Type and then Ekind (Opnd_Comp_Base) = Ekind (Target_Comp_Base) and then Subtypes_Statically_Match (Target_Comp_Type, Opnd_Comp_Type) then if Type_Access_Level (Target_Type) < Deepest_Type_Access_Level (Opnd_Type) then if In_Instance_Body then Error_Msg_Warn := SPARK_Mode /= On; Conversion_Error_N ("source array type has deeper accessibility " & "level than target<<", Operand); Conversion_Error_N ("\Program_Error [<<", Operand); Rewrite (N, Make_Raise_Program_Error (Sloc (N), Reason => PE_Accessibility_Check_Failed)); Set_Etype (N, Target_Type); return False; -- Conversion not allowed because of accessibility levels else Conversion_Error_N ("source array type has deeper accessibility " & "level than target", Operand); return False; end if; else null; end if; -- All other cases where component base types do not match else Conversion_Error_N ("incompatible component types for array conversion", Operand); return False; end if; -- Check that component subtypes statically match. For numeric -- types this means that both must be either constrained or -- unconstrained. For enumeration types the bounds must match. -- All of this is checked in Subtypes_Statically_Match. if not Subtypes_Statically_Match (Target_Comp_Type, Opnd_Comp_Type) then Conversion_Error_N ("component subtypes must statically match", Operand); return False; end if; end if; return True; end Valid_Array_Conversion; ----------------------------- -- Valid_Tagged_Conversion -- ----------------------------- function Valid_Tagged_Conversion (Target_Type : Entity_Id; Opnd_Type : Entity_Id) return Boolean is begin -- Upward conversions are allowed (RM 4.6(22)) if Covers (Target_Type, Opnd_Type) or else Is_Ancestor (Target_Type, Opnd_Type) then return True; -- Downward conversion are allowed if the operand is class-wide -- (RM 4.6(23)). elsif Is_Class_Wide_Type (Opnd_Type) and then Covers (Opnd_Type, Target_Type) then return True; elsif Covers (Opnd_Type, Target_Type) or else Is_Ancestor (Opnd_Type, Target_Type) then return Conversion_Check (False, "downward conversion of tagged objects not allowed"); -- Ada 2005 (AI-251): The conversion to/from interface types is -- always valid. The types involved may be class-wide (sub)types. elsif Is_Interface (Etype (Base_Type (Target_Type))) or else Is_Interface (Etype (Base_Type (Opnd_Type))) then return True; -- If the operand is a class-wide type obtained through a limited_ -- with clause, and the context includes the nonlimited view, use -- it to determine whether the conversion is legal. elsif Is_Class_Wide_Type (Opnd_Type) and then From_Limited_With (Opnd_Type) and then Present (Non_Limited_View (Etype (Opnd_Type))) and then Is_Interface (Non_Limited_View (Etype (Opnd_Type))) then return True; elsif Is_Access_Type (Opnd_Type) and then Is_Interface (Directly_Designated_Type (Opnd_Type)) then return True; else Conversion_Error_NE ("invalid tagged conversion, not compatible with}", N, First_Subtype (Opnd_Type)); return False; end if; end Valid_Tagged_Conversion; -- Start of processing for Valid_Conversion begin Check_Parameterless_Call (Operand); if Is_Overloaded (Operand) then declare I : Interp_Index; I1 : Interp_Index; It : Interp; It1 : Interp; N1 : Entity_Id; T1 : Entity_Id; begin -- Remove procedure calls, which syntactically cannot appear in -- this context, but which cannot be removed by type checking, -- because the context does not impose a type. -- The node may be labelled overloaded, but still contain only one -- interpretation because others were discarded earlier. If this -- is the case, retain the single interpretation if legal. Get_First_Interp (Operand, I, It); Opnd_Type := It.Typ; Get_Next_Interp (I, It); if Present (It.Typ) and then Opnd_Type /= Standard_Void_Type then -- More than one candidate interpretation is available Get_First_Interp (Operand, I, It); while Present (It.Typ) loop if It.Typ = Standard_Void_Type then Remove_Interp (I); end if; -- When compiling for a system where Address is of a visible -- integer type, spurious ambiguities can be produced when -- arithmetic operations have a literal operand and return -- System.Address or a descendant of it. These ambiguities -- are usually resolved by the context, but for conversions -- there is no context type and the removal of the spurious -- operations must be done explicitly here. if not Address_Is_Private and then Is_Descendant_Of_Address (It.Typ) then Remove_Interp (I); end if; Get_Next_Interp (I, It); end loop; end if; Get_First_Interp (Operand, I, It); I1 := I; It1 := It; if No (It.Typ) then Conversion_Error_N ("illegal operand in conversion", Operand); return False; end if; Get_Next_Interp (I, It); if Present (It.Typ) then N1 := It1.Nam; T1 := It1.Typ; It1 := Disambiguate (Operand, I1, I, Any_Type); if It1 = No_Interp then Conversion_Error_N ("ambiguous operand in conversion", Operand); -- If the interpretation involves a standard operator, use -- the location of the type, which may be user-defined. if Sloc (It.Nam) = Standard_Location then Error_Msg_Sloc := Sloc (It.Typ); else Error_Msg_Sloc := Sloc (It.Nam); end if; Conversion_Error_N -- CODEFIX ("\\possible interpretation#!", Operand); if Sloc (N1) = Standard_Location then Error_Msg_Sloc := Sloc (T1); else Error_Msg_Sloc := Sloc (N1); end if; Conversion_Error_N -- CODEFIX ("\\possible interpretation#!", Operand); return False; end if; end if; Set_Etype (Operand, It1.Typ); Opnd_Type := It1.Typ; end; end if; -- Deal with conversion of integer type to address if the pragma -- Allow_Integer_Address is in effect. We convert the conversion to -- an unchecked conversion in this case and we are all done. if Address_Integer_Convert_OK (Opnd_Type, Target_Type) then Rewrite (N, Unchecked_Convert_To (Target_Type, Expression (N))); Analyze_And_Resolve (N, Target_Type); return True; end if; -- If we are within a child unit, check whether the type of the -- expression has an ancestor in a parent unit, in which case it -- belongs to its derivation class even if the ancestor is private. -- See RM 7.3.1 (5.2/3). Inc_Ancestor := Get_Incomplete_View_Of_Ancestor (Opnd_Type); -- Numeric types if Is_Numeric_Type (Target_Type) then -- A universal fixed expression can be converted to any numeric type if Opnd_Type = Universal_Fixed then return True; -- Also no need to check when in an instance or inlined body, because -- the legality has been established when the template was analyzed. -- Furthermore, numeric conversions may occur where only a private -- view of the operand type is visible at the instantiation point. -- This results in a spurious error if we check that the operand type -- is a numeric type. -- Note: in a previous version of this unit, the following tests were -- applied only for generated code (Comes_From_Source set to False), -- but in fact the test is required for source code as well, since -- this situation can arise in source code. elsif In_Instance_Code or else In_Inlined_Body then return True; -- Otherwise we need the conversion check else return Conversion_Check (Is_Numeric_Type (Opnd_Type) or else (Present (Inc_Ancestor) and then Is_Numeric_Type (Inc_Ancestor)), "illegal operand for numeric conversion"); end if; -- Array types elsif Is_Array_Type (Target_Type) then if not Is_Array_Type (Opnd_Type) or else Opnd_Type = Any_Composite or else Opnd_Type = Any_String then Conversion_Error_N ("illegal operand for array conversion", Operand); return False; else return Valid_Array_Conversion; end if; -- Ada 2005 (AI-251): Internally generated conversions of access to -- interface types added to force the displacement of the pointer to -- reference the corresponding dispatch table. elsif not Comes_From_Source (N) and then Is_Access_Type (Target_Type) and then Is_Interface (Designated_Type (Target_Type)) then return True; -- Ada 2005 (AI-251): Anonymous access types where target references an -- interface type. elsif Is_Access_Type (Opnd_Type) and then Ekind (Target_Type) in E_General_Access_Type | E_Anonymous_Access_Type and then Is_Interface (Directly_Designated_Type (Target_Type)) then -- Check the static accessibility rule of 4.6(17). Note that the -- check is not enforced when within an instance body, since the -- RM requires such cases to be caught at run time. -- If the operand is a rewriting of an allocator no check is needed -- because there are no accessibility issues. if Nkind (Original_Node (N)) = N_Allocator then null; elsif Ekind (Target_Type) /= E_Anonymous_Access_Type then if Type_Access_Level (Opnd_Type) > Deepest_Type_Access_Level (Target_Type) then -- In an instance, this is a run-time check, but one we know -- will fail, so generate an appropriate warning. The raise -- will be generated by Expand_N_Type_Conversion. if In_Instance_Body then Error_Msg_Warn := SPARK_Mode /= On; Conversion_Error_N ("cannot convert local pointer to non-local access type<<", Operand); Conversion_Error_N ("\Program_Error [<<", Operand); else Conversion_Error_N ("cannot convert local pointer to non-local access type", Operand); return False; end if; -- Special accessibility checks are needed in the case of access -- discriminants declared for a limited type. elsif Ekind (Opnd_Type) = E_Anonymous_Access_Type and then not Is_Local_Anonymous_Access (Opnd_Type) then -- When the operand is a selected access discriminant the check -- needs to be made against the level of the object denoted by -- the prefix of the selected name (Object_Access_Level handles -- checking the prefix of the operand for this case). if Nkind (Operand) = N_Selected_Component and then Object_Access_Level (Operand) > Deepest_Type_Access_Level (Target_Type) then -- In an instance, this is a run-time check, but one we know -- will fail, so generate an appropriate warning. The raise -- will be generated by Expand_N_Type_Conversion. if In_Instance_Body then Error_Msg_Warn := SPARK_Mode /= On; Conversion_Error_N ("cannot convert access discriminant to non-local " & "access type<<", Operand); Conversion_Error_N ("\Program_Error [<<", Operand); -- Real error if not in instance body else Conversion_Error_N ("cannot convert access discriminant to non-local " & "access type", Operand); return False; end if; end if; -- The case of a reference to an access discriminant from -- within a limited type declaration (which will appear as -- a discriminal) is always illegal because the level of the -- discriminant is considered to be deeper than any (nameable) -- access type. if Is_Entity_Name (Operand) and then not Is_Local_Anonymous_Access (Opnd_Type) and then Ekind (Entity (Operand)) in E_In_Parameter | E_Constant and then Present (Discriminal_Link (Entity (Operand))) then Conversion_Error_N ("discriminant has deeper accessibility level than target", Operand); return False; end if; end if; end if; return True; -- General and anonymous access types elsif Ekind (Target_Type) in E_General_Access_Type | E_Anonymous_Access_Type and then Conversion_Check (Is_Access_Type (Opnd_Type) and then Ekind (Opnd_Type) not in E_Access_Subprogram_Type | E_Access_Protected_Subprogram_Type, "must be an access-to-object type") then if Is_Access_Constant (Opnd_Type) and then not Is_Access_Constant (Target_Type) then Conversion_Error_N ("access-to-constant operand type not allowed", Operand); return False; end if; -- Check the static accessibility rule of 4.6(17). Note that the -- check is not enforced when within an instance body, since the RM -- requires such cases to be caught at run time. if Ekind (Target_Type) /= E_Anonymous_Access_Type or else Is_Local_Anonymous_Access (Target_Type) or else Nkind (Associated_Node_For_Itype (Target_Type)) = N_Object_Declaration then -- Ada 2012 (AI05-0149): Perform legality checking on implicit -- conversions from an anonymous access type to a named general -- access type. Such conversions are not allowed in the case of -- access parameters and stand-alone objects of an anonymous -- access type. The implicit conversion case is recognized by -- testing that Comes_From_Source is False and that it's been -- rewritten. The Comes_From_Source test isn't sufficient because -- nodes in inlined calls to predefined library routines can have -- Comes_From_Source set to False. (Is there a better way to test -- for implicit conversions???). -- -- Do not treat a rewritten 'Old attribute reference like other -- rewrite substitutions. This makes a difference, for example, -- in the case where we are generating the expansion of a -- membership test of the form -- Saooaaat'Old in Named_Access_Type -- because in this case Valid_Conversion needs to return True -- (otherwise the expansion will be False - see the call site -- in exp_ch4.adb). if Ada_Version >= Ada_2012 and then not Comes_From_Source (N) and then Is_Rewrite_Substitution (N) and then not Is_Attribute_Old (Original_Node (N)) and then Ekind (Base_Type (Target_Type)) = E_General_Access_Type and then Ekind (Opnd_Type) = E_Anonymous_Access_Type then if Is_Itype (Opnd_Type) then -- Implicit conversions aren't allowed for objects of an -- anonymous access type, since such objects have nonstatic -- levels in Ada 2012. if Nkind (Associated_Node_For_Itype (Opnd_Type)) = N_Object_Declaration then Conversion_Error_N ("implicit conversion of stand-alone anonymous " & "access object not allowed", Operand); return False; -- Implicit conversions aren't allowed for anonymous access -- parameters. We exclude anonymous access results as well -- as universal_access "=". elsif not Is_Local_Anonymous_Access (Opnd_Type) and then Nkind (Associated_Node_For_Itype (Opnd_Type)) in N_Function_Specification | N_Procedure_Specification and then Nkind (Parent (N)) not in N_Op_Eq | N_Op_Ne then Conversion_Error_N ("implicit conversion of anonymous access parameter " & "not allowed", Operand); return False; -- Detect access discriminant values that are illegal -- implicit anonymous-to-named access conversion operands. elsif Is_Discrim_Of_Bad_Access_Conversion_Argument (Operand) then Conversion_Error_N ("implicit conversion of anonymous access value " & "not allowed", Operand); return False; -- In other cases, the level of the operand's type must be -- statically less deep than that of the target type, else -- implicit conversion is disallowed (by RM12-8.6(27.1/3)). elsif Type_Access_Level (Opnd_Type) > Deepest_Type_Access_Level (Target_Type) then Conversion_Error_N ("implicit conversion of anonymous access value " & "violates accessibility", Operand); return False; end if; end if; -- Check if the operand is deeper than the target type, taking -- care to avoid the case where we are converting a result of a -- function returning an anonymous access type since the "master -- of the call" would be target type of the conversion unless -- the target type is anonymous access as well - see RM 3.10.2 -- (10.3/3). elsif Type_Access_Level (Opnd_Type) > Deepest_Type_Access_Level (Target_Type) and then (Nkind (Associated_Node_For_Itype (Opnd_Type)) /= N_Function_Specification or else Ekind (Target_Type) in Anonymous_Access_Kind) then -- In an instance, this is a run-time check, but one we know -- will fail, so generate an appropriate warning. The raise -- will be generated by Expand_N_Type_Conversion. if In_Instance_Body then Error_Msg_Warn := SPARK_Mode /= On; Conversion_Error_N ("cannot convert local pointer to non-local access type<<", Operand); Conversion_Error_N ("\Program_Error [<<", Operand); -- If not in an instance body, this is a real error else -- Avoid generation of spurious error message if not Error_Posted (N) then Conversion_Error_N ("cannot convert local pointer to non-local access type", Operand); end if; return False; end if; -- Special accessibility checks are needed in the case of access -- discriminants declared for a limited type. elsif Ekind (Opnd_Type) = E_Anonymous_Access_Type and then not Is_Local_Anonymous_Access (Opnd_Type) then -- When the operand is a selected access discriminant the check -- needs to be made against the level of the object denoted by -- the prefix of the selected name (Object_Access_Level handles -- checking the prefix of the operand for this case). if Nkind (Operand) = N_Selected_Component and then Object_Access_Level (Operand) > Deepest_Type_Access_Level (Target_Type) then -- In an instance, this is a run-time check, but one we know -- will fail, so generate an appropriate warning. The raise -- will be generated by Expand_N_Type_Conversion. if In_Instance_Body then Error_Msg_Warn := SPARK_Mode /= On; Conversion_Error_N ("cannot convert access discriminant to non-local " & "access type<<", Operand); Conversion_Error_N ("\Program_Error [<<", Operand); -- If not in an instance body, this is a real error else Conversion_Error_N ("cannot convert access discriminant to non-local " & "access type", Operand); return False; end if; end if; -- The case of a reference to an access discriminant from -- within a limited type declaration (which will appear as -- a discriminal) is always illegal because the level of the -- discriminant is considered to be deeper than any (nameable) -- access type. if Is_Entity_Name (Operand) and then Ekind (Entity (Operand)) in E_In_Parameter | E_Constant and then Present (Discriminal_Link (Entity (Operand))) then Conversion_Error_N ("discriminant has deeper accessibility level than target", Operand); return False; end if; end if; end if; -- In the presence of limited_with clauses we have to use nonlimited -- views, if available. Check_Limited : declare function Full_Designated_Type (T : Entity_Id) return Entity_Id; -- Helper function to handle limited views -------------------------- -- Full_Designated_Type -- -------------------------- function Full_Designated_Type (T : Entity_Id) return Entity_Id is Desig : constant Entity_Id := Designated_Type (T); begin -- Handle the limited view of a type if From_Limited_With (Desig) and then Has_Non_Limited_View (Desig) then return Available_View (Desig); else return Desig; end if; end Full_Designated_Type; -- Local Declarations Target : constant Entity_Id := Full_Designated_Type (Target_Type); Opnd : constant Entity_Id := Full_Designated_Type (Opnd_Type); Same_Base : constant Boolean := Base_Type (Target) = Base_Type (Opnd); -- Start of processing for Check_Limited begin if Is_Tagged_Type (Target) then return Valid_Tagged_Conversion (Target, Opnd); else if not Same_Base then Conversion_Error_NE ("target designated type not compatible with }", N, Base_Type (Opnd)); return False; -- Ada 2005 AI-384: legality rule is symmetric in both -- designated types. The conversion is legal (with possible -- constraint check) if either designated type is -- unconstrained. elsif Subtypes_Statically_Match (Target, Opnd) or else (Has_Discriminants (Target) and then (not Is_Constrained (Opnd) or else not Is_Constrained (Target))) then -- Special case, if Value_Size has been used to make the -- sizes different, the conversion is not allowed even -- though the subtypes statically match. if Known_Static_RM_Size (Target) and then Known_Static_RM_Size (Opnd) and then RM_Size (Target) /= RM_Size (Opnd) then Conversion_Error_NE ("target designated subtype not compatible with }", N, Opnd); Conversion_Error_NE ("\because sizes of the two designated subtypes differ", N, Opnd); return False; -- Normal case where conversion is allowed else return True; end if; else Error_Msg_NE ("target designated subtype not compatible with }", N, Opnd); return False; end if; end if; end Check_Limited; -- Access to subprogram types. If the operand is an access parameter, -- the type has a deeper accessibility that any master, and cannot be -- assigned. We must make an exception if the conversion is part of an -- assignment and the target is the return object of an extended return -- statement, because in that case the accessibility check takes place -- after the return. elsif Is_Access_Subprogram_Type (Target_Type) -- Note: this test of Opnd_Type is there to prevent entering this -- branch in the case of a remote access to subprogram type, which -- is internally represented as an E_Record_Type. and then Is_Access_Type (Opnd_Type) then if Ekind (Base_Type (Opnd_Type)) = E_Anonymous_Access_Subprogram_Type and then Is_Entity_Name (Operand) and then Ekind (Entity (Operand)) = E_In_Parameter and then (Nkind (Parent (N)) /= N_Assignment_Statement or else not Is_Entity_Name (Name (Parent (N))) or else not Is_Return_Object (Entity (Name (Parent (N))))) then Conversion_Error_N ("illegal attempt to store anonymous access to subprogram", Operand); Conversion_Error_N ("\value has deeper accessibility than any master " & "(RM 3.10.2 (13))", Operand); Error_Msg_NE ("\use named access type for& instead of access parameter", Operand, Entity (Operand)); end if; -- Check that the designated types are subtype conformant Check_Subtype_Conformant (New_Id => Designated_Type (Target_Type), Old_Id => Designated_Type (Opnd_Type), Err_Loc => N); -- Check the static accessibility rule of 4.6(20) if Type_Access_Level (Opnd_Type) > Deepest_Type_Access_Level (Target_Type) then Conversion_Error_N ("operand type has deeper accessibility level than target", Operand); -- Check that if the operand type is declared in a generic body, -- then the target type must be declared within that same body -- (enforces last sentence of 4.6(20)). elsif Present (Enclosing_Generic_Body (Opnd_Type)) then declare O_Gen : constant Node_Id := Enclosing_Generic_Body (Opnd_Type); T_Gen : Node_Id; begin T_Gen := Enclosing_Generic_Body (Target_Type); while Present (T_Gen) and then T_Gen /= O_Gen loop T_Gen := Enclosing_Generic_Body (T_Gen); end loop; if T_Gen /= O_Gen then Conversion_Error_N ("target type must be declared in same generic body " & "as operand type", N); end if; end; end if; return True; -- Remote access to subprogram types elsif Is_Remote_Access_To_Subprogram_Type (Target_Type) and then Is_Remote_Access_To_Subprogram_Type (Opnd_Type) then -- It is valid to convert from one RAS type to another provided -- that their specification statically match. -- Note: at this point, remote access to subprogram types have been -- expanded to their E_Record_Type representation, and we need to -- go back to the original access type definition using the -- Corresponding_Remote_Type attribute in order to check that the -- designated profiles match. pragma Assert (Ekind (Target_Type) = E_Record_Type); pragma Assert (Ekind (Opnd_Type) = E_Record_Type); Check_Subtype_Conformant (New_Id => Designated_Type (Corresponding_Remote_Type (Target_Type)), Old_Id => Designated_Type (Corresponding_Remote_Type (Opnd_Type)), Err_Loc => N); return True; -- If it was legal in the generic, it's legal in the instance elsif In_Instance_Body then return True; -- If both are tagged types, check legality of view conversions elsif Is_Tagged_Type (Target_Type) and then Is_Tagged_Type (Opnd_Type) then return Valid_Tagged_Conversion (Target_Type, Opnd_Type); -- Types derived from the same root type are convertible elsif Root_Type (Target_Type) = Root_Type (Opnd_Type) then return True; -- In an instance or an inlined body, there may be inconsistent views of -- the same type, or of types derived from a common root. elsif (In_Instance or In_Inlined_Body) and then Root_Type (Underlying_Type (Target_Type)) = Root_Type (Underlying_Type (Opnd_Type)) then return True; -- Special check for common access type error case elsif Ekind (Target_Type) = E_Access_Type and then Is_Access_Type (Opnd_Type) then Conversion_Error_N ("target type must be general access type!", N); Conversion_Error_NE -- CODEFIX ("add ALL to }!", N, Target_Type); return False; -- Here we have a real conversion error else -- Check for missing regular with_clause when only a limited view of -- target is available. if From_Limited_With (Opnd_Type) and then In_Package_Body then Conversion_Error_NE ("invalid conversion, not compatible with limited view of }", N, Opnd_Type); Conversion_Error_NE ("\add with_clause for& to current unit!", N, Scope (Opnd_Type)); elsif Is_Access_Type (Opnd_Type) and then From_Limited_With (Designated_Type (Opnd_Type)) and then In_Package_Body then Conversion_Error_NE ("invalid conversion, not compatible with }", N, Opnd_Type); Conversion_Error_NE ("\add with_clause for& to current unit!", N, Scope (Designated_Type (Opnd_Type))); else Conversion_Error_NE ("invalid conversion, not compatible with }", N, Opnd_Type); end if; return False; end if; end Valid_Conversion; end Sem_Res;

37.251317

79

0.549982

8b9141fb35e15795a5b9b3606227ff05e84cb087

12,327

ads

Ada

src/bitmap_fonts/giza-bitmap_fonts-freeserifitalic8pt7b.ads

Fabien-Chouteau/Giza

9f6c167666dbba8f0e5f0ba3e33825c0b3f399bd

[ "BSD-3-Clause" ]

7

2017-10-18T02:40:24.000Z

2020-12-19T22:41:19.000Z

src/bitmap_fonts/giza-bitmap_fonts-freeserifitalic8pt7b.ads

Fabien-Chouteau/Giza

9f6c167666dbba8f0e5f0ba3e33825c0b3f399bd

[ "BSD-3-Clause" ]

null

src/bitmap_fonts/giza-bitmap_fonts-freeserifitalic8pt7b.ads

Fabien-Chouteau/Giza

9f6c167666dbba8f0e5f0ba3e33825c0b3f399bd

[ "BSD-3-Clause" ]

2

2019-05-06T08:30:26.000Z

2020-11-22T11:27:27.000Z

package Giza.Bitmap_Fonts.FreeSerifItalic8pt7b is Font : constant Giza.Font.Ref_Const; private FreeSerifItalic8pt7bBitmaps : aliased constant Font_Bitmap := ( 16#11#, 16#12#, 16#22#, 16#44#, 16#00#, 16#C0#, 16#DE#, 16#E5#, 16#40#, 16#09#, 16#04#, 16#84#, 16#8F#, 16#F1#, 16#21#, 16#20#, 16#91#, 16#FC#, 16#48#, 16#24#, 16#22#, 16#00#, 16#04#, 16#71#, 16#BB#, 16#56#, 16#86#, 16#07#, 16#0F#, 16#17#, 16#6E#, 16#BB#, 16#C2#, 16#04#, 16#00#, 16#38#, 16#86#, 16#78#, 16#E5#, 16#0C#, 16#50#, 16#C6#, 16#0C#, 16#CE#, 16#75#, 16#90#, 16#B1#, 16#0B#, 16#11#, 16#32#, 16#11#, 16#C0#, 16#07#, 16#03#, 16#60#, 16#D8#, 16#3C#, 16#0C#, 16#0F#, 16#76#, 16#4B#, 16#1C#, 16#C2#, 16#38#, 16#C7#, 16#DC#, 16#FA#, 16#00#, 16#C4#, 16#46#, 16#33#, 16#18#, 16#C6#, 16#30#, 16#84#, 16#10#, 16#21#, 16#04#, 16#21#, 16#8C#, 16#63#, 16#39#, 16#88#, 16#88#, 16#00#, 16#30#, 16#CA#, 16#5E#, 16#6A#, 16#93#, 16#00#, 16#10#, 16#20#, 16#47#, 16#F1#, 16#02#, 16#04#, 16#08#, 16#56#, 16#E0#, 16#C0#, 16#02#, 16#08#, 16#10#, 16#41#, 16#82#, 16#0C#, 16#10#, 16#40#, 16#82#, 16#00#, 16#1E#, 16#32#, 16#63#, 16#63#, 16#E3#, 16#C3#, 16#C7#, 16#C6#, 16#C6#, 16#4C#, 16#78#, 16#04#, 16#E0#, 16#82#, 16#18#, 16#41#, 16#04#, 16#30#, 16#82#, 16#3C#, 16#1E#, 16#27#, 16#43#, 16#03#, 16#02#, 16#04#, 16#08#, 16#10#, 16#20#, 16#62#, 16#7C#, 16#1E#, 16#23#, 16#03#, 16#0C#, 16#3C#, 16#0E#, 16#06#, 16#06#, 16#06#, 16#0C#, 16#F0#, 16#01#, 16#02#, 16#0E#, 16#12#, 16#24#, 16#24#, 16#44#, 16#FE#, 16#08#, 16#08#, 16#08#, 16#0F#, 16#10#, 16#10#, 16#1C#, 16#0E#, 16#06#, 16#06#, 16#06#, 16#04#, 16#08#, 16#F0#, 16#03#, 16#87#, 16#06#, 16#06#, 16#06#, 16#E3#, 16#9B#, 16#0D#, 16#86#, 16#C3#, 16#63#, 16#11#, 16#87#, 16#80#, 16#7E#, 16#82#, 16#04#, 16#04#, 16#08#, 16#08#, 16#10#, 16#20#, 16#20#, 16#40#, 16#40#, 16#1F#, 16#18#, 16#CC#, 16#66#, 16#31#, 16#B0#, 16#60#, 16#D9#, 16#86#, 16#C3#, 16#61#, 16#99#, 16#87#, 16#80#, 16#3C#, 16#62#, 16#C3#, 16#C3#, 16#C3#, 16#C7#, 16#7E#, 16#0C#, 16#18#, 16#70#, 16#C0#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#30#, 16#00#, 16#04#, 16#44#, 16#80#, 16#03#, 16#0C#, 16#30#, 16#C0#, 16#E0#, 16#38#, 16#06#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#30#, 16#0C#, 16#03#, 16#07#, 16#1C#, 16#60#, 16#80#, 16#79#, 16#30#, 16#C3#, 16#18#, 16#42#, 16#10#, 16#40#, 16#0C#, 16#00#, 16#0F#, 16#06#, 16#19#, 16#9B#, 16#E6#, 16#9D#, 16#93#, 16#B2#, 16#76#, 16#4E#, 16#CA#, 16#6F#, 16#86#, 16#00#, 16#3E#, 16#00#, 16#02#, 16#00#, 16#80#, 16#70#, 16#2C#, 16#0B#, 16#04#, 16#C1#, 16#F0#, 16#84#, 16#41#, 16#90#, 16#6E#, 16#3C#, 16#3F#, 16#86#, 16#31#, 16#8C#, 16#63#, 16#11#, 16#8F#, 16#83#, 16#18#, 16#86#, 16#21#, 16#98#, 16#CF#, 16#E0#, 16#0F#, 16#23#, 16#18#, 16#C1#, 16#30#, 16#0C#, 16#01#, 16#80#, 16#30#, 16#06#, 16#00#, 16#C0#, 16#0C#, 16#20#, 16#F8#, 16#00#, 16#3F#, 16#81#, 16#86#, 16#18#, 16#31#, 16#83#, 16#10#, 16#33#, 16#03#, 16#30#, 16#32#, 16#06#, 16#20#, 16#E6#, 16#18#, 16#FE#, 16#00#, 16#3F#, 16#F1#, 16#82#, 16#18#, 16#21#, 16#80#, 16#11#, 16#83#, 16#F0#, 16#32#, 16#02#, 16#00#, 16#20#, 16#46#, 16#0C#, 16#FF#, 16#80#, 16#3F#, 16#F1#, 16#82#, 16#18#, 16#21#, 16#80#, 16#11#, 16#83#, 16#F0#, 16#32#, 16#02#, 16#00#, 16#20#, 16#06#, 16#00#, 16#F0#, 16#00#, 16#0F#, 16#23#, 16#18#, 16#C1#, 16#30#, 16#26#, 16#01#, 16#80#, 16#30#, 16#F6#, 16#0C#, 16#C1#, 16#0C#, 16#20#, 16#F8#, 16#00#, 16#3E#, 16#F1#, 16#82#, 16#18#, 16#61#, 16#06#, 16#10#, 16#43#, 16#FC#, 16#30#, 16#C2#, 16#0C#, 16#20#, 16#86#, 16#18#, 16#F3#, 16#C0#, 16#3C#, 16#61#, 16#86#, 16#10#, 16#C3#, 16#08#, 16#21#, 16#8F#, 16#00#, 16#0F#, 16#06#, 16#04#, 16#04#, 16#0C#, 16#0C#, 16#08#, 16#08#, 16#18#, 16#D0#, 16#E0#, 16#3E#, 16#E3#, 16#08#, 16#62#, 16#0D#, 16#81#, 16#40#, 16#78#, 16#0D#, 16#01#, 16#30#, 16#23#, 16#0C#, 16#23#, 16#DF#, 16#00#, 16#3E#, 16#06#, 16#01#, 16#80#, 16#60#, 16#10#, 16#0C#, 16#03#, 16#00#, 16#80#, 16#20#, 16#58#, 16#2F#, 16#F8#, 16#38#, 16#1C#, 16#20#, 16#61#, 16#C3#, 16#87#, 16#16#, 16#1C#, 16#50#, 16#B2#, 16#C2#, 16#53#, 16#09#, 16#48#, 16#46#, 16#21#, 16#11#, 16#8E#, 16#4F#, 16#00#, 16#38#, 16#F1#, 16#86#, 16#1C#, 16#41#, 16#44#, 16#14#, 16#42#, 16#6C#, 16#22#, 16#82#, 16#28#, 16#21#, 16#84#, 16#10#, 16#E1#, 16#00#, 16#0F#, 16#06#, 16#63#, 16#0D#, 16#83#, 16#60#, 16#F0#, 16#3C#, 16#1B#, 16#06#, 16#C3#, 16#19#, 16#83#, 16#C0#, 16#3F#, 16#86#, 16#31#, 16#8C#, 16#63#, 16#11#, 16#8F#, 16#C3#, 16#00#, 16#80#, 16#20#, 16#18#, 16#0F#, 16#00#, 16#0F#, 16#06#, 16#63#, 16#0D#, 16#83#, 16#60#, 16#F0#, 16#3C#, 16#0F#, 16#06#, 16#C1#, 16#B0#, 16#C6#, 16#40#, 16#60#, 16#30#, 16#B7#, 16#C0#, 16#3F#, 16#86#, 16#31#, 16#8C#, 16#63#, 16#11#, 16#8F#, 16#C3#, 16#60#, 16#8C#, 16#23#, 16#18#, 16#EF#, 16#1C#, 16#1C#, 16#99#, 16#8C#, 16#46#, 16#01#, 16#80#, 16#60#, 16#18#, 16#8C#, 16#46#, 16#33#, 16#07#, 16#00#, 16#7F#, 16#D6#, 16#29#, 16#88#, 16#60#, 16#10#, 16#0C#, 16#03#, 16#00#, 16#80#, 16#20#, 16#18#, 16#0F#, 16#80#, 16#79#, 16#EC#, 16#19#, 16#82#, 16#30#, 16#44#, 16#09#, 16#82#, 16#30#, 16#46#, 16#08#, 16#C2#, 16#18#, 16#41#, 16#F0#, 16#00#, 16#F1#, 16#D8#, 16#26#, 16#11#, 16#84#, 16#22#, 16#08#, 16#82#, 16#40#, 16#E0#, 16#38#, 16#0C#, 16#02#, 16#00#, 16#F7#, 16#9D#, 16#8C#, 16#26#, 16#31#, 16#18#, 16#C4#, 16#27#, 16#20#, 16#AD#, 16#02#, 16#94#, 16#0C#, 16#60#, 16#31#, 16#80#, 16#84#, 16#02#, 16#10#, 16#00#, 16#3C#, 16#E3#, 16#08#, 16#62#, 16#04#, 16#80#, 16#E0#, 16#08#, 16#03#, 16#80#, 16#90#, 16#23#, 16#08#, 16#63#, 16#9F#, 16#00#, 16#F3#, 16#B0#, 16#98#, 16#84#, 16#82#, 16#81#, 16#C0#, 16#C0#, 16#60#, 16#20#, 16#10#, 16#3C#, 16#00#, 16#3F#, 16#C8#, 16#24#, 16#18#, 16#0C#, 16#06#, 16#03#, 16#00#, 16#80#, 16#40#, 16#30#, 16#58#, 16#2F#, 16#F8#, 16#0C#, 16#41#, 16#04#, 16#10#, 16#82#, 16#08#, 16#21#, 16#04#, 16#10#, 16#E0#, 16#83#, 16#04#, 16#10#, 16#20#, 16#83#, 16#04#, 16#10#, 16#20#, 16#80#, 16#1C#, 16#10#, 16#82#, 16#08#, 16#21#, 16#04#, 16#10#, 16#41#, 16#08#, 16#E0#, 16#10#, 16#50#, 16#A2#, 16#24#, 16#50#, 16#C0#, 16#FF#, 16#A4#, 16#1F#, 16#18#, 16#98#, 16#58#, 16#6C#, 16#26#, 16#31#, 16#FC#, 16#30#, 16#10#, 16#10#, 16#20#, 16#2E#, 16#33#, 16#63#, 16#43#, 16#46#, 16#4C#, 16#78#, 16#1F#, 16#33#, 16#60#, 16#C0#, 16#C0#, 16#C4#, 16#78#, 16#03#, 16#00#, 16#80#, 16#40#, 16#40#, 16#E1#, 16#91#, 16#89#, 16#8C#, 16#C6#, 16#67#, 16#5D#, 16#C0#, 16#1C#, 16#D6#, 16#76#, 16#E3#, 16#07#, 16#80#, 16#03#, 16#C0#, 16#80#, 16#40#, 16#10#, 16#0C#, 16#07#, 16#80#, 16#80#, 16#20#, 16#08#, 16#04#, 16#01#, 16#00#, 16#40#, 16#10#, 16#08#, 16#0C#, 16#00#, 16#1C#, 16#77#, 16#66#, 16#66#, 16#1C#, 16#60#, 16#78#, 16#84#, 16#84#, 16#78#, 16#30#, 16#08#, 16#04#, 16#04#, 16#02#, 16#39#, 16#6D#, 16#C6#, 16#C6#, 16#43#, 16#23#, 16#71#, 16#C0#, 16#30#, 16#00#, 16#C4#, 16#4C#, 16#88#, 16#E0#, 16#06#, 16#00#, 16#00#, 16#00#, 16#C1#, 16#02#, 16#04#, 16#18#, 16#20#, 16#40#, 16#83#, 16#1C#, 16#00#, 16#30#, 16#20#, 16#41#, 16#02#, 16#E4#, 16#9A#, 16#38#, 16#58#, 16#97#, 16#30#, 16#72#, 16#22#, 16#64#, 16#44#, 16#CD#, 16#E0#, 16#67#, 16#62#, 16#BE#, 16#73#, 16#46#, 16#64#, 16#44#, 16#44#, 16#4E#, 16#C4#, 16#C0#, 16#67#, 16#3B#, 16#66#, 16#64#, 16#44#, 16#4D#, 16#CE#, 16#1E#, 16#33#, 16#63#, 16#C3#, 16#C6#, 16#CC#, 16#78#, 16#37#, 16#0C#, 16#C4#, 16#66#, 16#32#, 16#31#, 16#30#, 16#F0#, 16#80#, 16#40#, 16#70#, 16#00#, 16#1F#, 16#32#, 16#62#, 16#C2#, 16#C4#, 16#DC#, 16#E4#, 16#0C#, 16#08#, 16#3C#, 16#6C#, 16#C2#, 16#18#, 16#41#, 16#0C#, 16#00#, 16#31#, 16#B6#, 16#0C#, 16#9A#, 16#67#, 16#00#, 16#27#, 16#64#, 16#44#, 16#8E#, 16#C2#, 16#42#, 16#C6#, 16#86#, 16#9C#, 16#9C#, 16#EE#, 16#62#, 16#C4#, 16#C9#, 16#A3#, 16#86#, 16#08#, 16#00#, 16#E2#, 16#24#, 16#44#, 16#D8#, 16#9D#, 16#23#, 16#A8#, 16#66#, 16#08#, 16#80#, 16#36#, 16#B4#, 16#40#, 16#83#, 16#09#, 16#23#, 16#00#, 16#61#, 16#31#, 16#11#, 16#12#, 16#1C#, 16#0C#, 16#08#, 16#10#, 16#20#, 16#C0#, 16#3E#, 16#88#, 16#20#, 16#82#, 16#08#, 16#3C#, 16#0E#, 16#08#, 16#41#, 16#0C#, 16#21#, 16#82#, 16#10#, 16#41#, 16#0C#, 16#30#, 16#E3#, 16#C0#, 16#FF#, 16#E0#, 16#3C#, 16#30#, 16#82#, 16#18#, 16#41#, 16#04#, 16#38#, 16#82#, 16#08#, 16#61#, 16#08#, 16#00#, 16#E3#, 16#38#); FreeSerifItalic8pt7bGlyphs : aliased constant Glyph_Array := ( (0, 0, 0, 4, 0, 1), -- 0x20 ' ' (0, 4, 11, 5, 1, -10), -- 0x21 '!' (6, 5, 4, 5, 2, -10), -- 0x22 '"' (9, 9, 11, 8, 0, -10), -- 0x23 '#' (22, 7, 14, 8, 1, -11), -- 0x24 '$' (35, 12, 11, 13, 1, -10), -- 0x25 '%' (52, 10, 11, 12, 1, -10), -- 0x26 '&' (66, 2, 4, 3, 2, -10), -- 0x27 ''' (67, 5, 14, 5, 1, -10), -- 0x28 '(' (76, 5, 14, 5, 1, -10), -- 0x29 ')' (85, 6, 7, 8, 2, -10), -- 0x2A '*' (91, 7, 8, 11, 2, -7), -- 0x2B '+' (98, 2, 4, 4, 0, -1), -- 0x2C ',' (99, 3, 1, 5, 1, -3), -- 0x2D '-' (100, 2, 1, 4, 0, 0), -- 0x2E '.' (101, 7, 11, 5, 0, -10), -- 0x2F '/' (111, 8, 11, 8, 1, -10), -- 0x30 '0' (122, 6, 12, 8, 1, -11), -- 0x31 '1' (131, 8, 11, 8, 0, -10), -- 0x32 '2' (142, 8, 11, 8, 0, -10), -- 0x33 '3' (153, 8, 11, 8, 0, -10), -- 0x34 '4' (164, 8, 11, 8, 1, -10), -- 0x35 '5' (175, 9, 12, 8, 0, -11), -- 0x36 '6' (189, 8, 11, 8, 1, -10), -- 0x37 '7' (200, 9, 12, 8, 0, -11), -- 0x38 '8' (214, 8, 11, 8, 1, -10), -- 0x39 '9' (225, 4, 7, 4, 1, -6), -- 0x3A ':' (229, 4, 9, 4, 1, -6), -- 0x3B ';' (234, 8, 8, 9, 1, -7), -- 0x3C '<' (242, 8, 4, 11, 1, -5), -- 0x3D '=' (246, 8, 8, 9, 1, -7), -- 0x3E '>' (254, 6, 11, 7, 2, -10), -- 0x3F '?' (263, 11, 11, 12, 1, -10), -- 0x40 '@' (279, 10, 11, 10, 0, -10), -- 0x41 'A' (293, 10, 11, 9, 0, -10), -- 0x42 'B' (307, 11, 11, 10, 1, -10), -- 0x43 'C' (323, 12, 11, 11, 0, -10), -- 0x44 'D' (340, 12, 11, 9, 0, -10), -- 0x45 'E' (357, 12, 11, 9, 0, -10), -- 0x46 'F' (374, 11, 11, 11, 1, -10), -- 0x47 'G' (390, 12, 11, 11, 0, -10), -- 0x48 'H' (407, 6, 11, 5, 0, -10), -- 0x49 'I' (416, 8, 11, 7, 0, -10), -- 0x4A 'J' (427, 11, 11, 10, 0, -10), -- 0x4B 'K' (443, 10, 11, 9, 0, -10), -- 0x4C 'L' (457, 14, 11, 13, 0, -10), -- 0x4D 'M' (477, 12, 11, 11, 0, -10), -- 0x4E 'N' (494, 10, 11, 11, 1, -10), -- 0x4F 'O' (508, 10, 11, 9, 0, -10), -- 0x50 'P' (522, 10, 14, 11, 1, -10), -- 0x51 'Q' (540, 10, 11, 10, 0, -10), -- 0x52 'R' (554, 9, 11, 7, 0, -10), -- 0x53 'S' (567, 10, 11, 9, 2, -10), -- 0x54 'T' (581, 11, 11, 11, 2, -10), -- 0x55 'U' (597, 10, 11, 11, 2, -10), -- 0x56 'V' (611, 14, 11, 14, 2, -10), -- 0x57 'W' (631, 11, 11, 11, 0, -10), -- 0x58 'X' (647, 9, 11, 9, 2, -10), -- 0x59 'Y' (660, 10, 11, 9, 0, -10), -- 0x5A 'Z' (674, 6, 13, 6, 0, -10), -- 0x5B '[' (684, 6, 11, 8, 2, -10), -- 0x5C '\' (693, 6, 13, 6, 0, -10), -- 0x5D ']' (703, 7, 6, 7, 0, -10), -- 0x5E '^' (709, 8, 1, 8, 0, 2), -- 0x5F '_' (710, 2, 3, 4, 2, -10), -- 0x60 '`' (711, 9, 7, 8, 0, -6), -- 0x61 'a' (719, 8, 11, 8, 0, -10), -- 0x62 'b' (730, 8, 7, 6, 0, -6), -- 0x63 'c' (737, 9, 11, 8, 0, -10), -- 0x64 'd' (750, 6, 7, 7, 0, -6), -- 0x65 'e' (756, 10, 15, 7, -1, -11), -- 0x66 'f' (775, 8, 10, 7, 0, -6), -- 0x67 'g' (785, 9, 11, 8, 0, -10), -- 0x68 'h' (798, 4, 11, 4, 1, -10), -- 0x69 'i' (804, 7, 14, 5, -1, -10), -- 0x6A 'j' (817, 7, 11, 7, 0, -10), -- 0x6B 'k' (827, 4, 11, 4, 1, -10), -- 0x6C 'l' (833, 12, 7, 12, 0, -6), -- 0x6D 'm' (844, 8, 7, 8, 0, -6), -- 0x6E 'n' (851, 8, 7, 8, 0, -6), -- 0x6F 'o' (858, 9, 10, 8, -1, -6), -- 0x70 'p' (870, 8, 10, 8, 0, -6), -- 0x71 'q' (880, 6, 7, 6, 0, -6), -- 0x72 'r' (886, 6, 7, 6, 0, -6), -- 0x73 's' (892, 4, 8, 4, 0, -7), -- 0x74 't' (896, 8, 7, 8, 1, -6), -- 0x75 'u' (903, 7, 7, 8, 1, -6), -- 0x76 'v' (910, 11, 7, 11, 0, -6), -- 0x77 'w' (920, 7, 7, 7, 0, -6), -- 0x78 'x' (927, 8, 10, 8, 0, -6), -- 0x79 'y' (937, 7, 8, 6, 0, -6), -- 0x7A 'z' (944, 6, 14, 7, 1, -10), -- 0x7B '{' (955, 1, 11, 4, 2, -10), -- 0x7C '|' (957, 6, 15, 6, 0, -11), -- 0x7D '}' (969, 7, 2, 9, 1, -4)); -- 0x7E '~' Font_D : aliased constant Bitmap_Font := (FreeSerifItalic8pt7bBitmaps'Access, FreeSerifItalic8pt7bGlyphs'Access, 19); Font : constant Giza.Font.Ref_Const := Font_D'Access; end Giza.Bitmap_Fonts.FreeSerifItalic8pt7b;

56.287671

73

0.455342

1e113699ebc8721073ac408251e8098b4456450f

2,307

ads

Ada

src/image/sdl-images-versions.ads

alire-project/sdlada

9593807925f5f6651d81514c7f2d163ab3156dc1

[ "Zlib" ]

null

src/image/sdl-images-versions.ads

alire-project/sdlada

9593807925f5f6651d81514c7f2d163ab3156dc1

[ "Zlib" ]

null

src/image/sdl-images-versions.ads

alire-project/sdlada

9593807925f5f6651d81514c7f2d163ab3156dc1

[ "Zlib" ]

null

-------------------------------------------------------------------------------------------------------------------- -- Copyright (c) 2013-2018 Luke A. Guest -- -- This software is provided 'as-is', without any express or implied -- warranty. In no event will the authors be held liable for any damages -- arising from the use of this software. -- -- Permission is granted to anyone to use this software for any purpose, -- including commercial applications, and to alter it and redistribute it -- freely, subject to the following restrictions: -- -- 1. The origin of this software must not be misrepresented; you must not -- claim that you wrote the original software. If you use this software -- in a product, an acknowledgment in the product documentation would be -- appreciated but is not required. -- -- 2. Altered source versions must be plainly marked as such, and must not be -- misrepresented as being the original software. -- -- 3. This notice may not be removed or altered from any source -- distribution. -------------------------------------------------------------------------------------------------------------------- -- SDL.Images.Versions -- -- Library version information. -------------------------------------------------------------------------------------------------------------------- with SDL.Versions; package SDL.Images.Versions is -- These allow the user to determine which version of SDLAda_Image they compiled with. Compiled_Major : constant SDL.Versions.Version_Level with Import => True, Convention => C, External_Name => "SDL_Ada_Image_Major_Version"; Compiled_Minor : constant SDL.Versions.Version_Level with Import => True, Convention => C, External_Name => "SDL_Ada_Image_Minor_Version"; Compiled_Patch : constant SDL.Versions.Version_Level with Import => True, Convention => C, External_Name => "SDL_Ada_Image_Patch_Version"; Compiled : constant SDL.Versions.Version := (Major => Compiled_Major, Minor => Compiled_Minor, Patch => Compiled_Patch); procedure Linked_With (Info : in out SDL.Versions.Version); end SDL.Images.Versions;

44.365385

116

0.573906

9a02129302dcac3ee6dfdfa773d0e448fe4d9656

1,898

adb

Ada

src/model/l_system/error/lse-model-l_system-error-invalid_rule.adb

mgrojo/lsystem-editor

1f855bc1f783c8d7a1c81594c8aee403e4b53132

[ "MIT" ]

2

2021-01-09T14:49:35.000Z

2022-01-18T18:57:45.000Z

src/model/l_system/error/lse-model-l_system-error-invalid_rule.adb

mgrojo/lsystem-editor

1f855bc1f783c8d7a1c81594c8aee403e4b53132

[ "MIT" ]

1

2021-12-03T18:49:59.000Z

src/model/l_system/error/lse-model-l_system-error-invalid_rule.adb

mgrojo/lsystem-editor

1f855bc1f783c8d7a1c81594c8aee403e4b53132

[ "MIT" ]

1

2021-12-03T18:07:44.000Z

------------------------------------------------------------------------------- -- LSE -- L-System Editor -- Author: Heziode -- -- License: -- MIT License -- -- Copyright (c) 2018 Quentin Dauprat (Heziode) <[email protected]> -- -- Permission is hereby granted, free of charge, to any person obtaining a -- copy of this software and associated documentation files (the "Software"), -- to deal in the Software without restriction, including without limitation -- the rights to use, copy, modify, merge, publish, distribute, sublicense, -- and/or sell copies of the Software, and to permit persons to whom the -- Software is furnished to do so, subject to the following conditions: -- -- The above copyright notice and this permission notice shall be included in -- all copies or substantial portions of the Software. -- -- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER -- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING -- FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER -- DEALINGS IN THE SOFTWARE. ------------------------------------------------------------------------------- package body LSE.Model.L_System.Error.Invalid_Rule is function Initialize (Value : String) return Instance is begin return Instance '(Error => Error_Type.Invalid_Rule, Value => To_Unbounded_String (Value)); end Initialize; function Get_Error (This : Instance) return String is begin return "Ununderstandable rule found near to <" & To_String (This.Value) & ">"; end Get_Error; end LSE.Model.L_System.Error.Invalid_Rule;

41.26087

79

0.662276

a0b26a73a98a7ccf203cf3aa1b854f61dc57cfd6

1,212

ada

Ada

Task/History-variables/Ada/history-variables-1.ada

djgoku/RosettaCodeData

91df62d46142e921b3eacdb52b0316c39ee236bc

[ "Info-ZIP" ]

1

2018-11-09T22:08:38.000Z

Task/History-variables/Ada/history-variables-1.ada

p0l4r/RosettaCodeData

ba8067c3b7e68156d666c9a802c07cdacecc14ea

[ "Info-ZIP" ]

null

Task/History-variables/Ada/history-variables-1.ada

p0l4r/RosettaCodeData

ba8067c3b7e68156d666c9a802c07cdacecc14ea

[ "Info-ZIP" ]

1

2018-11-09T22:08:40.000Z

private with Ada.Containers.Indefinite_Vectors; generic type Item_Type (<>) is private; package History_Variables is type Variable is tagged limited private; -- set and get current value procedure Set(V: in out Variable; Item: Item_Type); function Get(V: Variable) return Item_Type; -- number of items in history (including the current one) function Defined(V: Variable) return Natural; -- non-destructively search for old values function Peek(V: Variable; Generation: Natural := 1) return Item_Type; -- V.Peek(0) returns current value; V.Peek(1) the previous value, ect. -- when calling V.Peek(i), i must be in 0 .. V.Defined-1, else Constraint_Error is raised -- destructively restore previous value procedure Undo(V: in out Variable); -- old V.Peek(0) is forgotten, old V.Peek(i) is new V.Peek(i-1), ect. -- accordingly, V.Defined decrements by 1 -- special case: if V.Defined=0 then V.Undo does not change V private package Vectors is new Ada.Containers.Indefinite_Vectors (Index_Type => Positive, Element_Type => Item_Type); type Variable is tagged limited record History: Vectors.Vector; end record; end History_Variables;

34.628571

92

0.716172

a020f541ccd8be05b6808093cb813497dbbd268f

20,284

adb

Ada

llvm-gcc-4.2-2.9/gcc/ada/symbols-vms.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

llvm-gcc-4.2-2.9/gcc/ada/symbols-vms.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

llvm-gcc-4.2-2.9/gcc/ada/symbols-vms.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S Y M B O L S -- -- -- -- B o d y -- -- -- -- Copyright (C) 2003-2005 Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This is the VMS version of this package with Ada.Exceptions; use Ada.Exceptions; with Ada.Sequential_IO; with Ada.Text_IO; use Ada.Text_IO; package body Symbols is Case_Sensitive : constant String := "case_sensitive="; Symbol_Vector : constant String := "SYMBOL_VECTOR=("; Equal_Data : constant String := "=DATA)"; Equal_Procedure : constant String := "=PROCEDURE)"; Gsmatch : constant String := "gsmatch="; Gsmatch_Lequal : constant String := "gsmatch=lequal,"; Symbol_File_Name : String_Access := null; -- Name of the symbol file Sym_Policy : Policy := Autonomous; -- The symbol policy. Set by Initialize Major_ID : Integer := 1; -- The Major ID. May be modified by Initialize if Library_Version is -- specified or if it is read from the reference symbol file. Soft_Major_ID : Boolean := True; -- False if library version is specified in procedure Initialize. -- When True, Major_ID may be modified if found in the reference symbol -- file. Minor_ID : Natural := 0; -- The Minor ID. May be modified if read from the reference symbol file Soft_Minor_ID : Boolean := True; -- False if symbol policy is Autonomous, if library version is specified -- in procedure Initialize and is not the same as the major ID read from -- the reference symbol file. When True, Minor_ID may be increased in -- Compliant symbol policy. subtype Byte is Character; -- Object files are stream of bytes, but some of these bytes, those for -- the names of the symbols, are ASCII characters. package Byte_IO is new Ada.Sequential_IO (Byte); use Byte_IO; File : Byte_IO.File_Type; -- Each object file is read as a stream of bytes (characters) function Equal (Left, Right : Symbol_Data) return Boolean; -- Test for equality of symbols function Image (N : Integer) return String; -- Returns the image of N, without the initial space ----------- -- Equal -- ----------- function Equal (Left, Right : Symbol_Data) return Boolean is begin return Left.Name /= null and then Right.Name /= null and then Left.Name.all = Right.Name.all and then Left.Kind = Right.Kind and then Left.Present = Right.Present; end Equal; ----------- -- Image -- ----------- function Image (N : Integer) return String is Result : constant String := N'Img; begin if Result (Result'First) = ' ' then return Result (Result'First + 1 .. Result'Last); else return Result; end if; end Image; ---------------- -- Initialize -- ---------------- procedure Initialize (Symbol_File : String; Reference : String; Symbol_Policy : Policy; Quiet : Boolean; Version : String; Success : out Boolean) is File : Ada.Text_IO.File_Type; Line : String (1 .. 1_000); Last : Natural; begin -- Record the symbol file name Symbol_File_Name := new String'(Symbol_File); -- Record the policy Sym_Policy := Symbol_Policy; -- Record the version (Major ID) if Version = "" then Major_ID := 1; Soft_Major_ID := True; else begin Major_ID := Integer'Value (Version); Soft_Major_ID := False; if Major_ID <= 0 then raise Constraint_Error; end if; exception when Constraint_Error => if not Quiet then Put_Line ("Version """ & Version & """ is illegal."); Put_Line ("On VMS, version must be a positive number"); end if; Success := False; return; end; end if; Minor_ID := 0; Soft_Minor_ID := Sym_Policy /= Autonomous; -- Empty the symbol tables Symbol_Table.Set_Last (Original_Symbols, 0); Symbol_Table.Set_Last (Complete_Symbols, 0); -- Assume that everything will be fine Success := True; -- If policy is Compliant or Controlled, attempt to read the reference -- file. If policy is Restricted, attempt to read the symbol file. if Sym_Policy /= Autonomous then case Sym_Policy is when Autonomous => null; when Compliant | Controlled => begin Open (File, In_File, Reference); exception when Ada.Text_IO.Name_Error => Success := False; return; when X : others => if not Quiet then Put_Line ("could not open """ & Reference & """"); Put_Line (Exception_Message (X)); end if; Success := False; return; end; when Restricted => begin Open (File, In_File, Symbol_File); exception when Ada.Text_IO.Name_Error => Success := False; return; when X : others => if not Quiet then Put_Line ("could not open """ & Symbol_File & """"); Put_Line (Exception_Message (X)); end if; Success := False; return; end; end case; -- Read line by line while not End_Of_File (File) loop Get_Line (File, Line, Last); -- Ignore empty lines if Last = 0 then null; -- Ignore lines starting with "case_sensitive=" elsif Last > Case_Sensitive'Length and then Line (1 .. Case_Sensitive'Length) = Case_Sensitive then null; -- Line starting with "SYMBOL_VECTOR=(" elsif Last > Symbol_Vector'Length and then Line (1 .. Symbol_Vector'Length) = Symbol_Vector then -- SYMBOL_VECTOR=(<symbol>=DATA) if Last > Symbol_Vector'Length + Equal_Data'Length and then Line (Last - Equal_Data'Length + 1 .. Last) = Equal_Data then Symbol_Table.Increment_Last (Original_Symbols); Original_Symbols.Table (Symbol_Table.Last (Original_Symbols)) := (Name => new String'(Line (Symbol_Vector'Length + 1 .. Last - Equal_Data'Length)), Kind => Data, Present => True); -- SYMBOL_VECTOR=(<symbol>=PROCEDURE) elsif Last > Symbol_Vector'Length + Equal_Procedure'Length and then Line (Last - Equal_Procedure'Length + 1 .. Last) = Equal_Procedure then Symbol_Table.Increment_Last (Original_Symbols); Original_Symbols.Table (Symbol_Table.Last (Original_Symbols)) := (Name => new String'(Line (Symbol_Vector'Length + 1 .. Last - Equal_Procedure'Length)), Kind => Proc, Present => True); -- Anything else is incorrectly formatted else if not Quiet then Put_Line ("symbol file """ & Reference & """ is incorrectly formatted:"); Put_Line ("""" & Line (1 .. Last) & """"); end if; Close (File); Success := False; return; end if; -- Lines with "gsmatch=lequal," or "gsmatch=equal," elsif Last > Gsmatch'Length and then Line (1 .. Gsmatch'Length) = Gsmatch then declare Start : Positive := Gsmatch'Length + 1; Finish : Positive := Start; OK : Boolean := True; ID : Integer; begin -- First, look for the first coma loop if Start >= Last - 1 then OK := False; exit; elsif Line (Start) = ',' then Start := Start + 1; exit; else Start := Start + 1; end if; end loop; Finish := Start; -- If the comma is found, get the Major and the Minor IDs if OK then loop if Line (Finish) not in '0' .. '9' or else Finish >= Last - 1 then OK := False; exit; end if; exit when Line (Finish + 1) = ','; Finish := Finish + 1; end loop; end if; if OK then ID := Integer'Value (Line (Start .. Finish)); OK := ID /= 0; -- If Soft_Major_ID is True, it means that -- Library_Version was not specified. if Soft_Major_ID then Major_ID := ID; -- If the Major ID in the reference file is different -- from the Library_Version, then the Minor ID will be 0 -- because there is no point in taking the Minor ID in -- the reference file, or incrementing it. So, we set -- Soft_Minor_ID to False, so that we don't modify -- the Minor_ID later. elsif Major_ID /= ID then Soft_Minor_ID := False; end if; Start := Finish + 2; Finish := Start; loop if Line (Finish) not in '0' .. '9' then OK := False; exit; end if; exit when Finish = Last; Finish := Finish + 1; end loop; -- Only set Minor_ID if Soft_Minor_ID is True (see above) if OK and then Soft_Minor_ID then Minor_ID := Integer'Value (Line (Start .. Finish)); end if; end if; -- If OK is not True, that means the line is not correctly -- formatted. if not OK then if not Quiet then Put_Line ("symbol file """ & Reference & """ is incorrectly formatted"); Put_Line ("""" & Line (1 .. Last) & """"); end if; Close (File); Success := False; return; end if; end; -- Anything else is incorrectly formatted else if not Quiet then Put_Line ("unexpected line in symbol file """ & Reference & """"); Put_Line ("""" & Line (1 .. Last) & """"); end if; Close (File); Success := False; return; end if; end loop; Close (File); end if; end Initialize; ---------------- -- Processing -- ---------------- package body Processing is separate; -------------- -- Finalize -- -------------- procedure Finalize (Quiet : Boolean; Success : out Boolean) is File : Ada.Text_IO.File_Type; -- The symbol file S_Data : Symbol_Data; -- A symbol Cur : Positive := 1; -- Most probable index in the Complete_Symbols of the current symbol -- in Original_Symbol. Found : Boolean; begin -- Nothing to be done if Initialize has never been called if Symbol_File_Name = null then Success := False; else -- First find if the symbols in the reference symbol file are also -- in the object files. Note that this is not done if the policy is -- Autonomous, because no reference symbol file has been read. -- Expect the first symbol in the symbol file to also be the first -- in Complete_Symbols. Cur := 1; for Index_1 in 1 .. Symbol_Table.Last (Original_Symbols) loop S_Data := Original_Symbols.Table (Index_1); Found := False; First_Object_Loop : for Index_2 in Cur .. Symbol_Table.Last (Complete_Symbols) loop if Equal (S_Data, Complete_Symbols.Table (Index_2)) then Cur := Index_2 + 1; Complete_Symbols.Table (Index_2).Present := False; Found := True; exit First_Object_Loop; end if; end loop First_Object_Loop; -- If the symbol could not be found between Cur and Last, try -- before Cur. if not Found then Second_Object_Loop : for Index_2 in 1 .. Cur - 1 loop if Equal (S_Data, Complete_Symbols.Table (Index_2)) then Cur := Index_2 + 1; Complete_Symbols.Table (Index_2).Present := False; Found := True; exit Second_Object_Loop; end if; end loop Second_Object_Loop; end if; -- If the symbol is not found, mark it as such in the table if not Found then if (not Quiet) or else Sym_Policy = Controlled then Put_Line ("symbol """ & S_Data.Name.all & """ is no longer present in the object files"); end if; if Sym_Policy = Controlled or else Sym_Policy = Restricted then Success := False; return; -- Any symbol that is undefined in the reference symbol file -- triggers an increase of the Major ID, because the new -- version of the library is no longer compatible with -- existing executables. elsif Soft_Major_ID then Major_ID := Major_ID + 1; Minor_ID := 0; Soft_Major_ID := False; Soft_Minor_ID := False; end if; Original_Symbols.Table (Index_1).Present := False; Free (Original_Symbols.Table (Index_1).Name); if Soft_Minor_ID then Minor_ID := Minor_ID + 1; Soft_Minor_ID := False; end if; end if; end loop; if Sym_Policy /= Restricted then -- Append additional symbols, if any, to the Original_Symbols -- table. for Index in 1 .. Symbol_Table.Last (Complete_Symbols) loop S_Data := Complete_Symbols.Table (Index); if S_Data.Present then if Sym_Policy = Controlled then Put_Line ("symbol """ & S_Data.Name.all & """ is not in the reference symbol file"); Success := False; return; elsif Soft_Minor_ID then Minor_ID := Minor_ID + 1; Soft_Minor_ID := False; end if; Symbol_Table.Increment_Last (Original_Symbols); Original_Symbols.Table (Symbol_Table.Last (Original_Symbols)) := S_Data; Complete_Symbols.Table (Index).Present := False; end if; end loop; -- Create the symbol file Create (File, Ada.Text_IO.Out_File, Symbol_File_Name.all); Put (File, Case_Sensitive); Put_Line (File, "yes"); -- Put a line in the symbol file for each symbol in symbol table for Index in 1 .. Symbol_Table.Last (Original_Symbols) loop if Original_Symbols.Table (Index).Present then Put (File, Symbol_Vector); Put (File, Original_Symbols.Table (Index).Name.all); if Original_Symbols.Table (Index).Kind = Data then Put_Line (File, Equal_Data); else Put_Line (File, Equal_Procedure); end if; Free (Original_Symbols.Table (Index).Name); end if; end loop; Put (File, Case_Sensitive); Put_Line (File, "NO"); -- Put the version IDs Put (File, Gsmatch_Lequal); Put (File, Image (Major_ID)); Put (File, ','); Put_Line (File, Image (Minor_ID)); -- And we are done Close (File); -- Reset both tables Symbol_Table.Set_Last (Original_Symbols, 0); Symbol_Table.Set_Last (Complete_Symbols, 0); -- Clear the symbol file name Free (Symbol_File_Name); end if; Success := True; end if; exception when X : others => Put_Line ("unexpected exception raised while finalizing """ & Symbol_File_Name.all & """"); Put_Line (Exception_Information (X)); Success := False; end Finalize; end Symbols;

33.416804

79

0.4648

0301edbe8e8ae285af9bf6854695e68a779f287f

3,028

adb

Ada

test/constants/test_constants-write.adb

skill-lang/skillAdaTestSuite

279ea0c0cd489c2e39d7532a3b68c564497101e2

[ "BSD-3-Clause" ]

1

2019-02-09T22:04:10.000Z

test/constants/test_constants-write.adb

skill-lang/skillAdaTestSuite

279ea0c0cd489c2e39d7532a3b68c564497101e2

[ "BSD-3-Clause" ]

null

test/constants/test_constants-write.adb

skill-lang/skillAdaTestSuite

279ea0c0cd489c2e39d7532a3b68c564497101e2

[ "BSD-3-Clause" ]

null

package body Test_Constants.Write is File_Name : constant String := "tmp/test-constants-write.sf"; procedure Initialize (T : in out Test) is begin Set_Name (T, "Test_Constants.Write"); Ahven.Framework.Add_Test_Routine (T, A'Access, "A: i8 = 8"); Ahven.Framework.Add_Test_Routine (T, B'Access, "B: i16 = 16"); Ahven.Framework.Add_Test_Routine (T, C'Access, "C: i32 = 32"); Ahven.Framework.Add_Test_Routine (T, D'Access, "D: i64 = 64"); Ahven.Framework.Add_Test_Routine (T, E'Access, "E: v64 = 46"); end Initialize; procedure Set_Up (T : in out Test) is State : access Skill_State := new Skill_State; begin Skill.Create (State); for I in 1 .. 7 loop New_Constant (State); end loop; Skill.Write (State, File_Name); end Set_Up; procedure Tear_Down (T : in out Test) is begin Ada.Directories.Delete_File (File_Name); end Tear_Down; procedure A (T : in out Ahven.Framework.Test_Case'Class) is State : access Skill_State := new Skill_State; begin Skill.Read (State, File_Name); for I in 1 .. Constants_Size (State) loop declare X : Constant_Type_Access := Get_Constant (State, I); begin Ahven.Assert (8 = X.Get_A, "constant is not 8"); end; end loop; end A; procedure B (T : in out Ahven.Framework.Test_Case'Class) is State : access Skill_State := new Skill_State; begin Skill.Read (State, File_Name); for I in 1 .. Constants_Size (State) loop declare X : Constant_Type_Access := Get_Constant (State, I); begin Ahven.Assert (16 = X.Get_B, "constant is not 16"); end; end loop; end B; procedure C (T : in out Ahven.Framework.Test_Case'Class) is State : access Skill_State := new Skill_State; begin Skill.Read (State, File_Name); for I in 1 .. Constants_Size (State) loop declare X : Constant_Type_Access := Get_Constant (State, I); begin Ahven.Assert (32 = X.Get_C, "constant is not 32"); end; end loop; end C; procedure D (T : in out Ahven.Framework.Test_Case'Class) is State : access Skill_State := new Skill_State; begin Skill.Read (State, File_Name); for I in 1 .. Constants_Size (State) loop declare X : Constant_Type_Access := Get_Constant (State, I); begin Ahven.Assert (64 = X.Get_D, "constant is not 64"); end; end loop; end D; procedure E (T : in out Ahven.Framework.Test_Case'Class) is State : access Skill_State := new Skill_State; begin Skill.Read (State, File_Name); for I in 1 .. Constants_Size (State) loop declare X : Constant_Type_Access := Get_Constant (State, I); begin Ahven.Assert (46 = X.Get_E, "constant is not 46"); end; end loop; end E; end Test_Constants.Write;

29.686275

68

0.601717

037c5aa8b6f012d1401fcedccc34895da0e55b64

134

adb

Ada

llvm-2.9/test/FrontendAda/array_range_ref.adb

DependableSystemsLab/Trident

90b38ab3ce8b7ad743986ddf66eaea7d20d921cb

[ "MIT" ]

5

2018-09-23T05:44:31.000Z

2021-09-08T18:52:37.000Z

llvm-2.9/test/FrontendAda/array_range_ref.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

4

2019-06-13T16:27:31.000Z

2021-06-07T07:24:31.000Z

llvm-2.9/test/FrontendAda/array_range_ref.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

4

2018-09-23T05:44:33.000Z

2021-04-20T00:29:11.000Z

-- RUN: %llvmgcc -S %s procedure Array_Range_Ref is A : String (1 .. 3); B : String := A (A'RANGE)(1 .. 3); begin null; end;

16.75

37

0.559701

0307d55e0cfb2e05326a2c2b62f22323bf0ded64

11,490

ads

Ada

src/GUI/generated/alarm_80x80.ads

Fabien-Chouteau/coffee-clock

6b8b8dd8741887c522fcf6f1ce5f1a5b73921b27

[ "MIT" ]

7

2017-05-17T13:51:47.000Z

2021-11-11T19:17:50.000Z

src/GUI/generated/alarm_80x80.ads

Fabien-Chouteau/coffee-clock

6b8b8dd8741887c522fcf6f1ce5f1a5b73921b27

[ "MIT" ]

null

src/GUI/generated/alarm_80x80.ads

Fabien-Chouteau/coffee-clock

6b8b8dd8741887c522fcf6f1ce5f1a5b73921b27

[ "MIT" ]

null

-- This file was generated by bmp2ada with Giza.Image; with Giza.Image.DMA2D; use Giza.Image.DMA2D; package alarm_80x80 is pragma Style_Checks (Off); CLUT : aliased constant L4_CLUT_T := ( (R => 0, G => 1, B => 0), (R => 253, G => 255, B => 252), others => (0, 0, 0)); Data : aliased constant L4_Data_T := ( 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 16, 17, 17, 0, 16, 17, 17, 17, 17, 17, 0, 0, 17, 17, 0, 0, 17, 17, 17, 17, 17, 1, 0, 17, 17, 1, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 16, 17, 1, 0, 16, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 1, 0, 16, 17, 1, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 17, 17, 0, 0, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 0, 0, 17, 17, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 17, 1, 0, 16, 17, 17, 17, 17, 17, 17, 0, 0, 17, 17, 0, 0, 17, 17, 17, 17, 17, 17, 1, 0, 16, 17, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 16, 17, 1, 0, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 0, 16, 17, 1, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 17, 17, 0, 0, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 0, 0, 17, 17, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 0, 16, 17, 1, 0, 16, 17, 17, 17, 1, 0, 16, 17, 1, 0, 0, 0, 0, 16, 17, 1, 0, 16, 17, 17, 17, 1, 0, 16, 17, 1, 0, 17, 17, 17, 17, 17, 17, 17, 1, 0, 16, 17, 1, 0, 17, 17, 17, 17, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 17, 17, 17, 17, 0, 16, 17, 1, 0, 16, 17, 17, 17, 17, 17, 17, 0, 0, 17, 17, 1, 16, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 1, 16, 17, 17, 0, 0, 17, 17, 17, 17, 17, 17, 0, 16, 17, 17, 0, 16, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 1, 0, 17, 17, 1, 0, 17, 17, 17, 17, 17, 1, 0, 17, 17, 1, 0, 17, 17, 17, 17, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 17, 17, 17, 17, 0, 16, 17, 17, 0, 16, 17, 17, 17, 17, 1, 0, 17, 17, 1, 16, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 1, 16, 17, 17, 0, 16, 17, 17, 17, 17, 1, 16, 17, 17, 0, 16, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 1, 0, 17, 17, 1, 16, 17, 17, 17, 17, 0, 16, 17, 17, 0, 16, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 1, 0, 17, 17, 1, 0, 17, 17, 17, 17, 0, 17, 17, 1, 0, 16, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 1, 0, 16, 17, 17, 0, 17, 17, 17, 17, 0, 17, 17, 1, 0, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 0, 16, 17, 17, 0, 17, 17, 17, 1, 0, 17, 17, 1, 0, 17, 17, 17, 1, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 16, 17, 17, 17, 0, 16, 17, 17, 0, 16, 17, 17, 1, 16, 17, 17, 1, 0, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 0, 16, 17, 17, 1, 16, 17, 17, 1, 16, 17, 17, 0, 0, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 0, 0, 17, 17, 1, 16, 17, 17, 1, 16, 17, 17, 0, 16, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 1, 0, 17, 17, 1, 16, 17, 17, 0, 16, 17, 17, 0, 16, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 1, 0, 17, 17, 1, 0, 17, 17, 0, 16, 17, 17, 0, 16, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 1, 0, 17, 17, 1, 0, 17, 17, 0, 16, 17, 1, 0, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 0, 16, 17, 1, 0, 17, 17, 0, 16, 17, 1, 0, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 0, 16, 17, 1, 0, 17, 1, 0, 17, 17, 1, 0, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 0, 16, 17, 17, 0, 16, 1, 0, 17, 17, 1, 0, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 0, 16, 17, 17, 0, 16, 1, 0, 17, 17, 1, 0, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 0, 16, 17, 17, 0, 16, 1, 0, 17, 17, 0, 16, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 1, 0, 17, 17, 0, 16, 1, 0, 17, 17, 0, 16, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 1, 0, 17, 17, 0, 16, 0, 0, 17, 17, 0, 16, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 1, 0, 17, 17, 0, 0, 0, 16, 17, 17, 0, 16, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 1, 0, 17, 17, 1, 0, 0, 16, 17, 1, 0, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 0, 16, 17, 1, 0, 0, 17, 17, 1, 0, 17, 17, 17, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 17, 17, 17, 0, 16, 17, 17, 0, 17, 17, 17, 1, 16, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 16, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 17, 17, 17, 17, 17, 17, 17, 1, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 16, 17, 17, 17, 17, 17, 17, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 17, 17, 17, 17, 17, 1, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 16, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17); Image : constant Giza.Image.Ref := new Giza.Image.DMA2D.Instance' (Mode => L4, W => 80, H => 71, Length => 2840, L4_CLUT => CLUT'Access, L4_Data => Data'Access); pragma Style_Checks (On); end alarm_80x80;

153.2

200

0.483203

387f74937344424065fd79ff51b45fad547fb8ee

38,084

ads

Ada

SVD2ada/svd/stm32_svd-tsc.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

SVD2ada/svd/stm32_svd-tsc.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

SVD2ada/svd/stm32_svd-tsc.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

pragma Style_Checks (Off); -- This spec has been automatically generated from STM32F3x4.svd pragma Restrictions (No_Elaboration_Code); with HAL; with System; package STM32_SVD.TSC is pragma Preelaborate; --------------- -- Registers -- --------------- subtype CR_MCV_Field is HAL.UInt3; subtype CR_PGPSC_Field is HAL.UInt3; subtype CR_SSD_Field is HAL.UInt7; subtype CR_CTPL_Field is HAL.UInt4; subtype CR_CTPH_Field is HAL.UInt4; -- control register type CR_Register is record -- Touch sensing controller enable TSCE : Boolean := False; -- Start a new acquisition START : Boolean := False; -- Acquisition mode AM : Boolean := False; -- Synchronization pin polarity SYNCPOL : Boolean := False; -- I/O Default mode IODEF : Boolean := False; -- Max count value MCV : CR_MCV_Field := 16#0#; -- unspecified Reserved_8_11 : HAL.UInt4 := 16#0#; -- pulse generator prescaler PGPSC : CR_PGPSC_Field := 16#0#; -- Spread spectrum prescaler SSPSC : Boolean := False; -- Spread spectrum enable SSE : Boolean := False; -- Spread spectrum deviation SSD : CR_SSD_Field := 16#0#; -- Charge transfer pulse low CTPL : CR_CTPL_Field := 16#0#; -- Charge transfer pulse high CTPH : CR_CTPH_Field := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for CR_Register use record TSCE at 0 range 0 .. 0; START at 0 range 1 .. 1; AM at 0 range 2 .. 2; SYNCPOL at 0 range 3 .. 3; IODEF at 0 range 4 .. 4; MCV at 0 range 5 .. 7; Reserved_8_11 at 0 range 8 .. 11; PGPSC at 0 range 12 .. 14; SSPSC at 0 range 15 .. 15; SSE at 0 range 16 .. 16; SSD at 0 range 17 .. 23; CTPL at 0 range 24 .. 27; CTPH at 0 range 28 .. 31; end record; -- interrupt enable register type IER_Register is record -- End of acquisition interrupt enable EOAIE : Boolean := False; -- Max count error interrupt enable MCEIE : Boolean := False; -- unspecified Reserved_2_31 : HAL.UInt30 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IER_Register use record EOAIE at 0 range 0 .. 0; MCEIE at 0 range 1 .. 1; Reserved_2_31 at 0 range 2 .. 31; end record; -- interrupt clear register type ICR_Register is record -- End of acquisition interrupt clear EOAIC : Boolean := False; -- Max count error interrupt clear MCEIC : Boolean := False; -- unspecified Reserved_2_31 : HAL.UInt30 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for ICR_Register use record EOAIC at 0 range 0 .. 0; MCEIC at 0 range 1 .. 1; Reserved_2_31 at 0 range 2 .. 31; end record; -- interrupt status register type ISR_Register is record -- End of acquisition flag EOAF : Boolean := False; -- Max count error flag MCEF : Boolean := False; -- unspecified Reserved_2_31 : HAL.UInt30 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for ISR_Register use record EOAF at 0 range 0 .. 0; MCEF at 0 range 1 .. 1; Reserved_2_31 at 0 range 2 .. 31; end record; -- IOHCR_G1_IO array type IOHCR_G1_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOHCR_G1_IO type IOHCR_G1_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G1_IO as a value Val : HAL.UInt4; when True => -- G1_IO as an array Arr : IOHCR_G1_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOHCR_G1_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOHCR_G2_IO array type IOHCR_G2_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOHCR_G2_IO type IOHCR_G2_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G2_IO as a value Val : HAL.UInt4; when True => -- G2_IO as an array Arr : IOHCR_G2_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOHCR_G2_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOHCR_G3_IO array type IOHCR_G3_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOHCR_G3_IO type IOHCR_G3_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G3_IO as a value Val : HAL.UInt4; when True => -- G3_IO as an array Arr : IOHCR_G3_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOHCR_G3_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOHCR_G4_IO array type IOHCR_G4_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOHCR_G4_IO type IOHCR_G4_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G4_IO as a value Val : HAL.UInt4; when True => -- G4_IO as an array Arr : IOHCR_G4_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOHCR_G4_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOHCR_G5_IO array type IOHCR_G5_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOHCR_G5_IO type IOHCR_G5_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G5_IO as a value Val : HAL.UInt4; when True => -- G5_IO as an array Arr : IOHCR_G5_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOHCR_G5_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOHCR_G6_IO array type IOHCR_G6_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOHCR_G6_IO type IOHCR_G6_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G6_IO as a value Val : HAL.UInt4; when True => -- G6_IO as an array Arr : IOHCR_G6_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOHCR_G6_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOHCR_G7_IO array type IOHCR_G7_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOHCR_G7_IO type IOHCR_G7_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G7_IO as a value Val : HAL.UInt4; when True => -- G7_IO as an array Arr : IOHCR_G7_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOHCR_G7_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOHCR_G8_IO array type IOHCR_G8_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOHCR_G8_IO type IOHCR_G8_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G8_IO as a value Val : HAL.UInt4; when True => -- G8_IO as an array Arr : IOHCR_G8_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOHCR_G8_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- I/O hysteresis control register type IOHCR_Register is record -- G1_IO1 Schmitt trigger hysteresis mode G1_IO : IOHCR_G1_IO_Field := (As_Array => False, Val => 16#1#); -- G2_IO1 Schmitt trigger hysteresis mode G2_IO : IOHCR_G2_IO_Field := (As_Array => False, Val => 16#1#); -- G3_IO1 Schmitt trigger hysteresis mode G3_IO : IOHCR_G3_IO_Field := (As_Array => False, Val => 16#1#); -- G4_IO1 Schmitt trigger hysteresis mode G4_IO : IOHCR_G4_IO_Field := (As_Array => False, Val => 16#1#); -- G5_IO1 Schmitt trigger hysteresis mode G5_IO : IOHCR_G5_IO_Field := (As_Array => False, Val => 16#1#); -- G6_IO1 Schmitt trigger hysteresis mode G6_IO : IOHCR_G6_IO_Field := (As_Array => False, Val => 16#1#); -- G7_IO1 Schmitt trigger hysteresis mode G7_IO : IOHCR_G7_IO_Field := (As_Array => False, Val => 16#1#); -- G8_IO1 Schmitt trigger hysteresis mode G8_IO : IOHCR_G8_IO_Field := (As_Array => False, Val => 16#1#); end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOHCR_Register use record G1_IO at 0 range 0 .. 3; G2_IO at 0 range 4 .. 7; G3_IO at 0 range 8 .. 11; G4_IO at 0 range 12 .. 15; G5_IO at 0 range 16 .. 19; G6_IO at 0 range 20 .. 23; G7_IO at 0 range 24 .. 27; G8_IO at 0 range 28 .. 31; end record; -- IOASCR_G1_IO array type IOASCR_G1_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOASCR_G1_IO type IOASCR_G1_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G1_IO as a value Val : HAL.UInt4; when True => -- G1_IO as an array Arr : IOASCR_G1_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOASCR_G1_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOASCR_G2_IO array type IOASCR_G2_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOASCR_G2_IO type IOASCR_G2_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G2_IO as a value Val : HAL.UInt4; when True => -- G2_IO as an array Arr : IOASCR_G2_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOASCR_G2_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOASCR_G3_IO array type IOASCR_G3_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOASCR_G3_IO type IOASCR_G3_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G3_IO as a value Val : HAL.UInt4; when True => -- G3_IO as an array Arr : IOASCR_G3_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOASCR_G3_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOASCR_G4_IO array type IOASCR_G4_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOASCR_G4_IO type IOASCR_G4_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G4_IO as a value Val : HAL.UInt4; when True => -- G4_IO as an array Arr : IOASCR_G4_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOASCR_G4_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOASCR_G5_IO array type IOASCR_G5_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOASCR_G5_IO type IOASCR_G5_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G5_IO as a value Val : HAL.UInt4; when True => -- G5_IO as an array Arr : IOASCR_G5_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOASCR_G5_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOASCR_G6_IO array type IOASCR_G6_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOASCR_G6_IO type IOASCR_G6_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G6_IO as a value Val : HAL.UInt4; when True => -- G6_IO as an array Arr : IOASCR_G6_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOASCR_G6_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOASCR_G7_IO array type IOASCR_G7_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOASCR_G7_IO type IOASCR_G7_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G7_IO as a value Val : HAL.UInt4; when True => -- G7_IO as an array Arr : IOASCR_G7_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOASCR_G7_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOASCR_G8_IO array type IOASCR_G8_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOASCR_G8_IO type IOASCR_G8_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G8_IO as a value Val : HAL.UInt4; when True => -- G8_IO as an array Arr : IOASCR_G8_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOASCR_G8_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- I/O analog switch control register type IOASCR_Register is record -- G1_IO1 analog switch enable G1_IO : IOASCR_G1_IO_Field := (As_Array => False, Val => 16#0#); -- G2_IO1 analog switch enable G2_IO : IOASCR_G2_IO_Field := (As_Array => False, Val => 16#0#); -- G3_IO1 analog switch enable G3_IO : IOASCR_G3_IO_Field := (As_Array => False, Val => 16#0#); -- G4_IO1 analog switch enable G4_IO : IOASCR_G4_IO_Field := (As_Array => False, Val => 16#0#); -- G5_IO1 analog switch enable G5_IO : IOASCR_G5_IO_Field := (As_Array => False, Val => 16#0#); -- G6_IO1 analog switch enable G6_IO : IOASCR_G6_IO_Field := (As_Array => False, Val => 16#0#); -- G7_IO1 analog switch enable G7_IO : IOASCR_G7_IO_Field := (As_Array => False, Val => 16#0#); -- G8_IO1 analog switch enable G8_IO : IOASCR_G8_IO_Field := (As_Array => False, Val => 16#0#); end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOASCR_Register use record G1_IO at 0 range 0 .. 3; G2_IO at 0 range 4 .. 7; G3_IO at 0 range 8 .. 11; G4_IO at 0 range 12 .. 15; G5_IO at 0 range 16 .. 19; G6_IO at 0 range 20 .. 23; G7_IO at 0 range 24 .. 27; G8_IO at 0 range 28 .. 31; end record; -- IOSCR_G1_IO array type IOSCR_G1_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOSCR_G1_IO type IOSCR_G1_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G1_IO as a value Val : HAL.UInt4; when True => -- G1_IO as an array Arr : IOSCR_G1_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOSCR_G1_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOSCR_G2_IO array type IOSCR_G2_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOSCR_G2_IO type IOSCR_G2_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G2_IO as a value Val : HAL.UInt4; when True => -- G2_IO as an array Arr : IOSCR_G2_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOSCR_G2_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOSCR_G3_IO array type IOSCR_G3_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOSCR_G3_IO type IOSCR_G3_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G3_IO as a value Val : HAL.UInt4; when True => -- G3_IO as an array Arr : IOSCR_G3_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOSCR_G3_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOSCR_G4_IO array type IOSCR_G4_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOSCR_G4_IO type IOSCR_G4_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G4_IO as a value Val : HAL.UInt4; when True => -- G4_IO as an array Arr : IOSCR_G4_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOSCR_G4_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOSCR_G5_IO array type IOSCR_G5_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOSCR_G5_IO type IOSCR_G5_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G5_IO as a value Val : HAL.UInt4; when True => -- G5_IO as an array Arr : IOSCR_G5_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOSCR_G5_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOSCR_G6_IO array type IOSCR_G6_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOSCR_G6_IO type IOSCR_G6_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G6_IO as a value Val : HAL.UInt4; when True => -- G6_IO as an array Arr : IOSCR_G6_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOSCR_G6_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOSCR_G7_IO array type IOSCR_G7_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOSCR_G7_IO type IOSCR_G7_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G7_IO as a value Val : HAL.UInt4; when True => -- G7_IO as an array Arr : IOSCR_G7_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOSCR_G7_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOSCR_G8_IO array type IOSCR_G8_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOSCR_G8_IO type IOSCR_G8_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G8_IO as a value Val : HAL.UInt4; when True => -- G8_IO as an array Arr : IOSCR_G8_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOSCR_G8_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- I/O sampling control register type IOSCR_Register is record -- G1_IO1 sampling mode G1_IO : IOSCR_G1_IO_Field := (As_Array => False, Val => 16#0#); -- G2_IO1 sampling mode G2_IO : IOSCR_G2_IO_Field := (As_Array => False, Val => 16#0#); -- G3_IO1 sampling mode G3_IO : IOSCR_G3_IO_Field := (As_Array => False, Val => 16#0#); -- G4_IO1 sampling mode G4_IO : IOSCR_G4_IO_Field := (As_Array => False, Val => 16#0#); -- G5_IO1 sampling mode G5_IO : IOSCR_G5_IO_Field := (As_Array => False, Val => 16#0#); -- G6_IO1 sampling mode G6_IO : IOSCR_G6_IO_Field := (As_Array => False, Val => 16#0#); -- G7_IO1 sampling mode G7_IO : IOSCR_G7_IO_Field := (As_Array => False, Val => 16#0#); -- G8_IO1 sampling mode G8_IO : IOSCR_G8_IO_Field := (As_Array => False, Val => 16#0#); end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOSCR_Register use record G1_IO at 0 range 0 .. 3; G2_IO at 0 range 4 .. 7; G3_IO at 0 range 8 .. 11; G4_IO at 0 range 12 .. 15; G5_IO at 0 range 16 .. 19; G6_IO at 0 range 20 .. 23; G7_IO at 0 range 24 .. 27; G8_IO at 0 range 28 .. 31; end record; -- IOCCR_G1_IO array type IOCCR_G1_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOCCR_G1_IO type IOCCR_G1_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G1_IO as a value Val : HAL.UInt4; when True => -- G1_IO as an array Arr : IOCCR_G1_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOCCR_G1_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOCCR_G2_IO array type IOCCR_G2_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOCCR_G2_IO type IOCCR_G2_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G2_IO as a value Val : HAL.UInt4; when True => -- G2_IO as an array Arr : IOCCR_G2_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOCCR_G2_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOCCR_G3_IO array type IOCCR_G3_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOCCR_G3_IO type IOCCR_G3_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G3_IO as a value Val : HAL.UInt4; when True => -- G3_IO as an array Arr : IOCCR_G3_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOCCR_G3_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOCCR_G4_IO array type IOCCR_G4_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOCCR_G4_IO type IOCCR_G4_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G4_IO as a value Val : HAL.UInt4; when True => -- G4_IO as an array Arr : IOCCR_G4_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOCCR_G4_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOCCR_G5_IO array type IOCCR_G5_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOCCR_G5_IO type IOCCR_G5_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G5_IO as a value Val : HAL.UInt4; when True => -- G5_IO as an array Arr : IOCCR_G5_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOCCR_G5_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOCCR_G6_IO array type IOCCR_G6_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOCCR_G6_IO type IOCCR_G6_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G6_IO as a value Val : HAL.UInt4; when True => -- G6_IO as an array Arr : IOCCR_G6_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOCCR_G6_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOCCR_G7_IO array type IOCCR_G7_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOCCR_G7_IO type IOCCR_G7_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G7_IO as a value Val : HAL.UInt4; when True => -- G7_IO as an array Arr : IOCCR_G7_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOCCR_G7_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOCCR_G8_IO array type IOCCR_G8_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOCCR_G8_IO type IOCCR_G8_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G8_IO as a value Val : HAL.UInt4; when True => -- G8_IO as an array Arr : IOCCR_G8_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOCCR_G8_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- I/O channel control register type IOCCR_Register is record -- G1_IO1 channel mode G1_IO : IOCCR_G1_IO_Field := (As_Array => False, Val => 16#0#); -- G2_IO1 channel mode G2_IO : IOCCR_G2_IO_Field := (As_Array => False, Val => 16#0#); -- G3_IO1 channel mode G3_IO : IOCCR_G3_IO_Field := (As_Array => False, Val => 16#0#); -- G4_IO1 channel mode G4_IO : IOCCR_G4_IO_Field := (As_Array => False, Val => 16#0#); -- G5_IO1 channel mode G5_IO : IOCCR_G5_IO_Field := (As_Array => False, Val => 16#0#); -- G6_IO1 channel mode G6_IO : IOCCR_G6_IO_Field := (As_Array => False, Val => 16#0#); -- G7_IO1 channel mode G7_IO : IOCCR_G7_IO_Field := (As_Array => False, Val => 16#0#); -- G8_IO1 channel mode G8_IO : IOCCR_G8_IO_Field := (As_Array => False, Val => 16#0#); end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOCCR_Register use record G1_IO at 0 range 0 .. 3; G2_IO at 0 range 4 .. 7; G3_IO at 0 range 8 .. 11; G4_IO at 0 range 12 .. 15; G5_IO at 0 range 16 .. 19; G6_IO at 0 range 20 .. 23; G7_IO at 0 range 24 .. 27; G8_IO at 0 range 28 .. 31; end record; -- I/O group control status register type IOGCSR_Register is record -- Analog I/O group x enable G1E : Boolean := False; -- Analog I/O group x enable G2E : Boolean := False; -- Analog I/O group x enable G3E : Boolean := False; -- Analog I/O group x enable G4E : Boolean := False; -- Analog I/O group x enable G5E : Boolean := False; -- Analog I/O group x enable G6E : Boolean := False; -- Analog I/O group x enable G7E : Boolean := False; -- Analog I/O group x enable G8E : Boolean := False; -- unspecified Reserved_8_15 : HAL.UInt8 := 16#0#; -- Read-only. Analog I/O group x status G1S : Boolean := False; -- Read-only. Analog I/O group x status G2S : Boolean := False; -- Read-only. Analog I/O group x status G3S : Boolean := False; -- Read-only. Analog I/O group x status G4S : Boolean := False; -- Read-only. Analog I/O group x status G5S : Boolean := False; -- Read-only. Analog I/O group x status G6S : Boolean := False; -- Analog I/O group x status G7S : Boolean := False; -- Analog I/O group x status G8S : Boolean := False; -- unspecified Reserved_24_31 : HAL.UInt8 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOGCSR_Register use record G1E at 0 range 0 .. 0; G2E at 0 range 1 .. 1; G3E at 0 range 2 .. 2; G4E at 0 range 3 .. 3; G5E at 0 range 4 .. 4; G6E at 0 range 5 .. 5; G7E at 0 range 6 .. 6; G8E at 0 range 7 .. 7; Reserved_8_15 at 0 range 8 .. 15; G1S at 0 range 16 .. 16; G2S at 0 range 17 .. 17; G3S at 0 range 18 .. 18; G4S at 0 range 19 .. 19; G5S at 0 range 20 .. 20; G6S at 0 range 21 .. 21; G7S at 0 range 22 .. 22; G8S at 0 range 23 .. 23; Reserved_24_31 at 0 range 24 .. 31; end record; subtype IOG1CR_CNT_Field is HAL.UInt14; -- I/O group x counter register type IOG1CR_Register is record -- Read-only. Counter value CNT : IOG1CR_CNT_Field; -- unspecified Reserved_14_31 : HAL.UInt18; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOG1CR_Register use record CNT at 0 range 0 .. 13; Reserved_14_31 at 0 range 14 .. 31; end record; subtype IOG2CR_CNT_Field is HAL.UInt14; -- I/O group x counter register type IOG2CR_Register is record -- Read-only. Counter value CNT : IOG2CR_CNT_Field; -- unspecified Reserved_14_31 : HAL.UInt18; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOG2CR_Register use record CNT at 0 range 0 .. 13; Reserved_14_31 at 0 range 14 .. 31; end record; subtype IOG3CR_CNT_Field is HAL.UInt14; -- I/O group x counter register type IOG3CR_Register is record -- Read-only. Counter value CNT : IOG3CR_CNT_Field; -- unspecified Reserved_14_31 : HAL.UInt18; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOG3CR_Register use record CNT at 0 range 0 .. 13; Reserved_14_31 at 0 range 14 .. 31; end record; subtype IOG4CR_CNT_Field is HAL.UInt14; -- I/O group x counter register type IOG4CR_Register is record -- Read-only. Counter value CNT : IOG4CR_CNT_Field; -- unspecified Reserved_14_31 : HAL.UInt18; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOG4CR_Register use record CNT at 0 range 0 .. 13; Reserved_14_31 at 0 range 14 .. 31; end record; subtype IOG5CR_CNT_Field is HAL.UInt14; -- I/O group x counter register type IOG5CR_Register is record -- Read-only. Counter value CNT : IOG5CR_CNT_Field; -- unspecified Reserved_14_31 : HAL.UInt18; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOG5CR_Register use record CNT at 0 range 0 .. 13; Reserved_14_31 at 0 range 14 .. 31; end record; subtype IOG6CR_CNT_Field is HAL.UInt14; -- I/O group x counter register type IOG6CR_Register is record -- Read-only. Counter value CNT : IOG6CR_CNT_Field; -- unspecified Reserved_14_31 : HAL.UInt18; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOG6CR_Register use record CNT at 0 range 0 .. 13; Reserved_14_31 at 0 range 14 .. 31; end record; subtype IOG7CR_CNT_Field is HAL.UInt14; -- I/O group x counter register type IOG7CR_Register is record -- Read-only. Counter value CNT : IOG7CR_CNT_Field; -- unspecified Reserved_14_31 : HAL.UInt18; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOG7CR_Register use record CNT at 0 range 0 .. 13; Reserved_14_31 at 0 range 14 .. 31; end record; subtype IOG8CR_CNT_Field is HAL.UInt14; -- I/O group x counter register type IOG8CR_Register is record -- Read-only. Counter value CNT : IOG8CR_CNT_Field; -- unspecified Reserved_14_31 : HAL.UInt18; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOG8CR_Register use record CNT at 0 range 0 .. 13; Reserved_14_31 at 0 range 14 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Touch sensing controller type TSC_Peripheral is record -- control register CR : aliased CR_Register; -- interrupt enable register IER : aliased IER_Register; -- interrupt clear register ICR : aliased ICR_Register; -- interrupt status register ISR : aliased ISR_Register; -- I/O hysteresis control register IOHCR : aliased IOHCR_Register; -- I/O analog switch control register IOASCR : aliased IOASCR_Register; -- I/O sampling control register IOSCR : aliased IOSCR_Register; -- I/O channel control register IOCCR : aliased IOCCR_Register; -- I/O group control status register IOGCSR : aliased IOGCSR_Register; -- I/O group x counter register IOG1CR : aliased IOG1CR_Register; -- I/O group x counter register IOG2CR : aliased IOG2CR_Register; -- I/O group x counter register IOG3CR : aliased IOG3CR_Register; -- I/O group x counter register IOG4CR : aliased IOG4CR_Register; -- I/O group x counter register IOG5CR : aliased IOG5CR_Register; -- I/O group x counter register IOG6CR : aliased IOG6CR_Register; -- I/O group x counter register IOG7CR : aliased IOG7CR_Register; -- I/O group x counter register IOG8CR : aliased IOG8CR_Register; end record with Volatile; for TSC_Peripheral use record CR at 16#0# range 0 .. 31; IER at 16#4# range 0 .. 31; ICR at 16#8# range 0 .. 31; ISR at 16#C# range 0 .. 31; IOHCR at 16#10# range 0 .. 31; IOASCR at 16#18# range 0 .. 31; IOSCR at 16#20# range 0 .. 31; IOCCR at 16#28# range 0 .. 31; IOGCSR at 16#30# range 0 .. 31; IOG1CR at 16#34# range 0 .. 31; IOG2CR at 16#38# range 0 .. 31; IOG3CR at 16#3C# range 0 .. 31; IOG4CR at 16#40# range 0 .. 31; IOG5CR at 16#44# range 0 .. 31; IOG6CR at 16#48# range 0 .. 31; IOG7CR at 16#4C# range 0 .. 31; IOG8CR at 16#50# range 0 .. 31; end record; -- Touch sensing controller TSC_Periph : aliased TSC_Peripheral with Import, Address => TSC_Base; end STM32_SVD.TSC;

29.47678

70

0.576856

03110e45aa7e6a32e709628fc6a7a266b2cb648f

36,042

ads

Ada

Des_Ada/obj/b__main.ads

VMika/Des_Ada

fcadb38aa9118e668329c3443d3b6e4c83456acc

[ "MIT" ]

null

Des_Ada/obj/b__main.ads

VMika/Des_Ada

fcadb38aa9118e668329c3443d3b6e4c83456acc

[ "MIT" ]

null

Des_Ada/obj/b__main.ads

VMika/Des_Ada

fcadb38aa9118e668329c3443d3b6e4c83456acc

[ "MIT" ]

null

pragma Warnings (Off); pragma Ada_95; with System; package ada_main is gnat_argc : Integer; gnat_argv : System.Address; gnat_envp : System.Address; pragma Import (C, gnat_argc); pragma Import (C, gnat_argv); pragma Import (C, gnat_envp); gnat_exit_status : Integer; pragma Import (C, gnat_exit_status); GNAT_Version : constant String := "GNAT Version: GPL 2017 (20170515-63)" & ASCII.NUL; pragma Export (C, GNAT_Version, "__gnat_version"); Ada_Main_Program_Name : constant String := "_ada_main" & ASCII.NUL; pragma Export (C, Ada_Main_Program_Name, "__gnat_ada_main_program_name"); procedure adainit; pragma Export (C, adainit, "adainit"); procedure adafinal; pragma Export (C, adafinal, "adafinal"); function main (argc : Integer; argv : System.Address; envp : System.Address) return Integer; pragma Export (C, main, "main"); type Version_32 is mod 2 ** 32; u00001 : constant Version_32 := 16#d38f2cda#; pragma Export (C, u00001, "mainB"); u00002 : constant Version_32 := 16#b6df930e#; pragma Export (C, u00002, "system__standard_libraryB"); u00003 : constant Version_32 := 16#0a55feef#; pragma Export (C, u00003, "system__standard_libraryS"); u00004 : constant Version_32 := 16#76789da1#; pragma Export (C, u00004, "adaS"); u00005 : constant Version_32 := 16#0d7f1a43#; pragma Export (C, u00005, "ada__calendarB"); u00006 : constant Version_32 := 16#5b279c75#; pragma Export (C, u00006, "ada__calendarS"); u00007 : constant Version_32 := 16#85a06f66#; pragma Export (C, u00007, "ada__exceptionsB"); u00008 : constant Version_32 := 16#1a0dcc03#; pragma Export (C, u00008, "ada__exceptionsS"); u00009 : constant Version_32 := 16#e947e6a9#; pragma Export (C, u00009, "ada__exceptions__last_chance_handlerB"); u00010 : constant Version_32 := 16#41e5552e#; pragma Export (C, u00010, "ada__exceptions__last_chance_handlerS"); u00011 : constant Version_32 := 16#32a08138#; pragma Export (C, u00011, "systemS"); u00012 : constant Version_32 := 16#4e7785b8#; pragma Export (C, u00012, "system__soft_linksB"); u00013 : constant Version_32 := 16#ac24596d#; pragma Export (C, u00013, "system__soft_linksS"); u00014 : constant Version_32 := 16#b01dad17#; pragma Export (C, u00014, "system__parametersB"); u00015 : constant Version_32 := 16#4c8a8c47#; pragma Export (C, u00015, "system__parametersS"); u00016 : constant Version_32 := 16#30ad09e5#; pragma Export (C, u00016, "system__secondary_stackB"); u00017 : constant Version_32 := 16#88327e42#; pragma Export (C, u00017, "system__secondary_stackS"); u00018 : constant Version_32 := 16#f103f468#; pragma Export (C, u00018, "system__storage_elementsB"); u00019 : constant Version_32 := 16#1f63cb3c#; pragma Export (C, u00019, "system__storage_elementsS"); u00020 : constant Version_32 := 16#41837d1e#; pragma Export (C, u00020, "system__stack_checkingB"); u00021 : constant Version_32 := 16#bc1fead0#; pragma Export (C, u00021, "system__stack_checkingS"); u00022 : constant Version_32 := 16#87a448ff#; pragma Export (C, u00022, "system__exception_tableB"); u00023 : constant Version_32 := 16#6f0ee87a#; pragma Export (C, u00023, "system__exception_tableS"); u00024 : constant Version_32 := 16#ce4af020#; pragma Export (C, u00024, "system__exceptionsB"); u00025 : constant Version_32 := 16#5ac3ecce#; pragma Export (C, u00025, "system__exceptionsS"); u00026 : constant Version_32 := 16#80916427#; pragma Export (C, u00026, "system__exceptions__machineB"); u00027 : constant Version_32 := 16#047ef179#; pragma Export (C, u00027, "system__exceptions__machineS"); u00028 : constant Version_32 := 16#aa0563fc#; pragma Export (C, u00028, "system__exceptions_debugB"); u00029 : constant Version_32 := 16#4c2a78fc#; pragma Export (C, u00029, "system__exceptions_debugS"); u00030 : constant Version_32 := 16#6c2f8802#; pragma Export (C, u00030, "system__img_intB"); u00031 : constant Version_32 := 16#307b61fa#; pragma Export (C, u00031, "system__img_intS"); u00032 : constant Version_32 := 16#39df8c17#; pragma Export (C, u00032, "system__tracebackB"); u00033 : constant Version_32 := 16#6c825ffc#; pragma Export (C, u00033, "system__tracebackS"); u00034 : constant Version_32 := 16#9ed49525#; pragma Export (C, u00034, "system__traceback_entriesB"); u00035 : constant Version_32 := 16#32fb7748#; pragma Export (C, u00035, "system__traceback_entriesS"); u00036 : constant Version_32 := 16#18d5fcc5#; pragma Export (C, u00036, "system__traceback__symbolicB"); u00037 : constant Version_32 := 16#9df1ae6d#; pragma Export (C, u00037, "system__traceback__symbolicS"); u00038 : constant Version_32 := 16#179d7d28#; pragma Export (C, u00038, "ada__containersS"); u00039 : constant Version_32 := 16#701f9d88#; pragma Export (C, u00039, "ada__exceptions__tracebackB"); u00040 : constant Version_32 := 16#20245e75#; pragma Export (C, u00040, "ada__exceptions__tracebackS"); u00041 : constant Version_32 := 16#e865e681#; pragma Export (C, u00041, "system__bounded_stringsB"); u00042 : constant Version_32 := 16#455da021#; pragma Export (C, u00042, "system__bounded_stringsS"); u00043 : constant Version_32 := 16#42315736#; pragma Export (C, u00043, "system__crtlS"); u00044 : constant Version_32 := 16#08e0d717#; pragma Export (C, u00044, "system__dwarf_linesB"); u00045 : constant Version_32 := 16#b1bd2788#; pragma Export (C, u00045, "system__dwarf_linesS"); u00046 : constant Version_32 := 16#5b4659fa#; pragma Export (C, u00046, "ada__charactersS"); u00047 : constant Version_32 := 16#8f637df8#; pragma Export (C, u00047, "ada__characters__handlingB"); u00048 : constant Version_32 := 16#3b3f6154#; pragma Export (C, u00048, "ada__characters__handlingS"); u00049 : constant Version_32 := 16#4b7bb96a#; pragma Export (C, u00049, "ada__characters__latin_1S"); u00050 : constant Version_32 := 16#e6d4fa36#; pragma Export (C, u00050, "ada__stringsS"); u00051 : constant Version_32 := 16#e2ea8656#; pragma Export (C, u00051, "ada__strings__mapsB"); u00052 : constant Version_32 := 16#1e526bec#; pragma Export (C, u00052, "ada__strings__mapsS"); u00053 : constant Version_32 := 16#9dc9b435#; pragma Export (C, u00053, "system__bit_opsB"); u00054 : constant Version_32 := 16#0765e3a3#; pragma Export (C, u00054, "system__bit_opsS"); u00055 : constant Version_32 := 16#0626fdbb#; pragma Export (C, u00055, "system__unsigned_typesS"); u00056 : constant Version_32 := 16#92f05f13#; pragma Export (C, u00056, "ada__strings__maps__constantsS"); u00057 : constant Version_32 := 16#5ab55268#; pragma Export (C, u00057, "interfacesS"); u00058 : constant Version_32 := 16#9f00b3d3#; pragma Export (C, u00058, "system__address_imageB"); u00059 : constant Version_32 := 16#934c1c02#; pragma Export (C, u00059, "system__address_imageS"); u00060 : constant Version_32 := 16#ec78c2bf#; pragma Export (C, u00060, "system__img_unsB"); u00061 : constant Version_32 := 16#99d2c14c#; pragma Export (C, u00061, "system__img_unsS"); u00062 : constant Version_32 := 16#d7aac20c#; pragma Export (C, u00062, "system__ioB"); u00063 : constant Version_32 := 16#ace27677#; pragma Export (C, u00063, "system__ioS"); u00064 : constant Version_32 := 16#11faaec1#; pragma Export (C, u00064, "system__mmapB"); u00065 : constant Version_32 := 16#08d13e5f#; pragma Export (C, u00065, "system__mmapS"); u00066 : constant Version_32 := 16#92d882c5#; pragma Export (C, u00066, "ada__io_exceptionsS"); u00067 : constant Version_32 := 16#9d8ecedc#; pragma Export (C, u00067, "system__mmap__os_interfaceB"); u00068 : constant Version_32 := 16#8f4541b8#; pragma Export (C, u00068, "system__mmap__os_interfaceS"); u00069 : constant Version_32 := 16#54632e7c#; pragma Export (C, u00069, "system__os_libB"); u00070 : constant Version_32 := 16#ed466fde#; pragma Export (C, u00070, "system__os_libS"); u00071 : constant Version_32 := 16#d1060688#; pragma Export (C, u00071, "system__case_utilB"); u00072 : constant Version_32 := 16#16a9e8ef#; pragma Export (C, u00072, "system__case_utilS"); u00073 : constant Version_32 := 16#2a8e89ad#; pragma Export (C, u00073, "system__stringsB"); u00074 : constant Version_32 := 16#4c1f905e#; pragma Export (C, u00074, "system__stringsS"); u00075 : constant Version_32 := 16#769e25e6#; pragma Export (C, u00075, "interfaces__cB"); u00076 : constant Version_32 := 16#70be4e8c#; pragma Export (C, u00076, "interfaces__cS"); u00077 : constant Version_32 := 16#d0bc914c#; pragma Export (C, u00077, "system__object_readerB"); u00078 : constant Version_32 := 16#7f932442#; pragma Export (C, u00078, "system__object_readerS"); u00079 : constant Version_32 := 16#1a74a354#; pragma Export (C, u00079, "system__val_lliB"); u00080 : constant Version_32 := 16#a8846798#; pragma Export (C, u00080, "system__val_lliS"); u00081 : constant Version_32 := 16#afdbf393#; pragma Export (C, u00081, "system__val_lluB"); u00082 : constant Version_32 := 16#7cd4aac9#; pragma Export (C, u00082, "system__val_lluS"); u00083 : constant Version_32 := 16#27b600b2#; pragma Export (C, u00083, "system__val_utilB"); u00084 : constant Version_32 := 16#9e0037c6#; pragma Export (C, u00084, "system__val_utilS"); u00085 : constant Version_32 := 16#5bbc3f2f#; pragma Export (C, u00085, "system__exception_tracesB"); u00086 : constant Version_32 := 16#167fa1a2#; pragma Export (C, u00086, "system__exception_tracesS"); u00087 : constant Version_32 := 16#d178f226#; pragma Export (C, u00087, "system__win32S"); u00088 : constant Version_32 := 16#8c33a517#; pragma Export (C, u00088, "system__wch_conB"); u00089 : constant Version_32 := 16#29dda3ea#; pragma Export (C, u00089, "system__wch_conS"); u00090 : constant Version_32 := 16#9721e840#; pragma Export (C, u00090, "system__wch_stwB"); u00091 : constant Version_32 := 16#04cc8feb#; pragma Export (C, u00091, "system__wch_stwS"); u00092 : constant Version_32 := 16#a831679c#; pragma Export (C, u00092, "system__wch_cnvB"); u00093 : constant Version_32 := 16#266a1919#; pragma Export (C, u00093, "system__wch_cnvS"); u00094 : constant Version_32 := 16#ece6fdb6#; pragma Export (C, u00094, "system__wch_jisB"); u00095 : constant Version_32 := 16#a61a0038#; pragma Export (C, u00095, "system__wch_jisS"); u00096 : constant Version_32 := 16#a99e1d66#; pragma Export (C, u00096, "system__os_primitivesB"); u00097 : constant Version_32 := 16#b82f904e#; pragma Export (C, u00097, "system__os_primitivesS"); u00098 : constant Version_32 := 16#b6166bc6#; pragma Export (C, u00098, "system__task_lockB"); u00099 : constant Version_32 := 16#532ab656#; pragma Export (C, u00099, "system__task_lockS"); u00100 : constant Version_32 := 16#1a9147da#; pragma Export (C, u00100, "system__win32__extS"); u00101 : constant Version_32 := 16#f64b89a4#; pragma Export (C, u00101, "ada__integer_text_ioB"); u00102 : constant Version_32 := 16#b85ee1d1#; pragma Export (C, u00102, "ada__integer_text_ioS"); u00103 : constant Version_32 := 16#1d1c6062#; pragma Export (C, u00103, "ada__text_ioB"); u00104 : constant Version_32 := 16#95711eac#; pragma Export (C, u00104, "ada__text_ioS"); u00105 : constant Version_32 := 16#10558b11#; pragma Export (C, u00105, "ada__streamsB"); u00106 : constant Version_32 := 16#67e31212#; pragma Export (C, u00106, "ada__streamsS"); u00107 : constant Version_32 := 16#d85792d6#; pragma Export (C, u00107, "ada__tagsB"); u00108 : constant Version_32 := 16#8813468c#; pragma Export (C, u00108, "ada__tagsS"); u00109 : constant Version_32 := 16#c3335bfd#; pragma Export (C, u00109, "system__htableB"); u00110 : constant Version_32 := 16#b66232d2#; pragma Export (C, u00110, "system__htableS"); u00111 : constant Version_32 := 16#089f5cd0#; pragma Export (C, u00111, "system__string_hashB"); u00112 : constant Version_32 := 16#143c59ac#; pragma Export (C, u00112, "system__string_hashS"); u00113 : constant Version_32 := 16#1d9142a4#; pragma Export (C, u00113, "system__val_unsB"); u00114 : constant Version_32 := 16#168e1080#; pragma Export (C, u00114, "system__val_unsS"); u00115 : constant Version_32 := 16#4c01b69c#; pragma Export (C, u00115, "interfaces__c_streamsB"); u00116 : constant Version_32 := 16#b1330297#; pragma Export (C, u00116, "interfaces__c_streamsS"); u00117 : constant Version_32 := 16#6f0d52aa#; pragma Export (C, u00117, "system__file_ioB"); u00118 : constant Version_32 := 16#95d1605d#; pragma Export (C, u00118, "system__file_ioS"); u00119 : constant Version_32 := 16#86c56e5a#; pragma Export (C, u00119, "ada__finalizationS"); u00120 : constant Version_32 := 16#95817ed8#; pragma Export (C, u00120, "system__finalization_rootB"); u00121 : constant Version_32 := 16#7d52f2a8#; pragma Export (C, u00121, "system__finalization_rootS"); u00122 : constant Version_32 := 16#cf3f1b90#; pragma Export (C, u00122, "system__file_control_blockS"); u00123 : constant Version_32 := 16#f6fdca1c#; pragma Export (C, u00123, "ada__text_io__integer_auxB"); u00124 : constant Version_32 := 16#b9793d30#; pragma Export (C, u00124, "ada__text_io__integer_auxS"); u00125 : constant Version_32 := 16#181dc502#; pragma Export (C, u00125, "ada__text_io__generic_auxB"); u00126 : constant Version_32 := 16#a6c327d3#; pragma Export (C, u00126, "ada__text_io__generic_auxS"); u00127 : constant Version_32 := 16#b10ba0c7#; pragma Export (C, u00127, "system__img_biuB"); u00128 : constant Version_32 := 16#c00475f6#; pragma Export (C, u00128, "system__img_biuS"); u00129 : constant Version_32 := 16#4e06ab0c#; pragma Export (C, u00129, "system__img_llbB"); u00130 : constant Version_32 := 16#81c36508#; pragma Export (C, u00130, "system__img_llbS"); u00131 : constant Version_32 := 16#9dca6636#; pragma Export (C, u00131, "system__img_lliB"); u00132 : constant Version_32 := 16#23efd4e9#; pragma Export (C, u00132, "system__img_lliS"); u00133 : constant Version_32 := 16#a756d097#; pragma Export (C, u00133, "system__img_llwB"); u00134 : constant Version_32 := 16#28af469e#; pragma Export (C, u00134, "system__img_llwS"); u00135 : constant Version_32 := 16#eb55dfbb#; pragma Export (C, u00135, "system__img_wiuB"); u00136 : constant Version_32 := 16#ae45f264#; pragma Export (C, u00136, "system__img_wiuS"); u00137 : constant Version_32 := 16#d763507a#; pragma Export (C, u00137, "system__val_intB"); u00138 : constant Version_32 := 16#7a05ab07#; pragma Export (C, u00138, "system__val_intS"); u00139 : constant Version_32 := 16#03fc996e#; pragma Export (C, u00139, "ada__real_timeB"); u00140 : constant Version_32 := 16#c3d451b0#; pragma Export (C, u00140, "ada__real_timeS"); u00141 : constant Version_32 := 16#cb56a7b3#; pragma Export (C, u00141, "system__taskingB"); u00142 : constant Version_32 := 16#70384b95#; pragma Export (C, u00142, "system__taskingS"); u00143 : constant Version_32 := 16#c71f56c0#; pragma Export (C, u00143, "system__task_primitivesS"); u00144 : constant Version_32 := 16#fa769fc7#; pragma Export (C, u00144, "system__os_interfaceS"); u00145 : constant Version_32 := 16#22b0e2af#; pragma Export (C, u00145, "interfaces__c__stringsB"); u00146 : constant Version_32 := 16#603c1c44#; pragma Export (C, u00146, "interfaces__c__stringsS"); u00147 : constant Version_32 := 16#fc754292#; pragma Export (C, u00147, "system__task_primitives__operationsB"); u00148 : constant Version_32 := 16#24684c98#; pragma Export (C, u00148, "system__task_primitives__operationsS"); u00149 : constant Version_32 := 16#1b28662b#; pragma Export (C, u00149, "system__float_controlB"); u00150 : constant Version_32 := 16#d25cc204#; pragma Export (C, u00150, "system__float_controlS"); u00151 : constant Version_32 := 16#da8ccc08#; pragma Export (C, u00151, "system__interrupt_managementB"); u00152 : constant Version_32 := 16#0f60a80c#; pragma Export (C, u00152, "system__interrupt_managementS"); u00153 : constant Version_32 := 16#f65595cf#; pragma Export (C, u00153, "system__multiprocessorsB"); u00154 : constant Version_32 := 16#0a0c1e4b#; pragma Export (C, u00154, "system__multiprocessorsS"); u00155 : constant Version_32 := 16#77769007#; pragma Export (C, u00155, "system__task_infoB"); u00156 : constant Version_32 := 16#e54688cf#; pragma Export (C, u00156, "system__task_infoS"); u00157 : constant Version_32 := 16#9471a5c6#; pragma Export (C, u00157, "system__tasking__debugB"); u00158 : constant Version_32 := 16#f1f2435f#; pragma Export (C, u00158, "system__tasking__debugS"); u00159 : constant Version_32 := 16#fd83e873#; pragma Export (C, u00159, "system__concat_2B"); u00160 : constant Version_32 := 16#300056e8#; pragma Export (C, u00160, "system__concat_2S"); u00161 : constant Version_32 := 16#2b70b149#; pragma Export (C, u00161, "system__concat_3B"); u00162 : constant Version_32 := 16#39d0dd9d#; pragma Export (C, u00162, "system__concat_3S"); u00163 : constant Version_32 := 16#18e0e51c#; pragma Export (C, u00163, "system__img_enum_newB"); u00164 : constant Version_32 := 16#53ec87f8#; pragma Export (C, u00164, "system__img_enum_newS"); u00165 : constant Version_32 := 16#118e865d#; pragma Export (C, u00165, "system__stack_usageB"); u00166 : constant Version_32 := 16#3a3ac346#; pragma Export (C, u00166, "system__stack_usageS"); u00167 : constant Version_32 := 16#3791e504#; pragma Export (C, u00167, "ada__strings__unboundedB"); u00168 : constant Version_32 := 16#9fdb1809#; pragma Export (C, u00168, "ada__strings__unboundedS"); u00169 : constant Version_32 := 16#144f64ae#; pragma Export (C, u00169, "ada__strings__searchB"); u00170 : constant Version_32 := 16#c1ab8667#; pragma Export (C, u00170, "ada__strings__searchS"); u00171 : constant Version_32 := 16#933d1555#; pragma Export (C, u00171, "system__compare_array_unsigned_8B"); u00172 : constant Version_32 := 16#9ba3f0b5#; pragma Export (C, u00172, "system__compare_array_unsigned_8S"); u00173 : constant Version_32 := 16#97d13ec4#; pragma Export (C, u00173, "system__address_operationsB"); u00174 : constant Version_32 := 16#21ac3f0b#; pragma Export (C, u00174, "system__address_operationsS"); u00175 : constant Version_32 := 16#a2250034#; pragma Export (C, u00175, "system__storage_pools__subpoolsB"); u00176 : constant Version_32 := 16#cc5a1856#; pragma Export (C, u00176, "system__storage_pools__subpoolsS"); u00177 : constant Version_32 := 16#6abe5dbe#; pragma Export (C, u00177, "system__finalization_mastersB"); u00178 : constant Version_32 := 16#695cb8f2#; pragma Export (C, u00178, "system__finalization_mastersS"); u00179 : constant Version_32 := 16#7268f812#; pragma Export (C, u00179, "system__img_boolB"); u00180 : constant Version_32 := 16#c779f0d3#; pragma Export (C, u00180, "system__img_boolS"); u00181 : constant Version_32 := 16#6d4d969a#; pragma Export (C, u00181, "system__storage_poolsB"); u00182 : constant Version_32 := 16#114d1f95#; pragma Export (C, u00182, "system__storage_poolsS"); u00183 : constant Version_32 := 16#9aad1ff1#; pragma Export (C, u00183, "system__storage_pools__subpools__finalizationB"); u00184 : constant Version_32 := 16#fe2f4b3a#; pragma Export (C, u00184, "system__storage_pools__subpools__finalizationS"); u00185 : constant Version_32 := 16#70f25dad#; pragma Export (C, u00185, "system__atomic_countersB"); u00186 : constant Version_32 := 16#86fcacb5#; pragma Export (C, u00186, "system__atomic_countersS"); u00187 : constant Version_32 := 16#5fc82639#; pragma Export (C, u00187, "system__machine_codeS"); u00188 : constant Version_32 := 16#3c420900#; pragma Export (C, u00188, "system__stream_attributesB"); u00189 : constant Version_32 := 16#8bc30a4e#; pragma Export (C, u00189, "system__stream_attributesS"); u00190 : constant Version_32 := 16#97a2d3b4#; pragma Export (C, u00190, "ada__strings__unbounded__text_ioB"); u00191 : constant Version_32 := 16#f26abf4c#; pragma Export (C, u00191, "ada__strings__unbounded__text_ioS"); u00192 : constant Version_32 := 16#64b60562#; pragma Export (C, u00192, "p_stephandlerB"); u00193 : constant Version_32 := 16#c35ffe0a#; pragma Export (C, u00193, "p_stephandlerS"); u00194 : constant Version_32 := 16#a9261bbe#; pragma Export (C, u00194, "p_structuraltypesB"); u00195 : constant Version_32 := 16#386e2dac#; pragma Export (C, u00195, "p_structuraltypesS"); u00196 : constant Version_32 := 16#a347755d#; pragma Export (C, u00196, "ada__text_io__modular_auxB"); u00197 : constant Version_32 := 16#0d2bef47#; pragma Export (C, u00197, "ada__text_io__modular_auxS"); u00198 : constant Version_32 := 16#3e932977#; pragma Export (C, u00198, "system__img_lluB"); u00199 : constant Version_32 := 16#4feffd78#; pragma Export (C, u00199, "system__img_lluS"); u00200 : constant Version_32 := 16#23e4cea4#; pragma Export (C, u00200, "interfaces__cobolB"); u00201 : constant Version_32 := 16#394647ba#; pragma Export (C, u00201, "interfaces__cobolS"); u00202 : constant Version_32 := 16#5a895de2#; pragma Export (C, u00202, "system__pool_globalB"); u00203 : constant Version_32 := 16#7141203e#; pragma Export (C, u00203, "system__pool_globalS"); u00204 : constant Version_32 := 16#ee101ba4#; pragma Export (C, u00204, "system__memoryB"); u00205 : constant Version_32 := 16#6bdde70c#; pragma Export (C, u00205, "system__memoryS"); u00206 : constant Version_32 := 16#3adf5e61#; pragma Export (C, u00206, "p_stephandler__feistelhandlerB"); u00207 : constant Version_32 := 16#8e57995f#; pragma Export (C, u00207, "p_stephandler__feistelhandlerS"); u00208 : constant Version_32 := 16#e76fa629#; pragma Export (C, u00208, "p_stephandler__inputhandlerB"); u00209 : constant Version_32 := 16#abe41686#; pragma Export (C, u00209, "p_stephandler__inputhandlerS"); u00210 : constant Version_32 := 16#4b3cf578#; pragma Export (C, u00210, "system__byte_swappingS"); u00211 : constant Version_32 := 16#796b5f0d#; pragma Export (C, u00211, "system__sequential_ioB"); u00212 : constant Version_32 := 16#d8cc2bc8#; pragma Export (C, u00212, "system__sequential_ioS"); u00213 : constant Version_32 := 16#0806edc3#; pragma Export (C, u00213, "system__strings__stream_opsB"); u00214 : constant Version_32 := 16#55d4bd57#; pragma Export (C, u00214, "system__strings__stream_opsS"); u00215 : constant Version_32 := 16#17411e58#; pragma Export (C, u00215, "ada__streams__stream_ioB"); u00216 : constant Version_32 := 16#31fc8e02#; pragma Export (C, u00216, "ada__streams__stream_ioS"); u00217 : constant Version_32 := 16#5de653db#; pragma Export (C, u00217, "system__communicationB"); u00218 : constant Version_32 := 16#2bc0d4ea#; pragma Export (C, u00218, "system__communicationS"); u00219 : constant Version_32 := 16#8500a3df#; pragma Export (C, u00219, "p_stephandler__iphandlerB"); u00220 : constant Version_32 := 16#780e2d9b#; pragma Export (C, u00220, "p_stephandler__iphandlerS"); u00221 : constant Version_32 := 16#c0587cca#; pragma Export (C, u00221, "p_stephandler__keyhandlerB"); u00222 : constant Version_32 := 16#3666019b#; pragma Export (C, u00222, "p_stephandler__keyhandlerS"); u00223 : constant Version_32 := 16#13b3baa7#; pragma Export (C, u00223, "p_stephandler__outputhandlerB"); u00224 : constant Version_32 := 16#3db246c7#; pragma Export (C, u00224, "p_stephandler__outputhandlerS"); u00225 : constant Version_32 := 16#290d89e9#; pragma Export (C, u00225, "p_stephandler__reverseiphandlerB"); u00226 : constant Version_32 := 16#f3f8e71c#; pragma Export (C, u00226, "p_stephandler__reverseiphandlerS"); u00227 : constant Version_32 := 16#276453b7#; pragma Export (C, u00227, "system__img_lldB"); u00228 : constant Version_32 := 16#c1828851#; pragma Export (C, u00228, "system__img_lldS"); u00229 : constant Version_32 := 16#bd3715ff#; pragma Export (C, u00229, "system__img_decB"); u00230 : constant Version_32 := 16#9c8d88e3#; pragma Export (C, u00230, "system__img_decS"); u00231 : constant Version_32 := 16#96bbd7c2#; pragma Export (C, u00231, "system__tasking__rendezvousB"); u00232 : constant Version_32 := 16#ea18a31e#; pragma Export (C, u00232, "system__tasking__rendezvousS"); u00233 : constant Version_32 := 16#100eaf58#; pragma Export (C, u00233, "system__restrictionsB"); u00234 : constant Version_32 := 16#c1c3a556#; pragma Export (C, u00234, "system__restrictionsS"); u00235 : constant Version_32 := 16#6896b958#; pragma Export (C, u00235, "system__tasking__entry_callsB"); u00236 : constant Version_32 := 16#df420580#; pragma Export (C, u00236, "system__tasking__entry_callsS"); u00237 : constant Version_32 := 16#bc23950c#; pragma Export (C, u00237, "system__tasking__initializationB"); u00238 : constant Version_32 := 16#efd25374#; pragma Export (C, u00238, "system__tasking__initializationS"); u00239 : constant Version_32 := 16#72fc64c4#; pragma Export (C, u00239, "system__soft_links__taskingB"); u00240 : constant Version_32 := 16#5ae92880#; pragma Export (C, u00240, "system__soft_links__taskingS"); u00241 : constant Version_32 := 16#17d21067#; pragma Export (C, u00241, "ada__exceptions__is_null_occurrenceB"); u00242 : constant Version_32 := 16#e1d7566f#; pragma Export (C, u00242, "ada__exceptions__is_null_occurrenceS"); u00243 : constant Version_32 := 16#e774edef#; pragma Export (C, u00243, "system__tasking__task_attributesB"); u00244 : constant Version_32 := 16#6bc95a13#; pragma Export (C, u00244, "system__tasking__task_attributesS"); u00245 : constant Version_32 := 16#8bdfec1d#; pragma Export (C, u00245, "system__tasking__protected_objectsB"); u00246 : constant Version_32 := 16#a9001c61#; pragma Export (C, u00246, "system__tasking__protected_objectsS"); u00247 : constant Version_32 := 16#ee80728a#; pragma Export (C, u00247, "system__tracesB"); u00248 : constant Version_32 := 16#c0bde992#; pragma Export (C, u00248, "system__tracesS"); u00249 : constant Version_32 := 16#17aa7da7#; pragma Export (C, u00249, "system__tasking__protected_objects__entriesB"); u00250 : constant Version_32 := 16#427cf21f#; pragma Export (C, u00250, "system__tasking__protected_objects__entriesS"); u00251 : constant Version_32 := 16#1dc86ab7#; pragma Export (C, u00251, "system__tasking__protected_objects__operationsB"); u00252 : constant Version_32 := 16#ba36ad85#; pragma Export (C, u00252, "system__tasking__protected_objects__operationsS"); u00253 : constant Version_32 := 16#ab2f8f51#; pragma Export (C, u00253, "system__tasking__queuingB"); u00254 : constant Version_32 := 16#d1ba2fcb#; pragma Export (C, u00254, "system__tasking__queuingS"); u00255 : constant Version_32 := 16#f9053daa#; pragma Export (C, u00255, "system__tasking__utilitiesB"); u00256 : constant Version_32 := 16#14a33d48#; pragma Export (C, u00256, "system__tasking__utilitiesS"); u00257 : constant Version_32 := 16#bd6fc52e#; pragma Export (C, u00257, "system__traces__taskingB"); u00258 : constant Version_32 := 16#09f07b39#; pragma Export (C, u00258, "system__traces__taskingS"); u00259 : constant Version_32 := 16#d8fc9f88#; pragma Export (C, u00259, "system__tasking__stagesB"); u00260 : constant Version_32 := 16#e9cef940#; pragma Export (C, u00260, "system__tasking__stagesS"); -- BEGIN ELABORATION ORDER -- ada%s -- ada.characters%s -- ada.characters.latin_1%s -- interfaces%s -- system%s -- system.address_operations%s -- system.address_operations%b -- system.byte_swapping%s -- system.case_util%s -- system.case_util%b -- system.float_control%s -- system.float_control%b -- system.img_bool%s -- system.img_bool%b -- system.img_enum_new%s -- system.img_enum_new%b -- system.img_int%s -- system.img_int%b -- system.img_dec%s -- system.img_dec%b -- system.img_lli%s -- system.img_lli%b -- system.img_lld%s -- system.img_lld%b -- system.io%s -- system.io%b -- system.machine_code%s -- system.atomic_counters%s -- system.atomic_counters%b -- system.parameters%s -- system.parameters%b -- system.crtl%s -- interfaces.c_streams%s -- interfaces.c_streams%b -- system.restrictions%s -- system.restrictions%b -- system.storage_elements%s -- system.storage_elements%b -- system.stack_checking%s -- system.stack_checking%b -- system.stack_usage%s -- system.stack_usage%b -- system.string_hash%s -- system.string_hash%b -- system.htable%s -- system.htable%b -- system.strings%s -- system.strings%b -- system.traceback_entries%s -- system.traceback_entries%b -- system.traces%s -- system.traces%b -- system.unsigned_types%s -- system.img_biu%s -- system.img_biu%b -- system.img_llb%s -- system.img_llb%b -- system.img_llu%s -- system.img_llu%b -- system.img_llw%s -- system.img_llw%b -- system.img_uns%s -- system.img_uns%b -- system.img_wiu%s -- system.img_wiu%b -- system.wch_con%s -- system.wch_con%b -- system.wch_jis%s -- system.wch_jis%b -- system.wch_cnv%s -- system.wch_cnv%b -- system.compare_array_unsigned_8%s -- system.compare_array_unsigned_8%b -- system.concat_2%s -- system.concat_2%b -- system.concat_3%s -- system.concat_3%b -- system.traceback%s -- system.traceback%b -- system.val_util%s -- system.standard_library%s -- system.exception_traces%s -- ada.exceptions%s -- system.wch_stw%s -- system.val_util%b -- system.val_llu%s -- system.val_lli%s -- system.os_lib%s -- system.bit_ops%s -- ada.characters.handling%s -- ada.exceptions.traceback%s -- system.soft_links%s -- system.exception_table%s -- system.exception_table%b -- ada.io_exceptions%s -- ada.strings%s -- ada.containers%s -- system.exceptions%s -- system.exceptions%b -- system.secondary_stack%s -- system.address_image%s -- system.bounded_strings%s -- system.soft_links%b -- ada.exceptions.last_chance_handler%s -- system.exceptions_debug%s -- system.exceptions_debug%b -- system.exception_traces%b -- system.memory%s -- system.memory%b -- system.wch_stw%b -- system.val_llu%b -- system.val_lli%b -- interfaces.c%s -- system.win32%s -- system.mmap%s -- system.mmap.os_interface%s -- system.mmap.os_interface%b -- system.mmap%b -- system.os_lib%b -- system.bit_ops%b -- ada.strings.maps%s -- ada.strings.maps.constants%s -- ada.characters.handling%b -- ada.exceptions.traceback%b -- system.exceptions.machine%s -- system.exceptions.machine%b -- system.secondary_stack%b -- system.address_image%b -- system.bounded_strings%b -- ada.exceptions.last_chance_handler%b -- system.standard_library%b -- system.object_reader%s -- system.dwarf_lines%s -- system.dwarf_lines%b -- interfaces.c%b -- ada.strings.maps%b -- system.traceback.symbolic%s -- system.traceback.symbolic%b -- ada.exceptions%b -- system.object_reader%b -- ada.exceptions.is_null_occurrence%s -- ada.exceptions.is_null_occurrence%b -- ada.strings.search%s -- ada.strings.search%b -- interfaces.c.strings%s -- interfaces.c.strings%b -- interfaces.cobol%s -- interfaces.cobol%b -- system.multiprocessors%s -- system.multiprocessors%b -- system.os_interface%s -- system.interrupt_management%s -- system.interrupt_management%b -- system.task_info%s -- system.task_info%b -- system.task_lock%s -- system.task_lock%b -- system.task_primitives%s -- system.val_uns%s -- system.val_uns%b -- ada.tags%s -- ada.tags%b -- ada.streams%s -- ada.streams%b -- system.communication%s -- system.communication%b -- system.file_control_block%s -- system.finalization_root%s -- system.finalization_root%b -- ada.finalization%s -- system.file_io%s -- system.file_io%b -- ada.streams.stream_io%s -- ada.streams.stream_io%b -- system.storage_pools%s -- system.storage_pools%b -- system.finalization_masters%s -- system.finalization_masters%b -- system.storage_pools.subpools%s -- system.storage_pools.subpools.finalization%s -- system.storage_pools.subpools%b -- system.storage_pools.subpools.finalization%b -- system.stream_attributes%s -- system.stream_attributes%b -- ada.strings.unbounded%s -- ada.strings.unbounded%b -- system.val_int%s -- system.val_int%b -- system.win32.ext%s -- system.os_primitives%s -- system.os_primitives%b -- system.tasking%s -- system.task_primitives.operations%s -- system.tasking.debug%s -- system.tasking%b -- system.task_primitives.operations%b -- system.tasking.debug%b -- system.traces.tasking%s -- system.traces.tasking%b -- ada.calendar%s -- ada.calendar%b -- ada.real_time%s -- ada.real_time%b -- ada.text_io%s -- ada.text_io%b -- ada.strings.unbounded.text_io%s -- ada.strings.unbounded.text_io%b -- ada.text_io.generic_aux%s -- ada.text_io.generic_aux%b -- ada.text_io.integer_aux%s -- ada.text_io.integer_aux%b -- ada.integer_text_io%s -- ada.integer_text_io%b -- ada.text_io.modular_aux%s -- ada.text_io.modular_aux%b -- system.pool_global%s -- system.pool_global%b -- system.sequential_io%s -- system.sequential_io%b -- system.soft_links.tasking%s -- system.soft_links.tasking%b -- system.strings.stream_ops%s -- system.strings.stream_ops%b -- system.tasking.initialization%s -- system.tasking.task_attributes%s -- system.tasking.initialization%b -- system.tasking.task_attributes%b -- system.tasking.protected_objects%s -- system.tasking.protected_objects%b -- system.tasking.protected_objects.entries%s -- system.tasking.protected_objects.entries%b -- system.tasking.queuing%s -- system.tasking.queuing%b -- system.tasking.utilities%s -- system.tasking.utilities%b -- system.tasking.entry_calls%s -- system.tasking.rendezvous%s -- system.tasking.protected_objects.operations%s -- system.tasking.protected_objects.operations%b -- system.tasking.entry_calls%b -- system.tasking.rendezvous%b -- system.tasking.stages%s -- system.tasking.stages%b -- p_structuraltypes%s -- p_structuraltypes%b -- p_stephandler%s -- p_stephandler%b -- p_stephandler.feistelhandler%s -- p_stephandler.feistelhandler%b -- p_stephandler.inputhandler%s -- p_stephandler.inputhandler%b -- p_stephandler.iphandler%s -- p_stephandler.iphandler%b -- p_stephandler.keyhandler%s -- p_stephandler.keyhandler%b -- p_stephandler.outputhandler%s -- p_stephandler.outputhandler%b -- p_stephandler.reverseiphandler%s -- p_stephandler.reverseiphandler%b -- main%b -- END ELABORATION ORDER end ada_main;

43.793439

80

0.700017

c7e3123de332df9d5d05fcace32891189089b364

3,833

ads

Ada

ada-wide_text_io-editing.ads

mgrojo/adalib

dc1355a5b65c2843e702ac76252addb2caf3c56b

[ "BSD-3-Clause" ]

15

2018-07-08T07:09:19.000Z

2021-11-21T09:58:55.000Z

ada-wide_text_io-editing.ads

mgrojo/adalib

dc1355a5b65c2843e702ac76252addb2caf3c56b

[ "BSD-3-Clause" ]

4

2019-11-17T20:04:33.000Z

2021-08-29T21:24:55.000Z

ada-wide_text_io-editing.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 --------------------------------------------------------------------------- package Ada.Wide_Text_IO.Editing is type Picture is private; function Valid (Pic_String : in String; Blank_When_Zero : in Boolean := False) return Boolean; function To_Picture (Pic_String : in String; Blank_When_Zero : in Boolean := False) return Picture; function Pic_String (Pic : in Picture) return String; function Blank_When_Zero (Pic : in Picture) return Boolean; Max_Picture_Length : constant := implementation_defined; Picture_Error : exception; Default_Currency : constant Wide_String := "$"; Default_Fill : constant Wide_Character := '*'; Default_Separator : constant Wide_Character := ','; Default_Radix_Mark : constant Wide_Character := '.'; generic type Num is delta <> digits <>; Default_Currency : in String := Wide_Text_IO.Editing.Default_Currency; Default_Fill : in Wide_Character := Wide_Text_IO.Editing.Default_Fill; Default_Separator : in Wide_Character := Wide_Text_IO.Editing.Default_Separator; Default_Radix_Mark : in Wide_Character := Wide_Text_IO.Editing.Default_Radix_Mark; package Decimal_Output is function Length (Pic : in Picture; Currency : in Wide_String := Default_Currency) return Natural; function Valid (Item : in Num; Pic : in Picture; Currency : in Wide_String := Default_Currency) return Boolean; function Image (Item : in Num; Pic : in Picture; Currency : in Wide_String := Default_Currency; Fill : in Wide_Character := Default_Fill; Separator : in Wide_Character := Default_Separator; Radix_Mark : in Wide_Character := Default_Radix_Mark) return Wide_String; procedure Put (File : in File_Type; Item : in Num; Pic : in Picture; Currency : in Wide_String := Default_Currency; Fill : in Wide_Character := Default_Fill; Separator : in Wide_Character := Default_Separator; Radix_Mark : in Wide_Character := Default_Radix_Mark); procedure Put (Item : in Num; Pic : in Picture; Currency : in Wide_String := Default_Currency; Fill : in Wide_Character := Default_Fill; Separator : in Wide_Character := Default_Separator; Radix_Mark : in Wide_Character := Default_Radix_Mark); procedure Put (To : out Wide_String; Item : in Num; Pic : in Picture; Currency : in Wide_String := Default_Currency; Fill : in Wide_Character := Default_Fill; Separator : in Wide_Character := Default_Separator; Radix_Mark : in Wide_Character := Default_Radix_Mark); end Decimal_Output; private pragma Import (Ada, Picture); end Ada.Wide_Text_IO.Editing;

43.067416

75

0.555179

4b0eb24bba97941a32cc3078665ac2054b87f484

9,514

adb

Ada

3-mid/impact/source/3d/collision/dispatch/impact-d3-collision-detector-discrete-sphere_triangle.adb

charlie5/lace

e9b7dc751d500ff3f559617a6fc3089ace9dc134

[ "0BSD" ]

20

2015-11-04T09:23:59.000Z

2022-01-14T10:21:42.000Z

3-mid/impact/source/3d/collision/dispatch/impact-d3-collision-detector-discrete-sphere_triangle.adb

charlie5/lace

e9b7dc751d500ff3f559617a6fc3089ace9dc134

[ "0BSD" ]

2

2015-11-04T17:05:56.000Z

2015-12-08T03:16:13.000Z

3-mid/impact/source/3d/collision/dispatch/impact-d3-collision-detector-discrete-sphere_triangle.adb

charlie5/lace

e9b7dc751d500ff3f559617a6fc3089ace9dc134

[ "0BSD" ]

1

2015-12-07T12:53:52.000Z

with impact.d3.Transform; with impact.d3.Vector; with impact.d3.Scalar; package body impact.d3.collision.Detector.discrete.sphere_triangle is function to_sphere_triangle_Detector (sphere : access impact.d3.Shape.convex.internal.sphere .Item'Class; triangle : access impact.d3.Shape.convex.internal.polyhedral.triangle.Item'Class; contactBreakingThreshold : in math.Real ) return Item is Self : Item; begin Self.m_sphere := sphere; Self.m_triangle := triangle; Self.m_contactBreakingThreshold := contactBreakingThreshold; return Self; end to_sphere_triangle_Detector; overriding procedure getClosestPoints (Self : in out Item; input : in ClosestPointInput; output : in out Result'Class; swapResults : in Boolean := False) is use impact.d3.Transform, math.Vectors; use linear_Algebra_3d; transformA : Transform_3d renames input.m_transformA; transformB : Transform_3d renames input.m_transformB; point, normal : aliased math.Vector_3; timeOfImpact : aliased math.Real := 1.0; depth : aliased math.Real := 0.0; sphereInTr : Transform_3d; begin -- output.m_distance = impact.d3.Scalar(BT_LARGE_FLOAT); -- move sphere into triangle space -- sphereInTr := inverseTimes (transformB, transformA); if Self.collide (sphereInTr.Translation, point'Access, normal'Access, depth'Access, timeOfImpact'Access, Self.m_contactBreakingThreshold) then if swapResults then declare normalOnB : constant math.Vector_3 := transformB.Rotation * normal; normalOnA : constant math.Vector_3 := -normalOnB; pointOnA : constant math.Vector_3 := transformB * point + normalOnB*depth; begin output.addContactPoint (normalOnA, pointOnA, depth); end; else output.addContactPoint (transformB.Rotation * normal, transformB * point, depth); end if; end if; end getClosestPoints; -- See also geometrictools.com -- Basic idea: D = |p - (lo + t0*lv)| where t0 = lv . (p - lo) / lv . lv -- function SegmentSqrDistance (from, to, p : in math.Vector_3; nearest : access math.Vector_3) return math.Real is use impact.d3.Vector, math.Vectors; diff : math.Vector_3 := p - from; v : constant math.Vector_3 := to - from; t : math.Real := dot (v, diff); dotVV : math.Real; begin if t > 0.0 then dotVV := dot (v, v); if t < dotVV then t := t / dotVV; diff := diff - t*v; else t := 1.0; diff := diff - v; end if; else t := 0.0; end if; nearest.all := from + t*v; return dot (diff, diff); end SegmentSqrDistance; function collide (Self : in Item; sphereCenter : in math.Vector_3; point : access math.Vector_3; resultNormal : access math.Vector_3; depth : access math.Real; timeOfImpact : access math.Real; contactBreakingThreshold : in math.Real) return Boolean is pragma Unreferenced (timeOfImpact); use impact.d3.Scalar, impact.d3.Vector, math.Vectors; vertex_1 : math.Vector_3 renames Self.m_triangle.getVertexPtr (1).all; vertex_2 : math.Vector_3 renames Self.m_triangle.getVertexPtr (2).all; vertex_3 : math.Vector_3 renames Self.m_triangle.getVertexPtr (3).all; radius : math.Real := Self.m_sphere.getRadius; radiusWithThreshold : math.Real := radius + contactBreakingThreshold; normal : aliased math.Vector_3 := Normalized (cross (vertex_2 - vertex_1, vertex_3 - vertex_1)); p1ToCentre : constant math.Vector_3 := sphereCenter - vertex_1; distanceFromPlane : math.Real := dot (p1ToCentre, normal); isInsideContactPlane : Boolean := distanceFromPlane < radiusWithThreshold; hasContact : Boolean := False; contactPoint : math.Vector_3; begin if distanceFromPlane < 0.0 then -- triangle facing the other way distanceFromPlane := -distanceFromPlane; normal := -normal; end if; isInsideContactPlane := distanceFromPlane < radiusWithThreshold; -- Check for contact / intersection -- hasContact := False; if isInsideContactPlane then if Self.facecontains (sphereCenter, Vector_3_array (Self.m_triangle.m_vertices1), normal'Access) then -- Inside the contact wedge - touches a point on the shell plane hasContact := True; contactPoint := sphereCenter - normal * distanceFromPlane; else -- Could be inside one of the contact capsules declare contactCapsuleRadiusSqr : math.Real := radiusWithThreshold * radiusWithThreshold; nearestOnEdge : aliased math.Vector_3; begin for i in 1 .. Self.m_triangle.getNumEdges loop declare pa, pb : math.Vector_3; distanceSqr : math.Real; begin Self.m_triangle.getEdge (i, pa, pb); distanceSqr := SegmentSqrDistance (pa, pb, sphereCenter, nearestOnEdge'Access); if distanceSqr < contactCapsuleRadiusSqr then -- Yep, we're inside a capsule. hasContact := True; contactPoint := nearestOnEdge; end if; end; end loop; end; end if; end if; if hasContact then declare use math.Functions; contactToCentre : constant math.Vector_3 := sphereCenter - contactPoint; distanceSqr : constant math.Real := length2 (contactToCentre); distance : math.Real; begin if distanceSqr < radiusWithThreshold * radiusWithThreshold then if distanceSqr > SIMD_EPSILON then distance := sqRt (distanceSqr); resultNormal.all := contactToCentre; normalize (resultNormal.all); point.all := contactPoint; depth.all := -(radius - distance); else distance := 0.0; resultNormal.all := normal; point.all := contactPoint; depth.all := -radius; end if; return True; end if; end; end if; return False; end collide; function pointInTriangle (Self : in Item; vertices : in Vector_3_array; normal : in math.Vector_3; p : access math.Vector_3) return Boolean is pragma Unreferenced (Self); use impact.d3.Vector, math.Vectors; p1 : math.Vector_3 renames vertices (1); p2 : math.Vector_3 renames vertices (2); p3 : math.Vector_3 renames vertices (3); edge1 : constant math.Vector_3 := p2 - p1; edge2 : constant math.Vector_3 := p3 - p2; edge3 : constant math.Vector_3 := p1 - p3; p1_to_p : constant math.Vector_3 := p.all - p1; p2_to_p : constant math.Vector_3 := p.all - p2; p3_to_p : constant math.Vector_3 := p.all - p3; edge1_normal : constant math.Vector_3 := cross (edge1, normal); edge2_normal : constant math.Vector_3 := cross (edge2, normal); edge3_normal : constant math.Vector_3 := cross (edge3, normal); r1, r2, r3 : math.Real; begin r1 := dot (edge1_normal, p1_to_p); r2 := dot (edge2_normal, p2_to_p); r3 := dot (edge3_normal, p3_to_p); return (r1 > 0.0 and then r2 > 0.0 and then r3 > 0.0) or else (r1 <= 0.0 and then r2 <= 0.0 and then r3 <= 0.0); end pointInTriangle; function facecontains (Self : in Item; p : in math.Vector_3; vertices : in Vector_3_array; normal : access math.Vector_3) return Boolean is lp : aliased math.Vector_3 := p; lnormal : constant math.Vector_3 := normal.all; begin return Self.pointInTriangle (vertices, lnormal, lp'Access); end facecontains; end impact.d3.collision.Detector.discrete.sphere_triangle;

32.694158

177

0.525541

38d6585ffa8025f438e576f957a556ec4af77f0c

3,455

adb

Ada

src/natools-s_expressions-file_writers.adb

faelys/natools

947c004e6f69ca144942c6af40e102d089223cf8

[ "0BSD" ]

null

src/natools-s_expressions-file_writers.adb

faelys/natools

947c004e6f69ca144942c6af40e102d089223cf8

[ "0BSD" ]

null

src/natools-s_expressions-file_writers.adb

faelys/natools

947c004e6f69ca144942c6af40e102d089223cf8

[ "0BSD" ]

null

------------------------------------------------------------------------------ -- Copyright (c) 2014-2017, Natacha Porté -- -- -- -- Permission to use, copy, modify, and distribute this software for any -- -- purpose with or without fee is hereby granted, provided that the above -- -- copyright notice and this permission notice appear in all copies. -- -- -- -- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES -- -- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF -- -- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR -- -- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES -- -- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN -- -- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF -- -- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. -- ------------------------------------------------------------------------------ package body Natools.S_Expressions.File_Writers is package Stream_IO renames Ada.Streams.Stream_IO; overriding procedure Finalize (Object : in out Autoclose) is begin if Stream_IO.Is_Open (Object.File) then Stream_IO.Close (Object.File); end if; end Finalize; ------------------------- -- S-Expression Writer -- ------------------------- overriding procedure Write_Raw (Output : in out Writer; Data : in Ada.Streams.Stream_Element_Array) is begin Stream_IO.Write (Output.Holder.File, Data); end Write_Raw; function Create (Name : String; Form : String := "") return Writer is begin return Result : Writer do Create (Result, Name, Form); end return; end Create; function Open (Name : String; Form : String := "") return Writer is begin return Result : Writer do Open (Result, Name, Form); end return; end Open; procedure Create (Self : in out Writer; Name : in String; Form : in String := "") is begin Finalize (Self.Holder); Stream_IO.Create (Self.Holder.File, Stream_IO.Append_File, Name, Form); end Create; procedure Open (Self : in out Writer; Name : in String; Form : in String := "") is begin Finalize (Self.Holder); Stream_IO.Open (Self.Holder.File, Stream_IO.Append_File, Name, Form); end Open; function Open_Or_Create (Name : String; Form : String := "") return Writer is begin return Result : Writer do Open_Or_Create (Result, Name, Form); end return; end Open_Or_Create; procedure Open_Or_Create (Self : in out Writer; Name : in String; Form : in String := "") is begin Finalize (Self.Holder); Open_Attempt : begin Stream_IO.Open (Self.Holder.File, Stream_IO.Append_File, Name, Form); return; exception when Stream_IO.Name_Error => null; end Open_Attempt; Stream_IO.Create (Self.Holder.File, Stream_IO.Append_File, Name, Form); end Open_Or_Create; function Name (Self : Writer) return String is begin return Stream_IO.Name (Self.Holder.File); end Name; end Natools.S_Expressions.File_Writers;

30.848214

78

0.579161

384c9a0704163418490fdc141a114c98474f0e43

3,842

ads

Ada

llvm-gcc-4.2-2.9/gcc/ada/s-traent.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

llvm-gcc-4.2-2.9/gcc/ada/s-traent.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

llvm-gcc-4.2-2.9/gcc/ada/s-traent.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . T R A C E B A C K _ E N T R I E S -- -- -- -- S p e c -- -- -- -- Copyright (C) 2003-2005 Free Software Foundation, Inc. -- -- -- -- This specification is derived from the Ada Reference Manual for use with -- -- GNAT. The copyright notice above, and the license provisions that follow -- -- apply solely to the contents of the part following the private keyword. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package offers an abstraction of what is stored in traceback arrays -- for call-chain computation purposes. By default, as defined in this -- version of the package, an entry is a mere code location representing the -- address of a call instruction part of the call-chain. package System.Traceback_Entries is pragma Preelaborate; subtype Traceback_Entry is System.Address; -- This subtype defines what each traceback array entry contains Null_TB_Entry : constant Traceback_Entry := System.Null_Address; -- This is the value to be used when initializing an entry function PC_For (TB_Entry : Traceback_Entry) return System.Address; pragma Inline (PC_For); -- Returns the address of the call instruction associated with the -- provided entry. function TB_Entry_For (PC : System.Address) return Traceback_Entry; pragma Inline (TB_Entry_For); -- Returns an entry representing a frame for a call instruction at PC end System.Traceback_Entries;

61.967742

78

0.515617

03bbb2d0fec33bd1a2e7c9c8d55a816418447095

508

ads

Ada

tests/messages-test_data-tests-messages_container-test_data-tests.ads

thindil/steamsky

d5d7fea622f7994c91017c4cd7ba5e188153556c

[ "TCL", "MIT" ]

80

2017-04-08T23:14:07.000Z

2022-02-10T22:30:51.000Z

tests/messages-test_data-tests-messages_container-test_data-tests.ads

thindil/steamsky

d5d7fea622f7994c91017c4cd7ba5e188153556c

[ "TCL", "MIT" ]

89

2017-06-24T08:18:26.000Z

2021-11-12T04:37:36.000Z

tests/messages-test_data-tests-messages_container-test_data-tests.ads

thindil/steamsky

d5d7fea622f7994c91017c4cd7ba5e188153556c

[ "TCL", "MIT" ]

9

2018-04-14T16:37:25.000Z

2020-03-21T14:33:49.000Z

-- This package has been generated automatically by GNATtest. -- Do not edit any part of it, see GNATtest documentation for more details. -- begin read only with Gnattest_Generated; package Messages.Test_Data.Tests.Messages_Container.Test_Data.Tests is type Test is new GNATtest_Generated.GNATtest_Standard.Messages.Test_Data .Tests .Messages_Container .Test_Data .New_Test with null record; end Messages.Test_Data.Tests.Messages_Container.Test_Data.Tests; -- end read only

28.222222

76

0.773622

8b662e0ac489907a1813e3a731b829f9be6f2968

313

ads

Ada

examples/platformer/src/geste_config.ads

Fabien-Chouteau/GESTE

5ac814906fdb49d880db60cbb17279cbbb777336

[ "BSD-3-Clause" ]

13

2018-07-31T12:11:46.000Z

2021-11-19T14:16:46.000Z

examples/platformer/src/geste_config.ads

gregkrsak/GESTE

5ac814906fdb49d880db60cbb17279cbbb777336

[ "BSD-3-Clause" ]

1

2018-10-22T21:41:59.000Z

examples/platformer/src/geste_config.ads

gregkrsak/GESTE

5ac814906fdb49d880db60cbb17279cbbb777336

[ "BSD-3-Clause" ]

4

2020-07-03T10:03:13.000Z

2022-02-10T03:35:07.000Z

with Interfaces; package GESTE_Config is type Color_Index is range 0 .. 20; subtype Output_Color is Interfaces.Unsigned_16; Transparent : constant Output_Color := 391; Tile_Size : constant := 16; type Tile_Index is range 0 .. 122; No_Tile : constant Tile_Index := 0; end GESTE_Config;

19.5625

50

0.70607

8bacbc9b04fbae6da8c4244f849e2cb0434d5eb1

433

ads

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/aggr16_pkg.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/aggr16_pkg.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/aggr16_pkg.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

package Aggr16_Pkg is type Time_Type is (A, B); type Time (D : Time_Type := A) is private; Null_Time : constant Time; private type Hour is record I1 : Integer; I2 : Integer; end record; type Time (D : Time_Type := A) is record case D is when A => A_Time : Integer; when B => B_Time : Hour; end case; end record; Null_Time : constant Time := (A, 0); end Aggr16_Pkg;

15.464286

44

0.586605

22ed2a8d7fdba251dc95a0107e5b37420efbf48e

1,641

ads

Ada

tier-1/xcb/source/thin/xcb-xcb_get_keyboard_mapping_request_t.ads

charlie5/cBound

741be08197a61ad9c72553e3302f3b669902216d

[ "0BSD" ]

2

2015-11-12T11:16:20.000Z

2021-08-24T22:32:04.000Z

tier-1/xcb/source/thin/xcb-xcb_get_keyboard_mapping_request_t.ads

charlie5/cBound

741be08197a61ad9c72553e3302f3b669902216d

[ "0BSD" ]

1

2018-06-05T05:19:35.000Z

2021-11-20T01:13:23.000Z

tier-1/xcb/source/thin/xcb-xcb_get_keyboard_mapping_request_t.ads

charlie5/cBound

741be08197a61ad9c72553e3302f3b669902216d

[ "0BSD" ]

null

-- This file is generated by SWIG. Please do not modify by hand. -- with Interfaces; with Interfaces.C; with Interfaces.C.Pointers; package xcb.xcb_get_keyboard_mapping_request_t is -- Item -- type Item is record major_opcode : aliased Interfaces.Unsigned_8; pad0 : aliased Interfaces.Unsigned_8; length : aliased Interfaces.Unsigned_16; first_keycode : aliased xcb.xcb_keycode_t; count : aliased Interfaces.Unsigned_8; end record; -- Item_Array -- type Item_Array is array (Interfaces.C .size_t range <>) of aliased xcb.xcb_get_keyboard_mapping_request_t .Item; -- Pointer -- package C_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_get_keyboard_mapping_request_t.Item, Element_Array => xcb.xcb_get_keyboard_mapping_request_t.Item_Array, Default_Terminator => (others => <>)); subtype Pointer is C_Pointers.Pointer; -- Pointer_Array -- type Pointer_Array is array (Interfaces.C .size_t range <>) of aliased xcb.xcb_get_keyboard_mapping_request_t .Pointer; -- Pointer_Pointer -- package C_Pointer_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_get_keyboard_mapping_request_t.Pointer, Element_Array => xcb.xcb_get_keyboard_mapping_request_t.Pointer_Array, Default_Terminator => null); subtype Pointer_Pointer is C_Pointer_Pointers.Pointer; end xcb.xcb_get_keyboard_mapping_request_t;

28.789474

78

0.675198

380d2fbfb54da843c4ce106e185e228371ede6f7

2,844

ads

Ada

bb-runtimes/arm/sam/samg55/s-bbmcpa.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/arm/sam/samg55/s-bbmcpa.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/arm/sam/samg55/s-bbmcpa.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- S Y S T E M . B B . M C U _ P A R A M E T E R S -- -- -- -- S p e c -- -- -- -- Copyright (C) 2016, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- -- The port of GNARL to bare board targets was initially developed by the -- -- Real-Time Systems Group at the Technical University of Madrid. -- -- -- ------------------------------------------------------------------------------ -- This package defines MCU parameters for the SAMG55 family package System.BB.MCU_Parameters is pragma Preelaborate; Number_Of_Interrupts : constant := 92; Has_FPU : constant Boolean := True; end System.BB.MCU_Parameters;

64.636364

78

0.405063

030d32a40db72c61686760a65d38d67a8099bd8e

6,365

ads

Ada

src/keystore-keys.ads

thierr26/ada-keystore

25099a9df3ce9b48a401148eb1b84442011759a0

[ "Apache-2.0" ]

null

src/keystore-keys.ads

thierr26/ada-keystore

25099a9df3ce9b48a401148eb1b84442011759a0

[ "Apache-2.0" ]

null

src/keystore-keys.ads

thierr26/ada-keystore

25099a9df3ce9b48a401148eb1b84442011759a0

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- keystore-keys -- Keystore key management -- Copyright (C) 2019 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Interfaces; with Util.Encoders.AES; with Keystore.IO; with Keystore.Random; with Keystore.Passwords.Keys; with Keystore.Marshallers; private package Keystore.Keys is use type IO.Block_Index; type Cryptor is limited record Cipher : Util.Encoders.AES.Encoder; Decipher : Util.Encoders.AES.Decoder; Key : Secret_Key (Length => 32); IV : Secret_Key (Length => 16); Sign : Secret_Key (Length => 32); end record; -- Set the IV vector to be used for the encryption and decryption of the given block number. procedure Set_IV (Into : in out Cryptor; Block : in IO.Block_Number); procedure Set_Key (Into : in out Cryptor; From : in Cryptor); type Wallet_Config is limited record UUID : UUID_Type; Keys : Key_Slot_Allocation := (others => False); Slot : Key_Slot; Data : Cryptor; Dir : Cryptor; Key : Cryptor; Max_Counter : Interfaces.Unsigned_32 := 300_000; Min_Counter : Interfaces.Unsigned_32 := 100_000; Randomize : Boolean := True; end record; type Key_Manager is limited private; -- Open the key manager and read the wallet header block. Use the secret key -- to decrypt/encrypt the wallet header block. procedure Open (Manager : in out Key_Manager; Password : in out Keystore.Passwords.Provider'Class; Ident : in Wallet_Identifier; Block : in Keystore.IO.Storage_Block; Root : out Keystore.IO.Storage_Block; Config : in out Wallet_Config; Process : access procedure (Buffer : in out Marshallers.Marshaller; Slot : in Key_Slot); Stream : in out IO.Wallet_Stream'Class); -- Create the wallet key block. procedure Create (Manager : in out Key_Manager; Password : in out Passwords.Provider'Class; Slot : in Key_Slot; Ident : in Wallet_Identifier; Block : in Keystore.IO.Storage_Block; Root : in Keystore.IO.Storage_Block; Config : in out Wallet_Config; Stream : in out IO.Wallet_Stream'Class); -- Set a new key procedure Set_Key (Manager : in out Key_Manager; Password : in out Keystore.Passwords.Provider'Class; New_Password : in out Keystore.Passwords.Provider'Class; Config : in Keystore.Wallet_Config; Mode : in Mode_Type; Ident : in Wallet_Identifier; Block : in Keystore.IO.Storage_Block; Stream : in out IO.Wallet_Stream'Class); -- Remove the key from the key slot identified by `Slot`. The password is necessary to -- make sure a valid password is available. The `Remove_Current` must be set to remove -- the slot when it corresponds to the used password. procedure Remove_Key (Manager : in out Key_Manager; Password : in out Keystore.Passwords.Provider'Class; Slot : in Key_Slot; Remove_Current : in Boolean; Ident : in Wallet_Identifier; Block : in Keystore.IO.Storage_Block; Stream : in out IO.Wallet_Stream'Class); -- Create a new masker keys for a children wallet and save the new keys in the buffer. procedure Create_Master_Key (Manager : in out Key_Manager; Buffer : in out Marshallers.Marshaller; Crypt : in Cryptor); -- Extract from the buffer the master keys to open the children wallet. procedure Load_Master_Key (Manager : in out Key_Manager; Buffer : in out Marshallers.Marshaller; Crypt : in Cryptor); -- Set the master key by using the password provider. procedure Set_Master_Key (Manager : in out Key_Manager; Password : in out Keystore.Passwords.Keys.Key_Provider'Class); private -- Size of a key slot. WH_SLOT_SIZE : constant := 512; -- Wallet header magic. WH_MAGIC : constant := 16#Ada00Ada#; WH_KEY_SIZE : constant := Util.Encoders.AES.AES_256_Length; WH_HEADER_START : constant IO.Block_Index := IO.BT_DATA_START; WH_HEADER_LENGTH : constant := 16 + 16 + 8; WH_KEY_LIST_START : constant IO.Block_Index := WH_HEADER_START + WH_HEADER_LENGTH + 1; -- Key slot type is using PBKDF2-HMAC-256. WH_KEY_PBKDF2 : constant := 16#0001#; -- Key slot type is using PBKDF2-HMAC-256 with a GPG2 key. WH_KEY_GPG2 : constant := 16#0002#; type Key_Manager is limited record Id : Wallet_Identifier; Parent_Id : Wallet_Identifier; Header_Block : Keystore.IO.Storage_Block; Random : Keystore.Random.Generator; Crypt : Cryptor; end record; function Key_Position (Slot : in Key_Slot) return IO.Block_Index is (WH_KEY_LIST_START + IO.Block_Index (Slot) * WH_SLOT_SIZE - WH_SLOT_SIZE - 1); end Keystore.Keys;

43.59589

96

0.580361

036cb8c1f3332efe2b8f5e957e90b9889d9b3e89

2,609

ads

Ada

tools/scitools/conf/understand/ada/ada05/s-pack43.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

1

2020-01-20T21:26:46.000Z

tools/scitools/conf/understand/ada/ada05/s-pack43.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

tools/scitools/conf/understand/ada/ada05/s-pack43.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . P A C K _ 4 3 -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2005, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- -- -- -- -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- Handling of packed arrays with Component_Size = 43 package System.Pack_43 is pragma Preelaborate; Bits : constant := 43; type Bits_43 is mod 2 ** Bits; for Bits_43'Size use Bits; function Get_43 (Arr : System.Address; N : Natural) return Bits_43; -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is extracted and returned. procedure Set_43 (Arr : System.Address; N : Natural; E : Bits_43); -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is set to the given value. end System.Pack_43;

49.226415

78

0.439632

8bb57b49dcd4841ac106b9a498cc5e58c2fd1af3

281

adb

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/lto4.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/lto4.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/lto4.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- { dg-do compile } -- { dg-options "-flto" { target lto } } package body Lto4 is procedure SS_Allocate (Stack : Stack_Ptr) is Chunk : Chunk_Ptr := Stack.Current_Chunk; begin Chunk := new Chunk_Id (First => Chunk.Last, Last => Chunk.Last); end; end Lto4;

21.615385

71

0.626335

036fa0ce70b9312c577b05b6dab9937f53a88c36

4,438

adb

Ada

1-base/xml/source/xml-writer.adb

charlie5/lace

e9b7dc751d500ff3f559617a6fc3089ace9dc134

[ "0BSD" ]

20

2015-11-04T09:23:59.000Z

2022-01-14T10:21:42.000Z

1-base/xml/source/xml-writer.adb

charlie5/lace-alire

9ace9682cf4daac7adb9f980c2868d6225b8111c

[ "0BSD" ]

2

2015-11-04T17:05:56.000Z

2015-12-08T03:16:13.000Z

1-base/xml/source/xml-writer.adb

charlie5/lace-alire

9ace9682cf4daac7adb9f980c2868d6225b8111c

[ "0BSD" ]

1

2015-12-07T12:53:52.000Z

with ada.unchecked_Deallocation; package body XML.Writer is Depth: Natural; procedure Free is new ada.Unchecked_Deallocation (Attributes_t, Attributes_view); procedure Start_Document (F: in ada.Text_IO.File_Type) is begin ada.Text_IO.Put_Line (F, "<?xml version=""1.0"" standalone=""yes""?>"); Depth := 0; end Start_Document; procedure End_Document (F: in ada.Text_IO.File_Type) is begin null; end End_Document; procedure Start (F: in ada.Text_IO.File_Type; Name: in String; Atts: in Attributes_view) is begin for Pad in 1 .. Depth loop ada.Text_IO.Put (F, " "); end loop; Depth := Depth + 1; ada.Text_IO.Put (F, "<" & Name); for Att in Atts'Range loop ada.Text_IO.Put (F, " " & to_String (Atts (Att).Name) & "=""" & to_String (Atts (Att).Value) & """"); end loop; ada.Text_IO.Put_Line (F, ">"); end Start; procedure Start (F: in ada.Text_IO.File_Type; Name: in unbounded_String; Atts: in Attributes_view) is begin Start (F, to_String (Name), Atts); end Start; procedure Finish (F: in ada.Text_IO.File_Type; Name: in String) is begin Depth := Depth - 1; for Pad in 1 .. Depth loop ada.Text_IO.Put (F, " "); end loop; ada.Text_IO.Put_Line (F, "</" & Name & ">"); end Finish; procedure Finish (F: in ada.Text_IO.File_Type; Name: in unbounded_String) is begin Finish (F, to_String (Name)); end Finish; procedure Empty (F: in ada.Text_IO.File_Type; Name: in String; Atts: in Attributes_view) is begin for Pad in 1 .. Depth loop ada.Text_IO.Put (F, " "); end loop; ada.Text_IO.Put (F, "<" & Name); for Att in Atts'Range loop ada.Text_IO.Put (F, " " & to_String (Atts (Att).Name) & "=""" & to_String (Atts (Att).Value) & """"); end loop; ada.Text_IO.Put_Line (F, "/>"); end Empty; procedure Empty (F: in ada.Text_IO.File_Type; Name: in unbounded_String; Atts: in Attributes_view) is begin Empty (F, to_String (Name), Atts); end Empty; function "+" (K, V: in String) return Attribute_t is begin return Attribute_t'(to_unbounded_String (K), to_unbounded_String (V)); end "+"; function "+" (K, V: in String) return Attributes_view is begin return new Attributes_t'(1 => Attribute_t'(to_unbounded_String (K), to_unbounded_String (V))); end "+"; function "+" (K: in unbounded_String; V: in String) return Attribute_t is begin return Attribute_t'(K, to_unbounded_String (V)); end "+"; function "+" (K: in unbounded_String; V: in String) return Attributes_view is begin return new Attributes_t'(1 => Attribute_t' (K, to_unbounded_String (V))); end "+"; function "+" (K: in String; V: in unbounded_String) return Attribute_t is begin return Attribute_t'(to_unbounded_String (K), V); end "+"; function "+" (K: in String; V: in unbounded_String) return Attributes_view is begin return new Attributes_t'(1 => Attribute_t'(to_unbounded_String (K), V)); end "+"; function MkAtt (L, R: in Attribute_t) return Attributes_view is begin return new Attributes_t'(L, R); end MkAtt; function "&" (L, R: in Attribute_t) return Attributes_view is begin return new Attributes_t'(L, R); end "&"; function "&" (L: in Attributes_view; R: in Attribute_t) return Attributes_view is Result: Attributes_view; ByeBye: Attributes_view; begin Result := new Attributes_t (1 .. L'Length + 1); Result (1 .. L'Length) := L.all; Result (L'Length + 1) := R; ByeBye := L; Free (ByeBye); return Result; end "&"; end XML.Writer;

20.835681

85

0.525913

a0b23072c2ed9e6f872273ffc2767491a3d86ce8

372,284

adb

Ada

experiment_log/sigma_core/HLS/sigma_example/solution1/.autopilot/db/doGain.adb

KukyNekoi/fpga_index_accelerator

0026e0deb31c556cc3770ed2be64eae93257949f

[ "MIT" ]

1

2018-07-12T09:43:05.000Z

experiment_log/sigma_core/HLS/sigma_example/solution1/.autopilot/db/doGain.adb

honorpeter/fpga_index_accelerator

c09d222d3ad55d6bb354dee8aff97a4f519df89d

[ "MIT" ]

null

experiment_log/sigma_core/HLS/sigma_example/solution1/.autopilot/db/doGain.adb

honorpeter/fpga_index_accelerator

c09d222d3ad55d6bb354dee8aff97a4f519df89d

[ "MIT" ]

1

2019-04-09T02:38:27.000Z

<?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="11"> <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>doGain</name> <ret_bitwidth>0</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>14</count> <item_version>0</item_version> <item class_id="3" tracking_level="1" version="0" object_id="_1"> <Value class_id="4" tracking_level="0" version="0"> <Obj class_id="5" tracking_level="0" version="0"> <type>1</type> <id>1</id> <name>inStream_V_data_V</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>inStream.V.data.V</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> <item class_id_reference="3" object_id="_2"> <Value> <Obj> <type>1</type> <id>2</id> <name>inStream_V_keep_V</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>inStream.V.keep.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>4</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_3"> <Value> <Obj> <type>1</type> <id>3</id> <name>inStream_V_strb_V</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>inStream.V.strb.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>4</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_4"> <Value> <Obj> <type>1</type> <id>4</id> <name>inStream_V_user_V</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>inStream.V.user.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>2</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_5"> <Value> <Obj> <type>1</type> <id>5</id> <name>inStream_V_last_V</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>inStream.V.last.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_6"> <Value> <Obj> <type>1</type> <id>6</id> <name>inStream_V_id_V</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>inStream.V.id.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>5</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_7"> <Value> <Obj> <type>1</type> <id>7</id> <name>inStream_V_dest_V</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>inStream.V.dest.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>6</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_8"> <Value> <Obj> <type>1</type> <id>8</id> <name>outStream_V_data_V</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>outStream.V.data.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <direction>1</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_9"> <Value> <Obj> <type>1</type> <id>9</id> <name>outStream_V_keep_V</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>outStream.V.keep.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>4</bitwidth> </Value> <direction>1</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_10"> <Value> <Obj> <type>1</type> <id>10</id> <name>outStream_V_strb_V</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>outStream.V.strb.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>4</bitwidth> </Value> <direction>1</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_11"> <Value> <Obj> <type>1</type> <id>11</id> <name>outStream_V_user_V</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>outStream.V.user.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>2</bitwidth> </Value> <direction>1</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_12"> <Value> <Obj> <type>1</type> <id>12</id> <name>outStream_V_last_V</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>outStream.V.last.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <direction>1</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_13"> <Value> <Obj> <type>1</type> <id>13</id> <name>outStream_V_id_V</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>outStream.V.id.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>5</bitwidth> </Value> <direction>1</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_14"> <Value> <Obj> <type>1</type> <id>14</id> <name>outStream_V_dest_V</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>outStream.V.dest.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>6</bitwidth> </Value> <direction>1</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> </ports> <nodes class_id="8" tracking_level="0" version="0"> <count>99</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_15"> <Value> <Obj> <type>0</type> <id>30</id> <name>valIn_data_V</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>16</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="10" tracking_level="0" version="0"> <first>/home/jvarred/Desktop/HLS</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>main.cpp</first> <second>doGain</second> </first> <second>16</second> </item> </second> </item> </inlineStackInfo> <originalName>valIn.data.V</originalName> <rtlName>valIn_data_V_U</rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>173</item> </oprand_edges> <opcode>alloca</opcode> </item> <item class_id_reference="9" object_id="_16"> <Value> <Obj> <type>0</type> <id>31</id> <name>valIn_keep_V</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>16</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>16</second> </item> </second> </item> </inlineStackInfo> <originalName>valIn.keep.V</originalName> <rtlName>valIn_keep_V_U</rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>174</item> </oprand_edges> <opcode>alloca</opcode> </item> <item class_id_reference="9" object_id="_17"> <Value> <Obj> <type>0</type> <id>32</id> <name>valIn_strb_V</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>16</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>16</second> </item> </second> </item> </inlineStackInfo> <originalName>valIn.strb.V</originalName> <rtlName>valIn_strb_V_U</rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>175</item> </oprand_edges> <opcode>alloca</opcode> </item> <item class_id_reference="9" object_id="_18"> <Value> <Obj> <type>0</type> <id>33</id> <name>valIn_user_V</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>16</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>16</second> </item> </second> </item> </inlineStackInfo> <originalName>valIn.user.V</originalName> <rtlName>valIn_user_V_U</rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>176</item> </oprand_edges> <opcode>alloca</opcode> </item> <item class_id_reference="9" object_id="_19"> <Value> <Obj> <type>0</type> <id>34</id> <name>valIn_last_V</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>16</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>16</second> </item> </second> </item> </inlineStackInfo> <originalName>valIn.last.V</originalName> <rtlName>valIn_last_V_U</rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>177</item> </oprand_edges> <opcode>alloca</opcode> </item> <item class_id_reference="9" object_id="_20"> <Value> <Obj> <type>0</type> <id>35</id> <name>valIn_id_V</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>16</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>16</second> </item> </second> </item> </inlineStackInfo> <originalName>valIn.id.V</originalName> <rtlName>valIn_id_V_U</rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>5</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>178</item> </oprand_edges> <opcode>alloca</opcode> </item> <item class_id_reference="9" object_id="_21"> <Value> <Obj> <type>0</type> <id>36</id> <name>valIn_dest_V</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>16</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>16</second> </item> </second> </item> </inlineStackInfo> <originalName>valIn.dest.V</originalName> <rtlName>valIn_dest_V_U</rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>6</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>179</item> </oprand_edges> <opcode>alloca</opcode> </item> <item class_id_reference="9" object_id="_22"> <Value> <Obj> <type>0</type> <id>39</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>19</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>19</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>180</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_23"> <Value> <Obj> <type>0</type> <id>41</id> <name>idx</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>idx</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>181</item> <item>182</item> <item>184</item> <item>185</item> </oprand_edges> <opcode>phi</opcode> </item> <item class_id_reference="9" object_id="_24"> <Value> <Obj> <type>0</type> <id>42</id> <name>exitcond1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>19</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>19</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>exitcond1_fu_385_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>186</item> <item>188</item> </oprand_edges> <opcode>icmp</opcode> </item> <item class_id_reference="9" object_id="_25"> <Value> <Obj> <type>0</type> <id>43</id> <name>idx_1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>19</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>19</second> </item> </second> </item> </inlineStackInfo> <originalName>idx</originalName> <rtlName>idx_1_fu_391_p2</rtlName> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>189</item> <item>191</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_26"> <Value> <Obj> <type>0</type> <id>44</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>19</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>19</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>192</item> <item>193</item> <item>194</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_27"> <Value> <Obj> <type>0</type> <id>49</id> <name>tmp</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>22</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_fu_397_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>195</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_28"> <Value> <Obj> <type>0</type> <id>50</id> <name>empty_3</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>22</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>54</bitwidth> </Value> <oprand_edges> <count>8</count> <item_version>0</item_version> <item>197</item> <item>198</item> <item>199</item> <item>200</item> <item>201</item> <item>202</item> <item>203</item> <item>204</item> </oprand_edges> <opcode>read</opcode> </item> <item class_id_reference="9" object_id="_29"> <Value> <Obj> <type>0</type> <id>51</id> <name>tmp_data_V</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>22</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>205</item> </oprand_edges> <opcode>extractvalue</opcode> </item> <item class_id_reference="9" object_id="_30"> <Value> <Obj> <type>0</type> <id>52</id> <name>tmp_keep_V</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>22</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.keep.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>206</item> </oprand_edges> <opcode>extractvalue</opcode> </item> <item class_id_reference="9" object_id="_31"> <Value> <Obj> <type>0</type> <id>53</id> <name>tmp_strb_V</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>22</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.strb.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>207</item> </oprand_edges> <opcode>extractvalue</opcode> </item> <item class_id_reference="9" object_id="_32"> <Value> <Obj> <type>0</type> <id>54</id> <name>tmp_user_V</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>22</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.user.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>208</item> </oprand_edges> <opcode>extractvalue</opcode> </item> <item class_id_reference="9" object_id="_33"> <Value> <Obj> <type>0</type> <id>55</id> <name>tmp_last_V</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>22</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.last.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>209</item> </oprand_edges> <opcode>extractvalue</opcode> </item> <item class_id_reference="9" object_id="_34"> <Value> <Obj> <type>0</type> <id>56</id> <name>tmp_id_V</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>22</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.id.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>5</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>210</item> </oprand_edges> <opcode>extractvalue</opcode> </item> <item class_id_reference="9" object_id="_35"> <Value> <Obj> <type>0</type> <id>57</id> <name>tmp_dest_V</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>22</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.dest.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>6</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>211</item> </oprand_edges> <opcode>extractvalue</opcode> </item> <item class_id_reference="9" object_id="_36"> <Value> <Obj> <type>0</type> <id>58</id> <name>valIn_data_V_addr</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>22</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>212</item> <item>214</item> <item>215</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_37"> <Value> <Obj> <type>0</type> <id>59</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>22</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>216</item> <item>217</item> </oprand_edges> <opcode>store</opcode> </item> <item class_id_reference="9" object_id="_38"> <Value> <Obj> <type>0</type> <id>60</id> <name>valIn_keep_V_addr</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>22</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>218</item> <item>219</item> <item>220</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_39"> <Value> <Obj> <type>0</type> <id>61</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>22</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>221</item> <item>222</item> </oprand_edges> <opcode>store</opcode> </item> <item class_id_reference="9" object_id="_40"> <Value> <Obj> <type>0</type> <id>62</id> <name>valIn_strb_V_addr</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>22</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>223</item> <item>224</item> <item>225</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_41"> <Value> <Obj> <type>0</type> <id>63</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>22</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>226</item> <item>227</item> </oprand_edges> <opcode>store</opcode> </item> <item class_id_reference="9" object_id="_42"> <Value> <Obj> <type>0</type> <id>64</id> <name>valIn_user_V_addr</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>22</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>228</item> <item>229</item> <item>230</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_43"> <Value> <Obj> <type>0</type> <id>65</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>22</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>231</item> <item>232</item> </oprand_edges> <opcode>store</opcode> </item> <item class_id_reference="9" object_id="_44"> <Value> <Obj> <type>0</type> <id>66</id> <name>valIn_last_V_addr</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>22</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>233</item> <item>234</item> <item>235</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_45"> <Value> <Obj> <type>0</type> <id>67</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>22</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>236</item> <item>237</item> </oprand_edges> <opcode>store</opcode> </item> <item class_id_reference="9" object_id="_46"> <Value> <Obj> <type>0</type> <id>68</id> <name>valIn_id_V_addr</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>22</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>238</item> <item>239</item> <item>240</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_47"> <Value> <Obj> <type>0</type> <id>69</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>22</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>241</item> <item>242</item> </oprand_edges> <opcode>store</opcode> </item> <item class_id_reference="9" object_id="_48"> <Value> <Obj> <type>0</type> <id>70</id> <name>valIn_dest_V_addr</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>22</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>243</item> <item>244</item> <item>245</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_49"> <Value> <Obj> <type>0</type> <id>71</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>22</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>246</item> <item>247</item> </oprand_edges> <opcode>store</opcode> </item> <item class_id_reference="9" object_id="_50"> <Value> <Obj> <type>0</type> <id>73</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>19</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>19</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>248</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_51"> <Value> <Obj> <type>0</type> <id>75</id> <name>stage1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>27</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>27</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>249</item> <item>250</item> <item>251</item> <item>252</item> </oprand_edges> <opcode>phi</opcode> </item> <item class_id_reference="9" object_id="_52"> <Value> <Obj> <type>0</type> <id>76</id> <name>exitcond2</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>27</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>27</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>exitcond2_fu_443_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>253</item> <item>254</item> </oprand_edges> <opcode>icmp</opcode> </item> <item class_id_reference="9" object_id="_53"> <Value> <Obj> <type>0</type> <id>77</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>27</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>27</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>255</item> <item>256</item> <item>257</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_54"> <Value> <Obj> <type>0</type> <id>81</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>43</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>43</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>295</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_55"> <Value> <Obj> <type>0</type> <id>83</id> <name>i_1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>43</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>43</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>259</item> <item>260</item> <item>261</item> <item>262</item> </oprand_edges> <opcode>phi</opcode> </item> <item class_id_reference="9" object_id="_56"> <Value> <Obj> <type>0</type> <id>84</id> <name>tmp_8</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>43</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>43</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_8_fu_449_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>263</item> <item>264</item> </oprand_edges> <opcode>icmp</opcode> </item> <item class_id_reference="9" object_id="_57"> <Value> <Obj> <type>0</type> <id>85</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>43</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>43</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>265</item> <item>266</item> <item>267</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_58"> <Value> <Obj> <type>0</type> <id>91</id> <name>tmp_s</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>46</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>46</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_s_fu_455_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>272</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_59"> <Value> <Obj> <type>0</type> <id>92</id> <name>tmp_10</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>46</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>46</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_10_fu_460_p2</rtlName> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>273</item> <item>275</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_60"> <Value> <Obj> <type>0</type> <id>93</id> <name>tmp_11</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>46</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>46</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_11_fu_466_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>276</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_61"> <Value> <Obj> <type>0</type> <id>94</id> <name>valIn_data_V_addr_2</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>46</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>46</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>277</item> <item>278</item> <item>279</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_62"> <Value> <Obj> <type>0</type> <id>95</id> <name>valIn_data_V_load</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>46</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>46</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>280</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_63"> <Value> <Obj> <type>0</type> <id>96</id> <name>valIn_data_V_addr_3</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>46</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>46</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>281</item> <item>282</item> <item>283</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_64"> <Value> <Obj> <type>0</type> <id>97</id> <name>valIn_data_V_load_1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>46</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>46</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>284</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_65"> <Value> <Obj> <type>0</type> <id>98</id> <name>tmp_6</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>46</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>46</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_6_fu_471_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>285</item> <item>286</item> </oprand_edges> <opcode>icmp</opcode> </item> <item class_id_reference="9" object_id="_66"> <Value> <Obj> <type>0</type> <id>99</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>46</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>46</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>287</item> <item>288</item> <item>289</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_67"> <Value> <Obj> <type>0</type> <id>101</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>49</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>49</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>290</item> <item>291</item> <item>577</item> </oprand_edges> <opcode>store</opcode> </item> <item class_id_reference="9" object_id="_68"> <Value> <Obj> <type>0</type> <id>102</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>50</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>50</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>292</item> <item>293</item> <item>578</item> </oprand_edges> <opcode>store</opcode> </item> <item class_id_reference="9" object_id="_69"> <Value> <Obj> <type>0</type> <id>103</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>51</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</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>294</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_70"> <Value> <Obj> <type>0</type> <id>106</id> <name>i_2</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>43</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>43</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>i_2_fu_477_p2</rtlName> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>268</item> <item>270</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_71"> <Value> <Obj> <type>0</type> <id>107</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>43</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>43</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>271</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_72"> <Value> <Obj> <type>0</type> <id>111</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>31</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>31</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>258</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_73"> <Value> <Obj> <type>0</type> <id>113</id> <name>i_s</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>31</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>31</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>299</item> <item>300</item> <item>301</item> <item>302</item> </oprand_edges> <opcode>phi</opcode> </item> <item class_id_reference="9" object_id="_74"> <Value> <Obj> <type>0</type> <id>114</id> <name>tmp_9_1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>31</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>31</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_9_1_fu_483_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>303</item> <item>304</item> </oprand_edges> <opcode>icmp</opcode> </item> <item class_id_reference="9" object_id="_75"> <Value> <Obj> <type>0</type> <id>115</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>31</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>31</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>305</item> <item>306</item> <item>307</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_76"> <Value> <Obj> <type>0</type> <id>121</id> <name>tmp_7_1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>34</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>34</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_7_1_fu_489_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>311</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_77"> <Value> <Obj> <type>0</type> <id>122</id> <name>tmp_10_1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>34</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>34</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_10_1_fu_494_p2</rtlName> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>312</item> <item>313</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_78"> <Value> <Obj> <type>0</type> <id>123</id> <name>tmp_11_1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>34</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>34</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_11_1_fu_500_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>314</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_79"> <Value> <Obj> <type>0</type> <id>124</id> <name>valIn_data_V_addr_4</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>34</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>34</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>315</item> <item>316</item> <item>317</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_80"> <Value> <Obj> <type>0</type> <id>125</id> <name>valIn_data_V_load_2</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>34</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>34</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>318</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_81"> <Value> <Obj> <type>0</type> <id>126</id> <name>valIn_data_V_addr_5</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>34</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>34</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>319</item> <item>320</item> <item>321</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_82"> <Value> <Obj> <type>0</type> <id>127</id> <name>valIn_data_V_load_3</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>34</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>34</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>322</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_83"> <Value> <Obj> <type>0</type> <id>128</id> <name>tmp_12_1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>34</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>34</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_12_1_fu_505_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>323</item> <item>324</item> </oprand_edges> <opcode>icmp</opcode> </item> <item class_id_reference="9" object_id="_84"> <Value> <Obj> <type>0</type> <id>129</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>34</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>34</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>325</item> <item>326</item> <item>327</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_85"> <Value> <Obj> <type>0</type> <id>131</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>37</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>37</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>328</item> <item>329</item> <item>579</item> </oprand_edges> <opcode>store</opcode> </item> <item class_id_reference="9" object_id="_86"> <Value> <Obj> <type>0</type> <id>132</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>38</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>38</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>330</item> <item>331</item> <item>580</item> </oprand_edges> <opcode>store</opcode> </item> <item class_id_reference="9" object_id="_87"> <Value> <Obj> <type>0</type> <id>133</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>332</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_88"> <Value> <Obj> <type>0</type> <id>136</id> <name>i_3_1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>31</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>31</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>i_3_1_fu_511_p2</rtlName> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>308</item> <item>309</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_89"> <Value> <Obj> <type>0</type> <id>137</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>31</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>31</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>310</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_90"> <Value> <Obj> <type>0</type> <id>140</id> <name>stage_1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>27</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>27</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>stage_1_fu_517_p2</rtlName> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>296</item> <item>297</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_91"> <Value> <Obj> <type>0</type> <id>141</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>27</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>27</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>298</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_92"> <Value> <Obj> <type>0</type> <id>143</id> <name>idx2</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>idx</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>333</item> <item>334</item> <item>335</item> <item>336</item> </oprand_edges> <opcode>phi</opcode> </item> <item class_id_reference="9" object_id="_93"> <Value> <Obj> <type>0</type> <id>144</id> <name>exitcond</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>55</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>55</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>exitcond_fu_523_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>337</item> <item>338</item> </oprand_edges> <opcode>icmp</opcode> </item> <item class_id_reference="9" object_id="_94"> <Value> <Obj> <type>0</type> <id>145</id> <name>idx_2</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>55</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>55</second> </item> </second> </item> </inlineStackInfo> <originalName>idx</originalName> <rtlName>idx_2_fu_529_p2</rtlName> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>339</item> <item>340</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_95"> <Value> <Obj> <type>0</type> <id>146</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>55</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>55</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>341</item> <item>342</item> <item>343</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_96"> <Value> <Obj> <type>0</type> <id>151</id> <name>tmp_5</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_5_fu_535_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>344</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_97"> <Value> <Obj> <type>0</type> <id>152</id> <name>valIn_data_V_addr_1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>345</item> <item>346</item> <item>347</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_98"> <Value> <Obj> <type>0</type> <id>153</id> <name>tmp_data_V_1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>348</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_99"> <Value> <Obj> <type>0</type> <id>154</id> <name>valIn_keep_V_addr_1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>349</item> <item>350</item> <item>351</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_100"> <Value> <Obj> <type>0</type> <id>155</id> <name>tmp_keep_V_1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.keep.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>352</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_101"> <Value> <Obj> <type>0</type> <id>156</id> <name>valIn_strb_V_addr_1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>353</item> <item>354</item> <item>355</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_102"> <Value> <Obj> <type>0</type> <id>157</id> <name>tmp_strb_V_1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.strb.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>356</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_103"> <Value> <Obj> <type>0</type> <id>158</id> <name>valIn_user_V_addr_1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>357</item> <item>358</item> <item>359</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_104"> <Value> <Obj> <type>0</type> <id>159</id> <name>tmp_user_V_1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.user.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>360</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_105"> <Value> <Obj> <type>0</type> <id>160</id> <name>valIn_last_V_addr_1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>361</item> <item>362</item> <item>363</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_106"> <Value> <Obj> <type>0</type> <id>161</id> <name>tmp_last_V_1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.last.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>364</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_107"> <Value> <Obj> <type>0</type> <id>162</id> <name>valIn_id_V_addr_1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>365</item> <item>366</item> <item>367</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_108"> <Value> <Obj> <type>0</type> <id>163</id> <name>tmp_id_V_1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.id.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>5</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>368</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_109"> <Value> <Obj> <type>0</type> <id>164</id> <name>valIn_dest_V_addr_1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>369</item> <item>370</item> <item>371</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_110"> <Value> <Obj> <type>0</type> <id>165</id> <name>tmp_dest_V_1</name> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.dest.V</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>6</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>372</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_111"> <Value> <Obj> <type>0</type> <id>166</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>15</count> <item_version>0</item_version> <item>374</item> <item>375</item> <item>376</item> <item>377</item> <item>378</item> <item>379</item> <item>380</item> <item>381</item> <item>382</item> <item>383</item> <item>384</item> <item>385</item> <item>386</item> <item>387</item> <item>388</item> </oprand_edges> <opcode>write</opcode> </item> <item class_id_reference="9" object_id="_112"> <Value> <Obj> <type>0</type> <id>168</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>55</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>55</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>389</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_113"> <Value> <Obj> <type>0</type> <id>170</id> <name/> <fileName>main.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>doGain</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jvarred/Desktop/HLS</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>main.cpp</first> <second>doGain</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>0</count> <item_version>0</item_version> </oprand_edges> <opcode>ret</opcode> </item> </nodes> <consts class_id="15" tracking_level="0" version="0"> <count>7</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_114"> <Value> <Obj> <type>2</type> <id>172</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_115"> <Value> <Obj> <type>2</type> <id>183</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>14</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_116"> <Value> <Obj> <type>2</type> <id>187</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>14</bitwidth> </Value> <const_type>0</const_type> <content>10000</content> </item> <item class_id_reference="16" object_id="_117"> <Value> <Obj> <type>2</type> <id>190</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>14</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_118"> <Value> <Obj> <type>2</type> <id>213</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_119"> <Value> <Obj> <type>2</type> <id>269</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>14</bitwidth> </Value> <const_type>0</const_type> <content>2</content> </item> <item class_id_reference="16" object_id="_120"> <Value> <Obj> <type>2</type> <id>274</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>14</bitwidth> </Value> <const_type>0</const_type> <content>16383</content> </item> </consts> <blocks class_id="17" tracking_level="0" version="0"> <count>18</count> <item_version>0</item_version> <item class_id="18" tracking_level="1" version="0" object_id="_121"> <Obj> <type>3</type> <id>40</id> <name>.preheader37.preheader</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>8</count> <item_version>0</item_version> <item>30</item> <item>31</item> <item>32</item> <item>33</item> <item>34</item> <item>35</item> <item>36</item> <item>39</item> </node_objs> </item> <item class_id_reference="18" object_id="_122"> <Obj> <type>3</type> <id>45</id> <name>.preheader37</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>4</count> <item_version>0</item_version> <item>41</item> <item>42</item> <item>43</item> <item>44</item> </node_objs> </item> <item class_id_reference="18" object_id="_123"> <Obj> <type>3</type> <id>74</id> <name/> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>24</count> <item_version>0</item_version> <item>49</item> <item>50</item> <item>51</item> <item>52</item> <item>53</item> <item>54</item> <item>55</item> <item>56</item> <item>57</item> <item>58</item> <item>59</item> <item>60</item> <item>61</item> <item>62</item> <item>63</item> <item>64</item> <item>65</item> <item>66</item> <item>67</item> <item>68</item> <item>69</item> <item>70</item> <item>71</item> <item>73</item> </node_objs> </item> <item class_id_reference="18" object_id="_124"> <Obj> <type>3</type> <id>78</id> <name>.preheader36.0</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>75</item> <item>76</item> <item>77</item> </node_objs> </item> <item class_id_reference="18" object_id="_125"> <Obj> <type>3</type> <id>82</id> <name>.preheader33.preheader.0</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>81</item> </node_objs> </item> <item class_id_reference="18" object_id="_126"> <Obj> <type>3</type> <id>86</id> <name>.preheader33.0</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>83</item> <item>84</item> <item>85</item> </node_objs> </item> <item class_id_reference="18" object_id="_127"> <Obj> <type>3</type> <id>100</id> <name/> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>9</count> <item_version>0</item_version> <item>91</item> <item>92</item> <item>93</item> <item>94</item> <item>95</item> <item>96</item> <item>97</item> <item>98</item> <item>99</item> </node_objs> </item> <item class_id_reference="18" object_id="_128"> <Obj> <type>3</type> <id>104</id> <name/> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>101</item> <item>102</item> <item>103</item> </node_objs> </item> <item class_id_reference="18" object_id="_129"> <Obj> <type>3</type> <id>108</id> <name>._crit_edge41.0</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>106</item> <item>107</item> </node_objs> </item> <item class_id_reference="18" object_id="_130"> <Obj> <type>3</type> <id>112</id> <name>.loopexit.loopexit.0</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>111</item> </node_objs> </item> <item class_id_reference="18" object_id="_131"> <Obj> <type>3</type> <id>116</id> <name>.preheader34.1</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>113</item> <item>114</item> <item>115</item> </node_objs> </item> <item class_id_reference="18" object_id="_132"> <Obj> <type>3</type> <id>130</id> <name/> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>9</count> <item_version>0</item_version> <item>121</item> <item>122</item> <item>123</item> <item>124</item> <item>125</item> <item>126</item> <item>127</item> <item>128</item> <item>129</item> </node_objs> </item> <item class_id_reference="18" object_id="_133"> <Obj> <type>3</type> <id>134</id> <name/> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>131</item> <item>132</item> <item>133</item> </node_objs> </item> <item class_id_reference="18" object_id="_134"> <Obj> <type>3</type> <id>138</id> <name>._crit_edge.1</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>136</item> <item>137</item> </node_objs> </item> <item class_id_reference="18" object_id="_135"> <Obj> <type>3</type> <id>142</id> <name>.loopexit.loopexit1.1</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>140</item> <item>141</item> </node_objs> </item> <item class_id_reference="18" object_id="_136"> <Obj> <type>3</type> <id>147</id> <name>.preheader</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>4</count> <item_version>0</item_version> <item>143</item> <item>144</item> <item>145</item> <item>146</item> </node_objs> </item> <item class_id_reference="18" object_id="_137"> <Obj> <type>3</type> <id>169</id> <name/> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>17</count> <item_version>0</item_version> <item>151</item> <item>152</item> <item>153</item> <item>154</item> <item>155</item> <item>156</item> <item>157</item> <item>158</item> <item>159</item> <item>160</item> <item>161</item> <item>162</item> <item>163</item> <item>164</item> <item>165</item> <item>166</item> <item>168</item> </node_objs> </item> <item class_id_reference="18" object_id="_138"> <Obj> <type>3</type> <id>171</id> <name/> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>170</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>235</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_139"> <id>173</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>30</sink_obj> </item> <item class_id_reference="20" object_id="_140"> <id>174</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>31</sink_obj> </item> <item class_id_reference="20" object_id="_141"> <id>175</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>32</sink_obj> </item> <item class_id_reference="20" object_id="_142"> <id>176</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>33</sink_obj> </item> <item class_id_reference="20" object_id="_143"> <id>177</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>34</sink_obj> </item> <item class_id_reference="20" object_id="_144"> <id>178</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>35</sink_obj> </item> <item class_id_reference="20" object_id="_145"> <id>179</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>36</sink_obj> </item> <item class_id_reference="20" object_id="_146"> <id>180</id> <edge_type>2</edge_type> <source_obj>45</source_obj> <sink_obj>39</sink_obj> </item> <item class_id_reference="20" object_id="_147"> <id>181</id> <edge_type>1</edge_type> <source_obj>43</source_obj> <sink_obj>41</sink_obj> </item> <item class_id_reference="20" object_id="_148"> <id>182</id> <edge_type>2</edge_type> <source_obj>74</source_obj> <sink_obj>41</sink_obj> </item> <item class_id_reference="20" object_id="_149"> <id>184</id> <edge_type>1</edge_type> <source_obj>183</source_obj> <sink_obj>41</sink_obj> </item> <item class_id_reference="20" object_id="_150"> <id>185</id> <edge_type>2</edge_type> <source_obj>40</source_obj> <sink_obj>41</sink_obj> </item> <item class_id_reference="20" object_id="_151"> <id>186</id> <edge_type>1</edge_type> <source_obj>41</source_obj> <sink_obj>42</sink_obj> </item> <item class_id_reference="20" object_id="_152"> <id>188</id> <edge_type>1</edge_type> <source_obj>187</source_obj> <sink_obj>42</sink_obj> </item> <item class_id_reference="20" object_id="_153"> <id>189</id> <edge_type>1</edge_type> <source_obj>41</source_obj> <sink_obj>43</sink_obj> </item> <item class_id_reference="20" object_id="_154"> <id>191</id> <edge_type>1</edge_type> <source_obj>190</source_obj> <sink_obj>43</sink_obj> </item> <item class_id_reference="20" object_id="_155"> <id>192</id> <edge_type>1</edge_type> <source_obj>42</source_obj> <sink_obj>44</sink_obj> </item> <item class_id_reference="20" object_id="_156"> <id>193</id> <edge_type>2</edge_type> <source_obj>74</source_obj> <sink_obj>44</sink_obj> </item> <item class_id_reference="20" object_id="_157"> <id>194</id> <edge_type>2</edge_type> <source_obj>78</source_obj> <sink_obj>44</sink_obj> </item> <item class_id_reference="20" object_id="_158"> <id>195</id> <edge_type>1</edge_type> <source_obj>41</source_obj> <sink_obj>49</sink_obj> </item> <item class_id_reference="20" object_id="_159"> <id>198</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>50</sink_obj> </item> <item class_id_reference="20" object_id="_160"> <id>199</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>50</sink_obj> </item> <item class_id_reference="20" object_id="_161"> <id>200</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>50</sink_obj> </item> <item class_id_reference="20" object_id="_162"> <id>201</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>50</sink_obj> </item> <item class_id_reference="20" object_id="_163"> <id>202</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>50</sink_obj> </item> <item class_id_reference="20" object_id="_164"> <id>203</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>50</sink_obj> </item> <item class_id_reference="20" object_id="_165"> <id>204</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>50</sink_obj> </item> <item class_id_reference="20" object_id="_166"> <id>205</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>51</sink_obj> </item> <item class_id_reference="20" object_id="_167"> <id>206</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>52</sink_obj> </item> <item class_id_reference="20" object_id="_168"> <id>207</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>53</sink_obj> </item> <item class_id_reference="20" object_id="_169"> <id>208</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>54</sink_obj> </item> <item class_id_reference="20" object_id="_170"> <id>209</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>55</sink_obj> </item> <item class_id_reference="20" object_id="_171"> <id>210</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>56</sink_obj> </item> <item class_id_reference="20" object_id="_172"> <id>211</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>57</sink_obj> </item> <item class_id_reference="20" object_id="_173"> <id>212</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>58</sink_obj> </item> <item class_id_reference="20" object_id="_174"> <id>214</id> <edge_type>1</edge_type> <source_obj>213</source_obj> <sink_obj>58</sink_obj> </item> <item class_id_reference="20" object_id="_175"> <id>215</id> <edge_type>1</edge_type> <source_obj>49</source_obj> <sink_obj>58</sink_obj> </item> <item class_id_reference="20" object_id="_176"> <id>216</id> <edge_type>1</edge_type> <source_obj>51</source_obj> <sink_obj>59</sink_obj> </item> <item class_id_reference="20" object_id="_177"> <id>217</id> <edge_type>1</edge_type> <source_obj>58</source_obj> <sink_obj>59</sink_obj> </item> <item class_id_reference="20" object_id="_178"> <id>218</id> <edge_type>1</edge_type> <source_obj>31</source_obj> <sink_obj>60</sink_obj> </item> <item class_id_reference="20" object_id="_179"> <id>219</id> <edge_type>1</edge_type> <source_obj>213</source_obj> <sink_obj>60</sink_obj> </item> <item class_id_reference="20" object_id="_180"> <id>220</id> <edge_type>1</edge_type> <source_obj>49</source_obj> <sink_obj>60</sink_obj> </item> <item class_id_reference="20" object_id="_181"> <id>221</id> <edge_type>1</edge_type> <source_obj>52</source_obj> <sink_obj>61</sink_obj> </item> <item class_id_reference="20" object_id="_182"> <id>222</id> <edge_type>1</edge_type> <source_obj>60</source_obj> <sink_obj>61</sink_obj> </item> <item class_id_reference="20" object_id="_183"> <id>223</id> <edge_type>1</edge_type> <source_obj>32</source_obj> <sink_obj>62</sink_obj> </item> <item class_id_reference="20" object_id="_184"> <id>224</id> <edge_type>1</edge_type> <source_obj>213</source_obj> <sink_obj>62</sink_obj> </item> <item class_id_reference="20" object_id="_185"> <id>225</id> <edge_type>1</edge_type> <source_obj>49</source_obj> <sink_obj>62</sink_obj> </item> <item class_id_reference="20" object_id="_186"> <id>226</id> <edge_type>1</edge_type> <source_obj>53</source_obj> <sink_obj>63</sink_obj> </item> <item class_id_reference="20" object_id="_187"> <id>227</id> <edge_type>1</edge_type> <source_obj>62</source_obj> <sink_obj>63</sink_obj> </item> <item class_id_reference="20" object_id="_188"> <id>228</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>64</sink_obj> </item> <item class_id_reference="20" object_id="_189"> <id>229</id> <edge_type>1</edge_type> <source_obj>213</source_obj> <sink_obj>64</sink_obj> </item> <item class_id_reference="20" object_id="_190"> <id>230</id> <edge_type>1</edge_type> <source_obj>49</source_obj> <sink_obj>64</sink_obj> </item> <item class_id_reference="20" object_id="_191"> <id>231</id> <edge_type>1</edge_type> <source_obj>54</source_obj> <sink_obj>65</sink_obj> </item> <item class_id_reference="20" object_id="_192"> <id>232</id> <edge_type>1</edge_type> <source_obj>64</source_obj> <sink_obj>65</sink_obj> </item> <item class_id_reference="20" object_id="_193"> <id>233</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>66</sink_obj> </item> <item class_id_reference="20" object_id="_194"> <id>234</id> <edge_type>1</edge_type> <source_obj>213</source_obj> <sink_obj>66</sink_obj> </item> <item class_id_reference="20" object_id="_195"> <id>235</id> <edge_type>1</edge_type> <source_obj>49</source_obj> <sink_obj>66</sink_obj> </item> <item class_id_reference="20" object_id="_196"> <id>236</id> <edge_type>1</edge_type> <source_obj>55</source_obj> <sink_obj>67</sink_obj> </item> <item class_id_reference="20" object_id="_197"> <id>237</id> <edge_type>1</edge_type> <source_obj>66</source_obj> <sink_obj>67</sink_obj> </item> <item class_id_reference="20" object_id="_198"> <id>238</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>68</sink_obj> </item> <item class_id_reference="20" object_id="_199"> <id>239</id> <edge_type>1</edge_type> <source_obj>213</source_obj> <sink_obj>68</sink_obj> </item> <item class_id_reference="20" object_id="_200"> <id>240</id> <edge_type>1</edge_type> <source_obj>49</source_obj> <sink_obj>68</sink_obj> </item> <item class_id_reference="20" object_id="_201"> <id>241</id> <edge_type>1</edge_type> <source_obj>56</source_obj> <sink_obj>69</sink_obj> </item> <item class_id_reference="20" object_id="_202"> <id>242</id> <edge_type>1</edge_type> <source_obj>68</source_obj> <sink_obj>69</sink_obj> </item> <item class_id_reference="20" object_id="_203"> <id>243</id> <edge_type>1</edge_type> <source_obj>36</source_obj> <sink_obj>70</sink_obj> </item> <item class_id_reference="20" object_id="_204"> <id>244</id> <edge_type>1</edge_type> <source_obj>213</source_obj> <sink_obj>70</sink_obj> </item> <item class_id_reference="20" object_id="_205"> <id>245</id> <edge_type>1</edge_type> <source_obj>49</source_obj> <sink_obj>70</sink_obj> </item> <item class_id_reference="20" object_id="_206"> <id>246</id> <edge_type>1</edge_type> <source_obj>57</source_obj> <sink_obj>71</sink_obj> </item> <item class_id_reference="20" object_id="_207"> <id>247</id> <edge_type>1</edge_type> <source_obj>70</source_obj> <sink_obj>71</sink_obj> </item> <item class_id_reference="20" object_id="_208"> <id>248</id> <edge_type>2</edge_type> <source_obj>45</source_obj> <sink_obj>73</sink_obj> </item> <item class_id_reference="20" object_id="_209"> <id>249</id> <edge_type>1</edge_type> <source_obj>140</source_obj> <sink_obj>75</sink_obj> </item> <item class_id_reference="20" object_id="_210"> <id>250</id> <edge_type>2</edge_type> <source_obj>142</source_obj> <sink_obj>75</sink_obj> </item> <item class_id_reference="20" object_id="_211"> <id>251</id> <edge_type>1</edge_type> <source_obj>183</source_obj> <sink_obj>75</sink_obj> </item> <item class_id_reference="20" object_id="_212"> <id>252</id> <edge_type>2</edge_type> <source_obj>45</source_obj> <sink_obj>75</sink_obj> </item> <item class_id_reference="20" object_id="_213"> <id>253</id> <edge_type>1</edge_type> <source_obj>75</source_obj> <sink_obj>76</sink_obj> </item> <item class_id_reference="20" object_id="_214"> <id>254</id> <edge_type>1</edge_type> <source_obj>187</source_obj> <sink_obj>76</sink_obj> </item> <item class_id_reference="20" object_id="_215"> <id>255</id> <edge_type>1</edge_type> <source_obj>76</source_obj> <sink_obj>77</sink_obj> </item> <item class_id_reference="20" object_id="_216"> <id>256</id> <edge_type>2</edge_type> <source_obj>82</source_obj> <sink_obj>77</sink_obj> </item> <item class_id_reference="20" object_id="_217"> <id>257</id> <edge_type>2</edge_type> <source_obj>147</source_obj> <sink_obj>77</sink_obj> </item> <item class_id_reference="20" object_id="_218"> <id>258</id> <edge_type>2</edge_type> <source_obj>116</source_obj> <sink_obj>111</sink_obj> </item> <item class_id_reference="20" object_id="_219"> <id>259</id> <edge_type>1</edge_type> <source_obj>106</source_obj> <sink_obj>83</sink_obj> </item> <item class_id_reference="20" object_id="_220"> <id>260</id> <edge_type>2</edge_type> <source_obj>108</source_obj> <sink_obj>83</sink_obj> </item> <item class_id_reference="20" object_id="_221"> <id>261</id> <edge_type>1</edge_type> <source_obj>190</source_obj> <sink_obj>83</sink_obj> </item> <item class_id_reference="20" object_id="_222"> <id>262</id> <edge_type>2</edge_type> <source_obj>82</source_obj> <sink_obj>83</sink_obj> </item> <item class_id_reference="20" object_id="_223"> <id>263</id> <edge_type>1</edge_type> <source_obj>83</source_obj> <sink_obj>84</sink_obj> </item> <item class_id_reference="20" object_id="_224"> <id>264</id> <edge_type>1</edge_type> <source_obj>187</source_obj> <sink_obj>84</sink_obj> </item> <item class_id_reference="20" object_id="_225"> <id>265</id> <edge_type>1</edge_type> <source_obj>84</source_obj> <sink_obj>85</sink_obj> </item> <item class_id_reference="20" object_id="_226"> <id>266</id> <edge_type>2</edge_type> <source_obj>112</source_obj> <sink_obj>85</sink_obj> </item> <item class_id_reference="20" object_id="_227"> <id>267</id> <edge_type>2</edge_type> <source_obj>100</source_obj> <sink_obj>85</sink_obj> </item> <item class_id_reference="20" object_id="_228"> <id>268</id> <edge_type>1</edge_type> <source_obj>83</source_obj> <sink_obj>106</sink_obj> </item> <item class_id_reference="20" object_id="_229"> <id>270</id> <edge_type>1</edge_type> <source_obj>269</source_obj> <sink_obj>106</sink_obj> </item> <item class_id_reference="20" object_id="_230"> <id>271</id> <edge_type>2</edge_type> <source_obj>86</source_obj> <sink_obj>107</sink_obj> </item> <item class_id_reference="20" object_id="_231"> <id>272</id> <edge_type>1</edge_type> <source_obj>83</source_obj> <sink_obj>91</sink_obj> </item> <item class_id_reference="20" object_id="_232"> <id>273</id> <edge_type>1</edge_type> <source_obj>83</source_obj> <sink_obj>92</sink_obj> </item> <item class_id_reference="20" object_id="_233"> <id>275</id> <edge_type>1</edge_type> <source_obj>274</source_obj> <sink_obj>92</sink_obj> </item> <item class_id_reference="20" object_id="_234"> <id>276</id> <edge_type>1</edge_type> <source_obj>92</source_obj> <sink_obj>93</sink_obj> </item> <item class_id_reference="20" object_id="_235"> <id>277</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>94</sink_obj> </item> <item class_id_reference="20" object_id="_236"> <id>278</id> <edge_type>1</edge_type> <source_obj>213</source_obj> <sink_obj>94</sink_obj> </item> <item class_id_reference="20" object_id="_237"> <id>279</id> <edge_type>1</edge_type> <source_obj>91</source_obj> <sink_obj>94</sink_obj> </item> <item class_id_reference="20" object_id="_238"> <id>280</id> <edge_type>1</edge_type> <source_obj>94</source_obj> <sink_obj>95</sink_obj> </item> <item class_id_reference="20" object_id="_239"> <id>281</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>96</sink_obj> </item> <item class_id_reference="20" object_id="_240"> <id>282</id> <edge_type>1</edge_type> <source_obj>213</source_obj> <sink_obj>96</sink_obj> </item> <item class_id_reference="20" object_id="_241"> <id>283</id> <edge_type>1</edge_type> <source_obj>93</source_obj> <sink_obj>96</sink_obj> </item> <item class_id_reference="20" object_id="_242"> <id>284</id> <edge_type>1</edge_type> <source_obj>96</source_obj> <sink_obj>97</sink_obj> </item> <item class_id_reference="20" object_id="_243"> <id>285</id> <edge_type>1</edge_type> <source_obj>95</source_obj> <sink_obj>98</sink_obj> </item> <item class_id_reference="20" object_id="_244"> <id>286</id> <edge_type>1</edge_type> <source_obj>97</source_obj> <sink_obj>98</sink_obj> </item> <item class_id_reference="20" object_id="_245"> <id>287</id> <edge_type>1</edge_type> <source_obj>98</source_obj> <sink_obj>99</sink_obj> </item> <item class_id_reference="20" object_id="_246"> <id>288</id> <edge_type>2</edge_type> <source_obj>108</source_obj> <sink_obj>99</sink_obj> </item> <item class_id_reference="20" object_id="_247"> <id>289</id> <edge_type>2</edge_type> <source_obj>104</source_obj> <sink_obj>99</sink_obj> </item> <item class_id_reference="20" object_id="_248"> <id>290</id> <edge_type>1</edge_type> <source_obj>97</source_obj> <sink_obj>101</sink_obj> </item> <item class_id_reference="20" object_id="_249"> <id>291</id> <edge_type>1</edge_type> <source_obj>94</source_obj> <sink_obj>101</sink_obj> </item> <item class_id_reference="20" object_id="_250"> <id>292</id> <edge_type>1</edge_type> <source_obj>95</source_obj> <sink_obj>102</sink_obj> </item> <item class_id_reference="20" object_id="_251"> <id>293</id> <edge_type>1</edge_type> <source_obj>96</source_obj> <sink_obj>102</sink_obj> </item> <item class_id_reference="20" object_id="_252"> <id>294</id> <edge_type>2</edge_type> <source_obj>108</source_obj> <sink_obj>103</sink_obj> </item> <item class_id_reference="20" object_id="_253"> <id>295</id> <edge_type>2</edge_type> <source_obj>86</source_obj> <sink_obj>81</sink_obj> </item> <item class_id_reference="20" object_id="_254"> <id>296</id> <edge_type>1</edge_type> <source_obj>75</source_obj> <sink_obj>140</sink_obj> </item> <item class_id_reference="20" object_id="_255"> <id>297</id> <edge_type>1</edge_type> <source_obj>269</source_obj> <sink_obj>140</sink_obj> </item> <item class_id_reference="20" object_id="_256"> <id>298</id> <edge_type>2</edge_type> <source_obj>78</source_obj> <sink_obj>141</sink_obj> </item> <item class_id_reference="20" object_id="_257"> <id>299</id> <edge_type>1</edge_type> <source_obj>136</source_obj> <sink_obj>113</sink_obj> </item> <item class_id_reference="20" object_id="_258"> <id>300</id> <edge_type>2</edge_type> <source_obj>138</source_obj> <sink_obj>113</sink_obj> </item> <item class_id_reference="20" object_id="_259"> <id>301</id> <edge_type>1</edge_type> <source_obj>269</source_obj> <sink_obj>113</sink_obj> </item> <item class_id_reference="20" object_id="_260"> <id>302</id> <edge_type>2</edge_type> <source_obj>112</source_obj> <sink_obj>113</sink_obj> </item> <item class_id_reference="20" object_id="_261"> <id>303</id> <edge_type>1</edge_type> <source_obj>113</source_obj> <sink_obj>114</sink_obj> </item> <item class_id_reference="20" object_id="_262"> <id>304</id> <edge_type>1</edge_type> <source_obj>187</source_obj> <sink_obj>114</sink_obj> </item> <item class_id_reference="20" object_id="_263"> <id>305</id> <edge_type>1</edge_type> <source_obj>114</source_obj> <sink_obj>115</sink_obj> </item> <item class_id_reference="20" object_id="_264"> <id>306</id> <edge_type>2</edge_type> <source_obj>142</source_obj> <sink_obj>115</sink_obj> </item> <item class_id_reference="20" object_id="_265"> <id>307</id> <edge_type>2</edge_type> <source_obj>130</source_obj> <sink_obj>115</sink_obj> </item> <item class_id_reference="20" object_id="_266"> <id>308</id> <edge_type>1</edge_type> <source_obj>113</source_obj> <sink_obj>136</sink_obj> </item> <item class_id_reference="20" object_id="_267"> <id>309</id> <edge_type>1</edge_type> <source_obj>269</source_obj> <sink_obj>136</sink_obj> </item> <item class_id_reference="20" object_id="_268"> <id>310</id> <edge_type>2</edge_type> <source_obj>116</source_obj> <sink_obj>137</sink_obj> </item> <item class_id_reference="20" object_id="_269"> <id>311</id> <edge_type>1</edge_type> <source_obj>113</source_obj> <sink_obj>121</sink_obj> </item> <item class_id_reference="20" object_id="_270"> <id>312</id> <edge_type>1</edge_type> <source_obj>113</source_obj> <sink_obj>122</sink_obj> </item> <item class_id_reference="20" object_id="_271"> <id>313</id> <edge_type>1</edge_type> <source_obj>274</source_obj> <sink_obj>122</sink_obj> </item> <item class_id_reference="20" object_id="_272"> <id>314</id> <edge_type>1</edge_type> <source_obj>122</source_obj> <sink_obj>123</sink_obj> </item> <item class_id_reference="20" object_id="_273"> <id>315</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>124</sink_obj> </item> <item class_id_reference="20" object_id="_274"> <id>316</id> <edge_type>1</edge_type> <source_obj>213</source_obj> <sink_obj>124</sink_obj> </item> <item class_id_reference="20" object_id="_275"> <id>317</id> <edge_type>1</edge_type> <source_obj>121</source_obj> <sink_obj>124</sink_obj> </item> <item class_id_reference="20" object_id="_276"> <id>318</id> <edge_type>1</edge_type> <source_obj>124</source_obj> <sink_obj>125</sink_obj> </item> <item class_id_reference="20" object_id="_277"> <id>319</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>126</sink_obj> </item> <item class_id_reference="20" object_id="_278"> <id>320</id> <edge_type>1</edge_type> <source_obj>213</source_obj> <sink_obj>126</sink_obj> </item> <item class_id_reference="20" object_id="_279"> <id>321</id> <edge_type>1</edge_type> <source_obj>123</source_obj> <sink_obj>126</sink_obj> </item> <item class_id_reference="20" object_id="_280"> <id>322</id> <edge_type>1</edge_type> <source_obj>126</source_obj> <sink_obj>127</sink_obj> </item> <item class_id_reference="20" object_id="_281"> <id>323</id> <edge_type>1</edge_type> <source_obj>125</source_obj> <sink_obj>128</sink_obj> </item> <item class_id_reference="20" object_id="_282"> <id>324</id> <edge_type>1</edge_type> <source_obj>127</source_obj> <sink_obj>128</sink_obj> </item> <item class_id_reference="20" object_id="_283"> <id>325</id> <edge_type>1</edge_type> <source_obj>128</source_obj> <sink_obj>129</sink_obj> </item> <item class_id_reference="20" object_id="_284"> <id>326</id> <edge_type>2</edge_type> <source_obj>138</source_obj> <sink_obj>129</sink_obj> </item> <item class_id_reference="20" object_id="_285"> <id>327</id> <edge_type>2</edge_type> <source_obj>134</source_obj> <sink_obj>129</sink_obj> </item> <item class_id_reference="20" object_id="_286"> <id>328</id> <edge_type>1</edge_type> <source_obj>127</source_obj> <sink_obj>131</sink_obj> </item> <item class_id_reference="20" object_id="_287"> <id>329</id> <edge_type>1</edge_type> <source_obj>124</source_obj> <sink_obj>131</sink_obj> </item> <item class_id_reference="20" object_id="_288"> <id>330</id> <edge_type>1</edge_type> <source_obj>125</source_obj> <sink_obj>132</sink_obj> </item> <item class_id_reference="20" object_id="_289"> <id>331</id> <edge_type>1</edge_type> <source_obj>126</source_obj> <sink_obj>132</sink_obj> </item> <item class_id_reference="20" object_id="_290"> <id>332</id> <edge_type>2</edge_type> <source_obj>138</source_obj> <sink_obj>133</sink_obj> </item> <item class_id_reference="20" object_id="_291"> <id>333</id> <edge_type>1</edge_type> <source_obj>145</source_obj> <sink_obj>143</sink_obj> </item> <item class_id_reference="20" object_id="_292"> <id>334</id> <edge_type>2</edge_type> <source_obj>169</source_obj> <sink_obj>143</sink_obj> </item> <item class_id_reference="20" object_id="_293"> <id>335</id> <edge_type>1</edge_type> <source_obj>183</source_obj> <sink_obj>143</sink_obj> </item> <item class_id_reference="20" object_id="_294"> <id>336</id> <edge_type>2</edge_type> <source_obj>78</source_obj> <sink_obj>143</sink_obj> </item> <item class_id_reference="20" object_id="_295"> <id>337</id> <edge_type>1</edge_type> <source_obj>143</source_obj> <sink_obj>144</sink_obj> </item> <item class_id_reference="20" object_id="_296"> <id>338</id> <edge_type>1</edge_type> <source_obj>187</source_obj> <sink_obj>144</sink_obj> </item> <item class_id_reference="20" object_id="_297"> <id>339</id> <edge_type>1</edge_type> <source_obj>143</source_obj> <sink_obj>145</sink_obj> </item> <item class_id_reference="20" object_id="_298"> <id>340</id> <edge_type>1</edge_type> <source_obj>190</source_obj> <sink_obj>145</sink_obj> </item> <item class_id_reference="20" object_id="_299"> <id>341</id> <edge_type>1</edge_type> <source_obj>144</source_obj> <sink_obj>146</sink_obj> </item> <item class_id_reference="20" object_id="_300"> <id>342</id> <edge_type>2</edge_type> <source_obj>169</source_obj> <sink_obj>146</sink_obj> </item> <item class_id_reference="20" object_id="_301"> <id>343</id> <edge_type>2</edge_type> <source_obj>171</source_obj> <sink_obj>146</sink_obj> </item> <item class_id_reference="20" object_id="_302"> <id>344</id> <edge_type>1</edge_type> <source_obj>143</source_obj> <sink_obj>151</sink_obj> </item> <item class_id_reference="20" object_id="_303"> <id>345</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>152</sink_obj> </item> <item class_id_reference="20" object_id="_304"> <id>346</id> <edge_type>1</edge_type> <source_obj>213</source_obj> <sink_obj>152</sink_obj> </item> <item class_id_reference="20" object_id="_305"> <id>347</id> <edge_type>1</edge_type> <source_obj>151</source_obj> <sink_obj>152</sink_obj> </item> <item class_id_reference="20" object_id="_306"> <id>348</id> <edge_type>1</edge_type> <source_obj>152</source_obj> <sink_obj>153</sink_obj> </item> <item class_id_reference="20" object_id="_307"> <id>349</id> <edge_type>1</edge_type> <source_obj>31</source_obj> <sink_obj>154</sink_obj> </item> <item class_id_reference="20" object_id="_308"> <id>350</id> <edge_type>1</edge_type> <source_obj>213</source_obj> <sink_obj>154</sink_obj> </item> <item class_id_reference="20" object_id="_309"> <id>351</id> <edge_type>1</edge_type> <source_obj>151</source_obj> <sink_obj>154</sink_obj> </item> <item class_id_reference="20" object_id="_310"> <id>352</id> <edge_type>1</edge_type> <source_obj>154</source_obj> <sink_obj>155</sink_obj> </item> <item class_id_reference="20" object_id="_311"> <id>353</id> <edge_type>1</edge_type> <source_obj>32</source_obj> <sink_obj>156</sink_obj> </item> <item class_id_reference="20" object_id="_312"> <id>354</id> <edge_type>1</edge_type> <source_obj>213</source_obj> <sink_obj>156</sink_obj> </item> <item class_id_reference="20" object_id="_313"> <id>355</id> <edge_type>1</edge_type> <source_obj>151</source_obj> <sink_obj>156</sink_obj> </item> <item class_id_reference="20" object_id="_314"> <id>356</id> <edge_type>1</edge_type> <source_obj>156</source_obj> <sink_obj>157</sink_obj> </item> <item class_id_reference="20" object_id="_315"> <id>357</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>158</sink_obj> </item> <item class_id_reference="20" object_id="_316"> <id>358</id> <edge_type>1</edge_type> <source_obj>213</source_obj> <sink_obj>158</sink_obj> </item> <item class_id_reference="20" object_id="_317"> <id>359</id> <edge_type>1</edge_type> <source_obj>151</source_obj> <sink_obj>158</sink_obj> </item> <item class_id_reference="20" object_id="_318"> <id>360</id> <edge_type>1</edge_type> <source_obj>158</source_obj> <sink_obj>159</sink_obj> </item> <item class_id_reference="20" object_id="_319"> <id>361</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>160</sink_obj> </item> <item class_id_reference="20" object_id="_320"> <id>362</id> <edge_type>1</edge_type> <source_obj>213</source_obj> <sink_obj>160</sink_obj> </item> <item class_id_reference="20" object_id="_321"> <id>363</id> <edge_type>1</edge_type> <source_obj>151</source_obj> <sink_obj>160</sink_obj> </item> <item class_id_reference="20" object_id="_322"> <id>364</id> <edge_type>1</edge_type> <source_obj>160</source_obj> <sink_obj>161</sink_obj> </item> <item class_id_reference="20" object_id="_323"> <id>365</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>162</sink_obj> </item> <item class_id_reference="20" object_id="_324"> <id>366</id> <edge_type>1</edge_type> <source_obj>213</source_obj> <sink_obj>162</sink_obj> </item> <item class_id_reference="20" object_id="_325"> <id>367</id> <edge_type>1</edge_type> <source_obj>151</source_obj> <sink_obj>162</sink_obj> </item> <item class_id_reference="20" object_id="_326"> <id>368</id> <edge_type>1</edge_type> <source_obj>162</source_obj> <sink_obj>163</sink_obj> </item> <item class_id_reference="20" object_id="_327"> <id>369</id> <edge_type>1</edge_type> <source_obj>36</source_obj> <sink_obj>164</sink_obj> </item> <item class_id_reference="20" object_id="_328"> <id>370</id> <edge_type>1</edge_type> <source_obj>213</source_obj> <sink_obj>164</sink_obj> </item> <item class_id_reference="20" object_id="_329"> <id>371</id> <edge_type>1</edge_type> <source_obj>151</source_obj> <sink_obj>164</sink_obj> </item> <item class_id_reference="20" object_id="_330"> <id>372</id> <edge_type>1</edge_type> <source_obj>164</source_obj> <sink_obj>165</sink_obj> </item> <item class_id_reference="20" object_id="_331"> <id>375</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>166</sink_obj> </item> <item class_id_reference="20" object_id="_332"> <id>376</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>166</sink_obj> </item> <item class_id_reference="20" object_id="_333"> <id>377</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>166</sink_obj> </item> <item class_id_reference="20" object_id="_334"> <id>378</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>166</sink_obj> </item> <item class_id_reference="20" object_id="_335"> <id>379</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>166</sink_obj> </item> <item class_id_reference="20" object_id="_336"> <id>380</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>166</sink_obj> </item> <item class_id_reference="20" object_id="_337"> <id>381</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>166</sink_obj> </item> <item class_id_reference="20" object_id="_338"> <id>382</id> <edge_type>1</edge_type> <source_obj>153</source_obj> <sink_obj>166</sink_obj> </item> <item class_id_reference="20" object_id="_339"> <id>383</id> <edge_type>1</edge_type> <source_obj>155</source_obj> <sink_obj>166</sink_obj> </item> <item class_id_reference="20" object_id="_340"> <id>384</id> <edge_type>1</edge_type> <source_obj>157</source_obj> <sink_obj>166</sink_obj> </item> <item class_id_reference="20" object_id="_341"> <id>385</id> <edge_type>1</edge_type> <source_obj>159</source_obj> <sink_obj>166</sink_obj> </item> <item class_id_reference="20" object_id="_342"> <id>386</id> <edge_type>1</edge_type> <source_obj>161</source_obj> <sink_obj>166</sink_obj> </item> <item class_id_reference="20" object_id="_343"> <id>387</id> <edge_type>1</edge_type> <source_obj>163</source_obj> <sink_obj>166</sink_obj> </item> <item class_id_reference="20" object_id="_344"> <id>388</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>166</sink_obj> </item> <item class_id_reference="20" object_id="_345"> <id>389</id> <edge_type>2</edge_type> <source_obj>147</source_obj> <sink_obj>168</sink_obj> </item> <item class_id_reference="20" object_id="_346"> <id>553</id> <edge_type>2</edge_type> <source_obj>40</source_obj> <sink_obj>45</sink_obj> </item> <item class_id_reference="20" object_id="_347"> <id>554</id> <edge_type>2</edge_type> <source_obj>45</source_obj> <sink_obj>78</sink_obj> </item> <item class_id_reference="20" object_id="_348"> <id>555</id> <edge_type>2</edge_type> <source_obj>45</source_obj> <sink_obj>74</sink_obj> </item> <item class_id_reference="20" object_id="_349"> <id>556</id> <edge_type>2</edge_type> <source_obj>74</source_obj> <sink_obj>45</sink_obj> </item> <item class_id_reference="20" object_id="_350"> <id>557</id> <edge_type>2</edge_type> <source_obj>78</source_obj> <sink_obj>147</sink_obj> </item> <item class_id_reference="20" object_id="_351"> <id>558</id> <edge_type>2</edge_type> <source_obj>78</source_obj> <sink_obj>82</sink_obj> </item> <item class_id_reference="20" object_id="_352"> <id>559</id> <edge_type>2</edge_type> <source_obj>82</source_obj> <sink_obj>86</sink_obj> </item> <item class_id_reference="20" object_id="_353"> <id>560</id> <edge_type>2</edge_type> <source_obj>86</source_obj> <sink_obj>100</sink_obj> </item> <item class_id_reference="20" object_id="_354"> <id>561</id> <edge_type>2</edge_type> <source_obj>86</source_obj> <sink_obj>112</sink_obj> </item> <item class_id_reference="20" object_id="_355"> <id>562</id> <edge_type>2</edge_type> <source_obj>100</source_obj> <sink_obj>104</sink_obj> </item> <item class_id_reference="20" object_id="_356"> <id>563</id> <edge_type>2</edge_type> <source_obj>100</source_obj> <sink_obj>108</sink_obj> </item> <item class_id_reference="20" object_id="_357"> <id>564</id> <edge_type>2</edge_type> <source_obj>104</source_obj> <sink_obj>108</sink_obj> </item> <item class_id_reference="20" object_id="_358"> <id>565</id> <edge_type>2</edge_type> <source_obj>108</source_obj> <sink_obj>86</sink_obj> </item> <item class_id_reference="20" object_id="_359"> <id>566</id> <edge_type>2</edge_type> <source_obj>112</source_obj> <sink_obj>116</sink_obj> </item> <item class_id_reference="20" object_id="_360"> <id>567</id> <edge_type>2</edge_type> <source_obj>116</source_obj> <sink_obj>130</sink_obj> </item> <item class_id_reference="20" object_id="_361"> <id>568</id> <edge_type>2</edge_type> <source_obj>116</source_obj> <sink_obj>142</sink_obj> </item> <item class_id_reference="20" object_id="_362"> <id>569</id> <edge_type>2</edge_type> <source_obj>130</source_obj> <sink_obj>134</sink_obj> </item> <item class_id_reference="20" object_id="_363"> <id>570</id> <edge_type>2</edge_type> <source_obj>130</source_obj> <sink_obj>138</sink_obj> </item> <item class_id_reference="20" object_id="_364"> <id>571</id> <edge_type>2</edge_type> <source_obj>134</source_obj> <sink_obj>138</sink_obj> </item> <item class_id_reference="20" object_id="_365"> <id>572</id> <edge_type>2</edge_type> <source_obj>138</source_obj> <sink_obj>116</sink_obj> </item> <item class_id_reference="20" object_id="_366"> <id>573</id> <edge_type>2</edge_type> <source_obj>142</source_obj> <sink_obj>78</sink_obj> </item> <item class_id_reference="20" object_id="_367"> <id>574</id> <edge_type>2</edge_type> <source_obj>147</source_obj> <sink_obj>171</sink_obj> </item> <item class_id_reference="20" object_id="_368"> <id>575</id> <edge_type>2</edge_type> <source_obj>147</source_obj> <sink_obj>169</sink_obj> </item> <item class_id_reference="20" object_id="_369"> <id>576</id> <edge_type>2</edge_type> <source_obj>169</source_obj> <sink_obj>147</sink_obj> </item> <item class_id_reference="20" object_id="_370"> <id>577</id> <edge_type>4</edge_type> <source_obj>95</source_obj> <sink_obj>101</sink_obj> </item> <item class_id_reference="20" object_id="_371"> <id>578</id> <edge_type>4</edge_type> <source_obj>97</source_obj> <sink_obj>102</sink_obj> </item> <item class_id_reference="20" object_id="_372"> <id>579</id> <edge_type>4</edge_type> <source_obj>125</source_obj> <sink_obj>131</sink_obj> </item> <item class_id_reference="20" object_id="_373"> <id>580</id> <edge_type>4</edge_type> <source_obj>127</source_obj> <sink_obj>132</sink_obj> </item> </edges> </cdfg> <cdfg_regions class_id="21" tracking_level="0" version="0"> <count>11</count> <item_version>0</item_version> <item class_id="22" tracking_level="1" version="0" object_id="_374"> <mId>1</mId> <mTag>doGain</mTag> <mType>0</mType> <sub_regions> <count>5</count> <item_version>0</item_version> <item>2</item> <item>3</item> <item>4</item> <item>10</item> <item>11</item> </sub_regions> <basic_blocks> <count>0</count> <item_version>0</item_version> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>100035004</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> <item class_id_reference="22" object_id="_375"> <mId>2</mId> <mTag>Entry</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>1</count> <item_version>0</item_version> <item>40</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> <item class_id_reference="22" object_id="_376"> <mId>3</mId> <mTag>Loop 1</mTag> <mType>1</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>45</item> <item>74</item> </basic_blocks> <mII>1</mII> <mDepth>1</mDepth> <mMinTripCount>10000</mMinTripCount> <mMaxTripCount>10000</mMaxTripCount> <mMinLatency>10000</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> <item class_id_reference="22" object_id="_377"> <mId>4</mId> <mTag>Loop 2</mTag> <mType>1</mType> <sub_regions> <count>5</count> <item_version>0</item_version> <item>5</item> <item>6</item> <item>7</item> <item>8</item> <item>9</item> </sub_regions> <basic_blocks> <count>0</count> <item_version>0</item_version> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>5000</mMinTripCount> <mMaxTripCount>5000</mMaxTripCount> <mMinLatency>100015000</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> <item class_id_reference="22" object_id="_378"> <mId>5</mId> <mTag>Region 1</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>78</item> <item>82</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> <item class_id_reference="22" object_id="_379"> <mId>6</mId> <mTag>odd</mTag> <mType>1</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>4</count> <item_version>0</item_version> <item>86</item> <item>100</item> <item>104</item> <item>108</item> </basic_blocks> <mII>2</mII> <mDepth>2</mDepth> <mMinTripCount>5000</mMinTripCount> <mMaxTripCount>5000</mMaxTripCount> <mMinLatency>10000</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> <item class_id_reference="22" object_id="_380"> <mId>7</mId> <mTag>Region 2</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>1</count> <item_version>0</item_version> <item>112</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> <item class_id_reference="22" object_id="_381"> <mId>8</mId> <mTag>even</mTag> <mType>1</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>4</count> <item_version>0</item_version> <item>116</item> <item>130</item> <item>134</item> <item>138</item> </basic_blocks> <mII>2</mII> <mDepth>2</mDepth> <mMinTripCount>4999</mMinTripCount> <mMaxTripCount>4999</mMaxTripCount> <mMinLatency>9998</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> <item class_id_reference="22" object_id="_382"> <mId>9</mId> <mTag>Region 3</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>1</count> <item_version>0</item_version> <item>142</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> <item class_id_reference="22" object_id="_383"> <mId>10</mId> <mTag>Loop 3</mTag> <mType>1</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>147</item> <item>169</item> </basic_blocks> <mII>1</mII> <mDepth>2</mDepth> <mMinTripCount>10000</mMinTripCount> <mMaxTripCount>10000</mMaxTripCount> <mMinLatency>10000</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> <item class_id_reference="22" object_id="_384"> <mId>11</mId> <mTag>Return</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>1</count> <item_version>0</item_version> <item>171</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> </cdfg_regions> <fsm class_id="24" tracking_level="1" version="0" object_id="_385"> <states class_id="25" tracking_level="0" version="0"> <count>12</count> <item_version>0</item_version> <item class_id="26" tracking_level="1" version="0" object_id="_386"> <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="_387"> <id>15</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_388"> <id>16</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_389"> <id>17</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_390"> <id>18</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_391"> <id>19</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_392"> <id>20</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_393"> <id>21</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_394"> <id>22</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_395"> <id>23</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_396"> <id>24</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_397"> <id>25</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_398"> <id>26</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_399"> <id>27</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_400"> <id>28</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_401"> <id>29</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_402"> <id>30</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_403"> <id>31</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_404"> <id>32</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_405"> <id>33</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_406"> <id>34</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_407"> <id>35</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_408"> <id>36</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_409"> <id>37</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_410"> <id>38</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_411"> <id>39</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_412"> <id>2</id> <operations> <count>32</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_413"> <id>41</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_414"> <id>42</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_415"> <id>43</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_416"> <id>44</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_417"> <id>46</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_418"> <id>47</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_419"> <id>48</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_420"> <id>49</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_421"> <id>50</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_422"> <id>51</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_423"> <id>52</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_424"> <id>53</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_425"> <id>54</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_426"> <id>55</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_427"> <id>56</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_428"> <id>57</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_429"> <id>58</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_430"> <id>59</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_431"> <id>60</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_432"> <id>61</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_433"> <id>62</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_434"> <id>63</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_435"> <id>64</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_436"> <id>65</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_437"> <id>66</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_438"> <id>67</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_439"> <id>68</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_440"> <id>69</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_441"> <id>70</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_442"> <id>71</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_443"> <id>72</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_444"> <id>73</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_445"> <id>3</id> <operations> <count>6</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_446"> <id>75</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_447"> <id>76</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_448"> <id>77</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_449"> <id>79</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_450"> <id>80</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_451"> <id>81</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_452"> <id>4</id> <operations> <count>10</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_453"> <id>83</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_454"> <id>84</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_455"> <id>85</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_456"> <id>91</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_457"> <id>92</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_458"> <id>93</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_459"> <id>94</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_460"> <id>95</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_461"> <id>96</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_462"> <id>97</id> <stage>2</stage> <latency>2</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_463"> <id>5</id> <operations> <count>14</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_464"> <id>87</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_465"> <id>88</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_466"> <id>89</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_467"> <id>90</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_468"> <id>95</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_469"> <id>97</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_470"> <id>98</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_471"> <id>99</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_472"> <id>101</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_473"> <id>102</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_474"> <id>103</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_475"> <id>105</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_476"> <id>106</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_477"> <id>107</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_478"> <id>6</id> <operations> <count>3</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_479"> <id>109</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_480"> <id>110</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_481"> <id>111</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_482"> <id>7</id> <operations> <count>10</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_483"> <id>113</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_484"> <id>114</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_485"> <id>115</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_486"> <id>121</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_487"> <id>122</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_488"> <id>123</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_489"> <id>124</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_490"> <id>125</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_491"> <id>126</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_492"> <id>127</id> <stage>2</stage> <latency>2</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_493"> <id>8</id> <operations> <count>14</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_494"> <id>117</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_495"> <id>118</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_496"> <id>119</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_497"> <id>120</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_498"> <id>125</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_499"> <id>127</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_500"> <id>128</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_501"> <id>129</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_502"> <id>131</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_503"> <id>132</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_504"> <id>133</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_505"> <id>135</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_506"> <id>136</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_507"> <id>137</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_508"> <id>9</id> <operations> <count>3</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_509"> <id>139</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_510"> <id>140</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_511"> <id>141</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_512"> <id>10</id> <operations> <count>19</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_513"> <id>143</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_514"> <id>144</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_515"> <id>145</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_516"> <id>146</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_517"> <id>151</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_518"> <id>152</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_519"> <id>153</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_520"> <id>154</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_521"> <id>155</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_522"> <id>156</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_523"> <id>157</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_524"> <id>158</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_525"> <id>159</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_526"> <id>160</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_527"> <id>161</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_528"> <id>162</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_529"> <id>163</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_530"> <id>164</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_531"> <id>165</id> <stage>2</stage> <latency>2</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_532"> <id>11</id> <operations> <count>13</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_533"> <id>148</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_534"> <id>149</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_535"> <id>150</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_536"> <id>153</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_537"> <id>155</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_538"> <id>157</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_539"> <id>159</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_540"> <id>161</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_541"> <id>163</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_542"> <id>165</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_543"> <id>166</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_544"> <id>167</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_545"> <id>168</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_546"> <id>12</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_547"> <id>170</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> </states> <transitions class_id="29" tracking_level="0" version="0"> <count>16</count> <item_version>0</item_version> <item class_id="30" tracking_level="1" version="0" object_id="_548"> <inState>1</inState> <outState>2</outState> <condition class_id="31" tracking_level="0" version="0"> <id>76</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="_549"> <inState>3</inState> <outState>10</outState> <condition> <id>82</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item class_id="34" tracking_level="0" version="0"> <first class_id="35" tracking_level="0" version="0"> <first>76</first> <second>0</second> </first> <second>0</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_550"> <inState>3</inState> <outState>4</outState> <condition> <id>84</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>76</first> <second>0</second> </first> <second>1</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_551"> <inState>6</inState> <outState>7</outState> <condition> <id>92</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>9</inState> <outState>3</outState> <condition> <id>100</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>2</inState> <outState>3</outState> <condition> <id>107</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>42</first> <second>0</second> </first> <second>0</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_554"> <inState>2</inState> <outState>2</outState> <condition> <id>108</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>42</first> <second>0</second> </first> <second>1</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_555"> <inState>5</inState> <outState>4</outState> <condition> <id>110</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>4</inState> <outState>6</outState> <condition> <id>109</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>84</first> <second>0</second> </first> <second>1</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_557"> <inState>4</inState> <outState>5</outState> <condition> <id>111</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>84</first> <second>0</second> </first> <second>0</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_558"> <inState>8</inState> <outState>7</outState> <condition> <id>113</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>7</inState> <outState>9</outState> <condition> <id>112</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>114</first> <second>0</second> </first> <second>1</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_560"> <inState>7</inState> <outState>8</outState> <condition> <id>114</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>114</first> <second>0</second> </first> <second>0</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_561"> <inState>11</inState> <outState>10</outState> <condition> <id>116</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>10</inState> <outState>12</outState> <condition> <id>115</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>144</first> <second>0</second> </first> <second>0</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_563"> <inState>10</inState> <outState>11</outState> <condition> <id>117</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>144</first> <second>0</second> </first> <second>1</second> </item> </item> </sop> </condition> </item> </transitions> </fsm> <res class_id="36" tracking_level="1" version="0" object_id="_564"> <dp_component_resource class_id="37" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_component_resource> <dp_expression_resource> <count>15</count> <item_version>0</item_version> <item class_id="38" tracking_level="0" version="0"> <first>ap_sig_bdd_70 ( and ) </first> <second class_id="39" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="40" tracking_level="0" version="0"> <first>(0P0)</first> <second>1</second> </item> <item> <first>(1P1)</first> <second>1</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>1</second> </item> </second> </item> <item> <first>exitcond1_fu_385_p2 ( icmp ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>14</second> </item> <item> <first>(1P1)</first> <second>14</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>5</second> </item> </second> </item> <item> <first>exitcond2_fu_443_p2 ( icmp ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>14</second> </item> <item> <first>(1P1)</first> <second>14</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>5</second> </item> </second> </item> <item> <first>exitcond_fu_523_p2 ( icmp ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>14</second> </item> <item> <first>(1P1)</first> <second>14</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>5</second> </item> </second> </item> <item> <first>i_2_fu_477_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>14</second> </item> <item> <first>(1P1)</first> <second>2</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>14</second> </item> </second> </item> <item> <first>i_3_1_fu_511_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>14</second> </item> <item> <first>(1P1)</first> <second>2</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>14</second> </item> </second> </item> <item> <first>idx_1_fu_391_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>14</second> </item> <item> <first>(1P1)</first> <second>1</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>14</second> </item> </second> </item> <item> <first>idx_2_fu_529_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>14</second> </item> <item> <first>(1P1)</first> <second>1</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>14</second> </item> </second> </item> <item> <first>stage_1_fu_517_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>14</second> </item> <item> <first>(1P1)</first> <second>2</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>14</second> </item> </second> </item> <item> <first>tmp_10_1_fu_494_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>14</second> </item> <item> <first>(1P1)</first> <second>2</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>14</second> </item> </second> </item> <item> <first>tmp_10_fu_460_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>14</second> </item> <item> <first>(1P1)</first> <second>2</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>14</second> </item> </second> </item> <item> <first>tmp_12_1_fu_505_p2 ( icmp ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>32</second> </item> <item> <first>(1P1)</first> <second>32</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>11</second> </item> </second> </item> <item> <first>tmp_6_fu_471_p2 ( icmp ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>32</second> </item> <item> <first>(1P1)</first> <second>32</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>11</second> </item> </second> </item> <item> <first>tmp_8_fu_449_p2 ( icmp ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>14</second> </item> <item> <first>(1P1)</first> <second>14</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>5</second> </item> </second> </item> <item> <first>tmp_9_1_fu_483_p2 ( icmp ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>14</second> </item> <item> <first>(1P1)</first> <second>14</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>5</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>7</count> <item_version>0</item_version> <item> <first>valIn_data_V_U</first> <second> <count>7</count> <item_version>0</item_version> <item> <first>(0Words)</first> <second>10000</second> </item> <item> <first>(1Bits)</first> <second>32</second> </item> <item> <first>(2Banks)</first> <second>1</second> </item> <item> <first>(3W*Bits*Banks)</first> <second>320000</second> </item> <item> <first>BRAM</first> <second>32</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>0</second> </item> </second> </item> <item> <first>valIn_dest_V_U</first> <second> <count>7</count> <item_version>0</item_version> <item> <first>(0Words)</first> <second>10000</second> </item> <item> <first>(1Bits)</first> <second>6</second> </item> <item> <first>(2Banks)</first> <second>1</second> </item> <item> <first>(3W*Bits*Banks)</first> <second>60000</second> </item> <item> <first>BRAM</first> <second>6</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>0</second> </item> </second> </item> <item> <first>valIn_id_V_U</first> <second> <count>7</count> <item_version>0</item_version> <item> <first>(0Words)</first> <second>10000</second> </item> <item> <first>(1Bits)</first> <second>5</second> </item> <item> <first>(2Banks)</first> <second>1</second> </item> <item> <first>(3W*Bits*Banks)</first> <second>50000</second> </item> <item> <first>BRAM</first> <second>5</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>0</second> </item> </second> </item> <item> <first>valIn_keep_V_U</first> <second> <count>7</count> <item_version>0</item_version> <item> <first>(0Words)</first> <second>10000</second> </item> <item> <first>(1Bits)</first> <second>4</second> </item> <item> <first>(2Banks)</first> <second>1</second> </item> <item> <first>(3W*Bits*Banks)</first> <second>40000</second> </item> <item> <first>BRAM</first> <second>4</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>0</second> </item> </second> </item> <item> <first>valIn_last_V_U</first> <second> <count>7</count> <item_version>0</item_version> <item> <first>(0Words)</first> <second>10000</second> </item> <item> <first>(1Bits)</first> <second>1</second> </item> <item> <first>(2Banks)</first> <second>1</second> </item> <item> <first>(3W*Bits*Banks)</first> <second>10000</second> </item> <item> <first>BRAM</first> <second>1</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>0</second> </item> </second> </item> <item> <first>valIn_strb_V_U</first> <second> <count>7</count> <item_version>0</item_version> <item> <first>(0Words)</first> <second>10000</second> </item> <item> <first>(1Bits)</first> <second>4</second> </item> <item> <first>(2Banks)</first> <second>1</second> </item> <item> <first>(3W*Bits*Banks)</first> <second>40000</second> </item> <item> <first>BRAM</first> <second>4</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>0</second> </item> </second> </item> <item> <first>valIn_user_V_U</first> <second> <count>7</count> <item_version>0</item_version> <item> <first>(0Words)</first> <second>10000</second> </item> <item> <first>(1Bits)</first> <second>2</second> </item> <item> <first>(2Banks)</first> <second>1</second> </item> <item> <first>(3W*Bits*Banks)</first> <second>20000</second> </item> <item> <first>BRAM</first> <second>2</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>0</second> </item> </second> </item> </dp_memory_resource> <dp_multiplexer_resource> <count>17</count> <item_version>0</item_version> <item> <first>ap_NS_fsm</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>12</second> </item> <item> <first>(1Bits)</first> <second>1</second> </item> <item> <first>(2Count)</first> <second>12</second> </item> <item> <first>LUT</first> <second>6</second> </item> </second> </item> <item> <first>ap_sig_ioackin_outStream_TREADY</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>1</second> </item> <item> <first>(2Count)</first> <second>2</second> </item> <item> <first>LUT</first> <second>1</second> </item> </second> </item> <item> <first>i_1_reg_350</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>14</second> </item> <item> <first>(2Count)</first> <second>28</second> </item> <item> <first>LUT</first> <second>14</second> </item> </second> </item> <item> <first>i_s_reg_362</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>14</second> </item> <item> <first>(2Count)</first> <second>28</second> </item> <item> <first>LUT</first> <second>14</second> </item> </second> </item> <item> <first>idx2_reg_374</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>14</second> </item> <item> <first>(2Count)</first> <second>28</second> </item> <item> <first>LUT</first> <second>14</second> </item> </second> </item> <item> <first>idx_reg_327</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>14</second> </item> <item> <first>(2Count)</first> <second>28</second> </item> <item> <first>LUT</first> <second>14</second> </item> </second> </item> <item> <first>stage1_reg_338</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>14</second> </item> <item> <first>(2Count)</first> <second>28</second> </item> <item> <first>LUT</first> <second>14</second> </item> </second> </item> <item> <first>valIn_data_V_address0</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>6</second> </item> <item> <first>(1Bits)</first> <second>14</second> </item> <item> <first>(2Count)</first> <second>84</second> </item> <item> <first>LUT</first> <second>14</second> </item> </second> </item> <item> <first>valIn_data_V_address1</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>6</second> </item> <item> <first>(1Bits)</first> <second>14</second> </item> <item> <first>(2Count)</first> <second>84</second> </item> <item> <first>LUT</first> <second>14</second> </item> </second> </item> <item> <first>valIn_data_V_d0</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>4</second> </item> <item> <first>(1Bits)</first> <second>32</second> </item> <item> <first>(2Count)</first> <second>128</second> </item> <item> <first>LUT</first> <second>32</second> </item> </second> </item> <item> <first>valIn_data_V_d1</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>32</second> </item> <item> <first>(2Count)</first> <second>96</second> </item> <item> <first>LUT</first> <second>32</second> </item> </second> </item> <item> <first>valIn_dest_V_address0</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>14</second> </item> <item> <first>(2Count)</first> <second>42</second> </item> <item> <first>LUT</first> <second>14</second> </item> </second> </item> <item> <first>valIn_id_V_address0</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>14</second> </item> <item> <first>(2Count)</first> <second>42</second> </item> <item> <first>LUT</first> <second>14</second> </item> </second> </item> <item> <first>valIn_keep_V_address0</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>14</second> </item> <item> <first>(2Count)</first> <second>42</second> </item> <item> <first>LUT</first> <second>14</second> </item> </second> </item> <item> <first>valIn_last_V_address0</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>14</second> </item> <item> <first>(2Count)</first> <second>42</second> </item> <item> <first>LUT</first> <second>14</second> </item> </second> </item> <item> <first>valIn_strb_V_address0</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>14</second> </item> <item> <first>(2Count)</first> <second>42</second> </item> <item> <first>LUT</first> <second>14</second> </item> </second> </item> <item> <first>valIn_user_V_address0</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>14</second> </item> <item> <first>(2Count)</first> <second>42</second> </item> <item> <first>LUT</first> <second>14</second> </item> </second> </item> </dp_multiplexer_resource> <dp_register_resource> <count>14</count> <item_version>0</item_version> <item> <first>ap_CS_fsm</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>11</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>11</second> </item> </second> </item> <item> <first>ap_reg_ioackin_outStream_TREADY</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>1</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>1</second> </item> </second> </item> <item> <first>ap_reg_ppiten_pp3_it0</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>1</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>1</second> </item> </second> </item> <item> <first>ap_reg_ppiten_pp3_it1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>1</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>1</second> </item> </second> </item> <item> <first>exitcond_reg_607</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>1</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>1</second> </item> </second> </item> <item> <first>i_1_reg_350</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>14</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>14</second> </item> </second> </item> <item> <first>i_s_reg_362</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>14</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>14</second> </item> </second> </item> <item> <first>idx2_reg_374</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>14</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>14</second> </item> </second> </item> <item> <first>idx_reg_327</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>14</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>14</second> </item> </second> </item> <item> <first>stage1_reg_338</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>14</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>14</second> </item> </second> </item> <item> <first>valIn_data_V_addr_2_reg_561</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>14</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>14</second> </item> </second> </item> <item> <first>valIn_data_V_addr_3_reg_567</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>14</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>14</second> </item> </second> </item> <item> <first>valIn_data_V_addr_4_reg_584</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>14</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>14</second> </item> </second> </item> <item> <first>valIn_data_V_addr_5_reg_589</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>14</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>14</second> </item> </second> </item> </dp_register_resource> <dp_component_map class_id="41" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_component_map> <dp_expression_map> <count>14</count> <item_version>0</item_version> <item class_id="42" tracking_level="0" version="0"> <first>exitcond1_fu_385_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>exitcond2_fu_443_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>76</item> </second> </item> <item> <first>exitcond_fu_523_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>144</item> </second> </item> <item> <first>i_2_fu_477_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>106</item> </second> </item> <item> <first>i_3_1_fu_511_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>136</item> </second> </item> <item> <first>idx_1_fu_391_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>idx_2_fu_529_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>145</item> </second> </item> <item> <first>stage_1_fu_517_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>140</item> </second> </item> <item> <first>tmp_10_1_fu_494_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>122</item> </second> </item> <item> <first>tmp_10_fu_460_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>92</item> </second> </item> <item> <first>tmp_12_1_fu_505_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>128</item> </second> </item> <item> <first>tmp_6_fu_471_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>98</item> </second> </item> <item> <first>tmp_8_fu_449_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>84</item> </second> </item> <item> <first>tmp_9_1_fu_483_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>114</item> </second> </item> </dp_expression_map> <dp_fifo_map> <count>0</count> <item_version>0</item_version> </dp_fifo_map> <dp_memory_map> <count>7</count> <item_version>0</item_version> <item> <first>valIn_data_V_U</first> <second> <count>1</count> <item_version>0</item_version> <item>187</item> </second> </item> <item> <first>valIn_dest_V_U</first> <second> <count>1</count> <item_version>0</item_version> <item>251</item> </second> </item> <item> <first>valIn_id_V_U</first> <second> <count>1</count> <item_version>0</item_version> <item>241</item> </second> </item> <item> <first>valIn_keep_V_U</first> <second> <count>1</count> <item_version>0</item_version> <item>202</item> </second> </item> <item> <first>valIn_last_V_U</first> <second> <count>1</count> <item_version>0</item_version> <item>231</item> </second> </item> <item> <first>valIn_strb_V_U</first> <second> <count>1</count> <item_version>0</item_version> <item>211</item> </second> </item> <item> <first>valIn_user_V_U</first> <second> <count>1</count> <item_version>0</item_version> <item>221</item> </second> </item> </dp_memory_map> </res> <node_label_latency class_id="43" tracking_level="0" version="0"> <count>99</count> <item_version>0</item_version> <item class_id="44" tracking_level="0" version="0"> <first>30</first> <second class_id="45" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>31</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>32</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>33</first> <second> <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>39</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>41</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>42</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>43</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>44</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>49</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>50</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>51</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>52</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>53</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>54</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>55</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>56</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>57</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>58</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>59</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>60</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>61</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>62</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>63</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>64</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>65</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>66</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>67</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>68</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>69</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>70</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>71</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>73</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>75</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>76</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>77</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>81</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>83</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>84</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>85</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>91</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>92</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>93</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>94</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>95</first> <second> <first>3</first> <second>1</second> </second> </item> <item> <first>96</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>97</first> <second> <first>3</first> <second>1</second> </second> </item> <item> <first>98</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>99</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>101</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>102</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>103</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>106</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>107</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>111</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>113</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>114</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>115</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>121</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>122</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>123</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>124</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>125</first> <second> <first>5</first> <second>1</second> </second> </item> <item> <first>126</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>127</first> <second> <first>5</first> <second>1</second> </second> </item> <item> <first>128</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>129</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>131</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>132</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>133</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>136</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>137</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>140</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>141</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>143</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>144</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>145</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>146</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>151</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>152</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>153</first> <second> <first>3</first> <second>1</second> </second> </item> <item> <first>154</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>155</first> <second> <first>3</first> <second>1</second> </second> </item> <item> <first>156</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>157</first> <second> <first>3</first> <second>1</second> </second> </item> <item> <first>158</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>159</first> <second> <first>3</first> <second>1</second> </second> </item> <item> <first>160</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>161</first> <second> <first>3</first> <second>1</second> </second> </item> <item> <first>162</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>163</first> <second> <first>3</first> <second>1</second> </second> </item> <item> <first>164</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>165</first> <second> <first>3</first> <second>1</second> </second> </item> <item> <first>166</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>168</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>170</first> <second> <first>4</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="46" tracking_level="0" version="0"> <count>18</count> <item_version>0</item_version> <item class_id="47" tracking_level="0" version="0"> <first>40</first> <second class_id="48" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>45</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>74</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>78</first> <second> <first>2</first> <second>2</second> </second> </item> <item> <first>82</first> <second> <first>2</first> <second>2</second> </second> </item> <item> <first>86</first> <second> <first>3</first> <second>3</second> </second> </item> <item> <first>100</first> <second> <first>3</first> <second>4</second> </second> </item> <item> <first>104</first> <second> <first>4</first> <second>4</second> </second> </item> <item> <first>108</first> <second> <first>4</first> <second>4</second> </second> </item> <item> <first>112</first> <second> <first>4</first> <second>4</second> </second> </item> <item> <first>116</first> <second> <first>5</first> <second>5</second> </second> </item> <item> <first>130</first> <second> <first>5</first> <second>6</second> </second> </item> <item> <first>134</first> <second> <first>6</first> <second>6</second> </second> </item> <item> <first>138</first> <second> <first>6</first> <second>6</second> </second> </item> <item> <first>142</first> <second> <first>6</first> <second>6</second> </second> </item> <item> <first>147</first> <second> <first>3</first> <second>3</second> </second> </item> <item> <first>169</first> <second> <first>3</first> <second>4</second> </second> </item> <item> <first>171</first> <second> <first>4</first> <second>4</second> </second> </item> </bblk_ent_exit> <regions class_id="49" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="50" tracking_level="1" version="0" object_id="_565"> <region_name>Loop 3</region_name> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>147</item> <item>169</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>2</pipe_depth> </item> <item class_id_reference="50" object_id="_566"> <region_name>Loop 1</region_name> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>45</item> <item>74</item> </basic_blocks> <nodes> <count>0</count> <item_version>0</item_version> </nodes> <anchor_node>-1</anchor_node> <region_type>8</region_type> <interval>1</interval> <pipe_depth>1</pipe_depth> </item> <item class_id_reference="50" object_id="_567"> <region_name>even</region_name> <basic_blocks> <count>4</count> <item_version>0</item_version> <item>116</item> <item>130</item> <item>134</item> <item>138</item> </basic_blocks> <nodes> <count>0</count> <item_version>0</item_version> </nodes> <anchor_node>-1</anchor_node> <region_type>8</region_type> <interval>2</interval> <pipe_depth>2</pipe_depth> </item> <item class_id_reference="50" object_id="_568"> <region_name>odd</region_name> <basic_blocks> <count>4</count> <item_version>0</item_version> <item>86</item> <item>100</item> <item>104</item> <item>108</item> </basic_blocks> <nodes> <count>0</count> <item_version>0</item_version> </nodes> <anchor_node>-1</anchor_node> <region_type>8</region_type> <interval>2</interval> <pipe_depth>2</pipe_depth> </item> </regions> <dp_fu_nodes class_id="51" tracking_level="0" version="0"> <count>66</count> <item_version>0</item_version> <item class_id="52" tracking_level="0" version="0"> <first>88</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>92</first> <second> <count>1</count> <item_version>0</item_version> <item>31</item> </second> </item> <item> <first>96</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>100</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>104</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>108</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>112</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>116</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>134</first> <second> <count>1</count> <item_version>0</item_version> <item>166</item> </second> </item> <item> <first>159</first> <second> <count>1</count> <item_version>0</item_version> <item>58</item> </second> </item> <item> <first>165</first> <second> <count>15</count> <item_version>0</item_version> <item>59</item> <item>95</item> <item>95</item> <item>97</item> <item>97</item> <item>101</item> <item>102</item> <item>125</item> <item>125</item> <item>127</item> <item>127</item> <item>131</item> <item>132</item> <item>153</item> <item>153</item> </second> </item> <item> <first>170</first> <second> <count>1</count> <item_version>0</item_version> <item>60</item> </second> </item> <item> <first>176</first> <second> <count>3</count> <item_version>0</item_version> <item>61</item> <item>155</item> <item>155</item> </second> </item> <item> <first>181</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>187</first> <second> <count>3</count> <item_version>0</item_version> <item>63</item> <item>157</item> <item>157</item> </second> </item> <item> <first>192</first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> <item> <first>198</first> <second> <count>3</count> <item_version>0</item_version> <item>65</item> <item>159</item> <item>159</item> </second> </item> <item> <first>203</first> <second> <count>1</count> <item_version>0</item_version> <item>66</item> </second> </item> <item> <first>209</first> <second> <count>3</count> <item_version>0</item_version> <item>67</item> <item>161</item> <item>161</item> </second> </item> <item> <first>214</first> <second> <count>1</count> <item_version>0</item_version> <item>68</item> </second> </item> <item> <first>220</first> <second> <count>3</count> <item_version>0</item_version> <item>69</item> <item>163</item> <item>163</item> </second> </item> <item> <first>225</first> <second> <count>1</count> <item_version>0</item_version> <item>70</item> </second> </item> <item> <first>231</first> <second> <count>3</count> <item_version>0</item_version> <item>71</item> <item>165</item> <item>165</item> </second> </item> <item> <first>236</first> <second> <count>1</count> <item_version>0</item_version> <item>94</item> </second> </item> <item> <first>243</first> <second> <count>1</count> <item_version>0</item_version> <item>96</item> </second> </item> <item> <first>255</first> <second> <count>1</count> <item_version>0</item_version> <item>124</item> </second> </item> <item> <first>262</first> <second> <count>1</count> <item_version>0</item_version> <item>126</item> </second> </item> <item> <first>271</first> <second> <count>1</count> <item_version>0</item_version> <item>152</item> </second> </item> <item> <first>279</first> <second> <count>1</count> <item_version>0</item_version> <item>154</item> </second> </item> <item> <first>287</first> <second> <count>1</count> <item_version>0</item_version> <item>156</item> </second> </item> <item> <first>295</first> <second> <count>1</count> <item_version>0</item_version> <item>158</item> </second> </item> <item> <first>303</first> <second> <count>1</count> <item_version>0</item_version> <item>160</item> </second> </item> <item> <first>311</first> <second> <count>1</count> <item_version>0</item_version> <item>162</item> </second> </item> <item> <first>319</first> <second> <count>1</count> <item_version>0</item_version> <item>164</item> </second> </item> <item> <first>331</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>342</first> <second> <count>1</count> <item_version>0</item_version> <item>75</item> </second> </item> <item> <first>354</first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>366</first> <second> <count>1</count> <item_version>0</item_version> <item>113</item> </second> </item> <item> <first>378</first> <second> <count>1</count> <item_version>0</item_version> <item>143</item> </second> </item> <item> <first>385</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>391</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>397</first> <second> <count>1</count> <item_version>0</item_version> <item>49</item> </second> </item> <item> <first>408</first> <second> <count>1</count> <item_version>0</item_version> <item>51</item> </second> </item> <item> <first>413</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>418</first> <second> <count>1</count> <item_version>0</item_version> <item>53</item> </second> </item> <item> <first>423</first> <second> <count>1</count> <item_version>0</item_version> <item>54</item> </second> </item> <item> <first>428</first> <second> <count>1</count> <item_version>0</item_version> <item>55</item> </second> </item> <item> <first>433</first> <second> <count>1</count> <item_version>0</item_version> <item>56</item> </second> </item> <item> <first>438</first> <second> <count>1</count> <item_version>0</item_version> <item>57</item> </second> </item> <item> <first>443</first> <second> <count>1</count> <item_version>0</item_version> <item>76</item> </second> </item> <item> <first>449</first> <second> <count>1</count> <item_version>0</item_version> <item>84</item> </second> </item> <item> <first>455</first> <second> <count>1</count> <item_version>0</item_version> <item>91</item> </second> </item> <item> <first>460</first> <second> <count>1</count> <item_version>0</item_version> <item>92</item> </second> </item> <item> <first>466</first> <second> <count>1</count> <item_version>0</item_version> <item>93</item> </second> </item> <item> <first>471</first> <second> <count>1</count> <item_version>0</item_version> <item>98</item> </second> </item> <item> <first>477</first> <second> <count>1</count> <item_version>0</item_version> <item>106</item> </second> </item> <item> <first>483</first> <second> <count>1</count> <item_version>0</item_version> <item>114</item> </second> </item> <item> <first>489</first> <second> <count>1</count> <item_version>0</item_version> <item>121</item> </second> </item> <item> <first>494</first> <second> <count>1</count> <item_version>0</item_version> <item>122</item> </second> </item> <item> <first>500</first> <second> <count>1</count> <item_version>0</item_version> <item>123</item> </second> </item> <item> <first>505</first> <second> <count>1</count> <item_version>0</item_version> <item>128</item> </second> </item> <item> <first>511</first> <second> <count>1</count> <item_version>0</item_version> <item>136</item> </second> </item> <item> <first>517</first> <second> <count>1</count> <item_version>0</item_version> <item>140</item> </second> </item> <item> <first>523</first> <second> <count>1</count> <item_version>0</item_version> <item>144</item> </second> </item> <item> <first>529</first> <second> <count>1</count> <item_version>0</item_version> <item>145</item> </second> </item> <item> <first>535</first> <second> <count>1</count> <item_version>0</item_version> <item>151</item> </second> </item> </dp_fu_nodes> <dp_fu_nodes_expression class_id="54" tracking_level="0" version="0"> <count>57</count> <item_version>0</item_version> <item class_id="55" tracking_level="0" version="0"> <first>exitcond1_fu_385</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>exitcond2_fu_443</first> <second> <count>1</count> <item_version>0</item_version> <item>76</item> </second> </item> <item> <first>exitcond_fu_523</first> <second> <count>1</count> <item_version>0</item_version> <item>144</item> </second> </item> <item> <first>i_1_phi_fu_354</first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>i_2_fu_477</first> <second> <count>1</count> <item_version>0</item_version> <item>106</item> </second> </item> <item> <first>i_3_1_fu_511</first> <second> <count>1</count> <item_version>0</item_version> <item>136</item> </second> </item> <item> <first>i_s_phi_fu_366</first> <second> <count>1</count> <item_version>0</item_version> <item>113</item> </second> </item> <item> <first>idx2_phi_fu_378</first> <second> <count>1</count> <item_version>0</item_version> <item>143</item> </second> </item> <item> <first>idx_1_fu_391</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>idx_2_fu_529</first> <second> <count>1</count> <item_version>0</item_version> <item>145</item> </second> </item> <item> <first>idx_phi_fu_331</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>stage1_phi_fu_342</first> <second> <count>1</count> <item_version>0</item_version> <item>75</item> </second> </item> <item> <first>stage_1_fu_517</first> <second> <count>1</count> <item_version>0</item_version> <item>140</item> </second> </item> <item> <first>tmp_10_1_fu_494</first> <second> <count>1</count> <item_version>0</item_version> <item>122</item> </second> </item> <item> <first>tmp_10_fu_460</first> <second> <count>1</count> <item_version>0</item_version> <item>92</item> </second> </item> <item> <first>tmp_11_1_fu_500</first> <second> <count>1</count> <item_version>0</item_version> <item>123</item> </second> </item> <item> <first>tmp_11_fu_466</first> <second> <count>1</count> <item_version>0</item_version> <item>93</item> </second> </item> <item> <first>tmp_12_1_fu_505</first> <second> <count>1</count> <item_version>0</item_version> <item>128</item> </second> </item> <item> <first>tmp_5_fu_535</first> <second> <count>1</count> <item_version>0</item_version> <item>151</item> </second> </item> <item> <first>tmp_6_fu_471</first> <second> <count>1</count> <item_version>0</item_version> <item>98</item> </second> </item> <item> <first>tmp_7_1_fu_489</first> <second> <count>1</count> <item_version>0</item_version> <item>121</item> </second> </item> <item> <first>tmp_8_fu_449</first> <second> <count>1</count> <item_version>0</item_version> <item>84</item> </second> </item> <item> <first>tmp_9_1_fu_483</first> <second> <count>1</count> <item_version>0</item_version> <item>114</item> </second> </item> <item> <first>tmp_data_V_fu_408</first> <second> <count>1</count> <item_version>0</item_version> <item>51</item> </second> </item> <item> <first>tmp_dest_V_fu_438</first> <second> <count>1</count> <item_version>0</item_version> <item>57</item> </second> </item> <item> <first>tmp_fu_397</first> <second> <count>1</count> <item_version>0</item_version> <item>49</item> </second> </item> <item> <first>tmp_id_V_fu_433</first> <second> <count>1</count> <item_version>0</item_version> <item>56</item> </second> </item> <item> <first>tmp_keep_V_fu_413</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>tmp_last_V_fu_428</first> <second> <count>1</count> <item_version>0</item_version> <item>55</item> </second> </item> <item> <first>tmp_s_fu_455</first> <second> <count>1</count> <item_version>0</item_version> <item>91</item> </second> </item> <item> <first>tmp_strb_V_fu_418</first> <second> <count>1</count> <item_version>0</item_version> <item>53</item> </second> </item> <item> <first>tmp_user_V_fu_423</first> <second> <count>1</count> <item_version>0</item_version> <item>54</item> </second> </item> <item> <first>valIn_data_V_addr_1_gep_fu_271</first> <second> <count>1</count> <item_version>0</item_version> <item>152</item> </second> </item> <item> <first>valIn_data_V_addr_2_gep_fu_236</first> <second> <count>1</count> <item_version>0</item_version> <item>94</item> </second> </item> <item> <first>valIn_data_V_addr_3_gep_fu_243</first> <second> <count>1</count> <item_version>0</item_version> <item>96</item> </second> </item> <item> <first>valIn_data_V_addr_4_gep_fu_255</first> <second> <count>1</count> <item_version>0</item_version> <item>124</item> </second> </item> <item> <first>valIn_data_V_addr_5_gep_fu_262</first> <second> <count>1</count> <item_version>0</item_version> <item>126</item> </second> </item> <item> <first>valIn_data_V_addr_gep_fu_159</first> <second> <count>1</count> <item_version>0</item_version> <item>58</item> </second> </item> <item> <first>valIn_data_V_alloca_fu_88</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>valIn_dest_V_addr_1_gep_fu_319</first> <second> <count>1</count> <item_version>0</item_version> <item>164</item> </second> </item> <item> <first>valIn_dest_V_addr_gep_fu_225</first> <second> <count>1</count> <item_version>0</item_version> <item>70</item> </second> </item> <item> <first>valIn_dest_V_alloca_fu_112</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>valIn_id_V_addr_1_gep_fu_311</first> <second> <count>1</count> <item_version>0</item_version> <item>162</item> </second> </item> <item> <first>valIn_id_V_addr_gep_fu_214</first> <second> <count>1</count> <item_version>0</item_version> <item>68</item> </second> </item> <item> <first>valIn_id_V_alloca_fu_108</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>valIn_keep_V_addr_1_gep_fu_279</first> <second> <count>1</count> <item_version>0</item_version> <item>154</item> </second> </item> <item> <first>valIn_keep_V_addr_gep_fu_170</first> <second> <count>1</count> <item_version>0</item_version> <item>60</item> </second> </item> <item> <first>valIn_keep_V_alloca_fu_92</first> <second> <count>1</count> <item_version>0</item_version> <item>31</item> </second> </item> <item> <first>valIn_last_V_addr_1_gep_fu_303</first> <second> <count>1</count> <item_version>0</item_version> <item>160</item> </second> </item> <item> <first>valIn_last_V_addr_gep_fu_203</first> <second> <count>1</count> <item_version>0</item_version> <item>66</item> </second> </item> <item> <first>valIn_last_V_alloca_fu_104</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>valIn_strb_V_addr_1_gep_fu_287</first> <second> <count>1</count> <item_version>0</item_version> <item>156</item> </second> </item> <item> <first>valIn_strb_V_addr_gep_fu_181</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>valIn_strb_V_alloca_fu_96</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>valIn_user_V_addr_1_gep_fu_295</first> <second> <count>1</count> <item_version>0</item_version> <item>158</item> </second> </item> <item> <first>valIn_user_V_addr_gep_fu_192</first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> <item> <first>valIn_user_V_alloca_fu_100</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> </dp_fu_nodes_expression> <dp_fu_nodes_module> <count>0</count> <item_version>0</item_version> </dp_fu_nodes_module> <dp_fu_nodes_io> <count>2</count> <item_version>0</item_version> <item> <first>empty_3_read_fu_116</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>stg_159_write_fu_134</first> <second> <count>1</count> <item_version>0</item_version> <item>166</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="56" tracking_level="0" version="0"> <count>8</count> <item_version>0</item_version> <item class_id="57" tracking_level="0" version="0"> <first class_id="58" tracking_level="0" version="0"> <first>valIn_data_V</first> <second>0</second> </first> <second> <count>7</count> <item_version>0</item_version> <item>59</item> <item>95</item> <item>95</item> <item>102</item> <item>127</item> <item>127</item> <item>132</item> </second> </item> <item> <first> <first>valIn_data_V</first> <second>1</second> </first> <second> <count>8</count> <item_version>0</item_version> <item>97</item> <item>97</item> <item>101</item> <item>125</item> <item>125</item> <item>131</item> <item>153</item> <item>153</item> </second> </item> <item> <first> <first>valIn_dest_V</first> <second>0</second> </first> <second> <count>3</count> <item_version>0</item_version> <item>71</item> <item>165</item> <item>165</item> </second> </item> <item> <first> <first>valIn_id_V</first> <second>0</second> </first> <second> <count>3</count> <item_version>0</item_version> <item>69</item> <item>163</item> <item>163</item> </second> </item> <item> <first> <first>valIn_keep_V</first> <second>0</second> </first> <second> <count>3</count> <item_version>0</item_version> <item>61</item> <item>155</item> <item>155</item> </second> </item> <item> <first> <first>valIn_last_V</first> <second>0</second> </first> <second> <count>3</count> <item_version>0</item_version> <item>67</item> <item>161</item> <item>161</item> </second> </item> <item> <first> <first>valIn_strb_V</first> <second>0</second> </first> <second> <count>3</count> <item_version>0</item_version> <item>63</item> <item>157</item> <item>157</item> </second> </item> <item> <first> <first>valIn_user_V</first> <second>0</second> </first> <second> <count>3</count> <item_version>0</item_version> <item>65</item> <item>159</item> <item>159</item> </second> </item> </dp_mem_port_nodes> <dp_reg_nodes> <count>23</count> <item_version>0</item_version> <item> <first>327</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>338</first> <second> <count>1</count> <item_version>0</item_version> <item>75</item> </second> </item> <item> <first>350</first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>362</first> <second> <count>1</count> <item_version>0</item_version> <item>113</item> </second> </item> <item> <first>374</first> <second> <count>1</count> <item_version>0</item_version> <item>143</item> </second> </item> <item> <first>549</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>554</first> <second> <count>1</count> <item_version>0</item_version> <item>76</item> </second> </item> <item> <first>561</first> <second> <count>1</count> <item_version>0</item_version> <item>94</item> </second> </item> <item> <first>567</first> <second> <count>1</count> <item_version>0</item_version> <item>96</item> </second> </item> <item> <first>576</first> <second> <count>1</count> <item_version>0</item_version> <item>106</item> </second> </item> <item> <first>584</first> <second> <count>1</count> <item_version>0</item_version> <item>124</item> </second> </item> <item> <first>589</first> <second> <count>1</count> <item_version>0</item_version> <item>126</item> </second> </item> <item> <first>597</first> <second> <count>1</count> <item_version>0</item_version> <item>136</item> </second> </item> <item> <first>602</first> <second> <count>1</count> <item_version>0</item_version> <item>140</item> </second> </item> <item> <first>607</first> <second> <count>1</count> <item_version>0</item_version> <item>144</item> </second> </item> <item> <first>611</first> <second> <count>1</count> <item_version>0</item_version> <item>145</item> </second> </item> <item> <first>616</first> <second> <count>1</count> <item_version>0</item_version> <item>152</item> </second> </item> <item> <first>621</first> <second> <count>1</count> <item_version>0</item_version> <item>154</item> </second> </item> <item> <first>626</first> <second> <count>1</count> <item_version>0</item_version> <item>156</item> </second> </item> <item> <first>631</first> <second> <count>1</count> <item_version>0</item_version> <item>158</item> </second> </item> <item> <first>636</first> <second> <count>1</count> <item_version>0</item_version> <item>160</item> </second> </item> <item> <first>641</first> <second> <count>1</count> <item_version>0</item_version> <item>162</item> </second> </item> <item> <first>646</first> <second> <count>1</count> <item_version>0</item_version> <item>164</item> </second> </item> </dp_reg_nodes> <dp_regname_nodes> <count>23</count> <item_version>0</item_version> <item> <first>exitcond2_reg_554</first> <second> <count>1</count> <item_version>0</item_version> <item>76</item> </second> </item> <item> <first>exitcond_reg_607</first> <second> <count>1</count> <item_version>0</item_version> <item>144</item> </second> </item> <item> <first>i_1_reg_350</first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>i_2_reg_576</first> <second> <count>1</count> <item_version>0</item_version> <item>106</item> </second> </item> <item> <first>i_3_1_reg_597</first> <second> <count>1</count> <item_version>0</item_version> <item>136</item> </second> </item> <item> <first>i_s_reg_362</first> <second> <count>1</count> <item_version>0</item_version> <item>113</item> </second> </item> <item> <first>idx2_reg_374</first> <second> <count>1</count> <item_version>0</item_version> <item>143</item> </second> </item> <item> <first>idx_1_reg_549</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>idx_2_reg_611</first> <second> <count>1</count> <item_version>0</item_version> <item>145</item> </second> </item> <item> <first>idx_reg_327</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>stage1_reg_338</first> <second> <count>1</count> <item_version>0</item_version> <item>75</item> </second> </item> <item> <first>stage_1_reg_602</first> <second> <count>1</count> <item_version>0</item_version> <item>140</item> </second> </item> <item> <first>valIn_data_V_addr_1_reg_616</first> <second> <count>1</count> <item_version>0</item_version> <item>152</item> </second> </item> <item> <first>valIn_data_V_addr_2_reg_561</first> <second> <count>1</count> <item_version>0</item_version> <item>94</item> </second> </item> <item> <first>valIn_data_V_addr_3_reg_567</first> <second> <count>1</count> <item_version>0</item_version> <item>96</item> </second> </item> <item> <first>valIn_data_V_addr_4_reg_584</first> <second> <count>1</count> <item_version>0</item_version> <item>124</item> </second> </item> <item> <first>valIn_data_V_addr_5_reg_589</first> <second> <count>1</count> <item_version>0</item_version> <item>126</item> </second> </item> <item> <first>valIn_dest_V_addr_1_reg_646</first> <second> <count>1</count> <item_version>0</item_version> <item>164</item> </second> </item> <item> <first>valIn_id_V_addr_1_reg_641</first> <second> <count>1</count> <item_version>0</item_version> <item>162</item> </second> </item> <item> <first>valIn_keep_V_addr_1_reg_621</first> <second> <count>1</count> <item_version>0</item_version> <item>154</item> </second> </item> <item> <first>valIn_last_V_addr_1_reg_636</first> <second> <count>1</count> <item_version>0</item_version> <item>160</item> </second> </item> <item> <first>valIn_strb_V_addr_1_reg_626</first> <second> <count>1</count> <item_version>0</item_version> <item>156</item> </second> </item> <item> <first>valIn_user_V_addr_1_reg_631</first> <second> <count>1</count> <item_version>0</item_version> <item>158</item> </second> </item> </dp_regname_nodes> <dp_reg_phi> <count>5</count> <item_version>0</item_version> <item> <first>327</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>338</first> <second> <count>1</count> <item_version>0</item_version> <item>75</item> </second> </item> <item> <first>350</first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>362</first> <second> <count>1</count> <item_version>0</item_version> <item>113</item> </second> </item> <item> <first>374</first> <second> <count>1</count> <item_version>0</item_version> <item>143</item> </second> </item> </dp_reg_phi> <dp_regname_phi> <count>5</count> <item_version>0</item_version> <item> <first>i_1_reg_350</first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>i_s_reg_362</first> <second> <count>1</count> <item_version>0</item_version> <item>113</item> </second> </item> <item> <first>idx2_reg_374</first> <second> <count>1</count> <item_version>0</item_version> <item>143</item> </second> </item> <item> <first>idx_reg_327</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>stage1_reg_338</first> <second> <count>1</count> <item_version>0</item_version> <item>75</item> </second> </item> </dp_regname_phi> <dp_port_io_nodes class_id="59" tracking_level="0" version="0"> <count>14</count> <item_version>0</item_version> <item class_id="60" tracking_level="0" version="0"> <first>inStream_V_data_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> </second> </item> <item> <first>inStream_V_dest_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> </second> </item> <item> <first>inStream_V_id_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> </second> </item> <item> <first>inStream_V_keep_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> </second> </item> <item> <first>inStream_V_last_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> </second> </item> <item> <first>inStream_V_strb_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> </second> </item> <item> <first>inStream_V_user_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> </second> </item> <item> <first>outStream_V_data_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>1</count> <item_version>0</item_version> <item>166</item> </second> </item> </second> </item> <item> <first>outStream_V_dest_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>1</count> <item_version>0</item_version> <item>166</item> </second> </item> </second> </item> <item> <first>outStream_V_id_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>1</count> <item_version>0</item_version> <item>166</item> </second> </item> </second> </item> <item> <first>outStream_V_keep_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>1</count> <item_version>0</item_version> <item>166</item> </second> </item> </second> </item> <item> <first>outStream_V_last_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>1</count> <item_version>0</item_version> <item>166</item> </second> </item> </second> </item> <item> <first>outStream_V_strb_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>1</count> <item_version>0</item_version> <item>166</item> </second> </item> </second> </item> <item> <first>outStream_V_user_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>1</count> <item_version>0</item_version> <item>166</item> </second> </item> </second> </item> </dp_port_io_nodes> <port2core class_id="61" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </port2core> <node2core> <count>7</count> <item_version>0</item_version> <item class_id="62" tracking_level="0" version="0"> <first>30</first> <second>RAM</second> </item> <item> <first>31</first> <second>RAM</second> </item> <item> <first>32</first> <second>RAM</second> </item> <item> <first>33</first> <second>RAM</second> </item> <item> <first>34</first> <second>RAM</second> </item> <item> <first>35</first> <second>RAM</second> </item> <item> <first>36</first> <second>RAM</second> </item> </node2core> </syndb> </boost_serialization>

30.291619

80

0.432581

9acaf2c01e0901730de10d94a5fc9259bac16ae2

1,904

adb

Ada

UNIT_TESTS/init_001.adb

io7m/coreland-openal-ada

dd320bf0cc42759d4b041ba660a4b3e0c7507da5

[ "0BSD" ]

1

2017-10-07T05:53:55.000Z

UNIT_TESTS/init_001.adb

io7m/coreland-openal-ada

dd320bf0cc42759d4b041ba660a4b3e0c7507da5

[ "0BSD" ]

null

UNIT_TESTS/init_001.adb

io7m/coreland-openal-ada

dd320bf0cc42759d4b041ba660a4b3e0c7507da5

[ "0BSD" ]

null

with Test; with OpenAL.Context; with OpenAL.Context.Error; procedure init_001 is package ALC renames OpenAL.Context; package ALC_Error renames OpenAL.Context.Error; Device : ALC.Device_t; Context : ALC.Context_t; Current_OK : Boolean; TC : Test.Context_t; use type ALC.Device_t; use type ALC.Context_t; use type ALC_Error.Error_t; begin Test.Initialize (Test_Context => TC, Program => "init_001", Test_DB => "TEST_DB", Test_Results => "TEST_RESULTS"); Device := ALC.Open_Default_Device; Test.Check (TC, 1, Device /= ALC.Invalid_Device, "Device /= ALC.Invalid_Device"); Test.Check (TC, 2, ALC_Error.Get_Error (Device) = ALC_Error.No_Error, "ALC_Error.Get_Error (Device) = ALC_Error.No_Error"); pragma Assert (Device /= ALC.Invalid_Device); Context := ALC.Create_Context (Device); Test.Check (TC, 3, Context /= ALC.Invalid_Context, "Context /= ALC.Invalid_Context"); Test.Check (TC, 4, ALC_Error.Get_Error (Device) = ALC_Error.No_Error, "ALC_Error.Get_Error (Device) = ALC_Error.No_Error"); pragma Assert (Context /= ALC.Invalid_Context); Current_OK := ALC.Make_Context_Current (Context); Test.Check (TC, 5, Current_OK, "Current_OK"); Test.Check (TC, 6, ALC_Error.Get_Error (Device) = ALC_Error.No_Error, "ALC_Error.Get_Error (Device) = ALC_Error.No_Error"); Current_OK := ALC.Make_Context_Current (ALC.Null_Context); Test.Check (TC, 7, Current_OK, "Current_OK"); Test.Check (TC, 8, ALC_Error.Get_Error (Device) = ALC_Error.No_Error, "ALC_Error.Get_Error (Device) = ALC_Error.No_Error"); ALC.Destroy_Context (Context); Test.Check (TC, 9, ALC_Error.Get_Error (Device) = ALC_Error.No_Error, "ALC_Error.Get_Error (Device) = ALC_Error.No_Error"); ALC.Close_Device (Device); Test.Check (TC, 10, Device = ALC.Invalid_Device, "Device = ALC.Invalid_Device"); end init_001;

34

87

0.703256

a07213c49a3bf20eba3ec244e523698fe3ac17f5

144

adb

Ada

boards/host/stm32gd-board.adb

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

1

2021-04-06T07:57:56.000Z

boards/host/stm32gd-board.adb

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

null

boards/host/stm32gd-board.adb

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

2

2018-05-29T13:59:31.000Z

2019-02-03T19:48:08.000Z

with STM32_SVD; use STM32_SVD; package body STM32GD.Board is procedure Init is begin USART.Init; end Init; end STM32GD.Board;

13.090909

30

0.701389

a036f554a76a06abd994fe5407c1355bc71debda

559

adb

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/access_discr.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/access_discr.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/access_discr.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- { dg-do compile } procedure access_discr is type One; type Iface is limited interface; type Base is tagged limited null record; type Two_Alone (Parent : access One) is limited null record; type Two_Iface (Parent : access One) is limited new Iface with null record; type Two_Base (Parent : access One) is new Base with null record; type One is limited record TA : Two_Alone (One'Access); TI : Two_Iface (One'Access); -- OFFENDING LINE TB : Two_Base (One'Access); end record; begin null; end;

24.304348

78

0.665474

9a732a57b9223242a5a43a41899b891c9d0989dc

106

adb

Ada

Ada/hello_world.adb

swapnilnarad2000/HelloWorld

19ddd1aa1f8dee09252b8c946a3859f3013646ef

[ "MIT" ]

5

2021-10-04T13:27:28.000Z

2021-10-31T18:38:13.000Z

Ada/hello_world.adb

swapnilnarad2000/HelloWorld

19ddd1aa1f8dee09252b8c946a3859f3013646ef

[ "MIT" ]

40

2020-09-30T18:45:23.000Z

2020-11-04T22:45:30.000Z

Ada/hello_world.adb

swapnilnarad2000/HelloWorld

19ddd1aa1f8dee09252b8c946a3859f3013646ef

[ "MIT" ]

34

2021-10-01T05:22:38.000Z

2021-10-31T18:38:14.000Z

with Text_IO; use Text_IO; procedure hello_world is begin Put_Line("Hello World."); end hello_world;

13.25

28

0.754717

1ee9709b877524a63647ca3eacd5e086fc8b5e10

435

ads

Ada

source/webdriver-remote.ads

reznikmm/webdriver

e0247b4c3cffcfa10e9b0afa8cdc6e3f3fb8c179

[ "MIT" ]

2

2020-02-18T08:02:35.000Z

2021-03-06T09:30:40.000Z

source/webdriver-remote.ads

reznikmm/webdriver

e0247b4c3cffcfa10e9b0afa8cdc6e3f3fb8c179

[ "MIT" ]

null

source/webdriver-remote.ads

reznikmm/webdriver

e0247b4c3cffcfa10e9b0afa8cdc6e3f3fb8c179

[ "MIT" ]

null

-- Copyright (c) 2017 Maxim Reznik <[email protected]> -- -- SPDX-License-Identifier: MIT -- License-Filename: LICENSE ------------------------------------------------------------- with League.Strings; with WebDriver.Drivers; package WebDriver.Remote is function Create (URL : League.Strings.Universal_String) return WebDriver.Drivers.Driver'Class; -- Connect to server ("Remote end") end WebDriver.Remote;

24.166667

61

0.618391

038a99fbd328099a4f63c44bcf33625124034ac9

243,915

ads

Ada

src/fonts/geste_fonts-freesansoblique24pt7b.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-freesansoblique24pt7b.ads

gregkrsak/GESTE

5ac814906fdb49d880db60cbb17279cbbb777336

[ "BSD-3-Clause" ]

1

2018-10-22T21:41:59.000Z

src/fonts/geste_fonts-freesansoblique24pt7b.ads

gregkrsak/GESTE

5ac814906fdb49d880db60cbb17279cbbb777336

[ "BSD-3-Clause" ]

4

2020-07-03T10:03:13.000Z

2022-02-10T03:35:07.000Z

package GESTE_Fonts.FreeSansOblique24pt7b is Font : constant Bitmap_Font_Ref; private FreeSansOblique24pt7bBitmaps : 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#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 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#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 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#3C#, 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#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#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#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#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#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#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#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#C7#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E1#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C7#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E1#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#70#, 16#00#, 16#00#, 16#00#, 16#03#, 16#83#, 16#80#, 16#00#, 16#00#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#78#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#03#, 16#81#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#78#, 16#00#, 16#00#, 16#00#, 16#07#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#78#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#0E#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#38#, 16#00#, 16#00#, 16#00#, 16#07#, 16#83#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#38#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#70#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#70#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#1E#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#78#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#70#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#03#, 16#81#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#78#, 16#00#, 16#00#, 16#00#, 16#07#, 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#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 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#07#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#E7#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#30#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#C3#, 16#83#, 16#C0#, 16#00#, 16#00#, 16#3C#, 16#1C#, 16#1E#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#E0#, 16#F0#, 16#00#, 16#00#, 16#1E#, 16#06#, 16#07#, 16#80#, 16#00#, 16#00#, 16#F0#, 16#70#, 16#00#, 16#00#, 16#00#, 16#07#, 16#83#, 16#80#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#E6#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#71#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#03#, 16#87#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#F8#, 16#00#, 16#00#, 16#1C#, 16#0E#, 16#07#, 16#80#, 16#00#, 16#01#, 16#E0#, 16#70#, 16#3C#, 16#00#, 16#00#, 16#0F#, 16#03#, 16#81#, 16#E0#, 16#00#, 16#00#, 16#78#, 16#1C#, 16#0F#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#C0#, 16#F0#, 16#00#, 16#00#, 16#1F#, 16#0E#, 16#07#, 16#80#, 16#00#, 16#00#, 16#7C#, 16#70#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#F3#, 16#9F#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#, 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#18#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#03#, 16#F0#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#E0#, 16#00#, 16#07#, 16#FF#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#78#, 16#7C#, 16#00#, 16#E0#, 16#00#, 16#07#, 16#80#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#78#, 16#07#, 16#80#, 16#70#, 16#00#, 16#03#, 16#80#, 16#3C#, 16#07#, 16#00#, 16#00#, 16#1C#, 16#01#, 16#E0#, 16#70#, 16#00#, 16#01#, 16#E0#, 16#0E#, 16#07#, 16#80#, 16#00#, 16#0F#, 16#00#, 16#70#, 16#38#, 16#00#, 16#00#, 16#78#, 16#07#, 16#83#, 16#80#, 16#00#, 16#01#, 16#C0#, 16#78#, 16#38#, 16#00#, 16#00#, 16#0F#, 16#87#, 16#83#, 16#C0#, 16#00#, 16#00#, 16#7F#, 16#F8#, 16#1C#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#81#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#0E#, 16#07#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#F0#, 16#7C#, 16#3C#, 16#00#, 16#00#, 16#07#, 16#07#, 16#80#, 16#F0#, 16#00#, 16#00#, 16#70#, 16#38#, 16#03#, 16#80#, 16#00#, 16#07#, 16#03#, 16#C0#, 16#1C#, 16#00#, 16#00#, 16#78#, 16#1C#, 16#00#, 16#E0#, 16#00#, 16#03#, 16#80#, 16#E0#, 16#07#, 16#00#, 16#00#, 16#38#, 16#07#, 16#00#, 16#70#, 16#00#, 16#03#, 16#80#, 16#38#, 16#03#, 16#80#, 16#00#, 16#38#, 16#01#, 16#E0#, 16#38#, 16#00#, 16#01#, 16#C0#, 16#0F#, 16#87#, 16#C0#, 16#00#, 16#1C#, 16#00#, 16#3F#, 16#FC#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#1C#, 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#03#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#78#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#07#, 16#81#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#78#, 16#07#, 16#80#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#07#, 16#81#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F1#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#7C#, 16#1E#, 16#00#, 16#00#, 16#03#, 16#E3#, 16#E0#, 16#F0#, 16#00#, 16#00#, 16#3C#, 16#0F#, 16#87#, 16#80#, 16#00#, 16#03#, 16#C0#, 16#3C#, 16#78#, 16#00#, 16#00#, 16#3C#, 16#01#, 16#F3#, 16#C0#, 16#00#, 16#01#, 16#E0#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#07#, 16#80#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#7F#, 16#07#, 16#EF#, 16#80#, 16#00#, 16#01#, 16#FF#, 16#FE#, 16#7C#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#C1#, 16#F0#, 16#00#, 16#00#, 16#1F#, 16#FC#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 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#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 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#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#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#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 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#0E#, 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#78#, 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#1E#, 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#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 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#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 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#38#, 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#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 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#03#, 16#80#, 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#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#60#, 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#70#, 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#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#E0#, 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#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 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#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#1E#, 16#00#, 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#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 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#0F#, 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#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 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#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#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#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#01#, 16#8E#, 16#30#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#77#, 16#80#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#03#, 16#DC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C3#, 16#80#, 16#00#, 16#00#, 16#00#, 16#04#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#38#, 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#38#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#C0#, 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#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#38#, 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#F0#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#C0#, 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#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 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#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#30#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#00#, 16#00#, 16#00#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#C0#, 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#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 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#60#, 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#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#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#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#18#, 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#E0#, 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#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 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#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 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#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 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#0E#, 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#0F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#87#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#78#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#07#, 16#80#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#07#, 16#80#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#78#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#78#, 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#1F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 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#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 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#F8#, 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#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#F8#, 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#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#F8#, 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#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#F0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#07#, 16#80#, 16#01#, 16#E0#, 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#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#01#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#C0#, 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#03#, 16#F0#, 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#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#03#, 16#FF#, 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#0F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#F0#, 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#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 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#1E#, 16#00#, 16#07#, 16#80#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 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#1F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#EF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#78#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E7#, 16#80#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F1#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 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#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FF#, 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#0F#, 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#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F7#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 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#00#, 16#F0#, 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#00#, 16#0F#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#E0#, 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#1F#, 16#83#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#07#, 16#80#, 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#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E1#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#3F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#F3#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#BF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#FC#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#83#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 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#07#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 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#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#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#00#, 16#78#, 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#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 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#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 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#3C#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#78#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#78#, 16#00#, 16#00#, 16#07#, 16#80#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#78#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#78#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#78#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#E3#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#1E#, 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#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#0F#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 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#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 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#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 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#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 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#7C#, 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#03#, 16#80#, 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#10#, 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#1F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 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#3F#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#01#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 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#03#, 16#80#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#80#, 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#7C#, 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#07#, 16#C0#, 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#00#, 16#78#, 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#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 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#07#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#7F#, 16#E0#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#7F#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#30#, 16#03#, 16#E0#, 16#03#, 16#F0#, 16#00#, 16#80#, 16#3E#, 16#00#, 16#7F#, 16#C7#, 16#84#, 16#03#, 16#E0#, 16#0F#, 16#FF#, 16#78#, 16#20#, 16#1E#, 16#00#, 16#F8#, 16#3B#, 16#C0#, 16#01#, 16#F0#, 16#0F#, 16#80#, 16#FC#, 16#00#, 16#0F#, 16#00#, 16#F0#, 16#07#, 16#E0#, 16#00#, 16#F0#, 16#0F#, 16#00#, 16#3E#, 16#00#, 16#07#, 16#80#, 16#F8#, 16#01#, 16#F0#, 16#00#, 16#78#, 16#07#, 16#80#, 16#0F#, 16#00#, 16#83#, 16#C0#, 16#78#, 16#00#, 16#F8#, 16#04#, 16#1E#, 16#03#, 16#C0#, 16#07#, 16#80#, 16#21#, 16#E0#, 16#3E#, 16#00#, 16#7C#, 16#03#, 16#0F#, 16#01#, 16#E0#, 16#03#, 16#C0#, 16#18#, 16#78#, 16#0F#, 16#00#, 16#3E#, 16#01#, 16#C3#, 16#C0#, 16#78#, 16#01#, 16#E0#, 16#1E#, 16#1E#, 16#03#, 16#C0#, 16#1F#, 16#01#, 16#F0#, 16#F0#, 16#1E#, 16#01#, 16#F0#, 16#1F#, 16#07#, 16#80#, 16#F8#, 16#1F#, 16#81#, 16#F0#, 16#3C#, 16#07#, 16#E1#, 16#FE#, 16#3F#, 16#01#, 16#E0#, 16#1F#, 16#FD#, 16#FF#, 16#F0#, 16#0F#, 16#80#, 16#7F#, 16#8F#, 16#FE#, 16#00#, 16#3C#, 16#01#, 16#F8#, 16#3F#, 16#C0#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#01#, 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#1F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#DF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#78#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E3#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#81#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#78#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#78#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#07#, 16#80#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#78#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#F0#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#78#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#07#, 16#80#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#07#, 16#80#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 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#03#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#7F#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#1F#, 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#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 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#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 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#00#, 16#F0#, 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#00#, 16#3E#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#03#, 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#3F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#07#, 16#80#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#00#, 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#3F#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 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#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 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#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 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#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#1F#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#80#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 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#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 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#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 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#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#1F#, 16#E0#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#78#, 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#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#03#, 16#FF#, 16#F0#, 16#00#, 16#3C#, 16#00#, 16#1F#, 16#FF#, 16#80#, 16#03#, 16#E0#, 16#01#, 16#FF#, 16#FC#, 16#00#, 16#1F#, 16#00#, 16#0F#, 16#FF#, 16#E0#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#07#, 16#80#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#7E#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#07#, 16#F8#, 16#0F#, 16#FE#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FC#, 16#F0#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#C3#, 16#80#, 16#00#, 16#01#, 16#FF#, 16#F8#, 16#18#, 16#00#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#F0#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#F0#, 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#1E#, 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#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 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#0F#, 16#80#, 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#1E#, 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#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 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#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#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 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#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 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#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 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#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#01#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#78#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#F0#, 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#3C#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#07#, 16#8F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#01#, 16#EF#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FB#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#07#, 16#80#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 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#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 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#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 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#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 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#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 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#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#0F#, 16#C0#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#07#, 16#F8#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#3F#, 16#C0#, 16#01#, 16#FE#, 16#00#, 16#03#, 16#DE#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#F7#, 16#80#, 16#01#, 16#EF#, 16#00#, 16#07#, 16#9C#, 16#00#, 16#0F#, 16#78#, 16#00#, 16#3C#, 16#E0#, 16#00#, 16#F3#, 16#C0#, 16#01#, 16#E7#, 16#80#, 16#07#, 16#9E#, 16#00#, 16#1F#, 16#3C#, 16#00#, 16#79#, 16#F0#, 16#00#, 16#F1#, 16#E0#, 16#03#, 16#CF#, 16#00#, 16#07#, 16#8F#, 16#00#, 16#3C#, 16#78#, 16#00#, 16#3C#, 16#78#, 16#03#, 16#C3#, 16#C0#, 16#01#, 16#E3#, 16#C0#, 16#1E#, 16#1E#, 16#00#, 16#1E#, 16#0E#, 16#01#, 16#E1#, 16#F0#, 16#00#, 16#F0#, 16#70#, 16#0F#, 16#0F#, 16#00#, 16#07#, 16#83#, 16#C0#, 16#F0#, 16#78#, 16#00#, 16#3C#, 16#1E#, 16#07#, 16#83#, 16#C0#, 16#03#, 16#E0#, 16#F0#, 16#78#, 16#3E#, 16#00#, 16#1E#, 16#07#, 16#83#, 16#C1#, 16#E0#, 16#00#, 16#F0#, 16#3C#, 16#3C#, 16#0F#, 16#00#, 16#07#, 16#81#, 16#E3#, 16#C0#, 16#78#, 16#00#, 16#3C#, 16#07#, 16#1E#, 16#03#, 16#C0#, 16#03#, 16#E0#, 16#3D#, 16#E0#, 16#3E#, 16#00#, 16#1E#, 16#01#, 16#EF#, 16#01#, 16#E0#, 16#00#, 16#F0#, 16#0F#, 16#F0#, 16#0F#, 16#00#, 16#07#, 16#80#, 16#7F#, 16#80#, 16#78#, 16#00#, 16#3C#, 16#03#, 16#F8#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#1F#, 16#C0#, 16#3E#, 16#00#, 16#1E#, 16#00#, 16#FC#, 16#01#, 16#E0#, 16#00#, 16#F0#, 16#03#, 16#C0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#78#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#F8#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#07#, 16#80#, 16#00#, 16#1F#, 16#F8#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#F3#, 16#E0#, 16#01#, 16#E0#, 16#00#, 16#07#, 16#9F#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#3C#, 16#78#, 16#00#, 16#F8#, 16#00#, 16#01#, 16#E3#, 16#E0#, 16#07#, 16#80#, 16#00#, 16#1F#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#F0#, 16#7C#, 16#01#, 16#E0#, 16#00#, 16#07#, 16#83#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#3C#, 16#0F#, 16#00#, 16#F8#, 16#00#, 16#01#, 16#E0#, 16#7C#, 16#07#, 16#80#, 16#00#, 16#1E#, 16#01#, 16#E0#, 16#3C#, 16#00#, 16#00#, 16#F0#, 16#0F#, 16#81#, 16#E0#, 16#00#, 16#07#, 16#80#, 16#7C#, 16#1F#, 16#00#, 16#00#, 16#3C#, 16#01#, 16#F0#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#0F#, 16#87#, 16#80#, 16#00#, 16#1E#, 16#00#, 16#3C#, 16#3C#, 16#00#, 16#00#, 16#F0#, 16#01#, 16#F1#, 16#E0#, 16#00#, 16#07#, 16#80#, 16#07#, 16#9F#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#3E#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#01#, 16#F7#, 16#80#, 16#00#, 16#1E#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#F0#, 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#01#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#3F#, 16#C0#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#01#, 16#F8#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#78#, 16#00#, 16#78#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#07#, 16#80#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#01#, 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#3F#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#07#, 16#80#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#07#, 16#80#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 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#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 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#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#3F#, 16#C0#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#F8#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#78#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#78#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#78#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#0F#, 16#80#, 16#01#, 16#03#, 16#C0#, 16#00#, 16#7C#, 16#00#, 16#1C#, 16#3E#, 16#00#, 16#03#, 16#E0#, 16#01#, 16#F3#, 16#E0#, 16#00#, 16#0F#, 16#80#, 16#07#, 16#FE#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#F8#, 16#FC#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 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#3F#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#7F#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#78#, 16#00#, 16#00#, 16#7C#, 16#00#, 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#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#7F#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#0F#, 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#01#, 16#FF#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 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#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 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#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#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 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#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 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#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 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#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#3C#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#03#, 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#01#, 16#F0#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#78#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#78#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#78#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#78#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C7#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F3#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#9E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3D#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#EF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#3C#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#03#, 16#E0#, 16#01#, 16#FC#, 16#00#, 16#20#, 16#1F#, 16#00#, 16#0F#, 16#E0#, 16#01#, 16#00#, 16#F8#, 16#00#, 16#FF#, 16#00#, 16#18#, 16#07#, 16#C0#, 16#07#, 16#F8#, 16#00#, 16#C0#, 16#3E#, 16#00#, 16#7B#, 16#C0#, 16#0E#, 16#01#, 16#F0#, 16#03#, 16#DE#, 16#00#, 16#70#, 16#0F#, 16#80#, 16#3C#, 16#F0#, 16#07#, 16#80#, 16#7C#, 16#01#, 16#E7#, 16#80#, 16#3C#, 16#01#, 16#E0#, 16#1E#, 16#3C#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#F1#, 16#E0#, 16#1F#, 16#00#, 16#78#, 16#0F#, 16#0F#, 16#00#, 16#F0#, 16#03#, 16#C0#, 16#78#, 16#38#, 16#0F#, 16#80#, 16#1E#, 16#07#, 16#81#, 16#E0#, 16#78#, 16#00#, 16#F0#, 16#3C#, 16#0F#, 16#07#, 16#C0#, 16#07#, 16#83#, 16#C0#, 16#78#, 16#3C#, 16#00#, 16#3C#, 16#1E#, 16#03#, 16#C3#, 16#E0#, 16#01#, 16#E1#, 16#E0#, 16#1E#, 16#1E#, 16#00#, 16#0F#, 16#0F#, 16#00#, 16#F0#, 16#F0#, 16#00#, 16#78#, 16#F0#, 16#07#, 16#8F#, 16#80#, 16#03#, 16#C7#, 16#80#, 16#3C#, 16#78#, 16#00#, 16#1E#, 16#78#, 16#01#, 16#E7#, 16#C0#, 16#00#, 16#F3#, 16#C0#, 16#0F#, 16#3C#, 16#00#, 16#07#, 16#BC#, 16#00#, 16#7B#, 16#E0#, 16#00#, 16#3D#, 16#E0#, 16#03#, 16#DE#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#03#, 16#F8#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#07#, 16#E0#, 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#FC#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#81#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#8F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FB#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#9F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C3#, 16#E0#, 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#01#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C3#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#79#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 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#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 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#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#03#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 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#F0#, 16#00#, 16#00#, 16#00#, 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#1F#, 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#F0#, 16#00#, 16#00#, 16#00#, 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#1F#, 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#F0#, 16#00#, 16#00#, 16#00#, 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#1F#, 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#F0#, 16#00#, 16#00#, 16#00#, 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#1F#, 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#FF#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#03#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#00#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 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#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 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#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 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#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 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#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 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#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 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#3C#, 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#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#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#7F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#01#, 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#03#, 16#80#, 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#07#, 16#00#, 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#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#70#, 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#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 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#C0#, 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#03#, 16#80#, 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#03#, 16#00#, 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#38#, 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#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FC#, 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#78#, 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#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 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#3C#, 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#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#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#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#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#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 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#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 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#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#03#, 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#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#B8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#39#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#CE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#70#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C3#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#70#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#70#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#78#, 16#07#, 16#80#, 16#00#, 16#00#, 16#03#, 16#80#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#C0#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#FF#, 16#FF#, 16#80#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 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#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 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#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#F8#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#81#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 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#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 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#03#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#FE#, 16#3C#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#78#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#F7#, 16#F0#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#7F#, 16#F0#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#FC#, 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#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 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#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 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#E0#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#7B#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#3D#, 16#E0#, 16#FC#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#78#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#78#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#07#, 16#80#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#78#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#78#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#83#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#BF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#3D#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#C7#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#E0#, 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#1F#, 16#81#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#07#, 16#80#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 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#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 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#80#, 16#07#, 16#80#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#C0#, 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#80#, 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#1E#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#C7#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#FE#, 16#78#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FB#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#83#, 16#FE#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#78#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#78#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#78#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#78#, 16#00#, 16#00#, 16#07#, 16#80#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#DE#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F8#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#E0#, 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#1F#, 16#C1#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#80#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#78#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#03#, 16#C0#, 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#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 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#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 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#C0#, 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#7F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FC#, 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#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 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#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 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#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 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#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#00#, 16#FF#, 16#C7#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#78#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FB#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#83#, 16#FE#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#80#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#78#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#78#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#78#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#80#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#7F#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FB#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#BC#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F9#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#3F#, 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#80#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#78#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 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#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 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#E0#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#7B#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E1#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#80#, 16#07#, 16#80#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#07#, 16#80#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#07#, 16#80#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#01#, 16#E0#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#03#, 16#C0#, 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#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 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#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 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#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 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#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 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#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 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#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#3C#, 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#78#, 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#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 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#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 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#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 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#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 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#F0#, 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#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#F0#, 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#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#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#0F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 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#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 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#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 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#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#78#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#78#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C7#, 16#80#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#01#, 16#EF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#78#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F3#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#78#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#78#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#78#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#01#, 16#E0#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#03#, 16#C0#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 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#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 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#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 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#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 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#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 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#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#03#, 16#E0#, 16#00#, 16#0F#, 16#3F#, 16#E0#, 16#7F#, 16#C0#, 16#00#, 16#73#, 16#FF#, 16#8F#, 16#FF#, 16#00#, 16#07#, 16#BF#, 16#FE#, 16#FF#, 16#F8#, 16#00#, 16#3F#, 16#C3#, 16#FF#, 16#07#, 16#C0#, 16#01#, 16#F8#, 16#0F#, 16#F0#, 16#1F#, 16#00#, 16#0F#, 16#80#, 16#3F#, 16#00#, 16#F8#, 16#00#, 16#78#, 16#01#, 16#F0#, 16#07#, 16#80#, 16#07#, 16#C0#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#3C#, 16#00#, 16#78#, 16#01#, 16#E0#, 16#01#, 16#E0#, 16#03#, 16#80#, 16#0F#, 16#00#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#78#, 16#00#, 16#78#, 16#01#, 16#E0#, 16#07#, 16#80#, 16#07#, 16#80#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#3C#, 16#00#, 16#78#, 16#01#, 16#E0#, 16#01#, 16#E0#, 16#07#, 16#80#, 16#0F#, 16#00#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#78#, 16#00#, 16#78#, 16#01#, 16#E0#, 16#07#, 16#80#, 16#07#, 16#80#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#3C#, 16#00#, 16#78#, 16#01#, 16#E0#, 16#01#, 16#E0#, 16#07#, 16#80#, 16#0F#, 16#00#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#78#, 16#00#, 16#78#, 16#01#, 16#E0#, 16#07#, 16#80#, 16#07#, 16#80#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#3C#, 16#00#, 16#70#, 16#01#, 16#E0#, 16#01#, 16#E0#, 16#07#, 16#80#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#0F#, 16#3F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#73#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#BF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E1#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#80#, 16#07#, 16#80#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#07#, 16#80#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#07#, 16#80#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#01#, 16#E0#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#C1#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#78#, 16#00#, 16#00#, 16#07#, 16#80#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#07#, 16#80#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#78#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#78#, 16#00#, 16#00#, 16#07#, 16#80#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#0F#, 16#3F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#7B#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#BF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#FC#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 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#01#, 16#E0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#78#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#78#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#07#, 16#80#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#78#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#78#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#83#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#BF#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#3D#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#E7#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#0F#, 16#E0#, 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#3C#, 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#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#FF#, 16#C7#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#38#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FB#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#83#, 16#FE#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#78#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#78#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#78#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#78#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#7F#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FB#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#9E#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F9#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 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#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#73#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#07#, 16#BF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 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#3E#, 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#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#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#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#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#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#00#, 16#00#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#78#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FC#, 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#00#, 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#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 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#7F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FC#, 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#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 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#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 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#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 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#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 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#00#, 16#7F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 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#0F#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#BC#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F1#, 16#E0#, 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#3C#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#78#, 16#00#, 16#78#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#78#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#78#, 16#00#, 16#00#, 16#00#, 16#07#, 16#87#, 16#80#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E3#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#79#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#DE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#F0#, 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#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#F8#, 16#03#, 16#C0#, 16#01#, 16#E0#, 16#0F#, 16#C0#, 16#1E#, 16#00#, 16#0F#, 16#00#, 16#7E#, 16#01#, 16#F0#, 16#00#, 16#78#, 16#07#, 16#F0#, 16#0F#, 16#00#, 16#03#, 16#C0#, 16#3F#, 16#80#, 16#F8#, 16#00#, 16#1E#, 16#03#, 16#FC#, 16#07#, 16#80#, 16#00#, 16#F0#, 16#1F#, 16#E0#, 16#7C#, 16#00#, 16#07#, 16#81#, 16#EF#, 16#03#, 16#C0#, 16#00#, 16#3C#, 16#0F#, 16#78#, 16#3E#, 16#00#, 16#01#, 16#E0#, 16#F3#, 16#C1#, 16#E0#, 16#00#, 16#07#, 16#07#, 16#9E#, 16#1F#, 16#00#, 16#00#, 16#3C#, 16#38#, 16#F0#, 16#F0#, 16#00#, 16#01#, 16#E3#, 16#C3#, 16#87#, 16#80#, 16#00#, 16#0F#, 16#1C#, 16#1C#, 16#78#, 16#00#, 16#00#, 16#79#, 16#E0#, 16#E3#, 16#C0#, 16#00#, 16#03#, 16#CF#, 16#07#, 16#3C#, 16#00#, 16#00#, 16#1E#, 16#F0#, 16#39#, 16#E0#, 16#00#, 16#00#, 16#F7#, 16#81#, 16#DE#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#0E#, 16#F0#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#7F#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#0F#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#78#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C1#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#79#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#EF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 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#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#BC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F9#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#87#, 16#80#, 16#00#, 16#00#, 16#00#, 16#78#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#78#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#C0#, 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#3C#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#78#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#07#, 16#81#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#78#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E7#, 16#80#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7B#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#DE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#E0#, 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#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 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#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#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F0#, 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#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#F0#, 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#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#F0#, 16#00#, 16#00#, 16#00#, 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#1F#, 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#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#03#, 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#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#3E#, 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#70#, 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#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#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#1E#, 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#78#, 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#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 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#1E#, 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#38#, 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#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 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#1E#, 16#00#, 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#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#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#70#, 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#C0#, 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#03#, 16#80#, 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#0E#, 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#18#, 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#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#18#, 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#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#18#, 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#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 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#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 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#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 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#0E#, 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#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 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#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#0E#, 16#00#, 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#3C#, 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#70#, 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#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 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#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#1E#, 16#00#, 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#38#, 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#F0#, 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#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7E#, 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#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#1C#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#E0#, 16#00#, 16#00#, 16#1E#, 16#3F#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#7F#, 16#E0#, 16#00#, 16#00#, 16#06#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 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 => 315, Glyph_Width => 45, Glyph_Height => 56, Data => FreeSansOblique24pt7bBitmaps'Access); Font : constant Bitmap_Font_Ref := Font_D'Access; end GESTE_Fonts.FreeSansOblique24pt7b;

73.779492

74

0.486883

a0fd240557bf160a6e95d81dbbdb50a395140a4e

2,869

adb

Ada

09/1/src/main.adb

Heziode/aoc-ada-2021

fd2fcb177a930d16a16da888e89aeca8946cc615

[ "BSD-2-Clause" ]

3

2021-12-02T10:21:33.000Z

2021-12-25T13:31:55.000Z

09/1/src/main.adb

Heziode/aoc-ada-2021

fd2fcb177a930d16a16da888e89aeca8946cc615

[ "BSD-2-Clause" ]

null

09/1/src/main.adb

Heziode/aoc-ada-2021

fd2fcb177a930d16a16da888e89aeca8946cc615

[ "BSD-2-Clause" ]

1

2021-12-06T22:47:02.000Z

with Ada.Containers.Vectors, Ada.Containers.Bounded_Hashed_Maps, Ada.Exceptions, Ada.Integer_Text_IO, Ada.Text_IO; with Utils; procedure Main is use Ada.Text_IO; use Utils; package Integer_Vectors is new Ada.Containers.Vectors (Natural, Integer); use Integer_Vectors; subtype Hegihtmap_Values is Natural range 0 .. 10; subtype Hegiht is Hegihtmap_Values range 0 .. 9; type Cave_Heightmap_Array is array (Natural range <>, Natural range <>) of Hegihtmap_Values; File : File_Type; Values : Vector := Empty_Vector; Array_Width, Array_Height : Natural := Natural'First; begin Get_File (File); -- Get all values while not End_Of_File (File) loop Array_Height := Array_Height + 1; declare Str : constant String := Get_Line (File); Value : Hegiht; Last : Positive; begin if Array_Width = Natural'First then Array_Width := Str'Length; end if; for Char of Str loop Ada.Integer_Text_IO.Get (Char & "", Value, Last); Values.Append (Value); end loop; end; end loop; -- Exit the program if there is no values if Values.Is_Empty then Close_If_Open (File); Put_Line ("The input file is empty."); return; end if; declare Cave_Heightmap : Cave_Heightmap_Array (Natural'First .. Array_Height + 1, Natural'First .. Array_Width + 1) := (others => (others => Hegihtmap_Values'Last)); Curs : Cursor := Values.First; Result : Natural := Natural'First; begin -- Initialize Array for Line in 1 .. Array_Height loop for Column in 1 .. Array_Width loop Cave_Heightmap (Line, Column) := Element (Curs); Curs := Next (Curs); end loop; end loop; -- Do the puzzle Solve_Puzzle : declare Current : Hegihtmap_Values; begin for Line in 1 .. Array_Height loop for Column in 1 .. Array_Width loop Current := Cave_Heightmap (Line, Column); if Current < Cave_Heightmap (Line - 1, Column) and then Current < Cave_Heightmap (Line + 1, Column) and then Current < Cave_Heightmap (Line, Column - 1) and then Current < Cave_Heightmap (Line, Column + 1) then Result := Result + Current + 1; end if; end loop; end loop; end Solve_Puzzle; Put ("Result: "); Ada.Integer_Text_IO.Put (Item => Result, Width => 0); New_Line; end; Close_If_Open (File); exception when Occur : others => Put_Line ("Error: " & Ada.Exceptions.Exception_Message (Occur)); Close_If_Open (File); end Main;

28.69

116

0.579644

c737a4c1ca41520e3b7c331a1e47b017681f804c

2,519

adb

Ada

arch/ARM/Nordic/drivers/nrf52/nrf-clock-set_high_freq_external_frequency.adb

shakram02/Ada_Drivers_Library

a407ca7ddbc2d9756647016c2f8fd8ef24a239ff

[ "BSD-3-Clause" ]

192

2016-06-01T18:32:04.000Z

2022-03-26T22:52:31.000Z

arch/ARM/Nordic/drivers/nrf52/nrf-clock-set_high_freq_external_frequency.adb

shakram02/Ada_Drivers_Library

a407ca7ddbc2d9756647016c2f8fd8ef24a239ff

[ "BSD-3-Clause" ]

239

2016-05-26T20:02:01.000Z

2022-03-31T09:46:56.000Z

arch/ARM/Nordic/drivers/nrf52/nrf-clock-set_high_freq_external_frequency.adb

shakram02/Ada_Drivers_Library

a407ca7ddbc2d9756647016c2f8fd8ef24a239ff

[ "BSD-3-Clause" ]

142

2016-06-05T08:12:20.000Z

2022-03-24T17:37:17.000Z

------------------------------------------------------------------------------ -- -- -- Copyright (C) 2020, AdaCore -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions are -- -- met: -- -- 1. Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- 2. Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in -- -- the documentation and/or other materials provided with the -- -- distribution. -- -- 3. Neither the name of the copyright holder nor the names of its -- -- contributors may be used to endorse or promote products derived -- -- from this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT -- -- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, -- -- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY -- -- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -- -- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -- -- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ separate (nRF.Clock) procedure Set_High_Freq_External_Frequency (Freq : High_Freq_Ext_Freq) is begin null; end Set_High_Freq_External_Frequency;

68.081081

78

0.52243

9aef804a40587762ffcfb9ac70f8f7416f752789

1,114

ads

Ada

src/hex_2digits_display.ads

hgrodriguez/embedded-dashboard-console

af6ac23984ede09cd8505f101e8625b6aca3742b

[ "BSD-3-Clause" ]

null

src/hex_2digits_display.ads

hgrodriguez/embedded-dashboard-console

af6ac23984ede09cd8505f101e8625b6aca3742b

[ "BSD-3-Clause" ]

null

src/hex_2digits_display.ads

hgrodriguez/embedded-dashboard-console

af6ac23984ede09cd8505f101e8625b6aca3742b

[ "BSD-3-Clause" ]

null

--=========================================================================== -- -- Represents an 5x7 Matrix Pimoroni display. -- This package can only display a hex number on such a 5x7 matrix. -- --=========================================================================== -- -- Copyright 2021 (C) Holger Rodriguez -- -- SPDX-License-Identifier: BSD-3-Clause -- with HAL.I2C; generic ------------------------------------------------------ -- Define the port, where the display is connected to ------------------------------------------------------ I2C : HAL.I2C.Any_I2C_Port; ---------------------------------------------------- -- Define the address of the display on the I2C bus ---------------------------------------------------- Address : HAL.I2C.I2C_Address; package Hex_2Digits_Display is ----------------------------------------------------------------------- -- Shows the -- Number -- on the display having the -- Address -- on the -- I2C -- bus -- as defined above procedure Show (Number : HAL.UInt8); end Hex_2Digits_Display;

29.315789

77

0.388689

037ea9123b8db6894a60a2454f23dff6240279aa

2,081

adb

Ada

samples/launch.adb

yrashk/ada-util

2aaa1d87e92a7137e1c63dce90f0722c549dfafd

[ "Apache-2.0" ]

null

samples/launch.adb

yrashk/ada-util

2aaa1d87e92a7137e1c63dce90f0722c549dfafd

[ "Apache-2.0" ]

null

samples/launch.adb

yrashk/ada-util

2aaa1d87e92a7137e1c63dce90f0722c549dfafd

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- launch -- Launch an external process redirecting the input and output -- Copyright (C) 2011 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Util.Processes; with Ada.Text_IO; with Ada.Strings.Unbounded; with Util.Streams.Pipes; with Util.Streams.Buffered; with Util.Streams.Texts; procedure Launch is use Ada.Strings.Unbounded; Pipe : aliased Util.Streams.Pipes.Pipe_Stream; Buffer : Util.Streams.Buffered.Input_Buffer_Stream; Content : Unbounded_String; Print : Util.Streams.Texts.Print_Stream; begin -- Write on the process input stream Pipe.Open ("nslookup", Util.Processes.READ_WRITE); Buffer.Initialize (Pipe'Access, 1024); Print.Initialize (Pipe'Access); -- Write on the 'nslookup' input pipe a list of domains to resolve. Print.Write ("www.google.com" & ASCII.LF); Print.Write ("set type=NS" & ASCII.LF); Print.Write ("www.google.com" & ASCII.LF); Print.Write ("set type=MX" & ASCII.LF); Print.Write ("www.google.com" & ASCII.LF); Print.Close; -- Read the 'nslookup' output. Buffer.Read (Content); Pipe.Close; Ada.Text_IO.Put_Line ("Result lenght: " & Integer'Image (Length (Content))); Ada.Text_IO.Put_Line ("Exit status: " & Integer'Image (Pipe.Get_Exit_Status)); Ada.Text_IO.Put_Line (Ada.Strings.Unbounded.To_String (Content)); end Launch;

38.537037

81

0.667468

a02696199996f7e417f1b4569f73cd4157905235

133,343

adb

Ada

apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen/sharpen/hls_target/.autopilot/db/call_Loop_LB2D_buf_p.bind.adb

dillonhuff/Halide-HLS

e9f4c3ac7915e5a52f211ce65004ae17890515a0

[ "MIT" ]

1

2020-06-18T16:51:39.000Z

apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen/sharpen/hls_target/.autopilot/db/call_Loop_LB2D_buf_p.bind.adb

dillonhuff/Halide-HLS

e9f4c3ac7915e5a52f211ce65004ae17890515a0

[ "MIT" ]

null

apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen/sharpen/hls_target/.autopilot/db/call_Loop_LB2D_buf_p.bind.adb

dillonhuff/Halide-HLS

e9f4c3ac7915e5a52f211ce65004ae17890515a0

[ "MIT" ]

1

2020-03-18T00:43:22.000Z

<?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="14"> <syndb class_id="0" tracking_level="0" version="0"> <userIPLatency>-1</userIPLatency> <userIPName></userIPName> <cdfg class_id="1" tracking_level="1" version="0" object_id="_0"> <name>call_Loop_LB2D_buf_p</name> <ret_bitwidth>0</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="3" tracking_level="1" version="0" object_id="_1"> <Value class_id="4" tracking_level="0" version="0"> <Obj class_id="5" tracking_level="0" version="0"> <type>1</type> <id>1</id> <name>in_stream_V_value_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo class_id="6" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>stream&lt;PackedStencil&lt;unsigned int, 1, 1, 1, 1&gt; &gt;.V.value.V</originalName> <rtlName></rtlName> <coreName>FIFO_SRL</coreName> </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>slice_stream_V_value_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName>FIFO_SRL</coreName> </Obj> <bitwidth>96</bitwidth> </Value> <direction>1</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> </ports> <nodes class_id="8" tracking_level="0" version="0"> <count>43</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_3"> <Value> <Obj> <type>0</type> <id>7</id> <name>buffer_0_value_V</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>168</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="10" tracking_level="0" version="0"> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</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>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>168</second> </item> </second> </item> </inlineStackInfo> <originalName>buffer[0].value.V</originalName> <rtlName></rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>71</item> </oprand_edges> <opcode>alloca</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_4"> <Value> <Obj> <type>0</type> <id>8</id> <name>buffer_1_value_V</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>168</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>168</second> </item> </second> </item> </inlineStackInfo> <originalName>buffer[1].value.V</originalName> <rtlName></rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>72</item> </oprand_edges> <opcode>alloca</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_5"> <Value> <Obj> <type>0</type> <id>9</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>73</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_6"> <Value> <Obj> <type>0</type> <id>11</id> <name>write_idx_1</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>write_idx_1</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>75</item> <item>76</item> <item>77</item> <item>78</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_7"> <Value> <Obj> <type>0</type> <id>12</id> <name>row</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>row</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>80</item> <item>81</item> <item>82</item> <item>83</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_8"> <Value> <Obj> <type>0</type> <id>13</id> <name>tmp</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>177</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>177</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>84</item> <item>86</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_9"> <Value> <Obj> <type>0</type> <id>15</id> <name>row_1</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>177</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>177</second> </item> </second> </item> </inlineStackInfo> <originalName>row</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>87</item> <item>89</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_10"> <Value> <Obj> <type>0</type> <id>16</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>177</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>177</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>90</item> <item>91</item> <item>92</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_11"> <Value> <Obj> <type>0</type> <id>20</id> <name>tmp_6</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>187</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>187</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>10</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>113</item> <item>114</item> <item>116</item> <item>118</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_12"> <Value> <Obj> <type>0</type> <id>21</id> <name>icmp</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>187</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>187</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>119</item> <item>121</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_13"> <Value> <Obj> <type>0</type> <id>22</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>179</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>179</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>122</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_14"> <Value> <Obj> <type>0</type> <id>24</id> <name>write_idx_1_1</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>211</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>211</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>96</item> <item>97</item> <item>98</item> <item>99</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_15"> <Value> <Obj> <type>0</type> <id>25</id> <name>col</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>col</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>100</item> <item>101</item> <item>102</item> <item>103</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_16"> <Value> <Obj> <type>0</type> <id>26</id> <name>tmp_2</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>179</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>179</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>104</item> <item>106</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_17"> <Value> <Obj> <type>0</type> <id>27</id> <name>col_1</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>179</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>179</second> </item> </second> </item> </inlineStackInfo> <originalName>col</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>107</item> <item>108</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_18"> <Value> <Obj> <type>0</type> <id>28</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>179</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>179</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> </item> <item class_id_reference="9" object_id="_19"> <Value> <Obj> <type>0</type> <id>30</id> <name>col_cast</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>179</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>179</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>131</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_20"> <Value> <Obj> <type>0</type> <id>34</id> <name>tmp_8</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>183</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>183</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>63</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>133</item> <item>134</item> <item>135</item> <item>137</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_21"> <Value> <Obj> <type>0</type> <id>35</id> <name>icmp1</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>183</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>183</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>138</item> <item>140</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_22"> <Value> <Obj> <type>0</type> <id>36</id> <name>write_idx_1_3</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>184</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>184</second> </item> </second> </item> </inlineStackInfo> <originalName>write_idx_1</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>141</item> <item>143</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_23"> <Value> <Obj> <type>0</type> <id>37</id> <name>p_write_idx_1_1</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>183</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>183</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>144</item> <item>145</item> <item>146</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_24"> <Value> <Obj> <type>0</type> <id>38</id> <name>tmp_value_V_2</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>186</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>186</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.value.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>148</item> <item>149</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_25"> <Value> <Obj> <type>0</type> <id>39</id> <name>buffer_0_value_V_ad</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>179</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>179</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>150</item> <item>151</item> <item>152</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_26"> <Value> <Obj> <type>0</type> <id>40</id> <name>buffer_0_value_V_lo</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>198</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>198</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>153</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_27"> <Value> <Obj> <type>0</type> <id>41</id> <name>buffer_1_value_V_ad</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>179</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>179</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>154</item> <item>155</item> <item>156</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_28"> <Value> <Obj> <type>0</type> <id>42</id> <name>buffer_1_value_V_lo</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>198</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>198</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>157</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_29"> <Value> <Obj> <type>0</type> <id>43</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>187</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>187</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>158</item> <item>159</item> <item>160</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_30"> <Value> <Obj> <type>0</type> <id>45</id> <name>tmp_9</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>183</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>183</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>161</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_31"> <Value> <Obj> <type>0</type> <id>46</id> <name>p_Val2_2_0_phi</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>198</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>198</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>162</item> <item>163</item> <item>164</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_32"> <Value> <Obj> <type>0</type> <id>47</id> <name>p_Val2_2_1_phi</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>198</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>198</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>165</item> <item>166</item> <item>167</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_33"> <Value> <Obj> <type>0</type> <id>48</id> <name>p_Result_s</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>206</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>206</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>96</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>169</item> <item>170</item> <item>171</item> <item>172</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_34"> <Value> <Obj> <type>0</type> <id>49</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>207</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>207</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>174</item> <item>175</item> <item>176</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_35"> <Value> <Obj> <type>0</type> <id>50</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>208</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>208</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>177</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_36"> <Value> <Obj> <type>0</type> <id>52</id> <name>tmp_10</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>183</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>183</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>127</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_37"> <Value> <Obj> <type>0</type> <id>53</id> <name></name> <fileName>../../../lib_files/Stencil.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>75</lineNumber> <contextFuncName>operator=</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>209</second> </item> <item> <first> <first>../../../lib_files/Stencil.h</first> <second>operator=</second> </first> <second>75</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>128</item> <item>129</item> <item>130</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_38"> <Value> <Obj> <type>0</type> <id>55</id> <name></name> <fileName>../../../lib_files/Stencil.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>75</lineNumber> <contextFuncName>operator=</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>209</second> </item> <item> <first> <first>../../../lib_files/Stencil.h</first> <second>operator=</second> </first> <second>75</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>124</item> <item>125</item> <item>297</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_39"> <Value> <Obj> <type>0</type> <id>56</id> <name></name> <fileName>../../../lib_files/Stencil.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>75</lineNumber> <contextFuncName>operator=</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>209</second> </item> <item> <first> <first>../../../lib_files/Stencil.h</first> <second>operator=</second> </first> <second>75</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>126</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_40"> <Value> <Obj> <type>0</type> <id>58</id> <name></name> <fileName>../../../lib_files/Stencil.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>75</lineNumber> <contextFuncName>operator=</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>209</second> </item> <item> <first> <first>../../../lib_files/Stencil.h</first> <second>operator=</second> </first> <second>75</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>178</item> <item>179</item> <item>296</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_41"> <Value> <Obj> <type>0</type> <id>59</id> <name></name> <fileName>../../../lib_files/Stencil.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>75</lineNumber> <contextFuncName>operator=</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>209</second> </item> <item> <first> <first>../../../lib_files/Stencil.h</first> <second>operator=</second> </first> <second>75</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>180</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_42"> <Value> <Obj> <type>0</type> <id>62</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>179</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>179</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>123</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_43"> <Value> <Obj> <type>0</type> <id>64</id> <name>write_idx_1_2</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>211</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>211</second> </item> </second> </item> </inlineStackInfo> <originalName>write_idx_1</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>93</item> <item>94</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_44"> <Value> <Obj> <type>0</type> <id>66</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory> <lineNumber>177</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>177</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>95</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_45"> <Value> <Obj> <type>0</type> <id>68</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>0</count> <item_version>0</item_version> </oprand_edges> <opcode>ret</opcode> <m_Display>0</m_Display> </item> </nodes> <consts class_id="15" tracking_level="0" version="0"> <count>12</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_46"> <Value> <Obj> <type>2</type> <id>70</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_47"> <Value> <Obj> <type>2</type> <id>74</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_48"> <Value> <Obj> <type>2</type> <id>79</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_49"> <Value> <Obj> <type>2</type> <id>85</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>1080</content> </item> <item class_id_reference="16" object_id="_50"> <Value> <Obj> <type>2</type> <id>88</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_51"> <Value> <Obj> <type>2</type> <id>105</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>1920</content> </item> <item class_id_reference="16" object_id="_52"> <Value> <Obj> <type>2</type> <id>115</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>1</content> </item> <item class_id_reference="16" object_id="_53"> <Value> <Obj> <type>2</type> <id>117</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>10</content> </item> <item class_id_reference="16" object_id="_54"> <Value> <Obj> <type>2</type> <id>120</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>10</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_55"> <Value> <Obj> <type>2</type> <id>136</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="_56"> <Value> <Obj> <type>2</type> <id>139</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>63</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_57"> <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>0</const_type> <content>18446744073709551614</content> </item> </consts> <blocks class_id="17" tracking_level="0" version="0"> <count>12</count> <item_version>0</item_version> <item class_id="18" tracking_level="1" version="0" object_id="_58"> <Obj> <type>3</type> <id>10</id> <name>newFuncRoot</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>7</item> <item>8</item> <item>9</item> </node_objs> </item> <item class_id_reference="18" object_id="_59"> <Obj> <type>3</type> <id>17</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>5</count> <item_version>0</item_version> <item>11</item> <item>12</item> <item>13</item> <item>15</item> <item>16</item> </node_objs> </item> <item class_id_reference="18" object_id="_60"> <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>3</count> <item_version>0</item_version> <item>20</item> <item>21</item> <item>22</item> </node_objs> </item> <item class_id_reference="18" object_id="_61"> <Obj> <type>3</type> <id>29</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>5</count> <item_version>0</item_version> <item>24</item> <item>25</item> <item>26</item> <item>27</item> <item>28</item> </node_objs> </item> <item class_id_reference="18" object_id="_62"> <Obj> <type>3</type> <id>44</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>11</count> <item_version>0</item_version> <item>30</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> </node_objs> </item> <item class_id_reference="18" object_id="_63"> <Obj> <type>3</type> <id>51</id> <name>.preheader56.preheader.critedge.0</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>6</count> <item_version>0</item_version> <item>45</item> <item>46</item> <item>47</item> <item>48</item> <item>49</item> <item>50</item> </node_objs> </item> <item class_id_reference="18" object_id="_64"> <Obj> <type>3</type> <id>54</id> <name>._crit_edge</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>52</item> <item>53</item> </node_objs> </item> <item class_id_reference="18" object_id="_65"> <Obj> <type>3</type> <id>57</id> <name>branch4</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>55</item> <item>56</item> </node_objs> </item> <item class_id_reference="18" object_id="_66"> <Obj> <type>3</type> <id>60</id> <name>branch5</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>58</item> <item>59</item> </node_objs> </item> <item class_id_reference="18" object_id="_67"> <Obj> <type>3</type> <id>63</id> <name>._crit_edge31</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>62</item> </node_objs> </item> <item class_id_reference="18" object_id="_68"> <Obj> <type>3</type> <id>67</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>64</item> <item>66</item> </node_objs> </item> <item class_id_reference="18" object_id="_69"> <Obj> <type>3</type> <id>69</id> <name>.preheader.exitStub</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>68</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>106</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_70"> <id>71</id> <edge_type>1</edge_type> <source_obj>70</source_obj> <sink_obj>7</sink_obj> </item> <item class_id_reference="20" object_id="_71"> <id>72</id> <edge_type>1</edge_type> <source_obj>70</source_obj> <sink_obj>8</sink_obj> </item> <item class_id_reference="20" object_id="_72"> <id>73</id> <edge_type>2</edge_type> <source_obj>17</source_obj> <sink_obj>9</sink_obj> </item> <item class_id_reference="20" object_id="_73"> <id>75</id> <edge_type>1</edge_type> <source_obj>74</source_obj> <sink_obj>11</sink_obj> </item> <item class_id_reference="20" object_id="_74"> <id>76</id> <edge_type>2</edge_type> <source_obj>10</source_obj> <sink_obj>11</sink_obj> </item> <item class_id_reference="20" object_id="_75"> <id>77</id> <edge_type>1</edge_type> <source_obj>64</source_obj> <sink_obj>11</sink_obj> </item> <item class_id_reference="20" object_id="_76"> <id>78</id> <edge_type>2</edge_type> <source_obj>67</source_obj> <sink_obj>11</sink_obj> </item> <item class_id_reference="20" object_id="_77"> <id>80</id> <edge_type>1</edge_type> <source_obj>79</source_obj> <sink_obj>12</sink_obj> </item> <item class_id_reference="20" object_id="_78"> <id>81</id> <edge_type>2</edge_type> <source_obj>10</source_obj> <sink_obj>12</sink_obj> </item> <item class_id_reference="20" object_id="_79"> <id>82</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>12</sink_obj> </item> <item class_id_reference="20" object_id="_80"> <id>83</id> <edge_type>2</edge_type> <source_obj>67</source_obj> <sink_obj>12</sink_obj> </item> <item class_id_reference="20" object_id="_81"> <id>84</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>13</sink_obj> </item> <item class_id_reference="20" object_id="_82"> <id>86</id> <edge_type>1</edge_type> <source_obj>85</source_obj> <sink_obj>13</sink_obj> </item> <item class_id_reference="20" object_id="_83"> <id>87</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>15</sink_obj> </item> <item class_id_reference="20" object_id="_84"> <id>89</id> <edge_type>1</edge_type> <source_obj>88</source_obj> <sink_obj>15</sink_obj> </item> <item class_id_reference="20" object_id="_85"> <id>90</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>16</sink_obj> </item> <item class_id_reference="20" object_id="_86"> <id>91</id> <edge_type>2</edge_type> <source_obj>23</source_obj> <sink_obj>16</sink_obj> </item> <item class_id_reference="20" object_id="_87"> <id>92</id> <edge_type>2</edge_type> <source_obj>69</source_obj> <sink_obj>16</sink_obj> </item> <item class_id_reference="20" object_id="_88"> <id>93</id> <edge_type>1</edge_type> <source_obj>24</source_obj> <sink_obj>64</sink_obj> </item> <item class_id_reference="20" object_id="_89"> <id>94</id> <edge_type>1</edge_type> <source_obj>70</source_obj> <sink_obj>64</sink_obj> </item> <item class_id_reference="20" object_id="_90"> <id>95</id> <edge_type>2</edge_type> <source_obj>17</source_obj> <sink_obj>66</sink_obj> </item> <item class_id_reference="20" object_id="_91"> <id>96</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>24</sink_obj> </item> <item class_id_reference="20" object_id="_92"> <id>97</id> <edge_type>2</edge_type> <source_obj>23</source_obj> <sink_obj>24</sink_obj> </item> <item class_id_reference="20" object_id="_93"> <id>98</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>24</sink_obj> </item> <item class_id_reference="20" object_id="_94"> <id>99</id> <edge_type>2</edge_type> <source_obj>63</source_obj> <sink_obj>24</sink_obj> </item> <item class_id_reference="20" object_id="_95"> <id>100</id> <edge_type>1</edge_type> <source_obj>79</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_96"> <id>101</id> <edge_type>2</edge_type> <source_obj>23</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_97"> <id>102</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_98"> <id>103</id> <edge_type>2</edge_type> <source_obj>63</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_99"> <id>104</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>26</sink_obj> </item> <item class_id_reference="20" object_id="_100"> <id>106</id> <edge_type>1</edge_type> <source_obj>105</source_obj> <sink_obj>26</sink_obj> </item> <item class_id_reference="20" object_id="_101"> <id>107</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>27</sink_obj> </item> <item class_id_reference="20" object_id="_102"> <id>108</id> <edge_type>1</edge_type> <source_obj>88</source_obj> <sink_obj>27</sink_obj> </item> <item class_id_reference="20" object_id="_103"> <id>109</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>28</sink_obj> </item> <item class_id_reference="20" object_id="_104"> <id>110</id> <edge_type>2</edge_type> <source_obj>44</source_obj> <sink_obj>28</sink_obj> </item> <item class_id_reference="20" object_id="_105"> <id>111</id> <edge_type>2</edge_type> <source_obj>67</source_obj> <sink_obj>28</sink_obj> </item> <item class_id_reference="20" object_id="_106"> <id>114</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>20</sink_obj> </item> <item class_id_reference="20" object_id="_107"> <id>116</id> <edge_type>1</edge_type> <source_obj>115</source_obj> <sink_obj>20</sink_obj> </item> <item class_id_reference="20" object_id="_108"> <id>118</id> <edge_type>1</edge_type> <source_obj>117</source_obj> <sink_obj>20</sink_obj> </item> <item class_id_reference="20" object_id="_109"> <id>119</id> <edge_type>1</edge_type> <source_obj>20</source_obj> <sink_obj>21</sink_obj> </item> <item class_id_reference="20" object_id="_110"> <id>121</id> <edge_type>1</edge_type> <source_obj>120</source_obj> <sink_obj>21</sink_obj> </item> <item class_id_reference="20" object_id="_111"> <id>122</id> <edge_type>2</edge_type> <source_obj>29</source_obj> <sink_obj>22</sink_obj> </item> <item class_id_reference="20" object_id="_112"> <id>123</id> <edge_type>2</edge_type> <source_obj>29</source_obj> <sink_obj>62</sink_obj> </item> <item class_id_reference="20" object_id="_113"> <id>124</id> <edge_type>1</edge_type> <source_obj>38</source_obj> <sink_obj>55</sink_obj> </item> <item class_id_reference="20" object_id="_114"> <id>125</id> <edge_type>1</edge_type> <source_obj>39</source_obj> <sink_obj>55</sink_obj> </item> <item class_id_reference="20" object_id="_115"> <id>126</id> <edge_type>2</edge_type> <source_obj>63</source_obj> <sink_obj>56</sink_obj> </item> <item class_id_reference="20" object_id="_116"> <id>127</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>52</sink_obj> </item> <item class_id_reference="20" object_id="_117"> <id>128</id> <edge_type>1</edge_type> <source_obj>52</source_obj> <sink_obj>53</sink_obj> </item> <item class_id_reference="20" object_id="_118"> <id>129</id> <edge_type>2</edge_type> <source_obj>57</source_obj> <sink_obj>53</sink_obj> </item> <item class_id_reference="20" object_id="_119"> <id>130</id> <edge_type>2</edge_type> <source_obj>60</source_obj> <sink_obj>53</sink_obj> </item> <item class_id_reference="20" object_id="_120"> <id>131</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>30</sink_obj> </item> <item class_id_reference="20" object_id="_121"> <id>134</id> <edge_type>1</edge_type> <source_obj>24</source_obj> <sink_obj>34</sink_obj> </item> <item class_id_reference="20" object_id="_122"> <id>135</id> <edge_type>1</edge_type> <source_obj>115</source_obj> <sink_obj>34</sink_obj> </item> <item class_id_reference="20" object_id="_123"> <id>137</id> <edge_type>1</edge_type> <source_obj>136</source_obj> <sink_obj>34</sink_obj> </item> <item class_id_reference="20" object_id="_124"> <id>138</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>35</sink_obj> </item> <item class_id_reference="20" object_id="_125"> <id>140</id> <edge_type>1</edge_type> <source_obj>139</source_obj> <sink_obj>35</sink_obj> </item> <item class_id_reference="20" object_id="_126"> <id>141</id> <edge_type>1</edge_type> <source_obj>24</source_obj> <sink_obj>36</sink_obj> </item> <item class_id_reference="20" object_id="_127"> <id>143</id> <edge_type>1</edge_type> <source_obj>142</source_obj> <sink_obj>36</sink_obj> </item> <item class_id_reference="20" object_id="_128"> <id>144</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>37</sink_obj> </item> <item class_id_reference="20" object_id="_129"> <id>145</id> <edge_type>1</edge_type> <source_obj>36</source_obj> <sink_obj>37</sink_obj> </item> <item class_id_reference="20" object_id="_130"> <id>146</id> <edge_type>1</edge_type> <source_obj>24</source_obj> <sink_obj>37</sink_obj> </item> <item class_id_reference="20" object_id="_131"> <id>149</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>38</sink_obj> </item> <item class_id_reference="20" object_id="_132"> <id>150</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>39</sink_obj> </item> <item class_id_reference="20" object_id="_133"> <id>151</id> <edge_type>1</edge_type> <source_obj>74</source_obj> <sink_obj>39</sink_obj> </item> <item class_id_reference="20" object_id="_134"> <id>152</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>39</sink_obj> </item> <item class_id_reference="20" object_id="_135"> <id>153</id> <edge_type>1</edge_type> <source_obj>39</source_obj> <sink_obj>40</sink_obj> </item> <item class_id_reference="20" object_id="_136"> <id>154</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>41</sink_obj> </item> <item class_id_reference="20" object_id="_137"> <id>155</id> <edge_type>1</edge_type> <source_obj>74</source_obj> <sink_obj>41</sink_obj> </item> <item class_id_reference="20" object_id="_138"> <id>156</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>41</sink_obj> </item> <item class_id_reference="20" object_id="_139"> <id>157</id> <edge_type>1</edge_type> <source_obj>41</source_obj> <sink_obj>42</sink_obj> </item> <item class_id_reference="20" object_id="_140"> <id>158</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>43</sink_obj> </item> <item class_id_reference="20" object_id="_141"> <id>159</id> <edge_type>2</edge_type> <source_obj>51</source_obj> <sink_obj>43</sink_obj> </item> <item class_id_reference="20" object_id="_142"> <id>160</id> <edge_type>2</edge_type> <source_obj>54</source_obj> <sink_obj>43</sink_obj> </item> <item class_id_reference="20" object_id="_143"> <id>161</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>45</sink_obj> </item> <item class_id_reference="20" object_id="_144"> <id>162</id> <edge_type>1</edge_type> <source_obj>45</source_obj> <sink_obj>46</sink_obj> </item> <item class_id_reference="20" object_id="_145"> <id>163</id> <edge_type>1</edge_type> <source_obj>42</source_obj> <sink_obj>46</sink_obj> </item> <item class_id_reference="20" object_id="_146"> <id>164</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>46</sink_obj> </item> <item class_id_reference="20" object_id="_147"> <id>165</id> <edge_type>1</edge_type> <source_obj>45</source_obj> <sink_obj>47</sink_obj> </item> <item class_id_reference="20" object_id="_148"> <id>166</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>47</sink_obj> </item> <item class_id_reference="20" object_id="_149"> <id>167</id> <edge_type>1</edge_type> <source_obj>42</source_obj> <sink_obj>47</sink_obj> </item> <item class_id_reference="20" object_id="_150"> <id>170</id> <edge_type>1</edge_type> <source_obj>38</source_obj> <sink_obj>48</sink_obj> </item> <item class_id_reference="20" object_id="_151"> <id>171</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>48</sink_obj> </item> <item class_id_reference="20" object_id="_152"> <id>172</id> <edge_type>1</edge_type> <source_obj>46</source_obj> <sink_obj>48</sink_obj> </item> <item class_id_reference="20" object_id="_153"> <id>175</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>49</sink_obj> </item> <item class_id_reference="20" object_id="_154"> <id>176</id> <edge_type>1</edge_type> <source_obj>48</source_obj> <sink_obj>49</sink_obj> </item> <item class_id_reference="20" object_id="_155"> <id>177</id> <edge_type>2</edge_type> <source_obj>54</source_obj> <sink_obj>50</sink_obj> </item> <item class_id_reference="20" object_id="_156"> <id>178</id> <edge_type>1</edge_type> <source_obj>38</source_obj> <sink_obj>58</sink_obj> </item> <item class_id_reference="20" object_id="_157"> <id>179</id> <edge_type>1</edge_type> <source_obj>41</source_obj> <sink_obj>58</sink_obj> </item> <item class_id_reference="20" object_id="_158"> <id>180</id> <edge_type>2</edge_type> <source_obj>63</source_obj> <sink_obj>59</sink_obj> </item> <item class_id_reference="20" object_id="_159"> <id>281</id> <edge_type>2</edge_type> <source_obj>10</source_obj> <sink_obj>17</sink_obj> </item> <item class_id_reference="20" object_id="_160"> <id>282</id> <edge_type>2</edge_type> <source_obj>17</source_obj> <sink_obj>69</sink_obj> </item> <item class_id_reference="20" object_id="_161"> <id>283</id> <edge_type>2</edge_type> <source_obj>17</source_obj> <sink_obj>23</sink_obj> </item> <item class_id_reference="20" object_id="_162"> <id>284</id> <edge_type>2</edge_type> <source_obj>23</source_obj> <sink_obj>29</sink_obj> </item> <item class_id_reference="20" object_id="_163"> <id>285</id> <edge_type>2</edge_type> <source_obj>29</source_obj> <sink_obj>67</sink_obj> </item> <item class_id_reference="20" object_id="_164"> <id>286</id> <edge_type>2</edge_type> <source_obj>29</source_obj> <sink_obj>44</sink_obj> </item> <item class_id_reference="20" object_id="_165"> <id>287</id> <edge_type>2</edge_type> <source_obj>44</source_obj> <sink_obj>54</sink_obj> </item> <item class_id_reference="20" object_id="_166"> <id>288</id> <edge_type>2</edge_type> <source_obj>44</source_obj> <sink_obj>51</sink_obj> </item> <item class_id_reference="20" object_id="_167"> <id>289</id> <edge_type>2</edge_type> <source_obj>51</source_obj> <sink_obj>54</sink_obj> </item> <item class_id_reference="20" object_id="_168"> <id>290</id> <edge_type>2</edge_type> <source_obj>54</source_obj> <sink_obj>60</sink_obj> </item> <item class_id_reference="20" object_id="_169"> <id>291</id> <edge_type>2</edge_type> <source_obj>54</source_obj> <sink_obj>57</sink_obj> </item> <item class_id_reference="20" object_id="_170"> <id>292</id> <edge_type>2</edge_type> <source_obj>57</source_obj> <sink_obj>63</sink_obj> </item> <item class_id_reference="20" object_id="_171"> <id>293</id> <edge_type>2</edge_type> <source_obj>60</source_obj> <sink_obj>63</sink_obj> </item> <item class_id_reference="20" object_id="_172"> <id>294</id> <edge_type>2</edge_type> <source_obj>63</source_obj> <sink_obj>29</sink_obj> </item> <item class_id_reference="20" object_id="_173"> <id>295</id> <edge_type>2</edge_type> <source_obj>67</source_obj> <sink_obj>17</sink_obj> </item> <item class_id_reference="20" object_id="_174"> <id>296</id> <edge_type>4</edge_type> <source_obj>42</source_obj> <sink_obj>58</sink_obj> </item> <item class_id_reference="20" object_id="_175"> <id>297</id> <edge_type>4</edge_type> <source_obj>40</source_obj> <sink_obj>55</sink_obj> </item> </edges> </cdfg> <cdfg_regions class_id="21" tracking_level="0" version="0"> <count>7</count> <item_version>0</item_version> <item class_id="22" tracking_level="1" version="0" object_id="_176"> <mId>1</mId> <mTag>call_Loop_LB2D_buf_p</mTag> <mType>0</mType> <sub_regions> <count>3</count> <item_version>0</item_version> <item>2</item> <item>3</item> <item>7</item> </sub_regions> <basic_blocks> <count>0</count> <item_version>0</item_version> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>2077921</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_177"> <mId>2</mId> <mTag>Entry</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>1</count> <item_version>0</item_version> <item>10</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_178"> <mId>3</mId> <mTag>LB2D_buf</mTag> <mType>1</mType> <sub_regions> <count>3</count> <item_version>0</item_version> <item>4</item> <item>5</item> <item>6</item> </sub_regions> <basic_blocks> <count>0</count> <item_version>0</item_version> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>1080</mMinTripCount> <mMaxTripCount>1080</mMaxTripCount> <mMinLatency>2077920</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_179"> <mId>4</mId> <mTag>Region 1</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>17</item> <item>23</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_180"> <mId>5</mId> <mTag>LB2D_buf.1</mTag> <mType>1</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>7</count> <item_version>0</item_version> <item>29</item> <item>44</item> <item>51</item> <item>54</item> <item>57</item> <item>60</item> <item>63</item> </basic_blocks> <mII>1</mII> <mDepth>3</mDepth> <mMinTripCount>1920</mMinTripCount> <mMaxTripCount>1920</mMaxTripCount> <mMinLatency>1921</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_181"> <mId>6</mId> <mTag>Region 2</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>1</count> <item_version>0</item_version> <item>67</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_182"> <mId>7</mId> <mTag>Return</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>1</count> <item_version>0</item_version> <item>69</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> </cdfg_regions> <fsm class_id="24" tracking_level="1" version="0" object_id="_183"> <states class_id="25" tracking_level="0" version="0"> <count>6</count> <item_version>0</item_version> <item class_id="26" tracking_level="1" version="0" object_id="_184"> <id>1</id> <operations class_id="27" tracking_level="0" version="0"> <count>7</count> <item_version>0</item_version> <item class_id="28" tracking_level="1" version="0" object_id="_185"> <id>3</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_186"> <id>4</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_187"> <id>5</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_188"> <id>6</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_189"> <id>7</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_190"> <id>8</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_191"> <id>9</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_192"> <id>2</id> <operations> <count>12</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_193"> <id>11</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_194"> <id>12</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_195"> <id>13</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_196"> <id>14</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_197"> <id>15</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_198"> <id>16</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_199"> <id>18</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_200"> <id>19</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_201"> <id>20</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_202"> <id>21</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_203"> <id>22</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_204"> <id>68</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_205"> <id>3</id> <operations> <count>13</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_206"> <id>24</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_207"> <id>25</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_208"> <id>26</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_209"> <id>27</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_210"> <id>28</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_211"> <id>30</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_212"> <id>34</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_213"> <id>35</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_214"> <id>39</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_215"> <id>40</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_216"> <id>41</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_217"> <id>42</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_218"> <id>43</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_219"> <id>4</id> <operations> <count>8</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_220"> <id>36</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_221"> <id>37</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_222"> <id>38</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_223"> <id>40</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_224"> <id>42</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_225"> <id>45</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_226"> <id>52</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_227"> <id>53</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_228"> <id>5</id> <operations> <count>14</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_229"> <id>31</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_230"> <id>32</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_231"> <id>33</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_232"> <id>46</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_233"> <id>47</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_234"> <id>48</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_235"> <id>49</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_236"> <id>50</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_237"> <id>55</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_238"> <id>56</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_239"> <id>58</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_240"> <id>59</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_241"> <id>61</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_242"> <id>62</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_243"> <id>6</id> <operations> <count>3</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_244"> <id>64</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_245"> <id>65</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_246"> <id>66</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> </states> <transitions class_id="29" tracking_level="0" version="0"> <count>7</count> <item_version>0</item_version> <item class_id="30" tracking_level="1" version="0" object_id="_247"> <inState>1</inState> <outState>2</outState> <condition class_id="31" tracking_level="0" version="0"> <id>55</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="_248"> <inState>2</inState> <outState>3</outState> <condition> <id>57</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item class_id="34" tracking_level="0" version="0"> <first class_id="35" tracking_level="0" version="0"> <first>13</first> <second>0</second> </first> <second>1</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_249"> <inState>6</inState> <outState>2</outState> <condition> <id>68</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_250"> <inState>4</inState> <outState>5</outState> <condition> <id>70</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_251"> <inState>5</inState> <outState>3</outState> <condition> <id>71</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="_252"> <inState>3</inState> <outState>6</outState> <condition> <id>69</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>26</first> <second>0</second> </first> <second>0</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_253"> <inState>3</inState> <outState>4</outState> <condition> <id>72</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>26</first> <second>0</second> </first> <second>1</second> </item> </item> </sop> </condition> </item> </transitions> </fsm> <res class_id="-1"></res> <node_label_latency class_id="37" tracking_level="0" version="0"> <count>43</count> <item_version>0</item_version> <item class_id="38" tracking_level="0" version="0"> <first>7</first> <second class_id="39" tracking_level="0" version="0"> <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>11</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>12</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>13</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>15</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>16</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>20</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>21</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>22</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>24</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>25</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>26</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>27</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>28</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>30</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>34</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>35</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>36</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>37</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>38</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>39</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>40</first> <second> <first>2</first> <second>1</second> </second> </item> <item> <first>41</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>42</first> <second> <first>2</first> <second>1</second> </second> </item> <item> <first>43</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>45</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>46</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>47</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>48</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>49</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>50</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>52</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>53</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>55</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>56</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>58</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>59</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>62</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>64</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>66</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>68</first> <second> <first>1</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="40" tracking_level="0" version="0"> <count>12</count> <item_version>0</item_version> <item class_id="41" tracking_level="0" version="0"> <first>10</first> <second class_id="42" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>17</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>23</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>29</first> <second> <first>2</first> <second>2</second> </second> </item> <item> <first>44</first> <second> <first>2</first> <second>4</second> </second> </item> <item> <first>51</first> <second> <first>3</first> <second>4</second> </second> </item> <item> <first>54</first> <second> <first>3</first> <second>3</second> </second> </item> <item> <first>57</first> <second> <first>4</first> <second>4</second> </second> </item> <item> <first>60</first> <second> <first>4</first> <second>4</second> </second> </item> <item> <first>63</first> <second> <first>4</first> <second>4</second> </second> </item> <item> <first>67</first> <second> <first>3</first> <second>3</second> </second> </item> <item> <first>69</first> <second> <first>1</first> <second>1</second> </second> </item> </bblk_ent_exit> <regions class_id="43" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="44" tracking_level="1" version="0" object_id="_254"> <region_name>LB2D_buf.1</region_name> <basic_blocks> <count>7</count> <item_version>0</item_version> <item>29</item> <item>44</item> <item>51</item> <item>54</item> <item>57</item> <item>60</item> <item>63</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>3</pipe_depth> </item> </regions> <dp_fu_nodes class_id="45" tracking_level="0" version="0"> <count>29</count> <item_version>0</item_version> <item class_id="46" tracking_level="0" version="0"> <first>74</first> <second> <count>1</count> <item_version>0</item_version> <item>7</item> </second> </item> <item> <first>78</first> <second> <count>1</count> <item_version>0</item_version> <item>8</item> </second> </item> <item> <first>82</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>88</first> <second> <count>1</count> <item_version>0</item_version> <item>49</item> </second> </item> <item> <first>95</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> <item> <first>101</first> <second> <count>3</count> <item_version>0</item_version> <item>40</item> <item>40</item> <item>55</item> </second> </item> <item> <first>106</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>112</first> <second> <count>3</count> <item_version>0</item_version> <item>42</item> <item>42</item> <item>58</item> </second> </item> <item> <first>127</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>139</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>149</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>161</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>168</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>174</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>180</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>190</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>196</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>202</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> <item> <first>208</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>214</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>224</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>230</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>236</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>243</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>247</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>251</first> <second> <count>1</count> <item_version>0</item_version> <item>46</item> </second> </item> <item> <first>256</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>261</first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> <item> <first>271</first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> </dp_fu_nodes> <dp_fu_nodes_expression class_id="48" tracking_level="0" version="0"> <count>25</count> <item_version>0</item_version> <item class_id="49" tracking_level="0" version="0"> <first>buffer_0_value_V_ad_gep_fu_95</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> <item> <first>buffer_0_value_V_alloca_fu_74</first> <second> <count>1</count> <item_version>0</item_version> <item>7</item> </second> </item> <item> <first>buffer_1_value_V_ad_gep_fu_106</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>buffer_1_value_V_alloca_fu_78</first> <second> <count>1</count> <item_version>0</item_version> <item>8</item> </second> </item> <item> <first>col_1_fu_202</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> <item> <first>col_cast_fu_208</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>col_phi_fu_161</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>icmp1_fu_224</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>icmp_fu_190</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>p_Result_s_fu_261</first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> <item> <first>p_Val2_2_0_phi_fu_251</first> <second> <count>1</count> <item_version>0</item_version> <item>46</item> </second> </item> <item> <first>p_Val2_2_1_phi_fu_256</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>p_write_idx_1_1_fu_236</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>row_1_fu_174</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>row_phi_fu_139</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>tmp_10_fu_247</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>tmp_2_fu_196</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>tmp_6_fu_180</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>tmp_8_fu_214</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>tmp_9_fu_243</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>tmp_fu_168</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>write_idx_1_1_phi_fu_149</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>write_idx_1_2_fu_271</first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> <item> <first>write_idx_1_3_fu_230</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>write_idx_1_phi_fu_127</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> </dp_fu_nodes_expression> <dp_fu_nodes_module> <count>0</count> <item_version>0</item_version> </dp_fu_nodes_module> <dp_fu_nodes_io> <count>2</count> <item_version>0</item_version> <item> <first>StgValue_53_write_fu_88</first> <second> <count>1</count> <item_version>0</item_version> <item>49</item> </second> </item> <item> <first>tmp_value_V_2_read_fu_82</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> </dp_fu_nodes_io> <return_ports> <count>0</count> <item_version>0</item_version> </return_ports> <dp_mem_port_nodes class_id="50" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="51" tracking_level="0" version="0"> <first class_id="52" tracking_level="0" version="0"> <first>buffer_0_value_V</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>40</item> <item>40</item> </second> </item> <item> <first> <first>buffer_0_value_V</first> <second>1</second> </first> <second> <count>1</count> <item_version>0</item_version> <item>55</item> </second> </item> <item> <first> <first>buffer_1_value_V</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>42</item> <item>42</item> </second> </item> <item> <first> <first>buffer_1_value_V</first> <second>1</second> </first> <second> <count>1</count> <item_version>0</item_version> <item>58</item> </second> </item> </dp_mem_port_nodes> <dp_reg_nodes> <count>19</count> <item_version>0</item_version> <item> <first>123</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>135</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>146</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>157</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>277</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>281</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>286</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>290</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>294</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> <item> <first>299</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>304</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> <item> <first>310</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>316</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>321</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>328</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>334</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>340</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>346</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>350</first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> </dp_reg_nodes> <dp_regname_nodes> <count>19</count> <item_version>0</item_version> <item> <first>buffer_0_value_V_ad_reg_304</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> <item> <first>buffer_0_value_V_lo_reg_328</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>buffer_1_value_V_ad_reg_310</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>buffer_1_value_V_lo_reg_334</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>col_1_reg_294</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> <item> <first>col_reg_157</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>icmp1_reg_299</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>icmp_reg_286</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>p_write_idx_1_1_reg_316</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>row_1_reg_281</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>row_reg_135</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>tmp_10_reg_346</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>tmp_2_reg_290</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>tmp_9_reg_340</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>tmp_reg_277</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>tmp_value_V_2_reg_321</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>write_idx_1_1_reg_146</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>write_idx_1_2_reg_350</first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> <item> <first>write_idx_1_reg_123</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> </dp_regname_nodes> <dp_reg_phi> <count>4</count> <item_version>0</item_version> <item> <first>123</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>135</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>146</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>157</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> </dp_reg_phi> <dp_regname_phi> <count>4</count> <item_version>0</item_version> <item> <first>col_reg_157</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>row_reg_135</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>write_idx_1_1_reg_146</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>write_idx_1_reg_123</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> </dp_regname_phi> <dp_port_io_nodes class_id="53" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="54" tracking_level="0" version="0"> <first>in_stream_V_value_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> </second> </item> <item> <first>slice_stream_V_value_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>1</count> <item_version>0</item_version> <item>49</item> </second> </item> </second> </item> </dp_port_io_nodes> <port2core class_id="55" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="56" tracking_level="0" version="0"> <first>1</first> <second>FIFO_SRL</second> </item> <item> <first>2</first> <second>FIFO_SRL</second> </item> </port2core> <node2core> <count>2</count> <item_version>0</item_version> <item> <first>7</first> <second>RAM</second> </item> <item> <first>8</first> <second>RAM</second> </item> </node2core> </syndb> </boost_serialization>

25.896873

137

0.59185

8b5bea53f5c50df9da2fa1993065af15c9fc978c

5,195

ads

Ada

source/amf/uml/amf-uml-string_expressions-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-string_expressions-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-string_expressions-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.String_Expressions.Collections is pragma Preelaborate; package UML_String_Expression_Collections is new AMF.Generic_Collections (UML_String_Expression, UML_String_Expression_Access); type Set_Of_UML_String_Expression is new UML_String_Expression_Collections.Set with null record; Empty_Set_Of_UML_String_Expression : constant Set_Of_UML_String_Expression; type Ordered_Set_Of_UML_String_Expression is new UML_String_Expression_Collections.Ordered_Set with null record; Empty_Ordered_Set_Of_UML_String_Expression : constant Ordered_Set_Of_UML_String_Expression; type Bag_Of_UML_String_Expression is new UML_String_Expression_Collections.Bag with null record; Empty_Bag_Of_UML_String_Expression : constant Bag_Of_UML_String_Expression; type Sequence_Of_UML_String_Expression is new UML_String_Expression_Collections.Sequence with null record; Empty_Sequence_Of_UML_String_Expression : constant Sequence_Of_UML_String_Expression; private Empty_Set_Of_UML_String_Expression : constant Set_Of_UML_String_Expression := (UML_String_Expression_Collections.Set with null record); Empty_Ordered_Set_Of_UML_String_Expression : constant Ordered_Set_Of_UML_String_Expression := (UML_String_Expression_Collections.Ordered_Set with null record); Empty_Bag_Of_UML_String_Expression : constant Bag_Of_UML_String_Expression := (UML_String_Expression_Collections.Bag with null record); Empty_Sequence_Of_UML_String_Expression : constant Sequence_Of_UML_String_Expression := (UML_String_Expression_Collections.Sequence with null record); end AMF.UML.String_Expressions.Collections;

56.467391

94

0.53436

03dedb4f42613ef4a08f57a07b42fe7a2d1c9082

3,227

ads

Ada

gcc-gcc-7_3_0-release/gcc/ada/s-pack19.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/ada/s-pack19.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/ada/s-pack19.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . P A C K _ 1 9 -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2014, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- Handling of packed arrays with Component_Size = 19 package System.Pack_19 is pragma Preelaborate; Bits : constant := 19; type Bits_19 is mod 2 ** Bits; for Bits_19'Size use Bits; -- In all subprograms below, Rev_SSO is set True if the array has the -- non-default scalar storage order. function Get_19 (Arr : System.Address; N : Natural; Rev_SSO : Boolean) return Bits_19 with Inline; -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is extracted and returned. procedure Set_19 (Arr : System.Address; N : Natural; E : Bits_19; Rev_SSO : Boolean) with Inline; -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is set to the given value. end System.Pack_19;

52.901639

78

0.439727

03b7d4b0ca58a2b58e4daec249b3a05d7466276c

1,022

adb

Ada

src/API/protypo-api-engine_values-indefinite_vector_wrappers.adb

fintatarta/protypo

c0c2bca17bc766ab95acc99b7422485388a10cb4

[ "MIT" ]

null

src/API/protypo-api-engine_values-indefinite_vector_wrappers.adb

fintatarta/protypo

c0c2bca17bc766ab95acc99b7422485388a10cb4

[ "MIT" ]

4

2019-10-09T11:16:38.000Z

2019-10-09T11:20:38.000Z

src/API/protypo-api-engine_values-indefinite_vector_wrappers.adb

fintatarta/protypo

c0c2bca17bc766ab95acc99b7422485388a10cb4

[ "MIT" ]

null

pragma Ada_2012; package body Protypo.Api.Engine_Values.Indefinite_Vector_Wrappers is ------------------ -- Make_Wrapper -- ------------------ function Make_Wrapper (Init : Element_Vectors.Vector) return Handlers.Ambivalent_Interface_Access is Val : Engine_Value_Vectors.Vector; begin for Element of Init loop Val.Append (Create (Element)); end loop; return new Array_Wrapper'(A => Engine_Value_Array_Wrappers.Make_Wrapper (Val)); end Make_Wrapper; --------- -- Set -- --------- procedure Set (Container : in out Array_Wrapper; Index : Index_Type; Value : Element_Type) is begin Container.A.Set (Integer (Index), Create (Value)); end Set; ------------ -- Append -- ------------ procedure Append (Container : in out Array_Wrapper; Value : Element_Type) is begin Container.A.Append (Create (Value)); end Append; end Protypo.Api.Engine_Values.Indefinite_Vector_Wrappers;

20.857143

85

0.608611

a0e2edabc7313bbd3f2e70d77314fd5d6d55fb90

3,030

adb

Ada

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-stunau.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-stunau.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-stunau.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . S T R I N G S . U N B O U N D E D . A U X -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2020, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ package body Ada.Strings.Unbounded.Aux is ---------------- -- Get_String -- ---------------- procedure Get_String (U : Unbounded_String; S : out Big_String_Access; L : out Natural) is X : aliased Big_String; for X'Address use U.Reference.all'Address; begin S := X'Unchecked_Access; L := U.Last; end Get_String; ---------------- -- Set_String -- ---------------- procedure Set_String (UP : in out Unbounded_String; S : String_Access) is begin Finalize (UP); UP.Reference := S; UP.Last := UP.Reference'Length; end Set_String; end Ada.Strings.Unbounded.Aux;

48.095238

78

0.408581

386e5a36fb3f5f6fc6e4fb10c890b2e5d3551868

12,662

ada

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c35507c.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c35507c.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c35507c.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- C35507C.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 THE ATTRIBUTES 'IMAGE' AND 'VALUE' YIELD THE CORRECT -- RESULTS WHEN THE PREFIX IS A CHARACTER TYPE. -- SUBTESTS ARE: -- (A). TESTS FOR IMAGE. -- (B). TESTS FOR VALUE. -- HISTORY: -- RJW 05/29/86 CREATED ORIGINAL TEST. -- BCB 08/18/87 CHANGED HEADER TO STANDARD HEADER FORMAT. -- CORRECTED ERROR MESSAGES AND ADDED CALLS TO -- IDENT_STR. WITH REPORT; USE REPORT; PROCEDURE C35507C IS TYPE CHAR IS ('A', 'a'); TYPE NEWCHAR IS NEW CHAR; FUNCTION IDENT (CH : CHAR) RETURN CHAR IS BEGIN RETURN CHAR'VAL (IDENT_INT (CHAR'POS (CH))); END IDENT; FUNCTION IDENT (CH : NEWCHAR) RETURN NEWCHAR IS BEGIN RETURN NEWCHAR'VAL (IDENT_INT (NEWCHAR'POS (CH))); END IDENT; PROCEDURE CHECK_BOUND (STR1, STR2 : STRING) IS BEGIN IF STR1'FIRST /= 1 THEN FAILED ( "INCORRECT LOWER BOUND FOR " & STR2 & "'IMAGE ('" & STR1 & "')" ); END IF; END CHECK_BOUND; BEGIN TEST( "C35507C" , "CHECK THAT THE ATTRIBUTES 'IMAGE' AND " & "'VALUE' YIELD THE CORRECT RESULTS WHEN THE " & "PREFIX IS A CHARACTER TYPE" ); BEGIN -- (A). IF CHAR'IMAGE ('A') /= "'A'" THEN FAILED ( "INCORRECT IMAGE FOR CHAR'('A')" ); END IF; CHECK_BOUND (CHAR'IMAGE ('A'), "CHAR"); IF CHAR'IMAGE ('a') /= "'a'" THEN FAILED ( "INCORRECT IMAGE FOR CHAR'('a')" ); END IF; CHECK_BOUND (CHAR'IMAGE ('a'), "CHAR"); IF NEWCHAR'IMAGE ('A') /= "'A'" THEN FAILED ( "INCORRECT IMAGE FOR NEWCHAR'('A')" ); END IF; CHECK_BOUND (NEWCHAR'IMAGE ('A'), "NEWCHAR"); IF NEWCHAR'IMAGE ('a') /= "'a'" THEN FAILED ( "INCORRECT IMAGE FOR NEWCHAR'('a')" ); END IF; CHECK_BOUND (NEWCHAR'IMAGE ('a'), "NEWCHAR"); IF CHAR'IMAGE (IDENT ('A')) /= "'A'" THEN FAILED ( "INCORRECT IMAGE FOR CHAR'( IDENT ('A'))" ); END IF; CHECK_BOUND (CHAR'IMAGE (IDENT ('A')), "IDENT OF CHAR"); IF CHAR'IMAGE (IDENT ('a')) /= "'a'" THEN FAILED ( "INCORRECT IMAGE FOR CHAR'( IDENT ('a'))" ); END IF; CHECK_BOUND (CHAR'IMAGE (IDENT ('a')), "IDENT OF CHAR"); IF NEWCHAR'IMAGE (IDENT ('A')) /= "'A'" THEN FAILED ( "INCORRECT IMAGE FOR NEWCHAR'( IDENT ('A'))" ); END IF; CHECK_BOUND (NEWCHAR'IMAGE (IDENT ('A')), "IDENT OF NEWCHAR"); IF NEWCHAR'IMAGE (IDENT ('a')) /= "'a'" THEN FAILED ( "INCORRECT IMAGE FOR NEWCHAR'( IDENT ('a'))" ); END IF; CHECK_BOUND (NEWCHAR'IMAGE (IDENT ('a')), "IDENT OF NEWCHAR"); FOR CH IN CHARACTER'VAL (32) .. CHARACTER'VAL (126) LOOP IF CHARACTER'IMAGE (CH) /= ("'" & CH) & "'" THEN FAILED ( "INCORRECT IMAGE FOR CHARACTER'(" & CH & ")" ); END IF; CHECK_BOUND (CHARACTER'IMAGE (CH), "CHARACTER"); END LOOP; FOR CH IN CHARACTER'VAL (0) .. CHARACTER'VAL (31) LOOP CHECK_BOUND (CHARACTER'IMAGE (CH), "CHARACTER"); END LOOP; CHECK_BOUND (CHARACTER'IMAGE (CHARACTER'VAL (127)), "CHARACTER"); END; --------------------------------------------------------------- DECLARE -- (B). SUBTYPE SUBCHAR IS CHARACTER RANGE CHARACTER'VAL (127) .. CHARACTER'VAL (127); BEGIN FOR CH IN CHARACTER'VAL (32) .. CHARACTER'VAL (126) LOOP IF SUBCHAR'VALUE (("'" & CH) & "'") /= CH THEN FAILED ( "INCORRECT SUBCHAR'VALUE FOR " & CH ); END IF; END LOOP; FOR CH IN CHARACTER'VAL (0) .. CHARACTER'VAL (31) LOOP IF SUBCHAR'VALUE (CHARACTER'IMAGE (CH)) /= CH THEN FAILED ( "INCORRECT SUBCHAR'VALUE FOR " & CHARACTER'IMAGE (CH) ); END IF; END LOOP; IF SUBCHAR'VALUE (CHARACTER'IMAGE (CHARACTER'VAL (127))) /= CHARACTER'VAL (127) THEN FAILED ( "INCORRECT SUBCHAR'VALUE FOR " & "CHARACTER'VAL (127)" ); END IF; END; BEGIN IF CHAR'VALUE ("'A'") /= 'A' THEN FAILED ( "INCORRECT VALUE FOR CHAR'(""'A'"")" ); END IF; IF CHAR'VALUE ("'a'") /= 'a' THEN FAILED ( "INCORRECT VALUE FOR CHAR'(""'a'"")" ); END IF; IF NEWCHAR'VALUE ("'A'") /= 'A' THEN FAILED ( "INCORRECT VALUE FOR NEWCHAR'(""'A'"")" ); END IF; IF NEWCHAR'VALUE ("'a'") /= 'a' THEN FAILED ( "INCORRECT VALUE FOR NEWCHAR'(""'a'"")" ); END IF; END; BEGIN IF CHAR'VALUE (IDENT_STR("'A'")) /= 'A' THEN FAILED ( "INCORRECT VALUE FOR CHAR'(IDENT_STR" & "(""'A'""))" ); END IF; IF CHAR'VALUE (IDENT_STR("'a'")) /= 'a' THEN FAILED ( "INCORRECT VALUE FOR CHAR'(IDENT_STR" & "(""'a'""))" ); END IF; IF NEWCHAR'VALUE (IDENT_STR("'A'")) /= 'A' THEN FAILED ( "INCORRECT VALUE FOR NEWCHAR'(IDENT_STR" & "(""'A'""))" ); END IF; IF NEWCHAR'VALUE (IDENT_STR("'a'")) /= 'a' THEN FAILED ( "INCORRECT VALUE FOR NEWCHAR'(IDENT_STR" & "(""'a'""))" ); END IF; END; BEGIN IF CHAR'VALUE (IDENT_STR ("'B'")) = 'A' THEN FAILED ( "NO EXCEPTION RAISED " & "FOR CHAR'VALUE (IDENT_STR (""'B'"")) - 1" ); ELSE FAILED ( "NO EXCEPTION RAISED " & "FOR CHAR'VALUE (IDENT_STR (""'B'"")) - 2" ); END IF; EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ( "WRONG EXCEPTION RAISED " & "FOR CHAR'VALUE (IDENT_STR (""'B'""))" ); END; BEGIN IF CHARACTER'VALUE (IDENT_CHAR (ASCII.HT) & "'A'") = 'A' THEN FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE " & "(IDENT_CHAR (ASCII.HT) & ""'A'"") - 1" ); ELSE FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE " & "(IDENT_CHAR (ASCII.HT) & ""'A'"") - 2" ); END IF; EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ( "WRONG EXCEPTION RAISED " & "FOR CHARACTER'VALUE " & "(IDENT_CHAR (ASCII.HT) & ""'A'"")" ); END; BEGIN IF CHARACTER'VALUE ("'B'" & IDENT_CHAR (ASCII.HT)) = 'B' THEN FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (""'B'"" & " & "IDENT_CHAR (ASCII.HT)) - 1" ); ELSE FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (""'B'"" & " & "IDENT_CHAR (ASCII.HT)) - 2" ); END IF; EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ( "WRONG EXCEPTION RAISED " & "FOR CHARACTER'VALUE (""'B'"" & " & "IDENT_CHAR (ASCII.HT)) " ); END; BEGIN IF CHARACTER'VALUE ("'C'" & IDENT_CHAR (ASCII.BEL)) = 'C' THEN FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (""'C'"" & " & "IDENT_CHAR (ASCII.BEL)) - 1" ); ELSE FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (""'C'"" & " & "IDENT_CHAR (ASCII.BEL)) - 2" ); END IF; EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ( "WRONG EXCEPTION RAISED " & "FOR CHARACTER'VALUE (""'C'"" & " & "IDENT_CHAR (ASCII.BEL))" ); END; BEGIN IF CHARACTER'VALUE (IDENT_STR ("'")) = ''' THEN FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (IDENT_STR (""'"")) - 1" ); ELSE FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (IDENT_STR (""'"")) - 2" ); END IF; EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ( "WRONG EXCEPTION RAISED " & "FOR CHARACTER'VALUE (IDENT_STR (""'""))" ); END; BEGIN IF CHARACTER'VALUE (IDENT_STR ("''")) = ''' THEN FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (IDENT_STR (""''"")) - 1" ); ELSE FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (IDENT_STR (""''"")) - 2" ); END IF; EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ( "WRONG EXCEPTION RAISED " & "FOR CHARACTER'VALUE (IDENT_STR (""''""))" ); END; BEGIN IF CHARACTER'VALUE (IDENT_STR ("'A")) = 'A' THEN FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (IDENT_STR (""'A"")) - 1" ); ELSE FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (IDENT_STR (""'A"")) - 2" ); END IF; EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ( "WRONG EXCEPTION RAISED " & "FOR CHARACTER'VALUE IDENT_STR (""'A""))" ); END; BEGIN IF CHARACTER'VALUE (IDENT_STR ("A'")) = 'A' THEN FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (IDENT_STR (""A'"")) - 1" ); ELSE FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (IDENT_STR (""A'"")) - 2" ); END IF; EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ( "WRONG EXCEPTION RAISED " & "FOR CHARACTER'VALUE (IDENT_STR (""A'""))" ); END; BEGIN IF CHARACTER'VALUE (IDENT_STR ("'AB'")) = 'A' THEN FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (IDENT_STR (""'AB'"")) - 1" ); ELSE FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (IDENT_STR (""'AB'"")) - 2" ); END IF; EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ( "WRONG EXCEPTION RAISED " & "FOR CHARACTER'VALUE IDENT_STR (""'AB'""))" ); END; RESULT; END C35507C;

35.074792

79

0.460038

4b538fd5d2e95d9538cb030d4f4c5ca06a15d378

6,728

ads

Ada

Validation/pyFrame3DD-master/gcc-master/gcc/ada/binderr.ads

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/binderr.ads

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/binderr.ads

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- B I N D E R R -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2020, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING3. If not, go to -- -- http://www.gnu.org/licenses for a complete copy of the license. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package contains the routines to output error messages for the binder -- and also the routines for handling fatal error conditions in the binder. with Namet; use Namet; with Types; use Types; package Binderr is Errors_Detected : Nat; -- Number of errors detected so far Warnings_Detected : Nat; -- Number of warnings detected Info_Prefix_Suppress : Boolean := False; -- If set to True, the normal "info: " header before messages generated -- by Error_Msg_Info will be omitted. --------------------------------------------------------- -- Error Message Text and Message Insertion Characters -- --------------------------------------------------------- -- Error message text strings are composed of letters, digits and the -- special characters space, comma, period, colon and semicolon, -- apostrophe and parentheses. Special insertion characters can also -- appear which cause the error message circuit to modify the given -- string as follows: -- Insertion character { (Left brace: insert file name from Names table) -- The character { is replaced by the text for the file name specified -- by the File_Name_Type value stored in Error_Msg_File_1. The name is -- always enclosed in quotes. A second { may appear in a single message -- in which case it is similarly replaced by the name which is -- specified by the File_Name_Type value stored in Error_Msg_File_2. -- Insertion character $ (Dollar: insert unit name from Names table) -- The character $ is replaced by the text for the unit name specified -- by the Name_Id value stored in Error_Msg_Unit_1. The name is always -- enclosed in quotes. A second $ may appear in a single message in -- which case it is similarly replaced by the name which is specified -- by the Name_Id value stored in Error_Msg_Unit_2. -- Insertion character # (Pound: insert non-negative number in decimal) -- The character # is replaced by the contents of Error_Msg_Nat_1 -- converted into an unsigned decimal string. A second # may appear -- in a single message, in which case it is similarly replaced by -- the value stored in Error_Msg_Nat_2. -- Insertion character ? (Question mark: warning message) -- The character ?, which must be the first character in the message -- string, signals a warning message instead of an error message. ----------------------------------------------------- -- Global Values Used for Error Message Insertions -- ----------------------------------------------------- -- The following global variables are essentially additional parameters -- passed to the error message routine for insertion sequences described -- above. The reason these are passed globally is that the insertion -- mechanism is essentially an untyped one in which the appropriate -- variables are set depending on the specific insertion characters used. Error_Msg_Name_1 : Name_Id; -- Name_Id value for % insertion characters in message Error_Msg_File_1 : File_Name_Type; Error_Msg_File_2 : File_Name_Type; -- Name_Id values for { insertion characters in message Error_Msg_Unit_1 : Unit_Name_Type; Error_Msg_Unit_2 : Unit_Name_Type; -- Name_Id values for $ insertion characters in message Error_Msg_Nat_1 : Nat; Error_Msg_Nat_2 : Nat; -- Integer values for # insertion characters in message ------------------------------ -- Error Output Subprograms -- ------------------------------ procedure Error_Msg (Msg : String); -- Output specified error message to standard error or standard output -- as governed by the brief and verbose switches, and update error -- counts appropriately. procedure Error_Msg_Info (Msg : String); -- Output information line. Indentical in effect to Error_Msg, except -- that the prefix is info: instead of error: and the error count is -- not incremented. The prefix may be suppressed by setting the global -- variable Info_Prefix_Suppress to True. procedure Error_Msg_Output (Msg : String; Info : Boolean); -- Output given message, with insertions, to current message output file. -- The second argument is True for an info message, false for a normal -- warning or error message. Normally this is not called directly, but -- rather only by Error_Msg or Error_Msg_Info. It is called directly -- when the caller must control whether the output goes to stderr or -- stdout (Error_Msg_Output always goes to the current output file). procedure Finalize_Binderr; -- Finalize error output for one file procedure Initialize_Binderr; -- Initialize error output for one file end Binderr;

50.586466

79

0.587545

2e2417db4688c656802de7fa31e762caec6c3b32

785

adb

Ada

testcases/fruit4/mylogger.adb

jrmarino/AdaBase

660f278613773dc4007c8b3fab21bcfddc1828b3

[ "0BSD" ]

30

2016-02-21T11:09:30.000Z

2021-12-08T14:12:32.000Z

testcases/fruit4/mylogger.adb

jrmarino/AdaBase

660f278613773dc4007c8b3fab21bcfddc1828b3

[ "0BSD" ]

3

2018-10-29T18:44:48.000Z

2022-03-12T23:14:20.000Z

testcases/fruit4/mylogger.adb

jrmarino/AdaBase

660f278613773dc4007c8b3fab21bcfddc1828b3

[ "0BSD" ]

3

2015-04-22T12:17:27.000Z

2017-01-19T14:29:59.000Z

with Ada.Text_IO.Unbounded_IO; package body MyLogger is package UIO renames Ada.Text_IO.Unbounded_IO; package TIO renames Ada.Text_IO; overriding procedure reaction (listener : CustomLogger) is begin if listener.is_error then TIO.Put_Line ("## SQLSTATE: " & listener.sqlstate); TIO.Put_Line ("## Driver:" & listener.error_code'Img & "(" & listener.driver'Img & ")"); TIO.Put ("## Error: "); UIO.Put_Line (listener.error_msg); TIO.Put_Line ("## Phase: " & listener.category'Img); else TIO.Put_Line ("## Phase: " & listener.category'Img); TIO.Put ("## message: "); UIO.Put_Line (listener.message); end if; end reaction; end MyLogger;

32.708333

75

0.583439

a080de1c59aa79d650708faee957c6e98c6abd9d

2,013

adb

Ada

Practica 03/Planificador_Ciclico_Sin_Prioridades/src/planificador_ciclico_sin_prioridades.adb

dpr1005/Tiempo-Real-Ejercicios

244911e9e9a2d8667649eb9f3d7417c39b340161

[ "BSD-3-Clause" ]

null

Practica 03/Planificador_Ciclico_Sin_Prioridades/src/planificador_ciclico_sin_prioridades.adb

dpr1005/Tiempo-Real-Ejercicios

244911e9e9a2d8667649eb9f3d7417c39b340161

[ "BSD-3-Clause" ]

null

Practica 03/Planificador_Ciclico_Sin_Prioridades/src/planificador_ciclico_sin_prioridades.adb

dpr1005/Tiempo-Real-Ejercicios

244911e9e9a2d8667649eb9f3d7417c39b340161

[ "BSD-3-Clause" ]

1

2022-03-06T17:37:39.000Z

with Ada.Text_IO, Ada.Calendar; use Ada.Text_IO, Ada.Calendar; procedure Planificador_Ciclico_Sin_Prioridades is Comienzo : Time := Clock; -- hora de comienzo -- Tarea principal task Principal is entry Ejecutar (Id: in Integer; Tiempo : in Integer); end Principal; task body Principal is Semaforo : Integer := 1; begin Put_Line("Principal - preparada"); loop select when Semaforo = 1 => accept Ejecutar (Id : in Integer; Tiempo : in Integer) do Semaforo := 0; Put_Line("+++Inicio Tarea" & Integer'Image(Id) & " " & Duration'Image(Clock-Comienzo)); delay Duration(Tiempo); Put_Line("+++Fin Tarea" & Integer'Image(Id) & " " & Duration'Image(Clock-Comienzo)); Semaforo := 1; end Ejecutar; end select; end loop; end Principal; -- Tareas dinamicas periodicas del planificador task type Tarea_Periodica(Id: Integer; T: Integer; D: Integer; C: Integer); type Tarea_Dinamica is access Tarea_Periodica; -- Cuerpo de las Tareas Periodicas task body Tarea_Periodica is Periodo : constant Duration := Duration(T); -- Segundos Proximo_Periodo : Time := Clock; begin loop -- Acciones Tarea Principal.Ejecutar(Id, C); -- Calculo del tiempo de nueva accion Proximo_Periodo := Proximo_Periodo + Periodo; delay until Proximo_Periodo; end loop; end Tarea_Periodica; -- Definicion de las tareas Tarea_1 : Tarea_Dinamica; Tarea_2 : Tarea_Dinamica; Tarea_3 : Tarea_Dinamica; begin Put_Line("Inicio"); -- Inicio de las tareas (Id, Periodo, Plazo, Tiempo de Ejecucion) Tarea_1 := new Tarea_Periodica(1, 4, 4, 1); Tarea_2 := new Tarea_Periodica(2, 5, 5, 2); Tarea_3 := new Tarea_Periodica(3, 10, 10, 1); end Planificador_Ciclico_Sin_Prioridades;

31.952381

78

0.605564