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

12f2822f06b3224cc56e9838aac1f9d9b22c3120

260,016

adb

Ada

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

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

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

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

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

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S E M _ E V A L -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2020, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. 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 Einfo; use Einfo; with Elists; use Elists; with Errout; use Errout; with Eval_Fat; use Eval_Fat; with Exp_Util; use Exp_Util; with Freeze; use Freeze; with Lib; use Lib; with Namet; use Namet; with Nmake; use Nmake; with Nlists; use Nlists; with Opt; use Opt; with Par_SCO; use Par_SCO; with Rtsfind; use Rtsfind; with Sem; use Sem; with Sem_Aux; use Sem_Aux; with Sem_Cat; use Sem_Cat; with Sem_Ch6; use Sem_Ch6; with Sem_Ch8; use Sem_Ch8; with Sem_Elab; use Sem_Elab; with Sem_Res; use Sem_Res; with Sem_Util; use Sem_Util; with Sem_Type; use Sem_Type; with Sem_Warn; use Sem_Warn; with Sinfo; use Sinfo; with Snames; use Snames; with Stand; use Stand; with Stringt; use Stringt; with Tbuild; use Tbuild; package body Sem_Eval is ----------------------------------------- -- Handling of Compile Time Evaluation -- ----------------------------------------- -- The compile time evaluation of expressions is distributed over several -- Eval_xxx procedures. These procedures are called immediately after -- a subexpression is resolved and is therefore accomplished in a bottom -- up fashion. The flags are synthesized using the following approach. -- Is_Static_Expression is determined by following the rules in -- RM-4.9. This involves testing the Is_Static_Expression flag of -- the operands in many cases. -- Raises_Constraint_Error is usually set if any of the operands have -- the flag set or if an attempt to compute the value of the current -- expression results in Constraint_Error. -- The general approach is as follows. First compute Is_Static_Expression. -- If the node is not static, then the flag is left off in the node and -- we are all done. Otherwise for a static node, we test if any of the -- operands will raise Constraint_Error, and if so, propagate the flag -- Raises_Constraint_Error to the result node and we are done (since the -- error was already posted at a lower level). -- For the case of a static node whose operands do not raise constraint -- error, we attempt to evaluate the node. If this evaluation succeeds, -- then the node is replaced by the result of this computation. If the -- evaluation raises Constraint_Error, then we rewrite the node with -- Apply_Compile_Time_Constraint_Error to raise the exception and also -- to post appropriate error messages. ---------------- -- Local Data -- ---------------- type Bits is array (Nat range <>) of Boolean; -- Used to convert unsigned (modular) values for folding logical ops -- The following declarations are used to maintain a cache of nodes that -- have compile-time-known values. The cache is maintained only for -- discrete types (the most common case), and is populated by calls to -- Compile_Time_Known_Value and Expr_Value, but only used by Expr_Value -- since it is possible for the status to change (in particular it is -- possible for a node to get replaced by a Constraint_Error node). CV_Bits : constant := 5; -- Number of low order bits of Node_Id value used to reference entries -- in the cache table. CV_Cache_Size : constant Nat := 2 ** CV_Bits; -- Size of cache for compile time values subtype CV_Range is Nat range 0 .. CV_Cache_Size; type CV_Entry is record N : Node_Id; V : Uint; end record; type Match_Result is (Match, No_Match, Non_Static); -- Result returned from functions that test for a matching result. If the -- operands are not OK_Static then Non_Static will be returned. Otherwise -- Match/No_Match is returned depending on whether the match succeeds. type CV_Cache_Array is array (CV_Range) of CV_Entry; CV_Cache : CV_Cache_Array := (others => (Node_High_Bound, Uint_0)); -- This is the actual cache, with entries consisting of node/value pairs, -- and the impossible value Node_High_Bound used for unset entries. type Range_Membership is (In_Range, Out_Of_Range, Unknown); -- Range membership may either be statically known to be in range or out -- of range, or not statically known. Used for Test_In_Range below. Checking_For_Potentially_Static_Expression : Boolean := False; -- Global flag that is set True during Analyze_Static_Expression_Function -- in order to verify that the result expression of a static expression -- function is a potentially static function (see RM202x 6.8(5.3)). ----------------------- -- Local Subprograms -- ----------------------- function Choice_Matches (Expr : Node_Id; Choice : Node_Id) return Match_Result; -- Determines whether given value Expr matches the given Choice. The Expr -- can be of discrete, real, or string type and must be a compile time -- known value (it is an error to make the call if these conditions are -- not met). The choice can be a range, subtype name, subtype indication, -- or expression. The returned result is Non_Static if Choice is not -- OK_Static, otherwise either Match or No_Match is returned depending -- on whether Choice matches Expr. This is used for case expression -- alternatives, and also for membership tests. In each case, more -- possibilities are tested than the syntax allows (e.g. membership allows -- subtype indications and non-discrete types, and case allows an OTHERS -- choice), but it does not matter, since we have already done a full -- semantic and syntax check of the construct, so the extra possibilities -- just will not arise for correct expressions. -- -- Note: if Choice_Matches finds that a choice raises Constraint_Error, e.g -- a reference to a type, one of whose bounds raises Constraint_Error, then -- it also sets the Raises_Constraint_Error flag on the Choice itself. function Choices_Match (Expr : Node_Id; Choices : List_Id) return Match_Result; -- This function applies Choice_Matches to each element of Choices. If the -- result is No_Match, then it continues and checks the next element. If -- the result is Match or Non_Static, this result is immediately given -- as the result without checking the rest of the list. Expr can be of -- discrete, real, or string type and must be a compile-time-known value -- (it is an error to make the call if these conditions are not met). procedure Eval_Intrinsic_Call (N : Node_Id; E : Entity_Id); -- Evaluate a call N to an intrinsic subprogram E. function Find_Universal_Operator_Type (N : Node_Id) return Entity_Id; -- Check whether an arithmetic operation with universal operands which is a -- rewritten function call with an explicit scope indication is ambiguous: -- P."+" (1, 2) will be ambiguous if there is more than one visible numeric -- type declared in P and the context does not impose a type on the result -- (e.g. in the expression of a type conversion). If ambiguous, emit an -- error and return Empty, else return the result type of the operator. procedure Fold_Dummy (N : Node_Id; Typ : Entity_Id); -- Rewrite N as a constant dummy value in the relevant type if possible. procedure Fold_Shift (N : Node_Id; Left : Node_Id; Right : Node_Id; Op : Node_Kind; Static : Boolean := False; Check_Elab : Boolean := False); -- Rewrite N as the result of evaluating Left <shift op> Right if possible. -- Op represents the shift operation. -- Static indicates whether the resulting node should be marked static. -- Check_Elab indicates whether checks for elaboration calls should be -- inserted when relevant. function From_Bits (B : Bits; T : Entity_Id) return Uint; -- Converts a bit string of length B'Length to a Uint value to be used for -- a target of type T, which is a modular type. This procedure includes the -- necessary reduction by the modulus in the case of a nonbinary modulus -- (for a binary modulus, the bit string is the right length any way so all -- is well). function Get_String_Val (N : Node_Id) return Node_Id; -- Given a tree node for a folded string or character value, returns the -- corresponding string literal or character literal (one of the two must -- be available, or the operand would not have been marked as foldable in -- the earlier analysis of the operation). function Is_OK_Static_Choice (Choice : Node_Id) return Boolean; -- Given a choice (from a case expression or membership test), returns -- True if the choice is static and does not raise a Constraint_Error. function Is_OK_Static_Choice_List (Choices : List_Id) return Boolean; -- Given a choice list (from a case expression or membership test), return -- True if all choices are static in the sense of Is_OK_Static_Choice. function Is_Static_Choice (Choice : Node_Id) return Boolean; -- Given a choice (from a case expression or membership test), returns -- True if the choice is static. No test is made for raising of constraint -- error, so this function is used only for legality tests. function Is_Static_Choice_List (Choices : List_Id) return Boolean; -- Given a choice list (from a case expression or membership test), return -- True if all choices are static in the sense of Is_Static_Choice. function Is_Static_Range (N : Node_Id) return Boolean; -- Determine if range is static, as defined in RM 4.9(26). The only allowed -- argument is an N_Range node (but note that the semantic analysis of -- equivalent range attribute references already turned them into the -- equivalent range). This differs from Is_OK_Static_Range (which is what -- must be used by clients) in that it does not care whether the bounds -- raise Constraint_Error or not. Used for checking whether expressions are -- static in the 4.9 sense (without worrying about exceptions). function OK_Bits (N : Node_Id; Bits : Uint) return Boolean; -- Bits represents the number of bits in an integer value to be computed -- (but the value has not been computed yet). If this value in Bits is -- reasonable, a result of True is returned, with the implication that the -- caller should go ahead and complete the calculation. If the value in -- Bits is unreasonably large, then an error is posted on node N, and -- False is returned (and the caller skips the proposed calculation). procedure Out_Of_Range (N : Node_Id); -- This procedure is called if it is determined that node N, which appears -- in a non-static context, is a compile-time-known value which is outside -- its range, i.e. the range of Etype. This is used in contexts where -- this is an illegality if N is static, and should generate a warning -- otherwise. function Real_Or_String_Static_Predicate_Matches (Val : Node_Id; Typ : Entity_Id) return Boolean; -- This is the function used to evaluate real or string static predicates. -- Val is an unanalyzed N_Real_Literal or N_String_Literal node, which -- represents the value to be tested against the predicate. Typ is the -- type with the predicate, from which the predicate expression can be -- extracted. The result returned is True if the given value satisfies -- the predicate. procedure Rewrite_In_Raise_CE (N : Node_Id; Exp : Node_Id); -- N and Exp are nodes representing an expression, Exp is known to raise -- CE. N is rewritten in term of Exp in the optimal way. function String_Type_Len (Stype : Entity_Id) return Uint; -- Given a string type, determines the length of the index type, or, if -- this index type is non-static, the length of the base type of this index -- type. Note that if the string type is itself static, then the index type -- is static, so the second case applies only if the string type passed is -- non-static. function Test (Cond : Boolean) return Uint; pragma Inline (Test); -- This function simply returns the appropriate Boolean'Pos value -- corresponding to the value of Cond as a universal integer. It is -- used for producing the result of the static evaluation of the -- logical operators procedure Test_Expression_Is_Foldable (N : Node_Id; Op1 : Node_Id; Stat : out Boolean; Fold : out Boolean); -- Tests to see if expression N whose single operand is Op1 is foldable, -- i.e. the operand value is known at compile time. If the operation is -- foldable, then Fold is True on return, and Stat indicates whether the -- result is static (i.e. the operand was static). Note that it is quite -- possible for Fold to be True, and Stat to be False, since there are -- cases in which we know the value of an operand even though it is not -- technically static (e.g. the static lower bound of a range whose upper -- bound is non-static). -- -- If Stat is set False on return, then Test_Expression_Is_Foldable makes -- a call to Check_Non_Static_Context on the operand. If Fold is False on -- return, then all processing is complete, and the caller should return, -- since there is nothing else to do. -- -- If Stat is set True on return, then Is_Static_Expression is also set -- true in node N. There are some cases where this is over-enthusiastic, -- e.g. in the two operand case below, for string comparison, the result is -- not static even though the two operands are static. In such cases, the -- caller must reset the Is_Static_Expression flag in N. -- -- If Fold and Stat are both set to False then this routine performs also -- the following extra actions: -- -- If either operand is Any_Type then propagate it to result to prevent -- cascaded errors. -- -- If some operand raises Constraint_Error, then replace the node N -- with the raise Constraint_Error node. This replacement inherits the -- Is_Static_Expression flag from the operands. procedure Test_Expression_Is_Foldable (N : Node_Id; Op1 : Node_Id; Op2 : Node_Id; Stat : out Boolean; Fold : out Boolean; CRT_Safe : Boolean := False); -- Same processing, except applies to an expression N with two operands -- Op1 and Op2. The result is static only if both operands are static. If -- CRT_Safe is set True, then CRT_Safe_Compile_Time_Known_Value is used -- for the tests that the two operands are known at compile time. See -- spec of this routine for further details. function Test_In_Range (N : Node_Id; Typ : Entity_Id; Assume_Valid : Boolean; Fixed_Int : Boolean; Int_Real : Boolean) return Range_Membership; -- Common processing for Is_In_Range and Is_Out_Of_Range: Returns In_Range -- or Out_Of_Range if it can be guaranteed at compile time that expression -- N is known to be in or out of range of the subtype Typ. If not compile -- time known, Unknown is returned. See documentation of Is_In_Range for -- complete description of parameters. procedure To_Bits (U : Uint; B : out Bits); -- Converts a Uint value to a bit string of length B'Length ----------------------------------------------- -- Check_Expression_Against_Static_Predicate -- ----------------------------------------------- procedure Check_Expression_Against_Static_Predicate (Expr : Node_Id; Typ : Entity_Id; Static_Failure_Is_Error : Boolean := False) is begin -- Nothing to do if expression is not known at compile time, or the -- type has no static predicate set (will be the case for all non-scalar -- types, so no need to make a special test for that). if not (Has_Static_Predicate (Typ) and then Compile_Time_Known_Value (Expr)) then return; end if; -- Here we have a static predicate (note that it could have arisen from -- an explicitly specified Dynamic_Predicate whose expression met the -- rules for being predicate-static). If the expression is known at -- compile time and obeys the predicate, then it is static and must be -- labeled as such, which matters e.g. for case statements. The original -- expression may be a type conversion of a variable with a known value, -- which might otherwise not be marked static. -- Case of real static predicate if Is_Real_Type (Typ) then if Real_Or_String_Static_Predicate_Matches (Val => Make_Real_Literal (Sloc (Expr), Expr_Value_R (Expr)), Typ => Typ) then Set_Is_Static_Expression (Expr); return; end if; -- Case of string static predicate elsif Is_String_Type (Typ) then if Real_Or_String_Static_Predicate_Matches (Val => Expr_Value_S (Expr), Typ => Typ) then Set_Is_Static_Expression (Expr); return; end if; -- Case of discrete static predicate else pragma Assert (Is_Discrete_Type (Typ)); -- If static predicate matches, nothing to do if Choices_Match (Expr, Static_Discrete_Predicate (Typ)) = Match then Set_Is_Static_Expression (Expr); return; end if; end if; -- Here we know that the predicate will fail -- Special case of static expression failing a predicate (other than one -- that was explicitly specified with a Dynamic_Predicate aspect). If -- the expression comes from a qualified_expression or type_conversion -- this is an error (Static_Failure_Is_Error); otherwise we only issue -- a warning and the expression is no longer considered static. if Is_Static_Expression (Expr) and then not Has_Dynamic_Predicate_Aspect (Typ) then if Static_Failure_Is_Error then Error_Msg_NE ("static expression fails static predicate check on &", Expr, Typ); else Error_Msg_NE ("??static expression fails static predicate check on &", Expr, Typ); Error_Msg_N ("\??expression is no longer considered static", Expr); Set_Is_Static_Expression (Expr, False); end if; -- In all other cases, this is just a warning that a test will fail. -- It does not matter if the expression is static or not, or if the -- predicate comes from a dynamic predicate aspect or not. else Error_Msg_NE ("??expression fails predicate check on &", Expr, Typ); -- Force a check here, which is potentially a redundant check, but -- this ensures a check will be done in cases where the expression -- is folded, and since this is definitely a failure, extra checks -- are OK. if Predicate_Enabled (Typ) then Insert_Action (Expr, Make_Predicate_Check (Typ, Duplicate_Subexpr (Expr)), Suppress => All_Checks); end if; end if; end Check_Expression_Against_Static_Predicate; ------------------------------ -- Check_Non_Static_Context -- ------------------------------ procedure Check_Non_Static_Context (N : Node_Id) is T : constant Entity_Id := Etype (N); Checks_On : constant Boolean := not Index_Checks_Suppressed (T) and not Range_Checks_Suppressed (T); begin -- Ignore cases of non-scalar types, error types, or universal real -- types that have no usable bounds. if T = Any_Type or else not Is_Scalar_Type (T) or else T = Universal_Fixed or else T = Universal_Real then return; end if; -- At this stage we have a scalar type. If we have an expression that -- raises CE, then we already issued a warning or error msg so there is -- nothing more to be done in this routine. if Raises_Constraint_Error (N) then return; end if; -- Now we have a scalar type which is not marked as raising a constraint -- error exception. The main purpose of this routine is to deal with -- static expressions appearing in a non-static context. That means -- that if we do not have a static expression then there is not much -- to do. The one case that we deal with here is that if we have a -- floating-point value that is out of range, then we post a warning -- that an infinity will result. if not Is_Static_Expression (N) then if Is_Floating_Point_Type (T) then if Is_Out_Of_Range (N, Base_Type (T), Assume_Valid => True) then Error_Msg_N ("??float value out of range, infinity will be generated", N); -- The literal may be the result of constant-folding of a non- -- static subexpression of a larger expression (e.g. a conversion -- of a non-static variable whose value happens to be known). At -- this point we must reduce the value of the subexpression to a -- machine number (RM 4.9 (38/2)). elsif Nkind (N) = N_Real_Literal and then Nkind (Parent (N)) in N_Subexpr then Rewrite (N, New_Copy (N)); Set_Realval (N, Machine (Base_Type (T), Realval (N), Round_Even, N)); end if; end if; return; end if; -- Here we have the case of outer level static expression of scalar -- type, where the processing of this procedure is needed. -- For real types, this is where we convert the value to a machine -- number (see RM 4.9(38)). Also see ACVC test C490001. We should only -- need to do this if the parent is a constant declaration, since in -- other cases, gigi should do the necessary conversion correctly, but -- experimentation shows that this is not the case on all machines, in -- particular if we do not convert all literals to machine values in -- non-static contexts, then ACVC test C490001 fails on Sparc/Solaris -- and SGI/Irix. -- This conversion is always done by GNATprove on real literals in -- non-static expressions, by calling Check_Non_Static_Context from -- gnat2why, as GNATprove cannot do the conversion later contrary -- to gigi. The frontend computes the information about which -- expressions are static, which is used by gnat2why to call -- Check_Non_Static_Context on exactly those real literals that are -- not subexpressions of static expressions. if Nkind (N) = N_Real_Literal and then not Is_Machine_Number (N) and then not Is_Generic_Type (Etype (N)) and then Etype (N) /= Universal_Real then -- Check that value is in bounds before converting to machine -- number, so as not to lose case where value overflows in the -- least significant bit or less. See B490001. if Is_Out_Of_Range (N, Base_Type (T), Assume_Valid => True) then Out_Of_Range (N); return; end if; -- Note: we have to copy the node, to avoid problems with conformance -- of very similar numbers (see ACVC tests B4A010C and B63103A). Rewrite (N, New_Copy (N)); if not Is_Floating_Point_Type (T) then Set_Realval (N, Corresponding_Integer_Value (N) * Small_Value (T)); elsif not UR_Is_Zero (Realval (N)) then -- Note: even though RM 4.9(38) specifies biased rounding, this -- has been modified by AI-100 in order to prevent confusing -- differences in rounding between static and non-static -- expressions. AI-100 specifies that the effect of such rounding -- is implementation dependent, and in GNAT we round to nearest -- even to match the run-time behavior. Note that this applies -- to floating point literals, not fixed points ones, even though -- their compiler representation is also as a universal real. Set_Realval (N, Machine (Base_Type (T), Realval (N), Round_Even, N)); Set_Is_Machine_Number (N); end if; end if; -- Check for out of range universal integer. This is a non-static -- context, so the integer value must be in range of the runtime -- representation of universal integers. -- We do this only within an expression, because that is the only -- case in which non-static universal integer values can occur, and -- furthermore, Check_Non_Static_Context is currently (incorrectly???) -- called in contexts like the expression of a number declaration where -- we certainly want to allow out of range values. -- We inhibit the warning when expansion is disabled, because the -- preanalysis of a range of a 64-bit modular type may appear to -- violate the constraint on non-static Universal_Integer. If there -- is a true overflow it will be diagnosed during full analysis. if Etype (N) = Universal_Integer and then Nkind (N) = N_Integer_Literal and then Nkind (Parent (N)) in N_Subexpr and then Expander_Active and then (Intval (N) < Expr_Value (Type_Low_Bound (Universal_Integer)) or else Intval (N) > Expr_Value (Type_High_Bound (Universal_Integer))) then Apply_Compile_Time_Constraint_Error (N, "non-static universal integer value out of range<<", CE_Range_Check_Failed); -- Check out of range of base type elsif Is_Out_Of_Range (N, Base_Type (T), Assume_Valid => True) then Out_Of_Range (N); -- Give a warning or error on the value outside the subtype. A warning -- is omitted if the expression appears in a range that could be null -- (warnings are handled elsewhere for this case). elsif T /= Base_Type (T) and then Nkind (Parent (N)) /= N_Range then if Is_In_Range (N, T, Assume_Valid => True) then null; elsif Is_Out_Of_Range (N, T, Assume_Valid => True) then -- Ignore out of range values for System.Priority in CodePeer -- mode since the actual target compiler may provide a wider -- range. if CodePeer_Mode and then Is_RTE (T, RE_Priority) then Set_Do_Range_Check (N, False); -- Determine if the out-of-range violation constitutes a warning -- or an error based on context, according to RM 4.9 (34/3). elsif Nkind (Original_Node (N)) in N_Type_Conversion | N_Qualified_Expression and then Comes_From_Source (Original_Node (N)) then Apply_Compile_Time_Constraint_Error (N, "value not in range of}", CE_Range_Check_Failed); else Apply_Compile_Time_Constraint_Error (N, "value not in range of}<<", CE_Range_Check_Failed); end if; elsif Checks_On then Enable_Range_Check (N); else Set_Do_Range_Check (N, False); end if; end if; end Check_Non_Static_Context; --------------------------------- -- Check_String_Literal_Length -- --------------------------------- procedure Check_String_Literal_Length (N : Node_Id; Ttype : Entity_Id) is begin if not Raises_Constraint_Error (N) and then Is_Constrained (Ttype) then if UI_From_Int (String_Length (Strval (N))) /= String_Type_Len (Ttype) then Apply_Compile_Time_Constraint_Error (N, "string length wrong for}??", CE_Length_Check_Failed, Ent => Ttype, Typ => Ttype); end if; end if; end Check_String_Literal_Length; -------------------------------------------- -- Checking_Potentially_Static_Expression -- -------------------------------------------- function Checking_Potentially_Static_Expression return Boolean is begin return Checking_For_Potentially_Static_Expression; end Checking_Potentially_Static_Expression; -------------------- -- Choice_Matches -- -------------------- function Choice_Matches (Expr : Node_Id; Choice : Node_Id) return Match_Result is Etyp : constant Entity_Id := Etype (Expr); Val : Uint; ValR : Ureal; ValS : Node_Id; begin pragma Assert (Compile_Time_Known_Value (Expr)); pragma Assert (Is_Scalar_Type (Etyp) or else Is_String_Type (Etyp)); if not Is_OK_Static_Choice (Choice) then Set_Raises_Constraint_Error (Choice); return Non_Static; -- When the choice denotes a subtype with a static predictate, check the -- expression against the predicate values. Different procedures apply -- to discrete and non-discrete types. elsif (Nkind (Choice) = N_Subtype_Indication or else (Is_Entity_Name (Choice) and then Is_Type (Entity (Choice)))) and then Has_Predicates (Etype (Choice)) and then Has_Static_Predicate (Etype (Choice)) then if Is_Discrete_Type (Etype (Choice)) then return Choices_Match (Expr, Static_Discrete_Predicate (Etype (Choice))); elsif Real_Or_String_Static_Predicate_Matches (Expr, Etype (Choice)) then return Match; else return No_Match; end if; -- Discrete type case only elsif Is_Discrete_Type (Etyp) then Val := Expr_Value (Expr); if Nkind (Choice) = N_Range then if Val >= Expr_Value (Low_Bound (Choice)) and then Val <= Expr_Value (High_Bound (Choice)) then return Match; else return No_Match; end if; elsif Nkind (Choice) = N_Subtype_Indication or else (Is_Entity_Name (Choice) and then Is_Type (Entity (Choice))) then if Val >= Expr_Value (Type_Low_Bound (Etype (Choice))) and then Val <= Expr_Value (Type_High_Bound (Etype (Choice))) then return Match; else return No_Match; end if; elsif Nkind (Choice) = N_Others_Choice then return Match; else if Val = Expr_Value (Choice) then return Match; else return No_Match; end if; end if; -- Real type case elsif Is_Real_Type (Etyp) then ValR := Expr_Value_R (Expr); if Nkind (Choice) = N_Range then if ValR >= Expr_Value_R (Low_Bound (Choice)) and then ValR <= Expr_Value_R (High_Bound (Choice)) then return Match; else return No_Match; end if; elsif Nkind (Choice) = N_Subtype_Indication or else (Is_Entity_Name (Choice) and then Is_Type (Entity (Choice))) then if ValR >= Expr_Value_R (Type_Low_Bound (Etype (Choice))) and then ValR <= Expr_Value_R (Type_High_Bound (Etype (Choice))) then return Match; else return No_Match; end if; else if ValR = Expr_Value_R (Choice) then return Match; else return No_Match; end if; end if; -- String type cases else pragma Assert (Is_String_Type (Etyp)); ValS := Expr_Value_S (Expr); if Nkind (Choice) = N_Subtype_Indication or else (Is_Entity_Name (Choice) and then Is_Type (Entity (Choice))) then if not Is_Constrained (Etype (Choice)) then return Match; else declare Typlen : constant Uint := String_Type_Len (Etype (Choice)); Strlen : constant Uint := UI_From_Int (String_Length (Strval (ValS))); begin if Typlen = Strlen then return Match; else return No_Match; end if; end; end if; else if String_Equal (Strval (ValS), Strval (Expr_Value_S (Choice))) then return Match; else return No_Match; end if; end if; end if; end Choice_Matches; ------------------- -- Choices_Match -- ------------------- function Choices_Match (Expr : Node_Id; Choices : List_Id) return Match_Result is Choice : Node_Id; Result : Match_Result; begin Choice := First (Choices); while Present (Choice) loop Result := Choice_Matches (Expr, Choice); if Result /= No_Match then return Result; end if; Next (Choice); end loop; return No_Match; end Choices_Match; -------------------------- -- Compile_Time_Compare -- -------------------------- function Compile_Time_Compare (L, R : Node_Id; Assume_Valid : Boolean) return Compare_Result is Discard : aliased Uint; begin return Compile_Time_Compare (L, R, Discard'Access, Assume_Valid); end Compile_Time_Compare; function Compile_Time_Compare (L, R : Node_Id; Diff : access Uint; Assume_Valid : Boolean; Rec : Boolean := False) return Compare_Result is Ltyp : Entity_Id := Etype (L); Rtyp : Entity_Id := Etype (R); Discard : aliased Uint; procedure Compare_Decompose (N : Node_Id; R : out Node_Id; V : out Uint); -- This procedure decomposes the node N into an expression node and a -- signed offset, so that the value of N is equal to the value of R plus -- the value V (which may be negative). If no such decomposition is -- possible, then on return R is a copy of N, and V is set to zero. function Compare_Fixup (N : Node_Id) return Node_Id; -- This function deals with replacing 'Last and 'First references with -- their corresponding type bounds, which we then can compare. The -- argument is the original node, the result is the identity, unless we -- have a 'Last/'First reference in which case the value returned is the -- appropriate type bound. function Is_Known_Valid_Operand (Opnd : Node_Id) return Boolean; -- Even if the context does not assume that values are valid, some -- simple cases can be recognized. function Is_Same_Value (L, R : Node_Id) return Boolean; -- Returns True iff L and R represent expressions that definitely have -- identical (but not necessarily compile-time-known) values Indeed the -- caller is expected to have already dealt with the cases of compile -- time known values, so these are not tested here. ----------------------- -- Compare_Decompose -- ----------------------- procedure Compare_Decompose (N : Node_Id; R : out Node_Id; V : out Uint) is begin if Nkind (N) = N_Op_Add and then Nkind (Right_Opnd (N)) = N_Integer_Literal then R := Left_Opnd (N); V := Intval (Right_Opnd (N)); return; elsif Nkind (N) = N_Op_Subtract and then Nkind (Right_Opnd (N)) = N_Integer_Literal then R := Left_Opnd (N); V := UI_Negate (Intval (Right_Opnd (N))); return; elsif Nkind (N) = N_Attribute_Reference then if Attribute_Name (N) = Name_Succ then R := First (Expressions (N)); V := Uint_1; return; elsif Attribute_Name (N) = Name_Pred then R := First (Expressions (N)); V := Uint_Minus_1; return; end if; end if; R := N; V := Uint_0; end Compare_Decompose; ------------------- -- Compare_Fixup -- ------------------- function Compare_Fixup (N : Node_Id) return Node_Id is Indx : Node_Id; Xtyp : Entity_Id; Subs : Nat; begin -- Fixup only required for First/Last attribute reference if Nkind (N) = N_Attribute_Reference and then Attribute_Name (N) in Name_First | Name_Last then Xtyp := Etype (Prefix (N)); -- If we have no type, then just abandon the attempt to do -- a fixup, this is probably the result of some other error. if No (Xtyp) then return N; end if; -- Dereference an access type if Is_Access_Type (Xtyp) then Xtyp := Designated_Type (Xtyp); end if; -- If we don't have an array type at this stage, something is -- peculiar, e.g. another error, and we abandon the attempt at -- a fixup. if not Is_Array_Type (Xtyp) then return N; end if; -- Ignore unconstrained array, since bounds are not meaningful if not Is_Constrained (Xtyp) then return N; end if; if Ekind (Xtyp) = E_String_Literal_Subtype then if Attribute_Name (N) = Name_First then return String_Literal_Low_Bound (Xtyp); else return Make_Integer_Literal (Sloc (N), Intval => Intval (String_Literal_Low_Bound (Xtyp)) + String_Literal_Length (Xtyp)); end if; end if; -- Find correct index type Indx := First_Index (Xtyp); if Present (Expressions (N)) then Subs := UI_To_Int (Expr_Value (First (Expressions (N)))); for J in 2 .. Subs loop Next_Index (Indx); end loop; end if; Xtyp := Etype (Indx); if Attribute_Name (N) = Name_First then return Type_Low_Bound (Xtyp); else return Type_High_Bound (Xtyp); end if; end if; return N; end Compare_Fixup; ---------------------------- -- Is_Known_Valid_Operand -- ---------------------------- function Is_Known_Valid_Operand (Opnd : Node_Id) return Boolean is begin return (Is_Entity_Name (Opnd) and then (Is_Known_Valid (Entity (Opnd)) or else Ekind (Entity (Opnd)) = E_In_Parameter or else (Is_Object (Entity (Opnd)) and then Present (Current_Value (Entity (Opnd)))))) or else Is_OK_Static_Expression (Opnd); end Is_Known_Valid_Operand; ------------------- -- Is_Same_Value -- ------------------- function Is_Same_Value (L, R : Node_Id) return Boolean is Lf : constant Node_Id := Compare_Fixup (L); Rf : constant Node_Id := Compare_Fixup (R); function Is_Rewritten_Loop_Entry (N : Node_Id) return Boolean; -- An attribute reference to Loop_Entry may have been rewritten into -- its prefix as a way to avoid generating a constant for that -- attribute when the corresponding pragma is ignored. These nodes -- should be ignored when deciding if they can be equal to one -- another. function Is_Same_Subscript (L, R : List_Id) return Boolean; -- L, R are the Expressions values from two attribute nodes for First -- or Last attributes. Either may be set to No_List if no expressions -- are present (indicating subscript 1). The result is True if both -- expressions represent the same subscript (note one case is where -- one subscript is missing and the other is explicitly set to 1). ----------------------------- -- Is_Rewritten_Loop_Entry -- ----------------------------- function Is_Rewritten_Loop_Entry (N : Node_Id) return Boolean is Orig_N : constant Node_Id := Original_Node (N); begin return Orig_N /= N and then Nkind (Orig_N) = N_Attribute_Reference and then Get_Attribute_Id (Attribute_Name (Orig_N)) = Attribute_Loop_Entry; end Is_Rewritten_Loop_Entry; ----------------------- -- Is_Same_Subscript -- ----------------------- function Is_Same_Subscript (L, R : List_Id) return Boolean is begin if L = No_List then if R = No_List then return True; else return Expr_Value (First (R)) = Uint_1; end if; else if R = No_List then return Expr_Value (First (L)) = Uint_1; else return Expr_Value (First (L)) = Expr_Value (First (R)); end if; end if; end Is_Same_Subscript; -- Start of processing for Is_Same_Value begin -- Loop_Entry nodes rewritten into their prefix inside ignored -- pragmas should never lead to a decision of equality. if Is_Rewritten_Loop_Entry (Lf) or else Is_Rewritten_Loop_Entry (Rf) then return False; -- Values are the same if they refer to the same entity and the -- entity is nonvolatile. elsif Nkind (Lf) in N_Identifier | N_Expanded_Name and then Nkind (Rf) in N_Identifier | N_Expanded_Name and then Entity (Lf) = Entity (Rf) -- If the entity is a discriminant, the two expressions may be -- bounds of components of objects of the same discriminated type. -- The values of the discriminants are not static, and therefore -- the result is unknown. and then Ekind (Entity (Lf)) /= E_Discriminant and then Present (Entity (Lf)) -- This does not however apply to Float types, since we may have -- two NaN values and they should never compare equal. and then not Is_Floating_Point_Type (Etype (L)) and then not Is_Volatile_Reference (L) and then not Is_Volatile_Reference (R) then return True; -- Or if they are compile-time-known and identical elsif Compile_Time_Known_Value (Lf) and then Compile_Time_Known_Value (Rf) and then Expr_Value (Lf) = Expr_Value (Rf) then return True; -- False if Nkind of the two nodes is different for remaining cases elsif Nkind (Lf) /= Nkind (Rf) then return False; -- True if both 'First or 'Last values applying to the same entity -- (first and last don't change even if value does). Note that we -- need this even with the calls to Compare_Fixup, to handle the -- case of unconstrained array attributes where Compare_Fixup -- cannot find useful bounds. elsif Nkind (Lf) = N_Attribute_Reference and then Attribute_Name (Lf) = Attribute_Name (Rf) and then Attribute_Name (Lf) in Name_First | Name_Last and then Nkind (Prefix (Lf)) in N_Identifier | N_Expanded_Name and then Nkind (Prefix (Rf)) in N_Identifier | N_Expanded_Name and then Entity (Prefix (Lf)) = Entity (Prefix (Rf)) and then Is_Same_Subscript (Expressions (Lf), Expressions (Rf)) then return True; -- True if the same selected component from the same record elsif Nkind (Lf) = N_Selected_Component and then Selector_Name (Lf) = Selector_Name (Rf) and then Is_Same_Value (Prefix (Lf), Prefix (Rf)) then return True; -- True if the same unary operator applied to the same operand elsif Nkind (Lf) in N_Unary_Op and then Is_Same_Value (Right_Opnd (Lf), Right_Opnd (Rf)) then return True; -- True if the same binary operator applied to the same operands elsif Nkind (Lf) in N_Binary_Op and then Is_Same_Value (Left_Opnd (Lf), Left_Opnd (Rf)) and then Is_Same_Value (Right_Opnd (Lf), Right_Opnd (Rf)) then return True; -- All other cases, we can't tell, so return False else return False; end if; end Is_Same_Value; -- Start of processing for Compile_Time_Compare begin Diff.all := No_Uint; -- In preanalysis mode, always return Unknown unless the expression -- is static. It is too early to be thinking we know the result of a -- comparison, save that judgment for the full analysis. This is -- particularly important in the case of pre and postconditions, which -- otherwise can be prematurely collapsed into having True or False -- conditions when this is inappropriate. if not (Full_Analysis or else (Is_OK_Static_Expression (L) and then Is_OK_Static_Expression (R))) then return Unknown; end if; -- If either operand could raise Constraint_Error, then we cannot -- know the result at compile time (since CE may be raised). if not (Cannot_Raise_Constraint_Error (L) and then Cannot_Raise_Constraint_Error (R)) then return Unknown; end if; -- Identical operands are most certainly equal if L = R then return EQ; end if; -- If expressions have no types, then do not attempt to determine if -- they are the same, since something funny is going on. One case in -- which this happens is during generic template analysis, when bounds -- are not fully analyzed. if No (Ltyp) or else No (Rtyp) then return Unknown; end if; -- These get reset to the base type for the case of entities where -- Is_Known_Valid is not set. This takes care of handling possible -- invalid representations using the value of the base type, in -- accordance with RM 13.9.1(10). Ltyp := Underlying_Type (Ltyp); Rtyp := Underlying_Type (Rtyp); -- Same rationale as above, but for Underlying_Type instead of Etype if No (Ltyp) or else No (Rtyp) then return Unknown; end if; -- We do not attempt comparisons for packed arrays represented as -- modular types, where the semantics of comparison is quite different. if Is_Packed_Array_Impl_Type (Ltyp) and then Is_Modular_Integer_Type (Ltyp) then return Unknown; -- For access types, the only time we know the result at compile time -- (apart from identical operands, which we handled already) is if we -- know one operand is null and the other is not, or both operands are -- known null. elsif Is_Access_Type (Ltyp) then if Known_Null (L) then if Known_Null (R) then return EQ; elsif Known_Non_Null (R) then return NE; else return Unknown; end if; elsif Known_Non_Null (L) and then Known_Null (R) then return NE; else return Unknown; end if; -- Case where comparison involves two compile-time-known values elsif Compile_Time_Known_Value (L) and then Compile_Time_Known_Value (R) then -- For the floating-point case, we have to be a little careful, since -- at compile time we are dealing with universal exact values, but at -- runtime, these will be in non-exact target form. That's why the -- returned results are LE and GE below instead of LT and GT. if Is_Floating_Point_Type (Ltyp) or else Is_Floating_Point_Type (Rtyp) then declare Lo : constant Ureal := Expr_Value_R (L); Hi : constant Ureal := Expr_Value_R (R); begin if Lo < Hi then return LE; elsif Lo = Hi then return EQ; else return GE; end if; end; -- For string types, we have two string literals and we proceed to -- compare them using the Ada style dictionary string comparison. elsif not Is_Scalar_Type (Ltyp) then declare Lstring : constant String_Id := Strval (Expr_Value_S (L)); Rstring : constant String_Id := Strval (Expr_Value_S (R)); Llen : constant Nat := String_Length (Lstring); Rlen : constant Nat := String_Length (Rstring); begin for J in 1 .. Nat'Min (Llen, Rlen) loop declare LC : constant Char_Code := Get_String_Char (Lstring, J); RC : constant Char_Code := Get_String_Char (Rstring, J); begin if LC < RC then return LT; elsif LC > RC then return GT; end if; end; end loop; if Llen < Rlen then return LT; elsif Llen > Rlen then return GT; else return EQ; end if; end; -- For remaining scalar cases we know exactly (note that this does -- include the fixed-point case, where we know the run time integer -- values now). else declare Lo : constant Uint := Expr_Value (L); Hi : constant Uint := Expr_Value (R); begin if Lo < Hi then Diff.all := Hi - Lo; return LT; elsif Lo = Hi then return EQ; else Diff.all := Lo - Hi; return GT; end if; end; end if; -- Cases where at least one operand is not known at compile time else -- Remaining checks apply only for discrete types if not Is_Discrete_Type (Ltyp) or else not Is_Discrete_Type (Rtyp) then return Unknown; end if; -- Defend against generic types, or actually any expressions that -- contain a reference to a generic type from within a generic -- template. We don't want to do any range analysis of such -- expressions for two reasons. First, the bounds of a generic type -- itself are junk and cannot be used for any kind of analysis. -- Second, we may have a case where the range at run time is indeed -- known, but we don't want to do compile time analysis in the -- template based on that range since in an instance the value may be -- static, and able to be elaborated without reference to the bounds -- of types involved. As an example, consider: -- (F'Pos (F'Last) + 1) > Integer'Last -- The expression on the left side of > is Universal_Integer and thus -- acquires the type Integer for evaluation at run time, and at run -- time it is true that this condition is always False, but within -- an instance F may be a type with a static range greater than the -- range of Integer, and the expression statically evaluates to True. if References_Generic_Formal_Type (L) or else References_Generic_Formal_Type (R) then return Unknown; end if; -- Replace types by base types for the case of values which are not -- known to have valid representations. This takes care of properly -- dealing with invalid representations. if not Assume_Valid then if not (Is_Entity_Name (L) and then (Is_Known_Valid (Entity (L)) or else Assume_No_Invalid_Values)) then Ltyp := Underlying_Type (Base_Type (Ltyp)); end if; if not (Is_Entity_Name (R) and then (Is_Known_Valid (Entity (R)) or else Assume_No_Invalid_Values)) then Rtyp := Underlying_Type (Base_Type (Rtyp)); end if; end if; -- First attempt is to decompose the expressions to extract a -- constant offset resulting from the use of any of the forms: -- expr + literal -- expr - literal -- typ'Succ (expr) -- typ'Pred (expr) -- Then we see if the two expressions are the same value, and if so -- the result is obtained by comparing the offsets. -- Note: the reason we do this test first is that it returns only -- decisive results (with diff set), where other tests, like the -- range test, may not be as so decisive. Consider for example -- J .. J + 1. This code can conclude LT with a difference of 1, -- even if the range of J is not known. declare Lnode : Node_Id; Loffs : Uint; Rnode : Node_Id; Roffs : Uint; begin Compare_Decompose (L, Lnode, Loffs); Compare_Decompose (R, Rnode, Roffs); if Is_Same_Value (Lnode, Rnode) then if Loffs = Roffs then return EQ; end if; -- When the offsets are not equal, we can go farther only if -- the types are not modular (e.g. X < X + 1 is False if X is -- the largest number). if not Is_Modular_Integer_Type (Ltyp) and then not Is_Modular_Integer_Type (Rtyp) then if Loffs < Roffs then Diff.all := Roffs - Loffs; return LT; else Diff.all := Loffs - Roffs; return GT; end if; end if; end if; end; -- Next, try range analysis and see if operand ranges are disjoint declare LOK, ROK : Boolean; LLo, LHi : Uint; RLo, RHi : Uint; Single : Boolean; -- True if each range is a single point begin Determine_Range (L, LOK, LLo, LHi, Assume_Valid); Determine_Range (R, ROK, RLo, RHi, Assume_Valid); if LOK and ROK then Single := (LLo = LHi) and then (RLo = RHi); if LHi < RLo then if Single and Assume_Valid then Diff.all := RLo - LLo; end if; return LT; elsif RHi < LLo then if Single and Assume_Valid then Diff.all := LLo - RLo; end if; return GT; elsif Single and then LLo = RLo then -- If the range includes a single literal and we can assume -- validity then the result is known even if an operand is -- not static. if Assume_Valid then return EQ; else return Unknown; end if; elsif LHi = RLo then return LE; elsif RHi = LLo then return GE; elsif not Is_Known_Valid_Operand (L) and then not Assume_Valid then if Is_Same_Value (L, R) then return EQ; else return Unknown; end if; end if; -- If the range of either operand cannot be determined, nothing -- further can be inferred. else return Unknown; end if; end; -- Here is where we check for comparisons against maximum bounds of -- types, where we know that no value can be outside the bounds of -- the subtype. Note that this routine is allowed to assume that all -- expressions are within their subtype bounds. Callers wishing to -- deal with possibly invalid values must in any case take special -- steps (e.g. conversions to larger types) to avoid this kind of -- optimization, which is always considered to be valid. We do not -- attempt this optimization with generic types, since the type -- bounds may not be meaningful in this case. -- We are in danger of an infinite recursion here. It does not seem -- useful to go more than one level deep, so the parameter Rec is -- used to protect ourselves against this infinite recursion. if not Rec then -- See if we can get a decisive check against one operand and a -- bound of the other operand (four possible tests here). Note -- that we avoid testing junk bounds of a generic type. if not Is_Generic_Type (Rtyp) then case Compile_Time_Compare (L, Type_Low_Bound (Rtyp), Discard'Access, Assume_Valid, Rec => True) is when LT => return LT; when LE => return LE; when EQ => return LE; when others => null; end case; case Compile_Time_Compare (L, Type_High_Bound (Rtyp), Discard'Access, Assume_Valid, Rec => True) is when GT => return GT; when GE => return GE; when EQ => return GE; when others => null; end case; end if; if not Is_Generic_Type (Ltyp) then case Compile_Time_Compare (Type_Low_Bound (Ltyp), R, Discard'Access, Assume_Valid, Rec => True) is when GT => return GT; when GE => return GE; when EQ => return GE; when others => null; end case; case Compile_Time_Compare (Type_High_Bound (Ltyp), R, Discard'Access, Assume_Valid, Rec => True) is when LT => return LT; when LE => return LE; when EQ => return LE; when others => null; end case; end if; end if; -- Next attempt is to see if we have an entity compared with a -- compile-time-known value, where there is a current value -- conditional for the entity which can tell us the result. declare Var : Node_Id; -- Entity variable (left operand) Val : Uint; -- Value (right operand) Inv : Boolean; -- If False, we have reversed the operands Op : Node_Kind; -- Comparison operator kind from Get_Current_Value_Condition call Opn : Node_Id; -- Value from Get_Current_Value_Condition call Opv : Uint; -- Value of Opn Result : Compare_Result; -- Known result before inversion begin if Is_Entity_Name (L) and then Compile_Time_Known_Value (R) then Var := L; Val := Expr_Value (R); Inv := False; elsif Is_Entity_Name (R) and then Compile_Time_Known_Value (L) then Var := R; Val := Expr_Value (L); Inv := True; -- That was the last chance at finding a compile time result else return Unknown; end if; Get_Current_Value_Condition (Var, Op, Opn); -- That was the last chance, so if we got nothing return if No (Opn) then return Unknown; end if; Opv := Expr_Value (Opn); -- We got a comparison, so we might have something interesting -- Convert LE to LT and GE to GT, just so we have fewer cases if Op = N_Op_Le then Op := N_Op_Lt; Opv := Opv + 1; elsif Op = N_Op_Ge then Op := N_Op_Gt; Opv := Opv - 1; end if; -- Deal with equality case if Op = N_Op_Eq then if Val = Opv then Result := EQ; elsif Opv < Val then Result := LT; else Result := GT; end if; -- Deal with inequality case elsif Op = N_Op_Ne then if Val = Opv then Result := NE; else return Unknown; end if; -- Deal with greater than case elsif Op = N_Op_Gt then if Opv >= Val then Result := GT; elsif Opv = Val - 1 then Result := GE; else return Unknown; end if; -- Deal with less than case else pragma Assert (Op = N_Op_Lt); if Opv <= Val then Result := LT; elsif Opv = Val + 1 then Result := LE; else return Unknown; end if; end if; -- Deal with inverting result if Inv then case Result is when GT => return LT; when GE => return LE; when LT => return GT; when LE => return GE; when others => return Result; end case; end if; return Result; end; end if; end Compile_Time_Compare; ------------------------------- -- Compile_Time_Known_Bounds -- ------------------------------- function Compile_Time_Known_Bounds (T : Entity_Id) return Boolean is Indx : Node_Id; Typ : Entity_Id; begin if T = Any_Composite or else not Is_Array_Type (T) then return False; end if; Indx := First_Index (T); while Present (Indx) loop Typ := Underlying_Type (Etype (Indx)); -- Never look at junk bounds of a generic type if Is_Generic_Type (Typ) then return False; end if; -- Otherwise check bounds for compile-time-known if not Compile_Time_Known_Value (Type_Low_Bound (Typ)) then return False; elsif not Compile_Time_Known_Value (Type_High_Bound (Typ)) then return False; else Next_Index (Indx); end if; end loop; return True; end Compile_Time_Known_Bounds; ------------------------------ -- Compile_Time_Known_Value -- ------------------------------ function Compile_Time_Known_Value (Op : Node_Id) return Boolean is K : constant Node_Kind := Nkind (Op); CV_Ent : CV_Entry renames CV_Cache (Nat (Op) mod CV_Cache_Size); begin -- Never known at compile time if bad type or raises Constraint_Error -- or empty (latter case occurs only as a result of a previous error). if No (Op) then Check_Error_Detected; return False; elsif Op = Error or else Etype (Op) = Any_Type or else Raises_Constraint_Error (Op) then return False; end if; -- If we have an entity name, then see if it is the name of a constant -- and if so, test the corresponding constant value, or the name of an -- enumeration literal, which is always a constant. if Present (Etype (Op)) and then Is_Entity_Name (Op) then declare Ent : constant Entity_Id := Entity (Op); Val : Node_Id; begin -- Never known at compile time if it is a packed array value. We -- might want to try to evaluate these at compile time one day, -- but we do not make that attempt now. if Is_Packed_Array_Impl_Type (Etype (Op)) then return False; elsif Ekind (Ent) = E_Enumeration_Literal then return True; elsif Ekind (Ent) = E_Constant then Val := Constant_Value (Ent); if Present (Val) then -- Guard against an illegal deferred constant whose full -- view is initialized with a reference to itself. Treat -- this case as a value not known at compile time. if Is_Entity_Name (Val) and then Entity (Val) = Ent then return False; else return Compile_Time_Known_Value (Val); end if; -- Otherwise, the constant does not have a compile-time-known -- value. else return False; end if; end if; end; -- We have a value, see if it is compile-time-known else -- Integer literals are worth storing in the cache if K = N_Integer_Literal then CV_Ent.N := Op; CV_Ent.V := Intval (Op); return True; -- Other literals and NULL are known at compile time elsif K in N_Character_Literal | N_Real_Literal | N_String_Literal | N_Null then return True; end if; end if; -- If we fall through, not known at compile time return False; -- If we get an exception while trying to do this test, then some error -- has occurred, and we simply say that the value is not known after all exception when others => -- With debug flag K we will get an exception unless an error has -- already occurred (useful for debugging). if Debug_Flag_K then Check_Error_Detected; end if; return False; end Compile_Time_Known_Value; -------------------------------------- -- Compile_Time_Known_Value_Or_Aggr -- -------------------------------------- function Compile_Time_Known_Value_Or_Aggr (Op : Node_Id) return Boolean is begin -- If we have an entity name, then see if it is the name of a constant -- and if so, test the corresponding constant value, or the name of -- an enumeration literal, which is always a constant. if Is_Entity_Name (Op) then declare E : constant Entity_Id := Entity (Op); V : Node_Id; begin if Ekind (E) = E_Enumeration_Literal then return True; elsif Ekind (E) /= E_Constant then return False; else V := Constant_Value (E); return Present (V) and then Compile_Time_Known_Value_Or_Aggr (V); end if; end; -- We have a value, see if it is compile-time-known else if Compile_Time_Known_Value (Op) then return True; elsif Nkind (Op) = N_Aggregate then if Present (Expressions (Op)) then declare Expr : Node_Id; begin Expr := First (Expressions (Op)); while Present (Expr) loop if not Compile_Time_Known_Value_Or_Aggr (Expr) then return False; else Next (Expr); end if; end loop; end; end if; if Present (Component_Associations (Op)) then declare Cass : Node_Id; begin Cass := First (Component_Associations (Op)); while Present (Cass) loop if not Compile_Time_Known_Value_Or_Aggr (Expression (Cass)) then return False; end if; Next (Cass); end loop; end; end if; return True; elsif Nkind (Op) = N_Qualified_Expression then return Compile_Time_Known_Value_Or_Aggr (Expression (Op)); -- All other types of values are not known at compile time else return False; end if; end if; end Compile_Time_Known_Value_Or_Aggr; --------------------------------------- -- CRT_Safe_Compile_Time_Known_Value -- --------------------------------------- function CRT_Safe_Compile_Time_Known_Value (Op : Node_Id) return Boolean is begin if (Configurable_Run_Time_Mode or No_Run_Time_Mode) and then not Is_OK_Static_Expression (Op) then return False; else return Compile_Time_Known_Value (Op); end if; end CRT_Safe_Compile_Time_Known_Value; ----------------- -- Eval_Actual -- ----------------- -- This is only called for actuals of functions that are not predefined -- operators (which have already been rewritten as operators at this -- stage), so the call can never be folded, and all that needs doing for -- the actual is to do the check for a non-static context. procedure Eval_Actual (N : Node_Id) is begin Check_Non_Static_Context (N); end Eval_Actual; -------------------- -- Eval_Allocator -- -------------------- -- Allocators are never static, so all we have to do is to do the -- check for a non-static context if an expression is present. procedure Eval_Allocator (N : Node_Id) is Expr : constant Node_Id := Expression (N); begin if Nkind (Expr) = N_Qualified_Expression then Check_Non_Static_Context (Expression (Expr)); end if; end Eval_Allocator; ------------------------ -- Eval_Arithmetic_Op -- ------------------------ -- Arithmetic operations are static functions, so the result is static -- if both operands are static (RM 4.9(7), 4.9(20)). procedure Eval_Arithmetic_Op (N : Node_Id) is Left : constant Node_Id := Left_Opnd (N); Right : constant Node_Id := Right_Opnd (N); Ltype : constant Entity_Id := Etype (Left); Rtype : constant Entity_Id := Etype (Right); Otype : Entity_Id := Empty; Stat : Boolean; Fold : Boolean; begin -- If not foldable we are done Test_Expression_Is_Foldable (N, Left, Right, Stat, Fold); if not Fold then return; end if; -- Otherwise attempt to fold if Is_Universal_Numeric_Type (Etype (Left)) and then Is_Universal_Numeric_Type (Etype (Right)) then Otype := Find_Universal_Operator_Type (N); end if; -- Fold for cases where both operands are of integer type if Is_Integer_Type (Ltype) and then Is_Integer_Type (Rtype) then declare Left_Int : constant Uint := Expr_Value (Left); Right_Int : constant Uint := Expr_Value (Right); Result : Uint; begin case Nkind (N) is when N_Op_Add => Result := Left_Int + Right_Int; when N_Op_Subtract => Result := Left_Int - Right_Int; when N_Op_Multiply => if OK_Bits (N, UI_From_Int (Num_Bits (Left_Int) + Num_Bits (Right_Int))) then Result := Left_Int * Right_Int; else Result := Left_Int; end if; when N_Op_Divide => -- The exception Constraint_Error is raised by integer -- division, rem and mod if the right operand is zero. if Right_Int = 0 then -- When SPARK_Mode is On, force a warning instead of -- an error in that case, as this likely corresponds -- to deactivated code. Apply_Compile_Time_Constraint_Error (N, "division by zero", CE_Divide_By_Zero, Warn => not Stat or SPARK_Mode = On); Set_Raises_Constraint_Error (N); return; -- Otherwise we can do the division else Result := Left_Int / Right_Int; end if; when N_Op_Mod => -- The exception Constraint_Error is raised by integer -- division, rem and mod if the right operand is zero. if Right_Int = 0 then -- When SPARK_Mode is On, force a warning instead of -- an error in that case, as this likely corresponds -- to deactivated code. Apply_Compile_Time_Constraint_Error (N, "mod with zero divisor", CE_Divide_By_Zero, Warn => not Stat or SPARK_Mode = On); return; else Result := Left_Int mod Right_Int; end if; when N_Op_Rem => -- The exception Constraint_Error is raised by integer -- division, rem and mod if the right operand is zero. if Right_Int = 0 then -- When SPARK_Mode is On, force a warning instead of -- an error in that case, as this likely corresponds -- to deactivated code. Apply_Compile_Time_Constraint_Error (N, "rem with zero divisor", CE_Divide_By_Zero, Warn => not Stat or SPARK_Mode = On); return; else Result := Left_Int rem Right_Int; end if; when others => raise Program_Error; end case; -- Adjust the result by the modulus if the type is a modular type if Is_Modular_Integer_Type (Ltype) then Result := Result mod Modulus (Ltype); -- For a signed integer type, check non-static overflow elsif (not Stat) and then Is_Signed_Integer_Type (Ltype) then declare BT : constant Entity_Id := Base_Type (Ltype); Lo : constant Uint := Expr_Value (Type_Low_Bound (BT)); Hi : constant Uint := Expr_Value (Type_High_Bound (BT)); begin if Result < Lo or else Result > Hi then Apply_Compile_Time_Constraint_Error (N, "value not in range of }??", CE_Overflow_Check_Failed, Ent => BT); return; end if; end; end if; -- If we get here we can fold the result Fold_Uint (N, Result, Stat); end; -- Cases where at least one operand is a real. We handle the cases of -- both reals, or mixed/real integer cases (the latter happen only for -- divide and multiply, and the result is always real). elsif Is_Real_Type (Ltype) or else Is_Real_Type (Rtype) then declare Left_Real : Ureal; Right_Real : Ureal; Result : Ureal; begin if Is_Real_Type (Ltype) then Left_Real := Expr_Value_R (Left); else Left_Real := UR_From_Uint (Expr_Value (Left)); end if; if Is_Real_Type (Rtype) then Right_Real := Expr_Value_R (Right); else Right_Real := UR_From_Uint (Expr_Value (Right)); end if; if Nkind (N) = N_Op_Add then Result := Left_Real + Right_Real; elsif Nkind (N) = N_Op_Subtract then Result := Left_Real - Right_Real; elsif Nkind (N) = N_Op_Multiply then Result := Left_Real * Right_Real; else pragma Assert (Nkind (N) = N_Op_Divide); if UR_Is_Zero (Right_Real) then Apply_Compile_Time_Constraint_Error (N, "division by zero", CE_Divide_By_Zero); return; end if; Result := Left_Real / Right_Real; end if; Fold_Ureal (N, Result, Stat); end; end if; -- If the operator was resolved to a specific type, make sure that type -- is frozen even if the expression is folded into a literal (which has -- a universal type). if Present (Otype) then Freeze_Before (N, Otype); end if; end Eval_Arithmetic_Op; ---------------------------- -- Eval_Character_Literal -- ---------------------------- -- Nothing to be done procedure Eval_Character_Literal (N : Node_Id) is pragma Warnings (Off, N); begin null; end Eval_Character_Literal; --------------- -- Eval_Call -- --------------- -- Static function calls are either calls to predefined operators -- with static arguments, or calls to functions that rename a literal. -- Only the latter case is handled here, predefined operators are -- constant-folded elsewhere. -- If the function is itself inherited the literal of the parent type must -- be explicitly converted to the return type of the function. procedure Eval_Call (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Typ : constant Entity_Id := Etype (N); Lit : Entity_Id; begin if Nkind (N) = N_Function_Call and then No (Parameter_Associations (N)) and then Is_Entity_Name (Name (N)) and then Present (Alias (Entity (Name (N)))) and then Is_Enumeration_Type (Base_Type (Typ)) then Lit := Ultimate_Alias (Entity (Name (N))); if Ekind (Lit) = E_Enumeration_Literal then if Base_Type (Etype (Lit)) /= Base_Type (Typ) then Rewrite (N, Convert_To (Typ, New_Occurrence_Of (Lit, Loc))); else Rewrite (N, New_Occurrence_Of (Lit, Loc)); end if; Resolve (N, Typ); end if; elsif Nkind (N) = N_Function_Call and then Is_Entity_Name (Name (N)) and then Is_Intrinsic_Subprogram (Entity (Name (N))) then Eval_Intrinsic_Call (N, Entity (Name (N))); -- Ada 202x (AI12-0075): If checking for potentially static expressions -- is enabled and we have a call to a static function, substitute a -- static value for the call, to allow folding the expression. This -- supports checking the requirement of RM 6.8(5.3/5) in -- Analyze_Expression_Function. elsif Checking_Potentially_Static_Expression and then Is_Static_Function_Call (N) then Fold_Dummy (N, Typ); end if; end Eval_Call; -------------------------- -- Eval_Case_Expression -- -------------------------- -- A conditional expression is static if all its conditions and dependent -- expressions are static. Note that we do not care if the dependent -- expressions raise CE, except for the one that will be selected. procedure Eval_Case_Expression (N : Node_Id) is Alt : Node_Id; Choice : Node_Id; begin Set_Is_Static_Expression (N, False); if Error_Posted (Expression (N)) or else not Is_Static_Expression (Expression (N)) then Check_Non_Static_Context (Expression (N)); return; end if; -- First loop, make sure all the alternatives are static expressions -- none of which raise Constraint_Error. We make the Constraint_Error -- check because part of the legality condition for a correct static -- case expression is that the cases are covered, like any other case -- expression. And we can't do that if any of the conditions raise an -- exception, so we don't even try to evaluate if that is the case. Alt := First (Alternatives (N)); while Present (Alt) loop -- The expression must be static, but we don't care at this stage -- if it raises Constraint_Error (the alternative might not match, -- in which case the expression is statically unevaluated anyway). if not Is_Static_Expression (Expression (Alt)) then Check_Non_Static_Context (Expression (Alt)); return; end if; -- The choices of a case always have to be static, and cannot raise -- an exception. If this condition is not met, then the expression -- is plain illegal, so just abandon evaluation attempts. No need -- to check non-static context when we have something illegal anyway. if not Is_OK_Static_Choice_List (Discrete_Choices (Alt)) then return; end if; Next (Alt); end loop; -- OK, if the above loop gets through it means that all choices are OK -- static (don't raise exceptions), so the whole case is static, and we -- can find the matching alternative. Set_Is_Static_Expression (N); -- Now to deal with propagating a possible Constraint_Error -- If the selecting expression raises CE, propagate and we are done if Raises_Constraint_Error (Expression (N)) then Set_Raises_Constraint_Error (N); -- Otherwise we need to check the alternatives to find the matching -- one. CE's in other than the matching one are not relevant. But we -- do need to check the matching one. Unlike the first loop, we do not -- have to go all the way through, when we find the matching one, quit. else Alt := First (Alternatives (N)); Search : loop -- We must find a match among the alternatives. If not, this must -- be due to other errors, so just ignore, leaving as non-static. if No (Alt) then Set_Is_Static_Expression (N, False); return; end if; -- Otherwise loop through choices of this alternative Choice := First (Discrete_Choices (Alt)); while Present (Choice) loop -- If we find a matching choice, then the Expression of this -- alternative replaces N (Raises_Constraint_Error flag is -- included, so we don't have to special case that). if Choice_Matches (Expression (N), Choice) = Match then Rewrite (N, Relocate_Node (Expression (Alt))); return; end if; Next (Choice); end loop; Next (Alt); end loop Search; end if; end Eval_Case_Expression; ------------------------ -- Eval_Concatenation -- ------------------------ -- Concatenation is a static function, so the result is static if both -- operands are static (RM 4.9(7), 4.9(21)). procedure Eval_Concatenation (N : Node_Id) is Left : constant Node_Id := Left_Opnd (N); Right : constant Node_Id := Right_Opnd (N); C_Typ : constant Entity_Id := Root_Type (Component_Type (Etype (N))); Stat : Boolean; Fold : Boolean; begin -- Concatenation is never static in Ada 83, so if Ada 83 check operand -- non-static context. if Ada_Version = Ada_83 and then Comes_From_Source (N) then Check_Non_Static_Context (Left); Check_Non_Static_Context (Right); return; end if; -- If not foldable we are done. In principle concatenation that yields -- any string type is static (i.e. an array type of character types). -- However, character types can include enumeration literals, and -- concatenation in that case cannot be described by a literal, so we -- only consider the operation static if the result is an array of -- (a descendant of) a predefined character type. Test_Expression_Is_Foldable (N, Left, Right, Stat, Fold); if not (Is_Standard_Character_Type (C_Typ) and then Fold) then Set_Is_Static_Expression (N, False); return; end if; -- Compile time string concatenation -- ??? Note that operands that are aggregates can be marked as static, -- so we should attempt at a later stage to fold concatenations with -- such aggregates. declare Left_Str : constant Node_Id := Get_String_Val (Left); Left_Len : Nat; Right_Str : constant Node_Id := Get_String_Val (Right); Folded_Val : String_Id := No_String; begin -- Establish new string literal, and store left operand. We make -- sure to use the special Start_String that takes an operand if -- the left operand is a string literal. Since this is optimized -- in the case where that is the most recently created string -- literal, we ensure efficient time/space behavior for the -- case of a concatenation of a series of string literals. if Nkind (Left_Str) = N_String_Literal then Left_Len := String_Length (Strval (Left_Str)); -- If the left operand is the empty string, and the right operand -- is a string literal (the case of "" & "..."), the result is the -- value of the right operand. This optimization is important when -- Is_Folded_In_Parser, to avoid copying an enormous right -- operand. if Left_Len = 0 and then Nkind (Right_Str) = N_String_Literal then Folded_Val := Strval (Right_Str); else Start_String (Strval (Left_Str)); end if; else Start_String; Store_String_Char (UI_To_CC (Char_Literal_Value (Left_Str))); Left_Len := 1; end if; -- Now append the characters of the right operand, unless we -- optimized the "" & "..." case above. if Nkind (Right_Str) = N_String_Literal then if Left_Len /= 0 then Store_String_Chars (Strval (Right_Str)); Folded_Val := End_String; end if; else Store_String_Char (UI_To_CC (Char_Literal_Value (Right_Str))); Folded_Val := End_String; end if; Set_Is_Static_Expression (N, Stat); -- If left operand is the empty string, the result is the -- right operand, including its bounds if anomalous. if Left_Len = 0 and then Is_Array_Type (Etype (Right)) and then Etype (Right) /= Any_String then Set_Etype (N, Etype (Right)); end if; Fold_Str (N, Folded_Val, Static => Stat); end; end Eval_Concatenation; ---------------------- -- Eval_Entity_Name -- ---------------------- -- This procedure is used for identifiers and expanded names other than -- named numbers (see Eval_Named_Integer, Eval_Named_Real. These are -- static if they denote a static constant (RM 4.9(6)) or if the name -- denotes an enumeration literal (RM 4.9(22)). procedure Eval_Entity_Name (N : Node_Id) is Def_Id : constant Entity_Id := Entity (N); Val : Node_Id; begin -- Enumeration literals are always considered to be constants -- and cannot raise Constraint_Error (RM 4.9(22)). if Ekind (Def_Id) = E_Enumeration_Literal then Set_Is_Static_Expression (N); return; -- A name is static if it denotes a static constant (RM 4.9(5)), and -- we also copy Raise_Constraint_Error. Notice that even if non-static, -- it does not violate 10.2.1(8) here, since this is not a variable. elsif Ekind (Def_Id) = E_Constant then -- Deferred constants must always be treated as nonstatic outside the -- scope of their full view. if Present (Full_View (Def_Id)) and then not In_Open_Scopes (Scope (Def_Id)) then Val := Empty; else Val := Constant_Value (Def_Id); end if; if Present (Val) then Set_Is_Static_Expression (N, Is_Static_Expression (Val) and then Is_Static_Subtype (Etype (Def_Id))); Set_Raises_Constraint_Error (N, Raises_Constraint_Error (Val)); if not Is_Static_Expression (N) and then not Is_Generic_Type (Etype (N)) then Validate_Static_Object_Name (N); end if; -- Mark constant condition in SCOs if Generate_SCO and then Comes_From_Source (N) and then Is_Boolean_Type (Etype (Def_Id)) and then Compile_Time_Known_Value (N) then Set_SCO_Condition (N, Expr_Value_E (N) = Standard_True); end if; return; end if; -- Ada 202x (AI12-0075): If checking for potentially static expressions -- is enabled and we have a reference to a formal parameter of mode in, -- substitute a static value for the reference, to allow folding the -- expression. This supports checking the requirement of RM 6.8(5.3/5) -- in Analyze_Expression_Function. elsif Ekind (Def_Id) = E_In_Parameter and then Checking_Potentially_Static_Expression and then Is_Static_Function (Scope (Def_Id)) then Fold_Dummy (N, Etype (Def_Id)); end if; -- Fall through if the name is not static Validate_Static_Object_Name (N); end Eval_Entity_Name; ------------------------ -- Eval_If_Expression -- ------------------------ -- We can fold to a static expression if the condition and both dependent -- expressions are static. Otherwise, the only required processing is to do -- the check for non-static context for the then and else expressions. procedure Eval_If_Expression (N : Node_Id) is Condition : constant Node_Id := First (Expressions (N)); Then_Expr : constant Node_Id := Next (Condition); Else_Expr : constant Node_Id := Next (Then_Expr); Result : Node_Id; Non_Result : Node_Id; Rstat : constant Boolean := Is_Static_Expression (Condition) and then Is_Static_Expression (Then_Expr) and then Is_Static_Expression (Else_Expr); -- True if result is static begin -- If result not static, nothing to do, otherwise set static result if not Rstat then return; else Set_Is_Static_Expression (N); end if; -- If any operand is Any_Type, just propagate to result and do not try -- to fold, this prevents cascaded errors. if Etype (Condition) = Any_Type or else Etype (Then_Expr) = Any_Type or else Etype (Else_Expr) = Any_Type then Set_Etype (N, Any_Type); Set_Is_Static_Expression (N, False); return; end if; -- If condition raises Constraint_Error then we have already signaled -- an error, and we just propagate to the result and do not fold. if Raises_Constraint_Error (Condition) then Set_Raises_Constraint_Error (N); return; end if; -- Static case where we can fold. Note that we don't try to fold cases -- where the condition is known at compile time, but the result is -- non-static. This avoids possible cases of infinite recursion where -- the expander puts in a redundant test and we remove it. Instead we -- deal with these cases in the expander. -- Select result operand if Is_True (Expr_Value (Condition)) then Result := Then_Expr; Non_Result := Else_Expr; else Result := Else_Expr; Non_Result := Then_Expr; end if; -- Note that it does not matter if the non-result operand raises a -- Constraint_Error, but if the result raises Constraint_Error then we -- replace the node with a raise Constraint_Error. This will properly -- propagate Raises_Constraint_Error since this flag is set in Result. if Raises_Constraint_Error (Result) then Rewrite_In_Raise_CE (N, Result); Check_Non_Static_Context (Non_Result); -- Otherwise the result operand replaces the original node else Rewrite (N, Relocate_Node (Result)); Set_Is_Static_Expression (N); end if; end Eval_If_Expression; ---------------------------- -- Eval_Indexed_Component -- ---------------------------- -- Indexed components are never static, so we need to perform the check -- for non-static context on the index values. Then, we check if the -- value can be obtained at compile time, even though it is non-static. procedure Eval_Indexed_Component (N : Node_Id) is Expr : Node_Id; begin -- Check for non-static context on index values Expr := First (Expressions (N)); while Present (Expr) loop Check_Non_Static_Context (Expr); Next (Expr); end loop; -- If the indexed component appears in an object renaming declaration -- then we do not want to try to evaluate it, since in this case we -- need the identity of the array element. if Nkind (Parent (N)) = N_Object_Renaming_Declaration then return; -- Similarly if the indexed component appears as the prefix of an -- attribute we don't want to evaluate it, because at least for -- some cases of attributes we need the identify (e.g. Access, Size). elsif Nkind (Parent (N)) = N_Attribute_Reference then return; end if; -- Note: there are other cases, such as the left side of an assignment, -- or an OUT parameter for a call, where the replacement results in the -- illegal use of a constant, But these cases are illegal in the first -- place, so the replacement, though silly, is harmless. -- Now see if this is a constant array reference if List_Length (Expressions (N)) = 1 and then Is_Entity_Name (Prefix (N)) and then Ekind (Entity (Prefix (N))) = E_Constant and then Present (Constant_Value (Entity (Prefix (N)))) then declare Loc : constant Source_Ptr := Sloc (N); Arr : constant Node_Id := Constant_Value (Entity (Prefix (N))); Sub : constant Node_Id := First (Expressions (N)); Atyp : Entity_Id; -- Type of array Lin : Nat; -- Linear one's origin subscript value for array reference Lbd : Node_Id; -- Lower bound of the first array index Elm : Node_Id; -- Value from constant array begin Atyp := Etype (Arr); if Is_Access_Type (Atyp) then Atyp := Designated_Type (Atyp); end if; -- If we have an array type (we should have but perhaps there are -- error cases where this is not the case), then see if we can do -- a constant evaluation of the array reference. if Is_Array_Type (Atyp) and then Atyp /= Any_Composite then if Ekind (Atyp) = E_String_Literal_Subtype then Lbd := String_Literal_Low_Bound (Atyp); else Lbd := Type_Low_Bound (Etype (First_Index (Atyp))); end if; if Compile_Time_Known_Value (Sub) and then Nkind (Arr) = N_Aggregate and then Compile_Time_Known_Value (Lbd) and then Is_Discrete_Type (Component_Type (Atyp)) then Lin := UI_To_Int (Expr_Value (Sub) - Expr_Value (Lbd)) + 1; if List_Length (Expressions (Arr)) >= Lin then Elm := Pick (Expressions (Arr), Lin); -- If the resulting expression is compile-time-known, -- then we can rewrite the indexed component with this -- value, being sure to mark the result as non-static. -- We also reset the Sloc, in case this generates an -- error later on (e.g. 136'Access). if Compile_Time_Known_Value (Elm) then Rewrite (N, Duplicate_Subexpr_No_Checks (Elm)); Set_Is_Static_Expression (N, False); Set_Sloc (N, Loc); end if; end if; -- We can also constant-fold if the prefix is a string literal. -- This will be useful in an instantiation or an inlining. elsif Compile_Time_Known_Value (Sub) and then Nkind (Arr) = N_String_Literal and then Compile_Time_Known_Value (Lbd) and then Expr_Value (Lbd) = 1 and then Expr_Value (Sub) <= String_Literal_Length (Etype (Arr)) then declare C : constant Char_Code := Get_String_Char (Strval (Arr), UI_To_Int (Expr_Value (Sub))); begin Set_Character_Literal_Name (C); Elm := Make_Character_Literal (Loc, Chars => Name_Find, Char_Literal_Value => UI_From_CC (C)); Set_Etype (Elm, Component_Type (Atyp)); Rewrite (N, Duplicate_Subexpr_No_Checks (Elm)); Set_Is_Static_Expression (N, False); end; end if; end if; end; end if; end Eval_Indexed_Component; -------------------------- -- Eval_Integer_Literal -- -------------------------- -- Numeric literals are static (RM 4.9(1)), and have already been marked -- as static by the analyzer. The reason we did it that early is to allow -- the possibility of turning off the Is_Static_Expression flag after -- analysis, but before resolution, when integer literals are generated in -- the expander that do not correspond to static expressions. procedure Eval_Integer_Literal (N : Node_Id) is function In_Any_Integer_Context (Context : Node_Id) return Boolean; -- If the literal is resolved with a specific type in a context where -- the expected type is Any_Integer, there are no range checks on the -- literal. By the time the literal is evaluated, it carries the type -- imposed by the enclosing expression, and we must recover the context -- to determine that Any_Integer is meant. ---------------------------- -- In_Any_Integer_Context -- ---------------------------- function In_Any_Integer_Context (Context : Node_Id) return Boolean is begin -- Any_Integer also appears in digits specifications for real types, -- but those have bounds smaller that those of any integer base type, -- so we can safely ignore these cases. return Nkind (Context) in N_Attribute_Definition_Clause | N_Attribute_Reference | N_Modular_Type_Definition | N_Number_Declaration | N_Signed_Integer_Type_Definition; end In_Any_Integer_Context; -- Local variables Par : constant Node_Id := Parent (N); Typ : constant Entity_Id := Etype (N); -- Start of processing for Eval_Integer_Literal begin -- If the literal appears in a non-expression context, then it is -- certainly appearing in a non-static context, so check it. This is -- actually a redundant check, since Check_Non_Static_Context would -- check it, but it seems worthwhile to optimize out the call. -- Additionally, when the literal appears within an if or case -- expression it must be checked as well. However, due to the literal -- appearing within a conditional statement, expansion greatly changes -- the nature of its context and performing some of the checks within -- Check_Non_Static_Context on an expanded literal may lead to spurious -- and misleading warnings. if (Nkind (Par) in N_Case_Expression_Alternative | N_If_Expression or else Nkind (Par) not in N_Subexpr) and then (Nkind (Par) not in N_Case_Expression_Alternative | N_If_Expression or else Comes_From_Source (N)) and then not In_Any_Integer_Context (Par) then Check_Non_Static_Context (N); end if; -- Modular integer literals must be in their base range if Is_Modular_Integer_Type (Typ) and then Is_Out_Of_Range (N, Base_Type (Typ), Assume_Valid => True) then Out_Of_Range (N); end if; end Eval_Integer_Literal; ------------------------- -- Eval_Intrinsic_Call -- ------------------------- procedure Eval_Intrinsic_Call (N : Node_Id; E : Entity_Id) is procedure Eval_Shift (N : Node_Id; E : Entity_Id; Op : Node_Kind); -- Evaluate an intrinsic shift call N on the given subprogram E. -- Op is the kind for the shift node. ---------------- -- Eval_Shift -- ---------------- procedure Eval_Shift (N : Node_Id; E : Entity_Id; Op : Node_Kind) is Left : constant Node_Id := First_Actual (N); Right : constant Node_Id := Next_Actual (Left); Static : constant Boolean := Is_Static_Function (E); begin if Static then if Checking_Potentially_Static_Expression then Fold_Dummy (N, Etype (N)); return; end if; end if; Fold_Shift (N, Left, Right, Op, Static => Static, Check_Elab => not Static); end Eval_Shift; Nam : Name_Id; begin -- Nothing to do if the intrinsic is handled by the back end. if Present (Interface_Name (E)) then return; end if; -- Intrinsic calls as part of a static function is a language extension. if Checking_Potentially_Static_Expression and then not Extensions_Allowed then return; end if; -- If we have a renaming, expand the call to the original operation, -- which must itself be intrinsic, since renaming requires matching -- conventions and this has already been checked. if Present (Alias (E)) then Eval_Intrinsic_Call (N, Alias (E)); return; end if; -- If the intrinsic subprogram is generic, gets its original name if Present (Parent (E)) and then Present (Generic_Parent (Parent (E))) then Nam := Chars (Generic_Parent (Parent (E))); else Nam := Chars (E); end if; case Nam is when Name_Shift_Left => Eval_Shift (N, E, N_Op_Shift_Left); when Name_Shift_Right => Eval_Shift (N, E, N_Op_Shift_Right); when Name_Shift_Right_Arithmetic => Eval_Shift (N, E, N_Op_Shift_Right_Arithmetic); when others => null; end case; end Eval_Intrinsic_Call; --------------------- -- Eval_Logical_Op -- --------------------- -- Logical operations are static functions, so the result is potentially -- static if both operands are potentially static (RM 4.9(7), 4.9(20)). procedure Eval_Logical_Op (N : Node_Id) is Left : constant Node_Id := Left_Opnd (N); Right : constant Node_Id := Right_Opnd (N); Stat : Boolean; Fold : Boolean; begin -- If not foldable we are done Test_Expression_Is_Foldable (N, Left, Right, Stat, Fold); if not Fold then return; end if; -- Compile time evaluation of logical operation declare Left_Int : constant Uint := Expr_Value (Left); Right_Int : constant Uint := Expr_Value (Right); begin if Is_Modular_Integer_Type (Etype (N)) then declare Left_Bits : Bits (0 .. UI_To_Int (Esize (Etype (N))) - 1); Right_Bits : Bits (0 .. UI_To_Int (Esize (Etype (N))) - 1); begin To_Bits (Left_Int, Left_Bits); To_Bits (Right_Int, Right_Bits); -- Note: should really be able to use array ops instead of -- these loops, but they break the build with a cryptic error -- during the bind of gnat1 likely due to a wrong computation -- of a date or checksum. if Nkind (N) = N_Op_And then for J in Left_Bits'Range loop Left_Bits (J) := Left_Bits (J) and Right_Bits (J); end loop; elsif Nkind (N) = N_Op_Or then for J in Left_Bits'Range loop Left_Bits (J) := Left_Bits (J) or Right_Bits (J); end loop; else pragma Assert (Nkind (N) = N_Op_Xor); for J in Left_Bits'Range loop Left_Bits (J) := Left_Bits (J) xor Right_Bits (J); end loop; end if; Fold_Uint (N, From_Bits (Left_Bits, Etype (N)), Stat); end; else pragma Assert (Is_Boolean_Type (Etype (N))); if Nkind (N) = N_Op_And then Fold_Uint (N, Test (Is_True (Left_Int) and then Is_True (Right_Int)), Stat); elsif Nkind (N) = N_Op_Or then Fold_Uint (N, Test (Is_True (Left_Int) or else Is_True (Right_Int)), Stat); else pragma Assert (Nkind (N) = N_Op_Xor); Fold_Uint (N, Test (Is_True (Left_Int) xor Is_True (Right_Int)), Stat); end if; end if; end; end Eval_Logical_Op; ------------------------ -- Eval_Membership_Op -- ------------------------ -- A membership test is potentially static if the expression is static, and -- the range is a potentially static range, or is a subtype mark denoting a -- static subtype (RM 4.9(12)). procedure Eval_Membership_Op (N : Node_Id) is Alts : constant List_Id := Alternatives (N); Choice : constant Node_Id := Right_Opnd (N); Expr : constant Node_Id := Left_Opnd (N); Result : Match_Result; begin -- Ignore if error in either operand, except to make sure that Any_Type -- is properly propagated to avoid junk cascaded errors. if Etype (Expr) = Any_Type or else (Present (Choice) and then Etype (Choice) = Any_Type) then Set_Etype (N, Any_Type); return; end if; -- If left operand non-static, then nothing to do if not Is_Static_Expression (Expr) then return; end if; -- If choice is non-static, left operand is in non-static context if (Present (Choice) and then not Is_Static_Choice (Choice)) or else (Present (Alts) and then not Is_Static_Choice_List (Alts)) then Check_Non_Static_Context (Expr); return; end if; -- Otherwise we definitely have a static expression Set_Is_Static_Expression (N); -- If left operand raises Constraint_Error, propagate and we are done if Raises_Constraint_Error (Expr) then Set_Raises_Constraint_Error (N, True); -- See if we match else if Present (Choice) then Result := Choice_Matches (Expr, Choice); else Result := Choices_Match (Expr, Alts); end if; -- If result is Non_Static, it means that we raise Constraint_Error, -- since we already tested that the operands were themselves static. if Result = Non_Static then Set_Raises_Constraint_Error (N); -- Otherwise we have our result (flipped if NOT IN case) else Fold_Uint (N, Test ((Result = Match) xor (Nkind (N) = N_Not_In)), True); Warn_On_Known_Condition (N); end if; end if; end Eval_Membership_Op; ------------------------ -- Eval_Named_Integer -- ------------------------ procedure Eval_Named_Integer (N : Node_Id) is begin Fold_Uint (N, Expr_Value (Expression (Declaration_Node (Entity (N)))), True); end Eval_Named_Integer; --------------------- -- Eval_Named_Real -- --------------------- procedure Eval_Named_Real (N : Node_Id) is begin Fold_Ureal (N, Expr_Value_R (Expression (Declaration_Node (Entity (N)))), True); end Eval_Named_Real; ------------------- -- Eval_Op_Expon -- ------------------- -- Exponentiation is a static functions, so the result is potentially -- static if both operands are potentially static (RM 4.9(7), 4.9(20)). procedure Eval_Op_Expon (N : Node_Id) is Left : constant Node_Id := Left_Opnd (N); Right : constant Node_Id := Right_Opnd (N); Stat : Boolean; Fold : Boolean; begin -- If not foldable we are done Test_Expression_Is_Foldable (N, Left, Right, Stat, Fold, CRT_Safe => True); -- Return if not foldable if not Fold then return; end if; if Configurable_Run_Time_Mode and not Stat then return; end if; -- Fold exponentiation operation declare Right_Int : constant Uint := Expr_Value (Right); begin -- Integer case if Is_Integer_Type (Etype (Left)) then declare Left_Int : constant Uint := Expr_Value (Left); Result : Uint; begin -- Exponentiation of an integer raises Constraint_Error for a -- negative exponent (RM 4.5.6). if Right_Int < 0 then Apply_Compile_Time_Constraint_Error (N, "integer exponent negative", CE_Range_Check_Failed, Warn => not Stat); return; else if OK_Bits (N, Num_Bits (Left_Int) * Right_Int) then Result := Left_Int ** Right_Int; else Result := Left_Int; end if; if Is_Modular_Integer_Type (Etype (N)) then Result := Result mod Modulus (Etype (N)); end if; Fold_Uint (N, Result, Stat); end if; end; -- Real case else declare Left_Real : constant Ureal := Expr_Value_R (Left); begin -- Cannot have a zero base with a negative exponent if UR_Is_Zero (Left_Real) then if Right_Int < 0 then Apply_Compile_Time_Constraint_Error (N, "zero ** negative integer", CE_Range_Check_Failed, Warn => not Stat); return; else Fold_Ureal (N, Ureal_0, Stat); end if; else Fold_Ureal (N, Left_Real ** Right_Int, Stat); end if; end; end if; end; end Eval_Op_Expon; ----------------- -- Eval_Op_Not -- ----------------- -- The not operation is a static function, so the result is potentially -- static if the operand is potentially static (RM 4.9(7), 4.9(20)). procedure Eval_Op_Not (N : Node_Id) is Right : constant Node_Id := Right_Opnd (N); Stat : Boolean; Fold : Boolean; begin -- If not foldable we are done Test_Expression_Is_Foldable (N, Right, Stat, Fold); if not Fold then return; end if; -- Fold not operation declare Rint : constant Uint := Expr_Value (Right); Typ : constant Entity_Id := Etype (N); begin -- Negation is equivalent to subtracting from the modulus minus one. -- For a binary modulus this is equivalent to the ones-complement of -- the original value. For a nonbinary modulus this is an arbitrary -- but consistent definition. if Is_Modular_Integer_Type (Typ) then Fold_Uint (N, Modulus (Typ) - 1 - Rint, Stat); else pragma Assert (Is_Boolean_Type (Typ)); Fold_Uint (N, Test (not Is_True (Rint)), Stat); end if; Set_Is_Static_Expression (N, Stat); end; end Eval_Op_Not; ------------------------------- -- Eval_Qualified_Expression -- ------------------------------- -- A qualified expression is potentially static if its subtype mark denotes -- a static subtype and its expression is potentially static (RM 4.9 (10)). procedure Eval_Qualified_Expression (N : Node_Id) is Operand : constant Node_Id := Expression (N); Target_Type : constant Entity_Id := Entity (Subtype_Mark (N)); Stat : Boolean; Fold : Boolean; Hex : Boolean; begin -- Can only fold if target is string or scalar and subtype is static. -- Also, do not fold if our parent is an allocator (this is because the -- qualified expression is really part of the syntactic structure of an -- allocator, and we do not want to end up with something that -- corresponds to "new 1" where the 1 is the result of folding a -- qualified expression). if not Is_Static_Subtype (Target_Type) or else Nkind (Parent (N)) = N_Allocator then Check_Non_Static_Context (Operand); -- If operand is known to raise Constraint_Error, set the flag on the -- expression so it does not get optimized away. if Nkind (Operand) = N_Raise_Constraint_Error then Set_Raises_Constraint_Error (N); end if; return; -- Also return if a semantic error has been posted on the node, as we -- don't want to fold in that case (for GNATprove, the node might lead -- to Constraint_Error but won't have been replaced with a raise node -- or marked as raising CE). elsif Error_Posted (N) then return; end if; -- If not foldable we are done Test_Expression_Is_Foldable (N, Operand, Stat, Fold); if not Fold then return; -- Don't try fold if target type has Constraint_Error bounds elsif not Is_OK_Static_Subtype (Target_Type) then Set_Raises_Constraint_Error (N); return; end if; -- Fold the result of qualification if Is_Discrete_Type (Target_Type) then -- Save Print_In_Hex indication Hex := Nkind (Operand) = N_Integer_Literal and then Print_In_Hex (Operand); Fold_Uint (N, Expr_Value (Operand), Stat); -- Preserve Print_In_Hex indication if Hex and then Nkind (N) = N_Integer_Literal then Set_Print_In_Hex (N); end if; elsif Is_Real_Type (Target_Type) then Fold_Ureal (N, Expr_Value_R (Operand), Stat); else Fold_Str (N, Strval (Get_String_Val (Operand)), Stat); if not Stat then Set_Is_Static_Expression (N, False); else Check_String_Literal_Length (N, Target_Type); end if; return; end if; -- The expression may be foldable but not static Set_Is_Static_Expression (N, Stat); if Is_Out_Of_Range (N, Etype (N), Assume_Valid => True) then Out_Of_Range (N); end if; end Eval_Qualified_Expression; ----------------------- -- Eval_Real_Literal -- ----------------------- -- Numeric literals are static (RM 4.9(1)), and have already been marked -- as static by the analyzer. The reason we did it that early is to allow -- the possibility of turning off the Is_Static_Expression flag after -- analysis, but before resolution, when integer literals are generated -- in the expander that do not correspond to static expressions. procedure Eval_Real_Literal (N : Node_Id) is PK : constant Node_Kind := Nkind (Parent (N)); begin -- If the literal appears in a non-expression context and not as part of -- a number declaration, then it is appearing in a non-static context, -- so check it. if PK not in N_Subexpr and then PK /= N_Number_Declaration then Check_Non_Static_Context (N); end if; end Eval_Real_Literal; ------------------------ -- Eval_Relational_Op -- ------------------------ -- Relational operations are static functions, so the result is static if -- both operands are static (RM 4.9(7), 4.9(20)), except that up to Ada -- 2012, for strings the result is never static, even if the operands are. -- The string case was relaxed in Ada 2020, see AI12-0201. -- However, for internally generated nodes, we allow string equality and -- inequality to be static. This is because we rewrite A in "ABC" as an -- equality test A = "ABC", and the former is definitely static. procedure Eval_Relational_Op (N : Node_Id) is Left : constant Node_Id := Left_Opnd (N); Right : constant Node_Id := Right_Opnd (N); procedure Decompose_Expr (Expr : Node_Id; Ent : out Entity_Id; Kind : out Character; Cons : out Uint; Orig : Boolean := True); -- Given expression Expr, see if it is of the form X [+/- K]. If so, Ent -- is set to the entity in X, Kind is 'F','L','E' for 'First or 'Last or -- simple entity, and Cons is the value of K. If the expression is not -- of the required form, Ent is set to Empty. -- -- Orig indicates whether Expr is the original expression to consider, -- or if we are handling a subexpression (e.g. recursive call to -- Decompose_Expr). procedure Fold_General_Op (Is_Static : Boolean); -- Attempt to fold arbitrary relational operator N. Flag Is_Static must -- be set when the operator denotes a static expression. procedure Fold_Static_Real_Op; -- Attempt to fold static real type relational operator N function Static_Length (Expr : Node_Id) return Uint; -- If Expr is an expression for a constrained array whose length is -- known at compile time, return the non-negative length, otherwise -- return -1. -------------------- -- Decompose_Expr -- -------------------- procedure Decompose_Expr (Expr : Node_Id; Ent : out Entity_Id; Kind : out Character; Cons : out Uint; Orig : Boolean := True) is Exp : Node_Id; begin -- Assume that the expression does not meet the expected form Cons := No_Uint; Ent := Empty; Kind := '?'; if Nkind (Expr) = N_Op_Add and then Compile_Time_Known_Value (Right_Opnd (Expr)) then Exp := Left_Opnd (Expr); Cons := Expr_Value (Right_Opnd (Expr)); elsif Nkind (Expr) = N_Op_Subtract and then Compile_Time_Known_Value (Right_Opnd (Expr)) then Exp := Left_Opnd (Expr); Cons := -Expr_Value (Right_Opnd (Expr)); -- If the bound is a constant created to remove side effects, recover -- the original expression to see if it has one of the recognizable -- forms. elsif Nkind (Expr) = N_Identifier and then not Comes_From_Source (Entity (Expr)) and then Ekind (Entity (Expr)) = E_Constant and then Nkind (Parent (Entity (Expr))) = N_Object_Declaration then Exp := Expression (Parent (Entity (Expr))); Decompose_Expr (Exp, Ent, Kind, Cons, Orig => False); -- If original expression includes an entity, create a reference -- to it for use below. if Present (Ent) then Exp := New_Occurrence_Of (Ent, Sloc (Ent)); else return; end if; else -- Only consider the case of X + 0 for a full expression, and -- not when recursing, otherwise we may end up with evaluating -- expressions not known at compile time to 0. if Orig then Exp := Expr; Cons := Uint_0; else return; end if; end if; -- At this stage Exp is set to the potential X if Nkind (Exp) = N_Attribute_Reference then if Attribute_Name (Exp) = Name_First then Kind := 'F'; elsif Attribute_Name (Exp) = Name_Last then Kind := 'L'; else return; end if; Exp := Prefix (Exp); else Kind := 'E'; end if; if Is_Entity_Name (Exp) and then Present (Entity (Exp)) then Ent := Entity (Exp); end if; end Decompose_Expr; --------------------- -- Fold_General_Op -- --------------------- procedure Fold_General_Op (Is_Static : Boolean) is CR : constant Compare_Result := Compile_Time_Compare (Left, Right, Assume_Valid => False); Result : Boolean; begin if CR = Unknown then return; end if; case Nkind (N) is when N_Op_Eq => if CR = EQ then Result := True; elsif CR = NE or else CR = GT or else CR = LT then Result := False; else return; end if; when N_Op_Ge => if CR = GT or else CR = EQ or else CR = GE then Result := True; elsif CR = LT then Result := False; else return; end if; when N_Op_Gt => if CR = GT then Result := True; elsif CR = EQ or else CR = LT or else CR = LE then Result := False; else return; end if; when N_Op_Le => if CR = LT or else CR = EQ or else CR = LE then Result := True; elsif CR = GT then Result := False; else return; end if; when N_Op_Lt => if CR = LT then Result := True; elsif CR = EQ or else CR = GT or else CR = GE then Result := False; else return; end if; when N_Op_Ne => if CR = NE or else CR = GT or else CR = LT then Result := True; elsif CR = EQ then Result := False; else return; end if; when others => raise Program_Error; end case; -- Determine the potential outcome of the relation assuming the -- operands are valid and emit a warning when the relation yields -- True or False only in the presence of invalid values. Warn_On_Constant_Valid_Condition (N); Fold_Uint (N, Test (Result), Is_Static); end Fold_General_Op; ------------------------- -- Fold_Static_Real_Op -- ------------------------- procedure Fold_Static_Real_Op is Left_Real : constant Ureal := Expr_Value_R (Left); Right_Real : constant Ureal := Expr_Value_R (Right); Result : Boolean; begin case Nkind (N) is when N_Op_Eq => Result := (Left_Real = Right_Real); when N_Op_Ge => Result := (Left_Real >= Right_Real); when N_Op_Gt => Result := (Left_Real > Right_Real); when N_Op_Le => Result := (Left_Real <= Right_Real); when N_Op_Lt => Result := (Left_Real < Right_Real); when N_Op_Ne => Result := (Left_Real /= Right_Real); when others => raise Program_Error; end case; Fold_Uint (N, Test (Result), True); end Fold_Static_Real_Op; ------------------- -- Static_Length -- ------------------- function Static_Length (Expr : Node_Id) return Uint is Cons1 : Uint; Cons2 : Uint; Ent1 : Entity_Id; Ent2 : Entity_Id; Kind1 : Character; Kind2 : Character; Typ : Entity_Id; begin -- First easy case string literal if Nkind (Expr) = N_String_Literal then return UI_From_Int (String_Length (Strval (Expr))); -- With frontend inlining as performed in GNATprove mode, a variable -- may be inserted that has a string literal subtype. Deal with this -- specially as for the previous case. elsif Ekind (Etype (Expr)) = E_String_Literal_Subtype then return String_Literal_Length (Etype (Expr)); -- Second easy case, not constrained subtype, so no length elsif not Is_Constrained (Etype (Expr)) then return Uint_Minus_1; end if; -- General case Typ := Etype (First_Index (Etype (Expr))); -- The simple case, both bounds are known at compile time if Is_Discrete_Type (Typ) and then Compile_Time_Known_Value (Type_Low_Bound (Typ)) and then Compile_Time_Known_Value (Type_High_Bound (Typ)) then return UI_Max (Uint_0, Expr_Value (Type_High_Bound (Typ)) - Expr_Value (Type_Low_Bound (Typ)) + 1); end if; -- A more complex case, where the bounds are of the form X [+/- K1] -- .. X [+/- K2]), where X is an expression that is either A'First or -- A'Last (with A an entity name), or X is an entity name, and the -- two X's are the same and K1 and K2 are known at compile time, in -- this case, the length can also be computed at compile time, even -- though the bounds are not known. A common case of this is e.g. -- (X'First .. X'First+5). Decompose_Expr (Original_Node (Type_Low_Bound (Typ)), Ent1, Kind1, Cons1); Decompose_Expr (Original_Node (Type_High_Bound (Typ)), Ent2, Kind2, Cons2); if Present (Ent1) and then Ent1 = Ent2 and then Kind1 = Kind2 then return Cons2 - Cons1 + 1; else return Uint_Minus_1; end if; end Static_Length; -- Local variables Left_Typ : constant Entity_Id := Etype (Left); Right_Typ : constant Entity_Id := Etype (Right); Fold : Boolean; Left_Len : Uint; Op_Typ : Entity_Id := Empty; Right_Len : Uint; Is_Static_Expression : Boolean; -- Start of processing for Eval_Relational_Op begin -- One special case to deal with first. If we can tell that the result -- will be false because the lengths of one or more index subtypes are -- compile-time known and different, then we can replace the entire -- result by False. We only do this for one-dimensional arrays, because -- the case of multidimensional arrays is rare and too much trouble. If -- one of the operands is an illegal aggregate, its type might still be -- an arbitrary composite type, so nothing to do. if Is_Array_Type (Left_Typ) and then Left_Typ /= Any_Composite and then Number_Dimensions (Left_Typ) = 1 and then Nkind (N) in N_Op_Eq | N_Op_Ne then if Raises_Constraint_Error (Left) or else Raises_Constraint_Error (Right) then return; -- OK, we have the case where we may be able to do this fold else Left_Len := Static_Length (Left); Right_Len := Static_Length (Right); if Left_Len /= Uint_Minus_1 and then Right_Len /= Uint_Minus_1 and then Left_Len /= Right_Len then -- AI12-0201: comparison of string is static in Ada 202x Fold_Uint (N, Test (Nkind (N) = N_Op_Ne), Static => Ada_Version >= Ada_2020 and then Is_String_Type (Left_Typ)); Warn_On_Known_Condition (N); return; end if; end if; -- General case else -- Initialize the value of Is_Static_Expression. The value of Fold -- returned by Test_Expression_Is_Foldable is not needed since, even -- when some operand is a variable, we can still perform the static -- evaluation of the expression in some cases (for example, for a -- variable of a subtype of Integer we statically know that any value -- stored in such variable is smaller than Integer'Last). Test_Expression_Is_Foldable (N, Left, Right, Is_Static_Expression, Fold); -- Comparisons of scalars can give static results. -- In addition starting with Ada 202x (AI12-0201), comparison of -- strings can also give static results, and as noted above, we also -- allow for earlier Ada versions internally generated equality and -- inequality for strings. -- ??? The Comes_From_Source test below isn't correct and will accept -- some cases that are illegal in Ada 2012. and before. Now that -- Ada 202x has relaxed the rules, this doesn't really matter. if Is_String_Type (Left_Typ) then if Ada_Version < Ada_2020 and then (Comes_From_Source (N) or else Nkind (N) not in N_Op_Eq | N_Op_Ne) then Is_Static_Expression := False; Set_Is_Static_Expression (N, False); end if; elsif not Is_Scalar_Type (Left_Typ) then Is_Static_Expression := False; Set_Is_Static_Expression (N, False); end if; -- For operators on universal numeric types called as functions with -- an explicit scope, determine appropriate specific numeric type, -- and diagnose possible ambiguity. if Is_Universal_Numeric_Type (Left_Typ) and then Is_Universal_Numeric_Type (Right_Typ) then Op_Typ := Find_Universal_Operator_Type (N); end if; -- Attempt to fold the relational operator if Is_Static_Expression and then Is_Real_Type (Left_Typ) then Fold_Static_Real_Op; else Fold_General_Op (Is_Static_Expression); end if; end if; -- For the case of a folded relational operator on a specific numeric -- type, freeze the operand type now. if Present (Op_Typ) then Freeze_Before (N, Op_Typ); end if; Warn_On_Known_Condition (N); end Eval_Relational_Op; ---------------- -- Eval_Shift -- ---------------- procedure Eval_Shift (N : Node_Id) is begin -- This procedure is only called for compiler generated code (e.g. -- packed arrays), so there is nothing to do except attempting to fold -- the expression. Fold_Shift (N, Left_Opnd (N), Right_Opnd (N), Nkind (N)); end Eval_Shift; ------------------------ -- Eval_Short_Circuit -- ------------------------ -- A short circuit operation is potentially static if both operands are -- potentially static (RM 4.9 (13)). procedure Eval_Short_Circuit (N : Node_Id) is Kind : constant Node_Kind := Nkind (N); Left : constant Node_Id := Left_Opnd (N); Right : constant Node_Id := Right_Opnd (N); Left_Int : Uint; Rstat : constant Boolean := Is_Static_Expression (Left) and then Is_Static_Expression (Right); begin -- Short circuit operations are never static in Ada 83 if Ada_Version = Ada_83 and then Comes_From_Source (N) then Check_Non_Static_Context (Left); Check_Non_Static_Context (Right); return; end if; -- Now look at the operands, we can't quite use the normal call to -- Test_Expression_Is_Foldable here because short circuit operations -- are a special case, they can still be foldable, even if the right -- operand raises Constraint_Error. -- If either operand is Any_Type, just propagate to result and do not -- try to fold, this prevents cascaded errors. if Etype (Left) = Any_Type or else Etype (Right) = Any_Type then Set_Etype (N, Any_Type); return; -- If left operand raises Constraint_Error, then replace node N with -- the raise Constraint_Error node, and we are obviously not foldable. -- Is_Static_Expression is set from the two operands in the normal way, -- and we check the right operand if it is in a non-static context. elsif Raises_Constraint_Error (Left) then if not Rstat then Check_Non_Static_Context (Right); end if; Rewrite_In_Raise_CE (N, Left); Set_Is_Static_Expression (N, Rstat); return; -- If the result is not static, then we won't in any case fold elsif not Rstat then Check_Non_Static_Context (Left); Check_Non_Static_Context (Right); return; end if; -- Here the result is static, note that, unlike the normal processing -- in Test_Expression_Is_Foldable, we did *not* check above to see if -- the right operand raises Constraint_Error, that's because it is not -- significant if the left operand is decisive. Set_Is_Static_Expression (N); -- It does not matter if the right operand raises Constraint_Error if -- it will not be evaluated. So deal specially with the cases where -- the right operand is not evaluated. Note that we will fold these -- cases even if the right operand is non-static, which is fine, but -- of course in these cases the result is not potentially static. Left_Int := Expr_Value (Left); if (Kind = N_And_Then and then Is_False (Left_Int)) or else (Kind = N_Or_Else and then Is_True (Left_Int)) then Fold_Uint (N, Left_Int, Rstat); return; end if; -- If first operand not decisive, then it does matter if the right -- operand raises Constraint_Error, since it will be evaluated, so -- we simply replace the node with the right operand. Note that this -- properly propagates Is_Static_Expression and Raises_Constraint_Error -- (both are set to True in Right). if Raises_Constraint_Error (Right) then Rewrite_In_Raise_CE (N, Right); Check_Non_Static_Context (Left); return; end if; -- Otherwise the result depends on the right operand Fold_Uint (N, Expr_Value (Right), Rstat); return; end Eval_Short_Circuit; ---------------- -- Eval_Slice -- ---------------- -- Slices can never be static, so the only processing required is to check -- for non-static context if an explicit range is given. procedure Eval_Slice (N : Node_Id) is Drange : constant Node_Id := Discrete_Range (N); begin if Nkind (Drange) = N_Range then Check_Non_Static_Context (Low_Bound (Drange)); Check_Non_Static_Context (High_Bound (Drange)); end if; -- A slice of the form A (subtype), when the subtype is the index of -- the type of A, is redundant, the slice can be replaced with A, and -- this is worth a warning. if Is_Entity_Name (Prefix (N)) then declare E : constant Entity_Id := Entity (Prefix (N)); T : constant Entity_Id := Etype (E); begin if Ekind (E) = E_Constant and then Is_Array_Type (T) and then Is_Entity_Name (Drange) then if Is_Entity_Name (Original_Node (First_Index (T))) and then Entity (Original_Node (First_Index (T))) = Entity (Drange) then if Warn_On_Redundant_Constructs then Error_Msg_N ("redundant slice denotes whole array?r?", N); end if; -- The following might be a useful optimization??? -- Rewrite (N, New_Occurrence_Of (E, Sloc (N))); end if; end if; end; end if; end Eval_Slice; ------------------------- -- Eval_String_Literal -- ------------------------- procedure Eval_String_Literal (N : Node_Id) is Typ : constant Entity_Id := Etype (N); Bas : constant Entity_Id := Base_Type (Typ); Xtp : Entity_Id; Len : Nat; Lo : Node_Id; begin -- Nothing to do if error type (handles cases like default expressions -- or generics where we have not yet fully resolved the type). if Bas = Any_Type or else Bas = Any_String then return; end if; -- String literals are static if the subtype is static (RM 4.9(2)), so -- reset the static expression flag (it was set unconditionally in -- Analyze_String_Literal) if the subtype is non-static. We tell if -- the subtype is static by looking at the lower bound. if Ekind (Typ) = E_String_Literal_Subtype then if not Is_OK_Static_Expression (String_Literal_Low_Bound (Typ)) then Set_Is_Static_Expression (N, False); return; end if; -- Here if Etype of string literal is normal Etype (not yet possible, -- but may be possible in future). elsif not Is_OK_Static_Expression (Type_Low_Bound (Etype (First_Index (Typ)))) then Set_Is_Static_Expression (N, False); return; end if; -- If original node was a type conversion, then result if non-static -- up to Ada 2012. AI12-0201 changes that with Ada 202x. if Nkind (Original_Node (N)) = N_Type_Conversion and then Ada_Version <= Ada_2012 then Set_Is_Static_Expression (N, False); return; end if; -- Test for illegal Ada 95 cases. A string literal is illegal in Ada 95 -- if its bounds are outside the index base type and this index type is -- static. This can happen in only two ways. Either the string literal -- is too long, or it is null, and the lower bound is type'First. Either -- way it is the upper bound that is out of range of the index type. if Ada_Version >= Ada_95 then if Is_Standard_String_Type (Bas) then Xtp := Standard_Positive; else Xtp := Etype (First_Index (Bas)); end if; if Ekind (Typ) = E_String_Literal_Subtype then Lo := String_Literal_Low_Bound (Typ); else Lo := Type_Low_Bound (Etype (First_Index (Typ))); end if; -- Check for string too long Len := String_Length (Strval (N)); if UI_From_Int (Len) > String_Type_Len (Bas) then -- Issue message. Note that this message is a warning if the -- string literal is not marked as static (happens in some cases -- of folding strings known at compile time, but not static). -- Furthermore in such cases, we reword the message, since there -- is no string literal in the source program. if Is_Static_Expression (N) then Apply_Compile_Time_Constraint_Error (N, "string literal too long for}", CE_Length_Check_Failed, Ent => Bas, Typ => First_Subtype (Bas)); else Apply_Compile_Time_Constraint_Error (N, "string value too long for}", CE_Length_Check_Failed, Ent => Bas, Typ => First_Subtype (Bas), Warn => True); end if; -- Test for null string not allowed elsif Len = 0 and then not Is_Generic_Type (Xtp) and then Expr_Value (Lo) = Expr_Value (Type_Low_Bound (Base_Type (Xtp))) then -- Same specialization of message if Is_Static_Expression (N) then Apply_Compile_Time_Constraint_Error (N, "null string literal not allowed for}", CE_Length_Check_Failed, Ent => Bas, Typ => First_Subtype (Bas)); else Apply_Compile_Time_Constraint_Error (N, "null string value not allowed for}", CE_Length_Check_Failed, Ent => Bas, Typ => First_Subtype (Bas), Warn => True); end if; end if; end if; end Eval_String_Literal; -------------------------- -- Eval_Type_Conversion -- -------------------------- -- A type conversion is potentially static if its subtype mark is for a -- static scalar subtype, and its operand expression is potentially static -- (RM 4.9(10)). -- Also add support for static string types. procedure Eval_Type_Conversion (N : Node_Id) is Operand : constant Node_Id := Expression (N); Source_Type : constant Entity_Id := Etype (Operand); Target_Type : constant Entity_Id := Etype (N); function To_Be_Treated_As_Integer (T : Entity_Id) return Boolean; -- Returns true if type T is an integer type, or if it is a fixed-point -- type to be treated as an integer (i.e. the flag Conversion_OK is set -- on the conversion node). function To_Be_Treated_As_Real (T : Entity_Id) return Boolean; -- Returns true if type T is a floating-point type, or if it is a -- fixed-point type that is not to be treated as an integer (i.e. the -- flag Conversion_OK is not set on the conversion node). ------------------------------ -- To_Be_Treated_As_Integer -- ------------------------------ function To_Be_Treated_As_Integer (T : Entity_Id) return Boolean is begin return Is_Integer_Type (T) or else (Is_Fixed_Point_Type (T) and then Conversion_OK (N)); end To_Be_Treated_As_Integer; --------------------------- -- To_Be_Treated_As_Real -- --------------------------- function To_Be_Treated_As_Real (T : Entity_Id) return Boolean is begin return Is_Floating_Point_Type (T) or else (Is_Fixed_Point_Type (T) and then not Conversion_OK (N)); end To_Be_Treated_As_Real; -- Local variables Fold : Boolean; Stat : Boolean; -- Start of processing for Eval_Type_Conversion begin -- Cannot fold if target type is non-static or if semantic error if not Is_Static_Subtype (Target_Type) then Check_Non_Static_Context (Operand); return; elsif Error_Posted (N) then return; end if; -- If not foldable we are done Test_Expression_Is_Foldable (N, Operand, Stat, Fold); if not Fold then return; -- Don't try fold if target type has Constraint_Error bounds elsif not Is_OK_Static_Subtype (Target_Type) then Set_Raises_Constraint_Error (N); return; end if; -- Remaining processing depends on operand types. Note that in the -- following type test, fixed-point counts as real unless the flag -- Conversion_OK is set, in which case it counts as integer. -- Fold conversion, case of string type. The result is static starting -- with Ada 202x (AI12-0201). if Is_String_Type (Target_Type) then Fold_Str (N, Strval (Get_String_Val (Operand)), Static => Ada_Version >= Ada_2020); return; -- Fold conversion, case of integer target type elsif To_Be_Treated_As_Integer (Target_Type) then declare Result : Uint; begin -- Integer to integer conversion if To_Be_Treated_As_Integer (Source_Type) then Result := Expr_Value (Operand); -- Real to integer conversion elsif To_Be_Treated_As_Real (Source_Type) then Result := UR_To_Uint (Expr_Value_R (Operand)); -- Enumeration to integer conversion, aka 'Enum_Rep else Result := Expr_Rep_Value (Operand); end if; -- If fixed-point type (Conversion_OK must be set), then the -- result is logically an integer, but we must replace the -- conversion with the corresponding real literal, since the -- type from a semantic point of view is still fixed-point. if Is_Fixed_Point_Type (Target_Type) then Fold_Ureal (N, UR_From_Uint (Result) * Small_Value (Target_Type), Stat); -- Otherwise result is integer literal else Fold_Uint (N, Result, Stat); end if; end; -- Fold conversion, case of real target type elsif To_Be_Treated_As_Real (Target_Type) then declare Result : Ureal; begin if To_Be_Treated_As_Real (Source_Type) then Result := Expr_Value_R (Operand); else Result := UR_From_Uint (Expr_Value (Operand)); end if; Fold_Ureal (N, Result, Stat); end; -- Enumeration types else Fold_Uint (N, Expr_Value (Operand), Stat); end if; if Is_Out_Of_Range (N, Etype (N), Assume_Valid => True) then Out_Of_Range (N); end if; end Eval_Type_Conversion; ------------------- -- Eval_Unary_Op -- ------------------- -- Predefined unary operators are static functions (RM 4.9(20)) and thus -- are potentially static if the operand is potentially static (RM 4.9(7)). procedure Eval_Unary_Op (N : Node_Id) is Right : constant Node_Id := Right_Opnd (N); Otype : Entity_Id := Empty; Stat : Boolean; Fold : Boolean; begin -- If not foldable we are done Test_Expression_Is_Foldable (N, Right, Stat, Fold); if not Fold then return; end if; if Etype (Right) = Universal_Integer or else Etype (Right) = Universal_Real then Otype := Find_Universal_Operator_Type (N); end if; -- Fold for integer case if Is_Integer_Type (Etype (N)) then declare Rint : constant Uint := Expr_Value (Right); Result : Uint; begin -- In the case of modular unary plus and abs there is no need -- to adjust the result of the operation since if the original -- operand was in bounds the result will be in the bounds of the -- modular type. However, in the case of modular unary minus the -- result may go out of the bounds of the modular type and needs -- adjustment. if Nkind (N) = N_Op_Plus then Result := Rint; elsif Nkind (N) = N_Op_Minus then if Is_Modular_Integer_Type (Etype (N)) then Result := (-Rint) mod Modulus (Etype (N)); else Result := (-Rint); end if; else pragma Assert (Nkind (N) = N_Op_Abs); Result := abs Rint; end if; Fold_Uint (N, Result, Stat); end; -- Fold for real case elsif Is_Real_Type (Etype (N)) then declare Rreal : constant Ureal := Expr_Value_R (Right); Result : Ureal; begin if Nkind (N) = N_Op_Plus then Result := Rreal; elsif Nkind (N) = N_Op_Minus then Result := UR_Negate (Rreal); else pragma Assert (Nkind (N) = N_Op_Abs); Result := abs Rreal; end if; Fold_Ureal (N, Result, Stat); end; end if; -- If the operator was resolved to a specific type, make sure that type -- is frozen even if the expression is folded into a literal (which has -- a universal type). if Present (Otype) then Freeze_Before (N, Otype); end if; end Eval_Unary_Op; ------------------------------- -- Eval_Unchecked_Conversion -- ------------------------------- -- Unchecked conversions can never be static, so the only required -- processing is to check for a non-static context for the operand. procedure Eval_Unchecked_Conversion (N : Node_Id) is begin Check_Non_Static_Context (Expression (N)); end Eval_Unchecked_Conversion; -------------------- -- Expr_Rep_Value -- -------------------- function Expr_Rep_Value (N : Node_Id) return Uint is Kind : constant Node_Kind := Nkind (N); Ent : Entity_Id; begin if Is_Entity_Name (N) then Ent := Entity (N); -- An enumeration literal that was either in the source or created -- as a result of static evaluation. if Ekind (Ent) = E_Enumeration_Literal then return Enumeration_Rep (Ent); -- A user defined static constant else pragma Assert (Ekind (Ent) = E_Constant); return Expr_Rep_Value (Constant_Value (Ent)); end if; -- An integer literal that was either in the source or created as a -- result of static evaluation. elsif Kind = N_Integer_Literal then return Intval (N); -- A real literal for a fixed-point type. This must be the fixed-point -- case, either the literal is of a fixed-point type, or it is a bound -- of a fixed-point type, with type universal real. In either case we -- obtain the desired value from Corresponding_Integer_Value. elsif Kind = N_Real_Literal then pragma Assert (Is_Fixed_Point_Type (Underlying_Type (Etype (N)))); return Corresponding_Integer_Value (N); -- The NULL access value elsif Kind = N_Null then pragma Assert (Is_Access_Type (Underlying_Type (Etype (N))) or else Error_Posted (N)); return Uint_0; -- Character literal elsif Kind = N_Character_Literal then Ent := Entity (N); -- Since Character literals of type Standard.Character don't have any -- defining character literals built for them, they do not have their -- Entity set, so just use their Char code. Otherwise for user- -- defined character literals use their Pos value as usual which is -- the same as the Rep value. if No (Ent) then return Char_Literal_Value (N); else return Enumeration_Rep (Ent); end if; -- Unchecked conversion, which can come from System'To_Address (X) -- where X is a static integer expression. Recursively evaluate X. elsif Kind = N_Unchecked_Type_Conversion then return Expr_Rep_Value (Expression (N)); else raise Program_Error; end if; end Expr_Rep_Value; ---------------- -- Expr_Value -- ---------------- function Expr_Value (N : Node_Id) return Uint is Kind : constant Node_Kind := Nkind (N); CV_Ent : CV_Entry renames CV_Cache (Nat (N) mod CV_Cache_Size); Ent : Entity_Id; Val : Uint; begin -- If already in cache, then we know it's compile-time-known and we can -- return the value that was previously stored in the cache since -- compile-time-known values cannot change. if CV_Ent.N = N then return CV_Ent.V; end if; -- Otherwise proceed to test value if Is_Entity_Name (N) then Ent := Entity (N); -- An enumeration literal that was either in the source or created as -- a result of static evaluation. if Ekind (Ent) = E_Enumeration_Literal then Val := Enumeration_Pos (Ent); -- A user defined static constant else pragma Assert (Ekind (Ent) = E_Constant); Val := Expr_Value (Constant_Value (Ent)); end if; -- An integer literal that was either in the source or created as a -- result of static evaluation. elsif Kind = N_Integer_Literal then Val := Intval (N); -- A real literal for a fixed-point type. This must be the fixed-point -- case, either the literal is of a fixed-point type, or it is a bound -- of a fixed-point type, with type universal real. In either case we -- obtain the desired value from Corresponding_Integer_Value. elsif Kind = N_Real_Literal then pragma Assert (Is_Fixed_Point_Type (Underlying_Type (Etype (N)))); Val := Corresponding_Integer_Value (N); -- The NULL access value elsif Kind = N_Null then pragma Assert (Is_Access_Type (Underlying_Type (Etype (N))) or else Error_Posted (N)); Val := Uint_0; -- Character literal elsif Kind = N_Character_Literal then Ent := Entity (N); -- Since Character literals of type Standard.Character don't -- have any defining character literals built for them, they -- do not have their Entity set, so just use their Char -- code. Otherwise for user-defined character literals use -- their Pos value as usual. if No (Ent) then Val := Char_Literal_Value (N); else Val := Enumeration_Pos (Ent); end if; -- Unchecked conversion, which can come from System'To_Address (X) -- where X is a static integer expression. Recursively evaluate X. elsif Kind = N_Unchecked_Type_Conversion then Val := Expr_Value (Expression (N)); else raise Program_Error; end if; -- Come here with Val set to value to be returned, set cache CV_Ent.N := N; CV_Ent.V := Val; return Val; end Expr_Value; ------------------ -- Expr_Value_E -- ------------------ function Expr_Value_E (N : Node_Id) return Entity_Id is Ent : constant Entity_Id := Entity (N); begin if Ekind (Ent) = E_Enumeration_Literal then return Ent; else pragma Assert (Ekind (Ent) = E_Constant); -- We may be dealing with a enumerated character type constant, so -- handle that case here. if Nkind (Constant_Value (Ent)) = N_Character_Literal then return Ent; else return Expr_Value_E (Constant_Value (Ent)); end if; end if; end Expr_Value_E; ------------------ -- Expr_Value_R -- ------------------ function Expr_Value_R (N : Node_Id) return Ureal is Kind : constant Node_Kind := Nkind (N); Ent : Entity_Id; begin if Kind = N_Real_Literal then return Realval (N); elsif Kind = N_Identifier or else Kind = N_Expanded_Name then Ent := Entity (N); pragma Assert (Ekind (Ent) = E_Constant); return Expr_Value_R (Constant_Value (Ent)); elsif Kind = N_Integer_Literal then return UR_From_Uint (Expr_Value (N)); -- Here, we have a node that cannot be interpreted as a compile time -- constant. That is definitely an error. else raise Program_Error; end if; end Expr_Value_R; ------------------ -- Expr_Value_S -- ------------------ function Expr_Value_S (N : Node_Id) return Node_Id is begin if Nkind (N) = N_String_Literal then return N; else pragma Assert (Ekind (Entity (N)) = E_Constant); return Expr_Value_S (Constant_Value (Entity (N))); end if; end Expr_Value_S; ---------------------------------- -- Find_Universal_Operator_Type -- ---------------------------------- function Find_Universal_Operator_Type (N : Node_Id) return Entity_Id is PN : constant Node_Id := Parent (N); Call : constant Node_Id := Original_Node (N); Is_Int : constant Boolean := Is_Integer_Type (Etype (N)); Is_Fix : constant Boolean := Nkind (N) in N_Binary_Op and then Nkind (Right_Opnd (N)) /= Nkind (Left_Opnd (N)); -- A mixed-mode operation in this context indicates the presence of -- fixed-point type in the designated package. Is_Relational : constant Boolean := Etype (N) = Standard_Boolean; -- Case where N is a relational (or membership) operator (else it is an -- arithmetic one). In_Membership : constant Boolean := Nkind (PN) in N_Membership_Test and then Nkind (Right_Opnd (PN)) = N_Range and then Is_Universal_Numeric_Type (Etype (Left_Opnd (PN))) and then Is_Universal_Numeric_Type (Etype (Low_Bound (Right_Opnd (PN)))) and then Is_Universal_Numeric_Type (Etype (High_Bound (Right_Opnd (PN)))); -- Case where N is part of a membership test with a universal range E : Entity_Id; Pack : Entity_Id; Typ1 : Entity_Id := Empty; Priv_E : Entity_Id; function Is_Mixed_Mode_Operand (Op : Node_Id) return Boolean; -- Check whether one operand is a mixed-mode operation that requires the -- presence of a fixed-point type. Given that all operands are universal -- and have been constant-folded, retrieve the original function call. --------------------------- -- Is_Mixed_Mode_Operand -- --------------------------- function Is_Mixed_Mode_Operand (Op : Node_Id) return Boolean is Onod : constant Node_Id := Original_Node (Op); begin return Nkind (Onod) = N_Function_Call and then Present (Next_Actual (First_Actual (Onod))) and then Etype (First_Actual (Onod)) /= Etype (Next_Actual (First_Actual (Onod))); end Is_Mixed_Mode_Operand; -- Start of processing for Find_Universal_Operator_Type begin if Nkind (Call) /= N_Function_Call or else Nkind (Name (Call)) /= N_Expanded_Name then return Empty; -- There are several cases where the context does not imply the type of -- the operands: -- - the universal expression appears in a type conversion; -- - the expression is a relational operator applied to universal -- operands; -- - the expression is a membership test with a universal operand -- and a range with universal bounds. elsif Nkind (Parent (N)) = N_Type_Conversion or else Is_Relational or else In_Membership then Pack := Entity (Prefix (Name (Call))); -- If the prefix is a package declared elsewhere, iterate over its -- visible entities, otherwise iterate over all declarations in the -- designated scope. if Ekind (Pack) = E_Package and then not In_Open_Scopes (Pack) then Priv_E := First_Private_Entity (Pack); else Priv_E := Empty; end if; Typ1 := Empty; E := First_Entity (Pack); while Present (E) and then E /= Priv_E loop if Is_Numeric_Type (E) and then Nkind (Parent (E)) /= N_Subtype_Declaration and then Comes_From_Source (E) and then Is_Integer_Type (E) = Is_Int and then (Nkind (N) in N_Unary_Op or else Is_Relational or else Is_Fixed_Point_Type (E) = Is_Fix) then if No (Typ1) then Typ1 := E; -- Before emitting an error, check for the presence of a -- mixed-mode operation that specifies a fixed point type. elsif Is_Relational and then (Is_Mixed_Mode_Operand (Left_Opnd (N)) or else Is_Mixed_Mode_Operand (Right_Opnd (N))) and then Is_Fixed_Point_Type (E) /= Is_Fixed_Point_Type (Typ1) then if Is_Fixed_Point_Type (E) then Typ1 := E; end if; else -- More than one type of the proper class declared in P Error_Msg_N ("ambiguous operation", N); Error_Msg_Sloc := Sloc (Typ1); Error_Msg_N ("\possible interpretation (inherited)#", N); Error_Msg_Sloc := Sloc (E); Error_Msg_N ("\possible interpretation (inherited)#", N); return Empty; end if; end if; Next_Entity (E); end loop; end if; return Typ1; end Find_Universal_Operator_Type; -------------------------- -- Flag_Non_Static_Expr -- -------------------------- procedure Flag_Non_Static_Expr (Msg : String; Expr : Node_Id) is begin if Error_Posted (Expr) and then not All_Errors_Mode then return; else Error_Msg_F (Msg, Expr); Why_Not_Static (Expr); end if; end Flag_Non_Static_Expr; ---------------- -- Fold_Dummy -- ---------------- procedure Fold_Dummy (N : Node_Id; Typ : Entity_Id) is begin if Is_Integer_Type (Typ) then Fold_Uint (N, Uint_1, Static => True); elsif Is_Real_Type (Typ) then Fold_Ureal (N, Ureal_1, Static => True); elsif Is_Enumeration_Type (Typ) then Fold_Uint (N, Expr_Value (Type_Low_Bound (Base_Type (Typ))), Static => True); elsif Is_String_Type (Typ) then Fold_Str (N, Strval (Make_String_Literal (Sloc (N), "")), Static => True); end if; end Fold_Dummy; ---------------- -- Fold_Shift -- ---------------- procedure Fold_Shift (N : Node_Id; Left : Node_Id; Right : Node_Id; Op : Node_Kind; Static : Boolean := False; Check_Elab : Boolean := False) is Typ : constant Entity_Id := Etype (Left); procedure Check_Elab_Call; -- Add checks related to calls in elaboration code --------------------- -- Check_Elab_Call -- --------------------- procedure Check_Elab_Call is begin if Check_Elab then if Legacy_Elaboration_Checks then Check_Elab_Call (N); end if; Build_Call_Marker (N); end if; end Check_Elab_Call; begin if Compile_Time_Known_Value (Left) and then Compile_Time_Known_Value (Right) then pragma Assert (not Non_Binary_Modulus (Typ)); if Op = N_Op_Shift_Left then Check_Elab_Call; -- Fold Shift_Left (X, Y) by computing (X * 2**Y) rem modulus Fold_Uint (N, (Expr_Value (Left) * (Uint_2 ** Expr_Value (Right))) rem Modulus (Typ), Static => Static); elsif Op = N_Op_Shift_Right then Check_Elab_Call; -- Fold Shift_Right (X, Y) by computing abs X / 2**Y Fold_Uint (N, abs Expr_Value (Left) / (Uint_2 ** Expr_Value (Right)), Static => Static); elsif Op = N_Op_Shift_Right_Arithmetic then Check_Elab_Call; declare Two_Y : constant Uint := Uint_2 ** Expr_Value (Right); Modulus : Uint; begin if Is_Modular_Integer_Type (Typ) then Modulus := Einfo.Modulus (Typ); else Modulus := Uint_2 ** RM_Size (Typ); end if; -- X / 2**Y if X if positive or a small enough modular integer if (Is_Modular_Integer_Type (Typ) and then Expr_Value (Left) < Modulus / Uint_2) or else (not Is_Modular_Integer_Type (Typ) and then Expr_Value (Left) >= 0) then Fold_Uint (N, Expr_Value (Left) / Two_Y, Static => Static); -- -1 (aka all 1's) if Y is larger than the number of bits -- available or if X = -1. elsif Two_Y > Modulus or else Expr_Value (Left) = Uint_Minus_1 then if Is_Modular_Integer_Type (Typ) then Fold_Uint (N, Modulus - Uint_1, Static => Static); else Fold_Uint (N, Uint_Minus_1, Static => Static); end if; -- Large modular integer, compute via multiply/divide the -- following: X >> Y + (1 << Y - 1) << (RM_Size - Y) elsif Is_Modular_Integer_Type (Typ) then Fold_Uint (N, (Expr_Value (Left)) / Two_Y + (Two_Y - Uint_1) * Uint_2 ** (RM_Size (Typ) - Expr_Value (Right)), Static => Static); -- Negative signed integer, compute via multiple/divide the -- following: -- (Modulus + X) >> Y + (1 << Y - 1) << (RM_Size - Y) - Modulus else Fold_Uint (N, (Modulus + Expr_Value (Left)) / Two_Y + (Two_Y - Uint_1) * Uint_2 ** (RM_Size (Typ) - Expr_Value (Right)) - Modulus, Static => Static); end if; end; end if; end if; end Fold_Shift; -------------- -- Fold_Str -- -------------- procedure Fold_Str (N : Node_Id; Val : String_Id; Static : Boolean) is Loc : constant Source_Ptr := Sloc (N); Typ : constant Entity_Id := Etype (N); begin if Raises_Constraint_Error (N) then Set_Is_Static_Expression (N, Static); return; end if; Rewrite (N, Make_String_Literal (Loc, Strval => Val)); -- We now have the literal with the right value, both the actual type -- and the expected type of this literal are taken from the expression -- that was evaluated. So now we do the Analyze and Resolve. -- Note that we have to reset Is_Static_Expression both after the -- analyze step (because Resolve will evaluate the literal, which -- will cause semantic errors if it is marked as static), and after -- the Resolve step (since Resolve in some cases resets this flag). Analyze (N); Set_Is_Static_Expression (N, Static); Set_Etype (N, Typ); Resolve (N); Set_Is_Static_Expression (N, Static); end Fold_Str; --------------- -- Fold_Uint -- --------------- procedure Fold_Uint (N : Node_Id; Val : Uint; Static : Boolean) is Loc : constant Source_Ptr := Sloc (N); Typ : Entity_Id := Etype (N); Ent : Entity_Id; begin if Raises_Constraint_Error (N) then Set_Is_Static_Expression (N, Static); return; end if; -- If we are folding a named number, retain the entity in the literal -- in the original tree. if Is_Entity_Name (N) and then Ekind (Entity (N)) = E_Named_Integer then Ent := Entity (N); else Ent := Empty; end if; if Is_Private_Type (Typ) then Typ := Full_View (Typ); end if; -- For a result of type integer, substitute an N_Integer_Literal node -- for the result of the compile time evaluation of the expression. -- Set a link to the original named number when not in a generic context -- for reference in the original tree. if Is_Integer_Type (Typ) then Rewrite (N, Make_Integer_Literal (Loc, Val)); Set_Original_Entity (N, Ent); -- Otherwise we have an enumeration type, and we substitute either -- an N_Identifier or N_Character_Literal to represent the enumeration -- literal corresponding to the given value, which must always be in -- range, because appropriate tests have already been made for this. else pragma Assert (Is_Enumeration_Type (Typ)); Rewrite (N, Get_Enum_Lit_From_Pos (Etype (N), Val, Loc)); end if; -- We now have the literal with the right value, both the actual type -- and the expected type of this literal are taken from the expression -- that was evaluated. So now we do the Analyze and Resolve. -- Note that we have to reset Is_Static_Expression both after the -- analyze step (because Resolve will evaluate the literal, which -- will cause semantic errors if it is marked as static), and after -- the Resolve step (since Resolve in some cases sets this flag). Analyze (N); Set_Is_Static_Expression (N, Static); Set_Etype (N, Typ); Resolve (N); Set_Is_Static_Expression (N, Static); end Fold_Uint; ---------------- -- Fold_Ureal -- ---------------- procedure Fold_Ureal (N : Node_Id; Val : Ureal; Static : Boolean) is Loc : constant Source_Ptr := Sloc (N); Typ : constant Entity_Id := Etype (N); Ent : Entity_Id; begin if Raises_Constraint_Error (N) then Set_Is_Static_Expression (N, Static); return; end if; -- If we are folding a named number, retain the entity in the literal -- in the original tree. if Is_Entity_Name (N) and then Ekind (Entity (N)) = E_Named_Real then Ent := Entity (N); else Ent := Empty; end if; Rewrite (N, Make_Real_Literal (Loc, Realval => Val)); -- Set link to original named number Set_Original_Entity (N, Ent); -- We now have the literal with the right value, both the actual type -- and the expected type of this literal are taken from the expression -- that was evaluated. So now we do the Analyze and Resolve. -- Note that we have to reset Is_Static_Expression both after the -- analyze step (because Resolve will evaluate the literal, which -- will cause semantic errors if it is marked as static), and after -- the Resolve step (since Resolve in some cases sets this flag). -- We mark the node as analyzed so that its type is not erased by -- calling Analyze_Real_Literal. Analyze (N); Set_Is_Static_Expression (N, Static); Set_Etype (N, Typ); Resolve (N); Set_Analyzed (N); Set_Is_Static_Expression (N, Static); end Fold_Ureal; --------------- -- From_Bits -- --------------- function From_Bits (B : Bits; T : Entity_Id) return Uint is V : Uint := Uint_0; begin for J in 0 .. B'Last loop if B (J) then V := V + 2 ** J; end if; end loop; if Non_Binary_Modulus (T) then V := V mod Modulus (T); end if; return V; end From_Bits; -------------------- -- Get_String_Val -- -------------------- function Get_String_Val (N : Node_Id) return Node_Id is begin if Nkind (N) in N_String_Literal | N_Character_Literal then return N; else pragma Assert (Is_Entity_Name (N)); return Get_String_Val (Constant_Value (Entity (N))); end if; end Get_String_Val; ---------------- -- Initialize -- ---------------- procedure Initialize is begin CV_Cache := (others => (Node_High_Bound, Uint_0)); end Initialize; -------------------- -- In_Subrange_Of -- -------------------- function In_Subrange_Of (T1 : Entity_Id; T2 : Entity_Id; Fixed_Int : Boolean := False) return Boolean is L1 : Node_Id; H1 : Node_Id; L2 : Node_Id; H2 : Node_Id; begin if T1 = T2 or else Is_Subtype_Of (T1, T2) then return True; -- Never in range if both types are not scalar. Don't know if this can -- actually happen, but just in case. elsif not Is_Scalar_Type (T1) or else not Is_Scalar_Type (T2) then return False; -- If T1 has infinities but T2 doesn't have infinities, then T1 is -- definitely not compatible with T2. elsif Is_Floating_Point_Type (T1) and then Has_Infinities (T1) and then Is_Floating_Point_Type (T2) and then not Has_Infinities (T2) then return False; else L1 := Type_Low_Bound (T1); H1 := Type_High_Bound (T1); L2 := Type_Low_Bound (T2); H2 := Type_High_Bound (T2); -- Check bounds to see if comparison possible at compile time if Compile_Time_Compare (L1, L2, Assume_Valid => True) in Compare_GE and then Compile_Time_Compare (H1, H2, Assume_Valid => True) in Compare_LE then return True; end if; -- If bounds not comparable at compile time, then the bounds of T2 -- must be compile-time-known or we cannot answer the query. if not Compile_Time_Known_Value (L2) or else not Compile_Time_Known_Value (H2) then return False; end if; -- If the bounds of T1 are know at compile time then use these -- ones, otherwise use the bounds of the base type (which are of -- course always static). if not Compile_Time_Known_Value (L1) then L1 := Type_Low_Bound (Base_Type (T1)); end if; if not Compile_Time_Known_Value (H1) then H1 := Type_High_Bound (Base_Type (T1)); end if; -- Fixed point types should be considered as such only if -- flag Fixed_Int is set to False. if Is_Floating_Point_Type (T1) or else Is_Floating_Point_Type (T2) or else (Is_Fixed_Point_Type (T1) and then not Fixed_Int) or else (Is_Fixed_Point_Type (T2) and then not Fixed_Int) then return Expr_Value_R (L2) <= Expr_Value_R (L1) and then Expr_Value_R (H2) >= Expr_Value_R (H1); else return Expr_Value (L2) <= Expr_Value (L1) and then Expr_Value (H2) >= Expr_Value (H1); end if; end if; -- If any exception occurs, it means that we have some bug in the compiler -- possibly triggered by a previous error, or by some unforeseen peculiar -- occurrence. However, this is only an optimization attempt, so there is -- really no point in crashing the compiler. Instead we just decide, too -- bad, we can't figure out the answer in this case after all. exception when others => -- With debug flag K we will get an exception unless an error has -- already occurred (useful for debugging). if Debug_Flag_K then Check_Error_Detected; end if; return False; end In_Subrange_Of; ----------------- -- Is_In_Range -- ----------------- function Is_In_Range (N : Node_Id; Typ : Entity_Id; Assume_Valid : Boolean := False; Fixed_Int : Boolean := False; Int_Real : Boolean := False) return Boolean is begin return Test_In_Range (N, Typ, Assume_Valid, Fixed_Int, Int_Real) = In_Range; end Is_In_Range; ------------------- -- Is_Null_Range -- ------------------- function Is_Null_Range (Lo : Node_Id; Hi : Node_Id) return Boolean is begin if Compile_Time_Known_Value (Lo) and then Compile_Time_Known_Value (Hi) then declare Typ : Entity_Id := Etype (Lo); begin -- When called from the frontend, as part of the analysis of -- potentially static expressions, Typ will be the full view of a -- type with all the info needed to answer this query. When called -- from the backend, for example to know whether a range of a loop -- is null, Typ might be a private type and we need to explicitly -- switch to its corresponding full view to access the same info. if Is_Incomplete_Or_Private_Type (Typ) and then Present (Full_View (Typ)) then Typ := Full_View (Typ); end if; if Is_Discrete_Type (Typ) then return Expr_Value (Lo) > Expr_Value (Hi); else pragma Assert (Is_Real_Type (Typ)); return Expr_Value_R (Lo) > Expr_Value_R (Hi); end if; end; else return False; end if; end Is_Null_Range; ------------------------- -- Is_OK_Static_Choice -- ------------------------- function Is_OK_Static_Choice (Choice : Node_Id) return Boolean is begin -- Check various possibilities for choice -- Note: for membership tests, we test more cases than are possible -- (in particular subtype indication), but it doesn't matter because -- it just won't occur (we have already done a syntax check). if Nkind (Choice) = N_Others_Choice then return True; elsif Nkind (Choice) = N_Range then return Is_OK_Static_Range (Choice); elsif Nkind (Choice) = N_Subtype_Indication or else (Is_Entity_Name (Choice) and then Is_Type (Entity (Choice))) then return Is_OK_Static_Subtype (Etype (Choice)); else return Is_OK_Static_Expression (Choice); end if; end Is_OK_Static_Choice; ------------------------------ -- Is_OK_Static_Choice_List -- ------------------------------ function Is_OK_Static_Choice_List (Choices : List_Id) return Boolean is Choice : Node_Id; begin if not Is_Static_Choice_List (Choices) then return False; end if; Choice := First (Choices); while Present (Choice) loop if not Is_OK_Static_Choice (Choice) then Set_Raises_Constraint_Error (Choice); return False; end if; Next (Choice); end loop; return True; end Is_OK_Static_Choice_List; ----------------------------- -- Is_OK_Static_Expression -- ----------------------------- function Is_OK_Static_Expression (N : Node_Id) return Boolean is begin return Is_Static_Expression (N) and then not Raises_Constraint_Error (N); end Is_OK_Static_Expression; ------------------------ -- Is_OK_Static_Range -- ------------------------ -- A static range is a range whose bounds are static expressions, or a -- Range_Attribute_Reference equivalent to such a range (RM 4.9(26)). -- We have already converted range attribute references, so we get the -- "or" part of this rule without needing a special test. function Is_OK_Static_Range (N : Node_Id) return Boolean is begin return Is_OK_Static_Expression (Low_Bound (N)) and then Is_OK_Static_Expression (High_Bound (N)); end Is_OK_Static_Range; -------------------------- -- Is_OK_Static_Subtype -- -------------------------- -- Determines if Typ is a static subtype as defined in (RM 4.9(26)) where -- neither bound raises Constraint_Error when evaluated. function Is_OK_Static_Subtype (Typ : Entity_Id) return Boolean is Base_T : constant Entity_Id := Base_Type (Typ); Anc_Subt : Entity_Id; begin -- First a quick check on the non static subtype flag. As described -- in further detail in Einfo, this flag is not decisive in all cases, -- but if it is set, then the subtype is definitely non-static. if Is_Non_Static_Subtype (Typ) then return False; end if; Anc_Subt := Ancestor_Subtype (Typ); if Anc_Subt = Empty then Anc_Subt := Base_T; end if; if Is_Generic_Type (Root_Type (Base_T)) or else Is_Generic_Actual_Type (Base_T) then return False; elsif Has_Dynamic_Predicate_Aspect (Typ) then return False; -- String types elsif Is_String_Type (Typ) then return Ekind (Typ) = E_String_Literal_Subtype or else (Is_OK_Static_Subtype (Component_Type (Typ)) and then Is_OK_Static_Subtype (Etype (First_Index (Typ)))); -- Scalar types elsif Is_Scalar_Type (Typ) then if Base_T = Typ then return True; else -- Scalar_Range (Typ) might be an N_Subtype_Indication, so use -- Get_Type_{Low,High}_Bound. return Is_OK_Static_Subtype (Anc_Subt) and then Is_OK_Static_Expression (Type_Low_Bound (Typ)) and then Is_OK_Static_Expression (Type_High_Bound (Typ)); end if; -- Types other than string and scalar types are never static else return False; end if; end Is_OK_Static_Subtype; --------------------- -- Is_Out_Of_Range -- --------------------- function Is_Out_Of_Range (N : Node_Id; Typ : Entity_Id; Assume_Valid : Boolean := False; Fixed_Int : Boolean := False; Int_Real : Boolean := False) return Boolean is begin return Test_In_Range (N, Typ, Assume_Valid, Fixed_Int, Int_Real) = Out_Of_Range; end Is_Out_Of_Range; ---------------------- -- Is_Static_Choice -- ---------------------- function Is_Static_Choice (Choice : Node_Id) return Boolean is begin -- Check various possibilities for choice -- Note: for membership tests, we test more cases than are possible -- (in particular subtype indication), but it doesn't matter because -- it just won't occur (we have already done a syntax check). if Nkind (Choice) = N_Others_Choice then return True; elsif Nkind (Choice) = N_Range then return Is_Static_Range (Choice); elsif Nkind (Choice) = N_Subtype_Indication or else (Is_Entity_Name (Choice) and then Is_Type (Entity (Choice))) then return Is_Static_Subtype (Etype (Choice)); else return Is_Static_Expression (Choice); end if; end Is_Static_Choice; --------------------------- -- Is_Static_Choice_List -- --------------------------- function Is_Static_Choice_List (Choices : List_Id) return Boolean is Choice : Node_Id; begin Choice := First (Choices); while Present (Choice) loop if not Is_Static_Choice (Choice) then return False; end if; Next (Choice); end loop; return True; end Is_Static_Choice_List; --------------------- -- Is_Static_Range -- --------------------- -- A static range is a range whose bounds are static expressions, or a -- Range_Attribute_Reference equivalent to such a range (RM 4.9(26)). -- We have already converted range attribute references, so we get the -- "or" part of this rule without needing a special test. function Is_Static_Range (N : Node_Id) return Boolean is begin return Is_Static_Expression (Low_Bound (N)) and then Is_Static_Expression (High_Bound (N)); end Is_Static_Range; ----------------------- -- Is_Static_Subtype -- ----------------------- -- Determines if Typ is a static subtype as defined in (RM 4.9(26)) function Is_Static_Subtype (Typ : Entity_Id) return Boolean is Base_T : constant Entity_Id := Base_Type (Typ); Anc_Subt : Entity_Id; begin -- First a quick check on the non static subtype flag. As described -- in further detail in Einfo, this flag is not decisive in all cases, -- but if it is set, then the subtype is definitely non-static. if Is_Non_Static_Subtype (Typ) then return False; end if; Anc_Subt := Ancestor_Subtype (Typ); if Anc_Subt = Empty then Anc_Subt := Base_T; end if; if Is_Generic_Type (Root_Type (Base_T)) or else Is_Generic_Actual_Type (Base_T) then return False; -- If there is a dynamic predicate for the type (declared or inherited) -- the expression is not static. elsif Has_Dynamic_Predicate_Aspect (Typ) or else (Is_Derived_Type (Typ) and then Has_Aspect (Typ, Aspect_Dynamic_Predicate)) then return False; -- String types elsif Is_String_Type (Typ) then return Ekind (Typ) = E_String_Literal_Subtype or else (Is_Static_Subtype (Component_Type (Typ)) and then Is_Static_Subtype (Etype (First_Index (Typ)))); -- Scalar types elsif Is_Scalar_Type (Typ) then if Base_T = Typ then return True; else return Is_Static_Subtype (Anc_Subt) and then Is_Static_Expression (Type_Low_Bound (Typ)) and then Is_Static_Expression (Type_High_Bound (Typ)); end if; -- Types other than string and scalar types are never static else return False; end if; end Is_Static_Subtype; ------------------------------- -- Is_Statically_Unevaluated -- ------------------------------- function Is_Statically_Unevaluated (Expr : Node_Id) return Boolean is function Check_Case_Expr_Alternative (CEA : Node_Id) return Match_Result; -- We have a message emanating from the Expression of a case expression -- alternative. We examine this alternative, as follows: -- -- If the selecting expression of the parent case is non-static, or -- if any of the discrete choices of the given case alternative are -- non-static or raise Constraint_Error, return Non_Static. -- -- Otherwise check if the selecting expression matches any of the given -- discrete choices. If so, the alternative is executed and we return -- Match, otherwise, the alternative can never be executed, and so we -- return No_Match. --------------------------------- -- Check_Case_Expr_Alternative -- --------------------------------- function Check_Case_Expr_Alternative (CEA : Node_Id) return Match_Result is Case_Exp : constant Node_Id := Parent (CEA); Choice : Node_Id; Prev_CEA : Node_Id; begin pragma Assert (Nkind (Case_Exp) = N_Case_Expression); -- Check that selecting expression is static if not Is_OK_Static_Expression (Expression (Case_Exp)) then return Non_Static; end if; if not Is_OK_Static_Choice_List (Discrete_Choices (CEA)) then return Non_Static; end if; -- All choices are now known to be static. Now see if alternative -- matches one of the choices. Choice := First (Discrete_Choices (CEA)); while Present (Choice) loop -- Check various possibilities for choice, returning Match if we -- find the selecting value matches any of the choices. Note that -- we know we are the last choice, so we don't have to keep going. if Nkind (Choice) = N_Others_Choice then -- Others choice is a bit annoying, it matches if none of the -- previous alternatives matches (note that we know we are the -- last alternative in this case, so we can just go backwards -- from us to see if any previous one matches). Prev_CEA := Prev (CEA); while Present (Prev_CEA) loop if Check_Case_Expr_Alternative (Prev_CEA) = Match then return No_Match; end if; Prev (Prev_CEA); end loop; return Match; -- Else we have a normal static choice elsif Choice_Matches (Expression (Case_Exp), Choice) = Match then return Match; end if; -- If we fall through, it means that the discrete choice did not -- match the selecting expression, so continue. Next (Choice); end loop; -- If we get through that loop then all choices were static, and none -- of them matched the selecting expression. So return No_Match. return No_Match; end Check_Case_Expr_Alternative; -- Local variables P : Node_Id; OldP : Node_Id; Choice : Node_Id; -- Start of processing for Is_Statically_Unevaluated begin -- The (32.x) references here are from RM section 4.9 -- (32.1) An expression is statically unevaluated if it is part of ... -- This means we have to climb the tree looking for one of the cases P := Expr; loop OldP := P; P := Parent (P); -- (32.2) The right operand of a static short-circuit control form -- whose value is determined by its left operand. -- AND THEN with False as left operand if Nkind (P) = N_And_Then and then Compile_Time_Known_Value (Left_Opnd (P)) and then Is_False (Expr_Value (Left_Opnd (P))) then return True; -- OR ELSE with True as left operand elsif Nkind (P) = N_Or_Else and then Compile_Time_Known_Value (Left_Opnd (P)) and then Is_True (Expr_Value (Left_Opnd (P))) then return True; -- (32.3) A dependent_expression of an if_expression whose associated -- condition is static and equals False. elsif Nkind (P) = N_If_Expression then declare Cond : constant Node_Id := First (Expressions (P)); Texp : constant Node_Id := Next (Cond); Fexp : constant Node_Id := Next (Texp); begin if Compile_Time_Known_Value (Cond) then -- Condition is True and we are in the right operand if Is_True (Expr_Value (Cond)) and then OldP = Fexp then return True; -- Condition is False and we are in the left operand elsif Is_False (Expr_Value (Cond)) and then OldP = Texp then return True; end if; end if; end; -- (32.4) A condition or dependent_expression of an if_expression -- where the condition corresponding to at least one preceding -- dependent_expression of the if_expression is static and equals -- True. -- This refers to cases like -- (if True then 1 elsif 1/0=2 then 2 else 3) -- But we expand elsif's out anyway, so the above looks like: -- (if True then 1 else (if 1/0=2 then 2 else 3)) -- So for us this is caught by the above check for the 32.3 case. -- (32.5) A dependent_expression of a case_expression whose -- selecting_expression is static and whose value is not covered -- by the corresponding discrete_choice_list. elsif Nkind (P) = N_Case_Expression_Alternative then -- First, we have to be in the expression to suppress messages. -- If we are within one of the choices, we want the message. if OldP = Expression (P) then -- Statically unevaluated if alternative does not match if Check_Case_Expr_Alternative (P) = No_Match then return True; end if; end if; -- (32.6) A choice_expression (or a simple_expression of a range -- that occurs as a membership_choice of a membership_choice_list) -- of a static membership test that is preceded in the enclosing -- membership_choice_list by another item whose individual -- membership test (see (RM 4.5.2)) statically yields True. elsif Nkind (P) in N_Membership_Test then -- Only possibly unevaluated if simple expression is static if not Is_OK_Static_Expression (Left_Opnd (P)) then null; -- All members of the choice list must be static elsif (Present (Right_Opnd (P)) and then not Is_OK_Static_Choice (Right_Opnd (P))) or else (Present (Alternatives (P)) and then not Is_OK_Static_Choice_List (Alternatives (P))) then null; -- If expression is the one and only alternative, then it is -- definitely not statically unevaluated, so we only have to -- test the case where there are alternatives present. elsif Present (Alternatives (P)) then -- Look for previous matching Choice Choice := First (Alternatives (P)); while Present (Choice) loop -- If we reached us and no previous choices matched, this -- is not the case where we are statically unevaluated. exit when OldP = Choice; -- If a previous choice matches, then that is the case where -- we know our choice is statically unevaluated. if Choice_Matches (Left_Opnd (P), Choice) = Match then return True; end if; Next (Choice); end loop; -- If we fall through the loop, we were not one of the choices, -- we must have been the expression, so that is not covered by -- this rule, and we keep going. null; end if; end if; -- OK, not statically unevaluated at this level, see if we should -- keep climbing to look for a higher level reason. -- Special case for component association in aggregates, where -- we want to keep climbing up to the parent aggregate. if Nkind (P) = N_Component_Association and then Nkind (Parent (P)) = N_Aggregate then null; -- All done if not still within subexpression else exit when Nkind (P) not in N_Subexpr; end if; end loop; -- If we fall through the loop, not one of the cases covered! return False; end Is_Statically_Unevaluated; -------------------- -- Not_Null_Range -- -------------------- function Not_Null_Range (Lo : Node_Id; Hi : Node_Id) return Boolean is begin if Compile_Time_Known_Value (Lo) and then Compile_Time_Known_Value (Hi) then declare Typ : Entity_Id := Etype (Lo); begin -- When called from the frontend, as part of the analysis of -- potentially static expressions, Typ will be the full view of a -- type with all the info needed to answer this query. When called -- from the backend, for example to know whether a range of a loop -- is null, Typ might be a private type and we need to explicitly -- switch to its corresponding full view to access the same info. if Is_Incomplete_Or_Private_Type (Typ) and then Present (Full_View (Typ)) then Typ := Full_View (Typ); end if; if Is_Discrete_Type (Typ) then return Expr_Value (Lo) <= Expr_Value (Hi); else pragma Assert (Is_Real_Type (Typ)); return Expr_Value_R (Lo) <= Expr_Value_R (Hi); end if; end; else return False; end if; end Not_Null_Range; ------------- -- OK_Bits -- ------------- function OK_Bits (N : Node_Id; Bits : Uint) return Boolean is begin -- We allow a maximum of 500,000 bits which seems a reasonable limit if Bits < 500_000 then return True; -- Error if this maximum is exceeded else Error_Msg_N ("static value too large, capacity exceeded", N); return False; end if; end OK_Bits; ------------------ -- Out_Of_Range -- ------------------ procedure Out_Of_Range (N : Node_Id) is begin -- If we have the static expression case, then this is an illegality -- in Ada 95 mode, except that in an instance, we never generate an -- error (if the error is legitimate, it was already diagnosed in the -- template). if Is_Static_Expression (N) and then not In_Instance and then not In_Inlined_Body and then Ada_Version >= Ada_95 then -- No message if we are statically unevaluated if Is_Statically_Unevaluated (N) then null; -- The expression to compute the length of a packed array is attached -- to the array type itself, and deserves a separate message. elsif Nkind (Parent (N)) = N_Defining_Identifier and then Is_Array_Type (Parent (N)) and then Present (Packed_Array_Impl_Type (Parent (N))) and then Present (First_Rep_Item (Parent (N))) then Error_Msg_N ("length of packed array must not exceed Integer''Last", First_Rep_Item (Parent (N))); Rewrite (N, Make_Integer_Literal (Sloc (N), Uint_1)); -- All cases except the special array case. -- No message if we are dealing with System.Priority values in -- CodePeer mode where the target runtime may have more priorities. elsif not CodePeer_Mode or else Etype (N) /= RTE (RE_Priority) then -- Determine if the out-of-range violation constitutes a warning -- or an error based on context, according to RM 4.9 (34/3). if Nkind (Original_Node (N)) = N_Type_Conversion and then not Comes_From_Source (Original_Node (N)) then Apply_Compile_Time_Constraint_Error (N, "value not in range of}??", CE_Range_Check_Failed); else Apply_Compile_Time_Constraint_Error (N, "value not in range of}", CE_Range_Check_Failed); end if; end if; -- Here we generate a warning for the Ada 83 case, or when we are in an -- instance, or when we have a non-static expression case. else Apply_Compile_Time_Constraint_Error (N, "value not in range of}??", CE_Range_Check_Failed); end if; end Out_Of_Range; --------------------------- -- Predicates_Compatible -- --------------------------- function Predicates_Compatible (T1, T2 : Entity_Id) return Boolean is function T2_Rep_Item_Applies_To_T1 (Nam : Name_Id) return Boolean; -- Return True if the rep item for Nam is either absent on T2 or also -- applies to T1. ------------------------------- -- T2_Rep_Item_Applies_To_T1 -- ------------------------------- function T2_Rep_Item_Applies_To_T1 (Nam : Name_Id) return Boolean is Rep_Item : constant Node_Id := Get_Rep_Item (T2, Nam); begin return No (Rep_Item) or else Get_Rep_Item (T1, Nam) = Rep_Item; end T2_Rep_Item_Applies_To_T1; -- Start of processing for Predicates_Compatible begin if Ada_Version < Ada_2012 then return True; -- If T2 has no predicates, there is no compatibility issue elsif not Has_Predicates (T2) then return True; -- T2 has predicates, if T1 has none then we defer to the static check elsif not Has_Predicates (T1) then null; -- Both T2 and T1 have predicates, check that all predicates that apply -- to T2 apply also to T1 (RM 4.9.1(9/3)). elsif T2_Rep_Item_Applies_To_T1 (Name_Static_Predicate) and then T2_Rep_Item_Applies_To_T1 (Name_Dynamic_Predicate) and then T2_Rep_Item_Applies_To_T1 (Name_Predicate) then return True; end if; -- Implement the static check prescribed by RM 4.9.1(10/3) if Is_Static_Subtype (T1) and then Is_Static_Subtype (T2) then -- We just need to query Interval_Lists for discrete types if Is_Discrete_Type (T1) and then Is_Discrete_Type (T2) then declare Interval_List1 : constant Interval_Lists.Discrete_Interval_List := Interval_Lists.Type_Intervals (T1); Interval_List2 : constant Interval_Lists.Discrete_Interval_List := Interval_Lists.Type_Intervals (T2); begin return Interval_Lists.Is_Subset (Interval_List1, Interval_List2) and then not (Has_Predicates (T1) and then not Predicate_Checks_Suppressed (T2) and then Predicate_Checks_Suppressed (T1)); end; else -- TBD: Implement Interval_Lists for real types return False; end if; -- If either subtype is not static, the predicates are not compatible else return False; end if; end Predicates_Compatible; ---------------------- -- Predicates_Match -- ---------------------- function Predicates_Match (T1, T2 : Entity_Id) return Boolean is function Have_Same_Rep_Item (Nam : Name_Id) return Boolean; -- Return True if T1 and T2 have the same rep item for Nam ------------------------ -- Have_Same_Rep_Item -- ------------------------ function Have_Same_Rep_Item (Nam : Name_Id) return Boolean is begin return Get_Rep_Item (T1, Nam) = Get_Rep_Item (T2, Nam); end Have_Same_Rep_Item; -- Start of processing for Predicates_Match begin if Ada_Version < Ada_2012 then return True; -- If T2 has no predicates, match if and only if T1 has none elsif not Has_Predicates (T2) then return not Has_Predicates (T1); -- T2 has predicates, no match if T1 has none elsif not Has_Predicates (T1) then return False; -- Both T2 and T1 have predicates, check that they all come -- from the same declarations. else return Have_Same_Rep_Item (Name_Static_Predicate) and then Have_Same_Rep_Item (Name_Dynamic_Predicate) and then Have_Same_Rep_Item (Name_Predicate); end if; end Predicates_Match; --------------------------------------------- -- Real_Or_String_Static_Predicate_Matches -- --------------------------------------------- function Real_Or_String_Static_Predicate_Matches (Val : Node_Id; Typ : Entity_Id) return Boolean is Expr : constant Node_Id := Static_Real_Or_String_Predicate (Typ); -- The predicate expression from the type Pfun : constant Entity_Id := Predicate_Function (Typ); -- The entity for the predicate function Ent_Name : constant Name_Id := Chars (First_Formal (Pfun)); -- The name of the formal of the predicate function. Occurrences of the -- type name in Expr have been rewritten as references to this formal, -- and it has a unique name, so we can identify references by this name. Copy : Node_Id; -- Copy of the predicate function tree function Process (N : Node_Id) return Traverse_Result; -- Function used to process nodes during the traversal in which we will -- find occurrences of the entity name, and replace such occurrences -- by a real literal with the value to be tested. procedure Traverse is new Traverse_Proc (Process); -- The actual traversal procedure ------------- -- Process -- ------------- function Process (N : Node_Id) return Traverse_Result is begin if Nkind (N) = N_Identifier and then Chars (N) = Ent_Name then declare Nod : constant Node_Id := New_Copy (Val); begin Set_Sloc (Nod, Sloc (N)); Rewrite (N, Nod); return Skip; end; -- The predicate function may contain string-comparison operations -- that have been converted into calls to run-time array-comparison -- routines. To evaluate the predicate statically, we recover the -- original comparison operation and replace the occurrence of the -- formal by the static string value. The actuals of the generated -- call are of the form X'Address. elsif Nkind (N) in N_Op_Compare and then Nkind (Left_Opnd (N)) = N_Function_Call then declare C : constant Node_Id := Left_Opnd (N); F : constant Node_Id := First (Parameter_Associations (C)); L : constant Node_Id := Prefix (F); R : constant Node_Id := Prefix (Next (F)); begin -- If an operand is an entity name, it is the formal of the -- predicate function, so replace it with the string value. -- It may be either operand in the call. The other operand -- is a static string from the original predicate. if Is_Entity_Name (L) then Rewrite (Left_Opnd (N), New_Copy (Val)); Rewrite (Right_Opnd (N), New_Copy (R)); else Rewrite (Left_Opnd (N), New_Copy (L)); Rewrite (Right_Opnd (N), New_Copy (Val)); end if; return Skip; end; else return OK; end if; end Process; -- Start of processing for Real_Or_String_Static_Predicate_Matches begin -- First deal with special case of inherited predicate, where the -- predicate expression looks like: -- xxPredicate (typ (Ent)) and then Expr -- where Expr is the predicate expression for this level, and the -- left operand is the call to evaluate the inherited predicate. if Nkind (Expr) = N_And_Then and then Nkind (Left_Opnd (Expr)) = N_Function_Call and then Is_Predicate_Function (Entity (Name (Left_Opnd (Expr)))) then -- OK we have the inherited case, so make a call to evaluate the -- inherited predicate. If that fails, so do we! if not Real_Or_String_Static_Predicate_Matches (Val => Val, Typ => Etype (First_Formal (Entity (Name (Left_Opnd (Expr)))))) then return False; end if; -- Use the right operand for the continued processing Copy := Copy_Separate_Tree (Right_Opnd (Expr)); -- Case where call to predicate function appears on its own (this means -- that the predicate at this level is just inherited from the parent). elsif Nkind (Expr) = N_Function_Call then declare Typ : constant Entity_Id := Etype (First_Formal (Entity (Name (Expr)))); begin -- If the inherited predicate is dynamic, just ignore it. We can't -- go trying to evaluate a dynamic predicate as a static one! if Has_Dynamic_Predicate_Aspect (Typ) then return True; -- Otherwise inherited predicate is static, check for match else return Real_Or_String_Static_Predicate_Matches (Val, Typ); end if; end; -- If not just an inherited predicate, copy whole expression else Copy := Copy_Separate_Tree (Expr); end if; -- Now we replace occurrences of the entity by the value Traverse (Copy); -- And analyze the resulting static expression to see if it is True Analyze_And_Resolve (Copy, Standard_Boolean); return Is_True (Expr_Value (Copy)); end Real_Or_String_Static_Predicate_Matches; ------------------------- -- Rewrite_In_Raise_CE -- ------------------------- procedure Rewrite_In_Raise_CE (N : Node_Id; Exp : Node_Id) is Stat : constant Boolean := Is_Static_Expression (N); Typ : constant Entity_Id := Etype (N); begin -- If we want to raise CE in the condition of a N_Raise_CE node, we -- can just clear the condition if the reason is appropriate. We do -- not do this operation if the parent has a reason other than range -- check failed, because otherwise we would change the reason. if Present (Parent (N)) and then Nkind (Parent (N)) = N_Raise_Constraint_Error and then Reason (Parent (N)) = UI_From_Int (RT_Exception_Code'Pos (CE_Range_Check_Failed)) then Set_Condition (Parent (N), Empty); -- Else build an explicit N_Raise_CE else if Nkind (Exp) = N_Raise_Constraint_Error then Rewrite (N, Make_Raise_Constraint_Error (Sloc (Exp), Reason => Reason (Exp))); else Rewrite (N, Make_Raise_Constraint_Error (Sloc (Exp), Reason => CE_Range_Check_Failed)); end if; Set_Raises_Constraint_Error (N); Set_Etype (N, Typ); end if; -- Set proper flags in result Set_Raises_Constraint_Error (N, True); Set_Is_Static_Expression (N, Stat); end Rewrite_In_Raise_CE; ------------------------------------------------ -- Set_Checking_Potentially_Static_Expression -- ------------------------------------------------ procedure Set_Checking_Potentially_Static_Expression (Value : Boolean) is begin -- Verify that we're not currently checking for a potentially static -- expression unless we're disabling such checking. pragma Assert (not Checking_For_Potentially_Static_Expression or else not Value); Checking_For_Potentially_Static_Expression := Value; end Set_Checking_Potentially_Static_Expression; --------------------- -- String_Type_Len -- --------------------- function String_Type_Len (Stype : Entity_Id) return Uint is NT : constant Entity_Id := Etype (First_Index (Stype)); T : Entity_Id; begin if Is_OK_Static_Subtype (NT) then T := NT; else T := Base_Type (NT); end if; return Expr_Value (Type_High_Bound (T)) - Expr_Value (Type_Low_Bound (T)) + 1; end String_Type_Len; ------------------------------------ -- Subtypes_Statically_Compatible -- ------------------------------------ function Subtypes_Statically_Compatible (T1 : Entity_Id; T2 : Entity_Id; Formal_Derived_Matching : Boolean := False) return Boolean is begin -- A type is always statically compatible with itself if T1 = T2 then return True; -- Not compatible if predicates are not compatible elsif not Predicates_Compatible (T1, T2) then return False; -- Scalar types elsif Is_Scalar_Type (T1) then -- Definitely compatible if we match if Subtypes_Statically_Match (T1, T2) then return True; -- If either subtype is nonstatic then they're not compatible elsif not Is_OK_Static_Subtype (T1) or else not Is_OK_Static_Subtype (T2) then return False; -- Base types must match, but we don't check that (should we???) but -- we do at least check that both types are real, or both types are -- not real. elsif Is_Real_Type (T1) /= Is_Real_Type (T2) then return False; -- Here we check the bounds else declare LB1 : constant Node_Id := Type_Low_Bound (T1); HB1 : constant Node_Id := Type_High_Bound (T1); LB2 : constant Node_Id := Type_Low_Bound (T2); HB2 : constant Node_Id := Type_High_Bound (T2); begin if Is_Real_Type (T1) then return Expr_Value_R (LB1) > Expr_Value_R (HB1) or else (Expr_Value_R (LB2) <= Expr_Value_R (LB1) and then Expr_Value_R (HB1) <= Expr_Value_R (HB2)); else return Expr_Value (LB1) > Expr_Value (HB1) or else (Expr_Value (LB2) <= Expr_Value (LB1) and then Expr_Value (HB1) <= Expr_Value (HB2)); end if; end; end if; -- Access types elsif Is_Access_Type (T1) then return (not Is_Constrained (T2) or else Subtypes_Statically_Match (Designated_Type (T1), Designated_Type (T2))) and then not (Can_Never_Be_Null (T2) and then not Can_Never_Be_Null (T1)); -- All other cases else return (Is_Composite_Type (T1) and then not Is_Constrained (T2)) or else Subtypes_Statically_Match (T1, T2, Formal_Derived_Matching); end if; end Subtypes_Statically_Compatible; ------------------------------- -- Subtypes_Statically_Match -- ------------------------------- -- Subtypes statically match if they have statically matching constraints -- (RM 4.9.1(2)). Constraints statically match if there are none, or if -- they are the same identical constraint, or if they are static and the -- values match (RM 4.9.1(1)). -- In addition, in GNAT, the object size (Esize) values of the types must -- match if they are set (unless checking an actual for a formal derived -- type). The use of 'Object_Size can cause this to be false even if the -- types would otherwise match in the Ada 95 RM sense, but this deviation -- is adopted by AI12-059 which introduces Object_Size in Ada 2020. function Subtypes_Statically_Match (T1 : Entity_Id; T2 : Entity_Id; Formal_Derived_Matching : Boolean := False) return Boolean is begin -- A type always statically matches itself if T1 = T2 then return True; -- No match if sizes different (from use of 'Object_Size). This test -- is excluded if Formal_Derived_Matching is True, as the base types -- can be different in that case and typically have different sizes. elsif not Formal_Derived_Matching and then Known_Static_Esize (T1) and then Known_Static_Esize (T2) and then Esize (T1) /= Esize (T2) then return False; -- No match if predicates do not match elsif not Predicates_Match (T1, T2) then return False; -- Scalar types elsif Is_Scalar_Type (T1) then -- Base types must be the same if Base_Type (T1) /= Base_Type (T2) then return False; end if; -- A constrained numeric subtype never matches an unconstrained -- subtype, i.e. both types must be constrained or unconstrained. -- To understand the requirement for this test, see RM 4.9.1(1). -- As is made clear in RM 3.5.4(11), type Integer, for example is -- a constrained subtype with constraint bounds matching the bounds -- of its corresponding unconstrained base type. In this situation, -- Integer and Integer'Base do not statically match, even though -- they have the same bounds. -- We only apply this test to types in Standard and types that appear -- in user programs. That way, we do not have to be too careful about -- setting Is_Constrained right for Itypes. if Is_Numeric_Type (T1) and then (Is_Constrained (T1) /= Is_Constrained (T2)) and then (Scope (T1) = Standard_Standard or else Comes_From_Source (T1)) and then (Scope (T2) = Standard_Standard or else Comes_From_Source (T2)) then return False; -- A generic scalar type does not statically match its base type -- (AI-311). In this case we make sure that the formals, which are -- first subtypes of their bases, are constrained. elsif Is_Generic_Type (T1) and then Is_Generic_Type (T2) and then (Is_Constrained (T1) /= Is_Constrained (T2)) then return False; end if; -- If there was an error in either range, then just assume the types -- statically match to avoid further junk errors. if No (Scalar_Range (T1)) or else No (Scalar_Range (T2)) or else Error_Posted (Scalar_Range (T1)) or else Error_Posted (Scalar_Range (T2)) then return True; end if; -- Otherwise both types have bounds that can be compared declare LB1 : constant Node_Id := Type_Low_Bound (T1); HB1 : constant Node_Id := Type_High_Bound (T1); LB2 : constant Node_Id := Type_Low_Bound (T2); HB2 : constant Node_Id := Type_High_Bound (T2); begin -- If the bounds are the same tree node, then match (common case) if LB1 = LB2 and then HB1 = HB2 then return True; -- Otherwise bounds must be static and identical value else if not Is_OK_Static_Subtype (T1) or else not Is_OK_Static_Subtype (T2) then return False; elsif Is_Real_Type (T1) then return Expr_Value_R (LB1) = Expr_Value_R (LB2) and then Expr_Value_R (HB1) = Expr_Value_R (HB2); else return Expr_Value (LB1) = Expr_Value (LB2) and then Expr_Value (HB1) = Expr_Value (HB2); end if; end if; end; -- Type with discriminants elsif Has_Discriminants (T1) or else Has_Discriminants (T2) then -- Handle derivations of private subtypes. For example S1 statically -- matches the full view of T1 in the following example: -- type T1(<>) is new Root with private; -- subtype S1 is new T1; -- overriding proc P1 (P : S1); -- private -- type T1 (D : Disc) is new Root with ... if Ekind (T2) = E_Record_Subtype_With_Private and then not Has_Discriminants (T2) and then Partial_View_Has_Unknown_Discr (T1) and then Etype (T2) = T1 then return True; elsif Ekind (T1) = E_Record_Subtype_With_Private and then not Has_Discriminants (T1) and then Partial_View_Has_Unknown_Discr (T2) and then Etype (T1) = T2 then return True; -- Because of view exchanges in multiple instantiations, conformance -- checking might try to match a partial view of a type with no -- discriminants with a full view that has defaulted discriminants. -- In such a case, use the discriminant constraint of the full view, -- which must exist because we know that the two subtypes have the -- same base type. elsif Has_Discriminants (T1) /= Has_Discriminants (T2) then if In_Instance then if Is_Private_Type (T2) and then Present (Full_View (T2)) and then Has_Discriminants (Full_View (T2)) then return Subtypes_Statically_Match (T1, Full_View (T2)); elsif Is_Private_Type (T1) and then Present (Full_View (T1)) and then Has_Discriminants (Full_View (T1)) then return Subtypes_Statically_Match (Full_View (T1), T2); else return False; end if; else return False; end if; end if; declare function Original_Discriminant_Constraint (Typ : Entity_Id) return Elist_Id; -- Returns Typ's discriminant constraint, or if the constraint -- is inherited from an ancestor type, then climbs the parent -- types to locate and return the constraint farthest up the -- parent chain that Typ's constraint is ultimately inherited -- from (stopping before a parent that doesn't impose a constraint -- or a parent that has new discriminants). This ensures a proper -- result from the equality comparison of Elist_Ids below (as -- otherwise, derived types that inherit constraints may appear -- to be unequal, because each level of derivation can have its -- own copy of the constraint). function Original_Discriminant_Constraint (Typ : Entity_Id) return Elist_Id is begin if not Has_Discriminants (Typ) then return No_Elist; -- If Typ is not a derived type, then directly return the -- its constraint. elsif not Is_Derived_Type (Typ) then return Discriminant_Constraint (Typ); -- If the parent type doesn't have discriminants, doesn't -- have a constraint, or has new discriminants, then stop -- and return Typ's constraint. elsif not Has_Discriminants (Etype (Typ)) -- No constraint on the parent type or else not Present (Discriminant_Constraint (Etype (Typ))) or else Is_Empty_Elmt_List (Discriminant_Constraint (Etype (Typ))) -- The parent type defines new discriminants or else (Is_Base_Type (Etype (Typ)) and then Present (Discriminant_Specifications (Parent (Etype (Typ))))) then return Discriminant_Constraint (Typ); -- Otherwise, make a recursive call on the parent type else return Original_Discriminant_Constraint (Etype (Typ)); end if; end Original_Discriminant_Constraint; -- Local variables DL1 : constant Elist_Id := Original_Discriminant_Constraint (T1); DL2 : constant Elist_Id := Original_Discriminant_Constraint (T2); DA1 : Elmt_Id; DA2 : Elmt_Id; begin if DL1 = DL2 then return True; elsif Is_Constrained (T1) /= Is_Constrained (T2) then return False; end if; -- Now loop through the discriminant constraints -- Note: the guard here seems necessary, since it is possible at -- least for DL1 to be No_Elist. Not clear this is reasonable ??? if Present (DL1) and then Present (DL2) then DA1 := First_Elmt (DL1); DA2 := First_Elmt (DL2); while Present (DA1) loop declare Expr1 : constant Node_Id := Node (DA1); Expr2 : constant Node_Id := Node (DA2); begin if not Is_OK_Static_Expression (Expr1) or else not Is_OK_Static_Expression (Expr2) then return False; -- If either expression raised a Constraint_Error, -- consider the expressions as matching, since this -- helps to prevent cascading errors. elsif Raises_Constraint_Error (Expr1) or else Raises_Constraint_Error (Expr2) then null; elsif Expr_Value (Expr1) /= Expr_Value (Expr2) then return False; end if; end; Next_Elmt (DA1); Next_Elmt (DA2); end loop; end if; end; return True; -- A definite type does not match an indefinite or classwide type. -- However, a generic type with unknown discriminants may be -- instantiated with a type with no discriminants, and conformance -- checking on an inherited operation may compare the actual with the -- subtype that renames it in the instance. elsif Has_Unknown_Discriminants (T1) /= Has_Unknown_Discriminants (T2) then return Is_Generic_Actual_Type (T1) or else Is_Generic_Actual_Type (T2); -- Array type elsif Is_Array_Type (T1) then -- If either subtype is unconstrained then both must be, and if both -- are unconstrained then no further checking is needed. if not Is_Constrained (T1) or else not Is_Constrained (T2) then return not (Is_Constrained (T1) or else Is_Constrained (T2)); end if; -- Both subtypes are constrained, so check that the index subtypes -- statically match. declare Index1 : Node_Id := First_Index (T1); Index2 : Node_Id := First_Index (T2); begin while Present (Index1) loop if not Subtypes_Statically_Match (Etype (Index1), Etype (Index2)) then return False; end if; Next_Index (Index1); Next_Index (Index2); end loop; return True; end; elsif Is_Access_Type (T1) then if Can_Never_Be_Null (T1) /= Can_Never_Be_Null (T2) then return False; elsif Ekind (T1) in E_Access_Subprogram_Type | E_Anonymous_Access_Subprogram_Type then return Subtype_Conformant (Designated_Type (T1), Designated_Type (T2)); else return Subtypes_Statically_Match (Designated_Type (T1), Designated_Type (T2)) and then Is_Access_Constant (T1) = Is_Access_Constant (T2); end if; -- All other types definitely match else return True; end if; end Subtypes_Statically_Match; ---------- -- Test -- ---------- function Test (Cond : Boolean) return Uint is begin if Cond then return Uint_1; else return Uint_0; end if; end Test; --------------------- -- Test_Comparison -- --------------------- procedure Test_Comparison (Op : Node_Id; Assume_Valid : Boolean; True_Result : out Boolean; False_Result : out Boolean) is Left : constant Node_Id := Left_Opnd (Op); Left_Typ : constant Entity_Id := Etype (Left); Orig_Op : constant Node_Id := Original_Node (Op); procedure Replacement_Warning (Msg : String); -- Emit a warning on a comparison that can be replaced by '=' ------------------------- -- Replacement_Warning -- ------------------------- procedure Replacement_Warning (Msg : String) is begin if Constant_Condition_Warnings and then Comes_From_Source (Orig_Op) and then Is_Integer_Type (Left_Typ) and then not Error_Posted (Op) and then not Has_Warnings_Off (Left_Typ) and then not In_Instance then Error_Msg_N (Msg, Op); end if; end Replacement_Warning; -- Local variables Res : constant Compare_Result := Compile_Time_Compare (Left, Right_Opnd (Op), Assume_Valid); -- Start of processing for Test_Comparison begin case N_Op_Compare (Nkind (Op)) is when N_Op_Eq => True_Result := Res = EQ; False_Result := Res = LT or else Res = GT or else Res = NE; when N_Op_Ge => True_Result := Res in Compare_GE; False_Result := Res = LT; if Res = LE and then Nkind (Orig_Op) = N_Op_Ge then Replacement_Warning ("can never be greater than, could replace by ""'=""?c?"); end if; when N_Op_Gt => True_Result := Res = GT; False_Result := Res in Compare_LE; when N_Op_Le => True_Result := Res in Compare_LE; False_Result := Res = GT; if Res = GE and then Nkind (Orig_Op) = N_Op_Le then Replacement_Warning ("can never be less than, could replace by ""'=""?c?"); end if; when N_Op_Lt => True_Result := Res = LT; False_Result := Res in Compare_GE; when N_Op_Ne => True_Result := Res = NE or else Res = GT or else Res = LT; False_Result := Res = EQ; end case; end Test_Comparison; --------------------------------- -- Test_Expression_Is_Foldable -- --------------------------------- -- One operand case procedure Test_Expression_Is_Foldable (N : Node_Id; Op1 : Node_Id; Stat : out Boolean; Fold : out Boolean) is begin Stat := False; Fold := False; if Debug_Flag_Dot_F and then In_Extended_Main_Source_Unit (N) then return; end if; -- If operand is Any_Type, just propagate to result and do not -- try to fold, this prevents cascaded errors. if Etype (Op1) = Any_Type then Set_Etype (N, Any_Type); return; -- If operand raises Constraint_Error, then replace node N with the -- raise Constraint_Error node, and we are obviously not foldable. -- Note that this replacement inherits the Is_Static_Expression flag -- from the operand. elsif Raises_Constraint_Error (Op1) then Rewrite_In_Raise_CE (N, Op1); return; -- If the operand is not static, then the result is not static, and -- all we have to do is to check the operand since it is now known -- to appear in a non-static context. elsif not Is_Static_Expression (Op1) then Check_Non_Static_Context (Op1); Fold := Compile_Time_Known_Value (Op1); return; -- An expression of a formal modular type is not foldable because -- the modulus is unknown. elsif Is_Modular_Integer_Type (Etype (Op1)) and then Is_Generic_Type (Etype (Op1)) then Check_Non_Static_Context (Op1); return; -- Here we have the case of an operand whose type is OK, which is -- static, and which does not raise Constraint_Error, we can fold. else Set_Is_Static_Expression (N); Fold := True; Stat := True; end if; end Test_Expression_Is_Foldable; -- Two operand case procedure Test_Expression_Is_Foldable (N : Node_Id; Op1 : Node_Id; Op2 : Node_Id; Stat : out Boolean; Fold : out Boolean; CRT_Safe : Boolean := False) is Rstat : constant Boolean := Is_Static_Expression (Op1) and then Is_Static_Expression (Op2); begin Stat := False; Fold := False; -- Inhibit folding if -gnatd.f flag set if Debug_Flag_Dot_F and then In_Extended_Main_Source_Unit (N) then return; end if; -- If either operand is Any_Type, just propagate to result and -- do not try to fold, this prevents cascaded errors. if Etype (Op1) = Any_Type or else Etype (Op2) = Any_Type then Set_Etype (N, Any_Type); return; -- If left operand raises Constraint_Error, then replace node N with the -- Raise_Constraint_Error node, and we are obviously not foldable. -- Is_Static_Expression is set from the two operands in the normal way, -- and we check the right operand if it is in a non-static context. elsif Raises_Constraint_Error (Op1) then if not Rstat then Check_Non_Static_Context (Op2); end if; Rewrite_In_Raise_CE (N, Op1); Set_Is_Static_Expression (N, Rstat); return; -- Similar processing for the case of the right operand. Note that we -- don't use this routine for the short-circuit case, so we do not have -- to worry about that special case here. elsif Raises_Constraint_Error (Op2) then if not Rstat then Check_Non_Static_Context (Op1); end if; Rewrite_In_Raise_CE (N, Op2); Set_Is_Static_Expression (N, Rstat); return; -- Exclude expressions of a generic modular type, as above elsif Is_Modular_Integer_Type (Etype (Op1)) and then Is_Generic_Type (Etype (Op1)) then Check_Non_Static_Context (Op1); return; -- If result is not static, then check non-static contexts on operands -- since one of them may be static and the other one may not be static. elsif not Rstat then Check_Non_Static_Context (Op1); Check_Non_Static_Context (Op2); if CRT_Safe then Fold := CRT_Safe_Compile_Time_Known_Value (Op1) and then CRT_Safe_Compile_Time_Known_Value (Op2); else Fold := Compile_Time_Known_Value (Op1) and then Compile_Time_Known_Value (Op2); end if; return; -- Else result is static and foldable. Both operands are static, and -- neither raises Constraint_Error, so we can definitely fold. else Set_Is_Static_Expression (N); Fold := True; Stat := True; return; end if; end Test_Expression_Is_Foldable; ------------------- -- Test_In_Range -- ------------------- function Test_In_Range (N : Node_Id; Typ : Entity_Id; Assume_Valid : Boolean; Fixed_Int : Boolean; Int_Real : Boolean) return Range_Membership is Val : Uint; Valr : Ureal; pragma Warnings (Off, Assume_Valid); -- For now Assume_Valid is unreferenced since the current implementation -- always returns Unknown if N is not a compile-time-known value, but we -- keep the parameter to allow for future enhancements in which we try -- to get the information in the variable case as well. begin -- If an error was posted on expression, then return Unknown, we do not -- want cascaded errors based on some false analysis of a junk node. if Error_Posted (N) then return Unknown; -- Expression that raises Constraint_Error is an odd case. We certainly -- do not want to consider it to be in range. It might make sense to -- consider it always out of range, but this causes incorrect error -- messages about static expressions out of range. So we just return -- Unknown, which is always safe. elsif Raises_Constraint_Error (N) then return Unknown; -- Universal types have no range limits, so always in range elsif Typ = Universal_Integer or else Typ = Universal_Real then return In_Range; -- Never known if not scalar type. Don't know if this can actually -- happen, but our spec allows it, so we must check. elsif not Is_Scalar_Type (Typ) then return Unknown; -- Never known if this is a generic type, since the bounds of generic -- types are junk. Note that if we only checked for static expressions -- (instead of compile-time-known values) below, we would not need this -- check, because values of a generic type can never be static, but they -- can be known at compile time. elsif Is_Generic_Type (Typ) then return Unknown; -- Case of a known compile time value, where we can check if it is in -- the bounds of the given type. elsif Compile_Time_Known_Value (N) then declare Lo : Node_Id; Hi : Node_Id; LB_Known : Boolean; HB_Known : Boolean; begin Lo := Type_Low_Bound (Typ); Hi := Type_High_Bound (Typ); LB_Known := Compile_Time_Known_Value (Lo); HB_Known := Compile_Time_Known_Value (Hi); -- Fixed point types should be considered as such only if flag -- Fixed_Int is set to False. if Is_Floating_Point_Type (Typ) or else (Is_Fixed_Point_Type (Typ) and then not Fixed_Int) or else Int_Real then Valr := Expr_Value_R (N); if LB_Known and HB_Known then if Valr >= Expr_Value_R (Lo) and then Valr <= Expr_Value_R (Hi) then return In_Range; else return Out_Of_Range; end if; elsif (LB_Known and then Valr < Expr_Value_R (Lo)) or else (HB_Known and then Valr > Expr_Value_R (Hi)) then return Out_Of_Range; else return Unknown; end if; else Val := Expr_Value (N); if LB_Known and HB_Known then if Val >= Expr_Value (Lo) and then Val <= Expr_Value (Hi) then return In_Range; else return Out_Of_Range; end if; elsif (LB_Known and then Val < Expr_Value (Lo)) or else (HB_Known and then Val > Expr_Value (Hi)) then return Out_Of_Range; else return Unknown; end if; end if; end; -- Here for value not known at compile time. Case of expression subtype -- is Typ or is a subtype of Typ, and we can assume expression is valid. -- In this case we know it is in range without knowing its value. elsif Assume_Valid and then (Etype (N) = Typ or else Is_Subtype_Of (Etype (N), Typ)) then return In_Range; -- Another special case. For signed integer types, if the target type -- has Is_Known_Valid set, and the source type does not have a larger -- size, then the source value must be in range. We exclude biased -- types, because they bizarrely can generate out of range values. elsif Is_Signed_Integer_Type (Etype (N)) and then Is_Known_Valid (Typ) and then Esize (Etype (N)) <= Esize (Typ) and then not Has_Biased_Representation (Etype (N)) then return In_Range; -- For all other cases, result is unknown else return Unknown; end if; end Test_In_Range; -------------- -- To_Bits -- -------------- procedure To_Bits (U : Uint; B : out Bits) is begin for J in 0 .. B'Last loop B (J) := (U / (2 ** J)) mod 2 /= 0; end loop; end To_Bits; -------------------- -- Why_Not_Static -- -------------------- procedure Why_Not_Static (Expr : Node_Id) is N : constant Node_Id := Original_Node (Expr); Typ : Entity_Id := Empty; E : Entity_Id; Alt : Node_Id; Exp : Node_Id; procedure Why_Not_Static_List (L : List_Id); -- A version that can be called on a list of expressions. Finds all -- non-static violations in any element of the list. ------------------------- -- Why_Not_Static_List -- ------------------------- procedure Why_Not_Static_List (L : List_Id) is N : Node_Id; begin if Is_Non_Empty_List (L) then N := First (L); while Present (N) loop Why_Not_Static (N); Next (N); end loop; end if; end Why_Not_Static_List; -- Start of processing for Why_Not_Static begin -- Ignore call on error or empty node if No (Expr) or else Nkind (Expr) = N_Error then return; end if; -- Preprocessing for sub expressions if Nkind (Expr) in N_Subexpr then -- Nothing to do if expression is static if Is_OK_Static_Expression (Expr) then return; end if; -- Test for Constraint_Error raised if Raises_Constraint_Error (Expr) then -- Special case membership to find out which piece to flag if Nkind (N) in N_Membership_Test then if Raises_Constraint_Error (Left_Opnd (N)) then Why_Not_Static (Left_Opnd (N)); return; elsif Present (Right_Opnd (N)) and then Raises_Constraint_Error (Right_Opnd (N)) then Why_Not_Static (Right_Opnd (N)); return; else pragma Assert (Present (Alternatives (N))); Alt := First (Alternatives (N)); while Present (Alt) loop if Raises_Constraint_Error (Alt) then Why_Not_Static (Alt); return; else Next (Alt); end if; end loop; end if; -- Special case a range to find out which bound to flag elsif Nkind (N) = N_Range then if Raises_Constraint_Error (Low_Bound (N)) then Why_Not_Static (Low_Bound (N)); return; elsif Raises_Constraint_Error (High_Bound (N)) then Why_Not_Static (High_Bound (N)); return; end if; -- Special case attribute to see which part to flag elsif Nkind (N) = N_Attribute_Reference then if Raises_Constraint_Error (Prefix (N)) then Why_Not_Static (Prefix (N)); return; end if; if Present (Expressions (N)) then Exp := First (Expressions (N)); while Present (Exp) loop if Raises_Constraint_Error (Exp) then Why_Not_Static (Exp); return; end if; Next (Exp); end loop; end if; -- Special case a subtype name elsif Is_Entity_Name (Expr) and then Is_Type (Entity (Expr)) then Error_Msg_NE ("!& is not a static subtype (RM 4.9(26))", N, Entity (Expr)); return; end if; -- End of special cases Error_Msg_N ("!expression raises exception, cannot be static (RM 4.9(34))", N); return; end if; -- If no type, then something is pretty wrong, so ignore Typ := Etype (Expr); if No (Typ) then return; end if; -- Type must be scalar or string type (but allow Bignum, since this -- is really a scalar type from our point of view in this diagnosis). if not Is_Scalar_Type (Typ) and then not Is_String_Type (Typ) and then not Is_RTE (Typ, RE_Bignum) then Error_Msg_N ("!static expression must have scalar or string type " & "(RM 4.9(2))", N); return; end if; end if; -- If we got through those checks, test particular node kind case Nkind (N) is -- Entity name when N_Expanded_Name | N_Identifier | N_Operator_Symbol => E := Entity (N); if Is_Named_Number (E) then null; elsif Ekind (E) = E_Constant then -- One case we can give a metter message is when we have a -- string literal created by concatenating an aggregate with -- an others expression. Entity_Case : declare CV : constant Node_Id := Constant_Value (E); CO : constant Node_Id := Original_Node (CV); function Is_Aggregate (N : Node_Id) return Boolean; -- See if node N came from an others aggregate, if so -- return True and set Error_Msg_Sloc to aggregate. ------------------ -- Is_Aggregate -- ------------------ function Is_Aggregate (N : Node_Id) return Boolean is begin if Nkind (Original_Node (N)) = N_Aggregate then Error_Msg_Sloc := Sloc (Original_Node (N)); return True; elsif Is_Entity_Name (N) and then Ekind (Entity (N)) = E_Constant and then Nkind (Original_Node (Constant_Value (Entity (N)))) = N_Aggregate then Error_Msg_Sloc := Sloc (Original_Node (Constant_Value (Entity (N)))); return True; else return False; end if; end Is_Aggregate; -- Start of processing for Entity_Case begin if Is_Aggregate (CV) or else (Nkind (CO) = N_Op_Concat and then (Is_Aggregate (Left_Opnd (CO)) or else Is_Aggregate (Right_Opnd (CO)))) then Error_Msg_N ("!aggregate (#) is never static", N); elsif No (CV) or else not Is_Static_Expression (CV) then Error_Msg_NE ("!& is not a static constant (RM 4.9(5))", N, E); end if; end Entity_Case; elsif Is_Type (E) then Error_Msg_NE ("!& is not a static subtype (RM 4.9(26))", N, E); else Error_Msg_NE ("!& is not static constant or named number " & "(RM 4.9(5))", N, E); end if; -- Binary operator when N_Binary_Op | N_Membership_Test | N_Short_Circuit => if Nkind (N) in N_Op_Shift then Error_Msg_N ("!shift functions are never static (RM 4.9(6,18))", N); else Why_Not_Static (Left_Opnd (N)); Why_Not_Static (Right_Opnd (N)); end if; -- Unary operator when N_Unary_Op => Why_Not_Static (Right_Opnd (N)); -- Attribute reference when N_Attribute_Reference => Why_Not_Static_List (Expressions (N)); E := Etype (Prefix (N)); if E = Standard_Void_Type then return; end if; -- Special case non-scalar'Size since this is a common error if Attribute_Name (N) = Name_Size then Error_Msg_N ("!size attribute is only static for static scalar type " & "(RM 4.9(7,8))", N); -- Flag array cases elsif Is_Array_Type (E) then if Attribute_Name (N) not in Name_First | Name_Last | Name_Length then Error_Msg_N ("!static array attribute must be Length, First, or Last " & "(RM 4.9(8))", N); -- Since we know the expression is not-static (we already -- tested for this, must mean array is not static). else Error_Msg_N ("!prefix is non-static array (RM 4.9(8))", Prefix (N)); end if; return; -- Special case generic types, since again this is a common source -- of confusion. elsif Is_Generic_Actual_Type (E) or else Is_Generic_Type (E) then Error_Msg_N ("!attribute of generic type is never static " & "(RM 4.9(7,8))", N); elsif Is_OK_Static_Subtype (E) then null; elsif Is_Scalar_Type (E) then Error_Msg_N ("!prefix type for attribute is not static scalar subtype " & "(RM 4.9(7))", N); else Error_Msg_N ("!static attribute must apply to array/scalar type " & "(RM 4.9(7,8))", N); end if; -- String literal when N_String_Literal => Error_Msg_N ("!subtype of string literal is non-static (RM 4.9(4))", N); -- Explicit dereference when N_Explicit_Dereference => Error_Msg_N ("!explicit dereference is never static (RM 4.9)", N); -- Function call when N_Function_Call => Why_Not_Static_List (Parameter_Associations (N)); -- Complain about non-static function call unless we have Bignum -- which means that the underlying expression is really some -- scalar arithmetic operation. if not Is_RTE (Typ, RE_Bignum) then Error_Msg_N ("!non-static function call (RM 4.9(6,18))", N); end if; -- Parameter assocation (test actual parameter) when N_Parameter_Association => Why_Not_Static (Explicit_Actual_Parameter (N)); -- Indexed component when N_Indexed_Component => Error_Msg_N ("!indexed component is never static (RM 4.9)", N); -- Procedure call when N_Procedure_Call_Statement => Error_Msg_N ("!procedure call is never static (RM 4.9)", N); -- Qualified expression (test expression) when N_Qualified_Expression => Why_Not_Static (Expression (N)); -- Aggregate when N_Aggregate | N_Extension_Aggregate => Error_Msg_N ("!an aggregate is never static (RM 4.9)", N); -- Range when N_Range => Why_Not_Static (Low_Bound (N)); Why_Not_Static (High_Bound (N)); -- Range constraint, test range expression when N_Range_Constraint => Why_Not_Static (Range_Expression (N)); -- Subtype indication, test constraint when N_Subtype_Indication => Why_Not_Static (Constraint (N)); -- Selected component when N_Selected_Component => Error_Msg_N ("!selected component is never static (RM 4.9)", N); -- Slice when N_Slice => Error_Msg_N ("!slice is never static (RM 4.9)", N); when N_Type_Conversion => Why_Not_Static (Expression (N)); if not Is_Scalar_Type (Entity (Subtype_Mark (N))) or else not Is_OK_Static_Subtype (Entity (Subtype_Mark (N))) then Error_Msg_N ("!static conversion requires static scalar subtype result " & "(RM 4.9(9))", N); end if; -- Unchecked type conversion when N_Unchecked_Type_Conversion => Error_Msg_N ("!unchecked type conversion is never static (RM 4.9)", N); -- All other cases, no reason to give when others => null; end case; end Why_Not_Static; end Sem_Eval;

34.361834

79

0.563758

a1c8b7497f08b65b33f6619e09e4ddb9f4b1c97d

1,295

ads

Ada

build_gnu/binutils/gdb/testsuite/gdb.ada/interface/types.ads

jed-frey/e200-gcc

df1421b421a8ec8729d70791129f5283dee5f9ea

[ "BSD-3-Clause" ]

1

2017-05-31T21:42:12.000Z

build_gnu/binutils/gdb/testsuite/gdb.ada/interface/types.ads

jed-frey/e200-gcc

df1421b421a8ec8729d70791129f5283dee5f9ea

[ "BSD-3-Clause" ]

null

build_gnu/binutils/gdb/testsuite/gdb.ada/interface/types.ads

jed-frey/e200-gcc

df1421b421a8ec8729d70791129f5283dee5f9ea

[ "BSD-3-Clause" ]

1

2019-12-17T22:04:07.000Z

-- Copyright 2008-2014 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- This program is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. package Types is type Object_Int is interface; type Another_Int is interface; type Object_Root is abstract tagged record X : Natural; Y : Natural; end record; type Object is abstract new Object_Root and Object_Int and Another_Int with null record; function Ident (O : Object'Class) return Object'Class; procedure Do_Nothing (O : in out Object'Class); type Rectangle is new Object with record W : Natural; H : Natural; end record; type Circle is new Object with record R : Natural; end record; end Types;

30.116279

73

0.712741

a1d4c1d00cd2b519d5541ad0f25ccc7a69d64893

13,547

adb

Ada

thirdparty/adasdl/thin/adasdl/AdaSDL/stdtest/testpalette.adb

Lucretia/old_nehe_ada95

d0378c3bfce202eb01bf00b57c128735dbe8582d

[ "BSD-3-Clause" ]

null

thirdparty/adasdl/thin/adasdl/AdaSDL/stdtest/testpalette.adb

Lucretia/old_nehe_ada95

d0378c3bfce202eb01bf00b57c128735dbe8582d

[ "BSD-3-Clause" ]

null

thirdparty/adasdl/thin/adasdl/AdaSDL/stdtest/testpalette.adb

Lucretia/old_nehe_ada95

d0378c3bfce202eb01bf00b57c128735dbe8582d

[ "BSD-3-Clause" ]

null

-- ----------------------------------------------------------------- -- -- -- -- This is free software; you can redistribute it and/or -- -- modify it under the terms of the GNU General Public -- -- License as published by the Free Software Foundation; either -- -- version 2 of the License, or (at your option) any later version. -- -- -- -- This software is distributed in the hope that it will be useful, -- -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -- -- General Public License for more details. -- -- -- -- You should have received a copy of the GNU General Public -- -- License along with this library; if not, write to the -- -- Free Software Foundation, Inc., 59 Temple Place - Suite 330, -- -- Boston, MA 02111-1307, USA. -- -- -- -- ----------------------------------------------------------------- -- -- ----------------------------------------------------------------- -- -- This is a translation, to the Ada programming language, of the -- -- original C test files written by Sam Lantinga - www.libsdl.org -- -- translation made by Antonio F. Vargas - www.adapower.net/~avargas -- -- ----------------------------------------------------------------- -- -- ----------------------------------------------------------------- -- -- WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING -- ----------------------------------------------------------------- -- -- SERIOUS WARNING: The Ada code in this files may, at some points, -- rely directly on pointer arithmetic which is considered very -- unsafe and PRONE TO ERROR. The AdaSDL_Framebuffer examples are -- more appropriate and easier to understand. They should be used in -- replacement of this files. Please go there. -- This file exists only for the sake of completness and to test -- AdaSDL without the dependency of AdaSDL_Framebuffer. -- ----------------------------------------------------------------- -- -- WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING -- ----------------------------------------------------------------- -- with Interfaces.C; with Ada.Command_Line; with Ada.Text_IO; use Ada.Text_IO; with Ada.Float_Text_IO; use Ada.Float_Text_IO; with Ada.Numerics.Generic_Elementary_Functions; with GNAT.OS_Lib; use GNAT.OS_Lib; with SDL.Quit; with SDL.Error; with SDL.Types; use SDL.Types; with SDL.Timer; with SDL.Events; with TestPalette_Sprogs; use TestPalette_Sprogs; procedure TestPalette is -- ====================================== package It renames Interfaces; use type It.Unsigned_32; package C renames Interfaces.C; use type C.int; use type C.size_t; use type C.unsigned; use type C.C_float; package CL renames Ada.Command_Line; package Er renames SDL.Error; package Ev renames SDL.Events; use type Ev.Event_Type; package T renames SDL.Timer; use type V.Surface_Flags; use type V.Surface_ptr; use Random_Integer; use V.Color_PtrOps; package M is new Ada.Numerics.Generic_Elementary_Functions (C.C_float); screen, bg : V.Surface_ptr; type boat_Array is array (0 .. 1) of V.Surface_ptr; boat : boat_Array; vidflags : V.Surface_Flags := 0; start : C.unsigned; fade_max : C.int := 400; fade_level, fade_dir : C.int; boatcols, frames, red : C.int; type boats_Array is array (C.unsigned range 0 .. NBOATS - 1) of C.int; boatx, boaty, boatdir : boats_Array; gamma_fade : C.int := 0; gamma_ramp : C.int := 0; argc : Integer := CL.Argument_Count; begin if SDL.Init (SDL.INIT_VIDEO) < 0 then sdlerr ("initializing SDL"); end if; SDL.Quit.atexit (SDL.SDL_Quit'Access); while argc > 0 loop if CL.Argument (argc) = "-hw" then vidflags := vidflags or V.HWSURFACE; argc := argc - 1; elsif CL.Argument (argc) = "-fullscreen" then vidflags := vidflags or V.FULLSCREEN; argc := argc - 1; elsif CL.Argument (argc) = "-nofade" then fade_max := 1; argc := argc - 1; elsif CL.Argument (argc) = "-gamma" then gamma_fade := 1; argc := argc - 1; elsif CL.Argument (argc) = "-gammaramp" then gamma_ramp := 1; argc := argc - 1; else Put_Line ("Usage: testpalette" & "[-hw] [-fullscreen] [-nofade] [-gamma] " & "[-gammaramp]"); GNAT.OS_Lib.OS_Exit (1); end if; end loop; -- Ask explicitly for 8bpp and a hardware palette screen := V.SetVideoMode (SCRW, SCRH, 8, vidflags or V.HWPALETTE); if screen = null then Put_Line ("error setting " & Integer'Image (SCRW) & " " & Integer'Image (SCRH) & " " & Er.Get_Error); GNAT.OS_Lib.OS_Exit (1); end if; boat (0) := V.LoadBMP (CS.New_String ("sail.bmp")); if boat (0) = null then sdlerr ("loading sail.bmp"); end if; -- We've chosen magenta (#ff00ff) as colour key for the boat V.SetColorKey (boat (0), V.SRCCOLORKEY or V.RLEACCEL, V.MapRGB (boat (0).format, 16#FF#, 16#00#, 16#FF#)); boatcols := boat (0).format.palette.ncolors; boat (1) := hflip (boat (0)); V.SetColorKey (boat (1), V.SRCCOLORKEY or V.RLEACCEL, V.MapRGB (boat (1).format, 16#FF#, 16#00#, 16#FF#)); -- First set the physical screen palette to black, so the user won't -- see our initial drawing on the screen. cmap := (others => (0,0,0,0)); V.SetPalette (screen, V.PHYSPAL, cmap, C.int(cmap'First), C.int(cmap'Length)); -- Proper palette management is important when playing games with the -- colormap. We have divided the palette as follows: -- -- index 0..(boatcols-1): used for the boat -- index boatcols..(boatcols+63): used for the waves V.SetPalette (screen, V.LOGPAL, boat (0).format.palette.colors, 0, boatcols); V.SetPalette (screen, V.LOGPAL, wavemap (0)'Access, boatcols, 64); -- Now the logical screen palette is set, and will remain unchanged. -- The boats already have the same palette so fast blits can be used. V.Color_PtrOps.Copy_Array (Pointer (screen.format.palette.colors), cmap (0)'Access, 256); -- save the index of the red colour for later red := C.int (V.MapRGB (screen.format, 16#FF#, 16#00#, 16#00#)); bg := make_bg (screen, boatcols); -- make a nice wavy background surface -- initial screen contents if V.BlitSurface (bg, null, screen, null) < 0 then sdlerr ("blitting background to screen"); end if; -- actually put the background on screen V.Flip (screen); -- actually put the background on screen -- determine initial boat placements for i in C.unsigned range 0 .. NBOATS - 1 loop boatx (i) := (C.int (Random (Integer_Generator)) mod (SCRW + boat (0).w)) - boat (0).w; boaty (i) := C.int (i) * (SCRH - boat (0).h) / (NBOATS - 1); boatdir (i) := C.int ( It.Shift_Right ( It.Unsigned_32 (Random (Integer_Generator)), 5) and 1) * 2 - 1; end loop; start := C.unsigned (T.GetTicks); frames := 0; fade_dir := 1; fade_level := 0; loop declare e : aliased Ev.Event; updates : V.Rects_Array (0 .. NBOATS - 1); r : aliased V.Rect; redphase : C.int; begin -- A small event loop: just exit on any key or mouse button event while Ev.PollEvent (e'Access) /= 0 loop if (e.the_type = Ev.KEYDOWN) or (e.the_type = Ev.QUIT) or (e.the_type = Ev.MOUSEBUTTONDOWN) then if fade_dir < 0 then fade_level := 0; end if; fade_dir := -1; end if; end loop; -- move boats for i in C.unsigned range 0 .. NBOATS - 1 loop declare old_x : C.int := boatx (i); begin -- update boat position boatx (i) := boatx (i) + boatdir (i) * SPEED; if (boatx (i) <= -boat (0).w) or (boatx (i) >= SCRW) then boatdir (i) := -boatdir (i); end if; -- paint over old boat position r.x := Sint16 (old_x); r.y := Sint16 (boaty (i)); r.w := Uint16 (boat (0).w); r.h := Uint16 (boat (0).h); if V.BlitSurface (bg, r, screen, r) < 0 then sdlerr ("blitting background"); end if; -- construct update rectangle (bounding box of old and new pos) updates (i).x := Sint16 (C.int'Min (old_x, boatx (i))); updates (i).y := Sint16 (boaty (i)); updates (i).w := Uint16 (boat (0).w + SPEED); updates (i).h := Uint16 (boat (0).h); -- clip update rectangle to screen if updates (i).x < 0 then updates (i).w := Uint16 ( Integer(updates (i).w) + Integer (updates (i).x)); updates (i).x := 0; end if; if C.int (updates (i).x) + C.int (updates (i).w) > SCRW then updates (i).w := Uint16 (SCRW - updates (i).x); end if; end; -- declare end loop; -- move boats for i in C.unsigned range 0 .. NBOATS - 1 loop -- paint boat on new position r.x := Sint16 (boatx (i)); r.y := Sint16 (boaty (i)); if V.BlitSurface (boat (Integer((boatdir (i) + 1) / 2)), null, screen, r) < 0 then sdlerr ("blitting boat"); end if; end loop; -- cycle wave palette for i in 0 .. 63 loop cmap (C.size_t (boatcols) + C.size_t ((It.Unsigned_32 (C.int (i) + frames) and 63))) := wavemap (i); end loop; if fade_dir /= 0 then -- Fade the entire palette in/out fade_level := fade_level + fade_dir; if gamma_fade /= 0 then -- Fade linearly in gamma level (lousy) declare level : C.C_float := C.C_float (fade_level) / C.C_float (fade_max); begin if V.SetGamma (level, level, level) < 0 then sdlerr ("setting gamma"); end if; end; elsif gamma_ramp /= 0 then -- Fade using gamma ramp (better) declare ramp : V.ramp_Array; begin for i in Natural range 0 .. 255 loop ramp (i) := Uint16 ( It.Shift_Left ( It.Unsigned_32 (C.int (i) * fade_level / fade_max), 8)); end loop; if V.SetGammaRamp (ramp, ramp, ramp) < 0 then sdlerr ("setting gamma ramp"); end if; end; -- declare else -- Fade using direct palette manipulation (best) V.Color_PtrOps.Copy_Array ( Pointer (screen.format.palette.colors), cmap (0)'Access, C.ptrdiff_t (boatcols)); for i in C.size_t range 0 .. C.size_t (boatcols + 63) loop cmap (i).r := Uint8 (C.C_float (cmap (i).r) * C.C_float (fade_level) / C.C_float (fade_max)); cmap (i).g := Uint8 (C.C_float (cmap (i).g) * C.C_float (fade_level) / C.C_float (fade_max)); cmap (i).b := Uint8 (C.C_float (cmap (i).b) * C.C_float (fade_level) / C.C_float (fade_max)); end loop; end if; if fade_level = fade_max then fade_dir := 0; end if; end if; -- pulse the red colour (done after the fade, for a night effect) redphase := frames mod 64; cmap (C.size_t (red)).r := Uint8 ( C.C_float (255) * M.Sin (C.C_float (redphase) * C.C_float (Ada.Numerics.Pi) / C.C_float (64))); V.SetPalette (screen, V.PHYSPAL, cmap (0)'Access, 0, boatcols + 64); -- update changed ares of the screen V.UpdateRects (screen, updates'Length, updates); frames := frames + 1; exit when fade_level <= 0; end; end loop; Put (C.int'Image (frames) & " frames, "); Put (Float (1000.0) * Float (frames) / Float (T.GetTicks - Uint32 (start)) ,3, 2, 0); Put_Line (" fps"); end TestPalette;

40.927492

90

0.494796

2f17d9312032c0fd2cb3dd71b68c8df333bf1769

8,983

adb

Ada

source/amf/uml/amf-internals-uml_exception_handlers.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/uml/amf-internals-uml_exception_handlers.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/uml/amf-internals-uml_exception_handlers.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2012, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ with AMF.Elements; with AMF.Internals.Element_Collections; with AMF.Internals.Helpers; with AMF.Internals.Tables.UML_Attributes; with AMF.Visitors.UML_Iterators; with AMF.Visitors.UML_Visitors; package body AMF.Internals.UML_Exception_Handlers is ------------------- -- Enter_Element -- ------------------- overriding procedure Enter_Element (Self : not null access constant UML_Exception_Handler_Proxy; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control) is begin if Visitor in AMF.Visitors.UML_Visitors.UML_Visitor'Class then AMF.Visitors.UML_Visitors.UML_Visitor'Class (Visitor).Enter_Exception_Handler (AMF.UML.Exception_Handlers.UML_Exception_Handler_Access (Self), Control); end if; end Enter_Element; ------------------- -- Leave_Element -- ------------------- overriding procedure Leave_Element (Self : not null access constant UML_Exception_Handler_Proxy; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control) is begin if Visitor in AMF.Visitors.UML_Visitors.UML_Visitor'Class then AMF.Visitors.UML_Visitors.UML_Visitor'Class (Visitor).Leave_Exception_Handler (AMF.UML.Exception_Handlers.UML_Exception_Handler_Access (Self), Control); end if; end Leave_Element; ------------------- -- Visit_Element -- ------------------- overriding procedure Visit_Element (Self : not null access constant UML_Exception_Handler_Proxy; Iterator : in out AMF.Visitors.Abstract_Iterator'Class; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control) is begin if Iterator in AMF.Visitors.UML_Iterators.UML_Iterator'Class then AMF.Visitors.UML_Iterators.UML_Iterator'Class (Iterator).Visit_Exception_Handler (Visitor, AMF.UML.Exception_Handlers.UML_Exception_Handler_Access (Self), Control); end if; end Visit_Element; ------------------------- -- Get_Exception_Input -- ------------------------- overriding function Get_Exception_Input (Self : not null access constant UML_Exception_Handler_Proxy) return AMF.UML.Object_Nodes.UML_Object_Node_Access is begin return AMF.UML.Object_Nodes.UML_Object_Node_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.UML_Attributes.Internal_Get_Exception_Input (Self.Element))); end Get_Exception_Input; ------------------------- -- Set_Exception_Input -- ------------------------- overriding procedure Set_Exception_Input (Self : not null access UML_Exception_Handler_Proxy; To : AMF.UML.Object_Nodes.UML_Object_Node_Access) is begin AMF.Internals.Tables.UML_Attributes.Internal_Set_Exception_Input (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_Exception_Input; ------------------------ -- Get_Exception_Type -- ------------------------ overriding function Get_Exception_Type (Self : not null access constant UML_Exception_Handler_Proxy) return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is begin return AMF.UML.Classifiers.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.UML_Attributes.Internal_Get_Exception_Type (Self.Element))); end Get_Exception_Type; ---------------------- -- Get_Handler_Body -- ---------------------- overriding function Get_Handler_Body (Self : not null access constant UML_Exception_Handler_Proxy) return AMF.UML.Executable_Nodes.UML_Executable_Node_Access is begin return AMF.UML.Executable_Nodes.UML_Executable_Node_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.UML_Attributes.Internal_Get_Handler_Body (Self.Element))); end Get_Handler_Body; ---------------------- -- Set_Handler_Body -- ---------------------- overriding procedure Set_Handler_Body (Self : not null access UML_Exception_Handler_Proxy; To : AMF.UML.Executable_Nodes.UML_Executable_Node_Access) is begin AMF.Internals.Tables.UML_Attributes.Internal_Set_Handler_Body (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_Handler_Body; ------------------------ -- Get_Protected_Node -- ------------------------ overriding function Get_Protected_Node (Self : not null access constant UML_Exception_Handler_Proxy) return AMF.UML.Executable_Nodes.UML_Executable_Node_Access is begin return AMF.UML.Executable_Nodes.UML_Executable_Node_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.UML_Attributes.Internal_Get_Protected_Node (Self.Element))); end Get_Protected_Node; ------------------------ -- Set_Protected_Node -- ------------------------ overriding procedure Set_Protected_Node (Self : not null access UML_Exception_Handler_Proxy; To : AMF.UML.Executable_Nodes.UML_Executable_Node_Access) is begin AMF.Internals.Tables.UML_Attributes.Internal_Set_Protected_Node (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_Protected_Node; end AMF.Internals.UML_Exception_Handlers;

42.980861

78

0.558833

0eb48c87f273d10e29b382bac7785641d772d1d4

3,218

adb

Ada

gdb/testsuite/gdb.ada/operator_bp/ops.adb

greyblue9/binutils-gdb

05377632b124fe7600eea7f4ee0e9a35d1b0cbdc

[ "BSD-3-Clause" ]

1

2020-10-14T03:24:35.000Z

gdb/testsuite/gdb.ada/operator_bp/ops.adb

greyblue9/binutils-gdb

05377632b124fe7600eea7f4ee0e9a35d1b0cbdc

[ "BSD-3-Clause" ]

null

gdb/testsuite/gdb.ada/operator_bp/ops.adb

greyblue9/binutils-gdb

05377632b124fe7600eea7f4ee0e9a35d1b0cbdc

[ "BSD-3-Clause" ]

null

-- Copyright 2012-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/>. package body Ops is function Make (X: Natural) return Int is begin return Int (X); end Make; function "+" (I1, I2 : Int) return Int is begin return Int (IntRep (I1) + IntRep (I2)); end; function "-" (I1, I2 : Int) return Int is begin return Int (IntRep (I1) - IntRep (I2)); end; function "*" (I1, I2 : Int) return Int is begin return Int (IntRep (I1) * IntRep (I2)); end; function "/" (I1, I2 : Int) return Int is begin return Int (IntRep (I1) / IntRep (I2)); end; function "mod" (I1, I2 : Int) return Int is begin return Int (IntRep (I1) mod IntRep (I2)); end; function "rem" (I1, I2 : Int) return Int is begin return Int (IntRep (I1) rem IntRep (I2)); end; function "**" (I1, I2 : Int) return Int is Result : IntRep := 1; begin for J in 1 .. IntRep (I2) loop Result := IntRep (I1) * Result; end loop; return Int (Result); end; function "<" (I1, I2 : Int) return Boolean is begin return IntRep (I1) < IntRep (I2); end; function "<=" (I1, I2 : Int) return Boolean is begin return IntRep (I1) <= IntRep (I2); end; function ">" (I1, I2 : Int) return Boolean is begin return IntRep (I1) > IntRep (I2); end; function ">=" (I1, I2 : Int) return Boolean is begin return IntRep (I1) >= IntRep (I2); end; function "=" (I1, I2 : Int) return Boolean is begin return IntRep (I1) = IntRep (I2); end; function "and" (I1, I2 : Int) return Int is begin return Int (IntRep (I1) and IntRep (I2)); end; function "or" (I1, I2 : Int) return Int is begin return Int (IntRep (I1) or IntRep (I2)); end; function "xor" (I1, I2 : Int) return Int is begin return Int (IntRep (I1) xor IntRep (I2)); end; function "&" (I1, I2 : Int) return Int is begin return Int (IntRep (I1) and IntRep (I2)); end; function "abs" (I1 : Int) return Int is begin return Int (abs IntRep (I1)); end; function "not" (I1 : Int) return Int is begin return Int (not IntRep (I1)); end; function "+" (I1 : Int) return Int is begin return Int (IntRep (I1)); end; function "-" (I1 : Int) return Int is begin return Int (-IntRep (I1)); end; procedure Dummy (I1 : Int) is begin null; end Dummy; procedure Dummy (B1 : Boolean) is begin null; end Dummy; end Ops;

22.822695

73

0.596644

a13ee668e278f0abe715bc343427b8a62609105c

3,812

adb

Ada

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

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

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

null

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

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

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

null

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

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

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

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S Y S T E M . W C H _ C O N -- -- -- -- B o d y -- -- -- -- Copyright (C) 2005-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. -- -- -- ------------------------------------------------------------------------------ pragma Compiler_Unit_Warning; package body System.WCh_Con is ---------------------------- -- Get_WC_Encoding_Method -- ---------------------------- function Get_WC_Encoding_Method (C : Character) return WC_Encoding_Method is begin for Method in WC_Encoding_Method loop if C = WC_Encoding_Letters (Method) then return Method; end if; end loop; raise Constraint_Error; end Get_WC_Encoding_Method; function Get_WC_Encoding_Method (S : String) return WC_Encoding_Method is begin if S = "hex" then return WCEM_Hex; elsif S = "upper" then return WCEM_Upper; elsif S = "shift_jis" then return WCEM_Shift_JIS; elsif S = "euc" then return WCEM_EUC; elsif S = "utf8" then return WCEM_UTF8; elsif S = "brackets" then return WCEM_Brackets; else raise Constraint_Error; end if; end Get_WC_Encoding_Method; -------------------------- -- Is_Start_Of_Encoding -- -------------------------- function Is_Start_Of_Encoding (C : Character; EM : WC_Encoding_Method) return Boolean is begin return (EM in WC_Upper_Half_Encoding_Method and then Character'Pos (C) >= 16#80#) or else (EM in WC_ESC_Encoding_Method and then C = ASCII.ESC); end Is_Start_Of_Encoding; end System.WCh_Con;

44.847059

79

0.447009

31b2e609ab34d6649429c3d6d05213777ea5b1ff

31,953

adb

Ada

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

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

69

2015-01-02T10:45:56.000Z

2021-09-06T07:52:13.000Z

------------------------------------------------------------------------------ -- -- -- GNU ADA RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- S Y S T E M . T A S K _ P R I M I T I V E S . O P E R A T I O N S -- -- -- -- B o d y -- -- -- -- $Revision$ -- -- -- Copyright (C) 1991-2001, Florida State University -- -- -- -- GNARL is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNARL is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNARL; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNARL was developed by the GNARL team at Florida State University. It is -- -- now maintained by Ada Core Technologies Inc. in cooperation with Florida -- -- State University (http://www.gnat.com). -- -- -- ------------------------------------------------------------------------------ -- This is a GNU/Linux (GNU/LinuxThreads) version of this package -- This package contains all the GNULL primitives that interface directly -- with the underlying OS. pragma Polling (Off); -- Turn off polling, we do not want ATC polling to take place during -- tasking operations. It causes infinite loops and other problems. with System.Tasking.Debug; -- used for Known_Tasks with Interfaces.C; -- used for int -- size_t with System.Interrupt_Management; -- used for Keep_Unmasked -- Abort_Task_Interrupt -- Interrupt_ID with System.Interrupt_Management.Operations; -- used for Set_Interrupt_Mask -- All_Tasks_Mask pragma Elaborate_All (System.Interrupt_Management.Operations); with System.Parameters; -- used for Size_Type with System.Tasking; -- used for Ada_Task_Control_Block -- Task_ID with Ada.Exceptions; -- used for Raise_Exception -- Raise_From_Signal_Handler -- Exception_Id with System.Soft_Links; -- used for Defer/Undefer_Abort -- Note that we do not use System.Tasking.Initialization directly since -- this is a higher level package that we shouldn't depend on. For example -- when using the restricted run time, it is replaced by -- System.Tasking.Restricted.Initialization with System.OS_Primitives; -- used for Delay_Modes with System.Soft_Links; -- used for Get_Machine_State_Addr with Unchecked_Conversion; with Unchecked_Deallocation; package body System.Task_Primitives.Operations is use System.Tasking.Debug; use System.Tasking; use Interfaces.C; use System.OS_Interface; use System.Parameters; use System.OS_Primitives; package SSL renames System.Soft_Links; ------------------ -- Local Data -- ------------------ Max_Stack_Size : constant := 2000 * 1024; -- GNU/LinuxThreads does not return an error value when requesting -- a task stack size which is too large, so we have to check this -- ourselves. -- The followings are logically constants, but need to be initialized -- at run time. ATCB_Key : aliased pthread_key_t; -- Key used to find the Ada Task_ID associated with a thread All_Tasks_L : aliased System.Task_Primitives.RTS_Lock; -- See comments on locking rules in System.Tasking (spec). Environment_Task_ID : Task_ID; -- A variable to hold Task_ID for the environment task. Unblocked_Signal_Mask : aliased sigset_t; -- The set of signals that should unblocked in all tasks -- The followings are internal configuration constants needed. Priority_Ceiling_Emulation : constant Boolean := True; Next_Serial_Number : Task_Serial_Number := 100; -- We start at 100, to reserve some special values for -- using in error checking. -- The following are internal configuration constants needed. Time_Slice_Val : Integer; pragma Import (C, Time_Slice_Val, "__gl_time_slice_val"); Dispatching_Policy : Character; pragma Import (C, Dispatching_Policy, "__gl_task_dispatching_policy"); FIFO_Within_Priorities : constant Boolean := Dispatching_Policy = 'F'; -- Indicates whether FIFO_Within_Priorities is set. -- The following are effectively constants, but they need to -- be initialized by calling a pthread_ function. Mutex_Attr : aliased pthread_mutexattr_t; Cond_Attr : aliased pthread_condattr_t; ----------------------- -- Local Subprograms -- ----------------------- subtype unsigned_short is Interfaces.C.unsigned_short; subtype unsigned_long is Interfaces.C.unsigned_long; procedure Abort_Handler (signo : Signal; gs : unsigned_short; fs : unsigned_short; es : unsigned_short; ds : unsigned_short; edi : unsigned_long; esi : unsigned_long; ebp : unsigned_long; esp : unsigned_long; ebx : unsigned_long; edx : unsigned_long; ecx : unsigned_long; eax : unsigned_long; trapno : unsigned_long; err : unsigned_long; eip : unsigned_long; cs : unsigned_short; eflags : unsigned_long; esp_at_signal : unsigned_long; ss : unsigned_short; fpstate : System.Address; oldmask : unsigned_long; cr2 : unsigned_long); function To_Task_ID is new Unchecked_Conversion (System.Address, Task_ID); function To_Address is new Unchecked_Conversion (Task_ID, System.Address); function To_pthread_t is new Unchecked_Conversion (Integer, System.OS_Interface.pthread_t); ------------------- -- Abort_Handler -- ------------------- -- Target-dependent binding of inter-thread Abort signal to -- the raising of the Abort_Signal exception. -- The technical issues and alternatives here are essentially -- the same as for raising exceptions in response to other -- signals (e.g. Storage_Error). See code and comments in -- the package body System.Interrupt_Management. -- Some implementations may not allow an exception to be propagated -- out of a handler, and others might leave the signal or -- interrupt that invoked this handler masked after the exceptional -- return to the application code. -- GNAT exceptions are originally implemented using setjmp()/longjmp(). -- On most UNIX systems, this will allow transfer out of a signal handler, -- which is usually the only mechanism available for implementing -- asynchronous handlers of this kind. However, some -- systems do not restore the signal mask on longjmp(), leaving the -- abort signal masked. -- Alternative solutions include: -- 1. Change the PC saved in the system-dependent Context -- parameter to point to code that raises the exception. -- Normal return from this handler will then raise -- the exception after the mask and other system state has -- been restored (see example below). -- 2. Use siglongjmp()/sigsetjmp() to implement exceptions. -- 3. Unmask the signal in the Abortion_Signal exception handler -- (in the RTS). -- Note that with the new exception mechanism, it is not correct to -- simply "raise" an exception from a signal handler, that's why we -- use Raise_From_Signal_Handler procedure Abort_Handler (signo : Signal; gs : unsigned_short; fs : unsigned_short; es : unsigned_short; ds : unsigned_short; edi : unsigned_long; esi : unsigned_long; ebp : unsigned_long; esp : unsigned_long; ebx : unsigned_long; edx : unsigned_long; ecx : unsigned_long; eax : unsigned_long; trapno : unsigned_long; err : unsigned_long; eip : unsigned_long; cs : unsigned_short; eflags : unsigned_long; esp_at_signal : unsigned_long; ss : unsigned_short; fpstate : System.Address; oldmask : unsigned_long; cr2 : unsigned_long) is Self_Id : Task_ID := Self; Result : Interfaces.C.int; Old_Set : aliased sigset_t; function To_Machine_State_Ptr is new Unchecked_Conversion (Address, Machine_State_Ptr); -- These are not directly visible procedure Raise_From_Signal_Handler (E : Ada.Exceptions.Exception_Id; M : System.Address); pragma Import (Ada, Raise_From_Signal_Handler, "ada__exceptions__raise_from_signal_handler"); pragma No_Return (Raise_From_Signal_Handler); mstate : Machine_State_Ptr; message : aliased constant String := "" & ASCII.Nul; -- a null terminated String. begin if Self_Id.Deferral_Level = 0 and then Self_Id.Pending_ATC_Level < Self_Id.ATC_Nesting_Level and then not Self_Id.Aborting then Self_Id.Aborting := True; -- Make sure signals used for RTS internal purpose are unmasked Result := pthread_sigmask (SIG_UNBLOCK, Unblocked_Signal_Mask'Unchecked_Access, Old_Set'Unchecked_Access); pragma Assert (Result = 0); mstate := To_Machine_State_Ptr (SSL.Get_Machine_State_Addr.all); mstate.eip := eip; mstate.ebx := ebx; mstate.esp := esp_at_signal; mstate.ebp := ebp; mstate.esi := esi; mstate.edi := edi; Raise_From_Signal_Handler (Standard'Abort_Signal'Identity, message'Address); end if; end Abort_Handler; ------------------- -- Stack_Guard -- ------------------- -- The underlying thread system extends the memory (up to 2MB) when -- needed. procedure Stack_Guard (T : ST.Task_ID; On : Boolean) is begin null; end Stack_Guard; -------------------- -- Get_Thread_Id -- -------------------- function Get_Thread_Id (T : ST.Task_ID) return OSI.Thread_Id is begin return T.Common.LL.Thread; end Get_Thread_Id; ---------- -- Self -- ---------- function Self return Task_ID is Result : System.Address; begin Result := pthread_getspecific (ATCB_Key); pragma Assert (Result /= System.Null_Address); return To_Task_ID (Result); end Self; --------------------- -- Initialize_Lock -- --------------------- -- Note: mutexes and cond_variables needed per-task basis are -- initialized in Initialize_TCB and the Storage_Error is -- handled. Other mutexes (such as All_Tasks_Lock, Memory_Lock...) -- used in RTS is initialized before any status change of RTS. -- Therefore rasing Storage_Error in the following routines -- should be able to be handled safely. procedure Initialize_Lock (Prio : System.Any_Priority; L : access Lock) is Result : Interfaces.C.int; begin if Priority_Ceiling_Emulation then L.Ceiling := Prio; end if; Result := pthread_mutex_init (L.L'Access, Mutex_Attr'Access); pragma Assert (Result = 0 or else Result = ENOMEM); if Result = ENOMEM then Ada.Exceptions.Raise_Exception (Storage_Error'Identity, "Failed to allocate a lock"); end if; end Initialize_Lock; procedure Initialize_Lock (L : access RTS_Lock; Level : Lock_Level) is Result : Interfaces.C.int; begin Result := pthread_mutex_init (L, Mutex_Attr'Access); pragma Assert (Result = 0 or else Result = ENOMEM); if Result = ENOMEM then raise Storage_Error; end if; end Initialize_Lock; ------------------- -- Finalize_Lock -- ------------------- procedure Finalize_Lock (L : access Lock) is Result : Interfaces.C.int; begin Result := pthread_mutex_destroy (L.L'Access); pragma Assert (Result = 0); end Finalize_Lock; procedure Finalize_Lock (L : access RTS_Lock) is Result : Interfaces.C.int; begin Result := pthread_mutex_destroy (L); pragma Assert (Result = 0); end Finalize_Lock; ---------------- -- Write_Lock -- ---------------- procedure Write_Lock (L : access Lock; Ceiling_Violation : out Boolean) is Result : Interfaces.C.int; begin if Priority_Ceiling_Emulation then declare Self_ID : constant Task_ID := Self; begin if Self_ID.Common.LL.Active_Priority > L.Ceiling then Ceiling_Violation := True; return; end if; L.Saved_Priority := Self_ID.Common.LL.Active_Priority; if Self_ID.Common.LL.Active_Priority < L.Ceiling then Self_ID.Common.LL.Active_Priority := L.Ceiling; end if; Result := pthread_mutex_lock (L.L'Access); pragma Assert (Result = 0); Ceiling_Violation := False; end; else Result := pthread_mutex_lock (L.L'Access); Ceiling_Violation := Result = EINVAL; -- assumes the cause of EINVAL is a priority ceiling violation pragma Assert (Result = 0 or else Result = EINVAL); end if; end Write_Lock; procedure Write_Lock (L : access RTS_Lock) is Result : Interfaces.C.int; begin Result := pthread_mutex_lock (L); pragma Assert (Result = 0); end Write_Lock; procedure Write_Lock (T : Task_ID) is Result : Interfaces.C.int; begin Result := pthread_mutex_lock (T.Common.LL.L'Access); pragma Assert (Result = 0); end Write_Lock; --------------- -- Read_Lock -- --------------- procedure Read_Lock (L : access Lock; Ceiling_Violation : out Boolean) is begin Write_Lock (L, Ceiling_Violation); end Read_Lock; ------------ -- Unlock -- ------------ procedure Unlock (L : access Lock) is Result : Interfaces.C.int; begin if Priority_Ceiling_Emulation then declare Self_ID : constant Task_ID := Self; begin Result := pthread_mutex_unlock (L.L'Access); pragma Assert (Result = 0); if Self_ID.Common.LL.Active_Priority > L.Saved_Priority then Self_ID.Common.LL.Active_Priority := L.Saved_Priority; end if; end; else Result := pthread_mutex_unlock (L.L'Access); pragma Assert (Result = 0); end if; end Unlock; procedure Unlock (L : access RTS_Lock) is Result : Interfaces.C.int; -- Beware of any changes to this that might -- require access to the ATCB after the mutex is unlocked. -- This is the last operation performed by a task -- before it allows its ATCB to be deallocated, so it -- MUST NOT refer to the ATCB. begin Result := pthread_mutex_unlock (L); pragma Assert (Result = 0); end Unlock; procedure Unlock (T : Task_ID) is Result : Interfaces.C.int; begin Result := pthread_mutex_unlock (T.Common.LL.L'Access); pragma Assert (Result = 0); end Unlock; ------------- -- Sleep -- ------------- procedure Sleep (Self_ID : Task_ID; Reason : System.Tasking.Task_States) is Result : Interfaces.C.int; begin pragma Assert (Self_ID = Self); Result := pthread_cond_wait (Self_ID.Common.LL.CV'Access, Self_ID.Common.LL.L'Access); -- EINTR is not considered a failure. pragma Assert (Result = 0 or else Result = EINTR); end Sleep; ----------------- -- Timed_Sleep -- ----------------- -- This is for use within the run-time system, so abort is -- assumed to be already deferred, and the caller should be -- holding its own ATCB lock. procedure Timed_Sleep (Self_ID : Task_ID; Time : Duration; Mode : ST.Delay_Modes; Reason : System.Tasking.Task_States; Timedout : out Boolean; Yielded : out Boolean) is Check_Time : constant Duration := Monotonic_Clock; Abs_Time : Duration; Request : aliased timespec; Result : Interfaces.C.int; begin Timedout := True; Yielded := False; if Mode = Relative then Abs_Time := Duration'Min (Time, Max_Sensible_Delay) + Check_Time; else Abs_Time := Duration'Min (Check_Time + Max_Sensible_Delay, Time); end if; if Abs_Time > Check_Time then Request := To_Timespec (Abs_Time); loop exit when Self_ID.Pending_ATC_Level < Self_ID.ATC_Nesting_Level or else Self_ID.Pending_Priority_Change; Result := pthread_cond_timedwait (Self_ID.Common.LL.CV'Access, Self_ID.Common.LL.L'Access, Request'Access); exit when Abs_Time <= Monotonic_Clock; if Result = 0 or Result = EINTR then -- somebody may have called Wakeup for us Timedout := False; exit; end if; pragma Assert (Result = ETIMEDOUT); end loop; end if; end Timed_Sleep; ----------------- -- Timed_Delay -- ----------------- -- This is for use in implementing delay statements, so -- we assume the caller is abort-deferred but is holding -- no locks. procedure Timed_Delay (Self_ID : Task_ID; Time : Duration; Mode : ST.Delay_Modes) is Check_Time : constant Duration := Monotonic_Clock; Abs_Time : Duration; Request : aliased timespec; Result : Interfaces.C.int; begin -- Only the little window between deferring abort and -- locking Self_ID is the reason we need to -- check for pending abort and priority change below! :( SSL.Abort_Defer.all; Write_Lock (Self_ID); if Mode = Relative then Abs_Time := Time + Check_Time; else Abs_Time := Duration'Min (Check_Time + Max_Sensible_Delay, Time); end if; if Abs_Time > Check_Time then Request := To_Timespec (Abs_Time); Self_ID.Common.State := Delay_Sleep; loop if Self_ID.Pending_Priority_Change then Self_ID.Pending_Priority_Change := False; Self_ID.Common.Base_Priority := Self_ID.New_Base_Priority; Set_Priority (Self_ID, Self_ID.Common.Base_Priority); end if; exit when Self_ID.Pending_ATC_Level < Self_ID.ATC_Nesting_Level; Result := pthread_cond_timedwait (Self_ID.Common.LL.CV'Access, Self_ID.Common.LL.L'Access, Request'Access); exit when Abs_Time <= Monotonic_Clock; pragma Assert (Result = 0 or else Result = ETIMEDOUT or else Result = EINTR); end loop; Self_ID.Common.State := Runnable; end if; Unlock (Self_ID); Result := sched_yield; SSL.Abort_Undefer.all; end Timed_Delay; --------------------- -- Monotonic_Clock -- --------------------- function Monotonic_Clock return Duration is TV : aliased struct_timeval; Result : Interfaces.C.int; begin Result := gettimeofday (TV'Access, System.Null_Address); pragma Assert (Result = 0); return To_Duration (TV); end Monotonic_Clock; ------------------- -- RT_Resolution -- ------------------- function RT_Resolution return Duration is begin return 10#1.0#E-6; end RT_Resolution; ------------ -- Wakeup -- ------------ procedure Wakeup (T : Task_ID; Reason : System.Tasking.Task_States) is Result : Interfaces.C.int; begin Result := pthread_cond_signal (T.Common.LL.CV'Access); pragma Assert (Result = 0); end Wakeup; ----------- -- Yield -- ----------- procedure Yield (Do_Yield : Boolean := True) is Result : Interfaces.C.int; begin if Do_Yield then Result := sched_yield; end if; end Yield; ------------------ -- Set_Priority -- ------------------ procedure Set_Priority (T : Task_ID; Prio : System.Any_Priority; Loss_Of_Inheritance : Boolean := False) is Result : Interfaces.C.int; Param : aliased struct_sched_param; begin T.Common.Current_Priority := Prio; if Priority_Ceiling_Emulation then if T.Common.LL.Active_Priority < Prio then T.Common.LL.Active_Priority := Prio; end if; end if; -- Priorities are in range 1 .. 99 on GNU/Linux, so we map -- map 0 .. 31 to 1 .. 32 Param.sched_priority := Interfaces.C.int (Prio) + 1; if Time_Slice_Val > 0 then Result := pthread_setschedparam (T.Common.LL.Thread, SCHED_RR, Param'Access); elsif FIFO_Within_Priorities or else Time_Slice_Val = 0 then Result := pthread_setschedparam (T.Common.LL.Thread, SCHED_FIFO, Param'Access); else Result := pthread_setschedparam (T.Common.LL.Thread, SCHED_OTHER, Param'Access); end if; pragma Assert (Result = 0 or else Result = EPERM); end Set_Priority; ------------------ -- Get_Priority -- ------------------ function Get_Priority (T : Task_ID) return System.Any_Priority is begin return T.Common.Current_Priority; end Get_Priority; ---------------- -- Enter_Task -- ---------------- procedure Enter_Task (Self_ID : Task_ID) is Result : Interfaces.C.int; begin Self_ID.Common.LL.Thread := pthread_self; Result := pthread_setspecific (ATCB_Key, To_Address (Self_ID)); pragma Assert (Result = 0); Lock_All_Tasks_List; for I in Known_Tasks'Range loop if Known_Tasks (I) = null then Known_Tasks (I) := Self_ID; Self_ID.Known_Tasks_Index := I; exit; end if; end loop; Unlock_All_Tasks_List; end Enter_Task; -------------- -- New_ATCB -- -------------- function New_ATCB (Entry_Num : Task_Entry_Index) return Task_ID is begin return new Ada_Task_Control_Block (Entry_Num); end New_ATCB; -------------------- -- Initialize_TCB -- -------------------- procedure Initialize_TCB (Self_ID : Task_ID; Succeeded : out Boolean) is Result : Interfaces.C.int; begin -- Give the task a unique serial number. Self_ID.Serial_Number := Next_Serial_Number; Next_Serial_Number := Next_Serial_Number + 1; pragma Assert (Next_Serial_Number /= 0); Self_ID.Common.LL.Thread := To_pthread_t (-1); Result := pthread_mutex_init (Self_ID.Common.LL.L'Access, Mutex_Attr'Access); pragma Assert (Result = 0 or else Result = ENOMEM); if Result /= 0 then Succeeded := False; return; end if; Result := pthread_cond_init (Self_ID.Common.LL.CV'Access, Cond_Attr'Access); pragma Assert (Result = 0 or else Result = ENOMEM); if Result = 0 then Succeeded := True; else Result := pthread_mutex_destroy (Self_ID.Common.LL.L'Access); pragma Assert (Result = 0); Succeeded := False; end if; Result := pthread_condattr_destroy (Cond_Attr'Access); pragma Assert (Result = 0); end Initialize_TCB; ----------------- -- Create_Task -- ----------------- procedure Create_Task (T : Task_ID; Wrapper : System.Address; Stack_Size : System.Parameters.Size_Type; Priority : System.Any_Priority; Succeeded : out Boolean) is Attributes : aliased pthread_attr_t; Result : Interfaces.C.int; function Thread_Body_Access is new Unchecked_Conversion (System.Address, Thread_Body); begin Result := pthread_attr_init (Attributes'Access); pragma Assert (Result = 0 or else Result = ENOMEM); if Result /= 0 or else Stack_Size > Max_Stack_Size then Succeeded := False; return; end if; Result := pthread_attr_setdetachstate (Attributes'Access, PTHREAD_CREATE_DETACHED); pragma Assert (Result = 0); -- Since the initial signal mask of a thread is inherited from the -- creator, and the Environment task has all its signals masked, we -- do not need to manipulate caller's signal mask at this point. -- All tasks in RTS will have All_Tasks_Mask initially. Result := pthread_create (T.Common.LL.Thread'Access, Attributes'Access, Thread_Body_Access (Wrapper), To_Address (T)); pragma Assert (Result = 0 or else Result = EAGAIN); Succeeded := Result = 0; Result := pthread_attr_destroy (Attributes'Access); pragma Assert (Result = 0); Set_Priority (T, Priority); end Create_Task; ------------------ -- Finalize_TCB -- ------------------ procedure Finalize_TCB (T : Task_ID) is Result : Interfaces.C.int; Tmp : Task_ID := T; procedure Free is new Unchecked_Deallocation (Ada_Task_Control_Block, Task_ID); begin Result := pthread_mutex_destroy (T.Common.LL.L'Access); pragma Assert (Result = 0); Result := pthread_cond_destroy (T.Common.LL.CV'Access); pragma Assert (Result = 0); if T.Known_Tasks_Index /= -1 then Known_Tasks (T.Known_Tasks_Index) := null; end if; Free (Tmp); end Finalize_TCB; --------------- -- Exit_Task -- --------------- procedure Exit_Task is begin pthread_exit (System.Null_Address); end Exit_Task; ---------------- -- Abort_Task -- ---------------- procedure Abort_Task (T : Task_ID) is Result : Interfaces.C.int; begin Result := pthread_kill (T.Common.LL.Thread, Signal (System.Interrupt_Management.Abort_Task_Interrupt)); pragma Assert (Result = 0); end Abort_Task; ---------------- -- Check_Exit -- ---------------- -- Dummy versions. The only currently working versions is for solaris -- (native). function Check_Exit (Self_ID : ST.Task_ID) return Boolean is begin return True; end Check_Exit; -------------------- -- Check_No_Locks -- -------------------- function Check_No_Locks (Self_ID : ST.Task_ID) return Boolean is begin return True; end Check_No_Locks; ---------------------- -- Environment_Task -- ---------------------- function Environment_Task return Task_ID is begin return Environment_Task_ID; end Environment_Task; ------------------------- -- Lock_All_Tasks_List -- ------------------------- procedure Lock_All_Tasks_List is begin Write_Lock (All_Tasks_L'Access); end Lock_All_Tasks_List; --------------------------- -- Unlock_All_Tasks_List -- --------------------------- procedure Unlock_All_Tasks_List is begin Unlock (All_Tasks_L'Access); end Unlock_All_Tasks_List; ------------------ -- Suspend_Task -- ------------------ function Suspend_Task (T : ST.Task_ID; Thread_Self : Thread_Id) return Boolean is begin if T.Common.LL.Thread /= Thread_Self then return pthread_kill (T.Common.LL.Thread, SIGSTOP) = 0; else return True; end if; end Suspend_Task; ----------------- -- Resume_Task -- ----------------- function Resume_Task (T : ST.Task_ID; Thread_Self : Thread_Id) return Boolean is begin if T.Common.LL.Thread /= Thread_Self then return pthread_kill (T.Common.LL.Thread, SIGCONT) = 0; else return True; end if; end Resume_Task; ---------------- -- Initialize -- ---------------- procedure Initialize (Environment_Task : Task_ID) is act : aliased struct_sigaction; old_act : aliased struct_sigaction; Tmp_Set : aliased sigset_t; Result : Interfaces.C.int; begin Environment_Task_ID := Environment_Task; Result := pthread_mutexattr_init (Mutex_Attr'Access); pragma Assert (Result = 0 or else Result = ENOMEM); Result := pthread_condattr_init (Cond_Attr'Access); pragma Assert (Result = 0 or else Result = ENOMEM); Initialize_Lock (All_Tasks_L'Access, All_Tasks_Level); -- Initialize the lock used to synchronize chain of all ATCBs. Enter_Task (Environment_Task); -- Install the abort-signal handler act.sa_flags := 0; act.sa_handler := Abort_Handler'Address; Result := sigemptyset (Tmp_Set'Access); pragma Assert (Result = 0); act.sa_mask := Tmp_Set; Result := sigaction (Signal (Interrupt_Management.Abort_Task_Interrupt), act'Unchecked_Access, old_act'Unchecked_Access); pragma Assert (Result = 0); end Initialize; begin declare Result : Interfaces.C.int; begin -- Mask Environment task for all signals. The original mask of the -- Environment task will be recovered by Interrupt_Server task -- during the elaboration of s-interr.adb. System.Interrupt_Management.Operations.Set_Interrupt_Mask (System.Interrupt_Management.Operations.All_Tasks_Mask'Access); -- Prepare the set of signals that should unblocked in all tasks Result := sigemptyset (Unblocked_Signal_Mask'Access); pragma Assert (Result = 0); for J in Interrupt_Management.Interrupt_ID loop if System.Interrupt_Management.Keep_Unmasked (J) then Result := sigaddset (Unblocked_Signal_Mask'Access, Signal (J)); pragma Assert (Result = 0); end if; end loop; Result := pthread_key_create (ATCB_Key'Access, null); pragma Assert (Result = 0); end; end System.Task_Primitives.Operations;

30.518625

78

0.587363

10d7d2654e1fca4d3d7c36a5d73b65dc47ee80ec

1,952

adb

Ada

src/tests/ahven/util-assertions.adb

yrashk/ada-util

2aaa1d87e92a7137e1c63dce90f0722c549dfafd

[ "Apache-2.0" ]

60

2015-01-18T23:05:34.000Z

2022-03-20T18:56:30.000Z

src/tests/ahven/util-assertions.adb

yrashk/ada-util

2aaa1d87e92a7137e1c63dce90f0722c549dfafd

[ "Apache-2.0" ]

20

2016-09-15T16:41:30.000Z

2022-03-29T22:02:32.000Z

src/tests/ahven/util-assertions.adb

yrashk/ada-util

2aaa1d87e92a7137e1c63dce90f0722c549dfafd

[ "Apache-2.0" ]

10

2015-02-13T04:00:45.000Z

2022-03-20T18:57:54.000Z

----------------------------------------------------------------------- -- AUnit utils - Helper for writing unit tests -- Copyright (C) 2009, 2010, 2014 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 Ahven; with Util.XUnit; package body Util.Assertions is -- ------------------------------ -- Check that the value matches what we expect. -- ------------------------------ procedure Assert_Equals_T (T : in Ahven.Framework.Test'Class; Expect : in Value_Type; Value : in Value_Type; Message : in String := "Test failed"; Source : in String := GNAT.Source_Info.File; Line : in Natural := GNAT.Source_Info.Line) is pragma Unreferenced (T); begin Ahven.Assert (Condition => Expect = Value, Message => Util.XUnit.Build_Message (Message => Message & ": expecting '" & Value_Type'Image (Expect) & "'" & " value was '" & Value_Type'Image (Value) & "'", Source => Source, Line => Line)); end Assert_Equals_T; end Util.Assertions;

43.377778

79

0.514857

1d201282d785d3b21ed0be65b8fa651f730946ff

13,163

adb

Ada

sources/wasm/opengl-framebuffers.adb

godunko/adagl

5b62d3bac6aa4e11084b4b19171dadbf805e95d6

[ "BSD-3-Clause" ]

6

2018-01-18T16:57:21.000Z

2020-01-19T07:40:12.000Z

sources/wasm/opengl-framebuffers.adb

godunko/adagl

5b62d3bac6aa4e11084b4b19171dadbf805e95d6

[ "BSD-3-Clause" ]

null

sources/wasm/opengl-framebuffers.adb

godunko/adagl

5b62d3bac6aa4e11084b4b19171dadbf805e95d6

[ "BSD-3-Clause" ]

1

2018-01-20T16:12:26.000Z

------------------------------------------------------------------------------ -- -- -- Ada binding for OpenGL/WebGL -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2016-2021, 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. -- -- -- ------------------------------------------------------------------------------ with OpenGL.Contexts.Internals; --with OpenGL.Renderbuffers.Internals; --with OpenGL.Textures.Internals; package body OpenGL.Framebuffers is use type Web.GL.Rendering_Contexts.WebGL_Rendering_Context; -- use type WebAPI.WebGL.Framebuffers.WebGL_Framebuffer_Access; -- -- ---------- -- -- Bind -- -- ---------- -- -- function Bind (Self : in out OpenGL_Framebuffer'Class) return Boolean is -- begin -- if Self.Context = null -- or Self.Context /= OpenGL.Contexts.Internals.Current_WebGL_Context -- or Self.Framebuffer = null -- then -- return False; -- end if; -- -- Self.Context.Bind_Framebuffer -- (WebAPI.WebGL.Rendering_Contexts.FRAMEBUFFER, Self.Framebuffer); -- -- return True; -- end Bind; -- -- ---------- -- -- Bind -- -- ---------- -- -- procedure Bind (Self : in out OpenGL_Framebuffer'Class) is -- begin -- if not Self.Bind then -- raise Program_Error; -- end if; -- end Bind; ------------ -- Create -- ------------ function Create (Self : in out OpenGL_Framebuffer'Class; Width : Natural; Height : Natural) return Boolean is begin if Self.Context.Is_Null then Self.Context := OpenGL.Contexts.Internals.Current_WebGL_Context; if Self.Context.Is_Null then return False; end if; end if; if Self.Framebuffer.Is_Null then Self.Framebuffer := Self.Context.Create_Framebuffer; if Self.Framebuffer.Is_Null then return False; end if; end if; Self.Context.Bind_Framebuffer (Web.GL.Rendering_Contexts.FRAMEBUFFER, Self.Framebuffer); -- Initialize texture. if Self.Texture.Is_Null then Self.Texture := Self.Context.Create_Texture; if Self.Texture.Is_Null then return False; end if; end if; Self.Context.Bind_Texture (Web.GL.Rendering_Contexts.TEXTURE_2D, Self.Texture); Self.Context.Tex_Parameteri (Web.GL.Rendering_Contexts.TEXTURE_2D, Web.GL.Rendering_Contexts.TEXTURE_MIN_FILTER, Web.GL.Rendering_Contexts.NEAREST); Self.Context.Tex_Parameteri (Web.GL.Rendering_Contexts.TEXTURE_2D, Web.GL.Rendering_Contexts.TEXTURE_MAG_FILTER, Web.GL.Rendering_Contexts.NEAREST); Self.Context.Tex_Parameteri (Web.GL.Rendering_Contexts.TEXTURE_2D, Web.GL.Rendering_Contexts.TEXTURE_WRAP_S, Web.GL.Rendering_Contexts.CLAMP_TO_EDGE); Self.Context.Tex_Parameteri (Web.GL.Rendering_Contexts.TEXTURE_2D, Web.GL.Rendering_Contexts.TEXTURE_WRAP_T, Web.GL.Rendering_Contexts.CLAMP_TO_EDGE); Self.Context.Tex_Image_2D (Web.GL.Rendering_Contexts.TEXTURE_2D, 0, Web.GL.Rendering_Contexts.RGBA, Web.GL.GLsizei (Width), Web.GL.GLsizei (Height), 0, Web.GL.Rendering_Contexts.RGBA, Web.GL.Rendering_Contexts.UNSIGNED_BYTE); Self.Context.Framebuffer_Texture_2D (Web.GL.Rendering_Contexts.FRAMEBUFFER, Web.GL.Rendering_Contexts.COLOR_ATTACHMENT_0, Web.GL.Rendering_Contexts.TEXTURE_2D, Self.Texture, 0); -- unbind texture? -- Initialize renderbuffer. if Self.Renderbuffer.Is_Null then Self.Renderbuffer := Self.Context.Create_Renderbuffer; if Self.Renderbuffer.Is_Null then return False; end if; end if; Self.Context.Bind_Renderbuffer (Web.GL.Rendering_Contexts.RENDERBUFFER, Self.Renderbuffer); Self.Context.Renderbuffer_Storage (Web.GL.Rendering_Contexts.RENDERBUFFER, Web.GL.Rendering_Contexts.DEPTH_STENCIL, Web.GL.Glsizei (Width), Web.GL.Glsizei (Height)); Self.Context.Framebuffer_Renderbuffer (Web.GL.Rendering_Contexts.FRAMEBUFFER, Web.GL.Rendering_Contexts.DEPTH_STENCIL_ATTACHMENT, Web.GL.Rendering_Contexts.RENDERBUFFER, Self.Renderbuffer); -- unbind renderbuffer? -- unbind framebuffer? return True; end Create; ------------ -- Create -- ------------ procedure Create (Self : in out OpenGL_Framebuffer'Class; Width : Natural; Height : Natural) is begin if not Self.Create (Width, Height) then raise Program_Error; end if; end Create; ------------ -- Delete -- ------------ procedure Delete (Self : in out OpenGL_Framebuffer'Class) is begin if Self.Context.Is_Null or Self.Context /= OpenGL.Contexts.Internals.Current_WebGL_Context then return; end if; if not Self.Framebuffer.Is_Null then Self.Context.Delete_Framebuffer (Self.Framebuffer); end if; if not Self.Texture.Is_Null then Self.Context.Delete_Texture (Self.Texture); end if; Self.Texture.Set_Null; Self.Framebuffer.Set_Null; Self.Context.Set_Null; end Delete; -------------- -- Finalize -- -------------- overriding procedure Finalize (Self : in out OpenGL_Framebuffer) is begin Self.Delete; end Finalize; ----------------- -- Read_Pixels -- ----------------- procedure Read_Pixels (Self : in out OpenGL_Framebuffer'Class; X : OpenGL.GLint; Y : OpenGL.GLint; Width : OpenGL.GLsizei; Height : OpenGL.GLsizei; Pixels : System.Address; Size : Interfaces.Unsigned_32) is -- procedure Read_Pixels -- (Self : in out OpenGL_Framebuffer'Class; -- X : OpenGL.GLint; -- Y : OpenGL.GLint; -- Width : OpenGL.GLsizei; -- Height : OpenGL.GLsizei; -- Data : out OpenGL.GLubyte_Vector_4_Array) is begin if Self.Context.Is_Null or Self.Context /= OpenGL.Contexts.Internals.Current_WebGL_Context or Self.Framebuffer.Is_Null then return; end if; Self.Context.Read_Pixels (Web.GL.GLint (X), Web.GL.GLint (Y), Web.GL.GLsizei (Width), Web.GL.GLsizei (Height), Web.GL.Rendering_Contexts.RGBA, Web.GL.Rendering_Contexts.UNSIGNED_BYTE, Pixels, Size); -- Data'Address); end Read_Pixels; -- ------------- -- -- Release -- -- ------------- -- -- procedure Release (Self : in out OpenGL_Framebuffer'Class) is -- begin -- if Self.Context = null -- or Self.Context /= OpenGL.Contexts.Internals.Current_WebGL_Context -- or Self.Framebuffer = null -- then -- return; -- end if; -- -- Self.Context.Bind_Framebuffer -- (WebAPI.WebGL.Rendering_Contexts.FRAMEBUFFER, null); -- end Release; -- -- ---------------------- -- -- Set_Renderbuffer -- -- ---------------------- -- -- procedure Set_Renderbuffer -- (Self : in out OpenGL_Framebuffer'Class; -- Renderbuffer : OpenGL.Renderbuffers.OpenGL_Renderbuffer'Class; -- Attachment : OpenGL.GLenum) is -- begin -- if Self.Context = null -- or Self.Context /= OpenGL.Contexts.Internals.Current_WebGL_Context -- or Self.Framebuffer = null -- then -- return; -- end if; -- -- Self.Context.Framebuffer_Renderbuffer -- (WebAPI.WebGL.Rendering_Contexts.FRAMEBUFFER, -- (case Attachment is -- when OpenGL.GL_COLOR_ATTACHMENT0 => -- WebAPI.WebGL.Rendering_Contexts.COLOR_ATTACHMENT0, -- when OpenGL.GL_DEPTH_ATTACHMENT => -- WebAPI.WebGL.Rendering_Contexts.DEPTH_ATTACHMENT, -- when OpenGL.GL_STENCIL_ATTACHMENT => -- WebAPI.WebGL.Rendering_Contexts.STENCIL_ATTACHMENT, -- when others => -- WebAPI.WebGL.Rendering_Contexts.COLOR_ATTACHMENT0), ---- raise Constraint_Error), -- WebAPI.WebGL.Rendering_Contexts.RENDERBUFFER, -- OpenGL.Renderbuffers.Internals.Get_WebGL_Renderbuffer (Renderbuffer)); -- end Set_Renderbuffer; -- -- ----------------- -- -- Set_Texture -- -- ----------------- -- -- procedure Set_Texture -- (Self : in out OpenGL_Framebuffer'Class; -- Texture : OpenGL.Textures.OpenGL_Texture'Class; -- Attachment : OpenGL.GLenum) is -- begin -- if Self.Context = null -- or Self.Context /= OpenGL.Contexts.Internals.Current_WebGL_Context -- or Self.Framebuffer = null -- then -- return; -- end if; -- -- Self.Context.Framebuffer_Texture_2D -- (WebAPI.WebGL.Rendering_Contexts.FRAMEBUFFER, -- (case Attachment is -- when OpenGL.GL_COLOR_ATTACHMENT0 => -- WebAPI.WebGL.Rendering_Contexts.COLOR_ATTACHMENT0, -- when OpenGL.GL_DEPTH_ATTACHMENT => -- WebAPI.WebGL.Rendering_Contexts.DEPTH_ATTACHMENT, -- when OpenGL.GL_STENCIL_ATTACHMENT => -- WebAPI.WebGL.Rendering_Contexts.STENCIL_ATTACHMENT, -- when others => -- WebAPI.WebGL.Rendering_Contexts.COLOR_ATTACHMENT0), ---- raise Constraint_Error), -- (case Texture.Texture_Type is -- when Texture_2D => -- WebAPI.WebGL.Rendering_Contexts.TEXTURE_2D, -- when Cube_Map_Positive_X => -- WebAPI.WebGL.Rendering_Contexts.TEXTURE_CUBE_MAP_POSITIVE_X, -- when Cube_Map_Negative_X => -- WebAPI.WebGL.Rendering_Contexts.TEXTURE_CUBE_MAP_NEGATIVE_X, -- when Cube_Map_Positive_Y => -- WebAPI.WebGL.Rendering_Contexts.TEXTURE_CUBE_MAP_POSITIVE_Y, -- when Cube_Map_Negative_Y => -- WebAPI.WebGL.Rendering_Contexts.TEXTURE_CUBE_MAP_NEGATIVE_Y, -- when Cube_Map_Positive_Z => -- WebAPI.WebGL.Rendering_Contexts.TEXTURE_CUBE_MAP_POSITIVE_Z, -- when Cube_Map_Negative_Z => -- WebAPI.WebGL.Rendering_Contexts.TEXTURE_CUBE_MAP_NEGATIVE_Z), -- OpenGL.Textures.Internals.Get_WebGL_Texture (Texture), -- 0); -- end Set_Texture; end OpenGL.Framebuffers;

35.384409

80

0.568108

1c176851061649066350c0f64270dc2f0f56823f

1,809

ads

Ada

src/ui/ships-ui.ads

thindil/steamsky

d5d7fea622f7994c91017c4cd7ba5e188153556c

[ "TCL", "MIT" ]

80

2017-04-08T23:14:07.000Z

2022-02-10T22:30:51.000Z

src/ui/ships-ui.ads

thindil/steamsky

d5d7fea622f7994c91017c4cd7ba5e188153556c

[ "TCL", "MIT" ]

89

2017-06-24T08:18:26.000Z

2021-11-12T04:37:36.000Z

src/ui/ships-ui.ads

thindil/steamsky

d5d7fea622f7994c91017c4cd7ba5e188153556c

[ "TCL", "MIT" ]

9

2018-04-14T16:37:25.000Z

2020-03-21T14:33:49.000Z

-- Copyright (c) 2020-2021 Bartek thindil Jasicki <[email protected]> -- -- 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 Interfaces.C; use Interfaces.C; with CArgv; use CArgv; with Tcl; use Tcl; -- ****h* Ships/SUI2 -- FUNCTION -- Provide code to show the player ship information to the player -- SOURCE package Ships.UI is -- **** -- ****o* SUI2/SUI2.Show_Ship_Info_Command -- FUNCTION -- Show information about the player's ship -- PARAMETERS -- ClientData - Custom data send to the command. Unused -- Interp - Tcl interpreter in which command was executed. -- Argc - Number of arguments passed to the command. -- Argv - Values of arguments passed to the command. Unused -- RESULT -- This function always return TCL_OK -- COMMANDS -- ShowShipInfo -- SOURCE function Show_Ship_Info_Command (ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int; Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int with Convention => C; -- **** -- ****f* SUI2/SUI2.AddCommands -- FUNCTION -- Add Tcl commands related to the player's ship information -- SOURCE procedure AddCommands; -- **** end Ships.UI;

33.5

74

0.695965

126eb045745ccd9b2cf982c3627d21923bca96af

18,942

adb

Ada

1-base/math/source/generic/pure/geometry/any_math-any_geometry-any_d3-any_modeller-any_forge.adb

charlie5/lace-alire

9ace9682cf4daac7adb9f980c2868d6225b8111c

[ "0BSD" ]

1

2022-01-20T07:13:42.000Z

1-base/math/source/generic/pure/geometry/any_math-any_geometry-any_d3-any_modeller-any_forge.adb

charlie5/lace-alire

9ace9682cf4daac7adb9f980c2868d6225b8111c

[ "0BSD" ]

null

1-base/math/source/generic/pure/geometry/any_math-any_geometry-any_d3-any_modeller-any_forge.adb

charlie5/lace-alire

9ace9682cf4daac7adb9f980c2868d6225b8111c

[ "0BSD" ]

null

with ada.Text_IO, ada.Strings.unbounded, ada.Strings.Maps; package body any_Math.any_Geometry.any_d3.any_Modeller.any_Forge is function to_Box_Model (half_Extents : in Vector_3 := (0.5, 0.5, 0.5)) return a_Model is pragma Unreferenced (half_Extents); Modeller : any_Modeller.item; begin Modeller.add_Triangle ((0.0, 0.0, 0.0), (1.0, 0.0, 0.0), (1.0, 1.0, 0.0)); Modeller.add_Triangle ((1.0, 1.0, 0.0), (0.0, 1.0, 0.0), (0.0, 0.0, 0.0)); -- TODO: Add the rest. return Modeller.Model; end to_Box_Model; function to_Capsule_Model (Length : in Real := 1.0; Radius : in Real := 0.5) return a_Model is use Functions; quality_Level : constant Positive := 4; sides_Count : constant Positive := Positive (quality_Level * 4); -- Number of sides to the cylinder (divisible by 4). type Edge is -- 'Barrel' edge. record Fore : Site; Aft : Site; end record; type Edges is array (Positive range 1 .. sides_Count) of Edge; type arch_Edges is array (Positive range 1 .. quality_Level) of Sites (1 .. sides_Count); tmp, ny, nz, start_nx, start_ny : Real; a : constant Real := Pi * 2.0 / Real (sides_Count); ca : constant Real := Cos (a); sa : constant Real := Sin (a); L : constant Real := Length * 0.5; the_Edges : Edges; Modeller : any_Modeller.item; begin -- Define cylinder body. -- ny := 1.0; nz := 0.0; -- Normal vector = (0, ny, nz) for Each in Edges'Range loop the_Edges (Each).Fore (1) := ny * Radius; the_Edges (Each).Fore (2) := nz * Radius; the_Edges (Each).Fore (3) := L; the_Edges (Each).Aft (1) := ny * Radius; the_Edges (Each).Aft (2) := nz * Radius; the_Edges (Each).Aft (3) := -L; -- Rotate ny, nz. -- tmp := ca * ny - sa * nz; nz := sa * ny + ca * nz; ny := tmp; end loop; for Each in Edges'Range loop if Each /= Edges'Last then Modeller.add_Triangle (the_Edges (Each) .Fore, the_Edges (Each) .Aft, the_Edges (Each + 1).Aft); Modeller.add_Triangle (the_Edges (Each + 1).Aft, the_Edges (Each + 1).Fore, the_Edges (Each) .Fore); else Modeller.add_Triangle (the_Edges (Each) .Fore, the_Edges (Each) .Aft, the_Edges (edges'First).Aft); Modeller.add_Triangle (the_Edges (edges'First).Aft, the_Edges (edges'First).Fore, the_Edges (Each) .Fore); end if; end loop; -- Define fore cylinder cap. -- declare the_arch_Edges : arch_Edges; begin start_nx := 0.0; start_ny := 1.0; for each_Hoop in 1 .. quality_Level loop -- Get start_n2 = rotated start_n. -- declare start_nx2 : constant Real := ca * start_nx + sa * start_ny; start_ny2 : constant Real := -sa * start_nx + ca * start_ny; begin -- Get n = start_n and n2 = start_n2. -- ny := start_ny; nz := 0.0; declare nx2 : constant Real := start_nx2; ny2 : Real := start_ny2; nz2 : Real := 0.0; begin for Each in 1 .. sides_Count loop the_arch_Edges (each_Hoop)(Each) (1) := ny2 * Radius; the_arch_Edges (each_Hoop)(Each) (2) := nz2 * Radius; the_arch_Edges (each_Hoop)(Each) (3) := nx2 * Radius + L; -- Rotate n, n2. -- tmp := ca * ny - sa * nz; nz := sa * ny + ca * nz; ny := tmp; tmp := ca * ny2 - sa * nz2; nz2 := sa * ny2 + ca * nz2; ny2 := tmp; end loop; end; start_nx := start_nx2; start_ny := start_ny2; end; end loop; for Each in 1 .. sides_Count loop if Each /= sides_Count then Modeller.add_Triangle (the_Edges (Each) .Fore, the_Edges (Each + 1).Fore, the_arch_Edges (1) (Each)); else Modeller.add_Triangle (the_Edges (Each).Fore, the_Edges (1) .Fore, the_arch_Edges (1) (Each)); end if; if Each /= sides_Count then Modeller.add_Triangle (the_Edges (Each + 1).Fore, the_arch_Edges (1) (Each + 1), the_arch_Edges (1) (Each)); else Modeller.add_Triangle (the_Edges (1).Fore, the_arch_Edges (1) (1), the_arch_Edges (1) (Each)); end if; end loop; for each_Hoop in 1 .. quality_Level - 1 loop for Each in 1 .. sides_Count loop declare function next_Hoop_Vertex return Positive is begin if Each = sides_Count then return 1; else return Each + 1; end if; end next_Hoop_Vertex; begin Modeller.add_Triangle (the_arch_Edges (each_Hoop) (Each), the_arch_Edges (each_Hoop) (next_Hoop_Vertex), the_arch_Edges (each_Hoop + 1) (Each)); if each_Hoop /= quality_Level - 1 then Modeller.add_Triangle (the_arch_Edges (each_Hoop) (next_Hoop_Vertex), the_arch_Edges (each_Hoop + 1) (next_Hoop_Vertex), the_arch_Edges (each_Hoop + 1) (Each)); end if; end; end loop; end loop; end; -- Define aft cylinder cap. -- declare the_arch_Edges : arch_Edges; begin start_nx := 0.0; start_ny := 1.0; for each_Hoop in 1 .. quality_Level loop declare -- Get start_n2 = rotated start_n. -- start_nx2 : constant Real := ca * start_nx - sa * start_ny; start_ny2 : constant Real := sa * start_nx + ca * start_ny; begin -- Get n = start_n and n2 = start_n2. -- ny := start_ny; nz := 0.0; declare nx2 : constant Real := start_nx2; ny2 : Real := start_ny2; nz2 : Real := 0.0; begin for Each in 1 .. sides_Count loop the_arch_Edges (each_Hoop) (Each) (1) := ny2 * Radius; the_arch_Edges (each_Hoop) (Each) (2) := nz2 * Radius; the_arch_Edges (each_Hoop) (Each) (3) := nx2 * Radius - L; -- Rotate n, n2 -- tmp := ca * ny - sa * nz; nz := sa * ny + ca * nz; ny := tmp; tmp := ca * ny2 - sa * nz2; nz2 := sa * ny2 + ca * nz2; ny2 := tmp; end loop; end; start_nx := start_nx2; start_ny := start_ny2; end; end loop; for Each in 1 .. sides_Count loop if Each /= sides_Count then Modeller.add_Triangle (the_Edges (Each).Aft, the_arch_Edges (1) (Each), the_Edges (Each + 1).Aft); else Modeller.add_Triangle (the_Edges (Each).Aft, the_arch_Edges (1) (Each), the_Edges (1).Aft); end if; if Each /= sides_Count then Modeller.add_Triangle (The_Edges (Each + 1).Aft, the_arch_Edges (1) (Each), the_arch_Edges (1) (Each + 1)); else Modeller.add_Triangle (the_Edges (1).Aft, the_arch_Edges (1) (Each), the_arch_Edges (1) (1)); end if; end loop; for each_Hoop in 1 .. quality_Level - 1 loop for Each in 1 .. sides_Count loop declare function next_Hoop_Vertex return Positive is begin if Each = sides_Count then return 1; else return Each + 1; end if; end next_hoop_Vertex; begin Modeller.add_Triangle (the_arch_Edges (each_Hoop) (Each), the_arch_Edges (each_Hoop + 1) (Each), the_arch_Edges (each_Hoop) (next_Hoop_Vertex)); if each_Hoop /= quality_Level - 1 then Modeller.add_Triangle (the_arch_Edges (each_Hoop) (next_hoop_Vertex), the_arch_Edges (each_Hoop + 1) (Each), the_arch_Edges (each_Hoop + 1) (next_Hoop_Vertex)); end if; end; end loop; end loop; end; return Modeller.Model; end to_capsule_Model; -- Polar to euclidian shape models. -- function to_Radians (From : in Latitude) return Radians is begin return Radians (From) * Pi / 180.0; end to_Radians; function to_Radians (From : in Longitude) return Radians is begin return Radians (From) * Pi / 180.0; end to_Radians; function polar_Model_from (model_Filename : in String) return polar_Model -- TODO: Handle different file formats. is use Functions, ada.Text_IO, ada.Strings.unbounded; the_File : File_type; the_Text : unbounded_String; begin open (the_File, in_File, model_Filename); while not end_of_File (the_File) loop append (the_Text, get_Line (the_File) & " "); end loop; declare text_Length : constant Natural := Length (the_Text); First : Positive := 1; function get_Real return Real is use ada.Strings, ada.Strings.Maps; real_Set : constant Character_Set := to_Set (Span => (Low => '0', High => '9')) or to_Set ('-' & '.'); Last : Positive; Result : Real; begin find_Token (the_Text, Set => real_Set, From => First, Test => Inside, First => First, Last => Last); Result := Real'Value (Slice (the_Text, Low => First, High => Last)); First := Last + 1; return Result; end get_Real; Lat : Latitude; Long : Longitude; Value : Integer; Distance : Real; Scale : constant Real := 10.0; -- TODO: Add a 'Scale' parameter. the_Model : polar_Model; begin while First < text_Length loop Value := Integer (get_Real); exit when Value = 360; Long := Longitude (Value); Lat := Latitude (get_Real); Distance := get_Real; the_Model (Long) (Lat).Site (1) := Scale * Distance * Cos (to_Radians (Lat)) * Sin (to_Radians (Long)); the_Model (Long) (Lat).Site (2) := Scale * Distance * Sin (to_Radians (Lat)); the_Model (Long) (Lat).Site (3) := Scale * Distance * Cos (to_Radians (Lat)) * Cos (to_Radians (Long)); end loop; return the_Model; end; end polar_Model_from; function mesh_Model_from (Model : in polar_Model) return a_Model is the_raw_Model : polar_Model := Model; the_mesh_Model : a_Model (site_Count => 2522, tri_Count => 73 * (16 * 4 + 6)); the_longitude : Longitude := 0; the_latitude : Latitude ; the_Vertex : Positive := 1; the_Triangle : Positive := 1; the_North_Pole : Positive; the_South_Pole : Positive; function Sum (the_Longitude : in Longitude; Increment : in Integer) return Longitude is Result : Integer := Integer (the_Longitude) + Increment; begin if Result >= 360 then Result := Result - 360; end if; return longitude (Result); end Sum; begin the_mesh_Model.Sites (the_Vertex) := (the_raw_model (0) (-90).Site); the_North_Pole := the_Vertex; the_raw_Model (0) (-90).Id := the_Vertex; the_Vertex := the_Vertex + 1; the_mesh_Model.Sites (the_Vertex) := (the_raw_model (0) (90).Site); the_south_Pole := the_Vertex; the_raw_Model (0) (90).Id := the_Vertex; the_Vertex := the_Vertex + 1; loop the_latitude := -90; loop if the_Latitude = -90 then the_raw_Model (the_Longitude) (the_Latitude).Id := the_North_Pole; elsif the_Latitude = 90 then the_raw_Model (the_Longitude) (the_Latitude).Id := the_South_Pole; else the_mesh_Model.Sites (the_Vertex) := the_raw_model (the_Longitude) (the_Latitude).Site; the_raw_Model (the_Longitude) (the_Latitude).Id := the_Vertex; the_Vertex := the_Vertex + 1; end if; exit when the_Latitude = 90; the_Latitude := the_Latitude + 5; end loop; exit when the_Longitude = 355; the_Longitude := the_Longitude + 5; end loop; the_Longitude := 0; loop the_mesh_Model.Triangles (the_Triangle) := (1 => the_North_Pole, 2 => the_raw_Model (Sum (the_Longitude, 5)) (-85).Id, 3 => the_raw_Model ( the_Longitude ) (-85).Id); the_Triangle := the_Triangle + 1; the_mesh_Model.Triangles (the_Triangle) := (1 => the_South_Pole, 2 => the_raw_Model (the_Longitude) (85).Id, 3 => the_raw_Model (Sum (the_Longitude, 5)) (85).Id); the_Triangle := the_Triangle + 1; the_Latitude := -85; loop the_mesh_Model.Triangles (the_Triangle) := (1 => the_raw_Model ( the_Longitude) (the_Latitude ).Id, 2 => the_raw_Model (Sum (the_Longitude, 5)) (the_Latitude ).Id, 3 => the_raw_Model ( the_Longitude) (the_Latitude + 5).Id); the_Triangle := the_Triangle + 1; the_mesh_Model.Triangles (the_Triangle) := (1 => the_raw_Model (the_Longitude) (the_Latitude + 5).Id, 2 => the_raw_Model (Sum (the_Longitude, 5)) (the_Latitude ).Id, 3 => the_raw_Model (Sum (the_Longitude, 5)) (the_Latitude + 5).Id); the_Triangle := the_Triangle + 1; the_Latitude := the_Latitude + 5; exit when the_Latitude = 85; end loop; exit when the_Longitude = 355; the_Longitude := the_Longitude + 5; end loop; the_mesh_Model.Triangles (the_Triangle) := (1 => the_North_Pole, 2 => the_raw_Model (5) (-85).Id, 3 => the_raw_Model (0) (-85).Id); the_Triangle := the_Triangle + 1; the_mesh_Model.Triangles (the_Triangle) := (1 => the_South_Pole, 2 => the_raw_Model (0) (85).Id, 3 => the_raw_Model (5) (85).Id); the_Triangle := the_Triangle + 1; the_latitude := -85; loop the_mesh_Model.Triangles (the_Triangle) := (1 => the_raw_Model (0) (the_Latitude ).Id, 2 => the_raw_Model (5) (the_Latitude ).Id, 3 => the_raw_Model (0) (the_Latitude + 5).Id); the_Triangle := the_Triangle + 1; the_mesh_Model.Triangles (the_Triangle) := (1 => the_raw_Model (0) (the_Latitude + 5).Id, 2 => the_raw_Model (5) (the_Latitude ).Id, 3 => the_raw_Model (5) (the_Latitude + 5).Id); the_Triangle := the_Triangle + 1; the_Latitude := the_Latitude + 5; exit when the_Latitude = 85; end loop; return the_mesh_Model; end mesh_Model_from; end any_Math.any_Geometry.any_d3.any_Modeller.any_Forge;

34.628885

129

0.438285

fbd762eb4dcf5214acac5a64dcfe2093c0684a75

32,565

adb

Ada

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

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

69

2015-01-02T10:45:56.000Z

2021-09-06T07:52:13.000Z

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- P A R . P R A G -- -- -- -- B o d y -- -- -- -- $Revision$ -- -- -- Copyright (C) 1992-2001 Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- Generally the parser checks the basic syntax of pragmas, but does not -- do specialized syntax checks for individual pragmas, these are deferred -- to semantic analysis time (see unit Sem_Prag). There are some pragmas -- which require recognition and either partial or complete processing -- during parsing, and this unit performs this required processing. with Fname.UF; use Fname.UF; with Osint; use Osint; with Stringt; use Stringt; with Stylesw; use Stylesw; with Uintp; use Uintp; with Uname; use Uname; separate (Par) function Prag (Pragma_Node : Node_Id; Semi : Source_Ptr) return Node_Id is Pragma_Name : constant Name_Id := Chars (Pragma_Node); Pragma_Sloc : constant Source_Ptr := Sloc (Pragma_Node); Arg_Count : Nat; Arg_Node : Node_Id; ----------------------- -- Local Subprograms -- ----------------------- function Arg1 return Node_Id; function Arg2 return Node_Id; function Arg3 return Node_Id; function Arg4 return Node_Id; -- Obtain specified Pragma_Argument_Association. It is allowable to call -- the routine for the argument one past the last present argument, but -- that is the only case in which a non-present argument can be referenced. procedure Check_Arg_Count (Required : Int); -- Check argument count for pragma = Required. -- If not give error and raise Error_Resync. procedure Check_Arg_Is_String_Literal (Arg : Node_Id); -- Check the expression of the specified argument to make sure that it -- is a string literal. If not give error and raise Error_Resync. procedure Check_Arg_Is_On_Or_Off (Arg : Node_Id); -- Check the expression of the specified argument to make sure that it -- is an identifier which is either ON or OFF, and if not, then issue -- an error message and raise Error_Resync. procedure Check_No_Identifier (Arg : Node_Id); -- Checks that the given argument does not have an identifier. If an -- identifier is present, then an error message is issued, and -- Error_Resync is raised. procedure Check_Optional_Identifier (Arg : Node_Id; Id : Name_Id); -- Checks if the given argument has an identifier, and if so, requires -- it to match the given identifier name. If there is a non-matching -- identifier, then an error message is given and Error_Resync raised. procedure Check_Required_Identifier (Arg : Node_Id; Id : Name_Id); -- Same as Check_Optional_Identifier, except that the name is required -- to be present and to match the given Id value. ---------- -- Arg1 -- ---------- function Arg1 return Node_Id is begin return First (Pragma_Argument_Associations (Pragma_Node)); end Arg1; ---------- -- Arg2 -- ---------- function Arg2 return Node_Id is begin return Next (Arg1); end Arg2; ---------- -- Arg3 -- ---------- function Arg3 return Node_Id is begin return Next (Arg2); end Arg3; ---------- -- Arg4 -- ---------- function Arg4 return Node_Id is begin return Next (Arg3); end Arg4; --------------------- -- Check_Arg_Count -- --------------------- procedure Check_Arg_Count (Required : Int) is begin if Arg_Count /= Required then Error_Msg ("wrong number of arguments for pragma%", Pragma_Sloc); raise Error_Resync; end if; end Check_Arg_Count; ---------------------------- -- Check_Arg_Is_On_Or_Off -- ---------------------------- procedure Check_Arg_Is_On_Or_Off (Arg : Node_Id) is Argx : constant Node_Id := Expression (Arg); begin if Nkind (Expression (Arg)) /= N_Identifier or else (Chars (Argx) /= Name_On and then Chars (Argx) /= Name_Off) then Error_Msg_Name_2 := Name_On; Error_Msg_Name_3 := Name_Off; Error_Msg ("argument for pragma% must be% or%", Sloc (Argx)); raise Error_Resync; end if; end Check_Arg_Is_On_Or_Off; --------------------------------- -- Check_Arg_Is_String_Literal -- --------------------------------- procedure Check_Arg_Is_String_Literal (Arg : Node_Id) is begin if Nkind (Expression (Arg)) /= N_String_Literal then Error_Msg ("argument for pragma% must be string literal", Sloc (Expression (Arg))); raise Error_Resync; end if; end Check_Arg_Is_String_Literal; ------------------------- -- Check_No_Identifier -- ------------------------- procedure Check_No_Identifier (Arg : Node_Id) is begin if Chars (Arg) /= No_Name then Error_Msg_N ("pragma% does not permit named arguments", Arg); raise Error_Resync; end if; end Check_No_Identifier; ------------------------------- -- Check_Optional_Identifier -- ------------------------------- procedure Check_Optional_Identifier (Arg : Node_Id; Id : Name_Id) is begin if Present (Arg) and then Chars (Arg) /= No_Name then if Chars (Arg) /= Id then Error_Msg_Name_2 := Id; Error_Msg_N ("pragma% argument expects identifier%", Arg); end if; end if; end Check_Optional_Identifier; ------------------------------- -- Check_Required_Identifier -- ------------------------------- procedure Check_Required_Identifier (Arg : Node_Id; Id : Name_Id) is begin if Chars (Arg) /= Id then Error_Msg_Name_2 := Id; Error_Msg_N ("pragma% argument must have identifier%", Arg); end if; end Check_Required_Identifier; ---------- -- Prag -- ---------- begin Error_Msg_Name_1 := Pragma_Name; -- Count number of arguments. This loop also checks if any of the arguments -- are Error, indicating a syntax error as they were parsed. If so, we -- simply return, because we get into trouble with cascaded errors if we -- try to perform our error checks on junk arguments. Arg_Count := 0; if Present (Pragma_Argument_Associations (Pragma_Node)) then Arg_Node := Arg1; while Arg_Node /= Empty loop Arg_Count := Arg_Count + 1; if Expression (Arg_Node) = Error then return Error; end if; Next (Arg_Node); end loop; end if; -- Remaining processing is pragma dependent case Get_Pragma_Id (Pragma_Name) is ------------ -- Ada_83 -- ------------ -- This pragma must be processed at parse time, since we want to set -- the Ada 83 and Ada 95 switches properly at parse time to recognize -- Ada 83 syntax or Ada 95 syntax as appropriate. when Pragma_Ada_83 => Ada_83 := True; Ada_95 := False; ------------ -- Ada_95 -- ------------ -- This pragma must be processed at parse time, since we want to set -- the Ada 83 and Ada_95 switches properly at parse time to recognize -- Ada 83 syntax or Ada 95 syntax as appropriate. when Pragma_Ada_95 => Ada_83 := False; Ada_95 := True; ----------- -- Debug -- ----------- -- pragma Debug (PROCEDURE_CALL_STATEMENT); -- This has to be processed by the parser because of the very peculiar -- form of the second parameter, which is syntactically from a formal -- point of view a function call (since it must be an expression), but -- semantically we treat it as a procedure call (which has exactly the -- same syntactic form, so that's why we can get away with this!) when Pragma_Debug => Check_Arg_Count (1); Check_No_Identifier (Arg1); declare Expr : constant Node_Id := New_Copy (Expression (Arg1)); begin if Nkind (Expr) /= N_Indexed_Component and then Nkind (Expr) /= N_Function_Call and then Nkind (Expr) /= N_Identifier and then Nkind (Expr) /= N_Selected_Component then Error_Msg ("argument of pragma% is not procedure call", Sloc (Expr)); raise Error_Resync; else Set_Debug_Statement (Pragma_Node, P_Statement_Name (Expr)); end if; end; ------------------------------- -- Extensions_Allowed (GNAT) -- ------------------------------- -- pragma Extensions_Allowed (Off | On) -- The processing for pragma Extensions_Allowed must be done at -- parse time, since extensions mode may affect what is accepted. when Pragma_Extensions_Allowed => Check_Arg_Count (1); Check_No_Identifier (Arg1); Check_Arg_Is_On_Or_Off (Arg1); Opt.Extensions_Allowed := (Chars (Expression (Arg1)) = Name_On); ---------------- -- List (2.8) -- ---------------- -- pragma List (Off | On) -- The processing for pragma List must be done at parse time, -- since a listing can be generated in parse only mode. when Pragma_List => Check_Arg_Count (1); Check_No_Identifier (Arg1); Check_Arg_Is_On_Or_Off (Arg1); -- We unconditionally make a List_On entry for the pragma, so that -- in the List (Off) case, the pragma will print even in a region -- of code with listing turned off (this is required!) List_Pragmas.Increment_Last; List_Pragmas.Table (List_Pragmas.Last) := (Ptyp => List_On, Ploc => Sloc (Pragma_Node)); -- Now generate the list off entry for pragma List (Off) if Chars (Expression (Arg1)) = Name_Off then List_Pragmas.Increment_Last; List_Pragmas.Table (List_Pragmas.Last) := (Ptyp => List_Off, Ploc => Semi); end if; ---------------- -- Page (2.8) -- ---------------- -- pragma Page; -- Processing for this pragma must be done at parse time, since a -- listing can be generated in parse only mode with semantics off. when Pragma_Page => Check_Arg_Count (0); List_Pragmas.Increment_Last; List_Pragmas.Table (List_Pragmas.Last) := (Page, Semi); ----------------------------- -- Source_File_Name (GNAT) -- ----------------------------- -- There are five forms of this pragma: -- pragma Source_File_Name ( -- [UNIT_NAME =>] unit_NAME, -- BODY_FILE_NAME => STRING_LITERAL); -- pragma Source_File_Name ( -- [UNIT_NAME =>] unit_NAME, -- SPEC_FILE_NAME => STRING_LITERAL); -- pragma Source_File_Name ( -- BODY_FILE_NAME => STRING_LITERAL -- [, DOT_REPLACEMENT => STRING_LITERAL] -- [, CASING => CASING_SPEC]); -- pragma Source_File_Name ( -- SPEC_FILE_NAME => STRING_LITERAL -- [, DOT_REPLACEMENT => STRING_LITERAL] -- [, CASING => CASING_SPEC]); -- pragma Source_File_Name ( -- SUBUNIT_FILE_NAME => STRING_LITERAL -- [, DOT_REPLACEMENT => STRING_LITERAL] -- [, CASING => CASING_SPEC]); -- CASING_SPEC ::= Uppercase | Lowercase | Mixedcase -- Note: we process this during parsing, since we need to have the -- source file names set well before the semantic analysis starts, -- since we load the spec and with'ed packages before analysis. when Pragma_Source_File_Name => Source_File_Name : declare Unam : Unit_Name_Type; Expr1 : Node_Id; Pat : String_Ptr; Typ : Character; Dot : String_Ptr; Cas : Casing_Type; Nast : Nat; function Get_Fname (Arg : Node_Id) return Name_Id; -- Process file name from unit name form of pragma function Get_String_Argument (Arg : Node_Id) return String_Ptr; -- Process string literal value from argument procedure Process_Casing (Arg : Node_Id); -- Process Casing argument of pattern form of pragma procedure Process_Dot_Replacement (Arg : Node_Id); -- Process Dot_Replacement argument of patterm form of pragma --------------- -- Get_Fname -- --------------- function Get_Fname (Arg : Node_Id) return Name_Id is begin String_To_Name_Buffer (Strval (Expression (Arg))); for J in 1 .. Name_Len loop if Is_Directory_Separator (Name_Buffer (J)) then Error_Msg ("directory separator character not allowed", Sloc (Expression (Arg)) + Source_Ptr (J)); end if; end loop; return Name_Find; end Get_Fname; ------------------------- -- Get_String_Argument -- ------------------------- function Get_String_Argument (Arg : Node_Id) return String_Ptr is Str : String_Id; begin if Nkind (Expression (Arg)) /= N_String_Literal and then Nkind (Expression (Arg)) /= N_Operator_Symbol then Error_Msg_N ("argument for pragma% must be string literal", Arg); raise Error_Resync; end if; Str := Strval (Expression (Arg)); -- Check string has no wide chars for J in 1 .. String_Length (Str) loop if Get_String_Char (Str, J) > 255 then Error_Msg ("wide character not allowed in pattern for pragma%", Sloc (Expression (Arg2)) + Text_Ptr (J) - 1); end if; end loop; -- Acquire string String_To_Name_Buffer (Str); return new String'(Name_Buffer (1 .. Name_Len)); end Get_String_Argument; -------------------- -- Process_Casing -- -------------------- procedure Process_Casing (Arg : Node_Id) is Expr : constant Node_Id := Expression (Arg); begin Check_Required_Identifier (Arg, Name_Casing); if Nkind (Expr) = N_Identifier then if Chars (Expr) = Name_Lowercase then Cas := All_Lower_Case; return; elsif Chars (Expr) = Name_Uppercase then Cas := All_Upper_Case; return; elsif Chars (Expr) = Name_Mixedcase then Cas := Mixed_Case; return; end if; end if; Error_Msg_N ("Casing argument for pragma% must be " & "one of Mixedcase, Lowercase, Uppercase", Arg); end Process_Casing; ----------------------------- -- Process_Dot_Replacement -- ----------------------------- procedure Process_Dot_Replacement (Arg : Node_Id) is begin Check_Required_Identifier (Arg, Name_Dot_Replacement); Dot := Get_String_Argument (Arg); end Process_Dot_Replacement; -- Start of processing for Source_File_Name pragma begin -- We permit from 1 to 3 arguments if Arg_Count not in 1 .. 3 then Check_Arg_Count (1); end if; Expr1 := Expression (Arg1); -- If first argument is identifier or selected component, then -- we have the specific file case of the Source_File_Name pragma, -- and the first argument is a unit name. if Nkind (Expr1) = N_Identifier or else (Nkind (Expr1) = N_Selected_Component and then Nkind (Selector_Name (Expr1)) = N_Identifier) then Check_Arg_Count (2); Check_Optional_Identifier (Arg1, Name_Unit_Name); Unam := Get_Unit_Name (Expr1); Check_Arg_Is_String_Literal (Arg2); if Chars (Arg2) = Name_Spec_File_Name then Set_File_Name (Get_Spec_Name (Unam), Get_Fname (Arg2)); elsif Chars (Arg2) = Name_Body_File_Name then Set_File_Name (Unam, Get_Fname (Arg2)); else Error_Msg_N ("pragma% argument has incorrect identifier", Arg2); return Pragma_Node; end if; -- If the first argument is not an identifier, then we must have -- the pattern form of the pragma, and the first argument must be -- the pattern string with an appropriate name. else if Chars (Arg1) = Name_Spec_File_Name then Typ := 's'; elsif Chars (Arg1) = Name_Body_File_Name then Typ := 'b'; elsif Chars (Arg1) = Name_Subunit_File_Name then Typ := 'u'; elsif Chars (Arg1) = Name_Unit_Name then Error_Msg_N ("Unit_Name parameter for pragma% must be an identifier", Arg1); raise Error_Resync; else Error_Msg_N ("pragma% argument has incorrect identifier", Arg1); raise Error_Resync; end if; Pat := Get_String_Argument (Arg1); -- Check pattern has exactly one asterisk Nast := 0; for J in Pat'Range loop if Pat (J) = '*' then Nast := Nast + 1; end if; end loop; if Nast /= 1 then Error_Msg_N ("file name pattern must have exactly one * character", Arg2); return Pragma_Node; end if; -- Set defaults for Casing and Dot_Separator parameters Cas := All_Lower_Case; Dot := new String'("."); -- Process second and third arguments if present if Arg_Count > 1 then if Chars (Arg2) = Name_Casing then Process_Casing (Arg2); if Arg_Count = 3 then Process_Dot_Replacement (Arg3); end if; else Process_Dot_Replacement (Arg2); if Arg_Count = 3 then Process_Casing (Arg3); end if; end if; end if; Set_File_Name_Pattern (Pat, Typ, Dot, Cas); end if; end Source_File_Name; ----------------------------- -- Source_Reference (GNAT) -- ----------------------------- -- pragma Source_Reference -- (INTEGER_LITERAL [, STRING_LITERAL] ); -- Processing for this pragma must be done at parse time, since error -- messages needing the proper line numbers can be generated in parse -- only mode with semantic checking turned off, and indeed we usually -- turn off semantic checking anyway if any parse errors are found. when Pragma_Source_Reference => Source_Reference : declare Fname : Name_Id; begin if Arg_Count /= 1 then Check_Arg_Count (2); Check_No_Identifier (Arg2); end if; -- Check that this is first line of file. We skip this test if -- we are in syntax check only mode, since we may be dealing with -- multiple compilation units. if Get_Physical_Line_Number (Pragma_Sloc) /= 1 and then Num_SRef_Pragmas (Current_Source_File) = 0 and then Operating_Mode /= Check_Syntax then Error_Msg ("first % pragma must be first line of file", Pragma_Sloc); raise Error_Resync; end if; Check_No_Identifier (Arg1); if Arg_Count = 1 then if Num_SRef_Pragmas (Current_Source_File) = 0 then Error_Msg ("file name required for first % pragma in file", Pragma_Sloc); raise Error_Resync; else Fname := No_Name; end if; -- File name present else Check_Arg_Is_String_Literal (Arg2); String_To_Name_Buffer (Strval (Expression (Arg2))); Fname := Name_Find; if Num_SRef_Pragmas (Current_Source_File) > 0 then if Fname /= Full_Ref_Name (Current_Source_File) then Error_Msg ("file name must be same in all % pragmas", Pragma_Sloc); raise Error_Resync; end if; end if; end if; if Nkind (Expression (Arg1)) /= N_Integer_Literal then Error_Msg ("argument for pragma% must be integer literal", Sloc (Expression (Arg1))); raise Error_Resync; -- OK, this source reference pragma is effective, however, we -- ignore it if it is not in the first unit in the multiple unit -- case. This is because the only purpose in this case is to -- provide source pragmas for subsequent use by gnatchop. else if Num_Library_Units = 1 then Register_Source_Ref_Pragma (Fname, Strip_Directory (Fname), UI_To_Int (Intval (Expression (Arg1))), Get_Physical_Line_Number (Pragma_Sloc) + 1); end if; end if; end Source_Reference; ------------------------- -- Style_Checks (GNAT) -- ------------------------- -- pragma Style_Checks (On | Off | ALL_CHECKS | STRING_LITERAL); -- This is processed by the parser since some of the style -- checks take place during source scanning and parsing. when Pragma_Style_Checks => Style_Checks : declare A : Node_Id; S : String_Id; C : Char_Code; OK : Boolean := True; begin -- Two argument case is only for semantics if Arg_Count = 2 then null; else Check_Arg_Count (1); Check_No_Identifier (Arg1); A := Expression (Arg1); if Nkind (A) = N_String_Literal then S := Strval (A); declare Slen : Natural := Natural (String_Length (S)); Options : String (1 .. Slen); J : Natural; Ptr : Natural; begin J := 1; loop C := Get_String_Char (S, Int (J)); if not In_Character_Range (C) then OK := False; Ptr := J; exit; else Options (J) := Get_Character (C); end if; if J = Slen then Set_Style_Check_Options (Options, OK, Ptr); exit; else J := J + 1; end if; end loop; if not OK then Error_Msg ("invalid style check option", Sloc (Expression (Arg1)) + Source_Ptr (Ptr)); raise Error_Resync; end if; end; elsif Nkind (A) /= N_Identifier then OK := False; elsif Chars (A) = Name_All_Checks then Stylesw.Set_Default_Style_Check_Options; elsif Chars (A) = Name_On then Style_Check := True; elsif Chars (A) = Name_Off then Style_Check := False; else OK := False; end if; if not OK then Error_Msg ("incorrect argument for pragma%", Sloc (A)); raise Error_Resync; end if; end if; end Style_Checks; --------------------- -- Warnings (GNAT) -- --------------------- -- pragma Warnings (On | Off, [LOCAL_NAME]) -- The one argument case is processed by the parser, since it may -- control parser warnings as well as semantic warnings, and in any -- case we want to be absolutely sure that the range in the warnings -- table is set well before any semantic analysis is performed. when Pragma_Warnings => if Arg_Count = 1 then Check_No_Identifier (Arg1); Check_Arg_Is_On_Or_Off (Arg1); if Chars (Expression (Arg1)) = Name_On then Set_Warnings_Mode_On (Pragma_Sloc); else Set_Warnings_Mode_Off (Pragma_Sloc); end if; end if; ----------------------- -- All Other Pragmas -- ----------------------- -- For all other pragmas, checking and processing is handled -- entirely in Sem_Prag, and no further checking is done by Par. when Pragma_Abort_Defer | Pragma_AST_Entry | Pragma_All_Calls_Remote | Pragma_Annotate | Pragma_Assert | Pragma_Asynchronous | Pragma_Atomic | Pragma_Atomic_Components | Pragma_Attach_Handler | Pragma_CPP_Class | Pragma_CPP_Constructor | Pragma_CPP_Virtual | Pragma_CPP_Vtable | Pragma_C_Pass_By_Copy | Pragma_Comment | Pragma_Common_Object | Pragma_Complex_Representation | Pragma_Component_Alignment | Pragma_Controlled | Pragma_Convention | Pragma_Discard_Names | Pragma_Eliminate | Pragma_Elaborate | Pragma_Elaborate_All | Pragma_Elaborate_Body | Pragma_Elaboration_Checks | Pragma_Export | Pragma_Export_Exception | Pragma_Export_Function | Pragma_Export_Object | Pragma_Export_Procedure | Pragma_Export_Valued_Procedure | Pragma_Extend_System | Pragma_External | Pragma_External_Name_Casing | Pragma_Finalize_Storage_Only | Pragma_Float_Representation | Pragma_Ident | Pragma_Import | Pragma_Import_Exception | Pragma_Import_Function | Pragma_Import_Object | Pragma_Import_Procedure | Pragma_Import_Valued_Procedure | Pragma_Initialize_Scalars | Pragma_Inline | Pragma_Inline_Always | Pragma_Inline_Generic | Pragma_Inspection_Point | Pragma_Interface | Pragma_Interface_Name | Pragma_Interrupt_Handler | Pragma_Interrupt_Priority | Pragma_Java_Constructor | Pragma_Java_Interface | Pragma_License | Pragma_Link_With | Pragma_Linker_Alias | Pragma_Linker_Options | Pragma_Linker_Section | Pragma_Locking_Policy | Pragma_Long_Float | Pragma_Machine_Attribute | Pragma_Main | Pragma_Main_Storage | Pragma_Memory_Size | Pragma_No_Return | Pragma_No_Run_Time | Pragma_Normalize_Scalars | Pragma_Optimize | Pragma_Pack | Pragma_Passive | Pragma_Polling | Pragma_Preelaborate | Pragma_Priority | Pragma_Propagate_Exceptions | Pragma_Psect_Object | Pragma_Pure | Pragma_Pure_Function | Pragma_Queuing_Policy | Pragma_Remote_Call_Interface | Pragma_Remote_Types | Pragma_Restrictions | Pragma_Restricted_Run_Time | Pragma_Ravenscar | Pragma_Reviewable | Pragma_Share_Generic | Pragma_Shared | Pragma_Shared_Passive | Pragma_Storage_Size | Pragma_Storage_Unit | Pragma_Stream_Convert | Pragma_Subtitle | Pragma_Suppress | Pragma_Suppress_All | Pragma_Suppress_Debug_Info | Pragma_Suppress_Initialization | Pragma_System_Name | Pragma_Task_Dispatching_Policy | Pragma_Task_Info | Pragma_Task_Name | Pragma_Task_Storage | Pragma_Time_Slice | Pragma_Title | Pragma_Unchecked_Union | Pragma_Unimplemented_Unit | Pragma_Unreserve_All_Interrupts | Pragma_Unsuppress | Pragma_Use_VADS_Size | Pragma_Volatile | Pragma_Volatile_Components | Pragma_Weak_External | Pragma_Validity_Checks => null; end case; return Pragma_Node; -------------------- -- Error Handling -- -------------------- exception when Error_Resync => return Error; end Prag;

34.206933

79

0.509105

311e3e3659f0228b82edd0538411f2b65a91a9ed

599

ads

Ada

src/drivers/zumo_led.ads

yannickmoy/SPARKZumo

29d4d5d4f00d43d2dafd8d8b8d21eea0769923f3

[ "MIT" ]

6

2018-04-05T21:05:17.000Z

2021-06-04T15:24:09.000Z

src/drivers/zumo_led.ads

yannickmoy/SPARKZumo

29d4d5d4f00d43d2dafd8d8b8d21eea0769923f3

[ "MIT" ]

null

src/drivers/zumo_led.ads

yannickmoy/SPARKZumo

29d4d5d4f00d43d2dafd8d8b8d21eea0769923f3

[ "MIT" ]

3

2021-01-18T16:07:40.000Z

2021-05-03T15:52:13.000Z

pragma SPARK_Mode; -- @summary -- Controls the little yellow LED on the robot labeled LED 13 -- -- @description -- Use this interface to turn on and off the LED 13 located near the back -- of the robot on the right side package Zumo_LED is Initd : Boolean := False; -- Initialization sequence. Muxes pins and whatnot procedure Init with Global => (In_Out => (Initd)), Pre => not Initd, Post => Initd; -- Turns on and off the LED -- @param On True to turn on. False to turn off procedure Yellow_Led (On : Boolean) with Pre => Initd; end Zumo_LED;

23.96

74

0.657763

a1c627e093836259d4344c389aad2fc401a2ef83

5,004

adb

Ada

src/common/keccak-generic_xof.adb

damaki/libkeccak

d06217e525f7927380690d6c37b485bdbe8aa96e

[ "BSD-3-Clause" ]

26

2015-09-20T17:52:38.000Z

2021-07-29T21:47:04.000Z

src/common/keccak-generic_xof.adb

damaki/libkeccak

d06217e525f7927380690d6c37b485bdbe8aa96e

[ "BSD-3-Clause" ]

3

2019-03-12T16:01:36.000Z

2020-05-23T13:06:43.000Z

src/common/keccak-generic_xof.adb

damaki/libkeccak

d06217e525f7927380690d6c37b485bdbe8aa96e

[ "BSD-3-Clause" ]

2

2019-04-15T18:02:19.000Z

2020-11-22T11:22:18.000Z

------------------------------------------------------------------------------- -- Copyright (c) 2019, Daniel King -- All rights reserved. -- -- Redistribution and use in source and binary forms, with or without -- modification, are permitted provided that the following conditions are met: -- * Redistributions of source code must retain the above copyright -- notice, this list of conditions and the following disclaimer. -- * Redistributions in binary form must reproduce the above copyright -- notice, this list of conditions and the following disclaimer in the -- documentation and/or other materials provided with the distribution. -- * The name of the copyright holder may not be used to endorse or promote -- Products derived from this software without specific prior written -- permission. -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" -- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE -- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE FOR ANY -- DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES -- (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; -- LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND -- ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF -- THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------- package body Keccak.Generic_XOF is ------------ -- Init -- ------------ procedure Init (Ctx : out Context) is begin XOF_Sponge.Init (Ctx.Sponge_Ctx, Capacity, Permutation_Initial_Value); Ctx.Update_Complete := False; end Init; -------------- -- Update -- -------------- procedure Update (Ctx : in out Context; Message : in Keccak.Types.Byte_Array; Bit_Length : in Natural) is Num_Bytes : constant Natural := (Bit_Length + 7) / 8; begin pragma Assert (Num_Bytes <= Message'Length); if Num_Bytes > 0 then if Bit_Length mod 8 = 0 then XOF_Sponge.Absorb (Ctx.Sponge_Ctx, Message (Message'First .. Message'First + (Num_Bytes - 1)), Bit_Length); else XOF_Sponge.Absorb_With_Suffix (Ctx.Sponge_Ctx, Message (Message'First .. Message'First + (Num_Bytes - 1)), Bit_Length, Suffix, Suffix_Size); Ctx.Update_Complete := True; end if; end if; end Update; -------------- -- Update -- -------------- procedure Update (Ctx : in out Context; Message : in Byte_Array) is Max_Chunk_Len : constant := (Natural'Last / 8) - 1; Remaining : Natural := Message'Length; Offset : Natural := 0; begin while Remaining >= Max_Chunk_Len loop pragma Loop_Variant (Decreases => Remaining); pragma Loop_Invariant (Remaining + Offset = Message'Length and State_Of (Ctx) = Updating); Update (Ctx, Message (Message'First + Offset .. Message'First + Offset + (Max_Chunk_Len - 1)), Max_Chunk_Len * 8); Remaining := Remaining - Max_Chunk_Len; Offset := Offset + Max_Chunk_Len; end loop; if Remaining > 0 then pragma Assert_And_Cut (Remaining < Natural'Last / 8 and Offset + Remaining = Message'Length and State_Of (Ctx) = Updating); Update (Ctx, Message (Message'First + Offset .. Message'Last), Remaining * 8); pragma Assert (State_Of (Ctx) = Updating); end if; end Update; --------------- -- Extract -- --------------- procedure Extract (Ctx : in out Context; Digest : out Byte_Array) is Empty_Array : constant Keccak.Types.Byte_Array (0 .. -1) := (others => 0); begin if State_Of (Ctx) = Updating then XOF_Sponge.Absorb_With_Suffix (Ctx.Sponge_Ctx, Empty_Array, 0, Suffix, Suffix_Size); end if; XOF_Sponge.Squeeze (Ctx.Sponge_Ctx, Digest); end Extract; end Keccak.Generic_XOF;

36.794118

98

0.531575

2f054106ca6f72d090e8d6a79dd5acad3f99d038

7,105

ads

Ada

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-chtgbo.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-chtgbo.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-chtgbo.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- ADA.CONTAINERS.HASH_TABLES.GENERIC_BOUNDED_OPERATIONS -- -- -- -- S p e c -- -- -- -- Copyright (C) 2004-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/>. -- -- -- -- This unit was originally developed by Matthew J Heaney. -- ------------------------------------------------------------------------------ -- Hash_Table_Type is used to implement hashed containers. This package -- declares hash-table operations that do not depend on keys. with Ada.Streams; generic with package HT_Types is new Generic_Bounded_Hash_Table_Types (<>); use HT_Types, HT_Types.Implementation; with function Hash_Node (Node : Node_Type) return Hash_Type; with function Next (Node : Node_Type) return Count_Type; with procedure Set_Next (Node : in out Node_Type; Next : Count_Type); package Ada.Containers.Hash_Tables.Generic_Bounded_Operations is pragma Pure; function Index (Buckets : Buckets_Type; Node : Node_Type) return Hash_Type; pragma Inline (Index); -- Uses the hash value of Node to compute its Buckets array index function Index (HT : Hash_Table_Type'Class; Node : Node_Type) return Hash_Type; pragma Inline (Index); -- Uses the hash value of Node to compute its Hash_Table buckets array -- index. function Checked_Index (Hash_Table : aliased in out Hash_Table_Type'Class; Node : Count_Type) return Hash_Type; -- Calls Index, but also locks and unlocks the container, per AI05-0022, in -- order to detect element tampering by the generic actual Hash function. generic with function Find (HT : Hash_Table_Type'Class; Key : Node_Type) return Boolean; function Generic_Equal (L, R : Hash_Table_Type'Class) return Boolean; -- Used to implement hashed container equality. For each node in hash table -- L, it calls Find to search for an equivalent item in hash table R. If -- Find returns False for any node then Generic_Equal terminates -- immediately and returns False. Otherwise if Find returns True for every -- node then Generic_Equal returns True. procedure Clear (HT : in out Hash_Table_Type'Class); -- Deallocates each node in hash table HT. (Note that it only deallocates -- the nodes, not the buckets array.) Program_Error is raised if the hash -- table is busy. procedure Delete_Node_At_Index (HT : in out Hash_Table_Type'Class; Indx : Hash_Type; X : Count_Type); -- Delete a node whose bucket position is known. extracted from following -- subprogram, but also used directly to remove a node whose element has -- been modified through a key_preserving reference: in that case we cannot -- use the value of the element precisely because the current value does -- not correspond to the hash code that determines its bucket. procedure Delete_Node_Sans_Free (HT : in out Hash_Table_Type'Class; X : Count_Type); -- Removes node X from the hash table without deallocating the node generic with procedure Set_Element (Node : in out Node_Type); procedure Generic_Allocate (HT : in out Hash_Table_Type'Class; Node : out Count_Type); -- Claim a node from the free store. Generic_Allocate first -- calls Set_Element on the potential node, and then returns -- the node's index as the value of the Node parameter. procedure Free (HT : in out Hash_Table_Type'Class; X : Count_Type); -- Return a node back to the free store, from where it had -- been previously claimed via Generic_Allocate. function First (HT : Hash_Table_Type'Class) return Count_Type; -- Returns the head of the list in the first (lowest-index) non-empty -- bucket. function Next (HT : Hash_Table_Type'Class; Node : Count_Type) return Count_Type; -- Returns the node that immediately follows Node. This corresponds to -- either the next node in the same bucket, or (if Node is the last node in -- its bucket) the head of the list in the first non-empty bucket that -- follows. generic with procedure Process (Node : Count_Type); procedure Generic_Iteration (HT : Hash_Table_Type'Class); -- Calls Process for each node in hash table HT generic use Ada.Streams; with procedure Write (Stream : not null access Root_Stream_Type'Class; Node : Node_Type); procedure Generic_Write (Stream : not null access Root_Stream_Type'Class; HT : Hash_Table_Type'Class); -- Used to implement the streaming attribute for hashed containers. It -- calls Write for each node to write its value into Stream. generic use Ada.Streams; with function New_Node (Stream : not null access Root_Stream_Type'Class) return Count_Type; procedure Generic_Read (Stream : not null access Root_Stream_Type'Class; HT : out Hash_Table_Type'Class); -- Used to implement the streaming attribute for hashed containers. It -- first clears hash table HT, then populates the hash table by calling -- New_Node for each item in Stream. end Ada.Containers.Hash_Tables.Generic_Bounded_Operations;

45.254777

79

0.580014

311c0ebd5c5069625285fde2f5e67b109d621a90

2,354

ads

Ada

tests/natools-static_hash_maps-s_expressions-tests.ads

faelys/natools

947c004e6f69ca144942c6af40e102d089223cf8

[ "0BSD" ]

null

tests/natools-static_hash_maps-s_expressions-tests.ads

faelys/natools

947c004e6f69ca144942c6af40e102d089223cf8

[ "0BSD" ]

null

tests/natools-static_hash_maps-s_expressions-tests.ads

faelys/natools

947c004e6f69ca144942c6af40e102d089223cf8

[ "0BSD" ]

null

------------------------------------------------------------------------------ -- Copyright (c) 2014, Natacha Porté -- -- -- -- Permission to use, copy, modify, and distribute this software for any -- -- purpose with or without fee is hereby granted, provided that the above -- -- copyright notice and this permission notice appear in all copies. -- -- -- -- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES -- -- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF -- -- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR -- -- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES -- -- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN -- -- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF -- -- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. -- ------------------------------------------------------------------------------ ------------------------------------------------------------------------------ -- Natools.Static_Hash_Maps.S_Expressions.Tests provides a very limited -- -- test suite for the static hash map generator. -- -- Since Natools.Static_Hash_Maps is only a code generator, it is not used -- -- directly and does not need much testing. Testing should instead target -- -- the generated code, so that issues with the generator show up in when -- -- compiling or testing the generated code. -- -- Currently the test suite here only runs the generated self-test of the -- -- hash map used to decode S-expressions, so that generate_static_hash_map -- -- tool can be run without silent error. -- ------------------------------------------------------------------------------ with Natools.Tests; package Natools.Static_Hash_Maps.S_Expressions.Tests is package NT renames Natools.Tests; procedure All_Tests (Report : in out NT.Reporter'Class); procedure Test_Hash_Functions (Report : in out NT.Reporter'Class); end Natools.Static_Hash_Maps.S_Expressions.Tests;

58.85

78

0.54503

1266280dadb54badfdce836829dc7cc55c406d65

8,112

adb

Ada

llvm-gcc-4.2-2.9/gcc/ada/i-cstrea-vms.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

llvm-gcc-4.2-2.9/gcc/ada/i-cstrea-vms.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

llvm-gcc-4.2-2.9/gcc/ada/i-cstrea-vms.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- I N T E R F A C E S . C _ S T R E A M S -- -- -- -- B o d y -- -- -- -- Copyright (C) 1996-2005, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This is the Alpha/VMS version with Unchecked_Conversion; package body Interfaces.C_Streams is use type System.CRTL.size_t; -- As the functions fread, fwrite and setvbuf are too big to be inlined, -- they are just wrappers to the following implementation functions. function fread_impl (buffer : voids; size : size_t; count : size_t; stream : FILEs) return size_t; function fread_impl (buffer : voids; index : size_t; size : size_t; count : size_t; stream : FILEs) return size_t; function fwrite_impl (buffer : voids; size : size_t; count : size_t; stream : FILEs) return size_t; function setvbuf_impl (stream : FILEs; buffer : chars; mode : int; size : size_t) return int; ------------ -- fread -- ------------ function fread_impl (buffer : voids; size : size_t; count : size_t; stream : FILEs) return size_t is Get_Count : size_t := 0; type Buffer_Type is array (size_t range 1 .. count, size_t range 1 .. size) of Character; type Buffer_Access is access Buffer_Type; function To_BA is new Unchecked_Conversion (voids, Buffer_Access); BA : constant Buffer_Access := To_BA (buffer); Ch : int; begin -- This Fread goes with the Fwrite below. The C library fread sometimes -- can't read fputc generated files. for C in 1 .. count loop for S in 1 .. size loop Ch := fgetc (stream); if Ch = EOF then return Get_Count; end if; BA.all (C, S) := Character'Val (Ch); end loop; Get_Count := Get_Count + 1; end loop; return Get_Count; end fread_impl; function fread_impl (buffer : voids; index : size_t; size : size_t; count : size_t; stream : FILEs) return size_t is Get_Count : size_t := 0; type Buffer_Type is array (size_t range 1 .. count, size_t range 1 .. size) of Character; type Buffer_Access is access Buffer_Type; function To_BA is new Unchecked_Conversion (voids, Buffer_Access); BA : constant Buffer_Access := To_BA (buffer); Ch : int; begin -- This Fread goes with the Fwrite below. The C library fread sometimes -- can't read fputc generated files. for C in 1 + index .. count + index loop for S in 1 .. size loop Ch := fgetc (stream); if Ch = EOF then return Get_Count; end if; BA.all (C, S) := Character'Val (Ch); end loop; Get_Count := Get_Count + 1; end loop; return Get_Count; end fread_impl; function fread (buffer : voids; size : size_t; count : size_t; stream : FILEs) return size_t is begin return fread_impl (buffer, size, count, stream); end fread; function fread (buffer : voids; index : size_t; size : size_t; count : size_t; stream : FILEs) return size_t is begin return fread_impl (buffer, index, size, count, stream); end fread; ------------ -- fwrite -- ------------ function fwrite_impl (buffer : voids; size : size_t; count : size_t; stream : FILEs) return size_t is Put_Count : size_t := 0; type Buffer_Type is array (size_t range 1 .. count, size_t range 1 .. size) of Character; type Buffer_Access is access Buffer_Type; function To_BA is new Unchecked_Conversion (voids, Buffer_Access); BA : constant Buffer_Access := To_BA (buffer); begin -- Fwrite on VMS has the undesirable effect of always generating at -- least one record of output per call, regardless of buffering. To -- get around this, we do multiple fputc calls instead. for C in 1 .. count loop for S in 1 .. size loop if fputc (Character'Pos (BA.all (C, S)), stream) = EOF then return Put_Count; end if; end loop; Put_Count := Put_Count + 1; end loop; return Put_Count; end fwrite_impl; function fwrite (buffer : voids; size : size_t; count : size_t; stream : FILEs) return size_t is begin return fwrite_impl (buffer, size, count, stream); end fwrite; ------------- -- setvbuf -- ------------- function setvbuf_impl (stream : FILEs; buffer : chars; mode : int; size : size_t) return int is use type System.Address; begin -- In order for the above fwrite hack to work, we must always buffer -- stdout and stderr. Is_regular_file on VMS cannot detect when -- these are redirected to a file, so checking for that condition -- doesnt help. if mode = IONBF and then (stream = stdout or else stream = stderr) then return System.CRTL.setvbuf (stream, buffer, IOLBF, System.CRTL.size_t (size)); else return System.CRTL.setvbuf (stream, buffer, mode, System.CRTL.size_t (size)); end if; end setvbuf_impl; function setvbuf (stream : FILEs; buffer : chars; mode : int; size : size_t) return int is begin return setvbuf_impl (stream, buffer, mode, size); end setvbuf; end Interfaces.C_Streams;

31.6875

78

0.51997

31a71b78d0db63f8efcf79ff02ef4f217a5c8a88

2,495

adb

Ada

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

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

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

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

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

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- ADA.STRINGS.BOUNDED.HASH_CASE_INSENSITIVE -- -- -- -- 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/>. -- -- -- -- This unit was originally developed by Matthew J Heaney. -- ------------------------------------------------------------------------------ with Ada.Strings.Hash_Case_Insensitive; function Ada.Strings.Bounded.Hash_Case_Insensitive (Key : Bounded.Bounded_String) return Containers.Hash_Type is begin return Ada.Strings.Hash_Case_Insensitive (Bounded.To_String (Key)); end Ada.Strings.Bounded.Hash_Case_Insensitive;

63.974359

78

0.355511

a1dae185b8cfbc038e25de53378332aeae80400b

2,033

ads

Ada

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

charlie5/cBound

741be08197a61ad9c72553e3302f3b669902216d

[ "0BSD" ]

2

2015-11-12T11:16:20.000Z

2021-08-24T22:32:04.000Z

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

charlie5/cBound

741be08197a61ad9c72553e3302f3b669902216d

[ "0BSD" ]

1

2018-06-05T05:19:35.000Z

2021-11-20T01:13:23.000Z

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

charlie5/cBound

741be08197a61ad9c72553e3302f3b669902216d

[ "0BSD" ]

null

-- This file is generated by SWIG. Please do not modify by hand. -- with Interfaces; with swig; with Interfaces.C; with Interfaces.C.Pointers; package xcb.xcb_render_composite_glyphs_8_request_t is -- Item -- type Item is record major_opcode : aliased Interfaces.Unsigned_8; minor_opcode : aliased Interfaces.Unsigned_8; length : aliased Interfaces.Unsigned_16; op : aliased Interfaces.Unsigned_8; pad0 : aliased swig.int8_t_Array (0 .. 2); src : aliased xcb.xcb_render_picture_t; dst : aliased xcb.xcb_render_picture_t; mask_format : aliased xcb.xcb_render_pictformat_t; glyphset : aliased xcb.xcb_render_glyphset_t; src_x : aliased Interfaces.Integer_16; src_y : aliased Interfaces.Integer_16; end record; -- Item_Array -- type Item_Array is array (Interfaces.C .size_t range <>) of aliased xcb .xcb_render_composite_glyphs_8_request_t .Item; -- Pointer -- package C_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_render_composite_glyphs_8_request_t.Item, Element_Array => xcb.xcb_render_composite_glyphs_8_request_t.Item_Array, Default_Terminator => (others => <>)); subtype Pointer is C_Pointers.Pointer; -- Pointer_Array -- type Pointer_Array is array (Interfaces.C .size_t range <>) of aliased xcb .xcb_render_composite_glyphs_8_request_t .Pointer; -- Pointer_Pointer -- package C_Pointer_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_render_composite_glyphs_8_request_t.Pointer, Element_Array => xcb.xcb_render_composite_glyphs_8_request_t.Pointer_Array, Default_Terminator => null); subtype Pointer_Pointer is C_Pointer_Pointers.Pointer; end xcb.xcb_render_composite_glyphs_8_request_t;

30.343284

78

0.672405

2072373830687027f02d791394175d8ecc8d5635

1,412

ads

Ada

src/natools-time_statistics-coarse_timers.ads

faelys/natools

947c004e6f69ca144942c6af40e102d089223cf8

[ "0BSD" ]

null

src/natools-time_statistics-coarse_timers.ads

faelys/natools

947c004e6f69ca144942c6af40e102d089223cf8

[ "0BSD" ]

null

src/natools-time_statistics-coarse_timers.ads

faelys/natools

947c004e6f69ca144942c6af40e102d089223cf8

[ "0BSD" ]

null

------------------------------------------------------------------------------ -- Copyright (c) 2014, Natacha Porté -- -- -- -- Permission to use, copy, modify, and distribute this software for any -- -- purpose with or without fee is hereby granted, provided that the above -- -- copyright notice and this permission notice appear in all copies. -- -- -- -- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES -- -- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF -- -- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR -- -- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES -- -- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN -- -- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF -- -- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. -- ------------------------------------------------------------------------------ with Ada.Calendar; with Natools.Time_Statistics.Generic_Timers; package Natools.Time_Statistics.Coarse_Timers is new Natools.Time_Statistics.Generic_Timers (Ada.Calendar.Time, Ada.Calendar.Clock, Ada.Calendar."-");

56.48

78

0.546742

060cde9f566387645ec5316090773f142417d628

820

adb

Ada

module-06/src/oedipus-complex_text_io.adb

morellam-dev/cs-4308-concepts-of-programming-languages

d11f78726dd02bea9b569c7c6b8669e8897631b2

[ "MIT" ]

null

module-06/src/oedipus-complex_text_io.adb

morellam-dev/cs-4308-concepts-of-programming-languages

d11f78726dd02bea9b569c7c6b8669e8897631b2

[ "MIT" ]

null

module-06/src/oedipus-complex_text_io.adb

morellam-dev/cs-4308-concepts-of-programming-languages

d11f78726dd02bea9b569c7c6b8669e8897631b2

[ "MIT" ]

null

-- FILE: oedipus-complex_text_io.adb LICENSE: MIT © 2021 Mae Morella with Oedipus, Ada.Float_Text_IO, Ada.Text_IO; use Oedipus, Ada.Float_Text_IO, Ada.Text_IO; package body Oedipus.Complex_Text_IO is subtype Field is Ada.Text_IO.Field; procedure Put (Item : in Complex; Fore : in Field := Default_Fore; Aft : in Field := Default_Aft; Exp : in Field := Default_Exp) is begin Put (Get_Real (Item), Fore, Aft, Exp); Put (" + "); Put (Get_Imaginary (Item), Fore, Aft, Exp); Put ("i"); end Put; procedure Get (Item : out Complex) is A : Float; B : Float; begin Put ("Enter real component: "); Get (A); Put ("Enter imaginary component: "); Get (B); Item := Create_Complex (A, B); end Get; end Oedipus.Complex_Text_IO;

24.848485

68

0.617073

31325ab4a6f72cd9a14a6cb656d91516a50e0ca2

2,923

adb

Ada

awordcount.adb

gtraines/ada_word_count

c3430c6c70fb0b3884478dcb816b81026968e598

[ "MIT" ]

null

awordcount.adb

gtraines/ada_word_count

c3430c6c70fb0b3884478dcb816b81026968e598

[ "MIT" ]

null

awordcount.adb

gtraines/ada_word_count

c3430c6c70fb0b3884478dcb816b81026968e598

[ "MIT" ]

null

-- Pass a filename as a command line parameter -- Parse and print out stats about the file -- - Characters -- - Lines -- - Words -- -- with Ada.Command_Line; with Ada.Integer_Text_IO; with Ada.Strings.Unbounded.Text_IO; with Ada.Strings.Unbounded; with Ada.Text_IO; use Ada.Text_IO; with GNAT.IO_Aux; with GNAT.Array_Split; with GNAT.String_Split; procedure awordcount is -- *** Variable declarations *** begin New_Line; if Ada.Command_Line.Argument_Count = 0 then Put_Line(Item => " ERROR! Filename required."); Put_Line(Item => " USAGE: awordcount file-to-get-counts-for.txt"); else declare -- *** Variable declarations *** FileName : String(1..Ada.Command_Line.Argument(1)'length); FileNameLength : Natural := Ada.Command_Line.Argument(1)'length; SourceFile : Ada.Text_IO.File_Type; begin FileName := Ada.Command_Line.Argument(1); Put(Item => "Parsing file: "); Put_Line(Item => FileName); if GNAT.IO_Aux.File_Exists(FileName) then Open(SourceFile, In_File, FileName); declare package UStrings renames Ada.Strings.Unbounded; package UnboundedIO renames Ada.Strings.Unbounded.Text_IO; CurrentLine : UStrings.Unbounded_String := UStrings.Null_Unbounded_String; CurrentLineLength : Integer := 0; CharacterCount : Integer := 0; LineCount : Integer := 0; LineWordCount : GNAT.String_Split.Slice_Number; SplitArr : GNAT.String_Split.Slice_Set; WordSeparators : String := " "; WordCount : Integer := 0; begin while not End_Of_File(SourceFile) loop CurrentLine := UnboundedIO.Get_Line(File => SourceFile); LineCount := LineCount + 1; CurrentLineLength := UStrings.To_String(CurrentLine)'Length; CharacterCount := CharacterCount + CurrentLineLength; GNAT.String_Split.Create(SplitArr, UStrings.To_String(CurrentLine), WordSeparators, Mode => GNAT.String_Split.Multiple); LineWordCount := GNAT.String_Split.Slice_Count(S => SplitArr); WordCount := WordCount + Integer(LineWordCount); end loop; Put(Item => "Characters: "); Ada.Integer_Text_IO.Put(CharacterCount); New_Line; Put(Item => "Lines: "); Ada.Integer_Text_IO.Put(LineCount); New_Line; Put(Item => "Words: "); Ada.Integer_Text_IO.Put(WordCount); end; Close(SourceFile); else Put(Item => FileName & " not found"); end if; end; end if; New_Line; New_Line; end awordcount;

35.646341

138

0.580568

063b5f1e83bd38a84438f73c3476e2c833a49e4f

4,996

adb

Ada

llvm-gcc-4.2-2.9/gcc/ada/s-pack19.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

llvm-gcc-4.2-2.9/gcc/ada/s-pack19.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

llvm-gcc-4.2-2.9/gcc/ada/s-pack19.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . P A C K _ 1 9 -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2005, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with System.Storage_Elements; with System.Unsigned_Types; with Unchecked_Conversion; package body System.Pack_19 is subtype Ofs is System.Storage_Elements.Storage_Offset; subtype Uns is System.Unsigned_Types.Unsigned; subtype N07 is System.Unsigned_Types.Unsigned range 0 .. 7; use type System.Storage_Elements.Storage_Offset; use type System.Unsigned_Types.Unsigned; type Cluster is record E0, E1, E2, E3, E4, E5, E6, E7 : Bits_19; end record; for Cluster use record E0 at 0 range 0 * Bits .. 0 * Bits + Bits - 1; E1 at 0 range 1 * Bits .. 1 * Bits + Bits - 1; E2 at 0 range 2 * Bits .. 2 * Bits + Bits - 1; E3 at 0 range 3 * Bits .. 3 * Bits + Bits - 1; E4 at 0 range 4 * Bits .. 4 * Bits + Bits - 1; E5 at 0 range 5 * Bits .. 5 * Bits + Bits - 1; E6 at 0 range 6 * Bits .. 6 * Bits + Bits - 1; E7 at 0 range 7 * Bits .. 7 * Bits + Bits - 1; end record; for Cluster'Size use Bits * 8; for Cluster'Alignment use Integer'Min (Standard'Maximum_Alignment, 1 + 1 * Boolean'Pos (Bits mod 2 = 0) + 2 * Boolean'Pos (Bits mod 4 = 0)); -- Use maximum possible alignment, given the bit field size, since this -- will result in the most efficient code possible for the field. type Cluster_Ref is access Cluster; function To_Ref is new Unchecked_Conversion (System.Address, Cluster_Ref); ------------ -- Get_19 -- ------------ function Get_19 (Arr : System.Address; N : Natural) return Bits_19 is C : constant Cluster_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8)); begin case N07 (Uns (N) mod 8) is when 0 => return C.E0; when 1 => return C.E1; when 2 => return C.E2; when 3 => return C.E3; when 4 => return C.E4; when 5 => return C.E5; when 6 => return C.E6; when 7 => return C.E7; end case; end Get_19; ------------ -- Set_19 -- ------------ procedure Set_19 (Arr : System.Address; N : Natural; E : Bits_19) is C : constant Cluster_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8)); begin case N07 (Uns (N) mod 8) is when 0 => C.E0 := E; when 1 => C.E1 := E; when 2 => C.E2 := E; when 3 => C.E3 := E; when 4 => C.E4 := E; when 5 => C.E5 := E; when 6 => C.E6 := E; when 7 => C.E7 := E; end case; end Set_19; end System.Pack_19;

43.443478

78

0.483387

12f70ff451b8513e812242e848b44bf32412c8ad

3,750

adb

Ada

tests/src/testsuite-encode_decode-random.adb

Fabien-Chouteau/COBS

155ce5c2ecb4fffdac31df9dccd1a0d0c5916c2b

[ "MIT" ]

null

tests/src/testsuite-encode_decode-random.adb

Fabien-Chouteau/COBS

155ce5c2ecb4fffdac31df9dccd1a0d0c5916c2b

[ "MIT" ]

null

tests/src/testsuite-encode_decode-random.adb

Fabien-Chouteau/COBS

155ce5c2ecb4fffdac31df9dccd1a0d0c5916c2b

[ "MIT" ]

null

with System.Storage_Elements; use System.Storage_Elements; with Ada.Containers.Indefinite_Vectors; with Ada.Numerics.Discrete_Random; with AUnit.Assertions; use AUnit.Assertions; with Test_Utils; use Test_Utils; with AAA.Strings; package body Testsuite.Encode_Decode.Random is pragma Style_Checks ("gnatyM120-s"); package Input_Frames_Package is new Ada.Containers.Indefinite_Vectors (Natural, Storage_Array); ------------------------------- -- Make_Random_Test_Scenario -- ------------------------------- function Make_Random_Test_Scenario return Input_Frames_Package.Vector is type Frames_Number_Range is range 1 .. 100; subtype Frames_Length_Range is Storage_Count range 1 .. 1000; package Rand_Frames_Number is new Ada.Numerics.Discrete_Random (Frames_Number_Range); package Rand_Frames_Length is new Ada.Numerics.Discrete_Random (Frames_Length_Range); package Rand_Data is new Ada.Numerics.Discrete_Random (Storage_Element); Gen_Nbr : Rand_Frames_Number.Generator; Gen_Len : Rand_Frames_Length.Generator; Gen_Data : Rand_Data.Generator; Result : Input_Frames_Package.Vector; begin for Frame in 1 .. Rand_Frames_Number.Random (Gen_Nbr) loop declare Frame : Storage_Array (1 .. Rand_Frames_Length.Random (Gen_Len)); begin for Elt of Frame loop Elt := Rand_Data.Random (Gen_Data); end loop; Result.Append (Frame); end; end loop; return Result; end Make_Random_Test_Scenario; ----------------- -- Test_Random -- ----------------- procedure Test_Random (Fixture : in out Encoder_Decoder_Fixture) is Input : constant Input_Frames_Package.Vector := Make_Random_Test_Scenario; begin Fixture.Encoder.Clear; for Frame of Input loop for Elt of Frame loop Fixture.Encoder.Receive (Elt); end loop; Fixture.Encoder.End_Of_Frame; end loop; Fixture.Encoder.End_Of_Test; Assert (Fixture.Encoder.Number_Of_Frames = 1, "Unexpected number of encode output frames: " & Fixture.Encoder.Number_Of_Frames'Img); for Elt of Fixture.Encoder.Get_Frame (0) loop Fixture.Decoder.Receive (Elt); end loop; Fixture.Decoder.End_Of_Test; Assert (Fixture.Decoder.Number_Of_Frames = Storage_Count (Input.Length), "Unexpected number of decode output frames: " & Fixture.Decoder.Number_Of_Frames'Img); for Index in 0 .. Fixture.Decoder.Number_Of_Frames - 1 loop declare Output_Frame : constant Data_Frame := Fixture.Decoder.Get_Frame (Index); Expected_Frame : constant Data_Frame := From_Array (Input.Element (Natural (Index))); begin if Output_Frame /= Expected_Frame then declare Diff : constant AAA.Strings.Vector := Test_Utils.Diff (Expected_Frame, Output_Frame); begin Assert (False, "Error in frame #" & Index'Img & ASCII.LF & Diff.Flatten (ASCII.LF)); end; end if; end; end loop; end Test_Random; --------------- -- Add_Tests -- --------------- procedure Add_Tests (Suite : in out AUnit.Test_Suites.Test_Suite'Class) is begin for X in 1 .. 10 loop Suite.Add_Test (Encoder_Decoder_Caller.Create ("Random" & X'Img, Test_Random'Access)); end loop; end Add_Tests; end Testsuite.Encode_Decode.Random;

30.991736

80

0.609867

1d929f5c812dae4a1335a060f4a5689e9445f382

1,658

ads

Ada

src/ast_printers.ads

aeszter/lox-spark

3ec66f9620c41884463bb33a1b140d8bd7797bec

[ "MIT" ]

6

2017-02-11T05:57:22.000Z

2021-05-12T22:20:26.000Z

src/ast_printers.ads

aeszter/lox-spark

3ec66f9620c41884463bb33a1b140d8bd7797bec

[ "MIT" ]

null

src/ast_printers.ads

aeszter/lox-spark

3ec66f9620c41884463bb33a1b140d8bd7797bec

[ "MIT" ]

2

2017-02-28T12:04:23.000Z

2017-03-08T19:14:23.000Z

with Exprs; use Exprs; use Exprs.Visitors; with L_Strings; use L_Strings; package Ast_Printers is -- Creates an unambiguous, if ugly, string representation of AST nodes. -- SPARK implementation follows Matthew Heaney -- http://www.adapower.com/index.php?Command=Class&ClassID=Patterns&CID=288 -- This is because in Ada, generic functions cannot be overloaded, so we -- cannot follow Bob's implementation type Ast_Printer is new Visitor with record Image : L_String := To_Bounded_String (""); end record; function Print (V : Ast_Printer) return String; function Print (The_Expr : Expr'Class) return String; overriding procedure visit_Binary_Expr (Self : in out Ast_Printer; The_Expr : Binary) with Global => (input => Exprs.State); overriding procedure visit_Grouping_Expr (Self : in out Ast_Printer; The_Expr : Grouping); overriding procedure visit_Float_Literal_Expr (Self : in out Ast_Printer; The_Expr : Float_Literal); overriding procedure visit_Num_Literal_Expr (Self : in out Ast_Printer; The_Expr : Num_Literal); overriding procedure visit_Str_Literal_Expr (Self : in out Ast_Printer; The_Expr : Str_Literal); overriding procedure visit_Unary_Expr (Self : in out Ast_Printer; The_Expr : Unary); private function Print (The_Expr : Binary) return String; function Print (The_Expr : Grouping) return String; function Print (The_Expr : Float_Literal) return String; function Print (The_Expr : Num_Literal) return String; function Print (The_Expr : Str_Literal) return String; function Print (The_Expr : Unary) return String; end Ast_Printers;

35.276596

92

0.741255

a1d8ecec4969523b03103aed1e50f8f888c7a0f4

3,314

ada

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c35507g.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/c35507g.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- C35507G.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 'PRED' AND 'SUCC' YIELD THE CORRECT -- RESULTS WHEN THE PREFIX IS A CHARACTER TYPE. -- HISTORY: -- RJW 06/03/86 CREATED ORIGINAL TEST. -- JET 08/13/87 REMOVED TESTS INTENDED FOR C35505F. WITH REPORT; USE REPORT; PROCEDURE C35507G IS TYPE CHAR IS ('A', B); TYPE NEWCHAR IS NEW CHAR; FUNCTION IDENT (CH : CHAR) RETURN CHAR IS BEGIN RETURN CHAR'VAL (IDENT_INT (CHAR'POS (CH))); END; FUNCTION IDENT (CH : NEWCHAR) RETURN NEWCHAR IS BEGIN RETURN NEWCHAR'VAL (IDENT_INT (NEWCHAR'POS (CH))); END; BEGIN TEST( "C35507G" , "CHECK THAT THE ATTRIBUTES 'PRED' AND " & "'SUCC' YIELD THE CORRECT RESULTS WHEN THE " & "PREFIX IS A CHARACTER TYPE" ); BEGIN IF CHAR'SUCC ('A') /= B THEN FAILED ( "INCORRECT VALUE FOR CHAR'SUCC('A')" ); END IF; IF CHAR'PRED (IDENT (B)) /= 'A' THEN FAILED ( "INCORRECT VALUE FOR CHAR'PRED (IDENT (B))" ); END IF; END; BEGIN IF NEWCHAR'SUCC (IDENT ('A')) /= B THEN FAILED ( "INCORRECT VALUE FOR " & "IDENT (NEWCHAR'SUCC('A'))" ); END IF; IF NEWCHAR'PRED (B) /= 'A' THEN FAILED ( "INCORRECT VALUE FOR NEWCHAR'PRED(B)" ); END IF; END; FOR CH IN CHARACTER'VAL (1) .. CHARACTER'VAL (127) LOOP IF CHARACTER'PRED (CH) /= CHARACTER'VAL (CHARACTER'POS (CH) - 1) THEN FAILED ( "INCORRECT VALUE FOR CHARACTER'PRED OF " & CHARACTER'IMAGE (CH) ); END IF; END LOOP; FOR CH IN CHARACTER'VAL (0) .. CHARACTER'VAL (126) LOOP IF CHARACTER'SUCC (CH) /= CHARACTER'VAL (CHARACTER'POS (CH) + 1) THEN FAILED ( "INCORRECT VALUE FOR CHARACTER'SUCC OF " & CHARACTER'IMAGE (CH) ); END IF; END LOOP; RESULT; END C35507G;

34.164948

79

0.580266

18919f1e4df3ef442cfac5b1189af31fba89617d

8,394

ads

Ada

awa/plugins/awa-changelogs/src/model/awa-changelogs-models.ads

twdroeger/ada-awa

77b824773747aecb912c37b1b7b59ea414679b80

[ "Apache-2.0" ]

null

awa/plugins/awa-changelogs/src/model/awa-changelogs-models.ads

twdroeger/ada-awa

77b824773747aecb912c37b1b7b59ea414679b80

[ "Apache-2.0" ]

null

awa/plugins/awa-changelogs/src/model/awa-changelogs-models.ads

twdroeger/ada-awa

77b824773747aecb912c37b1b7b59ea414679b80

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- AWA.Changelogs.Models -- AWA.Changelogs.Models ----------------------------------------------------------------------- -- File generated by ada-gen DO NOT MODIFY -- Template used: templates/model/package-spec.xhtml -- Ada Generator: https://ada-gen.googlecode.com/svn/trunk Revision 1095 ----------------------------------------------------------------------- -- Copyright (C) 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. ----------------------------------------------------------------------- pragma Warnings (Off); with ADO.Sessions; with ADO.Objects; with ADO.Statements; with ADO.SQL; with ADO.Schemas; with Ada.Calendar; with Ada.Containers.Vectors; with Ada.Strings.Unbounded; with Util.Beans.Objects; with Util.Beans.Basic.Lists; with AWA.Users.Models; pragma Warnings (On); package AWA.Changelogs.Models is pragma Style_Checks ("-mr"); type Changelog_Ref is new ADO.Objects.Object_Ref with null record; -- Create an object key for Changelog. function Changelog_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key; -- Create an object key for Changelog from a string. -- Raises Constraint_Error if the string cannot be converted into the object key. function Changelog_Key (Id : in String) return ADO.Objects.Object_Key; Null_Changelog : constant Changelog_Ref; function "=" (Left, Right : Changelog_Ref'Class) return Boolean; -- Set the changelog identifier. procedure Set_Id (Object : in out Changelog_Ref; Value : in ADO.Identifier); -- Get the changelog identifier. function Get_Id (Object : in Changelog_Ref) return ADO.Identifier; -- Set the changelog date. procedure Set_Date (Object : in out Changelog_Ref; Value : in Ada.Calendar.Time); -- Get the changelog date. function Get_Date (Object : in Changelog_Ref) return Ada.Calendar.Time; -- Set the changelog text. procedure Set_Text (Object : in out Changelog_Ref; Value : in Ada.Strings.Unbounded.Unbounded_String); procedure Set_Text (Object : in out Changelog_Ref; Value : in String); -- Get the changelog text. function Get_Text (Object : in Changelog_Ref) return Ada.Strings.Unbounded.Unbounded_String; function Get_Text (Object : in Changelog_Ref) return String; -- Set the optional entity to which the changelog is associated. procedure Set_For_Entity_Id (Object : in out Changelog_Ref; Value : in ADO.Identifier); -- Get the optional entity to which the changelog is associated. function Get_For_Entity_Id (Object : in Changelog_Ref) return ADO.Identifier; -- procedure Set_User (Object : in out Changelog_Ref; Value : in AWA.Users.Models.User_Ref'Class); -- function Get_User (Object : in Changelog_Ref) return AWA.Users.Models.User_Ref'Class; -- procedure Set_Entity_Type (Object : in out Changelog_Ref; Value : in ADO.Entity_Type); -- function Get_Entity_Type (Object : in Changelog_Ref) return ADO.Entity_Type; -- Load the entity identified by 'Id'. -- Raises the NOT_FOUND exception if it does not exist. procedure Load (Object : in out Changelog_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier); -- Load the entity identified by 'Id'. -- Returns True in Found if the object was found and False if it does not exist. procedure Load (Object : in out Changelog_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier; Found : out Boolean); -- Find and load the entity. overriding procedure Find (Object : in out Changelog_Ref; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean); -- Save the entity. If the entity does not have an identifier, an identifier is allocated -- and it is inserted in the table. Otherwise, only data fields which have been changed -- are updated. overriding procedure Save (Object : in out Changelog_Ref; Session : in out ADO.Sessions.Master_Session'Class); -- Delete the entity. overriding procedure Delete (Object : in out Changelog_Ref; Session : in out ADO.Sessions.Master_Session'Class); overriding function Get_Value (From : in Changelog_Ref; Name : in String) return Util.Beans.Objects.Object; -- Table definition CHANGELOG_TABLE : constant ADO.Schemas.Class_Mapping_Access; -- Internal method to allocate the Object_Record instance overriding procedure Allocate (Object : in out Changelog_Ref); -- Copy of the object. procedure Copy (Object : in Changelog_Ref; Into : in out Changelog_Ref); private CHANGELOG_NAME : aliased constant String := "awa_changelog"; COL_0_1_NAME : aliased constant String := "id"; COL_1_1_NAME : aliased constant String := "date"; COL_2_1_NAME : aliased constant String := "text"; COL_3_1_NAME : aliased constant String := "for_entity_id"; COL_4_1_NAME : aliased constant String := "user_id"; COL_5_1_NAME : aliased constant String := "entity_type"; CHANGELOG_DEF : aliased constant ADO.Schemas.Class_Mapping := (Count => 6, Table => CHANGELOG_NAME'Access, Members => ( 1 => COL_0_1_NAME'Access, 2 => COL_1_1_NAME'Access, 3 => COL_2_1_NAME'Access, 4 => COL_3_1_NAME'Access, 5 => COL_4_1_NAME'Access, 6 => COL_5_1_NAME'Access) ); CHANGELOG_TABLE : constant ADO.Schemas.Class_Mapping_Access := CHANGELOG_DEF'Access; Null_Changelog : constant Changelog_Ref := Changelog_Ref'(ADO.Objects.Object_Ref with null record); type Changelog_Impl is new ADO.Objects.Object_Record (Key_Type => ADO.Objects.KEY_INTEGER, Of_Class => CHANGELOG_DEF'Access) with record Date : Ada.Calendar.Time; Text : Ada.Strings.Unbounded.Unbounded_String; For_Entity_Id : ADO.Identifier; User : AWA.Users.Models.User_Ref; Entity_Type : ADO.Entity_Type; end record; type Changelog_Access is access all Changelog_Impl; overriding procedure Destroy (Object : access Changelog_Impl); overriding procedure Find (Object : in out Changelog_Impl; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean); overriding procedure Load (Object : in out Changelog_Impl; Session : in out ADO.Sessions.Session'Class); procedure Load (Object : in out Changelog_Impl; Stmt : in out ADO.Statements.Query_Statement'Class; Session : in out ADO.Sessions.Session'Class); overriding procedure Save (Object : in out Changelog_Impl; Session : in out ADO.Sessions.Master_Session'Class); procedure Create (Object : in out Changelog_Impl; Session : in out ADO.Sessions.Master_Session'Class); overriding procedure Delete (Object : in out Changelog_Impl; Session : in out ADO.Sessions.Master_Session'Class); procedure Set_Field (Object : in out Changelog_Ref'Class; Impl : out Changelog_Access); end AWA.Changelogs.Models;

37.641256

94

0.63188

0b5501f17fedc442c177f20a7adc096522e591aa

45,705

ads

Ada

arch/ARM/STM32/svd/stm32l0x3/stm32_svd-rcc.ads

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

2

2018-05-16T03:56:39.000Z

2019-07-31T13:53:56.000Z

arch/ARM/STM32/svd/stm32l0x3/stm32_svd-rcc.ads

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

null

arch/ARM/STM32/svd/stm32l0x3/stm32_svd-rcc.ads

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

null

-- This spec has been automatically generated from STM32L0x3.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with HAL; with System; package STM32_SVD.RCC is pragma Preelaborate; --------------- -- Registers -- --------------- subtype CR_RTCPRE_Field is HAL.UInt2; -- Clock control register type CR_Register is record -- 16 MHz high-speed internal clock enable HSI16ON : Boolean := False; -- Read-only. High-speed internal clock enable bit for some IP kernels HSI16KERON : Boolean := False; -- Internal high-speed clock ready flag HSI16RDYF : Boolean := False; -- HSI16DIVEN HSI16DIVEN : Boolean := False; -- Read-only. HSI16DIVF HSI16DIVF : Boolean := False; -- 16 MHz high-speed internal clock output enable HSI16OUTEN : Boolean := False; -- unspecified Reserved_6_7 : HAL.UInt2 := 16#0#; -- MSI clock enable bit MSION : Boolean := True; -- Read-only. MSI clock ready flag MSIRDY : Boolean := True; -- unspecified Reserved_10_15 : HAL.UInt6 := 16#0#; -- HSE clock enable bit HSEON : Boolean := False; -- Read-only. HSE clock ready flag HSERDY : Boolean := False; -- HSE clock bypass bit HSEBYP : Boolean := False; -- Clock security system on HSE enable bit CSSLSEON : Boolean := False; -- TC/LCD prescaler RTCPRE : CR_RTCPRE_Field := 16#0#; -- unspecified Reserved_22_23 : HAL.UInt2 := 16#0#; -- PLL enable bit PLLON : Boolean := False; -- Read-only. PLL clock ready flag PLLRDY : Boolean := False; -- unspecified Reserved_26_31 : HAL.UInt6 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR_Register use record HSI16ON at 0 range 0 .. 0; HSI16KERON at 0 range 1 .. 1; HSI16RDYF at 0 range 2 .. 2; HSI16DIVEN at 0 range 3 .. 3; HSI16DIVF at 0 range 4 .. 4; HSI16OUTEN at 0 range 5 .. 5; Reserved_6_7 at 0 range 6 .. 7; MSION at 0 range 8 .. 8; MSIRDY at 0 range 9 .. 9; Reserved_10_15 at 0 range 10 .. 15; HSEON at 0 range 16 .. 16; HSERDY at 0 range 17 .. 17; HSEBYP at 0 range 18 .. 18; CSSLSEON at 0 range 19 .. 19; RTCPRE at 0 range 20 .. 21; Reserved_22_23 at 0 range 22 .. 23; PLLON at 0 range 24 .. 24; PLLRDY at 0 range 25 .. 25; Reserved_26_31 at 0 range 26 .. 31; end record; subtype ICSCR_HSI16CAL_Field is HAL.UInt8; subtype ICSCR_HSI16TRIM_Field is HAL.UInt5; subtype ICSCR_MSIRANGE_Field is HAL.UInt3; subtype ICSCR_MSICAL_Field is HAL.UInt8; subtype ICSCR_MSITRIM_Field is HAL.UInt8; -- Internal clock sources calibration register type ICSCR_Register is record -- Read-only. nternal high speed clock calibration HSI16CAL : ICSCR_HSI16CAL_Field := 16#0#; -- High speed internal clock trimming HSI16TRIM : ICSCR_HSI16TRIM_Field := 16#10#; -- MSI clock ranges MSIRANGE : ICSCR_MSIRANGE_Field := 16#5#; -- Read-only. MSI clock calibration MSICAL : ICSCR_MSICAL_Field := 16#0#; -- MSI clock trimming MSITRIM : ICSCR_MSITRIM_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for ICSCR_Register use record HSI16CAL at 0 range 0 .. 7; HSI16TRIM at 0 range 8 .. 12; MSIRANGE at 0 range 13 .. 15; MSICAL at 0 range 16 .. 23; MSITRIM at 0 range 24 .. 31; end record; subtype CRRCR_HSI48CAL_Field is HAL.UInt8; -- Clock recovery RC register type CRRCR_Register is record -- 48MHz HSI clock enable bit HSI48ON : Boolean := False; -- Read-only. 48MHz HSI clock ready flag HSI48RDY : Boolean := False; -- 48 MHz HSI clock divided by 6 output enable HSI48DIV6EN : Boolean := False; -- unspecified Reserved_3_7 : HAL.UInt5 := 16#0#; -- Read-only. 48 MHz HSI clock calibration HSI48CAL : CRRCR_HSI48CAL_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 CRRCR_Register use record HSI48ON at 0 range 0 .. 0; HSI48RDY at 0 range 1 .. 1; HSI48DIV6EN at 0 range 2 .. 2; Reserved_3_7 at 0 range 3 .. 7; HSI48CAL at 0 range 8 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype CFGR_SW_Field is HAL.UInt2; subtype CFGR_SWS_Field is HAL.UInt2; subtype CFGR_HPRE_Field is HAL.UInt4; -- CFGR_PPRE array element subtype CFGR_PPRE_Element is HAL.UInt3; -- CFGR_PPRE array type CFGR_PPRE_Field_Array is array (1 .. 2) of CFGR_PPRE_Element with Component_Size => 3, Size => 6; -- Type definition for CFGR_PPRE type CFGR_PPRE_Field (As_Array : Boolean := False) is record case As_Array is when False => -- PPRE as a value Val : HAL.UInt6; when True => -- PPRE as an array Arr : CFGR_PPRE_Field_Array; end case; end record with Unchecked_Union, Size => 6; for CFGR_PPRE_Field use record Val at 0 range 0 .. 5; Arr at 0 range 0 .. 5; end record; subtype CFGR_PLLMUL_Field is HAL.UInt4; subtype CFGR_PLLDIV_Field is HAL.UInt2; subtype CFGR_MCOSEL_Field is HAL.UInt4; subtype CFGR_MCOPRE_Field is HAL.UInt3; -- Clock configuration register type CFGR_Register is record -- System clock switch SW : CFGR_SW_Field := 16#0#; -- Read-only. System clock switch status SWS : CFGR_SWS_Field := 16#0#; -- AHB prescaler HPRE : CFGR_HPRE_Field := 16#0#; -- APB low-speed prescaler (APB1) PPRE : CFGR_PPRE_Field := (As_Array => False, Val => 16#0#); -- unspecified Reserved_14_14 : HAL.Bit := 16#0#; -- Wake-up from stop clock selection STOPWUCK : Boolean := False; -- PLL entry clock source PLLSRC : Boolean := False; -- unspecified Reserved_17_17 : HAL.Bit := 16#0#; -- PLL multiplication factor PLLMUL : CFGR_PLLMUL_Field := 16#0#; -- PLL output division PLLDIV : CFGR_PLLDIV_Field := 16#0#; -- Microcontroller clock output selection MCOSEL : CFGR_MCOSEL_Field := 16#0#; -- Microcontroller clock output prescaler MCOPRE : CFGR_MCOPRE_Field := 16#0#; -- unspecified Reserved_31_31 : HAL.Bit := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CFGR_Register use record SW at 0 range 0 .. 1; SWS at 0 range 2 .. 3; HPRE at 0 range 4 .. 7; PPRE at 0 range 8 .. 13; Reserved_14_14 at 0 range 14 .. 14; STOPWUCK at 0 range 15 .. 15; PLLSRC at 0 range 16 .. 16; Reserved_17_17 at 0 range 17 .. 17; PLLMUL at 0 range 18 .. 21; PLLDIV at 0 range 22 .. 23; MCOSEL at 0 range 24 .. 27; MCOPRE at 0 range 28 .. 30; Reserved_31_31 at 0 range 31 .. 31; end record; -- Clock interrupt enable register type CIER_Register is record -- Read-only. LSI ready interrupt flag LSIRDYIE : Boolean; -- Read-only. LSE ready interrupt flag LSERDYIE : Boolean; -- Read-only. HSI16 ready interrupt flag HSI16RDYIE : Boolean; -- Read-only. HSE ready interrupt flag HSERDYIE : Boolean; -- Read-only. PLL ready interrupt flag PLLRDYIE : Boolean; -- Read-only. MSI ready interrupt flag MSIRDYIE : Boolean; -- Read-only. HSI48 ready interrupt flag HSI48RDYIE : Boolean; -- Read-only. LSE CSS interrupt flag CSSLSE : Boolean; -- unspecified Reserved_8_31 : HAL.UInt24; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CIER_Register use record LSIRDYIE at 0 range 0 .. 0; LSERDYIE at 0 range 1 .. 1; HSI16RDYIE at 0 range 2 .. 2; HSERDYIE at 0 range 3 .. 3; PLLRDYIE at 0 range 4 .. 4; MSIRDYIE at 0 range 5 .. 5; HSI48RDYIE at 0 range 6 .. 6; CSSLSE at 0 range 7 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; -- Clock interrupt flag register type CIFR_Register is record -- Read-only. LSI ready interrupt flag LSIRDYF : Boolean; -- Read-only. LSE ready interrupt flag LSERDYF : Boolean; -- Read-only. HSI16 ready interrupt flag HSI16RDYF : Boolean; -- Read-only. HSE ready interrupt flag HSERDYF : Boolean; -- Read-only. PLL ready interrupt flag PLLRDYF : Boolean; -- Read-only. MSI ready interrupt flag MSIRDYF : Boolean; -- Read-only. HSI48 ready interrupt flag HSI48RDYF : Boolean; -- Read-only. LSE Clock Security System Interrupt flag CSSLSEF : Boolean; -- Read-only. Clock Security System Interrupt flag CSSHSEF : Boolean; -- unspecified Reserved_9_31 : HAL.UInt23; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CIFR_Register use record LSIRDYF at 0 range 0 .. 0; LSERDYF at 0 range 1 .. 1; HSI16RDYF at 0 range 2 .. 2; HSERDYF at 0 range 3 .. 3; PLLRDYF at 0 range 4 .. 4; MSIRDYF at 0 range 5 .. 5; HSI48RDYF at 0 range 6 .. 6; CSSLSEF at 0 range 7 .. 7; CSSHSEF at 0 range 8 .. 8; Reserved_9_31 at 0 range 9 .. 31; end record; -- Clock interrupt clear register type CICR_Register is record -- Read-only. LSI ready Interrupt clear LSIRDYC : Boolean; -- Read-only. LSE ready Interrupt clear LSERDYC : Boolean; -- Read-only. HSI16 ready Interrupt clear HSI16RDYC : Boolean; -- Read-only. HSE ready Interrupt clear HSERDYC : Boolean; -- Read-only. PLL ready Interrupt clear PLLRDYC : Boolean; -- Read-only. MSI ready Interrupt clear MSIRDYC : Boolean; -- Read-only. HSI48 ready Interrupt clear HSI48RDYC : Boolean; -- Read-only. LSE Clock Security System Interrupt clear CSSLSEC : Boolean; -- Read-only. Clock Security System Interrupt clear CSSHSEC : Boolean; -- unspecified Reserved_9_31 : HAL.UInt23; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CICR_Register use record LSIRDYC at 0 range 0 .. 0; LSERDYC at 0 range 1 .. 1; HSI16RDYC at 0 range 2 .. 2; HSERDYC at 0 range 3 .. 3; PLLRDYC at 0 range 4 .. 4; MSIRDYC at 0 range 5 .. 5; HSI48RDYC at 0 range 6 .. 6; CSSLSEC at 0 range 7 .. 7; CSSHSEC at 0 range 8 .. 8; Reserved_9_31 at 0 range 9 .. 31; end record; -- GPIO reset register type IOPRSTR_Register is record -- I/O port A reset IOPARST : Boolean := False; -- I/O port B reset IOPBRST : Boolean := False; -- I/O port A reset IOPCRST : Boolean := False; -- I/O port D reset IOPDRST : Boolean := False; -- I/O port E reset IOPERST : Boolean := False; -- unspecified Reserved_5_6 : HAL.UInt2 := 16#0#; -- I/O port H reset IOPHRST : Boolean := False; -- unspecified Reserved_8_31 : HAL.UInt24 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for IOPRSTR_Register use record IOPARST at 0 range 0 .. 0; IOPBRST at 0 range 1 .. 1; IOPCRST at 0 range 2 .. 2; IOPDRST at 0 range 3 .. 3; IOPERST at 0 range 4 .. 4; Reserved_5_6 at 0 range 5 .. 6; IOPHRST at 0 range 7 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; -- AHB peripheral reset register type AHBRSTR_Register is record -- DMA reset DMARST : Boolean := False; -- unspecified Reserved_1_7 : HAL.UInt7 := 16#0#; -- Memory interface reset MIFRST : Boolean := False; -- unspecified Reserved_9_11 : HAL.UInt3 := 16#0#; -- Test integration module reset CRCRST : Boolean := False; -- unspecified Reserved_13_15 : HAL.UInt3 := 16#0#; -- Touch Sensing reset TOUCHRST : Boolean := False; -- unspecified Reserved_17_19 : HAL.UInt3 := 16#0#; -- Random Number Generator module reset RNGRST : Boolean := False; -- unspecified Reserved_21_23 : HAL.UInt3 := 16#0#; -- Crypto module reset CRYPRST : Boolean := False; -- unspecified Reserved_25_31 : HAL.UInt7 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for AHBRSTR_Register use record DMARST at 0 range 0 .. 0; Reserved_1_7 at 0 range 1 .. 7; MIFRST at 0 range 8 .. 8; Reserved_9_11 at 0 range 9 .. 11; CRCRST at 0 range 12 .. 12; Reserved_13_15 at 0 range 13 .. 15; TOUCHRST at 0 range 16 .. 16; Reserved_17_19 at 0 range 17 .. 19; RNGRST at 0 range 20 .. 20; Reserved_21_23 at 0 range 21 .. 23; CRYPRST at 0 range 24 .. 24; Reserved_25_31 at 0 range 25 .. 31; end record; -- APB2 peripheral reset register type APB2RSTR_Register is record -- System configuration controller reset SYSCFGRST : Boolean := False; -- unspecified Reserved_1_1 : HAL.Bit := 16#0#; -- TIM21 timer reset TIM21RST : Boolean := False; -- unspecified Reserved_3_4 : HAL.UInt2 := 16#0#; -- TIM22 timer reset TM12RST : Boolean := False; -- unspecified Reserved_6_8 : HAL.UInt3 := 16#0#; -- ADC interface reset ADCRST : Boolean := False; -- unspecified Reserved_10_11 : HAL.UInt2 := 16#0#; -- SPI 1 reset SPI1RST : Boolean := False; -- unspecified Reserved_13_13 : HAL.Bit := 16#0#; -- USART1 reset USART1RST : Boolean := False; -- unspecified Reserved_15_21 : HAL.UInt7 := 16#0#; -- DBG reset DBGRST : Boolean := False; -- unspecified Reserved_23_31 : HAL.UInt9 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for APB2RSTR_Register use record SYSCFGRST at 0 range 0 .. 0; Reserved_1_1 at 0 range 1 .. 1; TIM21RST at 0 range 2 .. 2; Reserved_3_4 at 0 range 3 .. 4; TM12RST at 0 range 5 .. 5; Reserved_6_8 at 0 range 6 .. 8; ADCRST at 0 range 9 .. 9; Reserved_10_11 at 0 range 10 .. 11; SPI1RST at 0 range 12 .. 12; Reserved_13_13 at 0 range 13 .. 13; USART1RST at 0 range 14 .. 14; Reserved_15_21 at 0 range 15 .. 21; DBGRST at 0 range 22 .. 22; Reserved_23_31 at 0 range 23 .. 31; end record; -- APB1 peripheral reset register type APB1RSTR_Register is record -- Timer2 reset TIM2RST : Boolean := False; -- Timer3 reset TIM3RST : Boolean := False; -- unspecified Reserved_2_3 : HAL.UInt2 := 16#0#; -- Timer 6 reset TIM6RST : Boolean := False; -- Timer 7 reset TIM7RST : Boolean := False; -- unspecified Reserved_6_10 : HAL.UInt5 := 16#0#; -- Window watchdog reset WWDRST : Boolean := False; -- unspecified Reserved_12_13 : HAL.UInt2 := 16#0#; -- SPI2 reset SPI2RST : Boolean := False; -- unspecified Reserved_15_16 : HAL.UInt2 := 16#0#; -- UART2 reset LPUART12RST : Boolean := False; -- LPUART1 reset LPUART1RST : Boolean := False; -- USART4 reset USART4RST : Boolean := False; -- USART5 reset USART5RST : Boolean := False; -- I2C1 reset I2C1RST : Boolean := False; -- I2C2 reset I2C2RST : Boolean := False; -- USB reset USBRST : Boolean := False; -- unspecified Reserved_24_26 : HAL.UInt3 := 16#0#; -- Clock recovery system reset CRSRST : Boolean := False; -- Power interface reset PWRRST : Boolean := False; -- DAC interface reset DACRST : Boolean := False; -- I2C3 reset I2C3RST : Boolean := False; -- Low power timer reset LPTIM1RST : Boolean := False; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for APB1RSTR_Register use record TIM2RST at 0 range 0 .. 0; TIM3RST at 0 range 1 .. 1; Reserved_2_3 at 0 range 2 .. 3; TIM6RST at 0 range 4 .. 4; TIM7RST at 0 range 5 .. 5; Reserved_6_10 at 0 range 6 .. 10; WWDRST at 0 range 11 .. 11; Reserved_12_13 at 0 range 12 .. 13; SPI2RST at 0 range 14 .. 14; Reserved_15_16 at 0 range 15 .. 16; LPUART12RST at 0 range 17 .. 17; LPUART1RST at 0 range 18 .. 18; USART4RST at 0 range 19 .. 19; USART5RST at 0 range 20 .. 20; I2C1RST at 0 range 21 .. 21; I2C2RST at 0 range 22 .. 22; USBRST at 0 range 23 .. 23; Reserved_24_26 at 0 range 24 .. 26; CRSRST at 0 range 27 .. 27; PWRRST at 0 range 28 .. 28; DACRST at 0 range 29 .. 29; I2C3RST at 0 range 30 .. 30; LPTIM1RST at 0 range 31 .. 31; end record; -- GPIO clock enable register type IOPENR_Register is record -- IO port A clock enable bit IOPAEN : Boolean := False; -- IO port B clock enable bit IOPBEN : Boolean := False; -- IO port A clock enable bit IOPCEN : Boolean := False; -- I/O port D clock enable bit IOPDEN : Boolean := False; -- I/O port E clock enable bit IOPEEN : Boolean := False; -- unspecified Reserved_5_6 : HAL.UInt2 := 16#0#; -- I/O port H clock enable bit IOPHEN : Boolean := False; -- unspecified Reserved_8_31 : HAL.UInt24 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for IOPENR_Register use record IOPAEN at 0 range 0 .. 0; IOPBEN at 0 range 1 .. 1; IOPCEN at 0 range 2 .. 2; IOPDEN at 0 range 3 .. 3; IOPEEN at 0 range 4 .. 4; Reserved_5_6 at 0 range 5 .. 6; IOPHEN at 0 range 7 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; -- AHB peripheral clock enable register type AHBENR_Register is record -- DMA clock enable bit DMAEN : Boolean := False; -- unspecified Reserved_1_7 : HAL.UInt7 := 16#0#; -- NVM interface clock enable bit MIFEN : Boolean := True; -- unspecified Reserved_9_11 : HAL.UInt3 := 16#0#; -- CRC clock enable bit CRCEN : Boolean := False; -- unspecified Reserved_13_15 : HAL.UInt3 := 16#0#; -- Touch Sensing clock enable bit TOUCHEN : Boolean := False; -- unspecified Reserved_17_19 : HAL.UInt3 := 16#0#; -- Random Number Generator clock enable bit RNGEN : Boolean := False; -- unspecified Reserved_21_23 : HAL.UInt3 := 16#0#; -- Crypto clock enable bit CRYPEN : Boolean := False; -- unspecified Reserved_25_31 : HAL.UInt7 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for AHBENR_Register use record DMAEN at 0 range 0 .. 0; Reserved_1_7 at 0 range 1 .. 7; MIFEN at 0 range 8 .. 8; Reserved_9_11 at 0 range 9 .. 11; CRCEN at 0 range 12 .. 12; Reserved_13_15 at 0 range 13 .. 15; TOUCHEN at 0 range 16 .. 16; Reserved_17_19 at 0 range 17 .. 19; RNGEN at 0 range 20 .. 20; Reserved_21_23 at 0 range 21 .. 23; CRYPEN at 0 range 24 .. 24; Reserved_25_31 at 0 range 25 .. 31; end record; -- APB2 peripheral clock enable register type APB2ENR_Register is record -- System configuration controller clock enable bit SYSCFGEN : Boolean := False; -- unspecified Reserved_1_1 : HAL.Bit := 16#0#; -- TIM21 timer clock enable bit TIM21EN : Boolean := False; -- unspecified Reserved_3_4 : HAL.UInt2 := 16#0#; -- TIM22 timer clock enable bit TIM22EN : Boolean := False; -- unspecified Reserved_6_6 : HAL.Bit := 16#0#; -- MiFaRe Firewall clock enable bit MIFIEN : Boolean := False; -- unspecified Reserved_8_8 : HAL.Bit := 16#0#; -- ADC clock enable bit ADCEN : Boolean := False; -- unspecified Reserved_10_11 : HAL.UInt2 := 16#0#; -- SPI1 clock enable bit SPI1EN : Boolean := False; -- unspecified Reserved_13_13 : HAL.Bit := 16#0#; -- USART1 clock enable bit USART1EN : Boolean := False; -- unspecified Reserved_15_21 : HAL.UInt7 := 16#0#; -- DBG clock enable bit DBGEN : Boolean := False; -- unspecified Reserved_23_31 : HAL.UInt9 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for APB2ENR_Register use record SYSCFGEN at 0 range 0 .. 0; Reserved_1_1 at 0 range 1 .. 1; TIM21EN at 0 range 2 .. 2; Reserved_3_4 at 0 range 3 .. 4; TIM22EN at 0 range 5 .. 5; Reserved_6_6 at 0 range 6 .. 6; MIFIEN at 0 range 7 .. 7; Reserved_8_8 at 0 range 8 .. 8; ADCEN at 0 range 9 .. 9; Reserved_10_11 at 0 range 10 .. 11; SPI1EN at 0 range 12 .. 12; Reserved_13_13 at 0 range 13 .. 13; USART1EN at 0 range 14 .. 14; Reserved_15_21 at 0 range 15 .. 21; DBGEN at 0 range 22 .. 22; Reserved_23_31 at 0 range 23 .. 31; end record; -- APB1 peripheral clock enable register type APB1ENR_Register is record -- Timer2 clock enable bit TIM2EN : Boolean := False; -- Timer3 clock enable bit TIM3EN : Boolean := False; -- unspecified Reserved_2_3 : HAL.UInt2 := 16#0#; -- Timer 6 clock enable bit TIM6EN : Boolean := False; -- Timer 7 clock enable bit TIM7EN : Boolean := False; -- unspecified Reserved_6_10 : HAL.UInt5 := 16#0#; -- Window watchdog clock enable bit WWDGEN : Boolean := False; -- unspecified Reserved_12_13 : HAL.UInt2 := 16#0#; -- SPI2 clock enable bit SPI2EN : Boolean := False; -- unspecified Reserved_15_16 : HAL.UInt2 := 16#0#; -- UART2 clock enable bit USART2EN : Boolean := False; -- LPUART1 clock enable bit LPUART1EN : Boolean := False; -- USART4 clock enable bit USART4EN : Boolean := False; -- USART5 clock enable bit USART5EN : Boolean := False; -- I2C1 clock enable bit I2C1EN : Boolean := False; -- I2C2 clock enable bit I2C2EN : Boolean := False; -- USB clock enable bit USBEN : Boolean := False; -- unspecified Reserved_24_26 : HAL.UInt3 := 16#0#; -- Clock recovery system clock enable bit CRSEN : Boolean := False; -- Power interface clock enable bit PWREN : Boolean := False; -- DAC interface clock enable bit DACEN : Boolean := False; -- I2C3 clock enable bit I2C3EN : Boolean := False; -- Low power timer clock enable bit LPTIM1EN : Boolean := False; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for APB1ENR_Register use record TIM2EN at 0 range 0 .. 0; TIM3EN at 0 range 1 .. 1; Reserved_2_3 at 0 range 2 .. 3; TIM6EN at 0 range 4 .. 4; TIM7EN at 0 range 5 .. 5; Reserved_6_10 at 0 range 6 .. 10; WWDGEN at 0 range 11 .. 11; Reserved_12_13 at 0 range 12 .. 13; SPI2EN at 0 range 14 .. 14; Reserved_15_16 at 0 range 15 .. 16; USART2EN at 0 range 17 .. 17; LPUART1EN at 0 range 18 .. 18; USART4EN at 0 range 19 .. 19; USART5EN at 0 range 20 .. 20; I2C1EN at 0 range 21 .. 21; I2C2EN at 0 range 22 .. 22; USBEN at 0 range 23 .. 23; Reserved_24_26 at 0 range 24 .. 26; CRSEN at 0 range 27 .. 27; PWREN at 0 range 28 .. 28; DACEN at 0 range 29 .. 29; I2C3EN at 0 range 30 .. 30; LPTIM1EN at 0 range 31 .. 31; end record; -- GPIO clock enable in sleep mode register type IOPSMEN_Register is record -- IOPASMEN IOPASMEN : Boolean := True; -- IOPBSMEN IOPBSMEN : Boolean := True; -- IOPCSMEN IOPCSMEN : Boolean := True; -- IOPDSMEN IOPDSMEN : Boolean := True; -- Port E clock enable during Sleep mode bit IOPESMEN : Boolean := False; -- unspecified Reserved_5_6 : HAL.UInt2 := 16#0#; -- IOPHSMEN IOPHSMEN : Boolean := True; -- unspecified Reserved_8_31 : HAL.UInt24 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for IOPSMEN_Register use record IOPASMEN at 0 range 0 .. 0; IOPBSMEN at 0 range 1 .. 1; IOPCSMEN at 0 range 2 .. 2; IOPDSMEN at 0 range 3 .. 3; IOPESMEN at 0 range 4 .. 4; Reserved_5_6 at 0 range 5 .. 6; IOPHSMEN at 0 range 7 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; -- AHB peripheral clock enable in sleep mode register type AHBSMENR_Register is record -- DMA clock enable during sleep mode bit DMASMEN : Boolean := True; -- unspecified Reserved_1_7 : HAL.UInt7 := 16#0#; -- NVM interface clock enable during sleep mode bit MIFSMEN : Boolean := True; -- SRAM interface clock enable during sleep mode bit SRAMSMEN : Boolean := True; -- unspecified Reserved_10_11 : HAL.UInt2 := 16#0#; -- CRC clock enable during sleep mode bit CRCSMEN : Boolean := True; -- unspecified Reserved_13_15 : HAL.UInt3 := 16#0#; -- Touch Sensing clock enable during sleep mode bit TOUCHSMEN : Boolean := True; -- unspecified Reserved_17_19 : HAL.UInt3 := 16#0#; -- Random Number Generator clock enable during sleep mode bit RNGSMEN : Boolean := True; -- unspecified Reserved_21_23 : HAL.UInt3 := 16#0#; -- Crypto clock enable during sleep mode bit CRYPSMEN : Boolean := True; -- unspecified Reserved_25_31 : HAL.UInt7 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for AHBSMENR_Register use record DMASMEN at 0 range 0 .. 0; Reserved_1_7 at 0 range 1 .. 7; MIFSMEN at 0 range 8 .. 8; SRAMSMEN at 0 range 9 .. 9; Reserved_10_11 at 0 range 10 .. 11; CRCSMEN at 0 range 12 .. 12; Reserved_13_15 at 0 range 13 .. 15; TOUCHSMEN at 0 range 16 .. 16; Reserved_17_19 at 0 range 17 .. 19; RNGSMEN at 0 range 20 .. 20; Reserved_21_23 at 0 range 21 .. 23; CRYPSMEN at 0 range 24 .. 24; Reserved_25_31 at 0 range 25 .. 31; end record; -- APB2 peripheral clock enable in sleep mode register type APB2SMENR_Register is record -- System configuration controller clock enable during sleep mode bit SYSCFGSMEN : Boolean := True; -- unspecified Reserved_1_1 : HAL.Bit := 16#0#; -- TIM21 timer clock enable during sleep mode bit TIM21SMEN : Boolean := True; -- unspecified Reserved_3_4 : HAL.UInt2 := 16#0#; -- TIM22 timer clock enable during sleep mode bit TIM22SMEN : Boolean := True; -- unspecified Reserved_6_8 : HAL.UInt3 := 16#0#; -- ADC clock enable during sleep mode bit ADCSMEN : Boolean := True; -- unspecified Reserved_10_11 : HAL.UInt2 := 16#0#; -- SPI1 clock enable during sleep mode bit SPI1SMEN : Boolean := True; -- unspecified Reserved_13_13 : HAL.Bit := 16#0#; -- USART1 clock enable during sleep mode bit USART1SMEN : Boolean := True; -- unspecified Reserved_15_21 : HAL.UInt7 := 16#0#; -- DBG clock enable during sleep mode bit DBGSMEN : Boolean := True; -- unspecified Reserved_23_31 : HAL.UInt9 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for APB2SMENR_Register use record SYSCFGSMEN at 0 range 0 .. 0; Reserved_1_1 at 0 range 1 .. 1; TIM21SMEN at 0 range 2 .. 2; Reserved_3_4 at 0 range 3 .. 4; TIM22SMEN at 0 range 5 .. 5; Reserved_6_8 at 0 range 6 .. 8; ADCSMEN at 0 range 9 .. 9; Reserved_10_11 at 0 range 10 .. 11; SPI1SMEN at 0 range 12 .. 12; Reserved_13_13 at 0 range 13 .. 13; USART1SMEN at 0 range 14 .. 14; Reserved_15_21 at 0 range 15 .. 21; DBGSMEN at 0 range 22 .. 22; Reserved_23_31 at 0 range 23 .. 31; end record; -- APB1 peripheral clock enable in sleep mode register type APB1SMENR_Register is record -- Timer2 clock enable during sleep mode bit TIM2SMEN : Boolean := True; -- Timer3 clock enable during Sleep mode bit TIM3SMEN : Boolean := False; -- unspecified Reserved_2_3 : HAL.UInt2 := 16#0#; -- Timer 6 clock enable during sleep mode bit TIM6SMEN : Boolean := True; -- Timer 7 clock enable during Sleep mode bit TIM7SMEN : Boolean := False; -- unspecified Reserved_6_10 : HAL.UInt5 := 16#8#; -- Window watchdog clock enable during sleep mode bit WWDGSMEN : Boolean := True; -- unspecified Reserved_12_13 : HAL.UInt2 := 16#0#; -- SPI2 clock enable during sleep mode bit SPI2SMEN : Boolean := True; -- unspecified Reserved_15_16 : HAL.UInt2 := 16#0#; -- UART2 clock enable during sleep mode bit USART2SMEN : Boolean := True; -- LPUART1 clock enable during sleep mode bit LPUART1SMEN : Boolean := True; -- USART4 clock enable during Sleep mode bit USART4SMEN : Boolean := False; -- USART5 clock enable during Sleep mode bit USART5SMEN : Boolean := False; -- I2C1 clock enable during sleep mode bit I2C1SMEN : Boolean := True; -- I2C2 clock enable during sleep mode bit I2C2SMEN : Boolean := True; -- USB clock enable during sleep mode bit USBSMEN : Boolean := True; -- unspecified Reserved_24_26 : HAL.UInt3 := 16#0#; -- Clock recovery system clock enable during sleep mode bit CRSSMEN : Boolean := True; -- Power interface clock enable during sleep mode bit PWRSMEN : Boolean := True; -- DAC interface clock enable during sleep mode bit DACSMEN : Boolean := True; -- 2C3 clock enable during Sleep mode bit I2C3SMEN : Boolean := False; -- Low power timer clock enable during sleep mode bit LPTIM1SMEN : Boolean := True; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for APB1SMENR_Register use record TIM2SMEN at 0 range 0 .. 0; TIM3SMEN at 0 range 1 .. 1; Reserved_2_3 at 0 range 2 .. 3; TIM6SMEN at 0 range 4 .. 4; TIM7SMEN at 0 range 5 .. 5; Reserved_6_10 at 0 range 6 .. 10; WWDGSMEN at 0 range 11 .. 11; Reserved_12_13 at 0 range 12 .. 13; SPI2SMEN at 0 range 14 .. 14; Reserved_15_16 at 0 range 15 .. 16; USART2SMEN at 0 range 17 .. 17; LPUART1SMEN at 0 range 18 .. 18; USART4SMEN at 0 range 19 .. 19; USART5SMEN at 0 range 20 .. 20; I2C1SMEN at 0 range 21 .. 21; I2C2SMEN at 0 range 22 .. 22; USBSMEN at 0 range 23 .. 23; Reserved_24_26 at 0 range 24 .. 26; CRSSMEN at 0 range 27 .. 27; PWRSMEN at 0 range 28 .. 28; DACSMEN at 0 range 29 .. 29; I2C3SMEN at 0 range 30 .. 30; LPTIM1SMEN at 0 range 31 .. 31; end record; -- CCIPR_USART1SEL array type CCIPR_USART1SEL_Field_Array is array (0 .. 1) of Boolean with Component_Size => 1, Size => 2; -- Type definition for CCIPR_USART1SEL type CCIPR_USART1SEL_Field (As_Array : Boolean := False) is record case As_Array is when False => -- USART1SEL as a value Val : HAL.UInt2; when True => -- USART1SEL as an array Arr : CCIPR_USART1SEL_Field_Array; end case; end record with Unchecked_Union, Size => 2; for CCIPR_USART1SEL_Field use record Val at 0 range 0 .. 1; Arr at 0 range 0 .. 1; end record; -- CCIPR_USART2SEL array type CCIPR_USART2SEL_Field_Array is array (0 .. 1) of Boolean with Component_Size => 1, Size => 2; -- Type definition for CCIPR_USART2SEL type CCIPR_USART2SEL_Field (As_Array : Boolean := False) is record case As_Array is when False => -- USART2SEL as a value Val : HAL.UInt2; when True => -- USART2SEL as an array Arr : CCIPR_USART2SEL_Field_Array; end case; end record with Unchecked_Union, Size => 2; for CCIPR_USART2SEL_Field use record Val at 0 range 0 .. 1; Arr at 0 range 0 .. 1; end record; -- CCIPR_LPUART1SEL array type CCIPR_LPUART1SEL_Field_Array is array (0 .. 1) of Boolean with Component_Size => 1, Size => 2; -- Type definition for CCIPR_LPUART1SEL type CCIPR_LPUART1SEL_Field (As_Array : Boolean := False) is record case As_Array is when False => -- LPUART1SEL as a value Val : HAL.UInt2; when True => -- LPUART1SEL as an array Arr : CCIPR_LPUART1SEL_Field_Array; end case; end record with Unchecked_Union, Size => 2; for CCIPR_LPUART1SEL_Field use record Val at 0 range 0 .. 1; Arr at 0 range 0 .. 1; end record; -- CCIPR_I2C1SEL array type CCIPR_I2C1SEL_Field_Array is array (0 .. 1) of Boolean with Component_Size => 1, Size => 2; -- Type definition for CCIPR_I2C1SEL type CCIPR_I2C1SEL_Field (As_Array : Boolean := False) is record case As_Array is when False => -- I2C1SEL as a value Val : HAL.UInt2; when True => -- I2C1SEL as an array Arr : CCIPR_I2C1SEL_Field_Array; end case; end record with Unchecked_Union, Size => 2; for CCIPR_I2C1SEL_Field use record Val at 0 range 0 .. 1; Arr at 0 range 0 .. 1; end record; subtype CCIPR_I2C3SEL_Field is HAL.UInt2; -- CCIPR_LPTIM1SEL array type CCIPR_LPTIM1SEL_Field_Array is array (0 .. 1) of Boolean with Component_Size => 1, Size => 2; -- Type definition for CCIPR_LPTIM1SEL type CCIPR_LPTIM1SEL_Field (As_Array : Boolean := False) is record case As_Array is when False => -- LPTIM1SEL as a value Val : HAL.UInt2; when True => -- LPTIM1SEL as an array Arr : CCIPR_LPTIM1SEL_Field_Array; end case; end record with Unchecked_Union, Size => 2; for CCIPR_LPTIM1SEL_Field use record Val at 0 range 0 .. 1; Arr at 0 range 0 .. 1; end record; -- Clock configuration register type CCIPR_Register is record -- USART1SEL0 USART1SEL : CCIPR_USART1SEL_Field := (As_Array => False, Val => 16#0#); -- USART2SEL0 USART2SEL : CCIPR_USART2SEL_Field := (As_Array => False, Val => 16#0#); -- unspecified Reserved_4_9 : HAL.UInt6 := 16#0#; -- LPUART1SEL0 LPUART1SEL : CCIPR_LPUART1SEL_Field := (As_Array => False, Val => 16#0#); -- I2C1SEL0 I2C1SEL : CCIPR_I2C1SEL_Field := (As_Array => False, Val => 16#0#); -- unspecified Reserved_14_15 : HAL.UInt2 := 16#0#; -- I2C3 clock source selection bits I2C3SEL : CCIPR_I2C3SEL_Field := 16#0#; -- LPTIM1SEL0 LPTIM1SEL : CCIPR_LPTIM1SEL_Field := (As_Array => False, Val => 16#0#); -- unspecified Reserved_20_25 : HAL.UInt6 := 16#0#; -- 48 MHz HSI48 clock source selection bit HSI48MSEL : Boolean := False; -- unspecified Reserved_27_31 : HAL.UInt5 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CCIPR_Register use record USART1SEL at 0 range 0 .. 1; USART2SEL at 0 range 2 .. 3; Reserved_4_9 at 0 range 4 .. 9; LPUART1SEL at 0 range 10 .. 11; I2C1SEL at 0 range 12 .. 13; Reserved_14_15 at 0 range 14 .. 15; I2C3SEL at 0 range 16 .. 17; LPTIM1SEL at 0 range 18 .. 19; Reserved_20_25 at 0 range 20 .. 25; HSI48MSEL at 0 range 26 .. 26; Reserved_27_31 at 0 range 27 .. 31; end record; subtype CSR_LSEDRV_Field is HAL.UInt2; subtype CSR_RTCSEL_Field is HAL.UInt2; -- Control and status register type CSR_Register is record -- Internal low-speed oscillator enable LSION : Boolean := False; -- Internal low-speed oscillator ready bit LSIRDY : Boolean := False; -- unspecified Reserved_2_7 : HAL.UInt6 := 16#0#; -- External low-speed oscillator enable bit LSEON : Boolean := False; -- Read-only. External low-speed oscillator ready bit LSERDY : Boolean := False; -- External low-speed oscillator bypass bit LSEBYP : Boolean := False; -- LSEDRV LSEDRV : CSR_LSEDRV_Field := 16#0#; -- CSSLSEON CSSLSEON : Boolean := False; -- CSS on LSE failure detection flag CSSLSED : Boolean := False; -- unspecified Reserved_15_15 : HAL.Bit := 16#0#; -- RTC and LCD clock source selection bits RTCSEL : CSR_RTCSEL_Field := 16#0#; -- RTC clock enable bit RTCEN : Boolean := False; -- RTC software reset bit RTCRST : Boolean := False; -- unspecified Reserved_20_23 : HAL.UInt4 := 16#0#; -- Remove reset flag RMVF : Boolean := False; -- OBLRSTF OBLRSTF : Boolean := False; -- PIN reset flag PINRSTF : Boolean := True; -- POR/PDR reset flag PORRSTF : Boolean := True; -- Software reset flag SFTRSTF : Boolean := False; -- Independent watchdog reset flag IWDGRSTF : Boolean := False; -- Window watchdog reset flag WWDGRSTF : Boolean := False; -- Low-power reset flag LPWRSTF : Boolean := False; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CSR_Register use record LSION at 0 range 0 .. 0; LSIRDY at 0 range 1 .. 1; Reserved_2_7 at 0 range 2 .. 7; LSEON at 0 range 8 .. 8; LSERDY at 0 range 9 .. 9; LSEBYP at 0 range 10 .. 10; LSEDRV at 0 range 11 .. 12; CSSLSEON at 0 range 13 .. 13; CSSLSED at 0 range 14 .. 14; Reserved_15_15 at 0 range 15 .. 15; RTCSEL at 0 range 16 .. 17; RTCEN at 0 range 18 .. 18; RTCRST at 0 range 19 .. 19; Reserved_20_23 at 0 range 20 .. 23; RMVF at 0 range 24 .. 24; OBLRSTF at 0 range 25 .. 25; PINRSTF at 0 range 26 .. 26; PORRSTF at 0 range 27 .. 27; SFTRSTF at 0 range 28 .. 28; IWDGRSTF at 0 range 29 .. 29; WWDGRSTF at 0 range 30 .. 30; LPWRSTF at 0 range 31 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Reset and clock control type RCC_Peripheral is record -- Clock control register CR : aliased CR_Register; -- Internal clock sources calibration register ICSCR : aliased ICSCR_Register; -- Clock recovery RC register CRRCR : aliased CRRCR_Register; -- Clock configuration register CFGR : aliased CFGR_Register; -- Clock interrupt enable register CIER : aliased CIER_Register; -- Clock interrupt flag register CIFR : aliased CIFR_Register; -- Clock interrupt clear register CICR : aliased CICR_Register; -- GPIO reset register IOPRSTR : aliased IOPRSTR_Register; -- AHB peripheral reset register AHBRSTR : aliased AHBRSTR_Register; -- APB2 peripheral reset register APB2RSTR : aliased APB2RSTR_Register; -- APB1 peripheral reset register APB1RSTR : aliased APB1RSTR_Register; -- GPIO clock enable register IOPENR : aliased IOPENR_Register; -- AHB peripheral clock enable register AHBENR : aliased AHBENR_Register; -- APB2 peripheral clock enable register APB2ENR : aliased APB2ENR_Register; -- APB1 peripheral clock enable register APB1ENR : aliased APB1ENR_Register; -- GPIO clock enable in sleep mode register IOPSMEN : aliased IOPSMEN_Register; -- AHB peripheral clock enable in sleep mode register AHBSMENR : aliased AHBSMENR_Register; -- APB2 peripheral clock enable in sleep mode register APB2SMENR : aliased APB2SMENR_Register; -- APB1 peripheral clock enable in sleep mode register APB1SMENR : aliased APB1SMENR_Register; -- Clock configuration register CCIPR : aliased CCIPR_Register; -- Control and status register CSR : aliased CSR_Register; end record with Volatile; for RCC_Peripheral use record CR at 16#0# range 0 .. 31; ICSCR at 16#4# range 0 .. 31; CRRCR at 16#8# range 0 .. 31; CFGR at 16#C# range 0 .. 31; CIER at 16#10# range 0 .. 31; CIFR at 16#14# range 0 .. 31; CICR at 16#18# range 0 .. 31; IOPRSTR at 16#1C# range 0 .. 31; AHBRSTR at 16#20# range 0 .. 31; APB2RSTR at 16#24# range 0 .. 31; APB1RSTR at 16#28# range 0 .. 31; IOPENR at 16#2C# range 0 .. 31; AHBENR at 16#30# range 0 .. 31; APB2ENR at 16#34# range 0 .. 31; APB1ENR at 16#38# range 0 .. 31; IOPSMEN at 16#3C# range 0 .. 31; AHBSMENR at 16#40# range 0 .. 31; APB2SMENR at 16#44# range 0 .. 31; APB1SMENR at 16#48# range 0 .. 31; CCIPR at 16#4C# range 0 .. 31; CSR at 16#50# range 0 .. 31; end record; -- Reset and clock control RCC_Periph : aliased RCC_Peripheral with Import, Address => System'To_Address (16#40021000#); end STM32_SVD.RCC;

35.211864

77

0.559632

2f32c4187d39db4f747c365e3f1a9e5151d286c9

5,860

ads

Ada

source/amf/dd/amf-internals-tables-dc_notification.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/dd/amf-internals-tables-dc_notification.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/dd/amf-internals-tables-dc_notification.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$ ------------------------------------------------------------------------------ -- Helper subprograms for element modification notification. ------------------------------------------------------------------------------ with Matreshka.Internals.Strings; with AMF.DC; package AMF.Internals.Tables.DC_Notification is procedure Notify_Attribute_Set (Element : AMF.Internals.AMF_Element; Property : AMF.Internals.CMOF_Element; Old_Value : Boolean; New_Value : Boolean); procedure Notify_Attribute_Set (Element : AMF.Internals.AMF_Element; Property : AMF.Internals.CMOF_Element; Old_Value : AMF.Optional_Boolean; New_Value : AMF.Optional_Boolean); procedure Notify_Attribute_Set (Element : AMF.Internals.AMF_Element; Property : AMF.Internals.CMOF_Element; Old_Value : AMF.Real; New_Value : AMF.Real); procedure Notify_Attribute_Set (Element : AMF.Internals.AMF_Element; Property : AMF.Internals.CMOF_Element; Old_Value : AMF.Optional_Real; New_Value : AMF.Optional_Real); procedure Notify_Attribute_Set (Element : AMF.Internals.AMF_Element; Property : AMF.Internals.CMOF_Element; Old_Value : Matreshka.Internals.Strings.Shared_String_Access; New_Value : Matreshka.Internals.Strings.Shared_String_Access); procedure Notify_Attribute_Set (Element : AMF.Internals.AMF_Element; Property : AMF.Internals.CMOF_Element; Old_Value : AMF.DC.DC_Alignment_Kind; New_Value : AMF.DC.DC_Alignment_Kind); procedure Notify_Attribute_Set (Element : AMF.Internals.AMF_Element; Property : AMF.Internals.CMOF_Element; Old_Value : AMF.DC.Optional_DC_Color; New_Value : AMF.DC.Optional_DC_Color); procedure Notify_Attribute_Set (Element : AMF.Internals.AMF_Element; Property : AMF.Internals.CMOF_Element; Old_Value : AMF.DC.DC_Bounds; New_Value : AMF.DC.DC_Bounds); procedure Notify_Attribute_Set (Element : AMF.Internals.AMF_Element; Property : AMF.Internals.CMOF_Element; Old_Value : AMF.DC.Optional_DC_Bounds; New_Value : AMF.DC.Optional_DC_Bounds); procedure Notify_Attribute_Set (Element : AMF.Internals.AMF_Element; Property : AMF.Internals.CMOF_Element; Old_Value : AMF.DC.DC_Point; New_Value : AMF.DC.DC_Point); procedure Notify_Attribute_Set (Element : AMF.Internals.AMF_Element; Property : AMF.Internals.CMOF_Element; Old_Value : AMF.DC.DC_Dimension; New_Value : AMF.DC.DC_Dimension); end AMF.Internals.Tables.DC_Notification;

49.243697

78

0.524061

1d9a0c72caf2f32e076b7debde6bb5be411c6da6

130

ads

Ada

ada/memory_analyzer.ads

andreas-woelfl/astma

219b6a3a78fdd97c2bc94e3951e25e5f12285f18

[ "MIT" ]

null

ada/memory_analyzer.ads

andreas-woelfl/astma

219b6a3a78fdd97c2bc94e3951e25e5f12285f18

[ "MIT" ]

null

ada/memory_analyzer.ads

andreas-woelfl/astma

219b6a3a78fdd97c2bc94e3951e25e5f12285f18

[ "MIT" ]

null

package Memory_Analyzer is function Count (Size : Integer; File : String; Var : String) return Boolean; end Memory_Analyzer;

21.666667

79

0.753846

1d159f4f8c5677f4c57297b77910f8268da445db

5,092

ads

Ada

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

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

1

2020-01-20T21:26:46.000Z

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

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

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

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S Y S T E M . M A C H I N E _ C O D E -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2006, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- -- -- -- -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package provides machine code support, both for intrinsic machine -- operations, and also for machine code statements. See GNAT documentation -- for full details. package System.Machine_Code is pragma Pure; type Asm_Input_Operand is private; type Asm_Output_Operand is private; -- These types are never used directly, they are declared only so that -- the calls to Asm are type correct according to Ada semantic rules. No_Input_Operands : constant Asm_Input_Operand; No_Output_Operands : constant Asm_Output_Operand; type Asm_Input_Operand_List is array (Integer range <>) of Asm_Input_Operand; type Asm_Output_Operand_List is array (Integer range <>) of Asm_Output_Operand; type Asm_Insn is private; -- This type is not used directly. It is declared only so that the -- aggregates used in code statements are type correct by Ada rules. procedure Asm ( Template : String; Outputs : Asm_Output_Operand_List; Inputs : Asm_Input_Operand_List; Clobber : String := ""; Volatile : Boolean := False); procedure Asm ( Template : String; Outputs : Asm_Output_Operand := No_Output_Operands; Inputs : Asm_Input_Operand_List; Clobber : String := ""; Volatile : Boolean := False); procedure Asm ( Template : String; Outputs : Asm_Output_Operand_List; Inputs : Asm_Input_Operand := No_Input_Operands; Clobber : String := ""; Volatile : Boolean := False); procedure Asm ( Template : String; Outputs : Asm_Output_Operand := No_Output_Operands; Inputs : Asm_Input_Operand := No_Input_Operands; Clobber : String := ""; Volatile : Boolean := False); function Asm ( Template : String; Outputs : Asm_Output_Operand_List; Inputs : Asm_Input_Operand_List; Clobber : String := ""; Volatile : Boolean := False) return Asm_Insn; function Asm ( Template : String; Outputs : Asm_Output_Operand := No_Output_Operands; Inputs : Asm_Input_Operand_List; Clobber : String := ""; Volatile : Boolean := False) return Asm_Insn; function Asm ( Template : String; Outputs : Asm_Output_Operand_List; Inputs : Asm_Input_Operand := No_Input_Operands; Clobber : String := ""; Volatile : Boolean := False) return Asm_Insn; function Asm ( Template : String; Outputs : Asm_Output_Operand := No_Output_Operands; Inputs : Asm_Input_Operand := No_Input_Operands; Clobber : String := ""; Volatile : Boolean := False) return Asm_Insn; pragma Import (Intrinsic, Asm); private type Asm_Input_Operand is new Integer; type Asm_Output_Operand is new Integer; type Asm_Insn is new Integer; -- All three of these types are dummy types, to meet the requirements of -- type consistency. No values of these types are ever referenced. No_Input_Operands : constant Asm_Input_Operand := 0; No_Output_Operands : constant Asm_Output_Operand := 0; end System.Machine_Code;

39.472868

78

0.557148

1dbbc8b4e3d1c13c0b015ccb47cde567dbd02376

5,109

adb

Ada

dependencies/agar/ada-gui/SYSDEPS/ver_gnat.adb

amvb/GUCEF

08fd423bbb5cdebbe4b70df24c0ae51716b65825

[ "Apache-2.0" ]

5

2016-04-18T23:12:51.000Z

2022-03-06T05:12:07.000Z

dependencies/agar/ada-gui/SYSDEPS/ver_gnat.adb

amvb/GUCEF

08fd423bbb5cdebbe4b70df24c0ae51716b65825

[ "Apache-2.0" ]

2

2015-10-09T19:13:25.000Z

2018-12-25T17:16:54.000Z

dependencies/agar/ada-gui/SYSDEPS/ver_gnat.adb

amvb/GUCEF

08fd423bbb5cdebbe4b70df24c0ae51716b65825

[ "Apache-2.0" ]

15

2015-02-23T16:35:28.000Z

2022-03-25T13:40:33.000Z

-- Detect GNAT version with ada.exceptions; with ada.strings.fixed; with ada.strings.bounded; with ada.strings; with ada.text_io; with gnat.compiler_version; procedure ver_gnat is package ex renames ada.exceptions; package io renames ada.text_io; package str renames ada.strings; package str_fixed renames ada.strings.fixed; package version_strings is new ada.strings.bounded.generic_bounded_length (16); package ver is new gnat.compiler_version; parse_error : exception; subtype version_name_t is version_strings.bounded_string; procedure version_parse (version_raw : string; version_name : out version_name_t; version_major : out integer; version_minor : out integer; version_patch : out integer) is version_tmp : string := version_raw; fsf_prefix : constant string := "GNAT Version: "; gpl_prefix : constant string := "GPL "; -- does the version string have a non-numeric prefix? function have_prefix (str : string) return boolean is char : constant character := str (str'first); begin return (char < '0') or (char > '9'); end have_prefix; -- find first non numeric character in string procedure first_non_numeric (str : string; position : out positive; found : out boolean) is begin for index in str'range loop declare char : constant character := str (index); begin if (char < '0') or (char > '9') then position := index; found := true; return; end if; end; end loop; found := false; end first_non_numeric; -- remove GNAT version prefix if necessary procedure remove_prefix (version : in out string; prefix : string; removed : out boolean) is begin if version'length >= prefix'length then if version (version'first .. prefix'length) = prefix then str_fixed.delete (version, version'first, prefix'length); removed := true; return; end if; end if; removed := false; end remove_prefix; -- expects strings of the form "N.N.N" procedure parse_fsf is str_tmp : string := version_tmp; begin -- consume major declare dot : constant integer := str_fixed.index (str_tmp, "."); begin version_major := integer'value (str_tmp (str_tmp'first .. dot - 1)); str_fixed.delete (str_tmp, str_tmp'first, dot); end; -- consume minor declare dot : constant integer := str_fixed.index (str_tmp, "."); begin version_minor := integer'value (str_tmp (str_tmp'first .. dot - 1)); str_fixed.delete (str_tmp, str_tmp'first, dot); end; -- consume patch declare found : boolean; position : positive; begin first_non_numeric (str_tmp, position, found); if found then version_patch := integer'value (str_tmp (str_tmp'first .. position - 1)); end if; end; exception when others => raise parse_error with "error parsing FSF version string"; end parse_fsf; -- expects strings of the form "YYYY (YYYYMMDD)" eg. "2008 (20080521)" procedure parse_gpl is year : constant string := version_tmp (version_tmp'first .. str_fixed.index (version_tmp, " ")); begin version_major := integer'value (year); exception when others => raise parse_error with "error parsing GPL version string"; end parse_gpl; removed : boolean; begin version_name := version_strings.to_bounded_string ("GNAT"); version_major := 0; version_minor := 0; version_patch := 0; -- FSF GNAT appears to have no prefix on some platforms if have_prefix (version_tmp) then remove_prefix (version_tmp, fsf_prefix, removed); if removed then version_name := version_strings.to_bounded_string ("GNAT_FSF"); parse_fsf; return; end if; remove_prefix (version_tmp, gpl_prefix, removed); if removed then version_name := version_strings.to_bounded_string ("GNAT_GPL"); parse_gpl; return; end if; else version_name := version_strings.to_bounded_string ("GNAT_FSF"); parse_fsf; return; end if; end version_parse; function to_string (num : integer) return string is begin return str_fixed.trim (integer'image (num), str.left); end to_string; -- data ver_input : constant string := ver.version; ver_name : version_name_t; ver_major : integer; ver_minor : integer; ver_patch : integer; begin -- catch parse errors begin version_parse (ver_input, ver_name, ver_major, ver_minor, ver_patch); exception when e: parse_error => io.put_line (io.current_error, "error: " & ex.exception_message (e)); end; io.put_line ("SYSDEP_ADA_TYPE_" & version_strings.to_string (ver_name) & " " & to_string (ver_major) & "." & to_string (ver_minor) & "." & to_string (ver_patch)); end ver_gnat;

29.028409

83

0.637307

3111a2c9ba010a54e42239c1fcdc8f3156f23869

1,801

ads

Ada

Formatted_Output-orig/formatted_output-integer_output.ads

VitalijBondarenko/Formatted_Output_NG

91fbdba8b2c720d9769a52f2b2152c14236adaa0

[ "MIT" ]

null

Formatted_Output-orig/formatted_output-integer_output.ads

VitalijBondarenko/Formatted_Output_NG

91fbdba8b2c720d9769a52f2b2152c14236adaa0

[ "MIT" ]

null

Formatted_Output-orig/formatted_output-integer_output.ads

VitalijBondarenko/Formatted_Output_NG

91fbdba8b2c720d9769a52f2b2152c14236adaa0

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- File: -- -- formatted_output-integer_output.ads -- -- -- -- Description: -- -- Formatted_Output.Integer_Output generic package specification, -- -- contains prototypes of functions that supports formatted output of -- -- integer types -- -- -- -- Author: -- -- Eugene Nonko, [email protected] -- -- -- -- Revision history: -- -- 27/01/99 - original -- -- -- ------------------------------------------------------------------------------ generic type Item_Type is range <>; package Formatted_Output.Integer_Output is function "&" (Fmt : Format_Type; Value : Item_Type) return Format_Type; -- Replaces leftmost formatting sequence in Fmt with formatted -- Value image, then returns Fmt. Raises exception Format_Error -- when invalid formatting sequence is found or no formatting -- sequence found at all end Formatted_Output.Integer_Output;

58.096774

79

0.310383

12adb43d09d0a9fe70ea8c503df784dab60c1aea

28,431

ads

Ada

src/svd/sam_svd-systemcontrol.ads

Fabien-Chouteau/samd51-hal

54d4b29df100502d8b3e3b4680a198640faa5f4d

[ "BSD-3-Clause" ]

1

2020-02-24T23:19:03.000Z

src/svd/sam_svd-systemcontrol.ads

Fabien-Chouteau/samd51-hal

54d4b29df100502d8b3e3b4680a198640faa5f4d

[ "BSD-3-Clause" ]

null

src/svd/sam_svd-systemcontrol.ads

Fabien-Chouteau/samd51-hal

54d4b29df100502d8b3e3b4680a198640faa5f4d

[ "BSD-3-Clause" ]

null

pragma Style_Checks (Off); -- This spec has been automatically generated from ATSAMD51G19A.svd pragma Restrictions (No_Elaboration_Code); with HAL; with System; package SAM_SVD.SystemControl is pragma Preelaborate; --------------- -- Registers -- --------------- subtype SystemControl_ICTR_INTLINESNUM_Field is HAL.UInt4; -- Interrupt Controller Type Register type SystemControl_ICTR_Register is record -- Read-only. INTLINESNUM : SystemControl_ICTR_INTLINESNUM_Field; -- unspecified Reserved_4_31 : HAL.UInt28; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for SystemControl_ICTR_Register use record INTLINESNUM at 0 range 0 .. 3; Reserved_4_31 at 0 range 4 .. 31; end record; -- Auxiliary Control Register type SystemControl_ACTLR_Register is record -- Disable interruption of LDM/STM instructions DISMCYCINT : Boolean := False; -- Disable wruite buffer use during default memory map accesses DISDEFWBUF : Boolean := False; -- Disable IT folding DISFOLD : Boolean := False; -- unspecified Reserved_3_7 : HAL.UInt5 := 16#0#; -- Disable automatic update of CONTROL.FPCA DISFPCA : Boolean := False; -- Disable out-of-order FP instructions DISOOFP : Boolean := False; -- unspecified Reserved_10_31 : HAL.UInt22 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for SystemControl_ACTLR_Register use record DISMCYCINT at 0 range 0 .. 0; DISDEFWBUF at 0 range 1 .. 1; DISFOLD at 0 range 2 .. 2; Reserved_3_7 at 0 range 3 .. 7; DISFPCA at 0 range 8 .. 8; DISOOFP at 0 range 9 .. 9; Reserved_10_31 at 0 range 10 .. 31; end record; subtype SystemControl_CPUID_REVISION_Field is HAL.UInt4; subtype SystemControl_CPUID_PARTNO_Field is HAL.UInt12; subtype SystemControl_CPUID_CONSTANT_Field is HAL.UInt4; subtype SystemControl_CPUID_VARIANT_Field is HAL.UInt4; subtype SystemControl_CPUID_IMPLEMENTER_Field is HAL.UInt8; -- CPUID Base Register type SystemControl_CPUID_Register is record -- Read-only. Processor revision number REVISION : SystemControl_CPUID_REVISION_Field; -- Read-only. Process Part Number, 0xC24=Cortex-M4 PARTNO : SystemControl_CPUID_PARTNO_Field; -- Read-only. Constant CONSTANT_k : SystemControl_CPUID_CONSTANT_Field; -- Read-only. Variant number VARIANT : SystemControl_CPUID_VARIANT_Field; -- Read-only. Implementer code, 0x41=ARM IMPLEMENTER : SystemControl_CPUID_IMPLEMENTER_Field; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for SystemControl_CPUID_Register use record REVISION at 0 range 0 .. 3; PARTNO at 0 range 4 .. 15; CONSTANT_k at 0 range 16 .. 19; VARIANT at 0 range 20 .. 23; IMPLEMENTER at 0 range 24 .. 31; end record; subtype SystemControl_ICSR_VECTACTIVE_Field is HAL.UInt9; subtype SystemControl_ICSR_VECTPENDING_Field is HAL.UInt6; -- SysTick clear-pending bit type ICSR_PENDSTCLRSelect is (-- No effect VALUE_0, -- Removes the pending state from the SysTick exception VALUE_1) with Size => 1; for ICSR_PENDSTCLRSelect use (VALUE_0 => 0, VALUE_1 => 1); -- SysTick set-pending bit type ICSR_PENDSTSETSelect is (-- Write: no effect; read: SysTick exception is not pending VALUE_0, -- Write: changes SysTick exception state to pending; read: SysTick exception -- is pending VALUE_1) with Size => 1; for ICSR_PENDSTSETSelect use (VALUE_0 => 0, VALUE_1 => 1); -- PendSV clear-pending bit type ICSR_PENDSVCLRSelect is (-- No effect VALUE_0, -- Removes the pending state from the PendSV exception VALUE_1) with Size => 1; for ICSR_PENDSVCLRSelect use (VALUE_0 => 0, VALUE_1 => 1); -- PendSV set-pending bit type ICSR_PENDSVSETSelect is (-- Write: no effect; read: PendSV exception is not pending VALUE_0, -- Write: changes PendSV exception state to pending; read: PendSV exception is -- pending VALUE_1) with Size => 1; for ICSR_PENDSVSETSelect use (VALUE_0 => 0, VALUE_1 => 1); -- NMI set-pending bit type ICSR_NMIPENDSETSelect is (-- Write: no effect; read: NMI exception is not pending VALUE_0, -- Write: changes NMI exception state to pending; read: NMI exception is -- pending VALUE_1) with Size => 1; for ICSR_NMIPENDSETSelect use (VALUE_0 => 0, VALUE_1 => 1); -- Interrupt Control and State Register type SystemControl_ICSR_Register is record -- Active exception number VECTACTIVE : SystemControl_ICSR_VECTACTIVE_Field := 16#0#; -- unspecified Reserved_9_10 : HAL.UInt2 := 16#0#; -- No preempted active exceptions to execute RETTOBASE : Boolean := False; -- Exception number of the highest priority pending enabled exception VECTPENDING : SystemControl_ICSR_VECTPENDING_Field := 16#0#; -- unspecified Reserved_18_21 : HAL.UInt4 := 16#0#; -- Interrupt pending flag ISRPENDING : Boolean := False; -- Debug only ISRPREEMPT : Boolean := False; -- unspecified Reserved_24_24 : HAL.Bit := 16#0#; -- SysTick clear-pending bit PENDSTCLR : ICSR_PENDSTCLRSelect := SAM_SVD.SystemControl.VALUE_0; -- SysTick set-pending bit PENDSTSET : ICSR_PENDSTSETSelect := SAM_SVD.SystemControl.VALUE_0; -- PendSV clear-pending bit PENDSVCLR : ICSR_PENDSVCLRSelect := SAM_SVD.SystemControl.VALUE_0; -- PendSV set-pending bit PENDSVSET : ICSR_PENDSVSETSelect := SAM_SVD.SystemControl.VALUE_0; -- unspecified Reserved_29_30 : HAL.UInt2 := 16#0#; -- NMI set-pending bit NMIPENDSET : ICSR_NMIPENDSETSelect := SAM_SVD.SystemControl.VALUE_0; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for SystemControl_ICSR_Register use record VECTACTIVE at 0 range 0 .. 8; Reserved_9_10 at 0 range 9 .. 10; RETTOBASE at 0 range 11 .. 11; VECTPENDING at 0 range 12 .. 17; Reserved_18_21 at 0 range 18 .. 21; ISRPENDING at 0 range 22 .. 22; ISRPREEMPT at 0 range 23 .. 23; Reserved_24_24 at 0 range 24 .. 24; PENDSTCLR at 0 range 25 .. 25; PENDSTSET at 0 range 26 .. 26; PENDSVCLR at 0 range 27 .. 27; PENDSVSET at 0 range 28 .. 28; Reserved_29_30 at 0 range 29 .. 30; NMIPENDSET at 0 range 31 .. 31; end record; subtype SystemControl_VTOR_TBLOFF_Field is HAL.UInt25; -- Vector Table Offset Register type SystemControl_VTOR_Register is record -- unspecified Reserved_0_6 : HAL.UInt7 := 16#0#; -- Vector table base offset TBLOFF : SystemControl_VTOR_TBLOFF_Field := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for SystemControl_VTOR_Register use record Reserved_0_6 at 0 range 0 .. 6; TBLOFF at 0 range 7 .. 31; end record; -- System Reset Request type AIRCR_SYSRESETREQSelect is (-- No system reset request VALUE_0, -- Asserts a signal to the outer system that requests a reset VALUE_1) with Size => 1; for AIRCR_SYSRESETREQSelect use (VALUE_0 => 0, VALUE_1 => 1); subtype SystemControl_AIRCR_PRIGROUP_Field is HAL.UInt3; -- Data endianness, 0=little, 1=big type AIRCR_ENDIANNESSSelect is (-- Little-endian VALUE_0, -- Big-endian VALUE_1) with Size => 1; for AIRCR_ENDIANNESSSelect use (VALUE_0 => 0, VALUE_1 => 1); subtype SystemControl_AIRCR_VECTKEY_Field is HAL.UInt16; -- Application Interrupt and Reset Control Register type SystemControl_AIRCR_Register is record -- Must write 0 VECTRESET : Boolean := False; -- Must write 0 VECTCLRACTIVE : Boolean := False; -- System Reset Request SYSRESETREQ : AIRCR_SYSRESETREQSelect := SAM_SVD.SystemControl.VALUE_0; -- unspecified Reserved_3_7 : HAL.UInt5 := 16#0#; -- Interrupt priority grouping PRIGROUP : SystemControl_AIRCR_PRIGROUP_Field := 16#0#; -- unspecified Reserved_11_14 : HAL.UInt4 := 16#0#; -- Data endianness, 0=little, 1=big ENDIANNESS : AIRCR_ENDIANNESSSelect := SAM_SVD.SystemControl.VALUE_0; -- Register key VECTKEY : SystemControl_AIRCR_VECTKEY_Field := 16#FA05#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for SystemControl_AIRCR_Register use record VECTRESET at 0 range 0 .. 0; VECTCLRACTIVE at 0 range 1 .. 1; SYSRESETREQ at 0 range 2 .. 2; Reserved_3_7 at 0 range 3 .. 7; PRIGROUP at 0 range 8 .. 10; Reserved_11_14 at 0 range 11 .. 14; ENDIANNESS at 0 range 15 .. 15; VECTKEY at 0 range 16 .. 31; end record; -- Sleep-on-exit on handler return type SCR_SLEEPONEXITSelect is (-- Do not sleep when returning to Thread mode VALUE_0, -- Enter sleep, or deep sleep, on return from an ISR VALUE_1) with Size => 1; for SCR_SLEEPONEXITSelect use (VALUE_0 => 0, VALUE_1 => 1); -- Deep Sleep used as low power mode type SCR_SLEEPDEEPSelect is (-- Sleep VALUE_0, -- Deep sleep VALUE_1) with Size => 1; for SCR_SLEEPDEEPSelect use (VALUE_0 => 0, VALUE_1 => 1); -- Send Event on Pending bit type SCR_SEVONPENDSelect is (-- Only enabled interrupts or events can wakeup the processor, disabled -- interrupts are excluded VALUE_0, -- Enabled events and all interrupts, including disabled interrupts, can -- wakeup the processor VALUE_1) with Size => 1; for SCR_SEVONPENDSelect use (VALUE_0 => 0, VALUE_1 => 1); -- System Control Register type SystemControl_SCR_Register is record -- unspecified Reserved_0_0 : HAL.Bit := 16#0#; -- Sleep-on-exit on handler return SLEEPONEXIT : SCR_SLEEPONEXITSelect := SAM_SVD.SystemControl.VALUE_0; -- Deep Sleep used as low power mode SLEEPDEEP : SCR_SLEEPDEEPSelect := SAM_SVD.SystemControl.VALUE_0; -- unspecified Reserved_3_3 : HAL.Bit := 16#0#; -- Send Event on Pending bit SEVONPEND : SCR_SEVONPENDSelect := SAM_SVD.SystemControl.VALUE_0; -- unspecified Reserved_5_31 : HAL.UInt27 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for SystemControl_SCR_Register use record Reserved_0_0 at 0 range 0 .. 0; SLEEPONEXIT at 0 range 1 .. 1; SLEEPDEEP at 0 range 2 .. 2; Reserved_3_3 at 0 range 3 .. 3; SEVONPEND at 0 range 4 .. 4; Reserved_5_31 at 0 range 5 .. 31; end record; -- Enables unaligned access traps type CCR_UNALIGN_TRPSelect is (-- Do not trap unaligned halfword and word accesses VALUE_0, -- Trap unaligned halfword and word accesses VALUE_1) with Size => 1; for CCR_UNALIGN_TRPSelect use (VALUE_0 => 0, VALUE_1 => 1); -- Indicates stack alignment on exception entry type CCR_STKALIGNSelect is (-- 4-byte aligned VALUE_0, -- 8-byte aligned VALUE_1) with Size => 1; for CCR_STKALIGNSelect use (VALUE_0 => 0, VALUE_1 => 1); -- Configuration and Control Register type SystemControl_CCR_Register is record -- Indicates how processor enters Thread mode NONBASETHRDENA : Boolean := False; -- Enables unprivileged software access to STIR register USERSETMPEND : Boolean := False; -- unspecified Reserved_2_2 : HAL.Bit := 16#0#; -- Enables unaligned access traps UNALIGN_TRP : CCR_UNALIGN_TRPSelect := SAM_SVD.SystemControl.VALUE_0; -- Enables divide by 0 trap DIV_0_TRP : Boolean := False; -- unspecified Reserved_5_7 : HAL.UInt3 := 16#0#; -- Ignore LDM/STM BusFault for -1/-2 priority handlers BFHFNMIGN : Boolean := False; -- Indicates stack alignment on exception entry STKALIGN : CCR_STKALIGNSelect := SAM_SVD.SystemControl.VALUE_1; -- unspecified Reserved_10_31 : HAL.UInt22 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for SystemControl_CCR_Register use record NONBASETHRDENA at 0 range 0 .. 0; USERSETMPEND at 0 range 1 .. 1; Reserved_2_2 at 0 range 2 .. 2; UNALIGN_TRP at 0 range 3 .. 3; DIV_0_TRP at 0 range 4 .. 4; Reserved_5_7 at 0 range 5 .. 7; BFHFNMIGN at 0 range 8 .. 8; STKALIGN at 0 range 9 .. 9; Reserved_10_31 at 0 range 10 .. 31; end record; subtype SystemControl_SHPR1_PRI_4_Field is HAL.UInt8; subtype SystemControl_SHPR1_PRI_5_Field is HAL.UInt8; subtype SystemControl_SHPR1_PRI_6_Field is HAL.UInt8; -- System Handler Priority Register 1 type SystemControl_SHPR1_Register is record -- Priority of system handler 4, MemManage PRI_4 : SystemControl_SHPR1_PRI_4_Field := 16#0#; -- Priority of system handler 5, BusFault PRI_5 : SystemControl_SHPR1_PRI_5_Field := 16#0#; -- Priority of system handler 6, UsageFault PRI_6 : SystemControl_SHPR1_PRI_6_Field := 16#0#; -- unspecified Reserved_24_31 : HAL.UInt8 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for SystemControl_SHPR1_Register use record PRI_4 at 0 range 0 .. 7; PRI_5 at 0 range 8 .. 15; PRI_6 at 0 range 16 .. 23; Reserved_24_31 at 0 range 24 .. 31; end record; subtype SystemControl_SHPR2_PRI_11_Field is HAL.UInt8; -- System Handler Priority Register 2 type SystemControl_SHPR2_Register is record -- unspecified Reserved_0_23 : HAL.UInt24 := 16#0#; -- Priority of system handler 11, SVCall PRI_11 : SystemControl_SHPR2_PRI_11_Field := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for SystemControl_SHPR2_Register use record Reserved_0_23 at 0 range 0 .. 23; PRI_11 at 0 range 24 .. 31; end record; subtype SystemControl_SHPR3_PRI_14_Field is HAL.UInt8; subtype SystemControl_SHPR3_PRI_15_Field is HAL.UInt8; -- System Handler Priority Register 3 type SystemControl_SHPR3_Register is record -- unspecified Reserved_0_15 : HAL.UInt16 := 16#0#; -- Priority of system handler 14, PendSV PRI_14 : SystemControl_SHPR3_PRI_14_Field := 16#0#; -- Priority of system handler 15, SysTick exception PRI_15 : SystemControl_SHPR3_PRI_15_Field := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for SystemControl_SHPR3_Register use record Reserved_0_15 at 0 range 0 .. 15; PRI_14 at 0 range 16 .. 23; PRI_15 at 0 range 24 .. 31; end record; -- System Handler Control and State Register type SystemControl_SHCSR_Register is record -- MemManage exception active bit MEMFAULTACT : Boolean := False; -- BusFault exception active bit BUSFAULTACT : Boolean := False; -- unspecified Reserved_2_2 : HAL.Bit := 16#0#; -- UsageFault exception active bit USGFAULTACT : Boolean := False; -- unspecified Reserved_4_6 : HAL.UInt3 := 16#0#; -- SVCall active bit SVCALLACT : Boolean := False; -- DebugMonitor exception active bit MONITORACT : Boolean := False; -- unspecified Reserved_9_9 : HAL.Bit := 16#0#; -- PendSV exception active bit PENDSVACT : Boolean := False; -- SysTick exception active bit SYSTICKACT : Boolean := False; -- UsageFault exception pending bit USGFAULTPENDED : Boolean := False; -- MemManage exception pending bit MEMFAULTPENDED : Boolean := False; -- BusFault exception pending bit BUSFAULTPENDED : Boolean := False; -- SVCall pending bit SVCALLPENDED : Boolean := False; -- MemManage enable bit MEMFAULTENA : Boolean := False; -- BusFault enable bit BUSFAULTENA : Boolean := False; -- UsageFault enable bit USGFAULTENA : Boolean := False; -- unspecified Reserved_19_31 : HAL.UInt13 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for SystemControl_SHCSR_Register use record MEMFAULTACT at 0 range 0 .. 0; BUSFAULTACT at 0 range 1 .. 1; Reserved_2_2 at 0 range 2 .. 2; USGFAULTACT at 0 range 3 .. 3; Reserved_4_6 at 0 range 4 .. 6; SVCALLACT at 0 range 7 .. 7; MONITORACT at 0 range 8 .. 8; Reserved_9_9 at 0 range 9 .. 9; PENDSVACT at 0 range 10 .. 10; SYSTICKACT at 0 range 11 .. 11; USGFAULTPENDED at 0 range 12 .. 12; MEMFAULTPENDED at 0 range 13 .. 13; BUSFAULTPENDED at 0 range 14 .. 14; SVCALLPENDED at 0 range 15 .. 15; MEMFAULTENA at 0 range 16 .. 16; BUSFAULTENA at 0 range 17 .. 17; USGFAULTENA at 0 range 18 .. 18; Reserved_19_31 at 0 range 19 .. 31; end record; -- Configurable Fault Status Register type SystemControl_CFSR_Register is record -- Instruction access violation IACCVIOL : Boolean := False; -- Data access violation DACCVIOL : Boolean := False; -- unspecified Reserved_2_2 : HAL.Bit := 16#0#; -- MemManage Fault on unstacking for exception return MUNSTKERR : Boolean := False; -- MemManage Fault on stacking for exception entry MSTKERR : Boolean := False; -- MemManager Fault occured during FP lazy state preservation MLSPERR : Boolean := False; -- unspecified Reserved_6_6 : HAL.Bit := 16#0#; -- MemManage Fault Address Register valid MMARVALID : Boolean := False; -- Instruction bus error IBUSERR : Boolean := False; -- Precise data bus error PRECISERR : Boolean := False; -- Imprecise data bus error IMPRECISERR : Boolean := False; -- BusFault on unstacking for exception return UNSTKERR : Boolean := False; -- BusFault on stacking for exception entry STKERR : Boolean := False; -- BusFault occured during FP lazy state preservation LSPERR : Boolean := False; -- unspecified Reserved_14_14 : HAL.Bit := 16#0#; -- BusFault Address Register valid BFARVALID : Boolean := False; -- Undefined instruction UsageFault UNDEFINSTR : Boolean := False; -- Invalid state UsageFault INVSTATE : Boolean := False; -- Invalid PC load UsageFault INVPC : Boolean := False; -- No coprocessor UsageFault NOCP : Boolean := False; -- unspecified Reserved_20_23 : HAL.UInt4 := 16#0#; -- Unaligned access UsageFault UNALIGNED : Boolean := False; -- Divide by zero UsageFault DIVBYZERO : Boolean := False; -- unspecified Reserved_26_31 : HAL.UInt6 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for SystemControl_CFSR_Register use record IACCVIOL at 0 range 0 .. 0; DACCVIOL at 0 range 1 .. 1; Reserved_2_2 at 0 range 2 .. 2; MUNSTKERR at 0 range 3 .. 3; MSTKERR at 0 range 4 .. 4; MLSPERR at 0 range 5 .. 5; Reserved_6_6 at 0 range 6 .. 6; MMARVALID at 0 range 7 .. 7; IBUSERR at 0 range 8 .. 8; PRECISERR at 0 range 9 .. 9; IMPRECISERR at 0 range 10 .. 10; UNSTKERR at 0 range 11 .. 11; STKERR at 0 range 12 .. 12; LSPERR at 0 range 13 .. 13; Reserved_14_14 at 0 range 14 .. 14; BFARVALID at 0 range 15 .. 15; UNDEFINSTR at 0 range 16 .. 16; INVSTATE at 0 range 17 .. 17; INVPC at 0 range 18 .. 18; NOCP at 0 range 19 .. 19; Reserved_20_23 at 0 range 20 .. 23; UNALIGNED at 0 range 24 .. 24; DIVBYZERO at 0 range 25 .. 25; Reserved_26_31 at 0 range 26 .. 31; end record; -- HardFault Status Register type SystemControl_HFSR_Register is record -- unspecified Reserved_0_0 : HAL.Bit := 16#0#; -- BusFault on a Vector Table read during exception processing VECTTBL : Boolean := False; -- unspecified Reserved_2_29 : HAL.UInt28 := 16#0#; -- Forced Hard Fault FORCED : Boolean := False; -- Debug: always write 0 DEBUGEVT : Boolean := False; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for SystemControl_HFSR_Register use record Reserved_0_0 at 0 range 0 .. 0; VECTTBL at 0 range 1 .. 1; Reserved_2_29 at 0 range 2 .. 29; FORCED at 0 range 30 .. 30; DEBUGEVT at 0 range 31 .. 31; end record; -- Debug Fault Status Register type SystemControl_DFSR_Register is record HALTED : Boolean := False; BKPT : Boolean := False; DWTTRAP : Boolean := False; VCATCH : Boolean := False; EXTERNAL : Boolean := False; -- unspecified Reserved_5_31 : HAL.UInt27 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for SystemControl_DFSR_Register use record HALTED at 0 range 0 .. 0; BKPT at 0 range 1 .. 1; DWTTRAP at 0 range 2 .. 2; VCATCH at 0 range 3 .. 3; EXTERNAL at 0 range 4 .. 4; Reserved_5_31 at 0 range 5 .. 31; end record; -- Processor Feature Register -- Processor Feature Register type SystemControl_PFR_Registers is array (0 .. 1) of HAL.UInt32; -- Memory Model Feature Register -- Memory Model Feature Register type SystemControl_MMFR_Registers is array (0 .. 3) of HAL.UInt32; -- Instruction Set Attributes Register -- Instruction Set Attributes Register type SystemControl_ISAR_Registers is array (0 .. 4) of HAL.UInt32; -- Access privileges for coprocessor 10 type CPACR_CP10Select is (-- Access denied DENIED, -- Privileged access only PRIV, -- Full access FULL) with Size => 2; for CPACR_CP10Select use (DENIED => 0, PRIV => 1, FULL => 3); -- Access privileges for coprocessor 11 type CPACR_CP11Select is (-- Access denied DENIED, -- Privileged access only PRIV, -- Full access FULL) with Size => 2; for CPACR_CP11Select use (DENIED => 0, PRIV => 1, FULL => 3); -- Coprocessor Access Control Register type SystemControl_CPACR_Register is record -- unspecified Reserved_0_19 : HAL.UInt20 := 16#0#; -- Access privileges for coprocessor 10 CP10 : CPACR_CP10Select := SAM_SVD.SystemControl.DENIED; -- Access privileges for coprocessor 11 CP11 : CPACR_CP11Select := SAM_SVD.SystemControl.DENIED; -- unspecified Reserved_24_31 : HAL.UInt8 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for SystemControl_CPACR_Register use record Reserved_0_19 at 0 range 0 .. 19; CP10 at 0 range 20 .. 21; CP11 at 0 range 22 .. 23; Reserved_24_31 at 0 range 24 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- System Control Registers type SystemControl_Peripheral is record -- Interrupt Controller Type Register ICTR : aliased SystemControl_ICTR_Register; -- Auxiliary Control Register ACTLR : aliased SystemControl_ACTLR_Register; -- CPUID Base Register CPUID : aliased SystemControl_CPUID_Register; -- Interrupt Control and State Register ICSR : aliased SystemControl_ICSR_Register; -- Vector Table Offset Register VTOR : aliased SystemControl_VTOR_Register; -- Application Interrupt and Reset Control Register AIRCR : aliased SystemControl_AIRCR_Register; -- System Control Register SCR : aliased SystemControl_SCR_Register; -- Configuration and Control Register CCR : aliased SystemControl_CCR_Register; -- System Handler Priority Register 1 SHPR1 : aliased SystemControl_SHPR1_Register; -- System Handler Priority Register 2 SHPR2 : aliased SystemControl_SHPR2_Register; -- System Handler Priority Register 3 SHPR3 : aliased SystemControl_SHPR3_Register; -- System Handler Control and State Register SHCSR : aliased SystemControl_SHCSR_Register; -- Configurable Fault Status Register CFSR : aliased SystemControl_CFSR_Register; -- HardFault Status Register HFSR : aliased SystemControl_HFSR_Register; -- Debug Fault Status Register DFSR : aliased SystemControl_DFSR_Register; -- MemManage Fault Address Register MMFAR : aliased HAL.UInt32; -- BusFault Address Register BFAR : aliased HAL.UInt32; -- Auxiliary Fault Status Register AFSR : aliased HAL.UInt32; -- Processor Feature Register PFR : aliased SystemControl_PFR_Registers; -- Debug Feature Register DFR : aliased HAL.UInt32; -- Auxiliary Feature Register ADR : aliased HAL.UInt32; -- Memory Model Feature Register MMFR : aliased SystemControl_MMFR_Registers; -- Instruction Set Attributes Register ISAR : aliased SystemControl_ISAR_Registers; -- Coprocessor Access Control Register CPACR : aliased SystemControl_CPACR_Register; end record with Volatile; for SystemControl_Peripheral use record ICTR at 16#4# range 0 .. 31; ACTLR at 16#8# range 0 .. 31; CPUID at 16#D00# range 0 .. 31; ICSR at 16#D04# range 0 .. 31; VTOR at 16#D08# range 0 .. 31; AIRCR at 16#D0C# range 0 .. 31; SCR at 16#D10# range 0 .. 31; CCR at 16#D14# range 0 .. 31; SHPR1 at 16#D18# range 0 .. 31; SHPR2 at 16#D1C# range 0 .. 31; SHPR3 at 16#D20# range 0 .. 31; SHCSR at 16#D24# range 0 .. 31; CFSR at 16#D28# range 0 .. 31; HFSR at 16#D2C# range 0 .. 31; DFSR at 16#D30# range 0 .. 31; MMFAR at 16#D34# range 0 .. 31; BFAR at 16#D38# range 0 .. 31; AFSR at 16#D3C# range 0 .. 31; PFR at 16#D40# range 0 .. 63; DFR at 16#D48# range 0 .. 31; ADR at 16#D4C# range 0 .. 31; MMFR at 16#D50# range 0 .. 127; ISAR at 16#D60# range 0 .. 159; CPACR at 16#D88# range 0 .. 31; end record; -- System Control Registers SystemControl_Periph : aliased SystemControl_Peripheral with Import, Address => SystemControl_Base; end SAM_SVD.SystemControl;

35.1

85

0.623369

064724c4d1a557d7b07e956a7785144b2b8ab065

2,598

adb

Ada

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-trasym.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-trasym.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-trasym.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- G N A T . T R A C E B A C K . S Y M B O L I C -- -- -- -- B o d y -- -- -- -- Copyright (C) 1999-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 does not require a body, since it is a package renaming. We -- provide a dummy file containing a No_Body pragma so that previous versions -- of the body (which did exist) will not interfere. pragma No_Body;

70.216216

78

0.394534

397fc8531df1ea0a0ead5e50c38f6f41935b70bf

5,774

ads

Ada

source/amf/uml/amf-uml-reply_actions.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-reply_actions.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-reply_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 © 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. ------------------------------------------------------------------------------ -- A reply action is an action that accepts a set of return values and a -- value containing return information produced by a previous accept call -- action. The reply action returns the values to the caller of the previous -- call, completing execution of the call. ------------------------------------------------------------------------------ with AMF.UML.Actions; limited with AMF.UML.Input_Pins.Collections; limited with AMF.UML.Triggers; package AMF.UML.Reply_Actions is pragma Preelaborate; type UML_Reply_Action is limited interface and AMF.UML.Actions.UML_Action; type UML_Reply_Action_Access is access all UML_Reply_Action'Class; for UML_Reply_Action_Access'Storage_Size use 0; not overriding function Get_Reply_To_Call (Self : not null access constant UML_Reply_Action) return AMF.UML.Triggers.UML_Trigger_Access is abstract; -- Getter of ReplyAction::replyToCall. -- -- The trigger specifying the operation whose call is being replied to. not overriding procedure Set_Reply_To_Call (Self : not null access UML_Reply_Action; To : AMF.UML.Triggers.UML_Trigger_Access) is abstract; -- Setter of ReplyAction::replyToCall. -- -- The trigger specifying the operation whose call is being replied to. not overriding function Get_Reply_Value (Self : not null access constant UML_Reply_Action) return AMF.UML.Input_Pins.Collections.Set_Of_UML_Input_Pin is abstract; -- Getter of ReplyAction::replyValue. -- -- A list of pins containing the reply values of the operation. These -- values are returned to the caller. not overriding function Get_Return_Information (Self : not null access constant UML_Reply_Action) return AMF.UML.Input_Pins.UML_Input_Pin_Access is abstract; -- Getter of ReplyAction::returnInformation. -- -- A pin containing the return information value produced by an earlier -- AcceptCallAction. not overriding procedure Set_Return_Information (Self : not null access UML_Reply_Action; To : AMF.UML.Input_Pins.UML_Input_Pin_Access) is abstract; -- Setter of ReplyAction::returnInformation. -- -- A pin containing the return information value produced by an earlier -- AcceptCallAction. end AMF.UML.Reply_Actions;

54.990476

78

0.519224

1db6700cae9bab6868463975faea962316cbd766

883

adb

Ada

gnu/src/gdb/gdb/testsuite/gdb.ada/ref_param/pck.adb

ghsecuritylab/ellcc-mirror

b03a4afac74d50cf0987554b8c0cd8209bcb92a2

[ "BSD-2-Clause" ]

null

gnu/src/gdb/gdb/testsuite/gdb.ada/ref_param/pck.adb

ghsecuritylab/ellcc-mirror

b03a4afac74d50cf0987554b8c0cd8209bcb92a2

[ "BSD-2-Clause" ]

null

gnu/src/gdb/gdb/testsuite/gdb.ada/ref_param/pck.adb

ghsecuritylab/ellcc-mirror

b03a4afac74d50cf0987554b8c0cd8209bcb92a2

[ "BSD-2-Clause" ]

null

-- Copyright 2008-2015 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- This program is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. package body Pck is procedure Call_Me (D : in out Data) is begin if D.One > D.Two then D.Three := D.Four; end if; end Call_Me; end Pck;

33.961538

73

0.705549

06c4df4fc2cfb1a90d161268d43dacb0914cdbeb

2,918

adb

Ada

out/sort.adb

Melyodas/metalang

399a9f1a71402c979d7f8024d4f98f081c80e771

[ "BSD-2-Clause" ]

22

2017-04-24T10:00:45.000Z

2021-04-01T10:11:05.000Z

out/sort.adb

Melyodas/metalang

399a9f1a71402c979d7f8024d4f98f081c80e771

[ "BSD-2-Clause" ]

12

2017-03-26T18:34:21.000Z

2019-03-21T19:13:03.000Z

out/sort.adb

Melyodas/metalang

399a9f1a71402c979d7f8024d4f98f081c80e771

[ "BSD-2-Clause" ]

7

2017-10-14T13:33:33.000Z

2021-03-18T15:18:50.000Z

with ada.text_io, ada.Integer_text_IO, Ada.Text_IO.Text_Streams, Ada.Strings.Fixed, Interfaces.C; use ada.text_io, ada.Integer_text_IO, Ada.Strings, Ada.Strings.Fixed, Interfaces.C; procedure sort is type stringptr is access all char_array; procedure PString(s : stringptr) is begin String'Write (Text_Streams.Stream (Current_Output), To_Ada(s.all)); end; procedure PInt(i : in Integer) is begin String'Write (Text_Streams.Stream (Current_Output), Trim(Integer'Image(i), Left)); end; procedure SkipSpaces is C : Character; Eol : Boolean; begin loop Look_Ahead(C, Eol); exit when Eol or C /= ' '; Get(C); end loop; end; type a is Array (Integer range <>) of Integer; type a_PTR is access a; function copytab(tab : in a_PTR; len : in Integer) return a_PTR is o : a_PTR; begin o := new a (0..len - 1); for i in integer range 0..len - 1 loop o(i) := tab(i); end loop; return o; end; procedure bubblesort(tab : in a_PTR; len : in Integer) is tmp : Integer; begin for i in integer range 0..len - 1 loop for j in integer range i + 1..len - 1 loop if tab(i) > tab(j) then tmp := tab(i); tab(i) := tab(j); tab(j) := tmp; end if; end loop; end loop; end; procedure qsort0(tab : in a_PTR; len : in Integer; b : in Integer; c : in Integer) is tmp : Integer; j0 : Integer; j : Integer; i0 : Integer; i : Integer; begin i := b; j := c; if i < j then i0 := i; j0 := j; -- pivot : tab[0] while i /= j loop if tab(i) > tab(j) then if i = j - 1 then -- on inverse simplement tmp := tab(i); tab(i) := tab(j); tab(j) := tmp; i := i + 1; else -- on place tab[i+1] à la place de tab[j], tab[j] à la place de tab[i] et tab[i] à la place de tab[i+1] tmp := tab(i); tab(i) := tab(j); tab(j) := tab(i + 1); tab(i + 1) := tmp; i := i + 1; end if; else j := j - 1; end if; end loop; qsort0(tab, len, i0, i - 1); qsort0(tab, len, i + 1, j0); end if; end; tmp : Integer; tab3 : a_PTR; tab2 : a_PTR; tab : a_PTR; len : Integer; begin len := 2; Get(len); SkipSpaces; tab := new a (0..len - 1); for i_0 in integer range 0..len - 1 loop tmp := 0; Get(tmp); SkipSpaces; tab(i_0) := tmp; end loop; tab2 := copytab(tab, len); bubblesort(tab2, len); for i in integer range 0..len - 1 loop PInt(tab2(i)); PString(new char_array'( To_C(" "))); end loop; PString(new char_array'( To_C("" & Character'Val(10)))); tab3 := copytab(tab, len); qsort0(tab3, len, 0, len - 1); for i in integer range 0..len - 1 loop PInt(tab3(i)); PString(new char_array'( To_C(" "))); end loop; PString(new char_array'( To_C("" & Character'Val(10)))); end;

22.796875

114

0.557916

064735ce4c2da9c2fe0f88f6c88b71e153de86ba

489

ads

Ada

stm32f1/stm32gd-clock-source.ads

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

1

2021-04-06T07:57:56.000Z

stm32f1/stm32gd-clock-source.ads

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

null

stm32f1/stm32gd-clock-source.ads

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

2

2018-05-29T13:59:31.000Z

2019-02-03T19:48:08.000Z

generic Frequency : Unsigned_32; Clock: Clock_Type; Input: Clock_Type; Input_Frequency : Unsigned_32 := 0; package STM32GD.Clock.Source is pragma Preelaborate; procedure Init; procedure Delay_us (us : Natural); procedure Delay_ms (ms : Natural); procedure Delay_s (s : Natural); function Millisecond_Counter return Unsigned_32; procedure Delay_Slow_Periods (P : Unsigned_16); function Maximum_Delay_ms return Unsigned_16; end STM32GD.Clock.Source;

23.285714

51

0.742331

503d94d479aebf5858bca6fa047b695e20b3bb08

5,713

ads

Ada

src/Internals/protypo-tokens.ads

fintatarta/protypo

c0c2bca17bc766ab95acc99b7422485388a10cb4

[ "MIT" ]

null

src/Internals/protypo-tokens.ads

fintatarta/protypo

c0c2bca17bc766ab95acc99b7422485388a10cb4

[ "MIT" ]

4

2019-10-09T11:16:38.000Z

2019-10-09T11:20:38.000Z

src/Internals/protypo-tokens.ads

fintatarta/protypo

c0c2bca17bc766ab95acc99b7422485388a10cb4

[ "MIT" ]

null

-- with Ada.Strings.Unbounded; use Ada.Strings.Unbounded; with Readable_Sequences.String_Sequences; use Readable_Sequences; package Protypo.Tokens is use Ada.Strings.Unbounded; subtype Token_Position is Readable_Sequences.String_Sequences.Position_Type; No_Position : constant Token_Position := Readable_Sequences.String_Sequences.No_Position; function Image (X : Token_Position; Full : Boolean := True) return String; type Token_Class is (Int, Real, Text, Identifier, Plus, Minus, Mult, Div, Equal, Different, Less_Than, Greater_Than, Less_Or_Equal, Greater_Or_Equal, Assign, Dot, Open_Parenthesis, Close_Parenthesis, Comma, Label_Separator, End_Of_Statement, Kw_If, Kw_Then, Kw_Elsif, Kw_Else, Kw_Case, Kw_When, Kw_For, Kw_While, Kw_Loop, Kw_Exit, Kw_Function, Kw_Procedure, Kw_capture, Kw_Begin, Kw_Return, Kw_End, Kw_And, Kw_Or, Kw_Xor, Kw_Not, Kw_Mod, Kw_In, Kw_Is, Kw_Of, End_Of_Text); subtype Valued_Token is Token_Class range Int .. Identifier; subtype Unvalued_Token is Token_Class range Plus .. End_Of_Text; subtype Not_Keyword is Unvalued_Token range Plus .. End_Of_Statement; subtype Keyword_Tokens is Unvalued_Token range Kw_If .. Kw_Of; subtype Logical_Operator is Unvalued_Token range Kw_And .. Kw_Xor; subtype Rem_Operator is Unvalued_Token range Kw_Mod .. Kw_Mod; subtype Comp_Operator is Unvalued_Token range Equal .. Greater_Or_Equal; subtype Numeric_Operator is Unvalued_Token range Plus .. Div; subtype Unary_Operator is Unvalued_Token with Static_Predicate => Unary_Operator in Plus .. Minus | Kw_Not; subtype Binary_Operator is Unvalued_Token with Static_Predicate => Binary_Operator in Numeric_Operator | Comp_Operator | Logical_Operator | Rem_Operator; type Token is private; type Token_Builder is tagged private; function Is_Position_Set (Builder : Token_Builder) return Boolean; procedure Set_Position (Builder : in out Token_Builder; Position : Token_Position) with Pre => not Builder.Is_Position_Set, Post => Builder.Is_Position_Set; procedure Clear_Position (Builder : in out Token_Builder) with Pre => Builder.Is_Position_Set, Post => not Builder.Is_Position_Set; function Peek_Position (Builder : Token_Builder) return Token_Position with Pre => Builder.Is_Position_Set; function Make_Token (Builder : in out Token_Builder; Class : Valued_Token; Value : String) return Token with Pre => Builder.Is_Position_Set, Post => not Builder.Is_Position_Set; function Make_Token (Builder : in out Token_Builder; Class : Unvalued_Token) return Token with Pre => Builder.Is_Position_Set, Post => not Builder.Is_Position_Set; function Make_Unanchored_Token (Class : Valued_Token; Value : String) return Token; function Make_Unanchored_Token (Class : Unvalued_Token) return Token; function Class (Tk : Token) return Token_Class; function Value (Tk : Token) return String with Pre => Class (Tk) in Valued_Token; function Image (Tk : Token) return String; function Position (Tk : Token) return Token_Position; function Line (Tk : Token) return Positive; function Char (Tk : Token) return Positive; private use type String_Sequences.Position_Type; type Token_Builder is tagged record Has_Position : Boolean := False; Position : Token_Position; end record; function Peek_Position (Builder : Token_Builder) return Token_Position is (Builder.Position); type Token is record Class : Token_Class; Value : Unbounded_String; Position : Token_Position; end record with Dynamic_Predicate => (if Class in Unvalued_Token then Value = Null_Unbounded_String); function Make_Unanchored_Token (Class : Unvalued_Token) return Token is ((Class => Class, Value => Null_Unbounded_String, Position => String_Sequences.No_Position)); function Make_Unanchored_Token (Class : Valued_Token; Value : String) return Token is ((Class => Class, Value => To_Unbounded_String (Value), Position => String_Sequences.No_Position)); function Class (Tk : Token) return Token_Class is (Tk.Class); function Value (Tk : Token) return String is (To_String (Tk.Value)); function Image (Tk : Token) return String is (Token_Class'Image (Tk.Class) & " " & (if Tk.Class in Valued_Token then "(" & To_String (Tk.Value) & ")" else "")); function Position (Tk : Token) return Token_Position is (Tk.Position); function Line (Tk : Token) return Positive is (String_Sequences.Line (Tk.Position)); function Char (Tk : Token) return Positive is (String_Sequences.Char (Tk.Position)); function Image (X : Token_Position; Full : Boolean := True) return String is (String_Sequences.Image (X, Full)); end Protypo.Tokens;

29

95

0.625416

394789c3c797d3e56a58728b245443922c8233e8

2,072

ads

Ada

mat/src/parser/mat-expressions-parser_io.ads

stcarrez/mat

fb242feb5662b8130680cd06e50da7ef40b95bd7

[ "Apache-2.0" ]

7

2015-01-18T23:04:30.000Z

2021-04-06T14:07:56.000Z

mat/src/parser/mat-expressions-parser_io.ads

stcarrez/mat

fb242feb5662b8130680cd06e50da7ef40b95bd7

[ "Apache-2.0" ]

null

mat/src/parser/mat-expressions-parser_io.ads

stcarrez/mat

fb242feb5662b8130680cd06e50da7ef40b95bd7

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- mat-expressions-parser_io -- Input IO for Lex parser -- Copyright (C) 2014, 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 MAT.Expressions.Lexer_dfa; with Ada.Text_IO; package MAT.Expressions.Parser_IO is use MAT.Expressions.Lexer_dfa; user_output_file : Ada.Text_IO.File_Type; NULL_IN_INPUT : exception; AFLEX_INTERNAL_ERROR : exception; UNEXPECTED_LAST_MATCH : exception; PUSHBACK_OVERFLOW : exception; AFLEX_SCANNER_JAMMED : exception; type eob_action_type is (EOB_ACT_RESTART_SCAN, EOB_ACT_END_OF_FILE, EOB_ACT_LAST_MATCH); YY_END_OF_BUFFER_CHAR : constant Character := ASCII.NUL; -- number of characters read into yy_ch_buf yy_n_chars : Integer; -- true when we've seen an EOF for the current input file yy_eof_has_been_seen : Boolean; procedure Set_Input (Content : in String); procedure YY_INPUT (Buf : out MAT.Expressions.Lexer_dfa.unbounded_character_array; Result : out Integer; Max_Size : in Integer); function yy_get_next_buffer return eob_action_type; function Input_Line return Ada.Text_IO.Count; function yywrap return Boolean; procedure Open_Input (Fname : in String); end MAT.Expressions.Parser_IO;

35.118644

90

0.655888

319e2e4ea9b1b42f119d4f004f09f84de6e702d3

7,140

adb

Ada

arch/ARM/STM32/driversL4x3/stm32-exti.adb

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

2

2018-05-16T03:56:39.000Z

2019-07-31T13:53:56.000Z

arch/ARM/STM32/driversL4x3/stm32-exti.adb

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

null

arch/ARM/STM32/driversL4x3/stm32-exti.adb

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- Copyright (C) 2015, AdaCore -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions are -- -- met: -- -- 1. Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- 2. Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in -- -- the documentation and/or other materials provided with the -- -- distribution. -- -- 3. Neither the name of STMicroelectronics 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. -- -- -- -- -- -- This file is based on: -- -- -- -- @file stm32f407xx.h et al. -- -- @author MCD Application Team -- -- @version V1.1.0 -- -- @date 19-June-2014 -- -- @brief CMSIS STM32F407xx Device Peripheral Access Layer Header File. -- -- -- -- COPYRIGHT(c) 2014 STMicroelectronics -- ------------------------------------------------------------------------------ -- This file provides register definitions for the STM32F4 (ARM Cortex M4F) -- microcontrollers from ST Microelectronics. with STM32_SVD.EXTI; use STM32_SVD.EXTI; package body STM32.EXTI is ------------------------------- -- Enable_External_Interrupt -- ------------------------------- procedure Enable_External_Interrupt (Line : External_Line_Number; Trigger : Interrupt_Triggers) is Index : constant Natural := External_Line_Number'Pos (Line); begin EXTI_Periph.IMR1.Arr (Index) := True; if Index >= 18 then EXTI_Periph.RTSR1.TR_1.Arr (Index) := Trigger in Interrupt_Rising_Edge | Interrupt_Rising_Falling_Edge; EXTI_Periph.FTSR1.TR_1.Arr (Index) := Trigger in Interrupt_Falling_Edge | Interrupt_Rising_Falling_Edge; else EXTI_Periph.RTSR1.TR.Arr (Index) := Trigger in Interrupt_Rising_Edge | Interrupt_Rising_Falling_Edge; EXTI_Periph.FTSR1.TR.Arr (Index) := Trigger in Interrupt_Falling_Edge | Interrupt_Rising_Falling_Edge; end if; end Enable_External_Interrupt; -------------------------------- -- Disable_External_Interrupt -- -------------------------------- procedure Disable_External_Interrupt (Line : External_Line_Number) is Index : constant Natural := External_Line_Number'Pos (Line); begin EXTI_Periph.IMR1.Arr (Index) := False; if Index >= 18 then EXTI_Periph.RTSR1.TR_1.Arr (Index) := False; EXTI_Periph.FTSR1.TR_1.Arr (Index) := False; else EXTI_Periph.RTSR1.TR.Arr (Index) := False; EXTI_Periph.FTSR1.TR.Arr (Index) := False; end if; end Disable_External_Interrupt; --------------------------- -- Enable_External_Event -- --------------------------- procedure Enable_External_Event (Line : External_Line_Number; Trigger : Event_Triggers) is Index : constant Natural := External_Line_Number'Pos (Line); begin EXTI_Periph.EMR1.Arr (Index) := True; EXTI_Periph.RTSR1.TR.Arr (Index) := Trigger in Interrupt_Rising_Edge | Interrupt_Rising_Falling_Edge; EXTI_Periph.FTSR1.TR.Arr (Index) := Trigger in Interrupt_Falling_Edge | Interrupt_Rising_Falling_Edge; end Enable_External_Event; ---------------------------- -- Disable_External_Event -- ---------------------------- procedure Disable_External_Event (Line : External_Line_Number) is Index : constant Natural := External_Line_Number'Pos (Line); begin EXTI_Periph.EMR1.Arr (Index) := False; EXTI_Periph.RTSR1.TR.Arr (Index) := False; EXTI_Periph.FTSR1.TR.Arr (Index) := False; end Disable_External_Event; ------------------ -- Generate_SWI -- ------------------ procedure Generate_SWI (Line : External_Line_Number) is begin EXTI_Periph.SWIER1.SWIER.Arr (External_Line_Number'Pos (Line)) := True; end Generate_SWI; -------------------------------- -- External_Interrupt_Pending -- -------------------------------- function External_Interrupt_Pending (Line : External_Line_Number) return Boolean is begin if External_Line_Number'Pos (Line) <= 17 then -- Split fields in SVD return (EXTI_Periph.PR1.PR.Arr (External_Line_Number'Pos (Line))); else return (EXTI_Periph.PR1.PR_1.Arr (External_Line_Number'Pos (Line))); end if; end External_Interrupt_Pending; ------------------------------ -- Clear_External_Interrupt -- ------------------------------ procedure Clear_External_Interrupt (Line : External_Line_Number) is begin -- yes, one to clear if External_Line_Number'Pos (Line) <= 17 then -- Split fields in SVD EXTI_Periph.PR1.PR.Arr (External_Line_Number'Pos (Line)) := True; else EXTI_Periph.PR1.PR_1.Arr (External_Line_Number'Pos (Line)) := True; end if; end Clear_External_Interrupt; end STM32.EXTI;

45.769231

86

0.532913

318e4bdaaa8ca797d4addadb33c6fd441e0cb4ca

32,530

adb

Ada

llvm-gcc-4.2-2.9/gcc/ada/s-tasini.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

llvm-gcc-4.2-2.9/gcc/ada/s-tasini.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

llvm-gcc-4.2-2.9/gcc/ada/s-tasini.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- S Y S T E M . T A S K I N G . I N I T I A L I Z A T I O N -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-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. -- -- -- ------------------------------------------------------------------------------ pragma Style_Checks (All_Checks); -- Turn off subprogram alpha ordering check, since we group soft link -- bodies and dummy soft link bodies together separately in this unit. pragma Polling (Off); -- Turn polling off for this package. We don't need polling during any -- of the routines in this package, and more to the point, if we try -- to poll it can cause infinite loops. with Ada.Exceptions; -- Used for Exception_Occurrence_Access with System.Task_Primitives; -- Used for Lock with System.Task_Primitives.Operations; -- Used for Set_Priority -- Write_Lock -- Unlock -- Initialize_Lock with System.Soft_Links; -- Used for the non-tasking routines (*_NT) that refer to global data. -- They are needed here before the tasking run time has been elaborated. with System.Soft_Links.Tasking; -- Used for Init_Tasking_Soft_Links with System.Tasking.Debug; -- Used for Trace with System.Stack_Checking; with System.Parameters; -- used for Single_Lock package body System.Tasking.Initialization is package STPO renames System.Task_Primitives.Operations; package SSL renames System.Soft_Links; package AE renames Ada.Exceptions; use Parameters; use Task_Primitives.Operations; Global_Task_Lock : aliased System.Task_Primitives.RTS_Lock; -- This is a global lock; it is used to execute in mutual exclusion -- from all other tasks. It is only used by Task_Lock, -- Task_Unlock, and Final_Task_Unlock. function Current_Target_Exception return AE.Exception_Occurrence; pragma Import (Ada, Current_Target_Exception, "__gnat_current_target_exception"); -- Import this subprogram from the private part of Ada.Exceptions ---------------------------------------------------------------------- -- Tasking versions of some services needed by non-tasking programs -- ---------------------------------------------------------------------- procedure Abort_Defer; -- NON-INLINE versions without Self_ID for soft links procedure Abort_Undefer; -- NON-INLINE versions without Self_ID for soft links procedure Task_Lock; -- Locks out other tasks. Preceding a section of code by Task_Lock and -- following it by Task_Unlock creates a critical region. This is used -- for ensuring that a region of non-tasking code (such as code used to -- allocate memory) is tasking safe. Note that it is valid for calls to -- Task_Lock/Task_Unlock to be nested, and this must work properly, i.e. -- only the corresponding outer level Task_Unlock will actually unlock. procedure Task_Unlock; -- Releases lock previously set by call to Task_Lock. In the nested case, -- all nested locks must be released before other tasks competing for the -- tasking lock are released. function Get_Stack_Info return Stack_Checking.Stack_Access; -- Get access to the current task's Stack_Info procedure Update_Exception (X : AE.Exception_Occurrence := Current_Target_Exception); -- Handle exception setting and check for pending actions function Task_Name return String; -- Returns current task's name ------------------------ -- Local Subprograms -- ------------------------ ---------------------------- -- Tasking Initialization -- ---------------------------- procedure Init_RTS; -- This procedure completes the initialization of the GNARL. The first -- part of the initialization is done in the body of System.Tasking. -- It consists of initializing global locks, and installing tasking -- versions of certain operations used by the compiler. Init_RTS is called -- during elaboration. -------------------------- -- Change_Base_Priority -- -------------------------- -- Call only with abort deferred and holding Self_ID locked procedure Change_Base_Priority (T : Task_Id) is begin if T.Common.Base_Priority /= T.New_Base_Priority then T.Common.Base_Priority := T.New_Base_Priority; Set_Priority (T, T.Common.Base_Priority); end if; end Change_Base_Priority; ------------------------ -- Check_Abort_Status -- ------------------------ function Check_Abort_Status return Integer is Self_ID : constant Task_Id := Self; begin if Self_ID /= null and then Self_ID.Deferral_Level = 0 and then Self_ID.Pending_ATC_Level < Self_ID.ATC_Nesting_Level then return 1; else return 0; end if; end Check_Abort_Status; ----------------- -- Defer_Abort -- ----------------- procedure Defer_Abort (Self_ID : Task_Id) is begin if No_Abort and then not Dynamic_Priority_Support then return; end if; pragma Assert (Self_ID.Deferral_Level = 0); -- pragma Assert -- (Self_ID.Pending_ATC_Level >= Self_ID.ATC_Nesting_Level); -- The above check has been useful in detecting mismatched defer/undefer -- pairs. You may uncomment it when testing on systems that support -- preemptive abort. -- If the OS supports preemptive abort (e.g. pthread_kill), it should -- have happened already. A problem is with systems that do not support -- preemptive abort, and so rely on polling. On such systems we may get -- false failures of the assertion, since polling for pending abort does -- no occur until the abort undefer operation. -- Even on systems that only poll for abort, the assertion may be useful -- for catching missed abort completion polling points. The operations -- that undefer abort poll for pending aborts. This covers most of the -- places where the core Ada semantics require abort to be caught, -- without any special attention. However, this generally happens on -- exit from runtime system call, which means a pending abort will not -- be noticed on the way into the runtime system. We considered adding a -- check for pending aborts at this point, but chose not to, because of -- the overhead. Instead, we searched for RTS calls where abort -- completion is required and a task could go farther than Ada allows -- before undeferring abort; we then modified the code to ensure the -- abort would be detected. Self_ID.Deferral_Level := Self_ID.Deferral_Level + 1; end Defer_Abort; -------------------------- -- Defer_Abort_Nestable -- -------------------------- procedure Defer_Abort_Nestable (Self_ID : Task_Id) is begin if No_Abort and then not Dynamic_Priority_Support then return; end if; -- pragma Assert -- ((Self_ID.Pending_ATC_Level >= Self_ID.ATC_Nesting_Level or else -- Self_ID.Deferral_Level > 0)); -- See comment in Defer_Abort on the situations in which it may be -- useful to uncomment the above assertion. Self_ID.Deferral_Level := Self_ID.Deferral_Level + 1; end Defer_Abort_Nestable; ----------------- -- Abort_Defer -- ----------------- procedure Abort_Defer is Self_ID : Task_Id; begin if No_Abort and then not Dynamic_Priority_Support then return; end if; Self_ID := STPO.Self; Self_ID.Deferral_Level := Self_ID.Deferral_Level + 1; end Abort_Defer; ----------------------- -- Do_Pending_Action -- ----------------------- -- Call only when holding no locks procedure Do_Pending_Action (Self_ID : Task_Id) is use type Ada.Exceptions.Exception_Id; begin pragma Assert (Self_ID = Self and then Self_ID.Deferral_Level = 0); -- Needs loop to recheck for pending action in case a new one occurred -- while we had abort deferred below. loop -- Temporarily defer abort so that we can lock Self_ID Self_ID.Deferral_Level := Self_ID.Deferral_Level + 1; if Single_Lock then Lock_RTS; end if; Write_Lock (Self_ID); Self_ID.Pending_Action := False; Poll_Base_Priority_Change (Self_ID); Unlock (Self_ID); if Single_Lock then Unlock_RTS; end if; -- Restore the original Deferral value Self_ID.Deferral_Level := Self_ID.Deferral_Level - 1; if not Self_ID.Pending_Action then if Self_ID.Pending_ATC_Level < Self_ID.ATC_Nesting_Level then if not Self_ID.Aborting then Self_ID.Aborting := True; pragma Debug (Debug.Trace (Self_ID, "raise Abort_Signal", 'B')); raise Standard'Abort_Signal; pragma Assert (not Self_ID.ATC_Hack); elsif Self_ID.ATC_Hack then -- The solution really belongs in the Abort_Signal handler -- for async. entry calls. The present hack is very -- fragile. It relies that the very next point after -- Exit_One_ATC_Level at which the task becomes abortable -- will be the call to Undefer_Abort in the -- Abort_Signal handler. Self_ID.ATC_Hack := False; pragma Debug (Debug.Trace (Self_ID, "raise Abort_Signal (ATC hack)", 'B')); raise Standard'Abort_Signal; end if; end if; return; end if; end loop; end Do_Pending_Action; ----------------------- -- Final_Task_Unlock -- ----------------------- -- This version is only for use in Terminate_Task, when the task -- is relinquishing further rights to its own ATCB. -- There is a very interesting potential race condition there, where -- the old task may run concurrently with a new task that is allocated -- the old tasks (now reused) ATCB. The critical thing here is to -- not make any reference to the ATCB after the lock is released. -- See also comments on Terminate_Task and Unlock. procedure Final_Task_Unlock (Self_ID : Task_Id) is begin pragma Assert (Self_ID.Common.Global_Task_Lock_Nesting = 1); Unlock (Global_Task_Lock'Access, Global_Lock => True); end Final_Task_Unlock; -------------- -- Init_RTS -- -------------- procedure Init_RTS is Self_Id : Task_Id; begin Tasking.Initialize; -- Terminate run time (regular vs restricted) specific initialization -- of the environment task. Self_Id := Environment_Task; Self_Id.Master_of_Task := Environment_Task_Level; Self_Id.Master_Within := Self_Id.Master_of_Task + 1; for L in Self_Id.Entry_Calls'Range loop Self_Id.Entry_Calls (L).Self := Self_Id; Self_Id.Entry_Calls (L).Level := L; end loop; Self_Id.Awake_Count := 1; Self_Id.Alive_Count := 1; Self_Id.Master_Within := Library_Task_Level; -- Normally, a task starts out with internal master nesting level -- one larger than external master nesting level. It is incremented -- to one by Enter_Master, which is called in the task body only if -- the compiler thinks the task may have dependent tasks. There is no -- corresponding call to Enter_Master for the environment task, so we -- would need to increment it to 2 here. Instead, we set it to 3. -- By doing this we reserve the level 2 for server tasks of the runtime -- system. The environment task does not need to wait for these server -- Initialize lock used to implement mutual exclusion between all tasks Initialize_Lock (Global_Task_Lock'Access, STPO.Global_Task_Level); -- Notify that the tasking run time has been elaborated so that -- the tasking version of the soft links can be used. if not No_Abort or else Dynamic_Priority_Support then SSL.Abort_Defer := Abort_Defer'Access; SSL.Abort_Undefer := Abort_Undefer'Access; end if; SSL.Update_Exception := Update_Exception'Access; SSL.Lock_Task := Task_Lock'Access; SSL.Unlock_Task := Task_Unlock'Access; SSL.Check_Abort_Status := Check_Abort_Status'Access; SSL.Get_Stack_Info := Get_Stack_Info'Access; SSL.Task_Name := Task_Name'Access; -- Initialize the tasking soft links (if not done yet) that are common -- to the full and the restricted run times. SSL.Tasking.Init_Tasking_Soft_Links; -- Abort is deferred in a new ATCB, so we need to undefer abort -- at this stage to make the environment task abortable. Undefer_Abort (Environment_Task); end Init_RTS; --------------------------- -- Locked_Abort_To_Level-- --------------------------- -- Abort a task to the specified ATC nesting level. -- Call this only with T locked. -- An earlier version of this code contained a call to Wakeup. That -- should not be necessary here, if Abort_Task is implemented correctly, -- since Abort_Task should include the effect of Wakeup. However, the -- above call was in earlier versions of this file, and at least for -- some targets Abort_Task has not beek doing Wakeup. It should not -- hurt to uncomment the above call, until the error is corrected for -- all targets. -- See extended comments in package body System.Tasking.Abort for the -- overall design of the implementation of task abort. -- ??? there is no such package ??? -- If the task is sleeping it will be in an abort-deferred region, and -- will not have Abort_Signal raised by Abort_Task. Such an "abort -- deferral" is just to protect the RTS internals, and not necessarily -- required to enforce Ada semantics. Abort_Task should wake the task up -- and let it decide if it wants to complete the aborted construct -- immediately. -- Note that the effect of the lowl-level Abort_Task is not persistent. -- If the target task is not blocked, this wakeup will be missed. -- We don't bother calling Abort_Task if this task is aborting itself, -- since we are inside the RTS and have abort deferred. Similarly, We -- don't bother to call Abort_Task if T is terminated, since there is -- no need to abort a terminated task, and it could be dangerous to try -- if the task has stopped executing. -- Note that an earlier version of this code had some false reasoning -- about being able to reliably wake up a task that had suspended on -- a blocking system call that does not atomically relase the task's -- lock (e.g., UNIX nanosleep, which we once thought could be used to -- implement delays). That still left the possibility of missed -- wakeups. -- We cannot safely call Vulnerable_Complete_Activation here, since that -- requires locking Self_ID.Parent. The anti-deadlock lock ordering rules -- would then require us to release the lock on Self_ID first, which would -- create a timing window for other tasks to lock Self_ID. This is -- significant for tasks that may be aborted before their execution can -- enter the task body, and so they do not get a chance to call -- Complete_Task. The actual work for this case is done in Terminate_Task. procedure Locked_Abort_To_Level (Self_ID : Task_Id; T : Task_Id; L : ATC_Level) is begin if not T.Aborting and then T /= Self_ID then case T.Common.State is when Unactivated | Terminated => pragma Assert (False); null; when Runnable => -- This is needed to cancel an asynchronous protected entry -- call during a requeue with abort. T.Entry_Calls (T.ATC_Nesting_Level).Cancellation_Attempted := True; when Interrupt_Server_Blocked_On_Event_Flag => null; when Delay_Sleep | Async_Select_Sleep | Interrupt_Server_Idle_Sleep | Interrupt_Server_Blocked_Interrupt_Sleep | Timer_Server_Sleep | AST_Server_Sleep => Wakeup (T, T.Common.State); when Acceptor_Sleep => T.Open_Accepts := null; Wakeup (T, T.Common.State); when Entry_Caller_Sleep => T.Entry_Calls (T.ATC_Nesting_Level).Cancellation_Attempted := True; Wakeup (T, T.Common.State); when Activator_Sleep | Master_Completion_Sleep | Master_Phase_2_Sleep | Asynchronous_Hold => null; end case; end if; if T.Pending_ATC_Level > L then T.Pending_ATC_Level := L; T.Pending_Action := True; if L = 0 then T.Callable := False; end if; -- This prevents aborted task from accepting calls if T.Aborting then -- The test above is just a heuristic, to reduce wasteful -- calls to Abort_Task. We are holding T locked, and this -- value will not be set to False except with T also locked, -- inside Exit_One_ATC_Level, so we should not miss wakeups. if T.Common.State = Acceptor_Sleep then T.Open_Accepts := null; end if; elsif T /= Self_ID and then (T.Common.State = Runnable or else T.Common.State = Interrupt_Server_Blocked_On_Event_Flag) -- The task is blocked on a system call waiting for the -- completion event. In this case Abort_Task may need to take -- special action in order to succeed. Example system: VMS. then Abort_Task (T); end if; end if; end Locked_Abort_To_Level; ------------------------------- -- Poll_Base_Priority_Change -- ------------------------------- -- Poll for pending base priority change and for held tasks. -- This should always be called with (only) Self_ID locked. -- It may temporarily release Self_ID's lock. -- The call to Yield is to force enqueuing at the -- tail of the dispatching queue. -- We must unlock Self_ID for this to take effect, -- since we are inheriting high active priority from the lock. -- See also Poll_Base_Priority_Change_At_Entry_Call, -- in package System.Tasking.Entry_Calls. -- In this version, we check if the task is held too because -- doing this only in Do_Pending_Action is not enough. procedure Poll_Base_Priority_Change (Self_ID : Task_Id) is begin if Dynamic_Priority_Support and then Self_ID.Pending_Priority_Change then -- Check for ceiling violations ??? Self_ID.Pending_Priority_Change := False; if Self_ID.Common.Base_Priority = Self_ID.New_Base_Priority then if Single_Lock then Unlock_RTS; Yield; Lock_RTS; else Unlock (Self_ID); Yield; Write_Lock (Self_ID); end if; elsif Self_ID.Common.Base_Priority < Self_ID.New_Base_Priority then Self_ID.Common.Base_Priority := Self_ID.New_Base_Priority; Set_Priority (Self_ID, Self_ID.Common.Base_Priority); else -- Lowering priority Self_ID.Common.Base_Priority := Self_ID.New_Base_Priority; Set_Priority (Self_ID, Self_ID.Common.Base_Priority); if Single_Lock then Unlock_RTS; Yield; Lock_RTS; else Unlock (Self_ID); Yield; Write_Lock (Self_ID); end if; end if; end if; end Poll_Base_Priority_Change; -------------------------------- -- Remove_From_All_Tasks_List -- -------------------------------- procedure Remove_From_All_Tasks_List (T : Task_Id) is C : Task_Id; Previous : Task_Id; begin pragma Debug (Debug.Trace (Self, "Remove_From_All_Tasks_List", 'C')); Previous := Null_Task; C := All_Tasks_List; while C /= Null_Task loop if C = T then if Previous = Null_Task then All_Tasks_List := All_Tasks_List.Common.All_Tasks_Link; else Previous.Common.All_Tasks_Link := C.Common.All_Tasks_Link; end if; return; end if; Previous := C; C := C.Common.All_Tasks_Link; end loop; pragma Assert (False); end Remove_From_All_Tasks_List; --------------- -- Task_Lock -- --------------- procedure Task_Lock (Self_ID : Task_Id) is begin Self_ID.Common.Global_Task_Lock_Nesting := Self_ID.Common.Global_Task_Lock_Nesting + 1; if Self_ID.Common.Global_Task_Lock_Nesting = 1 then Defer_Abort_Nestable (Self_ID); Write_Lock (Global_Task_Lock'Access, Global_Lock => True); end if; end Task_Lock; procedure Task_Lock is begin Task_Lock (STPO.Self); end Task_Lock; --------------- -- Task_Name -- --------------- function Task_Name return String is Self_Id : constant Task_Id := STPO.Self; begin return Self_Id.Common.Task_Image (1 .. Self_Id.Common.Task_Image_Len); end Task_Name; ----------------- -- Task_Unlock -- ----------------- procedure Task_Unlock (Self_ID : Task_Id) is begin pragma Assert (Self_ID.Common.Global_Task_Lock_Nesting > 0); Self_ID.Common.Global_Task_Lock_Nesting := Self_ID.Common.Global_Task_Lock_Nesting - 1; if Self_ID.Common.Global_Task_Lock_Nesting = 0 then Unlock (Global_Task_Lock'Access, Global_Lock => True); Undefer_Abort_Nestable (Self_ID); end if; end Task_Unlock; procedure Task_Unlock is begin Task_Unlock (STPO.Self); end Task_Unlock; ------------------- -- Undefer_Abort -- ------------------- -- Precondition : Self does not hold any locks! -- Undefer_Abort is called on any abort completion point (aka. -- synchronization point). It performs the following actions if they -- are pending: (1) change the base priority, (2) abort the task. -- The priority change has to occur before abort. Otherwise, it would -- take effect no earlier than the next abort completion point. procedure Undefer_Abort (Self_ID : Task_Id) is begin if No_Abort and then not Dynamic_Priority_Support then return; end if; pragma Assert (Self_ID.Deferral_Level = 1); Self_ID.Deferral_Level := Self_ID.Deferral_Level - 1; if Self_ID.Deferral_Level = 0 then pragma Assert (Check_No_Locks (Self_ID)); if Self_ID.Pending_Action then Do_Pending_Action (Self_ID); end if; end if; end Undefer_Abort; ---------------------------- -- Undefer_Abort_Nestable -- ---------------------------- -- An earlier version would re-defer abort if an abort is in progress. -- Then, we modified the effect of the raise statement so that it defers -- abort until control reaches a handler. That was done to prevent -- "skipping over" a handler if another asynchronous abort occurs during -- the propagation of the abort to the handler. -- There has been talk of reversing that decision, based on a newer -- implementation of exception propagation. Care must be taken to evaluate -- how such a change would interact with the above code and all the places -- where abort-deferral is used to bridge over critical transitions, such -- as entry to the scope of a region with a finalizer and entry into the -- body of an accept-procedure. procedure Undefer_Abort_Nestable (Self_ID : Task_Id) is begin if No_Abort and then not Dynamic_Priority_Support then return; end if; pragma Assert (Self_ID.Deferral_Level > 0); Self_ID.Deferral_Level := Self_ID.Deferral_Level - 1; if Self_ID.Deferral_Level = 0 then pragma Assert (Check_No_Locks (Self_ID)); if Self_ID.Pending_Action then Do_Pending_Action (Self_ID); end if; end if; end Undefer_Abort_Nestable; ------------------- -- Abort_Undefer -- ------------------- procedure Abort_Undefer is Self_ID : Task_Id; begin if No_Abort and then not Dynamic_Priority_Support then return; end if; Self_ID := STPO.Self; if Self_ID.Deferral_Level = 0 then -- In case there are different views on whether Abort is supported -- between the expander and the run time, we may end up with -- Self_ID.Deferral_Level being equal to zero, when called from -- the procedure created by the expander that corresponds to a -- task body. -- In this case, there's nothing to be done -- See related code in System.Tasking.Stages.Create_Task resetting -- Deferral_Level when System.Restrictions.Abort_Allowed is False. return; end if; pragma Assert (Self_ID.Deferral_Level > 0); Self_ID.Deferral_Level := Self_ID.Deferral_Level - 1; if Self_ID.Deferral_Level = 0 then pragma Assert (Check_No_Locks (Self_ID)); if Self_ID.Pending_Action then Do_Pending_Action (Self_ID); end if; end if; end Abort_Undefer; ---------------------- -- Update_Exception -- ---------------------- -- Call only when holding no locks procedure Update_Exception (X : AE.Exception_Occurrence := Current_Target_Exception) is Self_Id : constant Task_Id := Self; use Ada.Exceptions; begin Save_Occurrence (Self_Id.Common.Compiler_Data.Current_Excep, X); if Self_Id.Deferral_Level = 0 then if Self_Id.Pending_Action then Self_Id.Pending_Action := False; Self_Id.Deferral_Level := Self_Id.Deferral_Level + 1; if Single_Lock then Lock_RTS; end if; Write_Lock (Self_Id); Self_Id.Pending_Action := False; Poll_Base_Priority_Change (Self_Id); Unlock (Self_Id); if Single_Lock then Unlock_RTS; end if; Self_Id.Deferral_Level := Self_Id.Deferral_Level - 1; if Self_Id.Pending_ATC_Level < Self_Id.ATC_Nesting_Level then if not Self_Id.Aborting then Self_Id.Aborting := True; raise Standard'Abort_Signal; end if; end if; end if; end if; end Update_Exception; -------------------------- -- Wakeup_Entry_Caller -- -------------------------- -- This is called at the end of service of an entry call, to abort the -- caller if he is in an abortable part, and to wake up the caller if it -- is on Entry_Caller_Sleep. It assumes that the call is already off-queue. -- (This enforces the rule that a task must be off-queue if its state is -- Done or Cancelled.) Call it holding the lock of Entry_Call.Self. -- Timed_Call or Simple_Call: -- The caller is waiting on Entry_Caller_Sleep, in -- Wait_For_Completion, or Wait_For_Completion_With_Timeout. -- Conditional_Call: -- The caller might be in Wait_For_Completion, -- waiting for a rendezvous (possibly requeued without abort) -- to complete. -- Asynchronous_Call: -- The caller may be executing in the abortable part o -- an async. select, or on a time delay, -- if Entry_Call.State >= Was_Abortable. procedure Wakeup_Entry_Caller (Self_ID : Task_Id; Entry_Call : Entry_Call_Link; New_State : Entry_Call_State) is Caller : constant Task_Id := Entry_Call.Self; begin pragma Debug (Debug.Trace (Self_ID, "Wakeup_Entry_Caller", 'E', Caller)); pragma Assert (New_State = Done or else New_State = Cancelled); pragma Assert (Caller.Common.State /= Terminated and then Caller.Common.State /= Unactivated); Entry_Call.State := New_State; if Entry_Call.Mode = Asynchronous_Call then -- Abort the caller in his abortable part, -- but do so only if call has been queued abortably if Entry_Call.State >= Was_Abortable or else New_State = Done then Locked_Abort_To_Level (Self_ID, Caller, Entry_Call.Level - 1); end if; elsif Caller.Common.State = Entry_Caller_Sleep then Wakeup (Caller, Entry_Caller_Sleep); end if; end Wakeup_Entry_Caller; ---------------------- -- Soft-Link Bodies -- ---------------------- function Get_Stack_Info return Stack_Checking.Stack_Access is begin return STPO.Self.Common.Compiler_Data.Pri_Stack_Info'Access; end Get_Stack_Info; ----------------------- -- Soft-Link Dummies -- ----------------------- -- These are dummies for subprograms that are only needed by certain -- optional run-time system packages. If they are needed, the soft -- links will be redirected to the real subprogram by elaboration of -- the subprogram body where the real subprogram is declared. procedure Finalize_Attributes (T : Task_Id) is pragma Warnings (Off, T); begin null; end Finalize_Attributes; procedure Initialize_Attributes (T : Task_Id) is pragma Warnings (Off, T); begin null; end Initialize_Attributes; begin Init_RTS; end System.Tasking.Initialization;

35.358696

79

0.607624

1dee4389f88bfef772f341d3856c90d206948980

2,585

ads

Ada

bb-runtimes/examples/monitor/net/ethdrv.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/examples/monitor/net/ethdrv.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/examples/monitor/net/ethdrv.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT EXAMPLE -- -- -- -- Copyright (C) 2013, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Interfaces; use Interfaces; package Ethdrv is procedure Eth_Init; -- Initialize ethernet procedure Eth_Rcv_Wait (Maxtime : Unsigned_32 := 16#ffffffff#); -- Wait until a packet is received or until Maxtime is expired procedure Eth_Send_Init; -- Init Packet_Off for sending a frame procedure Eth_Send_Packet; -- Send a frame end Ethdrv;

57.444444

78

0.484333

1d7a85a189980009037300aa9bb4bfba6acf276f

8,145

adb

Ada

firehog/ncurses/Ada95/samples/sample-keyboard_handler.adb

KipodAfterFree/KAF-2019-FireHog

5f6ee3c3c3329459bc9daeabc1a16ff4619508d9

[ "MIT" ]

null

firehog/ncurses/Ada95/samples/sample-keyboard_handler.adb

KipodAfterFree/KAF-2019-FireHog

5f6ee3c3c3329459bc9daeabc1a16ff4619508d9

[ "MIT" ]

null

firehog/ncurses/Ada95/samples/sample-keyboard_handler.adb

KipodAfterFree/KAF-2019-FireHog

5f6ee3c3c3329459bc9daeabc1a16ff4619508d9

[ "MIT" ]

1

2019-12-26T10:18:16.000Z

------------------------------------------------------------------------------ -- -- -- GNAT ncurses Binding Samples -- -- -- -- Sample.Keyboard_Handler -- -- -- -- B O D Y -- -- -- ------------------------------------------------------------------------------ -- Copyright (c) 1998 Free Software Foundation, Inc. -- -- -- -- Permission is hereby granted, free of charge, to any person obtaining a -- -- copy of this software and associated documentation files (the -- -- "Software"), to deal in the Software without restriction, including -- -- without limitation the rights to use, copy, modify, merge, publish, -- -- distribute, distribute with modifications, sublicense, and/or sell -- -- copies of the Software, and to permit persons to whom the Software is -- -- furnished to do so, subject to the following conditions: -- -- -- -- The above copyright notice and this permission notice shall be included -- -- in all copies or substantial portions of the Software. -- -- -- -- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -- -- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -- -- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. -- -- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -- -- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -- -- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR -- -- THE USE OR OTHER DEALINGS IN THE SOFTWARE. -- -- -- -- Except as contained in this notice, the name(s) of the above copyright -- -- holders shall not be used in advertising or otherwise to promote the -- -- sale, use or other dealings in this Software without prior written -- -- authorization. -- ------------------------------------------------------------------------------ -- Author: Juergen Pfeifer <[email protected]> 1996 -- Version Control -- $Revision: 1.5 $ -- Binding Version 00.93 ------------------------------------------------------------------------------ with Ada.Strings; use Ada.Strings; with Ada.Strings.Fixed; use Ada.Strings.Fixed; with Ada.Strings.Maps.Constants; use Ada.Strings.Maps.Constants; with Ada.Characters.Latin_1; use Ada.Characters.Latin_1; with Ada.Characters.Handling; use Ada.Characters.Handling; with Terminal_Interface.Curses.Panels; use Terminal_Interface.Curses.Panels; with Terminal_Interface.Curses.Forms; use Terminal_Interface.Curses.Forms; with Terminal_Interface.Curses.Forms.Field_Types.Enumeration; use Terminal_Interface.Curses.Forms.Field_Types.Enumeration; with Sample.Header_Handler; use Sample.Header_Handler; with Sample.Form_Demo.Aux; use Sample.Form_Demo.Aux; with Sample.Manifest; use Sample.Manifest; with Sample.Form_Demo.Handler; -- This package contains a centralized keyboard handler used throughout -- this example. The handler establishes a timeout mechanism that provides -- periodical updates of the common header lines used in this example. -- package body Sample.Keyboard_Handler is In_Command : Boolean := False; function Get_Key (Win : Window := Standard_Window) return Real_Key_Code is K : Real_Key_Code; function Command return Real_Key_Code; function Command return Real_Key_Code is function My_Driver (F : Form; C : Key_Code; P : Panel) return Boolean; package Fh is new Sample.Form_Demo.Handler (My_Driver); type Label_Array is array (Label_Number) of String (1 .. 8); Labels : Label_Array; FA : Field_Array_Access := new Field_Array' (Make (0, 0, "Command:"), Make (Top => 0, Left => 9, Width => Columns - 11), Null_Field); K : Real_Key_Code := Key_None; N : Natural := 0; function My_Driver (F : Form; C : Key_Code; P : Panel) return Boolean is Ch : Character; begin if C in User_Key_Code'Range and then C = QUIT then if Driver (F, F_Validate_Field) = Form_Ok then K := Key_None; return True; end if; elsif C in Normal_Key_Code'Range then Ch := Character'Val (C); if (Ch = LF or else Ch = CR) then if Driver (F, F_Validate_Field) = Form_Ok then declare Buffer : String (1 .. Positive (Columns - 11)); Cmdc : String (1 .. 8); begin Get_Buffer (Fld => FA (2), Str => Buffer); Trim (Buffer, Left); if Buffer (1) /= ' ' then Cmdc := To_Upper (Buffer (Cmdc'Range)); for I in Labels'Range loop if Cmdc = Labels (I) then K := Function_Key_Code (Function_Key_Number (I)); exit; end if; end loop; end if; return True; end; end if; end if; end if; return False; end My_Driver; begin In_Command := True; for I in Label_Number'Range loop Get_Soft_Label_Key (I, Labels (I)); Trim (Labels (I), Left); Translate (Labels (I), Upper_Case_Map); if Labels (I) (1) /= ' ' then N := N + 1; end if; end loop; if N > 0 then -- some labels were really set declare Enum_Info : Enumeration_Info (N); Enum_Field : Enumeration_Field; J : Positive := Enum_Info.Names'First; Frm : Form := Create (FA); begin for I in Label_Number'Range loop if Labels (I) (1) /= ' ' then Enum_Info.Names (J) := new String'(Labels (I)); J := J + 1; end if; end loop; Enum_Field := Create (Enum_Info, True); Set_Field_Type (FA (2), Enum_Field); Set_Background (FA (2), Normal_Video); Fh.Drive_Me (Frm, Lines - 3, 0); Delete (Frm); Update_Panels; Update_Screen; end; end if; Free (FA, True); In_Command := False; return K; end Command; begin Set_Timeout_Mode (Win, Delayed, 30000); loop K := Get_Keystroke (Win); if K = Key_None then -- a timeout occured Update_Header_Window; elsif K = 3 and then not In_Command then -- CTRL-C K := Command; exit when K /= Key_None; else exit; end if; end loop; return K; end Get_Key; procedure Init_Keyboard_Handler is begin null; end Init_Keyboard_Handler; end Sample.Keyboard_Handler;

42.421875

78

0.475261

1d2632be80179cee18b1d6d83c0954d2fca25afa

2,133

adb

Ada

src/dw1000-generic_rw_register_driver.adb

SALLYPEMDAS/DW1000

ce2906596e479c83ce64673e8e7cf03856c45523

[ "MIT" ]

9

2016-07-06T21:26:41.000Z

2020-11-22T11:21:58.000Z

src/dw1000-generic_rw_register_driver.adb

hao122065175/DW1000

ce2906596e479c83ce64673e8e7cf03856c45523

[ "MIT" ]

1

2018-06-19T15:20:41.000Z

2018-06-19T21:14:31.000Z

src/dw1000-generic_rw_register_driver.adb

hao122065175/DW1000

ce2906596e479c83ce64673e8e7cf03856c45523

[ "MIT" ]

4

2018-07-18T03:35:25.000Z

2020-11-22T11:21:59.000Z

------------------------------------------------------------------------------- -- Copyright (c) 2016 Daniel King -- -- Permission is hereby granted, free of charge, to any person obtaining a -- copy of this software and associated documentation files (the "Software"), -- to deal in the Software without restriction, including without limitation -- the rights to use, copy, modify, merge, publish, distribute, sublicense, -- and/or sell copies of the Software, and to permit persons to whom the -- Software is furnished to do so, subject to the following conditions: -- -- The above copyright notice and this permission notice shall be included in -- all copies or substantial portions of the Software. -- -- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER -- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING -- FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER -- DEALINGS IN THE SOFTWARE. ------------------------------------------------------------------------------- with DW1000.Generic_RO_Register_Driver; with DW1000.Generic_WO_Register_Driver; package body DW1000.Generic_RW_Register_Driver is ------------------- -- Read_Driver -- ------------------- -- Reuse the Read/Write procedures from the other drivers. package Read_Driver is new Generic_RO_Register_Driver (Register_Type, Register_ID, Sub_Register); package Write_Driver is new Generic_WO_Register_Driver (Register_Type, Register_ID, Sub_Register); ------------ -- Read -- ------------ procedure Read (Reg : out Register_Type) is begin Read_Driver.Read (Reg); end Read; ------------- -- Write -- ------------- procedure Write (Reg : in Register_Type) is begin Write_Driver.Write (Reg); end Write; end DW1000.Generic_RW_Register_Driver;

33.857143

79

0.642288

1dc2c932618dd5e5649c19f677c2b87434057f4c

5,520

adb

Ada

arch/ARM/STM32/driversWL5x/stm32-spi-dma.adb

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

2

2018-05-16T03:56:39.000Z

2019-07-31T13:53:56.000Z

arch/ARM/STM32/driversWL5x/stm32-spi-dma.adb

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

null

arch/ARM/STM32/driversWL5x/stm32-spi-dma.adb

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- Copyright (C) 2015, AdaCore -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions are -- -- met: -- -- 1. Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- 2. Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in -- -- the documentation and/or other materials provided with the -- -- distribution. -- -- 3. Neither the name of STMicroelectronics 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. -- -- -- -- -- -- This file is based on: -- -- -- -- @file stm32f4xx_hal_spi.c -- -- @author MCD Application Team -- -- @version V1.1.0 -- -- @date 19-June-2014 -- -- @brief SPI HAL module driver. -- -- -- -- COPYRIGHT(c) 2014 STMicroelectronics -- ------------------------------------------------------------------------------ with STM32.Device; use STM32.Device; package body STM32.SPI.DMA is procedure Configure_DMA (Controller : access DMA_Controller; Channel : DMA_Channel_Selector; Data_Width : DMA_Data_Transfer_Widths); procedure Configure_DMA (Controller : access DMA_Controller; Channel : DMA_Channel_Selector; Data_Width : DMA_Data_Transfer_Widths) is Config : DMA_Channel_Configuration; begin -- See app note AN4187 Table 3 for this configuration (other than the -- channel number). It works, although it looks counterintuitive. Config.Channel := Channel_1; -- arbitrary Config.Direction := Memory_To_Peripheral; Config.Memory_Data_Format := Data_Width; Config.Peripheral_Data_Format := Bytes; Config.Increment_Peripheral_Address := False; Config.Increment_Memory_Address := True; Config.Operation_Mode := Normal_Mode; Config.Priority := Priority_Very_High; Config.FIFO_Enabled := False; Config.Memory_Burst_Size := Memory_Burst_Single; Config.Peripheral_Burst_Size := Peripheral_Burst_Single; Config.CS := 1; Configure (Controller.all, Channel, Config); end Configure_DMA; procedure Transmit_DMA (This : in out SPI_Port; Controller : access DMA_Controller; Channel : DMA_Channel_Selector; Outgoing : HAL.SPI.SPI_Data_8b) is Data_Width : DMA_Data_Transfer_Widths := Bytes; begin Configure_DMA (Controller, Channel, Data_Width); -- We configure the unit each time to ensure the data width is right. Clear_All_Status (Controller.all, Channel); -- Ensure previous calls or other use hasn't set any status flags. Start_Transfer_with_Interrupts (Controller.all, Channel, Source => Outgoing'Address, Destination => This.Periph.DR'Address, Data_Count => Outgoing'Length, Enabled_Interrupts => (Transfer_Complete_Interrupt => True, others => False)); end Transmit_DMA; end STM32.SPI.DMA;

55.2

78

0.5

4daf8eab050a71aa5b61cfe383e2d7a6eea5e527

7,418

ads

Ada

source/nodes/program-nodes-object_declarations.ads

optikos/oasis

9f64d46d26d964790d69f9db681c874cfb3bf96d

[ "MIT" ]

null

source/nodes/program-nodes-object_declarations.ads

optikos/oasis

9f64d46d26d964790d69f9db681c874cfb3bf96d

[ "MIT" ]

null

source/nodes/program-nodes-object_declarations.ads

optikos/oasis

9f64d46d26d964790d69f9db681c874cfb3bf96d

[ "MIT" ]

2

2019-09-14T23:18:50.000Z

2019-10-02T10:11:40.000Z

-- Copyright (c) 2019 Maxim Reznik <[email protected]> -- -- SPDX-License-Identifier: MIT -- License-Filename: LICENSE ------------------------------------------------------------- with Program.Elements.Defining_Identifiers; with Program.Lexical_Elements; with Program.Elements.Definitions; with Program.Elements.Expressions; with Program.Elements.Aspect_Specifications; with Program.Elements.Object_Declarations; with Program.Element_Visitors; package Program.Nodes.Object_Declarations is pragma Preelaborate; type Object_Declaration is new Program.Nodes.Node and Program.Elements.Object_Declarations.Object_Declaration and Program.Elements.Object_Declarations.Object_Declaration_Text with private; function Create (Names : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Vector_Access; Colon_Token : not null Program.Lexical_Elements .Lexical_Element_Access; Aliased_Token : Program.Lexical_Elements .Lexical_Element_Access; Constant_Token : Program.Lexical_Elements .Lexical_Element_Access; Object_Subtype : not null Program.Elements.Definitions .Definition_Access; Assignment_Token : Program.Lexical_Elements .Lexical_Element_Access; Initialization_Expression : Program.Elements.Expressions .Expression_Access; With_Token : Program.Lexical_Elements .Lexical_Element_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Semicolon_Token : not null Program.Lexical_Elements .Lexical_Element_Access) return Object_Declaration; type Implicit_Object_Declaration is new Program.Nodes.Node and Program.Elements.Object_Declarations.Object_Declaration with private; function Create (Names : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Vector_Access; Object_Subtype : not null Program.Elements.Definitions .Definition_Access; Initialization_Expression : Program.Elements.Expressions .Expression_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False; Has_Aliased : Boolean := False; Has_Constant : Boolean := False) return Implicit_Object_Declaration with Pre => Is_Part_Of_Implicit or Is_Part_Of_Inherited or Is_Part_Of_Instance; private type Base_Object_Declaration is abstract new Program.Nodes.Node and Program.Elements.Object_Declarations.Object_Declaration with record Names : not null Program.Elements .Defining_Identifiers.Defining_Identifier_Vector_Access; Object_Subtype : not null Program.Elements.Definitions .Definition_Access; Initialization_Expression : Program.Elements.Expressions .Expression_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; end record; procedure Initialize (Self : aliased in out Base_Object_Declaration'Class); overriding procedure Visit (Self : not null access Base_Object_Declaration; Visitor : in out Program.Element_Visitors.Element_Visitor'Class); overriding function Names (Self : Base_Object_Declaration) return not null Program.Elements.Defining_Identifiers .Defining_Identifier_Vector_Access; overriding function Object_Subtype (Self : Base_Object_Declaration) return not null Program.Elements.Definitions.Definition_Access; overriding function Initialization_Expression (Self : Base_Object_Declaration) return Program.Elements.Expressions.Expression_Access; overriding function Aspects (Self : Base_Object_Declaration) return Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; overriding function Is_Object_Declaration_Element (Self : Base_Object_Declaration) return Boolean; overriding function Is_Declaration_Element (Self : Base_Object_Declaration) return Boolean; type Object_Declaration is new Base_Object_Declaration and Program.Elements.Object_Declarations.Object_Declaration_Text with record Colon_Token : not null Program.Lexical_Elements .Lexical_Element_Access; Aliased_Token : Program.Lexical_Elements.Lexical_Element_Access; Constant_Token : Program.Lexical_Elements.Lexical_Element_Access; Assignment_Token : Program.Lexical_Elements.Lexical_Element_Access; With_Token : Program.Lexical_Elements.Lexical_Element_Access; Semicolon_Token : not null Program.Lexical_Elements .Lexical_Element_Access; end record; overriding function To_Object_Declaration_Text (Self : aliased in out Object_Declaration) return Program.Elements.Object_Declarations .Object_Declaration_Text_Access; overriding function Colon_Token (Self : Object_Declaration) return not null Program.Lexical_Elements.Lexical_Element_Access; overriding function Aliased_Token (Self : Object_Declaration) return Program.Lexical_Elements.Lexical_Element_Access; overriding function Constant_Token (Self : Object_Declaration) return Program.Lexical_Elements.Lexical_Element_Access; overriding function Assignment_Token (Self : Object_Declaration) return Program.Lexical_Elements.Lexical_Element_Access; overriding function With_Token (Self : Object_Declaration) return Program.Lexical_Elements.Lexical_Element_Access; overriding function Semicolon_Token (Self : Object_Declaration) return not null Program.Lexical_Elements.Lexical_Element_Access; overriding function Has_Aliased (Self : Object_Declaration) return Boolean; overriding function Has_Constant (Self : Object_Declaration) return Boolean; type Implicit_Object_Declaration is new Base_Object_Declaration with record Is_Part_Of_Implicit : Boolean; Is_Part_Of_Inherited : Boolean; Is_Part_Of_Instance : Boolean; Has_Aliased : Boolean; Has_Constant : Boolean; end record; overriding function To_Object_Declaration_Text (Self : aliased in out Implicit_Object_Declaration) return Program.Elements.Object_Declarations .Object_Declaration_Text_Access; overriding function Is_Part_Of_Implicit (Self : Implicit_Object_Declaration) return Boolean; overriding function Is_Part_Of_Inherited (Self : Implicit_Object_Declaration) return Boolean; overriding function Is_Part_Of_Instance (Self : Implicit_Object_Declaration) return Boolean; overriding function Has_Aliased (Self : Implicit_Object_Declaration) return Boolean; overriding function Has_Constant (Self : Implicit_Object_Declaration) return Boolean; end Program.Nodes.Object_Declarations;

36.905473

79

0.721353

2f1c3615dece6a8422af87734d7be637207f4c5c

261,801

adb

Ada

Vivado_HLS_Tutorial/RTL_Verification/lab2/duc_prj/solution1/.autopilot/db/duc_mixer.adb

williambong/Vivado

68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb

[ "MIT" ]

null

Vivado_HLS_Tutorial/RTL_Verification/lab2/duc_prj/solution1/.autopilot/db/duc_mixer.adb

williambong/Vivado

68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb

[ "MIT" ]

null

Vivado_HLS_Tutorial/RTL_Verification/lab2/duc_prj/solution1/.autopilot/db/duc_mixer.adb

williambong/Vivado

68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb

[ "MIT" ]

null

<?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>duc_mixer</name> <ret_bitwidth>0</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="3" tracking_level="1" version="0" object_id="_1"> <Value class_id="4" tracking_level="0" version="0"> <Obj class_id="5" tracking_level="0" version="0"> <type>1</type> <id>1</id> <name>freq</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>freq</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>16</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>Din</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>Din</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>18</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>Dout_I</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>Dout_I</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>18</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="_4"> <Value> <Obj> <type>1</type> <id>4</id> <name>Dout_Q</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>Dout_Q</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>18</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>72</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_5"> <Value> <Obj> <type>0</type> <id>12</id> <name>Din_read</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>Din</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>18</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>97</item> <item>98</item> </oprand_edges> <opcode>read</opcode> </item> <item class_id_reference="9" object_id="_6"> <Value> <Obj> <type>0</type> <id>13</id> <name>freq_read</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>freq</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>100</item> <item>101</item> </oprand_edges> <opcode>read</opcode> </item> <item class_id_reference="9" object_id="_7"> <Value> <Obj> <type>0</type> <id>14</id> <name>i_1_load</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>37</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="11" tracking_level="0" version="0"> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second class_id="12" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="13" tracking_level="0" version="0"> <first class_id="14" tracking_level="0" version="0"> <first>mixer.c</first> <second>mixer</second> </first> <second>37</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>102</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_8"> <Value> <Obj> <type>0</type> <id>15</id> <name>inc</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>37</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>37</second> </item> </second> </item> </inlineStackInfo> <originalName>inc</originalName> <rtlName>inc_fu_142_p2</rtlName> <coreName/> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>103</item> <item>105</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_9"> <Value> <Obj> <type>0</type> <id>16</id> <name>tmp_14</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>38</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>38</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_14_fu_148_p4</rtlName> <coreName/> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>107</item> <item>108</item> <item>110</item> <item>112</item> </oprand_edges> <opcode>partselect</opcode> </item> <item class_id_reference="9" object_id="_10"> <Value> <Obj> <type>0</type> <id>17</id> <name>valid_in</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>38</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>38</second> </item> </second> </item> </inlineStackInfo> <originalName>valid_in</originalName> <rtlName>valid_in_fu_158_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>113</item> <item>115</item> </oprand_edges> <opcode>icmp</opcode> </item> <item class_id_reference="9" object_id="_11"> <Value> <Obj> <type>0</type> <id>18</id> <name>init_1_load</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>116</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_12"> <Value> <Obj> <type>0</type> <id>19</id> <name>freq_dds</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName>freq</originalName> <rtlName>freq_dds_fu_168_p3</rtlName> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>117</item> <item>119</item> <item>120</item> </oprand_edges> <opcode>select</opcode> </item> <item class_id_reference="9" object_id="_13"> <Value> <Obj> <type>0</type> <id>20</id> <name>ch_1_load</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>45</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>45</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>121</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_14"> <Value> <Obj> <type>0</type> <id>21</id> <name>brmerge_demorgan</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>45</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>45</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>brmerge_demorgan_fu_180_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>122</item> <item>123</item> </oprand_edges> <opcode>and</opcode> </item> <item class_id_reference="9" object_id="_15"> <Value> <Obj> <type>0</type> <id>22</id> <name>index_load</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>46</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>46</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>124</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_16"> <Value> <Obj> <type>0</type> <id>23</id> <name/> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>45</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>45</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>125</item> <item>126</item> <item>127</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_17"> <Value> <Obj> <type>0</type> <id>25</id> <name/> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>48</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>48</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>136</item> <item>137</item> <item>138</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_18"> <Value> <Obj> <type>0</type> <id>27</id> <name>acc_load</name> <fileName>dds.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>14</lineNumber> <contextFuncName>dds</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>dds.c</first> <second>dds</second> </first> <second>14</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>49</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>139</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_19"> <Value> <Obj> <type>0</type> <id>28</id> <name>acc_assign_i</name> <fileName>dds.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>14</lineNumber> <contextFuncName>dds</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>dds.c</first> <second>dds</second> </first> <second>14</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>49</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>acc_assign_i_fu_194_p2</rtlName> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>140</item> <item>141</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_20"> <Value> <Obj> <type>0</type> <id>29</id> <name/> <fileName>dds.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>14</lineNumber> <contextFuncName>dds</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>dds.c</first> <second>dds</second> </first> <second>14</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</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>142</item> <item>143</item> <item>270</item> </oprand_edges> <opcode>store</opcode> </item> <item class_id_reference="9" object_id="_21"> <Value> <Obj> <type>0</type> <id>30</id> <name>phase1</name> <fileName>dds.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>24</lineNumber> <contextFuncName>dds</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>dds.c</first> <second>dds</second> </first> <second>24</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>49</second> </item> </second> </item> </inlineStackInfo> <originalName>phase1</originalName> <rtlName>phase1_reg_398</rtlName> <coreName/> </Obj> <bitwidth>5</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>145</item> <item>146</item> <item>148</item> <item>150</item> </oprand_edges> <opcode>partselect</opcode> </item> <item class_id_reference="9" object_id="_22"> <Value> <Obj> <type>0</type> <id>31</id> <name>tmp_i</name> <fileName>dds.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>26</lineNumber> <contextFuncName>dds</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>dds.c</first> <second>dds</second> </first> <second>26</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>49</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_i_fu_226_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>151</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_23"> <Value> <Obj> <type>0</type> <id>32</id> <name>dds_table_addr</name> <fileName>dds.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>26</lineNumber> <contextFuncName>dds</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>dds.c</first> <second>dds</second> </first> <second>26</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>49</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>5</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>152</item> <item>153</item> <item>154</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_24"> <Value> <Obj> <type>0</type> <id>33</id> <name>sine</name> <fileName>dds.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>26</lineNumber> <contextFuncName>dds</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>dds.c</first> <second>dds</second> </first> <second>26</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>49</second> </item> </second> </item> </inlineStackInfo> <originalName>sine</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>155</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_25"> <Value> <Obj> <type>0</type> <id>34</id> <name>phase2</name> <fileName>dds.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>32</lineNumber> <contextFuncName>dds</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>dds.c</first> <second>dds</second> </first> <second>32</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>49</second> </item> </second> </item> </inlineStackInfo> <originalName>phase2</originalName> <rtlName>phase2_fu_221_p2</rtlName> <coreName/> </Obj> <bitwidth>5</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>157</item> <item>158</item> </oprand_edges> <opcode>sub</opcode> </item> <item class_id_reference="9" object_id="_26"> <Value> <Obj> <type>0</type> <id>35</id> <name>tmp_61_i</name> <fileName>dds.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>33</lineNumber> <contextFuncName>dds</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>dds.c</first> <second>dds</second> </first> <second>33</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>49</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_61_i_fu_230_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>159</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_27"> <Value> <Obj> <type>0</type> <id>36</id> <name>dds_table_addr_1</name> <fileName>dds.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>33</lineNumber> <contextFuncName>dds</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>dds.c</first> <second>dds</second> </first> <second>33</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>49</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>5</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>160</item> <item>161</item> <item>162</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_28"> <Value> <Obj> <type>0</type> <id>37</id> <name>cosine</name> <fileName>dds.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>33</lineNumber> <contextFuncName>dds</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>dds.c</first> <second>dds</second> </first> <second>33</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>49</second> </item> </second> </item> </inlineStackInfo> <originalName>cosine</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>163</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_29"> <Value> <Obj> <type>0</type> <id>38</id> <name>tmp_s</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>50</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>50</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_s_fu_234_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>164</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_30"> <Value> <Obj> <type>0</type> <id>39</id> <name>DI_cache_addr_1</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>50</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>50</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>165</item> <item>166</item> <item>167</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_31"> <Value> <Obj> <type>0</type> <id>40</id> <name>Din_re</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>50</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>50</second> </item> </second> </item> </inlineStackInfo> <originalName>Din_re</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>18</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>168</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_32"> <Value> <Obj> <type>0</type> <id>41</id> <name>tmp_i3_cast</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>mix_SubDSP</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mix_SubDSP</second> </first> <second>7</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>169</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_33"> <Value> <Obj> <type>0</type> <id>42</id> <name>tmp_i4_cast</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>mix_SubDSP</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mix_SubDSP</second> </first> <second>7</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>170</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_34"> <Value> <Obj> <type>0</type> <id>43</id> <name>tmp_3</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>mix_SubDSP</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mix_SubDSP</second> </first> <second>7</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp</originalName> <rtlName>duc_am_submul_16s_16s_18s_32_4_U11</rtlName> <coreName/> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>171</item> <item>172</item> </oprand_edges> <opcode>sub</opcode> </item> <item class_id_reference="9" object_id="_35"> <Value> <Obj> <type>0</type> <id>44</id> <name>tmp_i_i</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>4</lineNumber> <contextFuncName>mix_SubDSP</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mix_SubDSP</second> </first> <second>4</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>173</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_36"> <Value> <Obj> <type>0</type> <id>45</id> <name>tmp_i_i_10</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>4</lineNumber> <contextFuncName>mix_SubDSP</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mix_SubDSP</second> </first> <second>4</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>duc_am_submul_16s_16s_18s_32_4_U11</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>174</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_37"> <Value> <Obj> <type>0</type> <id>46</id> <name>tmp_2</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>4</lineNumber> <contextFuncName>mix_SubDSP</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mix_SubDSP</second> </first> <second>4</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>duc_am_submul_16s_16s_18s_32_4_U11</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>175</item> <item>176</item> </oprand_edges> <opcode>mul</opcode> </item> <item class_id_reference="9" object_id="_38"> <Value> <Obj> <type>0</type> <id>47</id> <name>tmp_i5</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>mix_SubDSP</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mix_SubDSP</second> </first> <second>7</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_i5_fu_247_p1</rtlName> <coreName/> </Obj> <bitwidth>19</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>177</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_39"> <Value> <Obj> <type>0</type> <id>48</id> <name>tmp_i6</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>mix_SubDSP</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mix_SubDSP</second> </first> <second>7</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_i6_fu_250_p1</rtlName> <coreName/> </Obj> <bitwidth>19</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>178</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_40"> <Value> <Obj> <type>0</type> <id>49</id> <name>tmp_5</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>mix_SubDSP</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mix_SubDSP</second> </first> <second>7</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp</originalName> <rtlName>duc_ama_submuladd_18s_18s_16s_32s_32_3_U10</rtlName> <coreName/> </Obj> <bitwidth>19</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>179</item> <item>180</item> </oprand_edges> <opcode>sub</opcode> </item> <item class_id_reference="9" object_id="_41"> <Value> <Obj> <type>0</type> <id>50</id> <name>tmp_i_i8_cast</name> <fileName>mac.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>mult</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>mac.c</first> <second>mult</second> </first> <second>7</second> </item> <item> <first> <first>mixer.c</first> <second>mix_SubDSP</second> </first> <second>8</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>181</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_42"> <Value> <Obj> <type>0</type> <id>51</id> <name>tmp_i_i9_cast</name> <fileName>mac.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>mult</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>mac.c</first> <second>mult</second> </first> <second>7</second> </item> <item> <first> <first>mixer.c</first> <second>mix_SubDSP</second> </first> <second>8</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>duc_ama_submuladd_18s_18s_16s_32s_32_3_U10</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>182</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_43"> <Value> <Obj> <type>0</type> <id>52</id> <name>m</name> <fileName>mac.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>mult</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>mac.c</first> <second>mult</second> </first> <second>7</second> </item> <item> <first> <first>mixer.c</first> <second>mix_SubDSP</second> </first> <second>8</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName>m</originalName> <rtlName>duc_ama_submuladd_18s_18s_16s_32s_32_3_U10</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>183</item> <item>184</item> </oprand_edges> <opcode>mul</opcode> </item> <item class_id_reference="9" object_id="_44"> <Value> <Obj> <type>0</type> <id>53</id> <name>tmp_8</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>duc_ama_submuladd_18s_18s_16s_32s_32_3_U10</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>185</item> <item>186</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_45"> <Value> <Obj> <type>0</type> <id>54</id> <name>tmp_1</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>Dout_I</rtlName> <coreName/> </Obj> <bitwidth>18</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>188</item> <item>189</item> <item>191</item> <item>193</item> </oprand_edges> <opcode>partselect</opcode> </item> <item class_id_reference="9" object_id="_46"> <Value> <Obj> <type>0</type> <id>55</id> <name/> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>195</item> <item>196</item> <item>197</item> </oprand_edges> <opcode>write</opcode> </item> <item class_id_reference="9" object_id="_47"> <Value> <Obj> <type>0</type> <id>56</id> <name>tmp_6</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>16</lineNumber> <contextFuncName>mix_AddDSP</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mix_AddDSP</second> </first> <second>16</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp</originalName> <rtlName>duc_ama_addmuladd_18s_18s_16s_32s_32_3_U9</rtlName> <coreName/> </Obj> <bitwidth>19</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>198</item> <item>199</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_48"> <Value> <Obj> <type>0</type> <id>57</id> <name>tmp_i_i1_cast</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>18</lineNumber> <contextFuncName>mix_AddDSP</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mix_AddDSP</second> </first> <second>18</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>200</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_49"> <Value> <Obj> <type>0</type> <id>58</id> <name>tmp_i_i1_cast_11</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>18</lineNumber> <contextFuncName>mix_AddDSP</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mix_AddDSP</second> </first> <second>18</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>duc_ama_addmuladd_18s_18s_16s_32s_32_3_U9</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>201</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_50"> <Value> <Obj> <type>0</type> <id>59</id> <name>m_i_i</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>18</lineNumber> <contextFuncName>mix_AddDSP</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mix_AddDSP</second> </first> <second>18</second> </item> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>duc_ama_addmuladd_18s_18s_16s_32s_32_3_U9</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>202</item> <item>203</item> </oprand_edges> <opcode>mul</opcode> </item> <item class_id_reference="9" object_id="_51"> <Value> <Obj> <type>0</type> <id>60</id> <name>tmp_4</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>duc_ama_addmuladd_18s_18s_16s_32s_32_3_U9</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>204</item> <item>205</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_52"> <Value> <Obj> <type>0</type> <id>61</id> <name>tmp_7</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>Dout_Q</rtlName> <coreName/> </Obj> <bitwidth>18</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>206</item> <item>207</item> <item>208</item> <item>209</item> </oprand_edges> <opcode>partselect</opcode> </item> <item class_id_reference="9" object_id="_53"> <Value> <Obj> <type>0</type> <id>62</id> <name/> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>210</item> <item>211</item> <item>212</item> </oprand_edges> <opcode>write</opcode> </item> <item class_id_reference="9" object_id="_54"> <Value> <Obj> <type>0</type> <id>63</id> <name>tmp_9</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>62</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>62</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_9_fu_279_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>213</item> <item>215</item> </oprand_edges> <opcode>icmp</opcode> </item> <item class_id_reference="9" object_id="_55"> <Value> <Obj> <type>0</type> <id>64</id> <name/> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>62</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>62</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>216</item> <item>217</item> <item>218</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_56"> <Value> <Obj> <type>0</type> <id>66</id> <name/> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>64</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>64</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>220</item> <item>221</item> <item>272</item> </oprand_edges> <opcode>store</opcode> </item> <item class_id_reference="9" object_id="_57"> <Value> <Obj> <type>0</type> <id>67</id> <name/> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>65</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>65</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>222</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_58"> <Value> <Obj> <type>0</type> <id>69</id> <name/> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>66</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>223</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_59"> <Value> <Obj> <type>0</type> <id>71</id> <name/> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>224</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_60"> <Value> <Obj> <type>0</type> <id>73</id> <name>tmp</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>46</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>46</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_fu_216_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>128</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_61"> <Value> <Obj> <type>0</type> <id>74</id> <name>DI_cache_addr</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>46</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>46</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>129</item> <item>131</item> <item>132</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_62"> <Value> <Obj> <type>0</type> <id>75</id> <name/> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>46</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>46</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>133</item> <item>134</item> </oprand_edges> <opcode>store</opcode> </item> <item class_id_reference="9" object_id="_63"> <Value> <Obj> <type>0</type> <id>76</id> <name/> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>47</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>47</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>135</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_64"> <Value> <Obj> <type>0</type> <id>78</id> <name>tmp_10</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>68</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>68</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_10_fu_290_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>225</item> <item>226</item> </oprand_edges> <opcode>icmp</opcode> </item> <item class_id_reference="9" object_id="_65"> <Value> <Obj> <type>0</type> <id>79</id> <name/> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>68</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>68</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>227</item> <item>228</item> <item>229</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_66"> <Value> <Obj> <type>0</type> <id>81</id> <name>tmp_11</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>68</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>68</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_11_fu_295_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>230</item> <item>232</item> </oprand_edges> <opcode>xor</opcode> </item> <item class_id_reference="9" object_id="_67"> <Value> <Obj> <type>0</type> <id>82</id> <name/> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>68</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>68</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>233</item> <item>234</item> <item>271</item> </oprand_edges> <opcode>store</opcode> </item> <item class_id_reference="9" object_id="_68"> <Value> <Obj> <type>0</type> <id>83</id> <name/> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>68</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>68</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>235</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_69"> <Value> <Obj> <type>0</type> <id>85</id> <name/> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>69</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>69</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>236</item> <item>237</item> <item>238</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_70"> <Value> <Obj> <type>0</type> <id>87</id> <name>tmp_12</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>69</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>69</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_12_fu_306_p2</rtlName> <coreName/> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>239</item> <item>241</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_71"> <Value> <Obj> <type>0</type> <id>88</id> <name/> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>69</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>69</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>242</item> <item>243</item> <item>273</item> </oprand_edges> <opcode>store</opcode> </item> <item class_id_reference="9" object_id="_72"> <Value> <Obj> <type>0</type> <id>89</id> <name/> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>69</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>69</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>244</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_73"> <Value> <Obj> <type>0</type> <id>91</id> <name>tmp_13</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>70</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>70</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_13_fu_317_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>245</item> <item>247</item> </oprand_edges> <opcode>icmp</opcode> </item> <item class_id_reference="9" object_id="_74"> <Value> <Obj> <type>0</type> <id>92</id> <name>inc_1</name> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>70</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>70</second> </item> </second> </item> </inlineStackInfo> <originalName>inc</originalName> <rtlName>inc_1_fu_322_p3</rtlName> <coreName/> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>248</item> <item>250</item> <item>251</item> </oprand_edges> <opcode>select</opcode> </item> <item class_id_reference="9" object_id="_75"> <Value> <Obj> <type>0</type> <id>93</id> <name/> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>70</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>70</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>252</item> <item>253</item> <item>274</item> </oprand_edges> <opcode>store</opcode> </item> <item class_id_reference="9" object_id="_76"> <Value> <Obj> <type>0</type> <id>94</id> <name/> <fileName>mixer.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>71</lineNumber> <contextFuncName>mixer</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/RTL_Verification/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>mixer.c</first> <second>mixer</second> </first> <second>71</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>17</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_77"> <Value> <Obj> <type>2</type> <id>104</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>3</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_78"> <Value> <Obj> <type>2</type> <id>109</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_79"> <Value> <Obj> <type>2</type> <id>111</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>2</content> </item> <item class_id_reference="16" object_id="_80"> <Value> <Obj> <type>2</type> <id>114</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>2</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_81"> <Value> <Obj> <type>2</type> <id>118</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>16</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_82"> <Value> <Obj> <type>2</type> <id>130</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="_83"> <Value> <Obj> <type>2</type> <id>147</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>11</content> </item> <item class_id_reference="16" object_id="_84"> <Value> <Obj> <type>2</type> <id>149</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>15</content> </item> <item class_id_reference="16" object_id="_85"> <Value> <Obj> <type>2</type> <id>156</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>5</bitwidth> </Value> <const_type>0</const_type> <content>8</content> </item> <item class_id_reference="16" object_id="_86"> <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>32</bitwidth> </Value> <const_type>0</const_type> <content>14</content> </item> <item class_id_reference="16" object_id="_87"> <Value> <Obj> <type>2</type> <id>192</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>31</content> </item> <item class_id_reference="16" object_id="_88"> <Value> <Obj> <type>2</type> <id>214</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>4</bitwidth> </Value> <const_type>0</const_type> <content>15</content> </item> <item class_id_reference="16" object_id="_89"> <Value> <Obj> <type>2</type> <id>219</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_90"> <Value> <Obj> <type>2</type> <id>231</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_91"> <Value> <Obj> <type>2</type> <id>240</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>4</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_92"> <Value> <Obj> <type>2</type> <id>246</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>3</bitwidth> </Value> <const_type>0</const_type> <content>5</content> </item> <item class_id_reference="16" object_id="_93"> <Value> <Obj> <type>2</type> <id>249</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>3</bitwidth> </Value> <const_type>0</const_type> <content>0</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="_94"> <Obj> <type>3</type> <id>24</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>12</count> <item_version>0</item_version> <item>12</item> <item>13</item> <item>14</item> <item>15</item> <item>16</item> <item>17</item> <item>18</item> <item>19</item> <item>20</item> <item>21</item> <item>22</item> <item>23</item> </node_objs> </item> <item class_id_reference="18" object_id="_95"> <Obj> <type>3</type> <id>26</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>25</item> </node_objs> </item> <item class_id_reference="18" object_id="_96"> <Obj> <type>3</type> <id>65</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>38</count> <item_version>0</item_version> <item>27</item> <item>28</item> <item>29</item> <item>30</item> <item>31</item> <item>32</item> <item>33</item> <item>34</item> <item>35</item> <item>36</item> <item>37</item> <item>38</item> <item>39</item> <item>40</item> <item>41</item> <item>42</item> <item>43</item> <item>44</item> <item>45</item> <item>46</item> <item>47</item> <item>48</item> <item>49</item> <item>50</item> <item>51</item> <item>52</item> <item>53</item> <item>54</item> <item>55</item> <item>56</item> <item>57</item> <item>58</item> <item>59</item> <item>60</item> <item>61</item> <item>62</item> <item>63</item> <item>64</item> </node_objs> </item> <item class_id_reference="18" object_id="_97"> <Obj> <type>3</type> <id>68</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>2</count> <item_version>0</item_version> <item>66</item> <item>67</item> </node_objs> </item> <item class_id_reference="18" object_id="_98"> <Obj> <type>3</type> <id>70</id> <name>._crit_edge2</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>69</item> </node_objs> </item> <item class_id_reference="18" object_id="_99"> <Obj> <type>3</type> <id>72</id> <name>._crit_edge</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>71</item> </node_objs> </item> <item class_id_reference="18" object_id="_100"> <Obj> <type>3</type> <id>77</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>4</count> <item_version>0</item_version> <item>73</item> <item>74</item> <item>75</item> <item>76</item> </node_objs> </item> <item class_id_reference="18" object_id="_101"> <Obj> <type>3</type> <id>80</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>2</count> <item_version>0</item_version> <item>78</item> <item>79</item> </node_objs> </item> <item class_id_reference="18" object_id="_102"> <Obj> <type>3</type> <id>84</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>81</item> <item>82</item> <item>83</item> </node_objs> </item> <item class_id_reference="18" object_id="_103"> <Obj> <type>3</type> <id>86</id> <name>._crit_edge3</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>85</item> </node_objs> </item> <item class_id_reference="18" object_id="_104"> <Obj> <type>3</type> <id>90</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>87</item> <item>88</item> <item>89</item> </node_objs> </item> <item class_id_reference="18" object_id="_105"> <Obj> <type>3</type> <id>95</id> <name>._crit_edge4</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>91</item> <item>92</item> <item>93</item> <item>94</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>148</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_106"> <id>98</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>12</sink_obj> </item> <item class_id_reference="20" object_id="_107"> <id>101</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>13</sink_obj> </item> <item class_id_reference="20" object_id="_108"> <id>102</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>14</sink_obj> </item> <item class_id_reference="20" object_id="_109"> <id>103</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>15</sink_obj> </item> <item class_id_reference="20" object_id="_110"> <id>105</id> <edge_type>1</edge_type> <source_obj>104</source_obj> <sink_obj>15</sink_obj> </item> <item class_id_reference="20" object_id="_111"> <id>108</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>16</sink_obj> </item> <item class_id_reference="20" object_id="_112"> <id>110</id> <edge_type>1</edge_type> <source_obj>109</source_obj> <sink_obj>16</sink_obj> </item> <item class_id_reference="20" object_id="_113"> <id>112</id> <edge_type>1</edge_type> <source_obj>111</source_obj> <sink_obj>16</sink_obj> </item> <item class_id_reference="20" object_id="_114"> <id>113</id> <edge_type>1</edge_type> <source_obj>16</source_obj> <sink_obj>17</sink_obj> </item> <item class_id_reference="20" object_id="_115"> <id>115</id> <edge_type>1</edge_type> <source_obj>114</source_obj> <sink_obj>17</sink_obj> </item> <item class_id_reference="20" object_id="_116"> <id>116</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>18</sink_obj> </item> <item class_id_reference="20" object_id="_117"> <id>117</id> <edge_type>1</edge_type> <source_obj>18</source_obj> <sink_obj>19</sink_obj> </item> <item class_id_reference="20" object_id="_118"> <id>119</id> <edge_type>1</edge_type> <source_obj>118</source_obj> <sink_obj>19</sink_obj> </item> <item class_id_reference="20" object_id="_119"> <id>120</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>19</sink_obj> </item> <item class_id_reference="20" object_id="_120"> <id>121</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>20</sink_obj> </item> <item class_id_reference="20" object_id="_121"> <id>122</id> <edge_type>1</edge_type> <source_obj>20</source_obj> <sink_obj>21</sink_obj> </item> <item class_id_reference="20" object_id="_122"> <id>123</id> <edge_type>1</edge_type> <source_obj>17</source_obj> <sink_obj>21</sink_obj> </item> <item class_id_reference="20" object_id="_123"> <id>124</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>22</sink_obj> </item> <item class_id_reference="20" object_id="_124"> <id>125</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>23</sink_obj> </item> <item class_id_reference="20" object_id="_125"> <id>126</id> <edge_type>2</edge_type> <source_obj>26</source_obj> <sink_obj>23</sink_obj> </item> <item class_id_reference="20" object_id="_126"> <id>127</id> <edge_type>2</edge_type> <source_obj>77</source_obj> <sink_obj>23</sink_obj> </item> <item class_id_reference="20" object_id="_127"> <id>128</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>73</sink_obj> </item> <item class_id_reference="20" object_id="_128"> <id>129</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>74</sink_obj> </item> <item class_id_reference="20" object_id="_129"> <id>131</id> <edge_type>1</edge_type> <source_obj>130</source_obj> <sink_obj>74</sink_obj> </item> <item class_id_reference="20" object_id="_130"> <id>132</id> <edge_type>1</edge_type> <source_obj>73</source_obj> <sink_obj>74</sink_obj> </item> <item class_id_reference="20" object_id="_131"> <id>133</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>75</sink_obj> </item> <item class_id_reference="20" object_id="_132"> <id>134</id> <edge_type>1</edge_type> <source_obj>74</source_obj> <sink_obj>75</sink_obj> </item> <item class_id_reference="20" object_id="_133"> <id>135</id> <edge_type>2</edge_type> <source_obj>80</source_obj> <sink_obj>76</sink_obj> </item> <item class_id_reference="20" object_id="_134"> <id>136</id> <edge_type>1</edge_type> <source_obj>17</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_135"> <id>137</id> <edge_type>2</edge_type> <source_obj>72</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_136"> <id>138</id> <edge_type>2</edge_type> <source_obj>65</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_137"> <id>139</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>27</sink_obj> </item> <item class_id_reference="20" object_id="_138"> <id>140</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>28</sink_obj> </item> <item class_id_reference="20" object_id="_139"> <id>141</id> <edge_type>1</edge_type> <source_obj>19</source_obj> <sink_obj>28</sink_obj> </item> <item class_id_reference="20" object_id="_140"> <id>142</id> <edge_type>1</edge_type> <source_obj>28</source_obj> <sink_obj>29</sink_obj> </item> <item class_id_reference="20" object_id="_141"> <id>143</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>29</sink_obj> </item> <item class_id_reference="20" object_id="_142"> <id>146</id> <edge_type>1</edge_type> <source_obj>28</source_obj> <sink_obj>30</sink_obj> </item> <item class_id_reference="20" object_id="_143"> <id>148</id> <edge_type>1</edge_type> <source_obj>147</source_obj> <sink_obj>30</sink_obj> </item> <item class_id_reference="20" object_id="_144"> <id>150</id> <edge_type>1</edge_type> <source_obj>149</source_obj> <sink_obj>30</sink_obj> </item> <item class_id_reference="20" object_id="_145"> <id>151</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>31</sink_obj> </item> <item class_id_reference="20" object_id="_146"> <id>152</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>32</sink_obj> </item> <item class_id_reference="20" object_id="_147"> <id>153</id> <edge_type>1</edge_type> <source_obj>130</source_obj> <sink_obj>32</sink_obj> </item> <item class_id_reference="20" object_id="_148"> <id>154</id> <edge_type>1</edge_type> <source_obj>31</source_obj> <sink_obj>32</sink_obj> </item> <item class_id_reference="20" object_id="_149"> <id>155</id> <edge_type>1</edge_type> <source_obj>32</source_obj> <sink_obj>33</sink_obj> </item> <item class_id_reference="20" object_id="_150"> <id>157</id> <edge_type>1</edge_type> <source_obj>156</source_obj> <sink_obj>34</sink_obj> </item> <item class_id_reference="20" object_id="_151"> <id>158</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>34</sink_obj> </item> <item class_id_reference="20" object_id="_152"> <id>159</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>35</sink_obj> </item> <item class_id_reference="20" object_id="_153"> <id>160</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>36</sink_obj> </item> <item class_id_reference="20" object_id="_154"> <id>161</id> <edge_type>1</edge_type> <source_obj>130</source_obj> <sink_obj>36</sink_obj> </item> <item class_id_reference="20" object_id="_155"> <id>162</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>36</sink_obj> </item> <item class_id_reference="20" object_id="_156"> <id>163</id> <edge_type>1</edge_type> <source_obj>36</source_obj> <sink_obj>37</sink_obj> </item> <item class_id_reference="20" object_id="_157"> <id>164</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>38</sink_obj> </item> <item class_id_reference="20" object_id="_158"> <id>165</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>39</sink_obj> </item> <item class_id_reference="20" object_id="_159"> <id>166</id> <edge_type>1</edge_type> <source_obj>130</source_obj> <sink_obj>39</sink_obj> </item> <item class_id_reference="20" object_id="_160"> <id>167</id> <edge_type>1</edge_type> <source_obj>38</source_obj> <sink_obj>39</sink_obj> </item> <item class_id_reference="20" object_id="_161"> <id>168</id> <edge_type>1</edge_type> <source_obj>39</source_obj> <sink_obj>40</sink_obj> </item> <item class_id_reference="20" object_id="_162"> <id>169</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>41</sink_obj> </item> <item class_id_reference="20" object_id="_163"> <id>170</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>42</sink_obj> </item> <item class_id_reference="20" object_id="_164"> <id>171</id> <edge_type>1</edge_type> <source_obj>41</source_obj> <sink_obj>43</sink_obj> </item> <item class_id_reference="20" object_id="_165"> <id>172</id> <edge_type>1</edge_type> <source_obj>42</source_obj> <sink_obj>43</sink_obj> </item> <item class_id_reference="20" object_id="_166"> <id>173</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>44</sink_obj> </item> <item class_id_reference="20" object_id="_167"> <id>174</id> <edge_type>1</edge_type> <source_obj>43</source_obj> <sink_obj>45</sink_obj> </item> <item class_id_reference="20" object_id="_168"> <id>175</id> <edge_type>1</edge_type> <source_obj>45</source_obj> <sink_obj>46</sink_obj> </item> <item class_id_reference="20" object_id="_169"> <id>176</id> <edge_type>1</edge_type> <source_obj>44</source_obj> <sink_obj>46</sink_obj> </item> <item class_id_reference="20" object_id="_170"> <id>177</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>47</sink_obj> </item> <item class_id_reference="20" object_id="_171"> <id>178</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>48</sink_obj> </item> <item class_id_reference="20" object_id="_172"> <id>179</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>49</sink_obj> </item> <item class_id_reference="20" object_id="_173"> <id>180</id> <edge_type>1</edge_type> <source_obj>48</source_obj> <sink_obj>49</sink_obj> </item> <item class_id_reference="20" object_id="_174"> <id>181</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>50</sink_obj> </item> <item class_id_reference="20" object_id="_175"> <id>182</id> <edge_type>1</edge_type> <source_obj>49</source_obj> <sink_obj>51</sink_obj> </item> <item class_id_reference="20" object_id="_176"> <id>183</id> <edge_type>1</edge_type> <source_obj>51</source_obj> <sink_obj>52</sink_obj> </item> <item class_id_reference="20" object_id="_177"> <id>184</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>52</sink_obj> </item> <item class_id_reference="20" object_id="_178"> <id>185</id> <edge_type>1</edge_type> <source_obj>52</source_obj> <sink_obj>53</sink_obj> </item> <item class_id_reference="20" object_id="_179"> <id>186</id> <edge_type>1</edge_type> <source_obj>46</source_obj> <sink_obj>53</sink_obj> </item> <item class_id_reference="20" object_id="_180"> <id>189</id> <edge_type>1</edge_type> <source_obj>53</source_obj> <sink_obj>54</sink_obj> </item> <item class_id_reference="20" object_id="_181"> <id>191</id> <edge_type>1</edge_type> <source_obj>190</source_obj> <sink_obj>54</sink_obj> </item> <item class_id_reference="20" object_id="_182"> <id>193</id> <edge_type>1</edge_type> <source_obj>192</source_obj> <sink_obj>54</sink_obj> </item> <item class_id_reference="20" object_id="_183"> <id>196</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>55</sink_obj> </item> <item class_id_reference="20" object_id="_184"> <id>197</id> <edge_type>1</edge_type> <source_obj>54</source_obj> <sink_obj>55</sink_obj> </item> <item class_id_reference="20" object_id="_185"> <id>198</id> <edge_type>1</edge_type> <source_obj>48</source_obj> <sink_obj>56</sink_obj> </item> <item class_id_reference="20" object_id="_186"> <id>199</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>56</sink_obj> </item> <item class_id_reference="20" object_id="_187"> <id>200</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>57</sink_obj> </item> <item class_id_reference="20" object_id="_188"> <id>201</id> <edge_type>1</edge_type> <source_obj>56</source_obj> <sink_obj>58</sink_obj> </item> <item class_id_reference="20" object_id="_189"> <id>202</id> <edge_type>1</edge_type> <source_obj>58</source_obj> <sink_obj>59</sink_obj> </item> <item class_id_reference="20" object_id="_190"> <id>203</id> <edge_type>1</edge_type> <source_obj>57</source_obj> <sink_obj>59</sink_obj> </item> <item class_id_reference="20" object_id="_191"> <id>204</id> <edge_type>1</edge_type> <source_obj>59</source_obj> <sink_obj>60</sink_obj> </item> <item class_id_reference="20" object_id="_192"> <id>205</id> <edge_type>1</edge_type> <source_obj>46</source_obj> <sink_obj>60</sink_obj> </item> <item class_id_reference="20" object_id="_193"> <id>207</id> <edge_type>1</edge_type> <source_obj>60</source_obj> <sink_obj>61</sink_obj> </item> <item class_id_reference="20" object_id="_194"> <id>208</id> <edge_type>1</edge_type> <source_obj>190</source_obj> <sink_obj>61</sink_obj> </item> <item class_id_reference="20" object_id="_195"> <id>209</id> <edge_type>1</edge_type> <source_obj>192</source_obj> <sink_obj>61</sink_obj> </item> <item class_id_reference="20" object_id="_196"> <id>211</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>62</sink_obj> </item> <item class_id_reference="20" object_id="_197"> <id>212</id> <edge_type>1</edge_type> <source_obj>61</source_obj> <sink_obj>62</sink_obj> </item> <item class_id_reference="20" object_id="_198"> <id>213</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>63</sink_obj> </item> <item class_id_reference="20" object_id="_199"> <id>215</id> <edge_type>1</edge_type> <source_obj>214</source_obj> <sink_obj>63</sink_obj> </item> <item class_id_reference="20" object_id="_200"> <id>216</id> <edge_type>1</edge_type> <source_obj>63</source_obj> <sink_obj>64</sink_obj> </item> <item class_id_reference="20" object_id="_201"> <id>217</id> <edge_type>2</edge_type> <source_obj>70</source_obj> <sink_obj>64</sink_obj> </item> <item class_id_reference="20" object_id="_202"> <id>218</id> <edge_type>2</edge_type> <source_obj>68</source_obj> <sink_obj>64</sink_obj> </item> <item class_id_reference="20" object_id="_203"> <id>220</id> <edge_type>1</edge_type> <source_obj>219</source_obj> <sink_obj>66</sink_obj> </item> <item class_id_reference="20" object_id="_204"> <id>221</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>66</sink_obj> </item> <item class_id_reference="20" object_id="_205"> <id>222</id> <edge_type>2</edge_type> <source_obj>70</source_obj> <sink_obj>67</sink_obj> </item> <item class_id_reference="20" object_id="_206"> <id>223</id> <edge_type>2</edge_type> <source_obj>72</source_obj> <sink_obj>69</sink_obj> </item> <item class_id_reference="20" object_id="_207"> <id>224</id> <edge_type>2</edge_type> <source_obj>80</source_obj> <sink_obj>71</sink_obj> </item> <item class_id_reference="20" object_id="_208"> <id>225</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>78</sink_obj> </item> <item class_id_reference="20" object_id="_209"> <id>226</id> <edge_type>1</edge_type> <source_obj>214</source_obj> <sink_obj>78</sink_obj> </item> <item class_id_reference="20" object_id="_210"> <id>227</id> <edge_type>1</edge_type> <source_obj>78</source_obj> <sink_obj>79</sink_obj> </item> <item class_id_reference="20" object_id="_211"> <id>228</id> <edge_type>2</edge_type> <source_obj>86</source_obj> <sink_obj>79</sink_obj> </item> <item class_id_reference="20" object_id="_212"> <id>229</id> <edge_type>2</edge_type> <source_obj>84</source_obj> <sink_obj>79</sink_obj> </item> <item class_id_reference="20" object_id="_213"> <id>230</id> <edge_type>1</edge_type> <source_obj>20</source_obj> <sink_obj>81</sink_obj> </item> <item class_id_reference="20" object_id="_214"> <id>232</id> <edge_type>1</edge_type> <source_obj>231</source_obj> <sink_obj>81</sink_obj> </item> <item class_id_reference="20" object_id="_215"> <id>233</id> <edge_type>1</edge_type> <source_obj>81</source_obj> <sink_obj>82</sink_obj> </item> <item class_id_reference="20" object_id="_216"> <id>234</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>82</sink_obj> </item> <item class_id_reference="20" object_id="_217"> <id>235</id> <edge_type>2</edge_type> <source_obj>86</source_obj> <sink_obj>83</sink_obj> </item> <item class_id_reference="20" object_id="_218"> <id>236</id> <edge_type>1</edge_type> <source_obj>17</source_obj> <sink_obj>85</sink_obj> </item> <item class_id_reference="20" object_id="_219"> <id>237</id> <edge_type>2</edge_type> <source_obj>95</source_obj> <sink_obj>85</sink_obj> </item> <item class_id_reference="20" object_id="_220"> <id>238</id> <edge_type>2</edge_type> <source_obj>90</source_obj> <sink_obj>85</sink_obj> </item> <item class_id_reference="20" object_id="_221"> <id>239</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>87</sink_obj> </item> <item class_id_reference="20" object_id="_222"> <id>241</id> <edge_type>1</edge_type> <source_obj>240</source_obj> <sink_obj>87</sink_obj> </item> <item class_id_reference="20" object_id="_223"> <id>242</id> <edge_type>1</edge_type> <source_obj>87</source_obj> <sink_obj>88</sink_obj> </item> <item class_id_reference="20" object_id="_224"> <id>243</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>88</sink_obj> </item> <item class_id_reference="20" object_id="_225"> <id>244</id> <edge_type>2</edge_type> <source_obj>95</source_obj> <sink_obj>89</sink_obj> </item> <item class_id_reference="20" object_id="_226"> <id>245</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>91</sink_obj> </item> <item class_id_reference="20" object_id="_227"> <id>247</id> <edge_type>1</edge_type> <source_obj>246</source_obj> <sink_obj>91</sink_obj> </item> <item class_id_reference="20" object_id="_228"> <id>248</id> <edge_type>1</edge_type> <source_obj>91</source_obj> <sink_obj>92</sink_obj> </item> <item class_id_reference="20" object_id="_229"> <id>250</id> <edge_type>1</edge_type> <source_obj>249</source_obj> <sink_obj>92</sink_obj> </item> <item class_id_reference="20" object_id="_230"> <id>251</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>92</sink_obj> </item> <item class_id_reference="20" object_id="_231"> <id>252</id> <edge_type>1</edge_type> <source_obj>92</source_obj> <sink_obj>93</sink_obj> </item> <item class_id_reference="20" object_id="_232"> <id>253</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>93</sink_obj> </item> <item class_id_reference="20" object_id="_233"> <id>254</id> <edge_type>2</edge_type> <source_obj>24</source_obj> <sink_obj>77</sink_obj> </item> <item class_id_reference="20" object_id="_234"> <id>255</id> <edge_type>2</edge_type> <source_obj>24</source_obj> <sink_obj>26</sink_obj> </item> <item class_id_reference="20" object_id="_235"> <id>256</id> <edge_type>2</edge_type> <source_obj>26</source_obj> <sink_obj>65</sink_obj> </item> <item class_id_reference="20" object_id="_236"> <id>257</id> <edge_type>2</edge_type> <source_obj>26</source_obj> <sink_obj>72</sink_obj> </item> <item class_id_reference="20" object_id="_237"> <id>258</id> <edge_type>2</edge_type> <source_obj>65</source_obj> <sink_obj>68</sink_obj> </item> <item class_id_reference="20" object_id="_238"> <id>259</id> <edge_type>2</edge_type> <source_obj>65</source_obj> <sink_obj>70</sink_obj> </item> <item class_id_reference="20" object_id="_239"> <id>260</id> <edge_type>2</edge_type> <source_obj>68</source_obj> <sink_obj>70</sink_obj> </item> <item class_id_reference="20" object_id="_240"> <id>261</id> <edge_type>2</edge_type> <source_obj>70</source_obj> <sink_obj>72</sink_obj> </item> <item class_id_reference="20" object_id="_241"> <id>262</id> <edge_type>2</edge_type> <source_obj>72</source_obj> <sink_obj>80</sink_obj> </item> <item class_id_reference="20" object_id="_242"> <id>263</id> <edge_type>2</edge_type> <source_obj>77</source_obj> <sink_obj>80</sink_obj> </item> <item class_id_reference="20" object_id="_243"> <id>264</id> <edge_type>2</edge_type> <source_obj>80</source_obj> <sink_obj>84</sink_obj> </item> <item class_id_reference="20" object_id="_244"> <id>265</id> <edge_type>2</edge_type> <source_obj>80</source_obj> <sink_obj>86</sink_obj> </item> <item class_id_reference="20" object_id="_245"> <id>266</id> <edge_type>2</edge_type> <source_obj>84</source_obj> <sink_obj>86</sink_obj> </item> <item class_id_reference="20" object_id="_246"> <id>267</id> <edge_type>2</edge_type> <source_obj>86</source_obj> <sink_obj>90</sink_obj> </item> <item class_id_reference="20" object_id="_247"> <id>268</id> <edge_type>2</edge_type> <source_obj>86</source_obj> <sink_obj>95</sink_obj> </item> <item class_id_reference="20" object_id="_248"> <id>269</id> <edge_type>2</edge_type> <source_obj>90</source_obj> <sink_obj>95</sink_obj> </item> <item class_id_reference="20" object_id="_249"> <id>270</id> <edge_type>4</edge_type> <source_obj>27</source_obj> <sink_obj>29</sink_obj> </item> <item class_id_reference="20" object_id="_250"> <id>271</id> <edge_type>4</edge_type> <source_obj>20</source_obj> <sink_obj>82</sink_obj> </item> <item class_id_reference="20" object_id="_251"> <id>272</id> <edge_type>4</edge_type> <source_obj>18</source_obj> <sink_obj>66</sink_obj> </item> <item class_id_reference="20" object_id="_252"> <id>273</id> <edge_type>4</edge_type> <source_obj>22</source_obj> <sink_obj>88</sink_obj> </item> <item class_id_reference="20" object_id="_253"> <id>274</id> <edge_type>4</edge_type> <source_obj>14</source_obj> <sink_obj>93</sink_obj> </item> </edges> </cdfg> <cdfg_regions class_id="21" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="22" tracking_level="1" version="0" object_id="_254"> <mId>1</mId> <mTag>duc_mixer</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>12</count> <item_version>0</item_version> <item>24</item> <item>26</item> <item>65</item> <item>68</item> <item>70</item> <item>72</item> <item>77</item> <item>80</item> <item>84</item> <item>86</item> <item>90</item> <item>95</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>9</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> </cdfg_regions> <fsm class_id="24" tracking_level="1" version="0" object_id="_255"> <states class_id="25" tracking_level="0" version="0"> <count>10</count> <item_version>0</item_version> <item class_id="26" tracking_level="1" version="0" object_id="_256"> <id>1</id> <operations class_id="27" tracking_level="0" version="0"> <count>21</count> <item_version>0</item_version> <item class_id="28" tracking_level="1" version="0" object_id="_257"> <id>12</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_258"> <id>13</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_259"> <id>14</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_260"> <id>15</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_261"> <id>16</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_262"> <id>17</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_263"> <id>18</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_264"> <id>19</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_265"> <id>20</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_266"> <id>21</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_267"> <id>22</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_268"> <id>23</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_269"> <id>25</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_270"> <id>27</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_271"> <id>28</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_272"> <id>29</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_273"> <id>30</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_274"> <id>73</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_275"> <id>74</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_276"> <id>75</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_277"> <id>76</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_278"> <id>2</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_279"> <id>34</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_280"> <id>3</id> <operations> <count>6</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_281"> <id>31</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_282"> <id>32</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_283"> <id>33</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_284"> <id>35</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_285"> <id>36</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_286"> <id>37</id> <stage>2</stage> <latency>2</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_287"> <id>4</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_288"> <id>33</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_289"> <id>37</id> <stage>1</stage> <latency>2</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_290"> <id>5</id> <operations> <count>9</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_291"> <id>38</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_292"> <id>39</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_293"> <id>40</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_294"> <id>41</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_295"> <id>42</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_296"> <id>43</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_297"> <id>44</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_298"> <id>45</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_299"> <id>46</id> <stage>4</stage> <latency>4</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_300"> <id>6</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_301"> <id>40</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_302"> <id>46</id> <stage>3</stage> <latency>4</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_303"> <id>7</id> <operations> <count>11</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_304"> <id>46</id> <stage>2</stage> <latency>4</latency> </item> <item class_id_reference="28" object_id="_305"> <id>47</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_306"> <id>48</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_307"> <id>49</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_308"> <id>50</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_309"> <id>51</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_310"> <id>52</id> <stage>3</stage> <latency>3</latency> </item> <item class_id_reference="28" object_id="_311"> <id>56</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_312"> <id>57</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_313"> <id>58</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_314"> <id>59</id> <stage>3</stage> <latency>3</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_315"> <id>8</id> <operations> <count>3</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_316"> <id>46</id> <stage>1</stage> <latency>4</latency> </item> <item class_id_reference="28" object_id="_317"> <id>52</id> <stage>2</stage> <latency>3</latency> </item> <item class_id_reference="28" object_id="_318"> <id>59</id> <stage>2</stage> <latency>3</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_319"> <id>9</id> <operations> <count>4</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_320"> <id>52</id> <stage>1</stage> <latency>3</latency> </item> <item class_id_reference="28" object_id="_321"> <id>53</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_322"> <id>59</id> <stage>1</stage> <latency>3</latency> </item> <item class_id_reference="28" object_id="_323"> <id>60</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_324"> <id>10</id> <operations> <count>23</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_325"> <id>54</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_326"> <id>55</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_327"> <id>61</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_328"> <id>62</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_329"> <id>63</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_330"> <id>64</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_331"> <id>66</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_332"> <id>67</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_333"> <id>69</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_334"> <id>71</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_335"> <id>78</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_336"> <id>79</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_337"> <id>81</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_338"> <id>82</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_339"> <id>83</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_340"> <id>85</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_341"> <id>87</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_342"> <id>88</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_343"> <id>89</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_344"> <id>91</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_345"> <id>92</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_346"> <id>93</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_347"> <id>94</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> </states> <transitions class_id="29" tracking_level="0" version="0"> <count>10</count> <item_version>0</item_version> <item class_id="30" tracking_level="1" version="0" object_id="_348"> <inState>1</inState> <outState>2</outState> <condition class_id="31" tracking_level="0" version="0"> <id>37</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>2</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>21</first> <second>0</second> </first> <second>1</second> </item> <item> <first> <first>17</first> <second>0</second> </first> <second>0</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_349"> <inState>1</inState> <outState>10</outState> <condition> <id>38</id> <sop> <count>2</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>21</first> <second>0</second> </first> <second>0</second> </item> </item> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>17</first> <second>0</second> </first> <second>1</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_350"> <inState>2</inState> <outState>3</outState> <condition> <id>40</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="_351"> <inState>3</inState> <outState>4</outState> <condition> <id>41</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="_352"> <inState>4</inState> <outState>5</outState> <condition> <id>42</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="_353"> <inState>5</inState> <outState>6</outState> <condition> <id>43</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="_354"> <inState>6</inState> <outState>7</outState> <condition> <id>44</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="_355"> <inState>7</inState> <outState>8</outState> <condition> <id>45</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="_356"> <inState>8</inState> <outState>9</outState> <condition> <id>46</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="_357"> <inState>9</inState> <outState>10</outState> <condition> <id>47</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> </transitions> </fsm> <res class_id="36" tracking_level="1" version="0" object_id="_358"> <dp_component_resource class_id="37" tracking_level="0" version="0"> <count>3</count> <item_version>0</item_version> <item class_id="38" tracking_level="0" version="0"> <first>duc_am_submul_16s_16s_18s_32_4_U11 (duc_am_submul_16s_16s_18s_32_4)</first> <second class_id="39" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="40" tracking_level="0" version="0"> <first>DSP48E</first> <second>1</second> </item> </second> </item> <item> <first>duc_ama_addmuladd_18s_18s_16s_32s_32_3_U9 (duc_ama_addmuladd_18s_18s_16s_32s_32_3)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>DSP48E</first> <second>1</second> </item> </second> </item> <item> <first>duc_ama_submuladd_18s_18s_16s_32s_32_3_U10 (duc_ama_submuladd_18s_18s_16s_32s_32_3)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>DSP48E</first> <second>1</second> </item> </second> </item> </dp_component_resource> <dp_expression_resource> <count>12</count> <item_version>0</item_version> <item> <first>acc_assign_i_fu_194_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>16</second> </item> <item> <first>(1P1)</first> <second>16</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>16</second> </item> </second> </item> <item> <first>brmerge_demorgan_fu_180_p2 ( and ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <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>freq_dds_fu_168_p3 ( Select ) </first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>1</second> </item> <item> <first>(1P1)</first> <second>1</second> </item> <item> <first>(2P2)</first> <second>16</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>16</second> </item> </second> </item> <item> <first>inc_1_fu_322_p3 ( Select ) </first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>1</second> </item> <item> <first>(1P1)</first> <second>1</second> </item> <item> <first>(2P2)</first> <second>3</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>3</second> </item> </second> </item> <item> <first>inc_fu_142_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>3</second> </item> <item> <first>(1P1)</first> <second>1</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>3</second> </item> </second> </item> <item> <first>phase2_fu_221_p2 ( - ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>4</second> </item> <item> <first>(1P1)</first> <second>5</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>5</second> </item> </second> </item> <item> <first>tmp_10_fu_290_p2 ( icmp ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>4</second> </item> <item> <first>(1P1)</first> <second>2</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>2</second> </item> </second> </item> <item> <first>tmp_11_fu_295_p2 ( xor ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>1</second> </item> <item> <first>(1P1)</first> <second>2</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>2</second> </item> </second> </item> <item> <first>tmp_12_fu_306_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>4</second> </item> <item> <first>(1P1)</first> <second>1</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>4</second> </item> </second> </item> <item> <first>tmp_13_fu_317_p2 ( icmp ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>3</second> </item> <item> <first>(1P1)</first> <second>3</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>2</second> </item> </second> </item> <item> <first>tmp_9_fu_279_p2 ( icmp ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>4</second> </item> <item> <first>(1P1)</first> <second>2</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>2</second> </item> </second> </item> <item> <first>valid_in_fu_158_p2 ( icmp ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>2</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> </dp_expression_resource> <dp_fifo_resource> <count>0</count> <item_version>0</item_version> </dp_fifo_resource> <dp_memory_resource> <count>2</count> <item_version>0</item_version> <item> <first>DI_cache_U</first> <second> <count>7</count> <item_version>0</item_version> <item> <first>(0Words)</first> <second>16</second> </item> <item> <first>(1Bits)</first> <second>18</second> </item> <item> <first>(2Banks)</first> <second>1</second> </item> <item> <first>(3W*Bits*Banks)</first> <second>288</second> </item> <item> <first>BRAM</first> <second>0</second> </item> <item> <first>FF</first> <second>36</second> </item> <item> <first>LUT</first> <second>5</second> </item> </second> </item> <item> <first>dds_table_U</first> <second> <count>7</count> <item_version>0</item_version> <item> <first>(0Words)</first> <second>32</second> </item> <item> <first>(1Bits)</first> <second>16</second> </item> <item> <first>(2Banks)</first> <second>1</second> </item> <item> <first>(3W*Bits*Banks)</first> <second>512</second> </item> <item> <first>BRAM</first> <second>0</second> </item> <item> <first>FF</first> <second>32</second> </item> <item> <first>LUT</first> <second>8</second> </item> </second> </item> </dp_memory_resource> <dp_multiplexer_resource> <count>2</count> <item_version>0</item_version> <item> <first>DI_cache_address0</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>4</second> </item> <item> <first>(2Count)</first> <second>12</second> </item> <item> <first>LUT</first> <second>4</second> </item> </second> </item> <item> <first>ap_NS_fsm</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>11</second> </item> <item> <first>(1Bits)</first> <second>1</second> </item> <item> <first>(2Count)</first> <second>11</second> </item> <item> <first>LUT</first> <second>4</second> </item> </second> </item> </dp_multiplexer_resource> <dp_register_resource> <count>20</count> <item_version>0</item_version> <item> <first>Din_re_reg_441</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>18</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>18</second> </item> </second> </item> <item> <first>acc</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>16</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>16</second> </item> </second> </item> <item> <first>ap_CS_fsm</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>10</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>10</second> </item> </second> </item> <item> <first>brmerge_demorgan_reg_386</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>ch_1</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>ch_1_load_reg_381</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>cosine_reg_425</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>16</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>16</second> </item> </second> </item> <item> <first>i_1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>3</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>3</second> </item> </second> </item> <item> <first>i_1_load_reg_367</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>3</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>3</second> </item> </second> </item> <item> <first>inc_reg_372</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>3</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>3</second> </item> </second> </item> <item> <first>index</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>4</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>4</second> </item> </second> </item> <item> <first>index_load_reg_390</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>4</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>4</second> </item> </second> </item> <item> <first>init_1</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>phase1_reg_398</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>5</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>5</second> </item> </second> </item> <item> <first>phase2_reg_404</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>5</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>5</second> </item> </second> </item> <item> <first>sine_reg_419</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>16</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>16</second> </item> </second> </item> <item> <first>tmp_2_reg_456</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>32</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>32</second> </item> </second> </item> <item> <first>tmp_4_reg_467</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>32</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>32</second> </item> </second> </item> <item> <first>tmp_8_reg_462</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>32</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>32</second> </item> </second> </item> <item> <first>valid_in_reg_377</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> </dp_register_resource> <dp_component_map class_id="41" tracking_level="0" version="0"> <count>3</count> <item_version>0</item_version> <item class_id="42" tracking_level="0" version="0"> <first>duc_am_submul_16s_16s_18s_32_4_U11 (duc_am_submul_16s_16s_18s_32_4)</first> <second> <count>3</count> <item_version>0</item_version> <item>43</item> <item>45</item> <item>46</item> </second> </item> <item> <first>duc_ama_addmuladd_18s_18s_16s_32s_32_3_U9 (duc_ama_addmuladd_18s_18s_16s_32s_32_3)</first> <second> <count>4</count> <item_version>0</item_version> <item>56</item> <item>58</item> <item>59</item> <item>60</item> </second> </item> <item> <first>duc_ama_submuladd_18s_18s_16s_32s_32_3_U10 (duc_ama_submuladd_18s_18s_16s_32s_32_3)</first> <second> <count>4</count> <item_version>0</item_version> <item>49</item> <item>51</item> <item>52</item> <item>53</item> </second> </item> </dp_component_map> <dp_expression_map> <count>12</count> <item_version>0</item_version> <item> <first>acc_assign_i_fu_194_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>brmerge_demorgan_fu_180_p2 ( and ) </first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>freq_dds_fu_168_p3 ( Select ) </first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> <item> <first>inc_1_fu_322_p3 ( Select ) </first> <second> <count>1</count> <item_version>0</item_version> <item>92</item> </second> </item> <item> <first>inc_fu_142_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>phase2_fu_221_p2 ( - ) </first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>tmp_10_fu_290_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>78</item> </second> </item> <item> <first>tmp_11_fu_295_p2 ( xor ) </first> <second> <count>1</count> <item_version>0</item_version> <item>81</item> </second> </item> <item> <first>tmp_12_fu_306_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>87</item> </second> </item> <item> <first>tmp_13_fu_317_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>91</item> </second> </item> <item> <first>tmp_9_fu_279_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>63</item> </second> </item> <item> <first>valid_in_fu_158_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> </dp_expression_map> <dp_fifo_map> <count>0</count> <item_version>0</item_version> </dp_fifo_map> <dp_memory_map> <count>2</count> <item_version>0</item_version> <item> <first>DI_cache_U</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>dds_table_U</first> <second> <count>1</count> <item_version>0</item_version> <item>59</item> </second> </item> </dp_memory_map> </res> <node_label_latency class_id="43" tracking_level="0" version="0"> <count>72</count> <item_version>0</item_version> <item class_id="44" tracking_level="0" version="0"> <first>12</first> <second class_id="45" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>13</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>14</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>15</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>16</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>17</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>18</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>19</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>20</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>21</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>22</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>23</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>25</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>27</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>28</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>29</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>30</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>31</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>32</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>33</first> <second> <first>2</first> <second>1</second> </second> </item> <item> <first>34</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>35</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>36</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>37</first> <second> <first>2</first> <second>1</second> </second> </item> <item> <first>38</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>39</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>40</first> <second> <first>4</first> <second>1</second> </second> </item> <item> <first>41</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>42</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>43</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>44</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>45</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>46</first> <second> <first>4</first> <second>3</second> </second> </item> <item> <first>47</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>48</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>49</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>50</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>51</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>52</first> <second> <first>6</first> <second>2</second> </second> </item> <item> <first>53</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>54</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>55</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>56</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>57</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>58</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>59</first> <second> <first>6</first> <second>2</second> </second> </item> <item> <first>60</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>61</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>62</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>63</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>64</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>66</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>67</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>69</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>71</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>73</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>74</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>75</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>76</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>78</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>79</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>81</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>82</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>83</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>85</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>87</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>88</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>89</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>91</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>92</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>93</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>94</first> <second> <first>9</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="46" tracking_level="0" version="0"> <count>12</count> <item_version>0</item_version> <item class_id="47" tracking_level="0" version="0"> <first>24</first> <second class_id="48" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>26</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>65</first> <second> <first>0</first> <second>9</second> </second> </item> <item> <first>68</first> <second> <first>9</first> <second>9</second> </second> </item> <item> <first>70</first> <second> <first>9</first> <second>9</second> </second> </item> <item> <first>72</first> <second> <first>9</first> <second>9</second> </second> </item> <item> <first>77</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>80</first> <second> <first>9</first> <second>9</second> </second> </item> <item> <first>84</first> <second> <first>9</first> <second>9</second> </second> </item> <item> <first>86</first> <second> <first>9</first> <second>9</second> </second> </item> <item> <first>90</first> <second> <first>9</first> <second>9</second> </second> </item> <item> <first>95</first> <second> <first>9</first> <second>9</second> </second> </item> </bblk_ent_exit> <regions class_id="49" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </regions> <dp_fu_nodes class_id="50" tracking_level="0" version="0"> <count>50</count> <item_version>0</item_version> <item class_id="51" tracking_level="0" version="0"> <first>68</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>74</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>80</first> <second> <count>1</count> <item_version>0</item_version> <item>55</item> </second> </item> <item> <first>87</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>94</first> <second> <count>1</count> <item_version>0</item_version> <item>74</item> </second> </item> <item> <first>101</first> <second> <count>3</count> <item_version>0</item_version> <item>75</item> <item>40</item> <item>40</item> </second> </item> <item> <first>107</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>114</first> <second> <count>4</count> <item_version>0</item_version> <item>33</item> <item>33</item> <item>37</item> <item>37</item> </second> </item> <item> <first>119</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>130</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> <item> <first>138</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> <item> <first>142</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>148</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>158</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> <item> <first>164</first> <second> <count>1</count> <item_version>0</item_version> <item>18</item> </second> </item> <item> <first>168</first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> <item> <first>176</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>180</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>186</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>190</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> <item> <first>194</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>200</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>206</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>216</first> <second> <count>1</count> <item_version>0</item_version> <item>73</item> </second> </item> <item> <first>221</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>226</first> <second> <count>1</count> <item_version>0</item_version> <item>31</item> </second> </item> <item> <first>230</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>234</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>238</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>241</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>244</first> <second> <count>1</count> <item_version>0</item_version> <item>44</item> </second> </item> <item> <first>247</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>250</first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> <item> <first>253</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>256</first> <second> <count>1</count> <item_version>0</item_version> <item>57</item> </second> </item> <item> <first>259</first> <second> <count>1</count> <item_version>0</item_version> <item>54</item> </second> </item> <item> <first>269</first> <second> <count>1</count> <item_version>0</item_version> <item>61</item> </second> </item> <item> <first>279</first> <second> <count>1</count> <item_version>0</item_version> <item>63</item> </second> </item> <item> <first>284</first> <second> <count>1</count> <item_version>0</item_version> <item>66</item> </second> </item> <item> <first>290</first> <second> <count>1</count> <item_version>0</item_version> <item>78</item> </second> </item> <item> <first>295</first> <second> <count>1</count> <item_version>0</item_version> <item>81</item> </second> </item> <item> <first>300</first> <second> <count>1</count> <item_version>0</item_version> <item>82</item> </second> </item> <item> <first>306</first> <second> <count>1</count> <item_version>0</item_version> <item>87</item> </second> </item> <item> <first>311</first> <second> <count>1</count> <item_version>0</item_version> <item>88</item> </second> </item> <item> <first>317</first> <second> <count>1</count> <item_version>0</item_version> <item>91</item> </second> </item> <item> <first>322</first> <second> <count>1</count> <item_version>0</item_version> <item>92</item> </second> </item> <item> <first>329</first> <second> <count>1</count> <item_version>0</item_version> <item>93</item> </second> </item> <item> <first>335</first> <second> <count>6</count> <item_version>0</item_version> <item>56</item> <item>59</item> <item>59</item> <item>59</item> <item>60</item> <item>58</item> </second> </item> <item> <first>344</first> <second> <count>6</count> <item_version>0</item_version> <item>49</item> <item>52</item> <item>52</item> <item>52</item> <item>53</item> <item>51</item> </second> </item> <item> <first>353</first> <second> <count>6</count> <item_version>0</item_version> <item>43</item> <item>46</item> <item>46</item> <item>46</item> <item>46</item> <item>45</item> </second> </item> </dp_fu_nodes> <dp_fu_nodes_expression class_id="53" tracking_level="0" version="0"> <count>31</count> <item_version>0</item_version> <item class_id="54" tracking_level="0" version="0"> <first>DI_cache_addr_1_gep_fu_130</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> <item> <first>DI_cache_addr_gep_fu_94</first> <second> <count>1</count> <item_version>0</item_version> <item>74</item> </second> </item> <item> <first>acc_assign_i_fu_194</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>brmerge_demorgan_fu_180</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>dds_table_addr_1_gep_fu_119</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>dds_table_addr_gep_fu_107</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>freq_dds_fu_168</first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> <item> <first>inc_1_fu_322</first> <second> <count>1</count> <item_version>0</item_version> <item>92</item> </second> </item> <item> <first>inc_fu_142</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>phase1_fu_206</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>phase2_fu_221</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>tmp_10_fu_290</first> <second> <count>1</count> <item_version>0</item_version> <item>78</item> </second> </item> <item> <first>tmp_11_fu_295</first> <second> <count>1</count> <item_version>0</item_version> <item>81</item> </second> </item> <item> <first>tmp_12_fu_306</first> <second> <count>1</count> <item_version>0</item_version> <item>87</item> </second> </item> <item> <first>tmp_13_fu_317</first> <second> <count>1</count> <item_version>0</item_version> <item>91</item> </second> </item> <item> <first>tmp_14_fu_148</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>tmp_1_fu_259</first> <second> <count>1</count> <item_version>0</item_version> <item>54</item> </second> </item> <item> <first>tmp_61_i_fu_230</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>tmp_7_fu_269</first> <second> <count>1</count> <item_version>0</item_version> <item>61</item> </second> </item> <item> <first>tmp_9_fu_279</first> <second> <count>1</count> <item_version>0</item_version> <item>63</item> </second> </item> <item> <first>tmp_fu_216</first> <second> <count>1</count> <item_version>0</item_version> <item>73</item> </second> </item> <item> <first>tmp_i3_cast_fu_238</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>tmp_i4_cast_fu_241</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>tmp_i5_fu_247</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>tmp_i6_fu_250</first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> <item> <first>tmp_i_fu_226</first> <second> <count>1</count> <item_version>0</item_version> <item>31</item> </second> </item> <item> <first>tmp_i_i1_cast_fu_256</first> <second> <count>1</count> <item_version>0</item_version> <item>57</item> </second> </item> <item> <first>tmp_i_i8_cast_fu_253</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>tmp_i_i_fu_244</first> <second> <count>1</count> <item_version>0</item_version> <item>44</item> </second> </item> <item> <first>tmp_s_fu_234</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>valid_in_fu_158</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> </dp_fu_nodes_expression> <dp_fu_nodes_module> <count>3</count> <item_version>0</item_version> <item> <first>grp_fu_335</first> <second> <count>6</count> <item_version>0</item_version> <item>56</item> <item>59</item> <item>59</item> <item>59</item> <item>60</item> <item>58</item> </second> </item> <item> <first>grp_fu_344</first> <second> <count>6</count> <item_version>0</item_version> <item>49</item> <item>52</item> <item>52</item> <item>52</item> <item>53</item> <item>51</item> </second> </item> <item> <first>grp_fu_353</first> <second> <count>6</count> <item_version>0</item_version> <item>43</item> <item>46</item> <item>46</item> <item>46</item> <item>46</item> <item>45</item> </second> </item> </dp_fu_nodes_module> <dp_fu_nodes_io> <count>14</count> <item_version>0</item_version> <item> <first>Din_read_read_fu_68</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>acc_load_load_fu_190</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> <item> <first>ch_1_load_load_fu_176</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>freq_read_read_fu_74</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>i_1_load_load_fu_138</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> <item> <first>index_load_load_fu_186</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>init_1_load_load_fu_164</first> <second> <count>1</count> <item_version>0</item_version> <item>18</item> </second> </item> <item> <first>stg_26_store_fu_200</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>stg_71_write_fu_80</first> <second> <count>1</count> <item_version>0</item_version> <item>55</item> </second> </item> <item> <first>stg_73_write_fu_87</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>stg_76_store_fu_284</first> <second> <count>1</count> <item_version>0</item_version> <item>66</item> </second> </item> <item> <first>stg_83_store_fu_300</first> <second> <count>1</count> <item_version>0</item_version> <item>82</item> </second> </item> <item> <first>stg_87_store_fu_311</first> <second> <count>1</count> <item_version>0</item_version> <item>88</item> </second> </item> <item> <first>stg_91_store_fu_329</first> <second> <count>1</count> <item_version>0</item_version> <item>93</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="55" tracking_level="0" version="0"> <count>3</count> <item_version>0</item_version> <item class_id="56" tracking_level="0" version="0"> <first class_id="57" tracking_level="0" version="0"> <first>DI_cache</first> <second>0</second> </first> <second> <count>3</count> <item_version>0</item_version> <item>75</item> <item>40</item> <item>40</item> </second> </item> <item> <first> <first>dds_table</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>33</item> <item>33</item> </second> </item> <item> <first> <first>dds_table</first> <second>1</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>37</item> <item>37</item> </second> </item> </dp_mem_port_nodes> <dp_reg_nodes> <count>21</count> <item_version>0</item_version> <item> <first>361</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>367</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> <item> <first>372</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>377</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> <item> <first>381</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>386</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>390</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>398</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>404</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>409</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>414</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>419</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>425</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>431</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> <item> <first>436</first> <second> <count>1</count> <item_version>0</item_version> <item>44</item> </second> </item> <item> <first>441</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>446</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>451</first> <second> <count>1</count> <item_version>0</item_version> <item>57</item> </second> </item> <item> <first>456</first> <second> <count>1</count> <item_version>0</item_version> <item>46</item> </second> </item> <item> <first>462</first> <second> <count>1</count> <item_version>0</item_version> <item>53</item> </second> </item> <item> <first>467</first> <second> <count>1</count> <item_version>0</item_version> <item>60</item> </second> </item> </dp_reg_nodes> <dp_regname_nodes> <count>21</count> <item_version>0</item_version> <item> <first>DI_cache_addr_1_reg_431</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> <item> <first>Din_re_reg_441</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>Din_read_reg_361</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>brmerge_demorgan_reg_386</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>ch_1_load_reg_381</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>cosine_reg_425</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>dds_table_addr_1_reg_414</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>dds_table_addr_reg_409</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>i_1_load_reg_367</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> <item> <first>inc_reg_372</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>index_load_reg_390</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>phase1_reg_398</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>phase2_reg_404</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>sine_reg_419</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>tmp_2_reg_456</first> <second> <count>1</count> <item_version>0</item_version> <item>46</item> </second> </item> <item> <first>tmp_4_reg_467</first> <second> <count>1</count> <item_version>0</item_version> <item>60</item> </second> </item> <item> <first>tmp_8_reg_462</first> <second> <count>1</count> <item_version>0</item_version> <item>53</item> </second> </item> <item> <first>tmp_i_i1_cast_reg_451</first> <second> <count>1</count> <item_version>0</item_version> <item>57</item> </second> </item> <item> <first>tmp_i_i8_cast_reg_446</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>tmp_i_i_reg_436</first> <second> <count>1</count> <item_version>0</item_version> <item>44</item> </second> </item> <item> <first>valid_in_reg_377</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> </dp_regname_nodes> <dp_reg_phi> <count>0</count> <item_version>0</item_version> </dp_reg_phi> <dp_regname_phi> <count>0</count> <item_version>0</item_version> </dp_regname_phi> <dp_port_io_nodes class_id="58" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="59" tracking_level="0" version="0"> <first>Din</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> </second> </item> <item> <first>Dout_I</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>1</count> <item_version>0</item_version> <item>55</item> </second> </item> </second> </item> <item> <first>Dout_Q</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> </second> </item> <item> <first>freq</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> </second> </item> </dp_port_io_nodes> <port2core class_id="60" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </port2core> <node2core> <count>0</count> <item_version>0</item_version> </node2core> </syndb> </boost_serialization>

30.584229

108

0.429001

2f490a75fe49ec9229bfa17edbd1e33a1c1a1cc7

124,853

adb

Ada

fpga/wave/.autopilot/db/on_edge.adb

dorin-ionita/RustHPC

903e5dd8f09213a5cc33f5e651d687e234944e84

[ "MIT" ]

2

2021-06-22T19:23:55.000Z

2021-07-03T16:47:01.000Z

fpga/wave/.autopilot/db/on_edge.adb

dorin-ionita/RustHPC

903e5dd8f09213a5cc33f5e651d687e234944e84

[ "MIT" ]

60

2019-11-05T14:12:34.000Z

2021-06-21T22:31:17.000Z

fpga/wave/.autopilot/db/on_edge.adb

dorin-ionita/wireless-models-experiments

903e5dd8f09213a5cc33f5e651d687e234944e84

[ "MIT" ]

null

<?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="14"> <syndb class_id="0" tracking_level="0" version="0"> <userIPLatency>-1</userIPLatency> <userIPName/> <cdfg class_id="1" tracking_level="1" version="0" object_id="_0"> <name>on_edge</name> <ret_bitwidth>3</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="3" tracking_level="1" version="0" object_id="_1"> <Value class_id="4" tracking_level="0" version="0"> <Obj class_id="5" tracking_level="0" version="0"> <type>1</type> <id>1</id> <name>x</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo class_id="6" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>x</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs class_id="7" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_2"> <Value> <Obj> <type>1</type> <id>2</id> <name>y</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>y</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_3"> <Value> <Obj> <type>1</type> <id>3</id> <name>nx</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <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>ny</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> </ports> <nodes class_id="8" tracking_level="0" version="0"> <count>31</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_5"> <Value> <Obj> <type>0</type> <id>5</id> <name>y_read</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>y</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>38</item> <item>39</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_6"> <Value> <Obj> <type>0</type> <id>6</id> <name>x_read</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>x</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>40</item> <item>41</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_7"> <Value> <Obj> <type>0</type> <id>7</id> <name>tmp</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="11" tracking_level="0" version="0"> <first>/home/dorin</first> <second class_id="12" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="13" tracking_level="0" version="0"> <first class_id="14" tracking_level="0" version="0"> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>7</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_fu_38_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>42</item> <item>44</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_8"> <Value> <Obj> <type>0</type> <id>8</id> <name>tmp_s</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>7</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_s_fu_44_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>45</item> <item>46</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>9</id> <name>or_cond</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>7</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>or_cond_fu_50_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>47</item> <item>48</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_10"> <Value> <Obj> <type>0</type> <id>10</id> <name>nx_load</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>7</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>49</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_11"> <Value> <Obj> <type>0</type> <id>11</id> <name>tmp_152</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>7</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_152_fu_60_p2</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>50</item> <item>52</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_12"> <Value> <Obj> <type>0</type> <id>12</id> <name>tmp_153</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>7</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_153_fu_66_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>53</item> <item>54</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>13</id> <name>ny_load</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>9</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>9</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>55</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_14"> <Value> <Obj> <type>0</type> <id>14</id> <name>tmp_154</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>9</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>9</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_154_fu_76_p2</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>56</item> <item>57</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_15"> <Value> <Obj> <type>0</type> <id>15</id> <name>tmp_155</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>9</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>9</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_155_fu_82_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>58</item> <item>59</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_16"> <Value> <Obj> <type>0</type> <id>16</id> <name>tmp_156</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>11</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>11</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_156_fu_88_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>60</item> <item>61</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>17</id> <name>tmp_157</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>11</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>11</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_157_fu_94_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>62</item> <item>63</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_18"> <Value> <Obj> <type>0</type> <id>18</id> <name>tmp_158</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>11</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>11</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_158_fu_100_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>64</item> <item>65</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_19"> <Value> <Obj> <type>0</type> <id>19</id> <name>tmp20</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>11</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>11</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp20_fu_106_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>66</item> <item>67</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_20"> <Value> <Obj> <type>0</type> <id>20</id> <name>or_cond4</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>11</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>11</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>or_cond4_fu_112_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>68</item> <item>69</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_21"> <Value> <Obj> <type>0</type> <id>21</id> <name>tmp_159</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>13</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>13</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_159_fu_118_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>70</item> <item>71</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>22</id> <name>or_cond5</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>13</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>13</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>or_cond5_fu_160_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>72</item> <item>73</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_23"> <Value> <Obj> <type>0</type> <id>23</id> <name>p_s</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>13</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>13</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_s_fu_164_p3</rtlName> <coreName/> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>74</item> <item>76</item> <item>78</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>24</id> <name>tmp22</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>7</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp22_fu_124_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>79</item> <item>80</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_25"> <Value> <Obj> <type>0</type> <id>25</id> <name>sel_tmp</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>7</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>sel_tmp_fu_130_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>81</item> <item>82</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_26"> <Value> <Obj> <type>0</type> <id>26</id> <name>sel_tmp2</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>7</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>sel_tmp2_fu_136_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>83</item> <item>84</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_27"> <Value> <Obj> <type>0</type> <id>27</id> <name>sel_tmp6</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>7</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>sel_tmp6_fu_142_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>85</item> <item>86</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_28"> <Value> <Obj> <type>0</type> <id>28</id> <name>sel_tmp7</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>7</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>sel_tmp7_fu_148_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>87</item> <item>88</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_29"> <Value> <Obj> <type>0</type> <id>29</id> <name>sel_tmp8</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>7</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>sel_tmp8_fu_172_p3</rtlName> <coreName/> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>89</item> <item>90</item> <item>92</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_30"> <Value> <Obj> <type>0</type> <id>30</id> <name>sel_tmp11_demorgan</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>7</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>sel_tmp11_demorgan_fu_154_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>93</item> <item>94</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_31"> <Value> <Obj> <type>0</type> <id>31</id> <name>sel_tmp1</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>7</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>sel_tmp1_fu_179_p3</rtlName> <coreName/> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>95</item> <item>96</item> <item>98</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>32</id> <name>sel_tmp3</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>7</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>sel_tmp3_fu_186_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>99</item> <item>101</item> </oprand_edges> <opcode>xor</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_33"> <Value> <Obj> <type>0</type> <id>33</id> <name>sel_tmp4</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>7</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>sel_tmp4_fu_191_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>102</item> <item>103</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_34"> <Value> <Obj> <type>0</type> <id>34</id> <name>UnifiedRetVal</name> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>7</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>7</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>ap_return</rtlName> <coreName/> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>104</item> <item>106</item> <item>107</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_35"> <Value> <Obj> <type>0</type> <id>35</id> <name/> <fileName>wave2/.apc/main.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>16</lineNumber> <contextFuncName>on_edge</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dorin</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>wave2/.apc/main.c</first> <second>on_edge</second> </first> <second>16</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>108</item> </oprand_edges> <opcode>ret</opcode> <m_Display>0</m_Display> </item> </nodes> <consts class_id="15" tracking_level="0" version="0"> <count>8</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_36"> <Value> <Obj> <type>2</type> <id>43</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_37"> <Value> <Obj> <type>2</type> <id>51</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>4294967295</content> </item> <item class_id_reference="16" object_id="_38"> <Value> <Obj> <type>2</type> <id>75</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>3</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_39"> <Value> <Obj> <type>2</type> <id>77</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>3</bitwidth> </Value> <const_type>0</const_type> <content>4</content> </item> <item class_id_reference="16" object_id="_40"> <Value> <Obj> <type>2</type> <id>91</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>3</bitwidth> </Value> <const_type>0</const_type> <content>2</content> </item> <item class_id_reference="16" object_id="_41"> <Value> <Obj> <type>2</type> <id>97</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>3</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_42"> <Value> <Obj> <type>2</type> <id>100</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_43"> <Value> <Obj> <type>2</type> <id>105</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>3</bitwidth> </Value> <const_type>0</const_type> <content>3</content> </item> </consts> <blocks class_id="17" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="18" tracking_level="1" version="0" object_id="_44"> <Obj> <type>3</type> <id>36</id> <name>on_edge</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>31</count> <item_version>0</item_version> <item>5</item> <item>6</item> <item>7</item> <item>8</item> <item>9</item> <item>10</item> <item>11</item> <item>12</item> <item>13</item> <item>14</item> <item>15</item> <item>16</item> <item>17</item> <item>18</item> <item>19</item> <item>20</item> <item>21</item> <item>22</item> <item>23</item> <item>24</item> <item>25</item> <item>26</item> <item>27</item> <item>28</item> <item>29</item> <item>30</item> <item>31</item> <item>32</item> <item>33</item> <item>34</item> <item>35</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>61</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_45"> <id>39</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>5</sink_obj> </item> <item class_id_reference="20" object_id="_46"> <id>41</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>6</sink_obj> </item> <item class_id_reference="20" object_id="_47"> <id>42</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>7</sink_obj> </item> <item class_id_reference="20" object_id="_48"> <id>44</id> <edge_type>1</edge_type> <source_obj>43</source_obj> <sink_obj>7</sink_obj> </item> <item class_id_reference="20" object_id="_49"> <id>45</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>8</sink_obj> </item> <item class_id_reference="20" object_id="_50"> <id>46</id> <edge_type>1</edge_type> <source_obj>43</source_obj> <sink_obj>8</sink_obj> </item> <item class_id_reference="20" object_id="_51"> <id>47</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>9</sink_obj> </item> <item class_id_reference="20" object_id="_52"> <id>48</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>9</sink_obj> </item> <item class_id_reference="20" object_id="_53"> <id>49</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>10</sink_obj> </item> <item class_id_reference="20" object_id="_54"> <id>50</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>11</sink_obj> </item> <item class_id_reference="20" object_id="_55"> <id>52</id> <edge_type>1</edge_type> <source_obj>51</source_obj> <sink_obj>11</sink_obj> </item> <item class_id_reference="20" object_id="_56"> <id>53</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>12</sink_obj> </item> <item class_id_reference="20" object_id="_57"> <id>54</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>12</sink_obj> </item> <item class_id_reference="20" object_id="_58"> <id>55</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>13</sink_obj> </item> <item class_id_reference="20" object_id="_59"> <id>56</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>14</sink_obj> </item> <item class_id_reference="20" object_id="_60"> <id>57</id> <edge_type>1</edge_type> <source_obj>51</source_obj> <sink_obj>14</sink_obj> </item> <item class_id_reference="20" object_id="_61"> <id>58</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>15</sink_obj> </item> <item class_id_reference="20" object_id="_62"> <id>59</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>15</sink_obj> </item> <item class_id_reference="20" object_id="_63"> <id>60</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>16</sink_obj> </item> <item class_id_reference="20" object_id="_64"> <id>61</id> <edge_type>1</edge_type> <source_obj>43</source_obj> <sink_obj>16</sink_obj> </item> <item class_id_reference="20" object_id="_65"> <id>62</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>17</sink_obj> </item> <item class_id_reference="20" object_id="_66"> <id>63</id> <edge_type>1</edge_type> <source_obj>43</source_obj> <sink_obj>17</sink_obj> </item> <item class_id_reference="20" object_id="_67"> <id>64</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>18</sink_obj> </item> <item class_id_reference="20" object_id="_68"> <id>65</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>18</sink_obj> </item> <item class_id_reference="20" object_id="_69"> <id>66</id> <edge_type>1</edge_type> <source_obj>17</source_obj> <sink_obj>19</sink_obj> </item> <item class_id_reference="20" object_id="_70"> <id>67</id> <edge_type>1</edge_type> <source_obj>18</source_obj> <sink_obj>19</sink_obj> </item> <item class_id_reference="20" object_id="_71"> <id>68</id> <edge_type>1</edge_type> <source_obj>19</source_obj> <sink_obj>20</sink_obj> </item> <item class_id_reference="20" object_id="_72"> <id>69</id> <edge_type>1</edge_type> <source_obj>16</source_obj> <sink_obj>20</sink_obj> </item> <item class_id_reference="20" object_id="_73"> <id>70</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>21</sink_obj> </item> <item class_id_reference="20" object_id="_74"> <id>71</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>21</sink_obj> </item> <item class_id_reference="20" object_id="_75"> <id>72</id> <edge_type>1</edge_type> <source_obj>19</source_obj> <sink_obj>22</sink_obj> </item> <item class_id_reference="20" object_id="_76"> <id>73</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>22</sink_obj> </item> <item class_id_reference="20" object_id="_77"> <id>74</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>23</sink_obj> </item> <item class_id_reference="20" object_id="_78"> <id>76</id> <edge_type>1</edge_type> <source_obj>75</source_obj> <sink_obj>23</sink_obj> </item> <item class_id_reference="20" object_id="_79"> <id>78</id> <edge_type>1</edge_type> <source_obj>77</source_obj> <sink_obj>23</sink_obj> </item> <item class_id_reference="20" object_id="_80"> <id>79</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>24</sink_obj> </item> <item class_id_reference="20" object_id="_81"> <id>80</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>24</sink_obj> </item> <item class_id_reference="20" object_id="_82"> <id>81</id> <edge_type>1</edge_type> <source_obj>24</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_83"> <id>82</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_84"> <id>83</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>26</sink_obj> </item> <item class_id_reference="20" object_id="_85"> <id>84</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>26</sink_obj> </item> <item class_id_reference="20" object_id="_86"> <id>85</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>27</sink_obj> </item> <item class_id_reference="20" object_id="_87"> <id>86</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>27</sink_obj> </item> <item class_id_reference="20" object_id="_88"> <id>87</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>28</sink_obj> </item> <item class_id_reference="20" object_id="_89"> <id>88</id> <edge_type>1</edge_type> <source_obj>20</source_obj> <sink_obj>28</sink_obj> </item> <item class_id_reference="20" object_id="_90"> <id>89</id> <edge_type>1</edge_type> <source_obj>28</source_obj> <sink_obj>29</sink_obj> </item> <item class_id_reference="20" object_id="_91"> <id>90</id> <edge_type>1</edge_type> <source_obj>23</source_obj> <sink_obj>29</sink_obj> </item> <item class_id_reference="20" object_id="_92"> <id>92</id> <edge_type>1</edge_type> <source_obj>91</source_obj> <sink_obj>29</sink_obj> </item> <item class_id_reference="20" object_id="_93"> <id>93</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>30</sink_obj> </item> <item class_id_reference="20" object_id="_94"> <id>94</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>30</sink_obj> </item> <item class_id_reference="20" object_id="_95"> <id>95</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>31</sink_obj> </item> <item class_id_reference="20" object_id="_96"> <id>96</id> <edge_type>1</edge_type> <source_obj>29</source_obj> <sink_obj>31</sink_obj> </item> <item class_id_reference="20" object_id="_97"> <id>98</id> <edge_type>1</edge_type> <source_obj>97</source_obj> <sink_obj>31</sink_obj> </item> <item class_id_reference="20" object_id="_98"> <id>99</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>32</sink_obj> </item> <item class_id_reference="20" object_id="_99"> <id>101</id> <edge_type>1</edge_type> <source_obj>100</source_obj> <sink_obj>32</sink_obj> </item> <item class_id_reference="20" object_id="_100"> <id>102</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>33</sink_obj> </item> <item class_id_reference="20" object_id="_101"> <id>103</id> <edge_type>1</edge_type> <source_obj>32</source_obj> <sink_obj>33</sink_obj> </item> <item class_id_reference="20" object_id="_102"> <id>104</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>34</sink_obj> </item> <item class_id_reference="20" object_id="_103"> <id>106</id> <edge_type>1</edge_type> <source_obj>105</source_obj> <sink_obj>34</sink_obj> </item> <item class_id_reference="20" object_id="_104"> <id>107</id> <edge_type>1</edge_type> <source_obj>31</source_obj> <sink_obj>34</sink_obj> </item> <item class_id_reference="20" object_id="_105"> <id>108</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>35</sink_obj> </item> </edges> </cdfg> <cdfg_regions class_id="21" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="22" tracking_level="1" version="0" object_id="_106"> <mId>1</mId> <mTag>on_edge</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>36</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>1</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> </cdfg_regions> <fsm class_id="24" tracking_level="1" version="0" object_id="_107"> <states class_id="25" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="26" tracking_level="1" version="0" object_id="_108"> <id>1</id> <operations class_id="27" tracking_level="0" version="0"> <count>23</count> <item_version>0</item_version> <item class_id="28" tracking_level="1" version="0" object_id="_109"> <id>5</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_110"> <id>6</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_111"> <id>7</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_112"> <id>8</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_113"> <id>9</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_114"> <id>10</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_115"> <id>11</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_116"> <id>12</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_117"> <id>13</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_118"> <id>14</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_119"> <id>15</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_120"> <id>16</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_121"> <id>17</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_122"> <id>18</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_123"> <id>19</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_124"> <id>20</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_125"> <id>21</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_126"> <id>24</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_127"> <id>25</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_128"> <id>26</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_129"> <id>27</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_130"> <id>28</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_131"> <id>30</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_132"> <id>2</id> <operations> <count>8</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_133"> <id>22</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_134"> <id>23</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_135"> <id>29</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_136"> <id>31</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_137"> <id>32</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_138"> <id>33</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_139"> <id>34</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_140"> <id>35</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> </states> <transitions class_id="29" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="30" tracking_level="1" version="0" object_id="_141"> <inState>1</inState> <outState>2</outState> <condition class_id="31" tracking_level="0" version="0"> <id>2</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> </transitions> </fsm> <res class_id="34" tracking_level="1" version="0" object_id="_142"> <dp_component_resource class_id="35" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_component_resource> <dp_expression_resource> <count>26</count> <item_version>0</item_version> <item class_id="36" tracking_level="0" version="0"> <first>ap_return ( select ) </first> <second class_id="37" tracking_level="0" version="0"> <count>5</count> <item_version>0</item_version> <item class_id="38" tracking_level="0" version="0"> <first>(0P0)</first> <second>1</second> </item> <item> <first>(1P1)</first> <second>2</second> </item> <item> <first>(2P2)</first> <second>3</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>3</second> </item> </second> </item> <item> <first>or_cond4_fu_112_p2 ( or ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <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>or_cond5_fu_160_p2 ( or ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <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>or_cond_fu_50_p2 ( or ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <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>p_s_fu_164_p3 ( select ) </first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>1</second> </item> <item> <first>(1P1)</first> <second>1</second> </item> <item> <first>(2P2)</first> <second>4</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>4</second> </item> </second> </item> <item> <first>sel_tmp11_demorgan_fu_154_p2 ( or ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <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>sel_tmp1_fu_179_p3 ( select ) </first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>1</second> </item> <item> <first>(1P1)</first> <second>3</second> </item> <item> <first>(2P2)</first> <second>1</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>3</second> </item> </second> </item> <item> <first>sel_tmp2_fu_136_p2 ( and ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <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>sel_tmp3_fu_186_p2 ( xor ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>1</second> </item> <item> <first>(1P1)</first> <second>2</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>2</second> </item> </second> </item> <item> <first>sel_tmp4_fu_191_p2 ( and ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <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>sel_tmp6_fu_142_p2 ( or ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <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>sel_tmp7_fu_148_p2 ( and ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <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>sel_tmp8_fu_172_p3 ( select ) </first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>1</second> </item> <item> <first>(1P1)</first> <second>3</second> </item> <item> <first>(2P2)</first> <second>2</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>3</second> </item> </second> </item> <item> <first>sel_tmp_fu_130_p2 ( or ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <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>tmp20_fu_106_p2 ( or ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <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>tmp22_fu_124_p2 ( or ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <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>tmp_152_fu_60_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>32</second> </item> <item> <first>(1P1)</first> <second>2</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>32</second> </item> </second> </item> <item> <first>tmp_153_fu_66_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_154_fu_76_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>32</second> </item> <item> <first>(1P1)</first> <second>2</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>32</second> </item> </second> </item> <item> <first>tmp_155_fu_82_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_156_fu_88_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>1</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>11</second> </item> </second> </item> <item> <first>tmp_157_fu_94_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>1</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>11</second> </item> </second> </item> <item> <first>tmp_158_fu_100_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_159_fu_118_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_fu_38_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>1</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>11</second> </item> </second> </item> <item> <first>tmp_s_fu_44_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>1</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>11</second> </item> </second> </item> </dp_expression_resource> <dp_fifo_resource> <count>0</count> <item_version>0</item_version> </dp_fifo_resource> <dp_memory_resource> <count>0</count> <item_version>0</item_version> </dp_memory_resource> <dp_multiplexer_resource> <count>1</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>3</second> </item> <item> <first>(1Bits)</first> <second>1</second> </item> <item> <first>(2Count)</first> <second>3</second> </item> <item> <first>LUT</first> <second>1</second> </item> </second> </item> </dp_multiplexer_resource> <dp_register_resource> <count>6</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>2</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>2</second> </item> </second> </item> <item> <first>sel_tmp11_demorgan_reg_224</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>sel_tmp7_reg_219</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>sel_tmp_reg_214</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>tmp20_reg_204</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>tmp_159_reg_209</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> </dp_register_resource> <dp_component_map class_id="39" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_component_map> <dp_expression_map> <count>26</count> <item_version>0</item_version> <item class_id="40" tracking_level="0" version="0"> <first>ap_return ( select ) </first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>or_cond4_fu_112_p2 ( or ) </first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>or_cond5_fu_160_p2 ( or ) </first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>or_cond_fu_50_p2 ( or ) </first> <second> <count>1</count> <item_version>0</item_version> <item>9</item> </second> </item> <item> <first>p_s_fu_164_p3 ( select ) </first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>sel_tmp11_demorgan_fu_154_p2 ( or ) </first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>sel_tmp1_fu_179_p3 ( select ) </first> <second> <count>1</count> <item_version>0</item_version> <item>31</item> </second> </item> <item> <first>sel_tmp2_fu_136_p2 ( and ) </first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>sel_tmp3_fu_186_p2 ( xor ) </first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>sel_tmp4_fu_191_p2 ( and ) </first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>sel_tmp6_fu_142_p2 ( or ) </first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> <item> <first>sel_tmp7_fu_148_p2 ( and ) </first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>sel_tmp8_fu_172_p3 ( select ) </first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>sel_tmp_fu_130_p2 ( or ) </first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>tmp20_fu_106_p2 ( or ) </first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> <item> <first>tmp22_fu_124_p2 ( or ) </first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>tmp_152_fu_60_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>tmp_153_fu_66_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>tmp_154_fu_76_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> <item> <first>tmp_155_fu_82_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>tmp_156_fu_88_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>tmp_157_fu_94_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> <item> <first>tmp_158_fu_100_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>18</item> </second> </item> <item> <first>tmp_159_fu_118_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>tmp_fu_38_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>7</item> </second> </item> <item> <first>tmp_s_fu_44_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>8</item> </second> </item> </dp_expression_map> <dp_fifo_map> <count>0</count> <item_version>0</item_version> </dp_fifo_map> <dp_memory_map> <count>0</count> <item_version>0</item_version> </dp_memory_map> </res> <node_label_latency class_id="41" tracking_level="0" version="0"> <count>31</count> <item_version>0</item_version> <item class_id="42" tracking_level="0" version="0"> <first>5</first> <second class_id="43" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>6</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>7</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>8</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>9</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>10</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>11</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>12</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>13</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>14</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>15</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>16</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>17</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>18</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>19</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>20</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>21</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>22</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>23</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>24</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>25</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>26</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>27</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>28</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>29</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>30</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>31</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>32</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>33</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>34</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>35</first> <second> <first>1</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="44" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="45" tracking_level="0" version="0"> <first>36</first> <second class_id="46" tracking_level="0" version="0"> <first>0</first> <second>1</second> </second> </item> </bblk_ent_exit> <regions class_id="47" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </regions> <dp_fu_nodes class_id="48" tracking_level="0" version="0"> <count>30</count> <item_version>0</item_version> <item class_id="49" tracking_level="0" version="0"> <first>26</first> <second> <count>1</count> <item_version>0</item_version> <item>5</item> </second> </item> <item> <first>32</first> <second> <count>1</count> <item_version>0</item_version> <item>6</item> </second> </item> <item> <first>38</first> <second> <count>1</count> <item_version>0</item_version> <item>7</item> </second> </item> <item> <first>44</first> <second> <count>1</count> <item_version>0</item_version> <item>8</item> </second> </item> <item> <first>50</first> <second> <count>1</count> <item_version>0</item_version> <item>9</item> </second> </item> <item> <first>56</first> <second> <count>1</count> <item_version>0</item_version> <item>10</item> </second> </item> <item> <first>60</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>66</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>72</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>76</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> <item> <first>82</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>88</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>94</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> <item> <first>100</first> <second> <count>1</count> <item_version>0</item_version> <item>18</item> </second> </item> <item> <first>106</first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> <item> <first>112</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>118</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>124</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>130</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>136</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>142</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> <item> <first>148</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>154</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>160</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>164</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>172</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>179</first> <second> <count>1</count> <item_version>0</item_version> <item>31</item> </second> </item> <item> <first>186</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>191</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>196</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> </dp_fu_nodes> <dp_fu_nodes_expression class_id="51" tracking_level="0" version="0"> <count>26</count> <item_version>0</item_version> <item class_id="52" tracking_level="0" version="0"> <first>UnifiedRetVal_fu_196</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>or_cond4_fu_112</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>or_cond5_fu_160</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>or_cond_fu_50</first> <second> <count>1</count> <item_version>0</item_version> <item>9</item> </second> </item> <item> <first>p_s_fu_164</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>sel_tmp11_demorgan_fu_154</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>sel_tmp1_fu_179</first> <second> <count>1</count> <item_version>0</item_version> <item>31</item> </second> </item> <item> <first>sel_tmp2_fu_136</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>sel_tmp3_fu_186</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>sel_tmp4_fu_191</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>sel_tmp6_fu_142</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> <item> <first>sel_tmp7_fu_148</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>sel_tmp8_fu_172</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>sel_tmp_fu_130</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>tmp20_fu_106</first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> <item> <first>tmp22_fu_124</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>tmp_152_fu_60</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>tmp_153_fu_66</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>tmp_154_fu_76</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> <item> <first>tmp_155_fu_82</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>tmp_156_fu_88</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>tmp_157_fu_94</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> <item> <first>tmp_158_fu_100</first> <second> <count>1</count> <item_version>0</item_version> <item>18</item> </second> </item> <item> <first>tmp_159_fu_118</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>tmp_fu_38</first> <second> <count>1</count> <item_version>0</item_version> <item>7</item> </second> </item> <item> <first>tmp_s_fu_44</first> <second> <count>1</count> <item_version>0</item_version> <item>8</item> </second> </item> </dp_fu_nodes_expression> <dp_fu_nodes_module> <count>0</count> <item_version>0</item_version> </dp_fu_nodes_module> <dp_fu_nodes_io> <count>4</count> <item_version>0</item_version> <item> <first>nx_load_load_fu_56</first> <second> <count>1</count> <item_version>0</item_version> <item>10</item> </second> </item> <item> <first>ny_load_load_fu_72</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>x_read_read_fu_32</first> <second> <count>1</count> <item_version>0</item_version> <item>6</item> </second> </item> <item> <first>y_read_read_fu_26</first> <second> <count>1</count> <item_version>0</item_version> <item>5</item> </second> </item> </dp_fu_nodes_io> <return_ports> <count>1</count> <item_version>0</item_version> <item> <first>ap_return</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> </return_ports> <dp_mem_port_nodes class_id="53" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_mem_port_nodes> <dp_reg_nodes> <count>5</count> <item_version>0</item_version> <item> <first>204</first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> <item> <first>209</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>214</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>219</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>224</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> </dp_reg_nodes> <dp_regname_nodes> <count>5</count> <item_version>0</item_version> <item> <first>sel_tmp11_demorgan_reg_224</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>sel_tmp7_reg_219</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>sel_tmp_reg_214</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>tmp20_reg_204</first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> <item> <first>tmp_159_reg_209</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> </dp_regname_nodes> <dp_reg_phi> <count>0</count> <item_version>0</item_version> </dp_reg_phi> <dp_regname_phi> <count>0</count> <item_version>0</item_version> </dp_regname_phi> <dp_port_io_nodes class_id="54" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="55" tracking_level="0" version="0"> <first>nx</first> <second> <count>0</count> <item_version>0</item_version> </second> </item> <item> <first>ny</first> <second> <count>0</count> <item_version>0</item_version> </second> </item> <item> <first>x</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>6</item> </second> </item> </second> </item> <item> <first>y</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>5</item> </second> </item> </second> </item> </dp_port_io_nodes> <port2core class_id="56" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </port2core> <node2core> <count>0</count> <item_version>0</item_version> </node2core> </syndb> </boost_serialization>

29.90491

80

0.429593

d01394f8dc11956a6cec9798fd223e90984e032b

35,937

ads

Ada

src/bitmap_fonts/giza-bitmap_fonts-freemonobold18pt7b.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-freemonobold18pt7b.ads

Fabien-Chouteau/Giza

9f6c167666dbba8f0e5f0ba3e33825c0b3f399bd

[ "BSD-3-Clause" ]

null

src/bitmap_fonts/giza-bitmap_fonts-freemonobold18pt7b.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.FreeMonoBold18pt7b is Font : constant Giza.Font.Ref_Const; private FreeMonoBold18pt7bBitmaps : aliased constant Font_Bitmap := ( 16#77#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#F3#, 16#9C#, 16#E7#, 16#39#, 16#C4#, 16#03#, 16#BF#, 16#FF#, 16#B8#, 16#F1#, 16#FE#, 16#3F#, 16#C7#, 16#F8#, 16#FF#, 16#1C#, 16#C1#, 16#98#, 16#33#, 16#06#, 16#60#, 16#CC#, 16#18#, 16#0E#, 16#1C#, 16#0F#, 16#3C#, 16#1F#, 16#3C#, 16#1E#, 16#3C#, 16#1E#, 16#3C#, 16#1E#, 16#78#, 16#1E#, 16#78#, 16#FF#, 16#FE#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#1E#, 16#78#, 16#1E#, 16#78#, 16#1E#, 16#78#, 16#7F#, 16#FE#, 16#7F#, 16#FE#, 16#7F#, 16#FE#, 16#7F#, 16#FE#, 16#3C#, 16#78#, 16#3C#, 16#78#, 16#3C#, 16#78#, 16#3C#, 16#F0#, 16#3C#, 16#F0#, 16#3C#, 16#F0#, 16#3C#, 16#F0#, 16#03#, 16#00#, 16#1E#, 16#00#, 16#78#, 16#01#, 16#E0#, 16#1F#, 16#F1#, 16#FF#, 16#E7#, 16#FF#, 16#BE#, 16#1E#, 16#F0#, 16#3B#, 16#C0#, 16#CF#, 16#E0#, 16#3F#, 16#F8#, 16#7F#, 16#F0#, 16#7F#, 16#E0#, 16#1F#, 16#F0#, 16#0F#, 16#E0#, 16#3F#, 16#80#, 16#FF#, 16#87#, 16#FF#, 16#FE#, 16#FF#, 16#F3#, 16#7F#, 16#80#, 16#78#, 16#01#, 16#E0#, 16#07#, 16#80#, 16#1E#, 16#00#, 16#78#, 16#00#, 16#C0#, 16#1E#, 16#00#, 16#FF#, 16#03#, 16#86#, 16#06#, 16#06#, 16#0C#, 16#0C#, 16#18#, 16#18#, 16#38#, 16#70#, 16#3F#, 16#C2#, 16#1E#, 16#3E#, 16#03#, 16#F8#, 16#3F#, 16#83#, 16#F8#, 16#0F#, 16#8F#, 16#18#, 16#7F#, 16#01#, 16#C7#, 16#03#, 16#06#, 16#06#, 16#0C#, 16#0C#, 16#18#, 16#1C#, 16#70#, 16#1F#, 16#C0#, 16#0F#, 16#00#, 16#03#, 16#D0#, 16#1F#, 16#F0#, 16#7F#, 16#E1#, 16#FF#, 16#C3#, 16#E6#, 16#07#, 16#80#, 16#0F#, 16#00#, 16#0F#, 16#00#, 16#1F#, 16#00#, 16#3E#, 16#00#, 16#FE#, 16#03#, 16#FE#, 16#FF#, 16#BD#, 16#FE#, 16#3F#, 16#FC#, 16#3F#, 16#7C#, 16#7C#, 16#FF#, 16#FE#, 16#FF#, 16#FC#, 16#FF#, 16#F8#, 16#7E#, 16#F0#, 16#FF#, 16#FF#, 16#E6#, 16#66#, 16#66#, 16#07#, 16#0F#, 16#1F#, 16#1E#, 16#3E#, 16#3C#, 16#78#, 16#78#, 16#78#, 16#70#, 16#F0#, 16#F0#, 16#F0#, 16#F0#, 16#F0#, 16#F0#, 16#F0#, 16#F0#, 16#78#, 16#78#, 16#78#, 16#3C#, 16#3C#, 16#1E#, 16#1F#, 16#0F#, 16#07#, 16#E0#, 16#F0#, 16#F8#, 16#78#, 16#7C#, 16#3C#, 16#3E#, 16#1E#, 16#1E#, 16#1E#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#0E#, 16#1E#, 16#1E#, 16#1E#, 16#3C#, 16#3C#, 16#78#, 16#F8#, 16#F0#, 16#E0#, 16#01#, 16#80#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#7F#, 16#FE#, 16#1F#, 16#F8#, 16#07#, 16#E0#, 16#0F#, 16#F0#, 16#1F#, 16#F8#, 16#1E#, 16#78#, 16#1C#, 16#38#, 16#18#, 16#18#, 16#01#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#01#, 16#80#, 16#3E#, 16#78#, 16#F1#, 16#C7#, 16#8E#, 16#18#, 16#70#, 16#C1#, 16#80#, 16#7F#, 16#FF#, 16#DF#, 16#FF#, 16#F9#, 16#FF#, 16#FF#, 16#3F#, 16#FF#, 16#E0#, 16#77#, 16#FF#, 16#F7#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#3C#, 16#00#, 16#78#, 16#01#, 16#E0#, 16#03#, 16#C0#, 16#07#, 16#00#, 16#1E#, 16#00#, 16#38#, 16#00#, 16#F0#, 16#01#, 16#C0#, 16#07#, 16#80#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#78#, 16#01#, 16#E0#, 16#03#, 16#C0#, 16#0F#, 16#00#, 16#1E#, 16#00#, 16#78#, 16#00#, 16#F0#, 16#03#, 16#C0#, 16#07#, 16#80#, 16#1E#, 16#00#, 16#3C#, 16#00#, 16#70#, 16#01#, 16#E0#, 16#03#, 16#80#, 16#03#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#1F#, 16#F8#, 16#3F#, 16#FC#, 16#3F#, 16#FC#, 16#7C#, 16#3E#, 16#78#, 16#1E#, 16#F8#, 16#1F#, 16#F0#, 16#0F#, 16#F0#, 16#0F#, 16#F0#, 16#0F#, 16#F0#, 16#0F#, 16#F0#, 16#0F#, 16#F0#, 16#0F#, 16#F0#, 16#0F#, 16#F0#, 16#0F#, 16#F0#, 16#0F#, 16#F8#, 16#1F#, 16#78#, 16#1E#, 16#7C#, 16#3E#, 16#3F#, 16#FC#, 16#3F#, 16#FC#, 16#1F#, 16#F8#, 16#07#, 16#E0#, 16#07#, 16#C0#, 16#1F#, 16#80#, 16#FF#, 16#03#, 16#FE#, 16#0F#, 16#BC#, 16#0C#, 16#78#, 16#00#, 16#F0#, 16#01#, 16#E0#, 16#03#, 16#C0#, 16#07#, 16#80#, 16#0F#, 16#00#, 16#1E#, 16#00#, 16#3C#, 16#00#, 16#78#, 16#00#, 16#F0#, 16#01#, 16#E0#, 16#03#, 16#C0#, 16#07#, 16#81#, 16#FF#, 16#FB#, 16#FF#, 16#F7#, 16#FF#, 16#E7#, 16#FF#, 16#80#, 16#0F#, 16#C0#, 16#7F#, 16#E1#, 16#FF#, 16#E3#, 16#FF#, 16#EF#, 16#87#, 16#DE#, 16#07#, 16#F8#, 16#07#, 16#80#, 16#0F#, 16#00#, 16#1E#, 16#00#, 16#7C#, 16#01#, 16#F0#, 16#07#, 16#C0#, 16#1F#, 16#00#, 16#7C#, 16#01#, 16#F0#, 16#07#, 16#C0#, 16#1F#, 16#00#, 16#78#, 16#03#, 16#E0#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#0F#, 16#C0#, 16#7F#, 16#F0#, 16#FF#, 16#F8#, 16#FF#, 16#FC#, 16#70#, 16#3E#, 16#00#, 16#1E#, 16#00#, 16#1E#, 16#00#, 16#1E#, 16#00#, 16#3C#, 16#03#, 16#FC#, 16#03#, 16#F0#, 16#03#, 16#F0#, 16#03#, 16#FC#, 16#00#, 16#3E#, 16#00#, 16#1F#, 16#00#, 16#0F#, 16#00#, 16#0F#, 16#00#, 16#0F#, 16#E0#, 16#3F#, 16#FF#, 16#FE#, 16#FF#, 16#FC#, 16#7F#, 16#F8#, 16#1F#, 16#E0#, 16#00#, 16#F8#, 16#03#, 16#F0#, 16#07#, 16#E0#, 16#1F#, 16#C0#, 16#77#, 16#80#, 16#EF#, 16#03#, 16#9E#, 16#0F#, 16#3C#, 16#1C#, 16#78#, 16#70#, 16#F1#, 16#E1#, 16#E3#, 16#83#, 16#CF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#78#, 16#07#, 16#FC#, 16#0F#, 16#F8#, 16#1F#, 16#F0#, 16#1F#, 16#C0#, 16#3F#, 16#FC#, 16#1F#, 16#FE#, 16#0F#, 16#FF#, 16#07#, 16#FF#, 16#83#, 16#C0#, 16#01#, 16#E0#, 16#00#, 16#F0#, 16#00#, 16#7B#, 16#E0#, 16#3F#, 16#FC#, 16#1F#, 16#FF#, 16#0F#, 16#FF#, 16#C3#, 16#83#, 16#E0#, 16#00#, 16#F8#, 16#00#, 16#3C#, 16#00#, 16#1E#, 16#00#, 16#0F#, 16#00#, 16#0F#, 16#B8#, 16#0F#, 16#BF#, 16#FF#, 16#CF#, 16#FF#, 16#C3#, 16#FF#, 16#C0#, 16#7F#, 16#80#, 16#00#, 16#FC#, 16#07#, 16#FC#, 16#3F#, 16#F8#, 16#FF#, 16#F1#, 16#F8#, 16#07#, 16#C0#, 16#1F#, 16#00#, 16#3C#, 16#00#, 16#F0#, 16#01#, 16#E7#, 16#C3#, 16#DF#, 16#C7#, 16#7F#, 16#CF#, 16#FF#, 16#DF#, 16#8F#, 16#FC#, 16#07#, 16#F0#, 16#0F#, 16#F0#, 16#1F#, 16#E0#, 16#3D#, 16#E0#, 16#FB#, 16#FF#, 16#E3#, 16#FF#, 16#C3#, 16#FF#, 16#01#, 16#F8#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#01#, 16#E0#, 16#03#, 16#80#, 16#0F#, 16#00#, 16#1E#, 16#00#, 16#38#, 16#00#, 16#F0#, 16#01#, 16#C0#, 16#07#, 16#80#, 16#0F#, 16#00#, 16#1C#, 16#00#, 16#78#, 16#00#, 16#F0#, 16#01#, 16#C0#, 16#07#, 16#80#, 16#0F#, 16#00#, 16#1C#, 16#00#, 16#38#, 16#00#, 16#70#, 16#00#, 16#07#, 16#C0#, 16#3F#, 16#E0#, 16#FF#, 16#E3#, 16#FF#, 16#EF#, 16#83#, 16#FE#, 16#03#, 16#FC#, 16#07#, 16#F8#, 16#0F#, 16#F0#, 16#1E#, 16#F0#, 16#78#, 16#FF#, 16#E0#, 16#FF#, 16#81#, 16#FF#, 16#0F#, 16#FF#, 16#9E#, 16#0F#, 16#78#, 16#0F#, 16#F0#, 16#1F#, 16#E0#, 16#3F#, 16#E0#, 16#FB#, 16#FF#, 16#E7#, 16#FF#, 16#C7#, 16#FF#, 16#03#, 16#F8#, 16#00#, 16#0F#, 16#C0#, 16#3F#, 16#E0#, 16#FF#, 16#E3#, 16#FF#, 16#EF#, 16#C3#, 16#DF#, 16#03#, 16#BC#, 16#07#, 16#F8#, 16#0F#, 16#F0#, 16#1F#, 16#F0#, 16#3D#, 16#F1#, 16#FB#, 16#FF#, 16#F3#, 16#FE#, 16#E3#, 16#FB#, 16#C3#, 16#E7#, 16#80#, 16#1E#, 16#00#, 16#7C#, 16#01#, 16#F0#, 16#07#, 16#E7#, 16#FF#, 16#8F#, 16#FE#, 16#1F#, 16#F0#, 16#1F#, 16#80#, 16#00#, 16#77#, 16#FF#, 16#F7#, 16#00#, 16#00#, 16#00#, 16#00#, 16#EF#, 16#FF#, 16#EE#, 16#1C#, 16#7C#, 16#F9#, 16#F1#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F3#, 16#C7#, 16#8E#, 16#3C#, 16#70#, 16#E1#, 16#87#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#80#, 16#00#, 16#F0#, 16#00#, 16#FC#, 16#00#, 16#FE#, 16#00#, 16#FE#, 16#00#, 16#FE#, 16#00#, 16#FE#, 16#00#, 16#FE#, 16#00#, 16#7F#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#7F#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#7F#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#7C#, 16#00#, 16#07#, 16#7F#, 16#FF#, 16#DF#, 16#FF#, 16#F9#, 16#FF#, 16#FF#, 16#3F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#F7#, 16#FF#, 16#FE#, 16#7F#, 16#FF#, 16#CF#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#0F#, 16#C0#, 16#01#, 16#FC#, 16#00#, 16#1F#, 16#C0#, 16#01#, 16#FC#, 16#00#, 16#1F#, 16#C0#, 16#01#, 16#FC#, 16#00#, 16#3F#, 16#80#, 16#3F#, 16#80#, 16#3F#, 16#80#, 16#3F#, 16#80#, 16#3F#, 16#80#, 16#3F#, 16#80#, 16#0F#, 16#80#, 16#03#, 16#80#, 16#00#, 16#1F#, 16#C0#, 16#FF#, 16#E3#, 16#FF#, 16#F7#, 16#FF#, 16#EF#, 16#07#, 16#FE#, 16#03#, 16#DC#, 16#07#, 16#80#, 16#0F#, 16#00#, 16#7C#, 16#03#, 16#F8#, 16#1F#, 16#C0#, 16#1E#, 16#00#, 16#30#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#1F#, 16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#70#, 16#00#, 16#07#, 16#E0#, 16#1F#, 16#E0#, 16#7F#, 16#E1#, 16#E1#, 16#C7#, 16#83#, 16#CE#, 16#03#, 16#BC#, 16#07#, 16#70#, 16#0E#, 16#E0#, 16#7D#, 16#C3#, 16#FB#, 16#8F#, 16#F7#, 16#3C#, 16#EE#, 16#71#, 16#DC#, 16#E3#, 16#B9#, 16#C7#, 16#73#, 16#CE#, 16#E3#, 16#FF#, 16#C3#, 16#FF#, 16#83#, 16#FF#, 16#00#, 16#07#, 16#00#, 16#0E#, 16#00#, 16#1E#, 16#02#, 16#1E#, 16#1E#, 16#3F#, 16#FC#, 16#1F#, 16#F0#, 16#1F#, 16#80#, 16#0F#, 16#F8#, 16#00#, 16#7F#, 16#F0#, 16#01#, 16#FF#, 16#C0#, 16#03#, 16#FF#, 16#80#, 16#00#, 16#FE#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#1D#, 16#F0#, 16#00#, 16#F3#, 16#C0#, 16#03#, 16#CF#, 16#80#, 16#1E#, 16#1E#, 16#00#, 16#78#, 16#78#, 16#01#, 16#C0#, 16#F0#, 16#0F#, 16#FF#, 16#C0#, 16#3F#, 16#FF#, 16#81#, 16#FF#, 16#FE#, 16#07#, 16#FF#, 16#F8#, 16#3C#, 16#00#, 16#F3#, 16#FC#, 16#1F#, 16#EF#, 16#F8#, 16#7F#, 16#FF#, 16#E1#, 16#FF#, 16#7F#, 16#03#, 16#F8#, 16#7F#, 16#FC#, 16#0F#, 16#FF#, 16#F0#, 16#FF#, 16#FF#, 16#8F#, 16#FF#, 16#F8#, 16#3C#, 16#07#, 16#C3#, 16#C0#, 16#3C#, 16#3C#, 16#03#, 16#C3#, 16#C0#, 16#7C#, 16#3F#, 16#FF#, 16#83#, 16#FF#, 16#F0#, 16#3F#, 16#FF#, 16#83#, 16#FF#, 16#FE#, 16#3C#, 16#03#, 16#E3#, 16#C0#, 16#1F#, 16#3C#, 16#00#, 16#F3#, 16#C0#, 16#0F#, 16#3C#, 16#01#, 16#FF#, 16#FF#, 16#FE#, 16#FF#, 16#FF#, 16#EF#, 16#FF#, 16#FC#, 16#7F#, 16#FF#, 16#00#, 16#01#, 16#F8#, 16#C1#, 16#FF#, 16#FC#, 16#7F#, 16#FF#, 16#9F#, 16#FF#, 16#F7#, 16#E0#, 16#7E#, 16#F8#, 16#07#, 16#FE#, 16#00#, 16#7F#, 16#80#, 16#0E#, 16#F0#, 16#00#, 16#1E#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#78#, 16#00#, 16#0F#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#3E#, 16#00#, 16#03#, 16#E0#, 16#07#, 16#7F#, 16#03#, 16#E7#, 16#FF#, 16#FC#, 16#7F#, 16#FF#, 16#03#, 16#FF#, 16#C0#, 16#1F#, 16#E0#, 16#FF#, 16#F0#, 16#3F#, 16#FF#, 16#0F#, 16#FF#, 16#E3#, 16#FF#, 16#FC#, 16#78#, 16#1F#, 16#9E#, 16#03#, 16#E7#, 16#80#, 16#79#, 16#E0#, 16#0F#, 16#78#, 16#03#, 16#DE#, 16#00#, 16#F7#, 16#80#, 16#3D#, 16#E0#, 16#0F#, 16#78#, 16#03#, 16#DE#, 16#00#, 16#F7#, 16#80#, 16#7D#, 16#E0#, 16#1E#, 16#78#, 16#1F#, 16#BF#, 16#FF#, 16#CF#, 16#FF#, 16#F3#, 16#FF#, 16#F0#, 16#7F#, 16#F0#, 16#00#, 16#7F#, 16#FF#, 16#DF#, 16#FF#, 16#FB#, 16#FF#, 16#FF#, 16#7F#, 16#FF#, 16#E3#, 16#C0#, 16#3C#, 16#78#, 16#07#, 16#8F#, 16#1C#, 16#F1#, 16#E3#, 16#CC#, 16#3F#, 16#F8#, 16#07#, 16#FF#, 16#00#, 16#FF#, 16#E0#, 16#1F#, 16#FC#, 16#03#, 16#C7#, 16#80#, 16#78#, 16#F1#, 16#8F#, 16#0C#, 16#79#, 16#E0#, 16#0F#, 16#3C#, 16#01#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#F7#, 16#FF#, 16#FE#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#F3#, 16#C0#, 16#1E#, 16#78#, 16#63#, 16#CF#, 16#1E#, 16#79#, 16#E3#, 16#C6#, 16#3F#, 16#F8#, 16#07#, 16#FF#, 16#00#, 16#FF#, 16#E0#, 16#1F#, 16#FC#, 16#03#, 16#C7#, 16#80#, 16#78#, 16#E0#, 16#0F#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#3C#, 16#00#, 16#1F#, 16#FC#, 16#03#, 16#FF#, 16#80#, 16#7F#, 16#F0#, 16#07#, 16#FC#, 16#00#, 16#01#, 16#FC#, 16#E0#, 16#7F#, 16#FE#, 16#1F#, 16#FF#, 16#E3#, 16#FF#, 16#FE#, 16#7F#, 16#03#, 16#E7#, 16#C0#, 16#1E#, 16#F8#, 16#00#, 16#EF#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#0F#, 16#03#, 16#FE#, 16#F0#, 16#3F#, 16#FF#, 16#03#, 16#FF#, 16#F8#, 16#3F#, 16#F7#, 16#80#, 16#1E#, 16#7E#, 16#01#, 16#E3#, 16#FF#, 16#FE#, 16#1F#, 16#FF#, 16#E0#, 16#FF#, 16#F8#, 16#01#, 16#FE#, 16#00#, 16#7F#, 16#0F#, 16#E3#, 16#FC#, 16#7F#, 16#9F#, 16#E3#, 16#FC#, 16#7F#, 16#1F#, 16#C1#, 16#E0#, 16#3C#, 16#0F#, 16#01#, 16#E0#, 16#78#, 16#0F#, 16#03#, 16#C0#, 16#78#, 16#1E#, 16#03#, 16#C0#, 16#FF#, 16#FE#, 16#07#, 16#FF#, 16#F0#, 16#3F#, 16#FF#, 16#81#, 16#FF#, 16#FC#, 16#0F#, 16#01#, 16#E0#, 16#78#, 16#0F#, 16#03#, 16#C0#, 16#78#, 16#1E#, 16#03#, 16#C3#, 16#FC#, 16#7F#, 16#BF#, 16#E3#, 16#FF#, 16#FF#, 16#1F#, 16#F7#, 16#F0#, 16#7F#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#07#, 16#80#, 16#1E#, 16#00#, 16#78#, 16#01#, 16#E0#, 16#07#, 16#80#, 16#1E#, 16#00#, 16#78#, 16#01#, 16#E0#, 16#07#, 16#80#, 16#1E#, 16#00#, 16#78#, 16#01#, 16#E0#, 16#07#, 16#83#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#7F#, 16#F8#, 16#01#, 16#FF#, 16#E0#, 16#3F#, 16#FC#, 16#07#, 16#FF#, 16#80#, 16#FF#, 16#F0#, 16#00#, 16#F0#, 16#00#, 16#1E#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#78#, 16#00#, 16#0F#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#3C#, 16#38#, 16#07#, 16#8F#, 16#00#, 16#F1#, 16#E0#, 16#1E#, 16#3C#, 16#03#, 16#C7#, 16#80#, 16#F8#, 16#F8#, 16#3F#, 16#1F#, 16#FF#, 16#C3#, 16#FF#, 16#F0#, 16#1F#, 16#FC#, 16#00#, 16#7E#, 16#00#, 16#FF#, 16#0F#, 16#CF#, 16#F9#, 16#FE#, 16#FF#, 16#9F#, 16#EF#, 16#F8#, 16#FC#, 16#3C#, 16#1F#, 16#03#, 16#C3#, 16#E0#, 16#3C#, 16#7C#, 16#03#, 16#CF#, 16#80#, 16#3D#, 16#F0#, 16#03#, 16#FE#, 16#00#, 16#3F#, 16#F8#, 16#03#, 16#FF#, 16#80#, 16#3E#, 16#7C#, 16#03#, 16#C3#, 16#E0#, 16#3C#, 16#1E#, 16#03#, 16#C0#, 16#F0#, 16#3C#, 16#0F#, 16#0F#, 16#F8#, 16#7E#, 16#FF#, 16#87#, 16#FF#, 16#F8#, 16#7F#, 16#7F#, 16#03#, 16#E0#, 16#FF#, 16#C0#, 16#3F#, 16#F0#, 16#0F#, 16#FC#, 16#03#, 16#FF#, 16#00#, 16#1E#, 16#00#, 16#07#, 16#80#, 16#01#, 16#E0#, 16#00#, 16#78#, 16#00#, 16#1E#, 16#00#, 16#07#, 16#80#, 16#01#, 16#E0#, 16#00#, 16#78#, 16#00#, 16#1E#, 16#01#, 16#87#, 16#80#, 16#F1#, 16#E0#, 16#3C#, 16#78#, 16#0F#, 16#1E#, 16#03#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#7F#, 16#FF#, 16#C0#, 16#3E#, 16#00#, 16#F8#, 16#FC#, 16#01#, 16#F9#, 16#FC#, 16#07#, 16#F3#, 16#F8#, 16#0F#, 16#E3#, 16#F8#, 16#3F#, 16#87#, 16#F0#, 16#7F#, 16#0F#, 16#F1#, 16#FE#, 16#1F#, 16#E3#, 16#FC#, 16#3F#, 16#E7#, 16#78#, 16#7B#, 16#DE#, 16#F0#, 16#F7#, 16#BD#, 16#E1#, 16#E7#, 16#F3#, 16#C3#, 16#CF#, 16#E7#, 16#87#, 16#8F#, 16#8F#, 16#0F#, 16#1F#, 16#1E#, 16#1E#, 16#1E#, 16#3C#, 16#3C#, 16#00#, 16#79#, 16#FF#, 16#07#, 16#FF#, 16#FE#, 16#0F#, 16#FF#, 16#FC#, 16#1F#, 16#F7#, 16#F0#, 16#1F#, 16#C0#, 16#FC#, 16#1F#, 16#EF#, 16#E1#, 16#FF#, 16#FE#, 16#1F#, 16#FF#, 16#F1#, 16#FF#, 16#3F#, 16#83#, 16#C3#, 16#F8#, 16#3C#, 16#3F#, 16#C3#, 16#C3#, 16#FC#, 16#3C#, 16#3D#, 16#E3#, 16#C3#, 16#DF#, 16#3C#, 16#3C#, 16#F3#, 16#C3#, 16#CF#, 16#BC#, 16#3C#, 16#7B#, 16#C3#, 16#C3#, 16#FC#, 16#3C#, 16#3F#, 16#C3#, 16#C1#, 16#FC#, 16#3C#, 16#1F#, 16#CF#, 16#F8#, 16#FC#, 16#FF#, 16#87#, 16#CF#, 16#F8#, 16#7C#, 16#7F#, 16#03#, 16#C0#, 16#01#, 16#F8#, 16#00#, 16#7F#, 16#E0#, 16#0F#, 16#FF#, 16#81#, 16#FF#, 16#FC#, 16#3F#, 16#0F#, 16#C7#, 16#C0#, 16#3E#, 16#78#, 16#01#, 16#EF#, 16#80#, 16#1F#, 16#F0#, 16#00#, 16#FF#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#FF#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#FF#, 16#80#, 16#1F#, 16#78#, 16#01#, 16#E7#, 16#C0#, 16#3E#, 16#3F#, 16#0F#, 16#C1#, 16#FF#, 16#F8#, 16#1F#, 16#FF#, 16#00#, 16#7F#, 16#E0#, 16#01#, 16#F8#, 16#00#, 16#7F#, 16#F8#, 16#3F#, 16#FF#, 16#8F#, 16#FF#, 16#F3#, 16#FF#, 16#FE#, 16#3C#, 16#0F#, 16#CF#, 16#00#, 16#F3#, 16#C0#, 16#3C#, 16#F0#, 16#0F#, 16#3C#, 16#03#, 16#CF#, 16#03#, 16#F3#, 16#FF#, 16#F8#, 16#FF#, 16#FC#, 16#3F#, 16#FE#, 16#0F#, 16#FE#, 16#03#, 16#C0#, 16#00#, 16#F0#, 16#00#, 16#3C#, 16#00#, 16#3F#, 16#F8#, 16#0F#, 16#FE#, 16#03#, 16#FF#, 16#80#, 16#7F#, 16#C0#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#7F#, 16#E0#, 16#0F#, 16#FF#, 16#01#, 16#FF#, 16#F8#, 16#3F#, 16#0F#, 16#C7#, 16#C0#, 16#3E#, 16#78#, 16#01#, 16#EF#, 16#80#, 16#1F#, 16#F0#, 16#00#, 16#FF#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#FF#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#FF#, 16#80#, 16#1F#, 16#78#, 16#01#, 16#E7#, 16#C0#, 16#3E#, 16#3F#, 16#0F#, 16#C1#, 16#FF#, 16#F8#, 16#0F#, 16#FF#, 16#00#, 16#7F#, 16#E0#, 16#03#, 16#F8#, 16#00#, 16#3F#, 16#8E#, 16#07#, 16#FF#, 16#F0#, 16#FF#, 16#FF#, 16#0F#, 16#FF#, 16#E0#, 16#60#, 16#78#, 16#7F#, 16#F8#, 16#07#, 16#FF#, 16#F0#, 16#3F#, 16#FF#, 16#E0#, 16#FF#, 16#FF#, 16#01#, 16#E0#, 16#7C#, 16#0F#, 16#01#, 16#E0#, 16#78#, 16#0F#, 16#03#, 16#C0#, 16#78#, 16#1E#, 16#0F#, 16#C0#, 16#FF#, 16#FC#, 16#07#, 16#FF#, 16#C0#, 16#3F#, 16#F8#, 16#01#, 16#FF#, 16#E0#, 16#0F#, 16#0F#, 16#80#, 16#78#, 16#3C#, 16#03#, 16#C0#, 16#F0#, 16#1E#, 16#07#, 16#C3#, 16#FE#, 16#1F#, 16#BF#, 16#F0#, 16#7F#, 16#FF#, 16#83#, 16#F7#, 16#F8#, 16#0F#, 16#00#, 16#07#, 16#E7#, 16#07#, 16#FF#, 16#8F#, 16#FF#, 16#C7#, 16#FF#, 16#E7#, 16#C1#, 16#F3#, 16#C0#, 16#79#, 16#E0#, 16#3C#, 16#F8#, 16#00#, 16#7F#, 16#80#, 16#1F#, 16#FC#, 16#07#, 16#FF#, 16#81#, 16#FF#, 16#E0#, 16#0F#, 16#FB#, 16#00#, 16#7F#, 16#C0#, 16#1F#, 16#E0#, 16#0F#, 16#FC#, 16#1F#, 16#FF#, 16#FF#, 16#BF#, 16#FF#, 16#8D#, 16#FF#, 16#80#, 16#3F#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#0F#, 16#1F#, 16#E1#, 16#E3#, 16#FC#, 16#3C#, 16#7F#, 16#87#, 16#8F#, 16#60#, 16#F0#, 16#C0#, 16#1E#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#78#, 16#00#, 16#0F#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#3C#, 16#00#, 16#07#, 16#80#, 16#00#, 16#F0#, 16#01#, 16#FF#, 16#E0#, 16#3F#, 16#FC#, 16#07#, 16#FF#, 16#80#, 16#7F#, 16#E0#, 16#FF#, 16#0F#, 16#F7#, 16#FC#, 16#7F#, 16#FF#, 16#E3#, 16#FE#, 16#FF#, 16#1F#, 16#F3#, 16#C0#, 16#1E#, 16#1E#, 16#00#, 16#F0#, 16#F0#, 16#07#, 16#87#, 16#80#, 16#3C#, 16#3C#, 16#01#, 16#E1#, 16#E0#, 16#0F#, 16#0F#, 16#00#, 16#78#, 16#78#, 16#03#, 16#C3#, 16#C0#, 16#1E#, 16#1E#, 16#00#, 16#F0#, 16#F0#, 16#07#, 16#87#, 16#C0#, 16#7C#, 16#1F#, 16#07#, 16#C0#, 16#FF#, 16#FE#, 16#03#, 16#FF#, 16#E0#, 16#0F#, 16#FE#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#FF#, 16#03#, 16#FD#, 16#FF#, 16#07#, 16#FF#, 16#FE#, 16#0F#, 16#FB#, 16#F8#, 16#1F#, 16#E1#, 16#C0#, 16#07#, 16#03#, 16#C0#, 16#1E#, 16#07#, 16#80#, 16#3C#, 16#07#, 16#80#, 16#F0#, 16#0F#, 16#01#, 16#E0#, 16#0F#, 16#03#, 16#80#, 16#1E#, 16#0F#, 16#00#, 16#3E#, 16#1C#, 16#00#, 16#3C#, 16#78#, 16#00#, 16#78#, 16#F0#, 16#00#, 16#7B#, 16#C0#, 16#00#, 16#F7#, 16#80#, 16#01#, 16#FE#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#FF#, 16#0F#, 16#F7#, 16#FC#, 16#7F#, 16#FF#, 16#E3#, 16#FF#, 16#FE#, 16#0F#, 16#F7#, 16#80#, 16#0F#, 16#3C#, 16#38#, 16#78#, 16#E3#, 16#E3#, 16#87#, 16#1F#, 16#1C#, 16#38#, 16#F8#, 16#E1#, 16#EF#, 16#E7#, 16#0F#, 16#7F#, 16#78#, 16#7B#, 16#BB#, 16#C3#, 16#FD#, 16#FE#, 16#0F#, 16#EF#, 16#F0#, 16#7E#, 16#7F#, 16#03#, 16#F1#, 16#F8#, 16#1F#, 16#8F#, 16#C0#, 16#FC#, 16#7E#, 16#07#, 16#C1#, 16#F0#, 16#3E#, 16#0F#, 16#81#, 16#F0#, 16#7C#, 16#00#, 16#7E#, 16#0F#, 16#DF#, 16#E3#, 16#FF#, 16#FC#, 16#7F#, 16#BF#, 16#07#, 16#E1#, 16#E0#, 16#F8#, 16#3E#, 16#3E#, 16#03#, 16#EF#, 16#80#, 16#3D#, 16#E0#, 16#03#, 16#F8#, 16#00#, 16#3E#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#F8#, 16#00#, 16#3F#, 16#80#, 16#0F#, 16#78#, 16#03#, 16#C7#, 16#80#, 16#F8#, 16#78#, 16#3E#, 16#0F#, 16#8F#, 16#E3#, 16#FF#, 16#FC#, 16#7F#, 16#FF#, 16#8F#, 16#F7#, 16#E0#, 16#FC#, 16#7E#, 16#07#, 16#EF#, 16#F0#, 16#FF#, 16#FF#, 16#0F#, 16#F7#, 16#E0#, 16#7E#, 16#1E#, 16#07#, 16#81#, 16#F0#, 16#F8#, 16#0F#, 16#8F#, 16#00#, 16#79#, 16#E0#, 16#07#, 16#FE#, 16#00#, 16#3F#, 16#C0#, 16#01#, 16#F8#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#FF#, 16#E0#, 16#0F#, 16#FF#, 16#00#, 16#FF#, 16#F0#, 16#07#, 16#FE#, 16#00#, 16#FF#, 16#FC#, 16#FF#, 16#FC#, 16#FF#, 16#FC#, 16#FF#, 16#FC#, 16#F0#, 16#3C#, 16#F0#, 16#78#, 16#F0#, 16#F0#, 16#70#, 16#E0#, 16#01#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#80#, 16#07#, 16#00#, 16#0E#, 16#00#, 16#1E#, 16#0E#, 16#1C#, 16#0F#, 16#38#, 16#0F#, 16#70#, 16#0F#, 16#7F#, 16#FF#, 16#7F#, 16#FF#, 16#7F#, 16#FF#, 16#7F#, 16#FF#, 16#FE#, 16#FF#, 16#FF#, 16#FE#, 16#F0#, 16#F0#, 16#F0#, 16#F0#, 16#F0#, 16#F0#, 16#F0#, 16#F0#, 16#F0#, 16#F0#, 16#F0#, 16#F0#, 16#F0#, 16#F0#, 16#F0#, 16#F0#, 16#F0#, 16#F0#, 16#F0#, 16#FE#, 16#FF#, 16#FF#, 16#FE#, 16#E0#, 16#01#, 16#E0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#07#, 16#80#, 16#07#, 16#00#, 16#0F#, 16#00#, 16#0E#, 16#00#, 16#1E#, 16#00#, 16#1C#, 16#00#, 16#3C#, 16#00#, 16#78#, 16#00#, 16#78#, 16#00#, 16#F0#, 16#00#, 16#F0#, 16#01#, 16#E0#, 16#01#, 16#E0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#07#, 16#80#, 16#07#, 16#80#, 16#0F#, 16#00#, 16#0F#, 16#00#, 16#1E#, 16#00#, 16#1C#, 16#00#, 16#3C#, 16#00#, 16#38#, 16#00#, 16#70#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#01#, 16#00#, 16#07#, 16#00#, 16#1F#, 16#00#, 16#7F#, 16#00#, 16#FE#, 16#03#, 16#DE#, 16#0F#, 16#3E#, 16#3E#, 16#3E#, 16#F8#, 16#3F#, 16#E0#, 16#3F#, 16#80#, 16#38#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#C3#, 16#87#, 16#0E#, 16#1C#, 16#30#, 16#01#, 16#FC#, 16#01#, 16#FF#, 16#C0#, 16#3F#, 16#FC#, 16#07#, 16#FF#, 16#C0#, 16#00#, 16#78#, 16#0F#, 16#FF#, 16#07#, 16#FF#, 16#E1#, 16#FF#, 16#FC#, 16#7F#, 16#FF#, 16#9F#, 16#80#, 16#F3#, 16#C0#, 16#1E#, 16#78#, 16#0F#, 16#CF#, 16#FF#, 16#FE#, 16#FF#, 16#FF#, 16#CF#, 16#FF#, 16#F8#, 16#7F#, 16#3E#, 16#7C#, 16#00#, 16#1F#, 16#80#, 16#03#, 16#F0#, 16#00#, 16#7E#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#78#, 16#00#, 16#0F#, 16#3F#, 16#01#, 16#FF#, 16#F8#, 16#3F#, 16#FF#, 16#87#, 16#FF#, 16#F0#, 16#FC#, 16#1F#, 16#1F#, 16#01#, 16#F3#, 16#C0#, 16#1E#, 16#78#, 16#03#, 16#CF#, 16#00#, 16#79#, 16#E0#, 16#0F#, 16#3E#, 16#03#, 16#E7#, 16#E0#, 16#FB#, 16#FF#, 16#FF#, 16#7F#, 16#FF#, 16#CF#, 16#FF#, 16#F0#, 16#F9#, 16#F8#, 16#00#, 16#03#, 16#F3#, 16#87#, 16#FF#, 16#CF#, 16#FF#, 16#EF#, 16#FF#, 16#F7#, 16#E0#, 16#FF#, 16#C0#, 16#3F#, 16#C0#, 16#0F#, 16#E0#, 16#00#, 16#F0#, 16#00#, 16#78#, 16#00#, 16#3E#, 16#00#, 16#4F#, 16#80#, 16#F7#, 16#FF#, 16#F9#, 16#FF#, 16#F8#, 16#7F#, 16#F8#, 16#0F#, 16#F0#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#FC#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#FC#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#3C#, 16#03#, 16#F3#, 16#C0#, 16#FF#, 16#BC#, 16#1F#, 16#FF#, 16#C3#, 16#FF#, 16#FC#, 16#7E#, 16#0F#, 16#C7#, 16#80#, 16#7C#, 16#F0#, 16#03#, 16#CF#, 16#00#, 16#3C#, 16#F0#, 16#03#, 16#CF#, 16#00#, 16#3C#, 16#F8#, 16#07#, 16#C7#, 16#E0#, 16#FC#, 16#7F#, 16#FF#, 16#F3#, 16#FF#, 16#FF#, 16#0F#, 16#FF#, 16#F0#, 16#3F#, 16#3E#, 16#03#, 16#F0#, 16#03#, 16#FF#, 16#01#, 16#FF#, 16#E0#, 16#FF#, 16#FC#, 16#7E#, 16#0F#, 16#9E#, 16#01#, 16#EF#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FD#, 16#E0#, 16#00#, 16#7F#, 16#FF#, 16#CF#, 16#FF#, 16#F1#, 16#FF#, 16#F8#, 16#0F#, 16#F0#, 16#03#, 16#FC#, 16#07#, 16#FF#, 16#0F#, 16#FF#, 16#1F#, 16#FF#, 16#1E#, 16#00#, 16#1E#, 16#00#, 16#FF#, 16#F8#, 16#FF#, 16#FC#, 16#FF#, 16#FC#, 16#FF#, 16#F8#, 16#1E#, 16#00#, 16#1E#, 16#00#, 16#1E#, 16#00#, 16#1E#, 16#00#, 16#1E#, 16#00#, 16#1E#, 16#00#, 16#1E#, 16#00#, 16#1E#, 16#00#, 16#FF#, 16#F8#, 16#FF#, 16#F8#, 16#FF#, 16#F8#, 16#FF#, 16#F8#, 16#07#, 16#E7#, 16#C3#, 16#FF#, 16#FC#, 16#FF#, 16#FF#, 16#BF#, 16#FF#, 16#F7#, 16#C1#, 16#F9#, 16#F0#, 16#1F#, 16#3C#, 16#01#, 16#E7#, 16#80#, 16#3C#, 16#F0#, 16#07#, 16#9E#, 16#00#, 16#F3#, 16#E0#, 16#3E#, 16#3E#, 16#0F#, 16#C7#, 16#FF#, 16#F8#, 16#7F#, 16#FF#, 16#07#, 16#FD#, 16#E0#, 16#3F#, 16#3C#, 16#00#, 16#07#, 16#80#, 16#00#, 16#F0#, 16#00#, 16#3E#, 16#03#, 16#FF#, 16#80#, 16#7F#, 16#F0#, 16#0F#, 16#FC#, 16#00#, 16#FE#, 16#00#, 16#3E#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#FC#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#78#, 16#F8#, 16#03#, 16#DF#, 16#E0#, 16#1F#, 16#FF#, 16#80#, 16#FF#, 16#FE#, 16#07#, 16#E1#, 16#F0#, 16#3E#, 16#07#, 16#81#, 16#E0#, 16#3C#, 16#0F#, 16#01#, 16#E0#, 16#78#, 16#0F#, 16#03#, 16#C0#, 16#78#, 16#1E#, 16#03#, 16#C0#, 16#F0#, 16#1E#, 16#1F#, 16#C1#, 16#FD#, 16#FE#, 16#0F#, 16#FF#, 16#F0#, 16#7F#, 16#BF#, 16#01#, 16#F8#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#3F#, 16#C0#, 16#3F#, 16#C0#, 16#3F#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#FF#, 16#FE#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#7F#, 16#FE#, 16#03#, 16#C0#, 16#3C#, 16#03#, 16#C0#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#FF#, 16#F7#, 16#FF#, 16#00#, 16#F0#, 16#0F#, 16#00#, 16#F0#, 16#0F#, 16#00#, 16#F0#, 16#0F#, 16#00#, 16#F0#, 16#0F#, 16#00#, 16#F0#, 16#0F#, 16#00#, 16#F0#, 16#0F#, 16#00#, 16#F0#, 16#0F#, 16#01#, 16#FF#, 16#FE#, 16#FF#, 16#EF#, 16#FC#, 16#7F#, 16#00#, 16#7C#, 16#00#, 16#3F#, 16#00#, 16#0F#, 16#C0#, 16#03#, 16#F0#, 16#00#, 16#3C#, 16#00#, 16#0F#, 16#00#, 16#03#, 16#C7#, 16#F0#, 16#F3#, 16#FC#, 16#3C#, 16#FF#, 16#0F#, 16#3F#, 16#83#, 16#DF#, 16#00#, 16#FF#, 16#80#, 16#3F#, 16#C0#, 16#0F#, 16#E0#, 16#03#, 16#FC#, 16#00#, 16#F7#, 16#80#, 16#3C#, 16#F8#, 16#0F#, 16#1F#, 16#0F#, 16#C3#, 16#FB#, 16#F1#, 16#FF#, 16#FC#, 16#7F#, 16#DF#, 16#0F#, 16#E0#, 16#3F#, 16#C0#, 16#3F#, 16#C0#, 16#3F#, 16#C0#, 16#3F#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#FF#, 16#FE#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#7F#, 16#FE#, 16#3D#, 16#E3#, 16#C1#, 16#FF#, 16#FF#, 16#C7#, 16#FF#, 16#FF#, 16#1F#, 16#FF#, 16#FE#, 16#3E#, 16#3C#, 16#78#, 16#F0#, 16#F1#, 16#E3#, 16#C3#, 16#C7#, 16#8F#, 16#0F#, 16#1E#, 16#3C#, 16#3C#, 16#78#, 16#F0#, 16#F1#, 16#E3#, 16#C3#, 16#C7#, 16#8F#, 16#0F#, 16#1E#, 16#FE#, 16#3E#, 16#7F#, 16#F8#, 16#F9#, 16#FF#, 16#E3#, 16#E7#, 16#DF#, 16#0F#, 16#1E#, 16#1E#, 16#7C#, 16#03#, 16#EF#, 16#F0#, 16#3F#, 16#FF#, 16#83#, 16#FF#, 16#FC#, 16#1F#, 16#87#, 16#C1#, 16#E0#, 16#3C#, 16#1E#, 16#03#, 16#C1#, 16#E0#, 16#3C#, 16#1E#, 16#03#, 16#C1#, 16#E0#, 16#3C#, 16#1E#, 16#03#, 16#C1#, 16#E0#, 16#3C#, 16#7F#, 16#0F#, 16#FF#, 16#F0#, 16#FF#, 16#FF#, 16#0F#, 16#F7#, 16#E0#, 16#7E#, 16#03#, 16#F8#, 16#01#, 16#FF#, 16#C0#, 16#7F#, 16#FC#, 16#1F#, 16#FF#, 16#C7#, 16#E0#, 16#FD#, 16#F0#, 16#07#, 16#FC#, 16#00#, 16#7F#, 16#80#, 16#0F#, 16#F0#, 16#01#, 16#FE#, 16#00#, 16#3F#, 16#E0#, 16#0F#, 16#BF#, 16#07#, 16#E3#, 16#FF#, 16#F8#, 16#3F#, 16#FE#, 16#03#, 16#FF#, 16#80#, 16#1F#, 16#C0#, 16#3E#, 16#7E#, 16#03#, 16#F7#, 16#FC#, 16#1F#, 16#FF#, 16#F0#, 16#FF#, 16#FF#, 16#C1#, 16#F8#, 16#3F#, 16#0F#, 16#80#, 16#7C#, 16#78#, 16#01#, 16#E3#, 16#C0#, 16#0F#, 16#1E#, 16#00#, 16#78#, 16#F0#, 16#03#, 16#C7#, 16#C0#, 16#3E#, 16#3F#, 16#07#, 16#E1#, 16#FF#, 16#FE#, 16#0F#, 16#FF#, 16#E0#, 16#7B#, 16#FE#, 16#03#, 16#CF#, 16#C0#, 16#1E#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#FF#, 16#80#, 16#0F#, 16#FC#, 16#00#, 16#7F#, 16#E0#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#03#, 16#F3#, 16#E0#, 16#7F#, 16#DF#, 16#87#, 16#FF#, 16#FC#, 16#7F#, 16#FF#, 16#E7#, 16#E0#, 16#FC#, 16#7C#, 16#03#, 16#E3#, 16#C0#, 16#0F#, 16#1E#, 16#00#, 16#78#, 16#F0#, 16#03#, 16#C7#, 16#80#, 16#1E#, 16#3E#, 16#01#, 16#F0#, 16#FC#, 16#1F#, 16#83#, 16#FF#, 16#FC#, 16#1F#, 16#FF#, 16#E0#, 16#3F#, 16#EF#, 16#00#, 16#7E#, 16#78#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#3F#, 16#E0#, 16#01#, 16#FF#, 16#80#, 16#0F#, 16#FC#, 16#00#, 16#3F#, 16#C0#, 16#7E#, 16#1E#, 16#7F#, 16#3F#, 16#FF#, 16#BF#, 16#FF#, 16#FF#, 16#F1#, 16#FE#, 16#00#, 16#FC#, 16#00#, 16#7C#, 16#00#, 16#3C#, 16#00#, 16#1E#, 16#00#, 16#0F#, 16#00#, 16#07#, 16#80#, 16#03#, 16#C0#, 16#0F#, 16#FF#, 16#87#, 16#FF#, 16#C3#, 16#FF#, 16#E1#, 16#FF#, 16#E0#, 16#07#, 16#E6#, 16#1F#, 16#FE#, 16#7F#, 16#FE#, 16#7F#, 16#FE#, 16#78#, 16#1E#, 16#78#, 16#0E#, 16#7F#, 16#E0#, 16#3F#, 16#FC#, 16#03#, 16#FE#, 16#60#, 16#1F#, 16#E0#, 16#0F#, 16#F8#, 16#1F#, 16#FF#, 16#FF#, 16#FF#, 16#FE#, 16#7F#, 16#FC#, 16#07#, 16#E0#, 16#0C#, 16#00#, 16#0F#, 16#00#, 16#07#, 16#80#, 16#03#, 16#C0#, 16#01#, 16#E0#, 16#07#, 16#FF#, 16#F3#, 16#FF#, 16#F9#, 16#FF#, 16#FC#, 16#FF#, 16#FC#, 16#0F#, 16#00#, 16#07#, 16#80#, 16#03#, 16#C0#, 16#01#, 16#E0#, 16#00#, 16#F0#, 16#00#, 16#78#, 16#00#, 16#3C#, 16#00#, 16#1E#, 16#07#, 16#8F#, 16#FF#, 16#C3#, 16#FF#, 16#C1#, 16#FF#, 16#C0#, 16#3F#, 16#80#, 16#FC#, 16#1F#, 16#BF#, 16#0F#, 16#EF#, 16#C3#, 16#FB#, 16#F0#, 16#FE#, 16#3C#, 16#07#, 16#8F#, 16#01#, 16#E3#, 16#C0#, 16#78#, 16#F0#, 16#1E#, 16#3C#, 16#07#, 16#8F#, 16#01#, 16#E3#, 16#C0#, 16#78#, 16#F8#, 16#7E#, 16#3F#, 16#FF#, 16#C7#, 16#FF#, 16#F0#, 16#FF#, 16#7C#, 16#0F#, 16#9E#, 16#7F#, 16#07#, 16#F7#, 16#FC#, 16#7F#, 16#FF#, 16#E3#, 16#FE#, 16#FE#, 16#0F#, 16#E1#, 16#E0#, 16#3C#, 16#0F#, 16#01#, 16#E0#, 16#3C#, 16#1E#, 16#01#, 16#E0#, 16#F0#, 16#07#, 16#8F#, 16#00#, 16#3E#, 16#78#, 16#00#, 16#F7#, 16#80#, 16#07#, 16#FC#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#FE#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#1F#, 16#00#, 16#7E#, 16#03#, 16#F7#, 16#F8#, 16#3F#, 16#FF#, 16#C1#, 16#FE#, 16#FC#, 16#07#, 16#F3#, 16#C7#, 16#0F#, 16#1E#, 16#7C#, 16#F0#, 16#73#, 16#E7#, 16#83#, 16#9F#, 16#7C#, 16#1F#, 16#FF#, 16#C0#, 16#FF#, 16#FE#, 16#03#, 16#F7#, 16#F0#, 16#1F#, 16#BF#, 16#80#, 16#FC#, 16#F8#, 16#07#, 16#C7#, 16#C0#, 16#1E#, 16#3E#, 16#00#, 16#E0#, 16#E0#, 16#7E#, 16#0F#, 16#DF#, 16#E3#, 16#FF#, 16#FC#, 16#7F#, 16#BF#, 16#07#, 16#E1#, 16#F1#, 16#F0#, 16#1F#, 16#FC#, 16#01#, 16#FF#, 16#00#, 16#1F#, 16#C0#, 16#03#, 16#F8#, 16#01#, 16#FF#, 16#C0#, 16#7E#, 16#FC#, 16#1F#, 16#8F#, 16#C7#, 16#E0#, 16#FD#, 16#FE#, 16#3F#, 16#FF#, 16#C7#, 16#FF#, 16#F0#, 16#7F#, 16#7E#, 16#0F#, 16#DF#, 16#E3#, 16#FF#, 16#FC#, 16#7F#, 16#BF#, 16#07#, 16#E3#, 16#C0#, 16#78#, 16#7C#, 16#0E#, 16#07#, 16#83#, 16#C0#, 16#78#, 16#70#, 16#0F#, 16#1E#, 16#00#, 16#E3#, 16#80#, 16#1E#, 16#F0#, 16#01#, 16#DC#, 16#00#, 16#3F#, 16#80#, 16#03#, 16#E0#, 16#00#, 16#7C#, 16#00#, 16#07#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#38#, 16#00#, 16#0F#, 16#00#, 16#3F#, 16#F0#, 16#0F#, 16#FF#, 16#01#, 16#FF#, 16#E0#, 16#1F#, 16#F8#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#F9#, 16#C7#, 16#C0#, 16#3E#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#78#, 16#03#, 16#C0#, 16#1E#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#03#, 16#81#, 16#F0#, 16#FC#, 16#7E#, 16#1F#, 16#07#, 16#81#, 16#E0#, 16#78#, 16#1E#, 16#07#, 16#81#, 16#E0#, 16#F8#, 16#FC#, 16#3E#, 16#0F#, 16#83#, 16#F0#, 16#3E#, 16#07#, 16#81#, 16#E0#, 16#78#, 16#1E#, 16#07#, 16#81#, 16#F0#, 16#7E#, 16#0F#, 16#C3#, 16#F0#, 16#38#, 16#6F#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#F0#, 16#70#, 16#3E#, 16#0F#, 16#C1#, 16#F8#, 16#3E#, 16#07#, 16#81#, 16#E0#, 16#78#, 16#1E#, 16#07#, 16#81#, 16#E0#, 16#7C#, 16#0F#, 16#C1#, 16#F0#, 16#7C#, 16#3F#, 16#1F#, 16#07#, 16#81#, 16#E0#, 16#78#, 16#1E#, 16#07#, 16#83#, 16#E1#, 16#F8#, 16#FC#, 16#3F#, 16#07#, 16#00#, 16#1E#, 16#00#, 16#1F#, 16#C0#, 16#1F#, 16#F0#, 16#DF#, 16#FC#, 16#FF#, 16#3F#, 16#FB#, 16#0F#, 16#F8#, 16#03#, 16#F8#, 16#00#, 16#78#); FreeMonoBold18pt7bGlyphs : aliased constant Glyph_Array := ( (0, 0, 0, 21, 0, 1), -- 0x20 ' ' (0, 5, 22, 21, 8, -21), -- 0x21 '!' (14, 11, 10, 21, 5, -20), -- 0x22 '"' (28, 16, 25, 21, 3, -22), -- 0x23 '#' (78, 14, 28, 21, 4, -23), -- 0x24 '$' (127, 15, 21, 21, 3, -20), -- 0x25 '%' (167, 15, 20, 21, 3, -19), -- 0x26 '&' (205, 4, 10, 21, 8, -20), -- 0x27 ''' (210, 8, 27, 21, 9, -21), -- 0x28 '(' (237, 8, 27, 21, 4, -21), -- 0x29 ')' (264, 16, 15, 21, 3, -21), -- 0x2A '*' (294, 16, 19, 21, 3, -18), -- 0x2B '+' (332, 7, 10, 21, 5, -3), -- 0x2C ',' (341, 19, 4, 21, 1, -11), -- 0x2D '-' (351, 5, 5, 21, 8, -4), -- 0x2E '.' (355, 15, 28, 21, 3, -23), -- 0x2F '/' (408, 16, 23, 21, 3, -22), -- 0x30 '0' (454, 15, 22, 21, 3, -21), -- 0x31 '1' (496, 15, 23, 21, 3, -22), -- 0x32 '2' (540, 16, 23, 21, 3, -22), -- 0x33 '3' (586, 15, 21, 21, 3, -20), -- 0x34 '4' (626, 17, 22, 21, 2, -21), -- 0x35 '5' (673, 15, 23, 21, 4, -22), -- 0x36 '6' (717, 15, 22, 21, 3, -21), -- 0x37 '7' (759, 15, 23, 21, 3, -22), -- 0x38 '8' (803, 15, 23, 21, 4, -22), -- 0x39 '9' (847, 5, 16, 21, 8, -15), -- 0x3A ':' (857, 7, 22, 21, 5, -15), -- 0x3B ';' (877, 18, 16, 21, 1, -17), -- 0x3C '<' (913, 19, 10, 21, 1, -14), -- 0x3D '=' (937, 18, 16, 21, 2, -17), -- 0x3E '>' (973, 15, 21, 21, 4, -20), -- 0x3F '?' (1013, 15, 27, 21, 3, -21), -- 0x40 '@' (1064, 22, 21, 21, -1, -20), -- 0x41 'A' (1122, 20, 21, 21, 1, -20), -- 0x42 'B' (1175, 19, 21, 21, 1, -20), -- 0x43 'C' (1225, 18, 21, 21, 2, -20), -- 0x44 'D' (1273, 19, 21, 21, 1, -20), -- 0x45 'E' (1323, 19, 21, 21, 1, -20), -- 0x46 'F' (1373, 20, 21, 21, 1, -20), -- 0x47 'G' (1426, 21, 21, 21, 0, -20), -- 0x48 'H' (1482, 14, 21, 21, 4, -20), -- 0x49 'I' (1519, 19, 21, 21, 2, -20), -- 0x4A 'J' (1569, 20, 21, 21, 1, -20), -- 0x4B 'K' (1622, 18, 21, 21, 2, -20), -- 0x4C 'L' (1670, 23, 21, 21, -1, -20), -- 0x4D 'M' (1731, 20, 21, 21, 1, -20), -- 0x4E 'N' (1784, 20, 21, 21, 1, -20), -- 0x4F 'O' (1837, 18, 21, 21, 1, -20), -- 0x50 'P' (1885, 20, 26, 21, 1, -20), -- 0x51 'Q' (1950, 21, 21, 21, 0, -20), -- 0x52 'R' (2006, 17, 21, 21, 2, -20), -- 0x53 'S' (2051, 19, 21, 21, 1, -20), -- 0x54 'T' (2101, 21, 21, 21, 0, -20), -- 0x55 'U' (2157, 23, 21, 21, -1, -20), -- 0x56 'V' (2218, 21, 21, 21, 0, -20), -- 0x57 'W' (2274, 19, 21, 21, 1, -20), -- 0x58 'X' (2324, 20, 21, 21, 1, -20), -- 0x59 'Y' (2377, 16, 21, 21, 3, -20), -- 0x5A 'Z' (2419, 8, 27, 21, 9, -21), -- 0x5B '[' (2446, 15, 28, 21, 3, -23), -- 0x5C '\' (2499, 8, 27, 21, 4, -21), -- 0x5D ']' (2526, 15, 11, 21, 3, -21), -- 0x5E '^' (2547, 21, 4, 21, 0, 4), -- 0x5F '_' (2558, 6, 6, 21, 6, -22), -- 0x60 '`' (2563, 19, 16, 21, 1, -15), -- 0x61 'a' (2601, 19, 22, 21, 1, -21), -- 0x62 'b' (2654, 17, 16, 21, 2, -15), -- 0x63 'c' (2688, 20, 22, 21, 1, -21), -- 0x64 'd' (2743, 18, 16, 21, 1, -15), -- 0x65 'e' (2779, 16, 22, 21, 4, -21), -- 0x66 'f' (2823, 19, 23, 21, 1, -15), -- 0x67 'g' (2878, 21, 22, 21, 0, -21), -- 0x68 'h' (2936, 16, 22, 21, 3, -21), -- 0x69 'i' (2980, 12, 29, 21, 5, -21), -- 0x6A 'j' (3024, 18, 22, 21, 2, -21), -- 0x6B 'k' (3074, 16, 22, 21, 3, -21), -- 0x6C 'l' (3118, 22, 16, 21, -1, -15), -- 0x6D 'm' (3162, 20, 16, 21, 0, -15), -- 0x6E 'n' (3202, 19, 16, 21, 1, -15), -- 0x6F 'o' (3240, 21, 23, 21, 0, -15), -- 0x70 'p' (3301, 21, 23, 22, 1, -15), -- 0x71 'q' (3362, 17, 16, 21, 3, -15), -- 0x72 'r' (3396, 16, 16, 21, 3, -15), -- 0x73 's' (3428, 17, 21, 21, 1, -20), -- 0x74 't' (3473, 18, 16, 21, 1, -15), -- 0x75 'u' (3509, 21, 16, 21, 0, -15), -- 0x76 'v' (3551, 21, 16, 21, 0, -15), -- 0x77 'w' (3593, 19, 16, 21, 1, -15), -- 0x78 'x' (3631, 19, 23, 21, 1, -15), -- 0x79 'y' (3686, 14, 16, 21, 3, -15), -- 0x7A 'z' (3714, 10, 27, 21, 6, -21), -- 0x7B '{' (3748, 4, 27, 21, 9, -21), -- 0x7C '|' (3762, 10, 27, 21, 6, -21), -- 0x7D '}' (3796, 17, 8, 21, 2, -13)); -- 0x7E '~' Font_D : aliased constant Bitmap_Font := (FreeMonoBold18pt7bBitmaps'Access, FreeMonoBold18pt7bGlyphs'Access, 35); Font : constant Giza.Font.Ref_Const := Font_D'Access; end Giza.Bitmap_Fonts.FreeMonoBold18pt7b;

67.171963

73

0.4792

0b963000e2314f716cea070d0ee99926408fffde

11,167

adb

Ada

bb-runtimes/runtimes/zfp-stm32f3x4/gnat/setup_pll.adb

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/zfp-stm32f3x4/gnat/setup_pll.adb

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/zfp-stm32f3x4/gnat/setup_pll.adb

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- Copyright (C) 2012-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. -- -- -- ------------------------------------------------------------------------------ pragma Ada_2012; -- To work around pre-commit check? pragma Suppress (All_Checks); -- This initialization procedure mainly initializes the PLLs and -- all derived clocks. with Ada.Unchecked_Conversion; with Interfaces.STM32; use Interfaces, Interfaces.STM32; with Interfaces.STM32.Flash; use Interfaces.STM32.Flash; with Interfaces.STM32.RCC; use Interfaces.STM32.RCC; with System.BB.Parameters; use System.BB.Parameters; with System.BB.MCU_Parameters; with System.STM32; use System.STM32; procedure Setup_Pll is procedure Initialize_Clocks; procedure Reset_Clocks; ------------------------------ -- Clock Tree Configuration -- ------------------------------ HSE_Enabled : constant Boolean := True; -- use high-speed ext. clock HSE_Bypass : constant Boolean := False; -- bypass osc. with ext. clock LSI_Enabled : constant Boolean := True; -- use low-speed internal clock Activate_PLL : constant Boolean := True; ----------------------- -- Initialize_Clocks -- ----------------------- procedure Initialize_Clocks is ------------------------------- -- Compute Clock Frequencies -- ------------------------------- PLLCLKIN : constant Integer := (if HSE_Enabled then 8_000_000 else HSICLK / 2); -- PLL input clock value PREDIV_Value : constant Integer := HSE_Clock / PLLCLKIN; -- First HSE clock divider is set to produce a 8Mhz clock pragma Compile_Time_Error (Activate_PLL and PREDIV_Value not in PREDIV_Range, "Invalid PLL PREDIV clock configuration value"); PLLMUL_Value : constant Integer := Clock_Frequency / PLLCLKIN; -- Compute PLLMUL to generate the required frequency pragma Compile_Time_Error (Activate_PLL and PLLMUL_Value not in PLLMUL_Range, "Invalid PLLMul clock configuration value"); PLLCLKOUT : constant Integer := PLLMUL_Value * PLLCLKIN; PREDIV : constant CFGR2_PREDIV_Field := (if Activate_PLL and HSE_Enabled then UInt4 (PREDIV_Value - 1) else 0); PLLMUL : constant CFGR_PLLMUL_Field := (if Activate_PLL then UInt4 (PLLMUL_Value - 2) else 0); SW : constant SYSCLK_Source := (if Activate_PLL then SYSCLK_SRC_PLL else (if HSE_Enabled then SYSCLK_SRC_HSE else SYSCLK_SRC_HSI)); SW_Value : constant CFGR_SW_Field := SYSCLK_Source'Enum_Rep (SW); SYSCLK : constant Integer := (if Activate_PLL then PLLCLKOUT else (if HSE_Enabled then HSE_Clock else HSICLK)); HCLK : constant Integer := (if not AHB_PRE.Enabled then SYSCLK else (case AHB_PRE.Value is when DIV2 => SYSCLK / 2, when DIV4 => SYSCLK / 4, when DIV8 => SYSCLK / 8, when DIV16 => SYSCLK / 16, when DIV64 => SYSCLK / 64, when DIV128 => SYSCLK / 128, when DIV256 => SYSCLK / 256, when DIV512 => SYSCLK / 512)); PCLK1 : constant Integer := (if not APB1_PRE.Enabled then HCLK else (case APB1_PRE.Value is when DIV2 => HCLK / 2, when DIV4 => HCLK / 4, when DIV8 => HCLK / 8, when DIV16 => HCLK / 16)); PCLK2 : constant Integer := (if not APB2_PRE.Enabled then HCLK else (case APB2_PRE.Value is when DIV2 => HCLK / 2, when DIV4 => HCLK / 4, when DIV8 => HCLK / 8, when DIV16 => HCLK / 16)); function To_AHB is new Ada.Unchecked_Conversion (AHB_Prescaler, UInt4); function To_APB is new Ada.Unchecked_Conversion (APB_Prescaler, UInt3); begin -- Check configuration pragma Compile_Time_Error ((Activate_PLL and PLLCLKOUT not in PLLOUT_Range), "Invalid clock configuration"); pragma Compile_Time_Error (SYSCLK /= Clock_Frequency, "Cannot generate requested clock"); -- Cannot be checked at compile time, depends on APB1_PRE and APB2_PRE pragma Assert (HCLK not in HCLK_Range or else PCLK1 not in PCLK1_Range or else PCLK2 not in PCLK2_Range, "Invalid AHB/APB prescalers configuration"); -- PWR clock enable RCC_Periph.APB1ENR.PWREN := 1; -- Reset the power interface RCC_Periph.APB1RSTR.PWRRST := 1; RCC_Periph.APB1RSTR.PWRRST := 0; -- PWR initialization -- Select higher supply power for stable operation at max. freq. -- See table "General operating conditions" of the STM32 datasheets -- to obtain the maximal operating frequency depending on the power -- scaling mode and the over-drive mode System.BB.MCU_Parameters.PWR_Initialize; if not HSE_Enabled then -- Setup high-speed internal clock and wait for HSI stabilisation. RCC_Periph.CR.HSION := 1; loop exit when RCC_Periph.CR.HSIRDY = 1; end loop; else -- Configure high-speed external clock, if enabled RCC_Periph.CR.HSEBYP := (if HSE_Bypass then 1 else 0); -- Enable security for HSERDY RCC_Periph.CR.CSSON := 1; -- Setup high-speed external clock and wait for HSE stabilisation. RCC_Periph.CR.HSEON := 1; loop exit when RCC_Periph.CR.HSERDY = 1; end loop; end if; if LSI_Enabled then -- Setup low-speed internal clock and wait for stabilization. RCC_Periph.CSR.LSION := 1; loop exit when RCC_Periph.CSR.LSIRDY = 1; end loop; end if; -- Activate PLL if enabled if Activate_PLL then -- Disable the main PLL before configuring it RCC_Periph.CR.PLLON := 0; -- Configure the PLL clock source, multiplication and division -- factors RCC_Periph.CFGR2.PREDIV := PREDIV; RCC_Periph.CFGR := (PLLMUL => PLLMUL, PLLSRC => (if HSE_Enabled then 1 -- PLL_Source'Enum_Rep (PLL_SRC_HSE) else 0), -- PLL_Source'Enum_Rep (PLL_SRC_HSI) others => <>); -- Setup PLL and wait for stabilization. RCC_Periph.CR.PLLON := 1; loop exit when RCC_Periph.CR.PLLRDY = 1; end loop; end if; -- Configure flash -- Must be done before increasing the frequency, otherwise the CPU -- won't be able to fetch new instructions. if HCLK in FLASH_Latency_0 then FLASH_Latency := FWS0'Enum_Rep; elsif HCLK in FLASH_Latency_1 then FLASH_Latency := FWS1'Enum_Rep; elsif HCLK in FLASH_Latency_2 then FLASH_Latency := FWS2'Enum_Rep; end if; Flash_Periph.ACR := (LATENCY => FLASH_Latency, PRFTBE => 1, others => <>); -- Configure derived clocks RCC_Periph.CFGR := (SW => SW_Value, HPRE => To_AHB (AHB_PRE), PPRE => (As_Array => True, Arr => (1 => To_APB (APB1_PRE), 2 => To_APB (APB2_PRE))), -- Microcontroller clock output MCO => MCOSEL_HSI'Enum_Rep, MCOPRE => MCOPRE_DIV1'Enum_Rep, others => <>); -- Test system clock switch status case SW is when SYSCLK_SRC_PLL => loop exit when RCC_Periph.CFGR.SWS = SYSCLK_SRC_PLL'Enum_Rep; end loop; when SYSCLK_SRC_HSE => loop exit when RCC_Periph.CFGR.SWS = SYSCLK_SRC_HSE'Enum_Rep; end loop; when SYSCLK_SRC_HSI => loop exit when RCC_Periph.CFGR.SWS = SYSCLK_SRC_HSI'Enum_Rep; end loop; end case; end Initialize_Clocks; ------------------ -- Reset_Clocks -- ------------------ procedure Reset_Clocks is begin -- Switch on high speed internal clock RCC_Periph.CR.HSION := 1; -- Reset CFGR regiser RCC_Periph.CFGR := (others => <>); -- Reset HSEON, CSSON and PLLON bits RCC_Periph.CR.HSEON := 0; RCC_Periph.CR.CSSON := 0; RCC_Periph.CR.PLLON := 0; -- Reset PLL configuration register RCC_Periph.CFGR2 := (PREDIV => 0, others => <>); -- Reset HSE bypass bit RCC_Periph.CR.HSEBYP := 0; -- Disable all interrupts RCC_Periph.CIR := (others => <>); end Reset_Clocks; begin Reset_Clocks; Initialize_Clocks; end Setup_Pll;

37.099668

78

0.526014

1ddde4a386bbc1cf0616ea53e87141268a075a18

2,856

ads

Ada

source/asis/asis-gela-normalizer.ads

faelys/gela-asis

48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253

[ "BSD-3-Clause" ]

4

2016-02-05T15:51:56.000Z

2022-03-25T20:38:32.000Z

source/asis/asis-gela-normalizer.ads

faelys/gela-asis

48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253

[ "BSD-3-Clause" ]

null

source/asis/asis-gela-normalizer.ads

faelys/gela-asis

48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- G E L A A S I S -- -- ASIS implementation for Gela project, a portable Ada compiler -- -- http://gela.ada-ru.org -- -- - - - - - - - - - - - - - - - -- -- Read copyright and license at the end of this file -- ------------------------------------------------------------------------------ -- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $ -- Purpose: -- Process AST to fix simplified parsing. -- Populate AST with easy calculable attributes. package Asis.Gela.Normalizer is procedure Run (Unit : Asis.Compilation_Unit); procedure Normalize_Pragma (Element : Asis.Pragma_Element; Unit : Asis.Compilation_Unit); private type State_Information is record Parent : Asis.Element; Unit : Asis.Compilation_Unit; end record; end Asis.Gela.Normalizer; ------------------------------------------------------------------------------ -- Copyright (c) 2006-2013, Maxim Reznik -- All rights reserved. -- -- Redistribution and use in source and binary forms, with or without -- modification, are permitted provided that the following conditions are met: -- -- * Redistributions of source code must retain the above copyright notice, -- this list of conditions and the following disclaimer. -- * Redistributions in binary form must reproduce the above copyright -- notice, this list of conditions and the following disclaimer in the -- documentation and/or other materials provided with the distribution. -- * Neither the name of the Maxim Reznik, IE nor the names of its -- contributors may be used to endorse or promote products derived from -- this software without specific prior written permission. -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" -- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE -- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE -- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR -- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF -- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS -- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN -- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) -- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE -- POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------

48.40678

79

0.593137

fb1b4c9bab487985f606765f8ca883ca3bfa7dbf

2,299

ads

Ada

courses/spark_for_ada_programmers/labs/answers/070_type_contracts/important_dates.ads

AdaCore/training_material

6651eb2c53f8c39649b8e0b3c757bc8ff963025a

[ "CC-BY-4.0" ]

15

2020-10-07T08:56:45.000Z

2022-02-08T23:13:22.000Z

courses/spark_for_ada_programmers/labs/answers/070_type_contracts/important_dates.ads

AdaCore/training_material

6651eb2c53f8c39649b8e0b3c757bc8ff963025a

[ "CC-BY-4.0" ]

20

2020-11-05T14:35:20.000Z

2022-01-13T15:59:33.000Z

courses/spark_for_ada_programmers/labs/answers/070_type_contracts/important_dates.ads

AdaCore/training_material

6651eb2c53f8c39649b8e0b3c757bc8ff963025a

[ "CC-BY-4.0" ]

6

2020-10-08T15:57:06.000Z

2021-08-31T12:03:08.000Z

with Ada.Strings.Unbounded; use Ada.Strings.Unbounded; package Important_Dates with SPARK_Mode => On is function Leap_Year (Year : Positive) return Boolean is ((Year mod 4 = 0 and then Year mod 100 /= 0) or else (Year mod 400 = 0)); function Valid_Date (Year : Positive; Month : Positive; Day : Positive) return Boolean is (case Month is when 4 | 6 | 9 | 11 => Day <= 30, when 2 => (if Leap_Year (Year) then Day <= 28 else Day <= 29), when others => Day <= 31); type Date_T is record Year : Positive := Positive'First; Month : Positive := Positive'First; Day : Positive := Positive'First; end record with Dynamic_Predicate => Valid_Date (Date_T.Year, Date_T.Month, Date_T.Day); function "=" (L, R : Date_T) return Boolean; type Calendar_T is private; function Is_Full (Calendar : Calendar_T) return Boolean with Ghost; procedure Add_Event (Calendar : in out Calendar_T; Description : String; Date : Date_T) with Pre => not Is_Full (Calendar); procedure Remove_Event (Calendar : in out Calendar_T; Description : String; Date : Date_T); procedure Print_Events (Calendar : Calendar_T; Number_Of_Events : Positive; Date : Date_T); private type Event_T is record Description : Unbounded_String := To_Unbounded_String (""); Date : Date_T; end record; function ">=" (L, R : Event_T) return Boolean; subtype Count_T is Integer range 0 .. 1_000; subtype Index_T is Integer range 1 .. 1_000; type Event_List_T is array (Index_T) of Event_T; function Is_Sorted (List : Event_List_T; Used : Count_T) return Boolean is (for all K in List'First .. List'First + Used - 1 => K = List'First or else List (K) >= List (K - 1)); type Calendar_T is record List : Event_List_T; In_Use : Count_T := 0; end record with Type_Invariant => Is_Sorted (Calendar_T.List, Calendar_T.In_Use); function Is_Full (Calendar : Calendar_T) return Boolean is (Calendar.In_Use = Calendar.List'Length); end Important_Dates;

27.369048

78

0.604176

12f140320e5ac43697b9312315d0a2281578d2fc

3,199

adb

Ada

processor/processor-eagle_decimal_p.adb

SMerrony/dgemua

138b09f814c3576e45fe8d25303a6c2329999757

[ "MIT" ]

2

2021-03-26T08:25:38.000Z

2021-06-08T03:10:12.000Z

processor/processor-eagle_decimal_p.adb

SMerrony/dgemua

138b09f814c3576e45fe8d25303a6c2329999757

[ "MIT" ]

null

processor/processor-eagle_decimal_p.adb

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 Ada.Text_IO; use Ada.Text_IO; with Debug_Logs; use Debug_Logs; with Resolver; use Resolver; package body Processor.Eagle_Decimal_P is procedure Do_Eagle_Decimal (I : in Decoded_Instr_T; CPU : in out CPU_T) is begin case I.Word_2 is when 0 => raise Execution_Failure with "ERROR: WDMOV Not Yet Implemented"; when 1 => -- WDCMP -- Short-circuit certain equality if (CPU.AC(0) = CPU.AC(1) and (CPU.AC(2) = CPU.AC(3))) then CPU.AC(1) := 0; else declare SF_1, SF_2 : Integer_8; Type_1, Type_2 : Natural; Size_1, Size_2 : Natural; Dec_US_1, Dec_US_2 : Unbounded_String; begin Decode_Dec_Data_Type (CPU.AC(0), SF_1, Type_1, Size_1); Decode_Dec_Data_Type (CPU.AC(1), SF_2, Type_2, Size_2); Dec_US_1 := Read_Decimal(CPU.AC(2), Size_1); Dec_US_2 := Read_Decimal(CPU.AC(3), Size_2); Loggers.Debug_Print (Debug_Log, "... Arg 1 Type: " & Type_1'Image & " String: " & To_String(Dec_US_1) & " Length:" & Size_1'Image); Loggers.Debug_Print (Debug_Log, "... Arg 2 Type: " & Type_2'Image & " String: " & To_String(Dec_US_2) & " Length:" & Size_2'Image); raise Execution_Failure with "ERROR: WDCMP not fully implemented"; end; end if; when 2 => raise Execution_Failure with "ERROR: WDINC Not Yet Implemented"; when 3 => raise Execution_Failure with "ERROR: WDDEC Not Yet Implemented"; when others => Put_Line ("ERROR: EAGLE_DECIMAL instruction " & To_String(I.Mnemonic) & " not yet implemented"); raise Execution_Failure with "ERROR: EAGLE_DECIMAL instruction " & To_String(I.Mnemonic) & " not yet implemented"; end case; CPU.PC := CPU.PC + Phys_Addr_T(I.Instr_Len); end Do_Eagle_Decimal; end Processor.Eagle_Decimal_P;

49.215385

149

0.639887

062728aaefb0cb206ea5bee0280c1078eba50784

11,727

adb

Ada

hls_cmd_line_testing/cmd_line_proj/hls_sin_proj/solution1/.autopilot/db/Block_sin_taylor_ser.sched.adb

benjmarshall/hls_scratchpad

d57b22ac4cca28b8b331150feb4d1f9c0697d6ff

[ "MIT" ]

1

2017-11-17T00:25:21.000Z

hls_cmd_line_testing/cmd_line_proj/hls_sin_proj/solution1/.autopilot/db/Block_sin_taylor_ser.sched.adb

benjmarshall/hls_scratchpad

d57b22ac4cca28b8b331150feb4d1f9c0697d6ff

[ "MIT" ]

null

hls_cmd_line_testing/cmd_line_proj/hls_sin_proj/solution1/.autopilot/db/Block_sin_taylor_ser.sched.adb

benjmarshall/hls_scratchpad

d57b22ac4cca28b8b331150feb4d1f9c0697d6ff

[ "MIT" ]

null

<?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="14"> <syndb class_id="0" tracking_level="0" version="0"> <userIPLatency>-1</userIPLatency> <userIPName></userIPName> <cdfg class_id="1" tracking_level="1" version="0" object_id="_0"> <name>Block_sin_taylor_ser</name> <ret_bitwidth>64</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>p_read</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo class_id="6" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs class_id="7" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_2"> <Value> <Obj> <type>1</type> <id>2</id> <name>p_read1</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> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> </ports> <nodes class_id="8" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_3"> <Value> <Obj> <type>0</type> <id>3</id> <name>p_read_2</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>9</item> <item>10</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_4"> <Value> <Obj> <type>0</type> <id>4</id> <name>p_read_3</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> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>11</item> <item>12</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_5"> <Value> <Obj> <type>0</type> <id>5</id> <name>tmp_loc</name> <fileName>../source_files/src/dut.cpp</fileName> <fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</fileDirectory> <lineNumber>36</lineNumber> <contextFuncName>sin_taylor_series</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="11" tracking_level="0" version="0"> <first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</first> <second class_id="12" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="13" tracking_level="0" version="0"> <first class_id="14" tracking_level="0" version="0"> <first>../source_files/src/dut.cpp</first> <second>sin_taylor_series</second> </first> <second>36</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>13</item> <item>14</item> </oprand_edges> <opcode>dsub</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_6"> <Value> <Obj> <type>0</type> <id>6</id> <name></name> <fileName>../source_files/src/dut.cpp</fileName> <fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</fileDirectory> <lineNumber>36</lineNumber> <contextFuncName>sin_taylor_series</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../source_files/src/dut.cpp</first> <second>sin_taylor_series</second> </first> <second>36</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>15</item> </oprand_edges> <opcode>ret</opcode> <m_Display>0</m_Display> </item> </nodes> <consts class_id="15" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </consts> <blocks class_id="16" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="17" tracking_level="1" version="0" object_id="_7"> <Obj> <type>3</type> <id>7</id> <name>Block_sin_taylor_ser</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>4</count> <item_version>0</item_version> <item>3</item> <item>4</item> <item>5</item> <item>6</item> </node_objs> </item> </blocks> <edges class_id="18" tracking_level="0" version="0"> <count>5</count> <item_version>0</item_version> <item class_id="19" tracking_level="1" version="0" object_id="_8"> <id>10</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>3</sink_obj> </item> <item class_id_reference="19" object_id="_9"> <id>12</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>4</sink_obj> </item> <item class_id_reference="19" object_id="_10"> <id>13</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>5</sink_obj> </item> <item class_id_reference="19" object_id="_11"> <id>14</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>5</sink_obj> </item> <item class_id_reference="19" object_id="_12"> <id>15</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>6</sink_obj> </item> </edges> </cdfg> <cdfg_regions class_id="20" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="21" tracking_level="1" version="0" object_id="_13"> <mId>1</mId> <mTag>Block_sin_taylor_ser</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>1</count> <item_version>0</item_version> <item>7</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>4</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> </cdfg_regions> <fsm class_id="-1"></fsm> <res class_id="-1"></res> <node_label_latency class_id="25" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="26" tracking_level="0" version="0"> <first>3</first> <second class_id="27" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>4</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>5</first> <second> <first>0</first> <second>4</second> </second> </item> <item> <first>6</first> <second> <first>4</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="28" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="29" tracking_level="0" version="0"> <first>7</first> <second class_id="30" tracking_level="0" version="0"> <first>0</first> <second>4</second> </second> </item> </bblk_ent_exit> <regions class_id="31" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </regions> <dp_fu_nodes class_id="32" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_fu_nodes> <dp_fu_nodes_expression class_id="33" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_fu_nodes_expression> <dp_fu_nodes_module> <count>0</count> <item_version>0</item_version> </dp_fu_nodes_module> <dp_fu_nodes_io> <count>0</count> <item_version>0</item_version> </dp_fu_nodes_io> <return_ports> <count>0</count> <item_version>0</item_version> </return_ports> <dp_mem_port_nodes class_id="34" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_mem_port_nodes> <dp_reg_nodes> <count>0</count> <item_version>0</item_version> </dp_reg_nodes> <dp_regname_nodes> <count>0</count> <item_version>0</item_version> </dp_regname_nodes> <dp_reg_phi> <count>0</count> <item_version>0</item_version> </dp_reg_phi> <dp_regname_phi> <count>0</count> <item_version>0</item_version> </dp_regname_phi> <dp_port_io_nodes class_id="35" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_port_io_nodes> <port2core class_id="36" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </port2core> <node2core> <count>0</count> <item_version>0</item_version> </node2core> </syndb> </boost_serialization>

28.189904

120

0.629317

a15d2027e4b44afd44ce27c5b2166e13640dfa56

4,385

ads

Ada

src/gen/gstreamer-gst_low_level-gstreamer_0_10_gst_riff_riff_media_h.ads

persan/A-gst

7a39693d105617adea52680424c862a1a08f7368

[ "Apache-2.0" ]

1

2018-01-18T00:51:00.000Z

src/gen/gstreamer-gst_low_level-gstreamer_0_10_gst_riff_riff_media_h.ads

persan/A-gst

7a39693d105617adea52680424c862a1a08f7368

[ "Apache-2.0" ]

null

src/gen/gstreamer-gst_low_level-gstreamer_0_10_gst_riff_riff_media_h.ads

persan/A-gst

7a39693d105617adea52680424c862a1a08f7368

[ "Apache-2.0" ]

null

pragma Ada_2005; pragma Style_Checks (Off); pragma Warnings (Off); with Interfaces.C; use Interfaces.C; with GLIB; -- with GStreamer.GST_Low_Level.glibconfig_h; limited with GStreamer.GST_Low_Level.gstreamer_0_10_gst_riff_riff_ids_h; limited with GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstbuffer_h; with System; limited with GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstcaps_h; package GStreamer.GST_Low_Level.gstreamer_0_10_gst_riff_riff_media_h is -- GStreamer RIFF I/O -- * Copyright (C) 2003 Ronald Bultje <[email protected]> -- * -- * riff-media.h: RIFF-id to/from caps routines -- * -- * This library is free software; you can redistribute it and/or -- * modify it under the terms of the GNU Library General Public -- * License as published by the Free Software Foundation; either -- * version 2 of the License, or (at your option) any later version. -- * -- * This library is distributed in the hope that it will be useful, -- * but WITHOUT ANY WARRANTY; without even the implied warranty of -- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -- * Library General Public License for more details. -- * -- * You should have received a copy of the GNU Library General Public -- * License along with this library; if not, write to the -- * Free Software Foundation, Inc., 59 Temple Place - Suite 330, -- * Boston, MA 02111-1307, USA. -- -- * Create caos. strh/strf, strf/strd_data and codec_name can be NULL. -- function gst_riff_create_video_caps (codec_fcc : GLIB.guint32; strh : access GStreamer.GST_Low_Level.gstreamer_0_10_gst_riff_riff_ids_h.gst_riff_strh; strf : access GStreamer.GST_Low_Level.gstreamer_0_10_gst_riff_riff_ids_h.gst_riff_strf_vids; strf_data : access GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstbuffer_h.GstBuffer; strd_data : access GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstbuffer_h.GstBuffer; codec_name : System.Address) return access GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstcaps_h.GstCaps; -- gst/riff/riff-media.h:35 pragma Import (C, gst_riff_create_video_caps, "gst_riff_create_video_caps"); function gst_riff_create_audio_caps (codec_id : GLIB.guint16; strh : access GStreamer.GST_Low_Level.gstreamer_0_10_gst_riff_riff_ids_h.gst_riff_strh; strf : access GStreamer.GST_Low_Level.gstreamer_0_10_gst_riff_riff_ids_h.gst_riff_strf_auds; strf_data : access GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstbuffer_h.GstBuffer; strd_data : access GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstbuffer_h.GstBuffer; codec_name : System.Address) return access GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstcaps_h.GstCaps; -- gst/riff/riff-media.h:42 pragma Import (C, gst_riff_create_audio_caps, "gst_riff_create_audio_caps"); function gst_riff_create_iavs_caps (codec_fcc : GLIB.guint32; strh : access GStreamer.GST_Low_Level.gstreamer_0_10_gst_riff_riff_ids_h.gst_riff_strh; strf : access GStreamer.GST_Low_Level.gstreamer_0_10_gst_riff_riff_ids_h.gst_riff_strf_iavs; strf_data : access GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstbuffer_h.GstBuffer; strd_data : access GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstbuffer_h.GstBuffer; codec_name : System.Address) return access GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstcaps_h.GstCaps; -- gst/riff/riff-media.h:49 pragma Import (C, gst_riff_create_iavs_caps, "gst_riff_create_iavs_caps"); -- * Create template caps (includes all known types). -- function gst_riff_create_video_template_caps return access GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstcaps_h.GstCaps; -- gst/riff/riff-media.h:59 pragma Import (C, gst_riff_create_video_template_caps, "gst_riff_create_video_template_caps"); function gst_riff_create_audio_template_caps return access GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstcaps_h.GstCaps; -- gst/riff/riff-media.h:60 pragma Import (C, gst_riff_create_audio_template_caps, "gst_riff_create_audio_template_caps"); function gst_riff_create_iavs_template_caps return access GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstcaps_h.GstCaps; -- gst/riff/riff-media.h:61 pragma Import (C, gst_riff_create_iavs_template_caps, "gst_riff_create_iavs_template_caps"); end GStreamer.GST_Low_Level.gstreamer_0_10_gst_riff_riff_media_h;

56.217949

152

0.792702

1dba791b86c33d7a2cc5815c4f04c339f462f872

5,217

ads

Ada

src/statements/adabase-statement-base-sqlite.ads

jrmarino/AdaBase

660f278613773dc4007c8b3fab21bcfddc1828b3

[ "0BSD" ]

30

2016-02-21T11:09:30.000Z

2021-12-08T14:12:32.000Z

src/statements/adabase-statement-base-sqlite.ads

jrmarino/AdaBase

660f278613773dc4007c8b3fab21bcfddc1828b3

[ "0BSD" ]

3

2018-10-29T18:44:48.000Z

2022-03-12T23:14:20.000Z

src/statements/adabase-statement-base-sqlite.ads

jrmarino/AdaBase

660f278613773dc4007c8b3fab21bcfddc1828b3

[ "0BSD" ]

3

2015-04-22T12:17:27.000Z

2017-01-19T14:29:59.000Z

-- This file is covered by the Internet Software Consortium (ISC) License -- Reference: ../../License.txt with AdaBase.Connection.Base.SQLite; with AdaBase.Bindings.SQLite; with Ada.Containers.Vectors; package AdaBase.Statement.Base.SQLite is package ACS renames AdaBase.Connection.Base.SQLite; package BND renames AdaBase.Bindings.SQLite; package AC renames Ada.Containers; type SQLite_statement (type_of_statement : Stmt_Type; log_handler : ALF.LogFacility_access; sqlite_conn : ACS.SQLite_Connection_Access; initial_sql : SQL_Access; con_error_mode : Error_Modes; con_case_mode : Case_Modes; con_max_blob : BLOB_Maximum) is new Base_Statement and AIS.iStatement with private; type SQLite_statement_access is access all SQLite_statement; overriding function column_count (Stmt : SQLite_statement) return Natural; overriding function last_insert_id (Stmt : SQLite_statement) return Trax_ID; overriding function last_sql_state (Stmt : SQLite_statement) return SQL_State; overriding function last_driver_code (Stmt : SQLite_statement) return Driver_Codes; overriding function last_driver_message (Stmt : SQLite_statement) return String; overriding procedure discard_rest (Stmt : out SQLite_statement); overriding function execute (Stmt : out SQLite_statement) return Boolean; overriding function execute (Stmt : out SQLite_statement; parameters : String; delimiter : Character := '|') return Boolean; overriding function rows_returned (Stmt : SQLite_statement) return Affected_Rows; overriding function column_name (Stmt : SQLite_statement; index : Positive) return String; overriding function column_table (Stmt : SQLite_statement; index : Positive) return String; overriding function column_native_type (Stmt : SQLite_statement; index : Positive) return field_types; overriding function fetch_next (Stmt : out SQLite_statement) return ARS.Datarow; overriding function fetch_all (Stmt : out SQLite_statement) return ARS.Datarow_Set; overriding function fetch_bound (Stmt : out SQLite_statement) return Boolean; overriding procedure fetch_next_set (Stmt : out SQLite_statement; data_present : out Boolean; data_fetched : out Boolean); private type column_info is record table : CT.Text; field_name : CT.Text; field_type : field_types; null_possible : Boolean; sqlite_type : BND.enum_field_types; end record; type sqlite_canvas is record buffer_binary : BND.ICS.char_array_access := null; buffer_text : BND.ICS.chars_ptr := BND.ICS.Null_Ptr; end record; type step_result_type is (unset, data_pulled, progam_complete, error_seen); package VColumns is new AC.Vectors (Index_Type => Positive, Element_Type => column_info); package VCanvas is new AC.Vectors (Index_Type => Positive, Element_Type => sqlite_canvas); type SQLite_statement (type_of_statement : Stmt_Type; log_handler : ALF.LogFacility_access; sqlite_conn : ACS.SQLite_Connection_Access; initial_sql : SQL_Access; con_error_mode : Error_Modes; con_case_mode : Case_Modes; con_max_blob : BLOB_Maximum) is new Base_Statement and AIS.iStatement with record stmt_handle : aliased BND.sqlite3_stmt_Access := null; step_result : step_result_type := unset; assign_counter : Natural := 0; num_columns : Natural := 0; column_info : VColumns.Vector; bind_canvas : VCanvas.Vector; sql_final : SQL_Access; end record; procedure log_problem (statement : SQLite_statement; category : Log_Category; message : String; pull_codes : Boolean := False; break : Boolean := False); procedure initialize (Object : in out SQLite_statement); procedure Adjust (Object : in out SQLite_statement); procedure finalize (Object : in out SQLite_statement); procedure scan_column_information (Stmt : out SQLite_statement); procedure reclaim_canvas (Stmt : out SQLite_statement); function seems_like_bit_string (candidate : CT.Text) return Boolean; function private_execute (Stmt : out SQLite_statement) return Boolean; function construct_bind_slot (Stmt : SQLite_statement; marker : Positive) return sqlite_canvas; procedure free_binary is new Ada.Unchecked_Deallocation (BND.IC.char_array, BND.ICS.char_array_access); end AdaBase.Statement.Base.SQLite;

37.264286

78

0.63849

1dc066c0f4bcfd43d65723a63b1d06a2d6ff57fc

2,275

ads

Ada

gcc-gcc-7_3_0-release/gcc/ada/exp_ch8.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/ada/exp_ch8.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/ada/exp_ch8.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- E X P _ C H 8 -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2011, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. 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. -- -- -- ------------------------------------------------------------------------------ -- Expand routines for chapter 8 constructs with Types; use Types; package Exp_Ch8 is procedure Expand_N_Exception_Renaming_Declaration (N : Node_Id); procedure Expand_N_Object_Renaming_Declaration (N : Node_Id); procedure Expand_N_Package_Renaming_Declaration (N : Node_Id); procedure Expand_N_Subprogram_Renaming_Declaration (N : Node_Id); end Exp_Ch8;

63.194444

78

0.435165

31bce1d60cc9081866ad665b8f90aefdd4c261c1

2,694

adb

Ada

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-htable.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-htable.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-htable.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- G N A T . H T A B L E -- -- -- -- B o d y -- -- -- -- Copyright (C) 1995-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 is a dummy body, required because if we remove the body we have -- bootstrap path problems (this unit used to have a body, and if we do not -- supply a dummy body, the old incorrect body is picked up during the -- bootstrap process). pragma Compiler_Unit_Warning; package body GNAT.HTable is end GNAT.HTable;

65.707317

78

0.403118

06de80009d3576bf626d6c7a1654dafcc104a862

2,852

ads

Ada

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/g-sptabo.ads

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

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

null

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/g-sptabo.ads

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

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

null

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/g-sptabo.ads

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

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

null

------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- G N A T . S P I T B O L . T A B L E _ B O O L E A N -- -- -- -- S p e c -- -- -- -- Copyright (C) 1997-2019, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- SPITBOL tables with boolean values (sets) -- This package provides a predefined instantiation of the table abstraction -- for type Standard.Boolean. The null value is False, so the only non-null -- value is True, i.e. this table acts essentially as a set representation. -- This package is based on Macro-SPITBOL created by Robert Dewar. package GNAT.Spitbol.Table_Boolean is new GNAT.Spitbol.Table (Boolean, False, Boolean'Image); pragma Preelaborate (Table_Boolean);

67.904762

78

0.430575

31cbef67d6bde761ccbfb661dbce6c571916614f

55,872

ads

Ada

llvm-gcc-4.2-2.9/gcc/ada/g-spipat.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

llvm-gcc-4.2-2.9/gcc/ada/g-spipat.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

llvm-gcc-4.2-2.9/gcc/ada/g-spipat.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- G N A T . S P I T B O L . P A T T E R N S -- -- -- -- S p e c -- -- -- -- Copyright (C) 1997-2005, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- SPITBOL-like pattern construction and matching -- This child package of GNAT.SPITBOL provides a complete implementation -- of the SPITBOL-like pattern construction and matching operations. This -- package is based on Macro-SPITBOL created by Robert Dewar. ------------------------------------------------------------ -- Summary of Pattern Matching Packages in GNAT Hierarchy -- ------------------------------------------------------------ -- There are three related packages that perform pattern maching functions. -- the following is an outline of these packages, to help you determine -- which is best for your needs. -- GNAT.Regexp (files g-regexp.ads/g-regexp.adb) -- This is a simple package providing Unix-style regular expression -- matching with the restriction that it matches entire strings. It -- is particularly useful for file name matching, and in particular -- it provides "globbing patterns" that are useful in implementing -- unix or DOS style wild card matching for file names. -- GNAT.Regpat (files g-regpat.ads/g-regpat.adb) -- This is a more complete implementation of Unix-style regular -- expressions, copied from the original V7 style regular expression -- library written in C by Henry Spencer. It is functionally the -- same as this library, and uses the same internal data structures -- stored in a binary compatible manner. -- GNAT.Spitbol.Patterns (files g-spipat.ads/g-spipat.adb) -- This is a completely general patterm matching package based on the -- pattern language of SNOBOL4, as implemented in SPITBOL. The pattern -- language is modeled on context free grammars, with context sensitive -- extensions that provide full (type 0) computational capabilities. with Ada.Strings.Maps; use Ada.Strings.Maps; with Ada.Text_IO; use Ada.Text_IO; package GNAT.Spitbol.Patterns is pragma Elaborate_Body; ------------------------------- -- Pattern Matching Tutorial -- ------------------------------- -- A pattern matching operation (a call to one of the Match subprograms) -- takes a subject string and a pattern, and optionally a replacement -- string. The replacement string option is only allowed if the subject -- is a variable. -- The pattern is matched against the subject string, and either the -- match fails, or it succeeds matching a contiguous substring. If a -- replacement string is specified, then the subject string is modified -- by replacing the matched substring with the given replacement. -- Concatenation and Alternation -- ============================= -- A pattern consists of a series of pattern elements. The pattern is -- built up using either the concatenation operator: -- A & B -- which means match A followed immediately by matching B, or the -- alternation operator: -- A or B -- which means first attempt to match A, and then if that does not -- succeed, match B. -- There is full backtracking, which means that if a given pattern -- element fails to match, then previous alternatives are matched. -- For example if we have the pattern: -- (A or B) & (C or D) & (E or F) -- First we attempt to match A, if that succeeds, then we go on to try -- to match C, and if that succeeds, we go on to try to match E. If E -- fails, then we try F. If F fails, then we go back and try matching -- D instead of C. Let's make this explicit using a specific example, -- and introducing the simplest kind of pattern element, which is a -- literal string. The meaning of this pattern element is simply to -- match the characters that correspond to the string characters. Now -- let's rewrite the above pattern form with specific string literals -- as the pattern elements: -- ("ABC" or "AB") & ("DEF" or "CDE") & ("GH" or "IJ") -- The following strings will be attempted in sequence: -- ABC . DEF . GH -- ABC . DEF . IJ -- ABC . CDE . GH -- ABC . CDE . IJ -- AB . DEF . GH -- AB . DEF . IJ -- AB . CDE . GH -- AB . CDE . IJ -- Here we use the dot simply to separate the pieces of the string -- matched by the three separate elements. -- Moving the Start Point -- ====================== -- A pattern is not required to match starting at the first character -- of the string, and is not required to match to the end of the string. -- The first attempt does indeed attempt to match starting at the first -- character of the string, trying all the possible alternatives. But -- if all alternatives fail, then the starting point of the match is -- moved one character, and all possible alternatives are attempted at -- the new anchor point. -- The entire match fails only when every possible starting point has -- been attempted. As an example, suppose that we had the subject -- string -- "ABABCDEIJKL" -- matched using the pattern in the previous example: -- ("ABC" or "AB") & ("DEF" or "CDE") & ("GH" or "IJ") -- would succeed, afer two anchor point moves: -- "ABABCDEIJKL" -- ^^^^^^^ -- matched -- section -- This mode of pattern matching is called the unanchored mode. It is -- also possible to put the pattern matcher into anchored mode by -- setting the global variable Anchored_Mode to True. This will cause -- all subsequent matches to be performed in anchored mode, where the -- match is required to start at the first character. -- We will also see later how the effect of an anchored match can be -- obtained for a single specified anchor point if this is desired. -- Other Pattern Elements -- ====================== -- In addition to strings (or single characters), there are many special -- pattern elements that correspond to special predefined alternations: -- Arb Matches any string. First it matches the null string, and -- then on a subsequent failure, matches one character, and -- then two characters, and so on. It only fails if the -- entire remaining string is matched. -- Bal Matches a non-empty string that is parentheses balanced -- with respect to ordinary () characters. Examples of -- balanced strings are "ABC", "A((B)C)", and "A(B)C(D)E". -- Bal matches the shortest possible balanced string on the -- first attempt, and if there is a subsequent failure, -- attempts to extend the string. -- Cancel Immediately aborts the entire pattern match, signalling -- failure. This is a specialized pattern element, which is -- useful in conjunction with some of the special pattern -- elements that have side effects. -- Fail The null alternation. Matches no possible strings, so it -- always signals failure. This is a specialized pattern -- element, which is useful in conjunction with some of the -- special pattern elements that have side effects. -- Fence Matches the null string at first, and then if a failure -- causes alternatives to be sought, aborts the match (like -- a Cancel). Note that using Fence at the start of a pattern -- has the same effect as matching in anchored mode. -- Rest Matches from the current point to the last character in -- the string. This is a specialized pattern element, which -- is useful in conjunction with some of the special pattern -- elements that have side effects. -- Succeed Repeatedly matches the null string (it is equivalent to -- the alternation ("" or "" or "" ....). This is a special -- pattern element, which is useful in conjunction with some -- of the special pattern elements that have side effects. -- Pattern Construction Functions -- ============================== -- The following functions construct additional pattern elements -- Any(S) Where S is a string, matches a single character that is -- any one of the characters in S. Fails if the current -- character is not one of the given set of characters. -- Arbno(P) Where P is any pattern, matches any number of instances -- of the pattern, starting with zero occurrences. It is -- thus equivalent to ("" or (P & ("" or (P & ("" ....)))). -- The pattern P may contain any number of pattern elements -- including the use of alternatiion and concatenation. -- Break(S) Where S is a string, matches a string of zero or more -- characters up to but not including a break character -- that is one of the characters given in the string S. -- Can match the null string, but cannot match the last -- character in the string, since a break character is -- required to be present. -- BreakX(S) Where S is a string, behaves exactly like Break(S) when -- it first matches, but if a string is successfully matched, -- then a susequent failure causes an attempt to extend the -- matched string. -- Fence(P) Where P is a pattern, attempts to match the pattern P -- including trying all possible alternatives of P. If none -- of these alternatives succeeds, then the Fence pattern -- fails. If one alternative succeeds, then the pattern -- match proceeds, but on a subsequent failure, no attempt -- is made to search for alternative matches of P. The -- pattern P may contain any number of pattern elements -- including the use of alternatiion and concatenation. -- Len(N) Where N is a natural number, matches the given number of -- characters. For example, Len(10) matches any string that -- is exactly ten characters long. -- NotAny(S) Where S is a string, matches a single character that is -- not one of the characters of S. Fails if the current -- characer is one of the given set of characters. -- NSpan(S) Where S is a string, matches a string of zero or more -- characters that is among the characters given in the -- string. Always matches the longest possible such string. -- Always succeeds, since it can match the null string. -- Pos(N) Where N is a natural number, matches the null string -- if exactly N characters have been matched so far, and -- otherwise fails. -- Rpos(N) Where N is a natural number, matches the null string -- if exactly N characters remain to be matched, and -- otherwise fails. -- Rtab(N) Where N is a natural number, matches characters from -- the current position until exactly N characters remain -- to be matched in the string. Fails if fewer than N -- unmatched characters remain in the string. -- Tab(N) Where N is a natural number, matches characters from -- the current position until exactly N characters have -- been matched in all. Fails if more than N characters -- have already been matched. -- Span(S) Where S is a string, matches a string of one or more -- characters that is among the characters given in the -- string. Always matches the longest possible such string. -- Fails if the current character is not one of the given -- set of characters. -- Recursive Pattern Matching -- ========================== -- The plus operator (+P) where P is a pattern variable, creates -- a recursive pattern that will, at pattern matching time, follow -- the pointer to obtain the referenced pattern, and then match this -- pattern. This may be used to construct recursive patterns. Consider -- for example: -- P := ("A" or ("B" & (+P))) -- On the first attempt, this pattern attempts to match the string "A". -- If this fails, then the alternative matches a "B", followed by an -- attempt to match P again. This second attempt first attempts to -- match "A", and so on. The result is a pattern that will match a -- string of B's followed by a single A. -- This particular example could simply be written as NSpan('B') & 'A', -- but the use of recursive patterns in the general case can construct -- complex patterns which could not otherwise be built. -- Pattern Assignment Operations -- ============================= -- In addition to the overall result of a pattern match, which indicates -- success or failure, it is often useful to be able to keep track of -- the pieces of the subject string that are matched by individual -- pattern elements, or subsections of the pattern. -- The pattern assignment operators allow this capability. The first -- form is the immediate assignment: -- P * S -- Here P is an arbitrary pattern, and S is a variable of type VString -- that will be set to the substring matched by P. This assignment -- happens during pattern matching, so if P matches more than once, -- then the assignment happens more than once. -- The deferred assignment operation: -- P ** S -- avoids these multiple assignments by deferring the assignment to the -- end of the match. If the entire match is successful, and if the -- pattern P was part of the successful match, then at the end of the -- matching operation the assignment to S of the string matching P is -- performed. -- The cursor assignment operation: -- Setcur(N'Access) -- assigns the current cursor position to the natural variable N. The -- cursor position is defined as the count of characters that have been -- matched so far (including any start point moves). -- Finally the operations * and ** may be used with values of type -- Text_IO.File_Access. The effect is to do a Put_Line operation of -- the matched substring. These are particularly useful in debugging -- pattern matches. -- Deferred Matching -- ================= -- The pattern construction functions (such as Len and Any) all permit -- the use of pointers to natural or string values, or functions that -- return natural or string values. These forms cause the actual value -- to be obtained at pattern matching time. This allows interesting -- possibilities for constructing dynamic patterns as illustrated in -- the examples section. -- In addition the (+S) operator may be used where S is a pointer to -- string or function returning string, with a similar deferred effect. -- A special use of deferred matching is the construction of predicate -- functions. The element (+P) where P is an access to a function that -- returns a Boolean value, causes the function to be called at the -- time the element is matched. If the function returns True, then the -- null string is matched, if the function returns False, then failure -- is signalled and previous alternatives are sought. -- Deferred Replacement -- ==================== -- The simple model given for pattern replacement (where the matched -- substring is replaced by the string given as the third argument to -- Match) works fine in simple cases, but this approach does not work -- in the case where the expression used as the replacement string is -- dependent on values set by the match. -- For example, suppose we want to find an instance of a parenthesized -- character, and replace the parentheses with square brackets. At first -- glance it would seem that: -- Match (Subject, '(' & Len (1) * Char & ')', '[' & Char & ']'); -- would do the trick, but that does not work, because the third -- argument to Match gets evaluated too early, before the call to -- Match, and before the pattern match has had a chance to set Char. -- To solve this problem we provide the deferred replacement capability. -- With this approach, which of course is only needed if the pattern -- involved has side effects, is to do the match in two stages. The -- call to Match sets a pattern result in a variable of the private -- type Match_Result, and then a subsequent Replace operation uses -- this Match_Result object to perform the required replacement. -- Using this approach, we can now write the above operation properly -- in a manner that will work: -- M : Match_Result; -- ... -- Match (Subject, '(' & Len (1) * Char & ')', M); -- Replace (M, '[' & Char & ']'); -- As with other Match cases, there is a function and procedure form -- of this match call. A call to Replace after a failed match has no -- effect. Note that Subject should not be modified between the calls. -- Examples of Pattern Matching -- ============================ -- First a simple example of the use of pattern replacement to remove -- a line number from the start of a string. We assume that the line -- number has the form of a string of decimal digits followed by a -- period, followed by one or more spaces. -- Digs : constant Pattern := Span("0123456789"); -- Lnum : constant Pattern := Pos(0) & Digs & '.' & Span(' '); -- Now to use this pattern we simply do a match with a replacement: -- Match (Line, Lnum, ""); -- which replaces the line number by the null string. Note that it is -- also possible to use an Ada.Strings.Maps.Character_Set value as an -- argument to Span and similar functions, and in particular all the -- useful constants 'in Ada.Strings.Maps.Constants are available. This -- means that we could define Digs as: -- Digs : constant Pattern := Span(Decimal_Digit_Set); -- The style we use here, of defining constant patterns and then using -- them is typical. It is possible to build up patterns dynamically, -- but it is usually more efficient to build them in pieces in advance -- using constant declarations. Note in particular that although it is -- possible to construct a pattern directly as an argument for the -- Match routine, it is much more efficient to preconstruct the pattern -- as we did in this example. -- Now let's look at the use of pattern assignment to break a -- string into sections. Suppose that the input string has two -- unsigned decimal integers, separated by spaces or a comma, -- with spaces allowed anywhere. Then we can isolate the two -- numbers with the following pattern: -- Num1, Num2 : aliased VString; -- B : constant Pattern := NSpan(' '); -- N : constant Pattern := Span("0123456789"); -- T : constant Pattern := -- NSpan(' ') & N * Num1 & Span(" ,") & N * Num2; -- The match operation Match (" 124, 257 ", T) would assign the -- string 124 to Num1 and the string 257 to Num2. -- Now let's see how more complex elements can be built from the -- set of primitive elements. The following pattern matches strings -- that have the syntax of Ada 95 based literals: -- Digs : constant Pattern := Span(Decimal_Digit_Set); -- UDigs : constant Pattern := Digs & Arbno('_' & Digs); -- Edig : constant Pattern := Span(Hexadecimal_Digit_Set); -- UEdig : constant Pattern := Edig & Arbno('_' & Edig); -- Bnum : constant Pattern := Udigs & '#' & UEdig & '#'; -- A match against Bnum will now match the desired strings, e.g. -- it will match 16#123_abc#, but not a#b#. However, this pattern -- is not quite complete, since it does not allow colons to replace -- the pound signs. The following is more complete: -- Bchar : constant Pattern := Any("#:"); -- Bnum : constant Pattern := Udigs & Bchar & UEdig & Bchar; -- but that is still not quite right, since it allows # and : to be -- mixed, and they are supposed to be used consistently. We solve -- this by using a deferred match. -- Temp : aliased VString; -- Bnum : constant Pattern := -- Udigs & Bchar * Temp & UEdig & (+Temp) -- Here the first instance of the base character is stored in Temp, and -- then later in the pattern we rematch the value that was assigned. -- For an example of a recursive pattern, let's define a pattern -- that is like the built in Bal, but the string matched is balanced -- with respect to square brackets or curly brackets. -- The language for such strings might be defined in extended BNF as -- ELEMENT ::= <any character other than [] or {}> -- | '[' BALANCED_STRING ']' -- | '{' BALANCED_STRING '}' -- BALANCED_STRING ::= ELEMENT {ELEMENT} -- Here we use {} to indicate zero or more occurrences of a term, as -- is common practice in extended BNF. Now we can translate the above -- BNF into recursive patterns as follows: -- Element, Balanced_String : aliased Pattern; -- . -- . -- . -- Element := NotAny ("[]{}") -- or -- ('[' & (+Balanced_String) & ']') -- or -- ('{' & (+Balanced_String) & '}'); -- Balanced_String := Element & Arbno (Element); -- Note the important use of + here to refer to a pattern not yet -- defined. Note also that we use assignments precisely because we -- cannot refer to as yet undeclared variables in initializations. -- Now that this pattern is constructed, we can use it as though it -- were a new primitive pattern element, and for example, the match: -- Match ("xy[ab{cd}]", Balanced_String * Current_Output & Fail); -- will generate the output: -- x -- xy -- xy[ab{cd}] -- y -- y[ab{cd}] -- [ab{cd}] -- a -- ab -- ab{cd} -- b -- b{cd} -- {cd} -- c -- cd -- d -- Note that the function of the fail here is simply to force the -- pattern Balanced_String to match all possible alternatives. Studying -- the operation of this pattern in detail is highly instructive. -- Finally we give a rather elaborate example of the use of deferred -- matching. The following declarations build up a pattern which will -- find the longest string of decimal digits in the subject string. -- Max, Cur : VString; -- Loc : Natural; -- function GtS return Boolean is -- begin -- return Length (Cur) > Length (Max); -- end GtS; -- Digit : constant Character_Set := Decimal_Digit_Set; -- Digs : constant Pattern := Span(Digit); -- Find : constant Pattern := -- "" * Max & Fence & -- initialize Max to null -- BreakX (Digit) & -- scan looking for digits -- ((Span(Digit) * Cur & -- assign next string to Cur -- (+GtS'Unrestricted_Access) & -- check size(Cur) > Size(Max) -- Setcur(Loc'Access)) -- if so, save location -- * Max) & -- and assign to Max -- Fail; -- seek all alternatives -- As we see from the comments here, complex patterns like this take -- on aspects of sequential programs. In fact they are sequential -- programs with general backtracking. In this pattern, we first use -- a pattern assignment that matches null and assigns it to Max, so -- that it is initialized for the new match. Now BreakX scans to the -- next digit. Arb would do here, but BreakX will be more efficient. -- Once we have found a digit, we scan out the longest string of -- digits with Span, and assign it to Cur. The deferred call to GtS -- tests if the string we assigned to Cur is the longest so far. If -- not, then failure is signalled, and we seek alternatives (this -- means that BreakX will extend and look for the next digit string). -- If the call to GtS succeeds then the matched string is assigned -- as the largest string so far into Max and its location is saved -- in Loc. Finally Fail forces the match to fail and seek alternatives, -- so that the entire string is searched. -- If the pattern Find is matched against a string, the variable Max -- at the end of the pattern will have the longest string of digits, -- and Loc will be the starting character location of the string. For -- example, Match("ab123cd4657ef23", Find) will assign "4657" to Max -- and 11 to Loc (indicating that the string ends with the eleventh -- character of the string). -- Note: the use of Unrestricted_Access to reference GtS will not -- be needed if GtS is defined at the outer level, but definitely -- will be necessary if GtS is a nested function (in which case of -- course the scope of the pattern Find will be restricted to this -- nested scope, and this cannot be checked, i.e. use of the pattern -- outside this scope is erroneous). Generally it is a good idea to -- define patterns and the functions they call at the outer level -- where possible, to avoid such problems. -- Correspondence with Pattern Matching in SPITBOL -- =============================================== -- Generally the Ada syntax and names correspond closely to SPITBOL -- syntax for pattern matching construction. -- The basic pattern construction operators are renamed as follows: -- Spitbol Ada -- (space) & -- | or -- $ * -- . ** -- The Ada operators were chosen so that the relative precedences of -- these operators corresponds to that of the Spitbol operators, but -- as always, the use of parentheses is advisable to clarify. -- The pattern construction operators all have similar names except for -- Spitbol Ada -- Abort Cancel -- Rem Rest -- where we have clashes with Ada reserved names -- Ada requires the use of 'Access to refer to functions used in the -- pattern match, and often the use of 'Unrestricted_Access may be -- necessary to get around the scope restrictions if the functions -- are not declared at the outer level. -- The actual pattern matching syntax is modified in Ada as follows: -- Spitbol Ada -- X Y Match (X, Y); -- X Y = Z Match (X, Y, Z); -- and pattern failure is indicated by returning a Boolean result from -- the Match function (True for success, False for failure). ----------------------- -- Type Declarations -- ----------------------- type Pattern is private; -- Type representing a pattern. This package provides a complete set of -- operations for constructing patterns that can be used in the pattern -- matching operations provided. type Boolean_Func is access function return Boolean; -- General Boolean function type. When this type is used as a formal -- parameter type in this package, it indicates a deferred predicate -- pattern. The function will be called when the pattern element is -- matched and failure signalled if False is returned. type Natural_Func is access function return Natural; -- General Natural function type. When this type is used as a formal -- parameter type in this package, it indicates a deferred pattern. -- The function will be called when the pattern element is matched -- to obtain the currently referenced Natural value. type VString_Func is access function return VString; -- General VString function type. When this type is used as a formal -- parameter type in this package, it indicates a deferred pattern. -- The function will be called when the pattern element is matched -- to obtain the currently referenced string value. subtype PString is String; -- This subtype is used in the remainder of the package to indicate a -- formal parameter that is converted to its corresponding pattern, -- i.e. a pattern that matches the characters of the string. subtype PChar is Character; -- Similarly, this subtype is used in the remainder of the package to -- indicate a formal parameter that is converted to its corresponding -- pattern, i.e. a pattern that matches this one character. subtype VString_Var is VString; subtype Pattern_Var is Pattern; -- These synonyms are used as formal parameter types to a function where, -- if the language allowed, we would use in out parameters, but we are -- not allowed to have in out parameters for functions. Instead we pass -- actuals which must be variables, and with a bit of trickery in the -- body, manage to interprete them properly as though they were indeed -- in out parameters. -------------------------------- -- Basic Pattern Construction -- -------------------------------- function "&" (L : Pattern; R : Pattern) return Pattern; function "&" (L : PString; R : Pattern) return Pattern; function "&" (L : Pattern; R : PString) return Pattern; function "&" (L : PChar; R : Pattern) return Pattern; function "&" (L : Pattern; R : PChar) return Pattern; -- Pattern concatenation. Matches L followed by R function "or" (L : Pattern; R : Pattern) return Pattern; function "or" (L : PString; R : Pattern) return Pattern; function "or" (L : Pattern; R : PString) return Pattern; function "or" (L : PString; R : PString) return Pattern; function "or" (L : PChar; R : Pattern) return Pattern; function "or" (L : Pattern; R : PChar) return Pattern; function "or" (L : PChar; R : PChar) return Pattern; function "or" (L : PString; R : PChar) return Pattern; function "or" (L : PChar; R : PString) return Pattern; -- Pattern alternation. Creates a pattern that will first try to match -- L and then on a subsequent failure, attempts to match R instead. ---------------------------------- -- Pattern Assignment Functions -- ---------------------------------- function "*" (P : Pattern; Var : VString_Var) return Pattern; function "*" (P : PString; Var : VString_Var) return Pattern; function "*" (P : PChar; Var : VString_Var) return Pattern; -- Matches P, and if the match succeeds, assigns the matched substring -- to the given VString variable S. This assignment happens as soon as -- the substring is matched, and if the pattern P1 is matched more than -- once during the course of the match, then the assignment will occur -- more than once. function "**" (P : Pattern; Var : VString_Var) return Pattern; function "**" (P : PString; Var : VString_Var) return Pattern; function "**" (P : PChar; Var : VString_Var) return Pattern; -- Like "*" above, except that the assignment happens at most once -- after the entire match is completed successfully. If the match -- fails, then no assignment takes place. ---------------------------------- -- Deferred Matching Operations -- ---------------------------------- function "+" (Str : VString_Var) return Pattern; -- Here Str must be a VString variable. This function constructs a -- pattern which at pattern matching time will access the current -- value of this variable, and match against these characters. function "+" (Str : VString_Func) return Pattern; -- Constructs a pattern which at pattern matching time calls the given -- function, and then matches against the string or character value -- that is returned by the call. function "+" (P : Pattern_Var) return Pattern; -- Here P must be a Pattern variable. This function constructs a -- pattern which at pattern matching time will access the current -- value of this variable, and match against the pattern value. function "+" (P : Boolean_Func) return Pattern; -- Constructs a predicate pattern function that at pattern matching time -- calls the given function. If True is returned, then the pattern matches. -- If False is returned, then failure is signalled. -------------------------------- -- Pattern Building Functions -- -------------------------------- function Arb return Pattern; -- Constructs a pattern that will match any string. On the first attempt, -- the pattern matches a null string, then on each successive failure, it -- matches one more character, and only fails if matching the entire rest -- of the string. function Arbno (P : Pattern) return Pattern; function Arbno (P : PString) return Pattern; function Arbno (P : PChar) return Pattern; -- Pattern repetition. First matches null, then on a subsequent failure -- attempts to match an additional instance of the given pattern. -- Equivalent to (but more efficient than) P & ("" or (P & ("" or ... function Any (Str : String) return Pattern; function Any (Str : VString) return Pattern; function Any (Str : Character) return Pattern; function Any (Str : Character_Set) return Pattern; function Any (Str : access VString) return Pattern; function Any (Str : VString_Func) return Pattern; -- Constructs a pattern that matches a single character that is one of -- the characters in the given argument. The pattern fails if the current -- character is not in Str. function Bal return Pattern; -- Constructs a pattern that will match any non-empty string that is -- parentheses balanced with respect to the normal parentheses characters. -- Attempts to extend the string if a subsequent failure occurs. function Break (Str : String) return Pattern; function Break (Str : VString) return Pattern; function Break (Str : Character) return Pattern; function Break (Str : Character_Set) return Pattern; function Break (Str : access VString) return Pattern; function Break (Str : VString_Func) return Pattern; -- Constructs a pattern that matches a (possibly null) string which -- is immediately followed by a character in the given argument. This -- character is not part of the matched string. The pattern fails if -- the remaining characters to be matched do not include any of the -- characters in Str. function BreakX (Str : String) return Pattern; function BreakX (Str : VString) return Pattern; function BreakX (Str : Character) return Pattern; function BreakX (Str : Character_Set) return Pattern; function BreakX (Str : access VString) return Pattern; function BreakX (Str : VString_Func) return Pattern; -- Like Break, but the pattern attempts to extend on a failure to find -- the next occurrence of a character in Str, and only fails when the -- last such instance causes a failure. function Cancel return Pattern; -- Constructs a pattern that immediately aborts the entire match function Fail return Pattern; -- Constructs a pattern that always fails function Fence return Pattern; -- Constructs a pattern that matches null on the first attempt, and then -- causes the entire match to be aborted if a subsequent failure occurs. function Fence (P : Pattern) return Pattern; -- Constructs a pattern that first matches P. if P fails, then the -- constructed pattern fails. If P succeeds, then the match proceeds, -- but if subsequent failure occurs, alternatives in P are not sought. -- The idea of Fence is that each time the pattern is matched, just -- one attempt is made to match P, without trying alternatives. function Len (Count : Natural) return Pattern; function Len (Count : access Natural) return Pattern; function Len (Count : Natural_Func) return Pattern; -- Constructs a pattern that matches exactly the given number of -- characters. The pattern fails if fewer than this number of characters -- remain to be matched in the string. function NotAny (Str : String) return Pattern; function NotAny (Str : VString) return Pattern; function NotAny (Str : Character) return Pattern; function NotAny (Str : Character_Set) return Pattern; function NotAny (Str : access VString) return Pattern; function NotAny (Str : VString_Func) return Pattern; -- Constructs a pattern that matches a single character that is not -- one of the characters in the given argument. The pattern Fails if -- the current character is in Str. function NSpan (Str : String) return Pattern; function NSpan (Str : VString) return Pattern; function NSpan (Str : Character) return Pattern; function NSpan (Str : Character_Set) return Pattern; function NSpan (Str : access VString) return Pattern; function NSpan (Str : VString_Func) return Pattern; -- Constructs a pattern that matches the longest possible string -- consisting entirely of characters from the given argument. The -- string may be empty, so this pattern always succeeds. function Pos (Count : Natural) return Pattern; function Pos (Count : access Natural) return Pattern; function Pos (Count : Natural_Func) return Pattern; -- Constructs a pattern that matches the null string if exactly Count -- characters have already been matched, and otherwise fails. function Rest return Pattern; -- Constructs a pattern that always succeeds, matching the remaining -- unmatched characters in the pattern. function Rpos (Count : Natural) return Pattern; function Rpos (Count : access Natural) return Pattern; function Rpos (Count : Natural_Func) return Pattern; -- Constructs a pattern that matches the null string if exactly Count -- characters remain to be matched in the string, and otherwise fails. function Rtab (Count : Natural) return Pattern; function Rtab (Count : access Natural) return Pattern; function Rtab (Count : Natural_Func) return Pattern; -- Constructs a pattern that matches from the current location until -- exactly Count characters remain to be matched in the string. The -- pattern fails if fewer than Count characters remain to be matched. function Setcur (Var : access Natural) return Pattern; -- Constructs a pattern that matches the null string, and assigns the -- current cursor position in the string. This value is the number of -- characters matched so far. So it is zero at the start of the match. function Span (Str : String) return Pattern; function Span (Str : VString) return Pattern; function Span (Str : Character) return Pattern; function Span (Str : Character_Set) return Pattern; function Span (Str : access VString) return Pattern; function Span (Str : VString_Func) return Pattern; -- Constructs a pattern that matches the longest possible string -- consisting entirely of characters from the given argument. The -- string cannot be empty , so the pattern fails if the current -- character is not one of the characters in Str. function Succeed return Pattern; -- Constructs a pattern that succeeds matching null, both on the first -- attempt, and on any rematch attempt, i.e. it is equivalent to an -- infinite alternation of null strings. function Tab (Count : Natural) return Pattern; function Tab (Count : access Natural) return Pattern; function Tab (Count : Natural_Func) return Pattern; -- Constructs a pattern that from the current location until Count -- characters have been matched. The pattern fails if more than Count -- characters have already been matched. --------------------------------- -- Pattern Matching Operations -- --------------------------------- -- The Match function performs an actual pattern matching operation. -- The versions with three parameters perform a match without modifying -- the subject string and return a Boolean result indicating if the -- match is successful or not. The Anchor parameter is set to True to -- obtain an anchored match in which the pattern is required to match -- the first character of the string. In an unanchored match, which is -- the default, successive attempts are made to match the given pattern -- at each character of the subject string until a match succeeds, or -- until all possibilities have failed. -- Note that pattern assignment functions in the pattern may generate -- side effects, so these functions are not necessarily pure. Anchored_Mode : Boolean := False; -- This global variable can be set True to cause all subsequent pattern -- matches to operate in anchored mode. In anchored mode, no attempt is -- made to move the anchor point, so that if the match succeeds it must -- succeed starting at the first character. Note that the effect of -- anchored mode may be achieved in individual pattern matches by using -- Fence or Pos(0) at the start of the pattern. Pattern_Stack_Overflow : exception; -- Exception raised if internal pattern matching stack overflows. This -- is typically the result of runaway pattern recursion. If there is a -- genuine case of stack overflow, then either the match must be broken -- down into simpler steps, or the stack limit must be reset. Stack_Size : constant Positive := 2000; -- Size used for internal pattern matching stack. Increase this size if -- complex patterns cause Pattern_Stack_Overflow to be raised. -- Simple match functions. The subject is matched against the pattern. -- Any immediate or deferred assignments or writes are executed, and -- the returned value indicates whether or not the match succeeded. function Match (Subject : VString; Pat : Pattern) return Boolean; function Match (Subject : VString; Pat : PString) return Boolean; function Match (Subject : String; Pat : Pattern) return Boolean; function Match (Subject : String; Pat : PString) return Boolean; -- Replacement functions. The subject is matched against the pattern. -- Any immediate or deferred assignments or writes are executed, and -- the returned value indicates whether or not the match succeeded. -- If the match succeeds, then the matched part of the subject string -- is replaced by the given Replace string. function Match (Subject : VString_Var; Pat : Pattern; Replace : VString) return Boolean; function Match (Subject : VString_Var; Pat : PString; Replace : VString) return Boolean; function Match (Subject : VString_Var; Pat : Pattern; Replace : String) return Boolean; function Match (Subject : VString_Var; Pat : PString; Replace : String) return Boolean; -- Simple match procedures. The subject is matched against the pattern. -- Any immediate or deferred assignments or writes are executed. No -- indication of success or failure is returned. procedure Match (Subject : VString; Pat : Pattern); procedure Match (Subject : VString; Pat : PString); procedure Match (Subject : String; Pat : Pattern); procedure Match (Subject : String; Pat : PString); -- Replacement procedures. The subject is matched against the pattern. -- Any immediate or deferred assignments or writes are executed. No -- indication of success or failure is returned. If the match succeeds, -- then the matched part of the subject string is replaced by the given -- Replace string. procedure Match (Subject : in out VString; Pat : Pattern; Replace : VString); procedure Match (Subject : in out VString; Pat : PString; Replace : VString); procedure Match (Subject : in out VString; Pat : Pattern; Replace : String); procedure Match (Subject : in out VString; Pat : PString; Replace : String); -- Deferred Replacement type Match_Result is private; -- Type used to record result of pattern match subtype Match_Result_Var is Match_Result; -- This synonyms is used as a formal parameter type to a function where, -- if the language allowed, we would use an in out parameter, but we are -- not allowed to have in out parameters for functions. Instead we pass -- actuals which must be variables, and with a bit of trickery in the -- body, manage to interprete them properly as though they were indeed -- in out parameters. function Match (Subject : VString_Var; Pat : Pattern; Result : Match_Result_Var) return Boolean; procedure Match (Subject : in out VString; Pat : Pattern; Result : out Match_Result); procedure Replace (Result : in out Match_Result; Replace : VString); -- Given a previous call to Match which set Result, performs a pattern -- replacement if the match was successful. Has no effect if the match -- failed. This call should immediately follow the Match call. ------------------------ -- Debugging Routines -- ------------------------ -- Debugging pattern matching operations can often be quite complex, -- since there is no obvious way to trace the progress of the match. -- The declarations in this section provide some debugging assistance. Debug_Mode : Boolean := False; -- This global variable can be set True to generate debugging on all -- subsequent calls to Match. The debugging output is a full trace of -- the actions of the pattern matcher, written to Standard_Output. The -- level of this information is intended to be comprehensible at the -- abstract level of this package declaration. However, note that the -- use of this switch often generates large amounts of output. function "*" (P : Pattern; Fil : File_Access) return Pattern; function "*" (P : PString; Fil : File_Access) return Pattern; function "*" (P : PChar; Fil : File_Access) return Pattern; function "**" (P : Pattern; Fil : File_Access) return Pattern; function "**" (P : PString; Fil : File_Access) return Pattern; function "**" (P : PChar; Fil : File_Access) return Pattern; -- These are similar to the corresponding pattern assignment operations -- except that instead of setting the value of a variable, the matched -- substring is written to the appropriate file. This can be useful in -- following the progress of a match without generating the full amount -- of information obtained by setting Debug_Mode to True. Terminal : constant File_Access := Standard_Error; Output : constant File_Access := Standard_Output; -- Two handy synonyms for use with the above pattern write operations -- Finally we have some routines that are useful for determining what -- patterns are in use, particularly if they are constructed dynamically. function Image (P : Pattern) return String; function Image (P : Pattern) return VString; -- This procedures yield strings that corresponds to the syntax needed -- to create the given pattern using the functions in this package. The -- form of this string is such that it could actually be compiled and -- evaluated to yield the required pattern except for references to -- variables and functions, which are output using one of the following -- forms: -- -- access Natural NP(16#...#) -- access Pattern PP(16#...#) -- access VString VP(16#...#) -- -- Natural_Func NF(16#...#) -- VString_Func VF(16#...#) -- -- where 16#...# is the hex representation of the integer address that -- corresponds to the given access value procedure Dump (P : Pattern); -- This procedure writes information about the pattern to Standard_Out. -- The format of this information is keyed to the internal data structures -- used to implement patterns. The information provided by Dump is thus -- more precise than that yielded by Image, but is also a bit more obscure -- (i.e. it cannot be interpreted solely in terms of this spec, you have -- to know something about the data structures). ------------------ -- Private Part -- ------------------ private type PE; -- Pattern element, a pattern is a plex structure of PE's. This type -- is defined and sdescribed in the body of this package. type PE_Ptr is access all PE; -- Pattern reference. PE's use PE_Ptr values to reference other PE's type Pattern is new Controlled with record Stk : Natural := 0; -- Maximum number of stack entries required for matching this -- pattern. See description of pattern history stack in body. P : PE_Ptr := null; -- Pointer to initial pattern element for pattern end record; pragma Finalize_Storage_Only (Pattern); procedure Adjust (Object : in out Pattern); -- Adjust routine used to copy pattern objects procedure Finalize (Object : in out Pattern); -- Finalization routine used to release storage allocated for a pattern type VString_Ptr is access all VString; type Match_Result is record Var : VString_Ptr; -- Pointer to subject string. Set to null if match failed Start : Natural := 1; -- Starting index position (1's origin) of matched section of -- subject string. Only valid if Var is non-null. Stop : Natural := 0; -- Ending index position (1's origin) of matched section of -- subject string. Only valid if Var is non-null. end record; pragma Volatile (Match_Result); -- This ensures that the Result parameter is passed by reference, so -- that we can play our games with the bogus Match_Result_Var parameter -- in the function case to treat it as though it were an in out parameter. end GNAT.Spitbol.Patterns;

47.189189

79

0.616391

31a4f2c8abcce6a88739270e71b4fbe6a2e13209

102,424

ads

Ada

.emacs.d/elpa/ada-mode-6.1.1/ada_process_actions.ads

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

.emacs.d/elpa/ada-mode-6.1.1/ada_process_actions.ads

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

.emacs.d/elpa/ada-mode-6.1.1/ada_process_actions.ads

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

-- generated parser support file. -- command line: wisitoken-bnf-generate.exe --generate LR1 Ada_Emacs re2c PROCESS text_rep ada.wy -- -- Copyright (C) 2013 - 2019 Free Software Foundation, Inc. -- This program is free software; you can redistribute it and/or -- modify it under the terms of the GNU General Public License as -- published by the Free Software Foundation; either version 3, or (at -- your option) any later version. -- -- This software 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 GNU Emacs. If not, see <http://www.gnu.org/licenses/>. with WisiToken.Syntax_Trees; with WisiToken.Lexer; with WisiToken.Semantic_Checks; package Ada_Process_Actions is Descriptor : aliased WisiToken.Descriptor := (First_Terminal => 3, Last_Terminal => 107, First_Nonterminal => 108, Last_Nonterminal => 332, EOI_ID => 107, Accept_ID => 108, Case_Insensitive => True, New_Line_ID => 1, String_1_ID => 106, String_2_ID => 105, Image => (new String'("WHITESPACE"), new String'("NEW_LINE"), new String'("COMMENT"), new String'("ABS"), new String'("ACCEPT"), new String'("ABORT"), new String'("ABSTRACT"), new String'("ACCESS"), new String'("ALIASED"), new String'("ALL"), new String'("AND"), new String'("ARRAY"), new String'("AT"), new String'("BEGIN"), new String'("BODY"), new String'("CASE"), new String'("CONSTANT"), new String'("DECLARE"), new String'("DELAY"), new String'("DELTA"), new String'("DIGITS"), new String'("DO"), new String'("ELSE"), new String'("ELSIF"), new String'("END"), new String'("ENTRY"), new String'("EXCEPTION"), new String'("EXIT"), new String'("FOR"), new String'("FUNCTION"), new String'("GENERIC"), new String'("GOTO"), new String'("IF"), new String'("IN"), new String'("INTERFACE"), new String'("IS"), new String'("LIMITED"), new String'("LOOP"), new String'("MOD"), new String'("NEW"), new String'("NOT"), new String'("NULL"), new String'("OF"), new String'("OR"), new String'("OTHERS"), new String'("OUT"), new String'("OVERRIDING"), new String'("PACKAGE"), new String'("PRAGMA"), new String'("PRIVATE"), new String'("PROCEDURE"), new String'("PROTECTED"), new String'("RAISE"), new String'("RANGE"), new String'("RECORD"), new String'("REM"), new String'("RENAMES"), new String'("REQUEUE"), new String'("RETURN"), new String'("REVERSE"), new String'("SEPARATE"), new String'("SELECT"), new String'("SOME"), new String'("SUBTYPE"), new String'("SYNCHRONIZED"), new String'("TAGGED"), new String'("TASK"), new String'("TERMINATE"), new String'("THEN"), new String'("TYPE"), new String'("UNTIL"), new String'("USE"), new String'("WHEN"), new String'("WHILE"), new String'("WITH"), new String'("XOR"), new String'("LEFT_PAREN"), new String'("RIGHT_PAREN"), new String'("AMPERSAND"), new String'("BAR"), new String'("BOX"), new String'("COLON"), new String'("COLON_EQUAL"), new String'("COMMA"), new String'("DOT"), new String'("DOT_DOT"), new String'("EQUAL"), new String'("EQUAL_GREATER"), new String'("GREATER"), new String'("GREATER_EQUAL"), new String'("GREATER_GREATER"), new String'("LESS"), new String'("LESS_EQUAL"), new String'("LESS_LESS"), new String'("MINUS"), new String'("PLUS"), new String'("SEMICOLON"), new String'("SLASH"), new String'("SLASH_EQUAL"), new String'("STAR"), new String'("STAR_STAR"), new String'("TICK_1"), new String'("TICK_2"), new String'("NUMERIC_LITERAL"), new String'("IDENTIFIER"), new String'("STRING_LITERAL"), new String'("CHARACTER_LITERAL"), new String'("Wisi_EOI"), new String'("wisitoken_accept"), new String'("abstract_limited_synchronized_opt"), new String'("abstract_limited_opt"), new String'("abstract_tagged_limited_opt"), new String'("abstract_subprogram_declaration"), new String'("accept_statement"), new String'("access_definition"), new String'("actual_parameter_part"), new String'("actual_parameter_part_opt"), new String'("aggregate"), new String'("aliased_opt"), new String'("and_interface_list_opt"), new String'("array_type_definition"), new String'("aspect_clause"), new String'("aspect_specification_opt"), new String'("assignment_statement"), new String'("association_opt"), new String'("association_list"), new String'("asynchronous_select"), new String'("at_clause"), new String'("attribute_reference"), new String'("attribute_designator"), new String'("binary_adding_operator"), new String'("block_label"), new String'("block_label_opt"), new String'("block_statement"), new String'("body_g"), new String'("body_stub"), new String'("case_expression"), new String'("case_expression_alternative"), new String'("case_expression_alternative_list"), new String'("case_statement"), new String'("case_statement_alternative"), new String'("case_statement_alternative_list"), new String'("compilation_unit"), new String'("compilation_unit_list"), new String'("component_clause"), new String'("component_clause_list"), new String'("component_declaration"), new String'("component_definition"), new String'("component_item"), new String'("component_list"), new String'("component_list_opt"), new String'("compound_statement"), new String'("conditional_entry_call"), new String'("conditional_quantified_expression"), new String'("constant_opt"), new String'("constraint"), new String'("constraint_opt"), new String'("declaration"), new String'("declarations"), new String'("declarative_part_opt"), new String'("delay_alternative"), new String'("delay_statement"), new String'("derived_type_definition"), new String'("direct_name"), new String'("direct_name_opt"), new String'("discrete_choice"), new String'("discrete_choice_list"), new String'("discrete_subtype_definition"), new String'("discrete_subtype_definition_list"), new String'("discriminant_part_opt"), new String'("discriminant_specification_opt"), new String'("discriminant_specification_list"), new String'("elsif_expression_item"), new String'("elsif_expression_list"), new String'("elsif_statement_item"), new String'("elsif_statement_list"), new String'("entry_body"), new String'("entry_body_formal_part"), new String'("entry_call_alternative"), new String'("entry_declaration"), new String'("enumeration_literal"), new String'("enumeration_literal_list"), new String'("enumeration_representation_clause"), new String'("enumeration_type_definition"), new String'("exception_choice"), new String'("exception_choice_list"), new String'("exception_declaration"), new String'("exception_handler"), new String'("exception_handler_list"), new String'("exception_handler_list_opt"), new String'("exit_statement"), new String'("expression"), new String'("expression_opt"), new String'("expression_function_declaration"), new String'("extended_return_object_declaration"), new String'("extended_return_object_declaration_opt"), new String'("extended_return_statement"), new String'("factor"), new String'("formal_object_declaration"), new String'("formal_part"), new String'("formal_subprogram_declaration"), new String'("formal_type_declaration"), new String'("formal_type_definition"), new String'("formal_derived_type_definition"), new String'("formal_package_declaration"), new String'("formal_package_actual_part"), new String'("full_type_declaration"), new String'("function_specification"), new String'("general_access_modifier_opt"), new String'("generic_declaration"), new String'("generic_formal_part"), new String'("generic_formal_parameter_declarations"), new String'("generic_formal_parameter_declaration"), new String'("generic_instantiation"), new String'("generic_package_declaration"), new String'("generic_renaming_declaration"), new String'("generic_subprogram_declaration"), new String'("goto_label"), new String'("handled_sequence_of_statements"), new String'("identifier_list"), new String'("identifier_opt"), new String'("if_expression"), new String'("if_statement"), new String'("incomplete_type_declaration"), new String'("index_constraint"), new String'("index_subtype_definition"), new String'("index_subtype_definition_list"), new String'("interface_list"), new String'("interface_type_definition"), new String'("iteration_scheme"), new String'("iterator_specification"), new String'("iterator_specification_opt"), new String'("loop_statement"), new String'("membership_choice_list"), new String'("membership_choice"), new String'("mod_clause_opt"), new String'("mode_opt"), new String'("multiplying_operator"), new String'("name_list"), new String'("name"), new String'("name_opt"), new String'("null_exclusion_opt"), new String'("null_exclusion_opt_name_type"), new String'("null_procedure_declaration"), new String'("object_declaration"), new String'("object_renaming_declaration"), new String'("overriding_indicator_opt"), new String'("package_body"), new String'("package_body_stub"), new String'("package_declaration"), new String'("package_renaming_declaration"), new String'("package_specification"), new String'("parameter_and_result_profile"), new String'("parameter_profile_opt"), new String'("parameter_specification"), new String'("parameter_specification_list"), new String'("paren_expression"), new String'("pragma_g"), new String'("primary"), new String'("private_extension_declaration"), new String'("private_type_declaration"), new String'("procedure_call_statement"), new String'("procedure_specification"), new String'("proper_body"), new String'("protected_body"), new String'("protected_body_stub"), new String'("protected_definition"), new String'("protected_operation_item"), new String'("protected_operation_item_list"), new String'("protected_operation_item_list_opt"), new String'("protected_opt"), new String'("protected_type_declaration"), new String'("qualified_expression"), new String'("quantified_expression"), new String'("quantifier"), new String'("raise_expression"), new String'("raise_statement"), new String'("range_g"), new String'("range_list"), new String'("real_range_specification_opt"), new String'("record_definition"), new String'("record_representation_clause"), new String'("relation_and_list"), new String'("relation_and_then_list"), new String'("relation_or_list"), new String'("relation_or_else_list"), new String'("relation_xor_list"), new String'("relation"), new String'("relational_operator"), new String'("renaming_declaration"), new String'("requeue_statement"), new String'("result_profile"), new String'("return_subtype_indication"), new String'("selected_component"), new String'("selective_accept"), new String'("select_alternative"), new String'("select_alternative_list"), new String'("select_alternative_list_opt"), new String'("select_statement"), new String'("sequence_of_statements"), new String'("sequence_of_statements_opt"), new String'("simple_expression"), new String'("simple_return_statement"), new String'("simple_statement"), new String'("single_protected_declaration"), new String'("single_task_declaration"), new String'("statement"), new String'("subprogram_body"), new String'("subprogram_body_stub"), new String'("subprogram_declaration"), new String'("subprogram_default"), new String'("subprogram_renaming_declaration"), new String'("subprogram_specification"), new String'("subtype_declaration"), new String'("subtype_indication"), new String'("subunit"), new String'("task_body"), new String'("task_body_stub"), new String'("task_definition"), new String'("task_type_declaration"), new String'("term"), new String'("term_list"), new String'("tick"), new String'("timed_entry_call"), new String'("triggering_alternative"), new String'("type_declaration"), new String'("type_definition"), new String'("variant_part"), new String'("variant_list"), new String'("variant"), new String'("unary_adding_operator"), new String'("use_clause"), new String'("with_clause")), Terminal_Image_Width => 17, Image_Width => 38, Last_Lookahead => 107); type Token_Enum_ID is (WHITESPACE_ID, NEW_LINE_ID, COMMENT_ID, ABS_ID, ACCEPT_ID, ABORT_ID, ABSTRACT_ID, ACCESS_ID, ALIASED_ID, ALL_ID, AND_ID, ARRAY_ID, AT_ID, BEGIN_ID, BODY_ID, CASE_ID, CONSTANT_ID, DECLARE_ID, DELAY_ID, DELTA_ID, DIGITS_ID, DO_ID, ELSE_ID, ELSIF_ID, END_ID, ENTRY_ID, EXCEPTION_ID, EXIT_ID, FOR_ID, FUNCTION_ID, GENERIC_ID, GOTO_ID, IF_ID, IN_ID, INTERFACE_ID, IS_ID, LIMITED_ID, LOOP_ID, MOD_ID, NEW_ID, NOT_ID, NULL_ID, OF_ID, OR_ID, OTHERS_ID, OUT_ID, OVERRIDING_ID, PACKAGE_ID, PRAGMA_ID, PRIVATE_ID, PROCEDURE_ID, PROTECTED_ID, RAISE_ID, RANGE_ID, RECORD_ID, REM_ID, RENAMES_ID, REQUEUE_ID, RETURN_ID, REVERSE_ID, SEPARATE_ID, SELECT_ID, SOME_ID, SUBTYPE_ID, SYNCHRONIZED_ID, TAGGED_ID, TASK_ID, TERMINATE_ID, THEN_ID, TYPE_ID, UNTIL_ID, USE_ID, WHEN_ID, WHILE_ID, WITH_ID, XOR_ID, LEFT_PAREN_ID, RIGHT_PAREN_ID, AMPERSAND_ID, BAR_ID, BOX_ID, COLON_ID, COLON_EQUAL_ID, COMMA_ID, DOT_ID, DOT_DOT_ID, EQUAL_ID, EQUAL_GREATER_ID, GREATER_ID, GREATER_EQUAL_ID, GREATER_GREATER_ID, LESS_ID, LESS_EQUAL_ID, LESS_LESS_ID, MINUS_ID, PLUS_ID, SEMICOLON_ID, SLASH_ID, SLASH_EQUAL_ID, STAR_ID, STAR_STAR_ID, TICK_1_ID, TICK_2_ID, NUMERIC_LITERAL_ID, IDENTIFIER_ID, STRING_LITERAL_ID, CHARACTER_LITERAL_ID, Wisi_EOI_ID, wisitoken_accept_ID, abstract_limited_synchronized_opt_ID, abstract_limited_opt_ID, abstract_tagged_limited_opt_ID, abstract_subprogram_declaration_ID, accept_statement_ID, access_definition_ID, actual_parameter_part_ID, actual_parameter_part_opt_ID, aggregate_ID, aliased_opt_ID, and_interface_list_opt_ID, array_type_definition_ID, aspect_clause_ID, aspect_specification_opt_ID, assignment_statement_ID, association_opt_ID, association_list_ID, asynchronous_select_ID, at_clause_ID, attribute_reference_ID, attribute_designator_ID, binary_adding_operator_ID, block_label_ID, block_label_opt_ID, block_statement_ID, body_g_ID, body_stub_ID, case_expression_ID, case_expression_alternative_ID, case_expression_alternative_list_ID, case_statement_ID, case_statement_alternative_ID, case_statement_alternative_list_ID, compilation_unit_ID, compilation_unit_list_ID, component_clause_ID, component_clause_list_ID, component_declaration_ID, component_definition_ID, component_item_ID, component_list_ID, component_list_opt_ID, compound_statement_ID, conditional_entry_call_ID, conditional_quantified_expression_ID, constant_opt_ID, constraint_ID, constraint_opt_ID, declaration_ID, declarations_ID, declarative_part_opt_ID, delay_alternative_ID, delay_statement_ID, derived_type_definition_ID, direct_name_ID, direct_name_opt_ID, discrete_choice_ID, discrete_choice_list_ID, discrete_subtype_definition_ID, discrete_subtype_definition_list_ID, discriminant_part_opt_ID, discriminant_specification_opt_ID, discriminant_specification_list_ID, elsif_expression_item_ID, elsif_expression_list_ID, elsif_statement_item_ID, elsif_statement_list_ID, entry_body_ID, entry_body_formal_part_ID, entry_call_alternative_ID, entry_declaration_ID, enumeration_literal_ID, enumeration_literal_list_ID, enumeration_representation_clause_ID, enumeration_type_definition_ID, exception_choice_ID, exception_choice_list_ID, exception_declaration_ID, exception_handler_ID, exception_handler_list_ID, exception_handler_list_opt_ID, exit_statement_ID, expression_ID, expression_opt_ID, expression_function_declaration_ID, extended_return_object_declaration_ID, extended_return_object_declaration_opt_ID, extended_return_statement_ID, factor_ID, formal_object_declaration_ID, formal_part_ID, formal_subprogram_declaration_ID, formal_type_declaration_ID, formal_type_definition_ID, formal_derived_type_definition_ID, formal_package_declaration_ID, formal_package_actual_part_ID, full_type_declaration_ID, function_specification_ID, general_access_modifier_opt_ID, generic_declaration_ID, generic_formal_part_ID, generic_formal_parameter_declarations_ID, generic_formal_parameter_declaration_ID, generic_instantiation_ID, generic_package_declaration_ID, generic_renaming_declaration_ID, generic_subprogram_declaration_ID, goto_label_ID, handled_sequence_of_statements_ID, identifier_list_ID, identifier_opt_ID, if_expression_ID, if_statement_ID, incomplete_type_declaration_ID, index_constraint_ID, index_subtype_definition_ID, index_subtype_definition_list_ID, interface_list_ID, interface_type_definition_ID, iteration_scheme_ID, iterator_specification_ID, iterator_specification_opt_ID, loop_statement_ID, membership_choice_list_ID, membership_choice_ID, mod_clause_opt_ID, mode_opt_ID, multiplying_operator_ID, name_list_ID, name_ID, name_opt_ID, null_exclusion_opt_ID, null_exclusion_opt_name_type_ID, null_procedure_declaration_ID, object_declaration_ID, object_renaming_declaration_ID, overriding_indicator_opt_ID, package_body_ID, package_body_stub_ID, package_declaration_ID, package_renaming_declaration_ID, package_specification_ID, parameter_and_result_profile_ID, parameter_profile_opt_ID, parameter_specification_ID, parameter_specification_list_ID, paren_expression_ID, pragma_g_ID, primary_ID, private_extension_declaration_ID, private_type_declaration_ID, procedure_call_statement_ID, procedure_specification_ID, proper_body_ID, protected_body_ID, protected_body_stub_ID, protected_definition_ID, protected_operation_item_ID, protected_operation_item_list_ID, protected_operation_item_list_opt_ID, protected_opt_ID, protected_type_declaration_ID, qualified_expression_ID, quantified_expression_ID, quantifier_ID, raise_expression_ID, raise_statement_ID, range_g_ID, range_list_ID, real_range_specification_opt_ID, record_definition_ID, record_representation_clause_ID, relation_and_list_ID, relation_and_then_list_ID, relation_or_list_ID, relation_or_else_list_ID, relation_xor_list_ID, relation_ID, relational_operator_ID, renaming_declaration_ID, requeue_statement_ID, result_profile_ID, return_subtype_indication_ID, selected_component_ID, selective_accept_ID, select_alternative_ID, select_alternative_list_ID, select_alternative_list_opt_ID, select_statement_ID, sequence_of_statements_ID, sequence_of_statements_opt_ID, simple_expression_ID, simple_return_statement_ID, simple_statement_ID, single_protected_declaration_ID, single_task_declaration_ID, statement_ID, subprogram_body_ID, subprogram_body_stub_ID, subprogram_declaration_ID, subprogram_default_ID, subprogram_renaming_declaration_ID, subprogram_specification_ID, subtype_declaration_ID, subtype_indication_ID, subunit_ID, task_body_ID, task_body_stub_ID, task_definition_ID, task_type_declaration_ID, term_ID, term_list_ID, tick_ID, timed_entry_call_ID, triggering_alternative_ID, type_declaration_ID, type_definition_ID, variant_part_ID, variant_list_ID, variant_ID, unary_adding_operator_ID, use_clause_ID, with_clause_ID); type Token_Enum_ID_Array is array (Positive range <>) of Token_Enum_ID; use all type WisiToken.Token_ID; function "+" (Item : in Token_Enum_ID) return WisiToken.Token_ID is (WisiToken.Token_ID'First + Token_Enum_ID'Pos (Item)); function To_Token_Enum (Item : in WisiToken.Token_ID) return Token_Enum_ID is (Token_Enum_ID'Val (Item - WisiToken.Token_ID'First)); function "-" (Item : in WisiToken.Token_ID) return Token_Enum_ID renames To_Token_Enum; procedure abstract_subprogram_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure accept_statement_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure accept_statement_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure access_definition_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure access_definition_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure access_definition_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure actual_parameter_part_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure actual_parameter_part_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure aggregate_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure aggregate_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure aggregate_3 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure aggregate_4 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure array_type_definition_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure array_type_definition_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure aspect_clause_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure aspect_specification_opt_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure assignment_statement_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure association_opt_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure association_opt_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure association_opt_3 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure association_opt_4 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure asynchronous_select_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure at_clause_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure block_label_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure block_statement_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure block_statement_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure case_expression_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure case_expression_alternative_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure case_expression_alternative_list_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure case_statement_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure case_statement_alternative_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure compilation_unit_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure compilation_unit_list_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure compilation_unit_list_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure component_clause_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure component_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure component_declaration_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure component_list_4 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure conditional_entry_call_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure declaration_9 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure delay_statement_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure delay_statement_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure derived_type_definition_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure derived_type_definition_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure discriminant_part_opt_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure elsif_expression_item_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure elsif_statement_item_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure entry_body_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure entry_body_formal_part_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure entry_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure entry_declaration_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure enumeration_representation_clause_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure enumeration_type_definition_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure exception_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure exception_handler_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure exception_handler_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure exit_statement_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure exit_statement_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure expression_function_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure extended_return_object_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure extended_return_object_declaration_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure extended_return_statement_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure extended_return_statement_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure formal_object_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure formal_object_declaration_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure formal_object_declaration_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure formal_object_declaration_3 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure formal_part_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure formal_subprogram_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure formal_subprogram_declaration_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure formal_subprogram_declaration_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure formal_subprogram_declaration_3 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure formal_type_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure formal_type_declaration_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure formal_type_declaration_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure formal_derived_type_definition_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure formal_derived_type_definition_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure formal_package_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure full_type_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure function_specification_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure generic_formal_part_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure generic_formal_part_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure generic_instantiation_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure generic_instantiation_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure generic_instantiation_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure generic_package_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure generic_renaming_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure generic_renaming_declaration_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure generic_renaming_declaration_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure generic_subprogram_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure goto_label_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure handled_sequence_of_statements_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure identifier_list_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure identifier_list_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure if_expression_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure if_expression_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure if_expression_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure if_expression_3 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure if_statement_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure if_statement_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure if_statement_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure if_statement_3 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure incomplete_type_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure incomplete_type_declaration_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure index_constraint_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure interface_list_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure interface_list_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure iteration_scheme_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure iteration_scheme_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure iterator_specification_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure iterator_specification_5 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure loop_statement_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure loop_statement_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure name_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure name_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure name_5 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure null_exclusion_opt_name_type_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure null_exclusion_opt_name_type_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure null_exclusion_opt_name_type_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure null_exclusion_opt_name_type_3 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure null_procedure_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure object_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure object_declaration_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure object_declaration_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure object_declaration_3 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure object_declaration_4 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure object_declaration_5 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure object_renaming_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure object_renaming_declaration_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure object_renaming_declaration_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure overriding_indicator_opt_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure overriding_indicator_opt_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure package_body_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure package_body_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure package_body_stub_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure package_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure package_renaming_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure package_specification_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure package_specification_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure parameter_and_result_profile_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure parameter_specification_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure parameter_specification_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure parameter_specification_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure parameter_specification_3 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure parameter_specification_list_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure paren_expression_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure paren_expression_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure paren_expression_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure pragma_g_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure pragma_g_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure pragma_g_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure primary_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure primary_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure primary_4 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure private_extension_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure private_type_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure procedure_call_statement_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure procedure_specification_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure protected_body_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure protected_body_stub_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure protected_definition_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure protected_definition_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure protected_type_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure protected_type_declaration_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure qualified_expression_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure quantified_expression_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure raise_expression_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure raise_statement_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure raise_statement_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure raise_statement_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure range_g_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure record_definition_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure record_representation_clause_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure requeue_statement_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure requeue_statement_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure result_profile_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure result_profile_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure selected_component_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure selected_component_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure selected_component_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure selected_component_3 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure selective_accept_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure selective_accept_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure select_alternative_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure select_alternative_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure select_alternative_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure select_alternative_4 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure select_alternative_list_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure select_alternative_list_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure simple_return_statement_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure simple_statement_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure simple_statement_3 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure simple_statement_8 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure single_protected_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure single_protected_declaration_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure single_task_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure single_task_declaration_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure single_task_declaration_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure subprogram_body_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure subprogram_body_stub_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure subprogram_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure subprogram_default_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure subprogram_renaming_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure subtype_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure subtype_indication_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure subtype_indication_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure subtype_indication_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure subtype_indication_3 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure subunit_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure task_body_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure task_body_stub_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure task_definition_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure task_definition_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure task_type_declaration_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure task_type_declaration_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure task_type_declaration_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure timed_entry_call_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure variant_part_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure variant_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure use_clause_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure use_clause_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure use_clause_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure with_clause_0 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure with_clause_1 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure with_clause_2 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); procedure with_clause_3 (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class; Tree : in out WisiToken.Syntax_Trees.Tree; Nonterm : in WisiToken.Syntax_Trees.Valid_Node_Index; Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array); function accept_statement_0_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function block_label_0_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function block_label_opt_0_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function block_statement_0_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function block_statement_1_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function compilation_unit_list_1_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function entry_body_0_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function function_specification_0_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function identifier_opt_0_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function loop_statement_0_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function loop_statement_1_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function name_2_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function name_5_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function name_7_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function name_opt_0_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function package_body_0_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function package_body_1_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function package_specification_0_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function package_specification_1_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function procedure_specification_0_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function protected_body_0_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function protected_definition_0_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function protected_definition_1_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function protected_type_declaration_0_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function protected_type_declaration_1_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function selected_component_0_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function selected_component_2_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function single_protected_declaration_0_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function single_protected_declaration_1_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function single_task_declaration_0_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function single_task_declaration_1_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function subprogram_body_0_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function subprogram_specification_0_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function subprogram_specification_1_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function task_body_0_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function task_type_declaration_0_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; function task_type_declaration_1_check (Lexer : access constant WisiToken.Lexer.Instance'Class; Nonterm : in out WisiToken.Recover_Token; Tokens : in WisiToken.Recover_Token_Array; Recover_Active : in Boolean) return WisiToken.Semantic_Checks.Check_Status; Partial_Parse_Active : Boolean := False; Partial_Parse_Byte_Goal : WisiToken.Buffer_Pos := WisiToken.Buffer_Pos'Last; end Ada_Process_Actions;

49.408587

99

0.70299

505f5989a10a778459c6e761c45c9639eefd6e79

2,840

ads

Ada

src/shared/generic/lsc-ops_generic.ads

Componolit/libsparkcrypto

8531a07b6e9f5eb33eae0fa32759b4cbd3509d95

[ "OpenSSL", "Unlicense" ]

30

2018-05-18T09:11:50.000Z

2021-05-18T16:29:14.000Z

src/shared/generic/lsc-ops_generic.ads

Componolit/libsparkcrypto

8531a07b6e9f5eb33eae0fa32759b4cbd3509d95

[ "OpenSSL", "Unlicense" ]

15

2018-12-13T07:53:36.000Z

2019-09-24T19:43:35.000Z

src/shared/generic/lsc-ops_generic.ads

Componolit/libsparkcrypto

8531a07b6e9f5eb33eae0fa32759b4cbd3509d95

[ "OpenSSL", "Unlicense" ]

3

2019-04-04T17:41:29.000Z

2021-05-07T22:28:46.000Z

------------------------------------------------------------------------------- -- This file is part of libsparkcrypto. -- -- @author Alexander Senier -- @date 2019-01-22 -- -- Copyright (C) 2018 Componolit GmbH -- All rights reserved. -- -- Redistribution and use in source and binary forms, with or without -- modification, are permitted provided that the following conditions are met: -- -- * Redistributions of source code must retain the above copyright notice, -- this list of conditions and the following disclaimer. -- -- * Redistributions in binary form must reproduce the above copyright -- notice, this list of conditions and the following disclaimer in the -- documentation and/or other materials provided with the distribution. -- -- * Neither the name of the nor the names of its contributors may be used -- to endorse or promote products derived from this software without -- specific prior written permission. -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" -- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE -- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS -- BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR -- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF -- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS -- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN -- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) -- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE -- POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------- package LSC.Ops_Generic is pragma Pure; -- Perform XOR on two arrays of 8-bit element types -- -- @Left@ - First input array -- @Right@ - Second input array -- @Result@ - Result array generic type Left_Index_Type is (<>); type Left_Elem_Type is (<>); type Left_Data_Type is array (Left_Index_Type range <>) of Left_Elem_Type; type Right_Index_Type is (<>); type Right_Elem_Type is (<>); type Right_Data_Type is array (Right_Index_Type range <>) of Right_Elem_Type; type Result_Index_Type is (<>); type Result_Elem_Type is (<>); type Result_Data_Type is array (Result_Index_Type range <>) of Result_Elem_Type; procedure Array_XOR (Left : in Left_Data_Type; Right : in Right_Data_Type; Result : out Result_Data_Type) with Pre => Left'Length = Right'Length and Result'Length >= Left'Length; end LSC.Ops_Generic;

43.030303

86

0.659155

a1d055c39843e065a5284ec6e63c891fefc5fd16

24,304

ads

Ada

stm32f0/stm32f051x/svd/stm32_svd-usart.ads

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

1

2021-04-06T07:57:56.000Z

stm32f0/stm32f051x/svd/stm32_svd-usart.ads

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

null

stm32f0/stm32f051x/svd/stm32_svd-usart.ads

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

2

2018-05-29T13:59:31.000Z

2019-02-03T19:48:08.000Z

-- This spec has been automatically generated from STM32F0xx.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with System; package STM32_SVD.USART is pragma Preelaborate; --------------- -- Registers -- --------------- subtype CR1_UE_Field is STM32_SVD.Bit; subtype CR1_UESM_Field is STM32_SVD.Bit; subtype CR1_RE_Field is STM32_SVD.Bit; subtype CR1_TE_Field is STM32_SVD.Bit; subtype CR1_IDLEIE_Field is STM32_SVD.Bit; subtype CR1_RXNEIE_Field is STM32_SVD.Bit; subtype CR1_TCIE_Field is STM32_SVD.Bit; subtype CR1_TXEIE_Field is STM32_SVD.Bit; subtype CR1_PEIE_Field is STM32_SVD.Bit; subtype CR1_PS_Field is STM32_SVD.Bit; subtype CR1_PCE_Field is STM32_SVD.Bit; subtype CR1_WAKE_Field is STM32_SVD.Bit; subtype CR1_M_Field is STM32_SVD.Bit; subtype CR1_MME_Field is STM32_SVD.Bit; subtype CR1_CMIE_Field is STM32_SVD.Bit; subtype CR1_OVER8_Field is STM32_SVD.Bit; subtype CR1_DEDT_Field is STM32_SVD.UInt5; subtype CR1_DEAT_Field is STM32_SVD.UInt5; subtype CR1_RTOIE_Field is STM32_SVD.Bit; subtype CR1_EOBIE_Field is STM32_SVD.Bit; -- Control register 1 type CR1_Register is record -- USART enable UE : CR1_UE_Field := 16#0#; -- USART enable in Stop mode UESM : CR1_UESM_Field := 16#0#; -- Receiver enable RE : CR1_RE_Field := 16#0#; -- Transmitter enable TE : CR1_TE_Field := 16#0#; -- IDLE interrupt enable IDLEIE : CR1_IDLEIE_Field := 16#0#; -- RXNE interrupt enable RXNEIE : CR1_RXNEIE_Field := 16#0#; -- Transmission complete interrupt enable TCIE : CR1_TCIE_Field := 16#0#; -- interrupt enable TXEIE : CR1_TXEIE_Field := 16#0#; -- PE interrupt enable PEIE : CR1_PEIE_Field := 16#0#; -- Parity selection PS : CR1_PS_Field := 16#0#; -- Parity control enable PCE : CR1_PCE_Field := 16#0#; -- Receiver wakeup method WAKE : CR1_WAKE_Field := 16#0#; -- Word length M : CR1_M_Field := 16#0#; -- Mute mode enable MME : CR1_MME_Field := 16#0#; -- Character match interrupt enable CMIE : CR1_CMIE_Field := 16#0#; -- Oversampling mode OVER8 : CR1_OVER8_Field := 16#0#; -- Driver Enable deassertion time DEDT : CR1_DEDT_Field := 16#0#; -- Driver Enable assertion time DEAT : CR1_DEAT_Field := 16#0#; -- Receiver timeout interrupt enable RTOIE : CR1_RTOIE_Field := 16#0#; -- End of Block interrupt enable EOBIE : CR1_EOBIE_Field := 16#0#; -- unspecified Reserved_28_31 : STM32_SVD.UInt4 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR1_Register use record UE at 0 range 0 .. 0; UESM at 0 range 1 .. 1; RE at 0 range 2 .. 2; TE at 0 range 3 .. 3; IDLEIE at 0 range 4 .. 4; RXNEIE at 0 range 5 .. 5; TCIE at 0 range 6 .. 6; TXEIE at 0 range 7 .. 7; PEIE at 0 range 8 .. 8; PS at 0 range 9 .. 9; PCE at 0 range 10 .. 10; WAKE at 0 range 11 .. 11; M at 0 range 12 .. 12; MME at 0 range 13 .. 13; CMIE at 0 range 14 .. 14; OVER8 at 0 range 15 .. 15; DEDT at 0 range 16 .. 20; DEAT at 0 range 21 .. 25; RTOIE at 0 range 26 .. 26; EOBIE at 0 range 27 .. 27; Reserved_28_31 at 0 range 28 .. 31; end record; subtype CR2_ADDM7_Field is STM32_SVD.Bit; subtype CR2_LBDL_Field is STM32_SVD.Bit; subtype CR2_LBDIE_Field is STM32_SVD.Bit; subtype CR2_LBCL_Field is STM32_SVD.Bit; subtype CR2_CPHA_Field is STM32_SVD.Bit; subtype CR2_CPOL_Field is STM32_SVD.Bit; subtype CR2_CLKEN_Field is STM32_SVD.Bit; subtype CR2_STOP_Field is STM32_SVD.UInt2; subtype CR2_LINEN_Field is STM32_SVD.Bit; subtype CR2_SWAP_Field is STM32_SVD.Bit; subtype CR2_RXINV_Field is STM32_SVD.Bit; subtype CR2_TXINV_Field is STM32_SVD.Bit; subtype CR2_DATAINV_Field is STM32_SVD.Bit; subtype CR2_MSBFIRST_Field is STM32_SVD.Bit; subtype CR2_ABREN_Field is STM32_SVD.Bit; subtype CR2_ABRMOD_Field is STM32_SVD.UInt2; subtype CR2_RTOEN_Field is STM32_SVD.Bit; -- CR2_ADD array element subtype CR2_ADD_Element is STM32_SVD.UInt4; -- CR2_ADD array type CR2_ADD_Field_Array is array (0 .. 1) of CR2_ADD_Element with Component_Size => 4, Size => 8; -- Type definition for CR2_ADD type CR2_ADD_Field (As_Array : Boolean := False) is record case As_Array is when False => -- ADD as a value Val : STM32_SVD.Byte; when True => -- ADD as an array Arr : CR2_ADD_Field_Array; end case; end record with Unchecked_Union, Size => 8; for CR2_ADD_Field use record Val at 0 range 0 .. 7; Arr at 0 range 0 .. 7; end record; -- Control register 2 type CR2_Register is record -- unspecified Reserved_0_3 : STM32_SVD.UInt4 := 16#0#; -- 7-bit Address Detection/4-bit Address Detection ADDM7 : CR2_ADDM7_Field := 16#0#; -- LIN break detection length LBDL : CR2_LBDL_Field := 16#0#; -- LIN break detection interrupt enable LBDIE : CR2_LBDIE_Field := 16#0#; -- unspecified Reserved_7_7 : STM32_SVD.Bit := 16#0#; -- Last bit clock pulse LBCL : CR2_LBCL_Field := 16#0#; -- Clock phase CPHA : CR2_CPHA_Field := 16#0#; -- Clock polarity CPOL : CR2_CPOL_Field := 16#0#; -- Clock enable CLKEN : CR2_CLKEN_Field := 16#0#; -- STOP bits STOP : CR2_STOP_Field := 16#0#; -- LIN mode enable LINEN : CR2_LINEN_Field := 16#0#; -- Swap TX/RX pins SWAP : CR2_SWAP_Field := 16#0#; -- RX pin active level inversion RXINV : CR2_RXINV_Field := 16#0#; -- TX pin active level inversion TXINV : CR2_TXINV_Field := 16#0#; -- Binary data inversion DATAINV : CR2_DATAINV_Field := 16#0#; -- Most significant bit first MSBFIRST : CR2_MSBFIRST_Field := 16#0#; -- Auto baud rate enable ABREN : CR2_ABREN_Field := 16#0#; -- Auto baud rate mode ABRMOD : CR2_ABRMOD_Field := 16#0#; -- Receiver timeout enable RTOEN : CR2_RTOEN_Field := 16#0#; -- Address of the USART node ADD : CR2_ADD_Field := (As_Array => False, Val => 16#0#); end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR2_Register use record Reserved_0_3 at 0 range 0 .. 3; ADDM7 at 0 range 4 .. 4; LBDL at 0 range 5 .. 5; LBDIE at 0 range 6 .. 6; Reserved_7_7 at 0 range 7 .. 7; LBCL at 0 range 8 .. 8; CPHA at 0 range 9 .. 9; CPOL at 0 range 10 .. 10; CLKEN at 0 range 11 .. 11; STOP at 0 range 12 .. 13; LINEN at 0 range 14 .. 14; SWAP at 0 range 15 .. 15; RXINV at 0 range 16 .. 16; TXINV at 0 range 17 .. 17; DATAINV at 0 range 18 .. 18; MSBFIRST at 0 range 19 .. 19; ABREN at 0 range 20 .. 20; ABRMOD at 0 range 21 .. 22; RTOEN at 0 range 23 .. 23; ADD at 0 range 24 .. 31; end record; subtype CR3_EIE_Field is STM32_SVD.Bit; subtype CR3_IREN_Field is STM32_SVD.Bit; subtype CR3_IRLP_Field is STM32_SVD.Bit; subtype CR3_HDSEL_Field is STM32_SVD.Bit; subtype CR3_NACK_Field is STM32_SVD.Bit; subtype CR3_SCEN_Field is STM32_SVD.Bit; subtype CR3_DMAR_Field is STM32_SVD.Bit; subtype CR3_DMAT_Field is STM32_SVD.Bit; subtype CR3_RTSE_Field is STM32_SVD.Bit; subtype CR3_CTSE_Field is STM32_SVD.Bit; subtype CR3_CTSIE_Field is STM32_SVD.Bit; subtype CR3_ONEBIT_Field is STM32_SVD.Bit; subtype CR3_OVRDIS_Field is STM32_SVD.Bit; subtype CR3_DDRE_Field is STM32_SVD.Bit; subtype CR3_DEM_Field is STM32_SVD.Bit; subtype CR3_DEP_Field is STM32_SVD.Bit; subtype CR3_SCARCNT_Field is STM32_SVD.UInt3; subtype CR3_WUS_Field is STM32_SVD.UInt2; subtype CR3_WUFIE_Field is STM32_SVD.Bit; -- Control register 3 type CR3_Register is record -- Error interrupt enable EIE : CR3_EIE_Field := 16#0#; -- IrDA mode enable IREN : CR3_IREN_Field := 16#0#; -- IrDA low-power IRLP : CR3_IRLP_Field := 16#0#; -- Half-duplex selection HDSEL : CR3_HDSEL_Field := 16#0#; -- Smartcard NACK enable NACK : CR3_NACK_Field := 16#0#; -- Smartcard mode enable SCEN : CR3_SCEN_Field := 16#0#; -- DMA enable receiver DMAR : CR3_DMAR_Field := 16#0#; -- DMA enable transmitter DMAT : CR3_DMAT_Field := 16#0#; -- RTS enable RTSE : CR3_RTSE_Field := 16#0#; -- CTS enable CTSE : CR3_CTSE_Field := 16#0#; -- CTS interrupt enable CTSIE : CR3_CTSIE_Field := 16#0#; -- One sample bit method enable ONEBIT : CR3_ONEBIT_Field := 16#0#; -- Overrun Disable OVRDIS : CR3_OVRDIS_Field := 16#0#; -- DMA Disable on Reception Error DDRE : CR3_DDRE_Field := 16#0#; -- Driver enable mode DEM : CR3_DEM_Field := 16#0#; -- Driver enable polarity selection DEP : CR3_DEP_Field := 16#0#; -- unspecified Reserved_16_16 : STM32_SVD.Bit := 16#0#; -- Smartcard auto-retry count SCARCNT : CR3_SCARCNT_Field := 16#0#; -- Wakeup from Stop mode interrupt flag selection WUS : CR3_WUS_Field := 16#0#; -- Wakeup from Stop mode interrupt enable WUFIE : CR3_WUFIE_Field := 16#0#; -- unspecified Reserved_23_31 : STM32_SVD.UInt9 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR3_Register use record EIE at 0 range 0 .. 0; IREN at 0 range 1 .. 1; IRLP at 0 range 2 .. 2; HDSEL at 0 range 3 .. 3; NACK at 0 range 4 .. 4; SCEN at 0 range 5 .. 5; DMAR at 0 range 6 .. 6; DMAT at 0 range 7 .. 7; RTSE at 0 range 8 .. 8; CTSE at 0 range 9 .. 9; CTSIE at 0 range 10 .. 10; ONEBIT at 0 range 11 .. 11; OVRDIS at 0 range 12 .. 12; DDRE at 0 range 13 .. 13; DEM at 0 range 14 .. 14; DEP at 0 range 15 .. 15; Reserved_16_16 at 0 range 16 .. 16; SCARCNT at 0 range 17 .. 19; WUS at 0 range 20 .. 21; WUFIE at 0 range 22 .. 22; Reserved_23_31 at 0 range 23 .. 31; end record; subtype BRR_DIV_Fraction_Field is STM32_SVD.UInt4; subtype BRR_DIV_Mantissa_Field is STM32_SVD.UInt12; -- Baud rate register type BRR_Register is record -- fraction of USARTDIV DIV_Fraction : BRR_DIV_Fraction_Field := 16#0#; -- mantissa of USARTDIV DIV_Mantissa : BRR_DIV_Mantissa_Field := 16#0#; -- unspecified Reserved_16_31 : STM32_SVD.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for BRR_Register use record DIV_Fraction at 0 range 0 .. 3; DIV_Mantissa at 0 range 4 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype GTPR_PSC_Field is STM32_SVD.Byte; subtype GTPR_GT_Field is STM32_SVD.Byte; -- Guard time and prescaler register type GTPR_Register is record -- Prescaler value PSC : GTPR_PSC_Field := 16#0#; -- Guard time value GT : GTPR_GT_Field := 16#0#; -- unspecified Reserved_16_31 : STM32_SVD.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for GTPR_Register use record PSC at 0 range 0 .. 7; GT at 0 range 8 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype RTOR_RTO_Field is STM32_SVD.UInt24; subtype RTOR_BLEN_Field is STM32_SVD.Byte; -- Receiver timeout register type RTOR_Register is record -- Receiver timeout value RTO : RTOR_RTO_Field := 16#0#; -- Block Length BLEN : RTOR_BLEN_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for RTOR_Register use record RTO at 0 range 0 .. 23; BLEN at 0 range 24 .. 31; end record; subtype RQR_ABRRQ_Field is STM32_SVD.Bit; subtype RQR_SBKRQ_Field is STM32_SVD.Bit; subtype RQR_MMRQ_Field is STM32_SVD.Bit; subtype RQR_RXFRQ_Field is STM32_SVD.Bit; subtype RQR_TXFRQ_Field is STM32_SVD.Bit; -- Request register type RQR_Register is record -- Auto baud rate request ABRRQ : RQR_ABRRQ_Field := 16#0#; -- Send break request SBKRQ : RQR_SBKRQ_Field := 16#0#; -- Mute mode request MMRQ : RQR_MMRQ_Field := 16#0#; -- Receive data flush request RXFRQ : RQR_RXFRQ_Field := 16#0#; -- Transmit data flush request TXFRQ : RQR_TXFRQ_Field := 16#0#; -- unspecified Reserved_5_31 : STM32_SVD.UInt27 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for RQR_Register use record ABRRQ at 0 range 0 .. 0; SBKRQ at 0 range 1 .. 1; MMRQ at 0 range 2 .. 2; RXFRQ at 0 range 3 .. 3; TXFRQ at 0 range 4 .. 4; Reserved_5_31 at 0 range 5 .. 31; end record; subtype ISR_PE_Field is STM32_SVD.Bit; subtype ISR_FE_Field is STM32_SVD.Bit; subtype ISR_NF_Field is STM32_SVD.Bit; subtype ISR_ORE_Field is STM32_SVD.Bit; subtype ISR_IDLE_Field is STM32_SVD.Bit; subtype ISR_RXNE_Field is STM32_SVD.Bit; subtype ISR_TC_Field is STM32_SVD.Bit; subtype ISR_TXE_Field is STM32_SVD.Bit; subtype ISR_LBDF_Field is STM32_SVD.Bit; subtype ISR_CTSIF_Field is STM32_SVD.Bit; subtype ISR_CTS_Field is STM32_SVD.Bit; subtype ISR_RTOF_Field is STM32_SVD.Bit; subtype ISR_EOBF_Field is STM32_SVD.Bit; subtype ISR_ABRE_Field is STM32_SVD.Bit; subtype ISR_ABRF_Field is STM32_SVD.Bit; subtype ISR_BUSY_Field is STM32_SVD.Bit; subtype ISR_CMF_Field is STM32_SVD.Bit; subtype ISR_SBKF_Field is STM32_SVD.Bit; subtype ISR_RWU_Field is STM32_SVD.Bit; subtype ISR_WUF_Field is STM32_SVD.Bit; subtype ISR_TEACK_Field is STM32_SVD.Bit; subtype ISR_REACK_Field is STM32_SVD.Bit; -- Interrupt & status register type ISR_Register is record -- Read-only. Parity error PE : ISR_PE_Field; -- Read-only. Framing error FE : ISR_FE_Field; -- Read-only. Noise detected flag NF : ISR_NF_Field; -- Read-only. Overrun error ORE : ISR_ORE_Field; -- Read-only. Idle line detected IDLE : ISR_IDLE_Field; -- Read-only. Read data register not empty RXNE : ISR_RXNE_Field; -- Read-only. Transmission complete TC : ISR_TC_Field; -- Read-only. Transmit data register empty TXE : ISR_TXE_Field; -- Read-only. LIN break detection flag LBDF : ISR_LBDF_Field; -- Read-only. CTS interrupt flag CTSIF : ISR_CTSIF_Field; -- Read-only. CTS flag CTS : ISR_CTS_Field; -- Read-only. Receiver timeout RTOF : ISR_RTOF_Field; -- Read-only. End of block flag EOBF : ISR_EOBF_Field; -- unspecified Reserved_13_13 : STM32_SVD.Bit; -- Read-only. Auto baud rate error ABRE : ISR_ABRE_Field; -- Read-only. Auto baud rate flag ABRF : ISR_ABRF_Field; -- Read-only. Busy flag BUSY : ISR_BUSY_Field; -- Read-only. character match flag CMF : ISR_CMF_Field; -- Read-only. Send break flag SBKF : ISR_SBKF_Field; -- Read-only. Receiver wakeup from Mute mode RWU : ISR_RWU_Field; -- Read-only. Wakeup from Stop mode flag WUF : ISR_WUF_Field; -- Read-only. Transmit enable acknowledge flag TEACK : ISR_TEACK_Field; -- Read-only. Receive enable acknowledge flag REACK : ISR_REACK_Field; -- unspecified Reserved_23_31 : STM32_SVD.UInt9; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for ISR_Register use record PE at 0 range 0 .. 0; FE at 0 range 1 .. 1; NF at 0 range 2 .. 2; ORE at 0 range 3 .. 3; IDLE at 0 range 4 .. 4; RXNE at 0 range 5 .. 5; TC at 0 range 6 .. 6; TXE at 0 range 7 .. 7; LBDF at 0 range 8 .. 8; CTSIF at 0 range 9 .. 9; CTS at 0 range 10 .. 10; RTOF at 0 range 11 .. 11; EOBF at 0 range 12 .. 12; Reserved_13_13 at 0 range 13 .. 13; ABRE at 0 range 14 .. 14; ABRF at 0 range 15 .. 15; BUSY at 0 range 16 .. 16; CMF at 0 range 17 .. 17; SBKF at 0 range 18 .. 18; RWU at 0 range 19 .. 19; WUF at 0 range 20 .. 20; TEACK at 0 range 21 .. 21; REACK at 0 range 22 .. 22; Reserved_23_31 at 0 range 23 .. 31; end record; subtype ICR_PECF_Field is STM32_SVD.Bit; subtype ICR_FECF_Field is STM32_SVD.Bit; subtype ICR_NCF_Field is STM32_SVD.Bit; subtype ICR_ORECF_Field is STM32_SVD.Bit; subtype ICR_IDLECF_Field is STM32_SVD.Bit; subtype ICR_TCCF_Field is STM32_SVD.Bit; subtype ICR_LBDCF_Field is STM32_SVD.Bit; subtype ICR_CTSCF_Field is STM32_SVD.Bit; subtype ICR_RTOCF_Field is STM32_SVD.Bit; subtype ICR_EOBCF_Field is STM32_SVD.Bit; subtype ICR_CMCF_Field is STM32_SVD.Bit; subtype ICR_WUCF_Field is STM32_SVD.Bit; -- Interrupt flag clear register type ICR_Register is record -- Parity error clear flag PECF : ICR_PECF_Field := 16#0#; -- Framing error clear flag FECF : ICR_FECF_Field := 16#0#; -- Noise detected clear flag NCF : ICR_NCF_Field := 16#0#; -- Overrun error clear flag ORECF : ICR_ORECF_Field := 16#0#; -- Idle line detected clear flag IDLECF : ICR_IDLECF_Field := 16#0#; -- unspecified Reserved_5_5 : STM32_SVD.Bit := 16#0#; -- Transmission complete clear flag TCCF : ICR_TCCF_Field := 16#0#; -- unspecified Reserved_7_7 : STM32_SVD.Bit := 16#0#; -- LIN break detection clear flag LBDCF : ICR_LBDCF_Field := 16#0#; -- CTS clear flag CTSCF : ICR_CTSCF_Field := 16#0#; -- unspecified Reserved_10_10 : STM32_SVD.Bit := 16#0#; -- Receiver timeout clear flag RTOCF : ICR_RTOCF_Field := 16#0#; -- End of timeout clear flag EOBCF : ICR_EOBCF_Field := 16#0#; -- unspecified Reserved_13_16 : STM32_SVD.UInt4 := 16#0#; -- Character match clear flag CMCF : ICR_CMCF_Field := 16#0#; -- unspecified Reserved_18_19 : STM32_SVD.UInt2 := 16#0#; -- Wakeup from Stop mode clear flag WUCF : ICR_WUCF_Field := 16#0#; -- unspecified Reserved_21_31 : STM32_SVD.UInt11 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for ICR_Register use record PECF at 0 range 0 .. 0; FECF at 0 range 1 .. 1; NCF at 0 range 2 .. 2; ORECF at 0 range 3 .. 3; IDLECF at 0 range 4 .. 4; Reserved_5_5 at 0 range 5 .. 5; TCCF at 0 range 6 .. 6; Reserved_7_7 at 0 range 7 .. 7; LBDCF at 0 range 8 .. 8; CTSCF at 0 range 9 .. 9; Reserved_10_10 at 0 range 10 .. 10; RTOCF at 0 range 11 .. 11; EOBCF at 0 range 12 .. 12; Reserved_13_16 at 0 range 13 .. 16; CMCF at 0 range 17 .. 17; Reserved_18_19 at 0 range 18 .. 19; WUCF at 0 range 20 .. 20; Reserved_21_31 at 0 range 21 .. 31; end record; subtype RDR_RDR_Field is STM32_SVD.UInt9; -- Receive data register type RDR_Register is record -- Read-only. Receive data value RDR : RDR_RDR_Field; -- unspecified Reserved_9_31 : STM32_SVD.UInt23; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for RDR_Register use record RDR at 0 range 0 .. 8; Reserved_9_31 at 0 range 9 .. 31; end record; subtype TDR_TDR_Field is STM32_SVD.UInt9; -- Transmit data register type TDR_Register is record -- Transmit data value TDR : TDR_TDR_Field := 16#0#; -- unspecified Reserved_9_31 : STM32_SVD.UInt23 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for TDR_Register use record TDR at 0 range 0 .. 8; Reserved_9_31 at 0 range 9 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Universal synchronous asynchronous receiver transmitter type USART_Peripheral is record -- Control register 1 CR1 : aliased CR1_Register; -- Control register 2 CR2 : aliased CR2_Register; -- Control register 3 CR3 : aliased CR3_Register; -- Baud rate register BRR : aliased BRR_Register; -- Guard time and prescaler register GTPR : aliased GTPR_Register; -- Receiver timeout register RTOR : aliased RTOR_Register; -- Request register RQR : aliased RQR_Register; -- Interrupt & status register ISR : aliased ISR_Register; -- Interrupt flag clear register ICR : aliased ICR_Register; -- Receive data register RDR : aliased RDR_Register; -- Transmit data register TDR : aliased TDR_Register; end record with Volatile; for USART_Peripheral use record CR1 at 16#0# range 0 .. 31; CR2 at 16#4# range 0 .. 31; CR3 at 16#8# range 0 .. 31; BRR at 16#C# range 0 .. 31; GTPR at 16#10# range 0 .. 31; RTOR at 16#14# range 0 .. 31; RQR at 16#18# range 0 .. 31; ISR at 16#1C# range 0 .. 31; ICR at 16#20# range 0 .. 31; RDR at 16#24# range 0 .. 31; TDR at 16#28# range 0 .. 31; end record; -- Universal synchronous asynchronous receiver transmitter USART1_Periph : aliased USART_Peripheral with Import, Address => System'To_Address (16#40013800#); -- Universal synchronous asynchronous receiver transmitter USART2_Periph : aliased USART_Peripheral with Import, Address => System'To_Address (16#40004400#); end STM32_SVD.USART;

36.005926

72

0.579082

a140013bf9c4587f52f3d0f5665d11b1b6d5d847

4,560

ads

Ada

awa/plugins/awa-mail/src/awa-mail-modules.ads

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

81

2015-01-18T23:02:30.000Z

2022-03-19T17:34:57.000Z

awa/plugins/awa-mail/src/awa-mail-modules.ads

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

20

2015-12-09T19:26:19.000Z

2022-03-23T14:32:43.000Z

awa/plugins/awa-mail/src/awa-mail-modules.ads

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

16

2015-06-29T02:44:06.000Z

2021-09-23T18:47:50.000Z

----------------------------------------------------------------------- -- awa-mail -- Mail module -- Copyright (C) 2011, 2012, 2017, 2018, 2020 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Util.Beans.Objects.Maps; with ASF.Applications; with AWA.Modules; with AWA.Events; with AWA.Mail.Clients; -- == Integration == -- To be able to use the `mail` module, you will need to add the following -- line in your GNAT project file: -- -- with "awa_mail"; -- -- The `Mail_Module` type represents the mail module. An instance -- of the mail module must be declared and registered when the application -- is created and initialized. The module instance can be defined -- as follows: -- -- type Application is new AWA.Applications.Application with record -- Mail_Module : aliased AWA.Mail.Modules.Mail_Module; -- end record; -- -- And registered in the `Initialize_Modules` procedure by using: -- -- Register (App => App.Self.all'Access, -- Name => AWA.Mail.Modules.NAME, -- Module => App.Mail_Module'Access); -- -- == Configuration == -- The `mail` module needs some properties to configure the SMTP -- server. -- -- |Configuration | Default | Description | -- | --------------- | --------- | ----------------------------------------------- | -- |mail.smtp.host | localhost | Defines the SMTP server host name | -- |mail.smtp.port | 25 | Defines the SMTP connection port | -- |mail.smtp.enable | 1 | Defines whether sending email is enabled or not | -- -- == Sending an email == -- Sending an email when an event is posted can be done by using -- an XML configuration. Basically, the `mail` module uses the event -- framework provided by AWA. The XML definition looks like: -- -- <on-event name="user-register"> -- <action>#{userMail.send}</action> -- <property name="template">/mail/register-user-message.xhtml</property> -- </on-event> -- -- With this definition, the mail template `/mail/register-user-message.xhtml` -- is formatted by using the event and application context when the -- `user-register` event is posted. -- -- @include awa-mail-components.ads -- @include awa-mail-components-recipients.ads -- @include awa-mail-components-messages.ads -- @include awa-mail-components-attachments.ads -- -- == Ada Beans == -- @include-bean mail.xml -- package AWA.Mail.Modules is NAME : constant String := "mail"; type Mail_Module is new AWA.Modules.Module with private; type Mail_Module_Access is access all Mail_Module'Class; -- Initialize the mail module. overriding procedure Initialize (Plugin : in out Mail_Module; App : in AWA.Modules.Application_Access; Props : in ASF.Applications.Config); -- Configures the module after its initialization and after having -- read its XML configuration. overriding procedure Configure (Plugin : in out Mail_Module; Props : in ASF.Applications.Config); -- Create a new mail message. function Create_Message (Plugin : in Mail_Module) return AWA.Mail.Clients.Mail_Message_Access; -- Format and send an email. procedure Send_Mail (Plugin : in Mail_Module; Template : in String; Props : in Util.Beans.Objects.Maps.Map; Params : in Util.Beans.Objects.Maps.Map; Content : in AWA.Events.Module_Event'Class); -- Get the mail module instance associated with the current application. function Get_Mail_Module return Mail_Module_Access; private type Mail_Module is new AWA.Modules.Module with record Mailer : AWA.Mail.Clients.Mail_Manager_Access; end record; end AWA.Mail.Modules;

38

85

0.628509

06564657f3daa80b3570a847583dad16ad375222

23,007

ads

Ada

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-chzla9.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-chzla9.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-chzla9.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . C H A R A C T E R S . W I D E _ W I D E _ L A T I N _ 9 -- -- -- -- 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. -- -- -- ------------------------------------------------------------------------------ -- This package provides definitions analogous to those in the GNAT package -- Ada.Characters.Latin_9 except that the type of the various constants is -- Wide_Wide_Character instead of Character. The provision of this package -- is in accordance with the implementation permission in RM (A.3.3(27)). package Ada.Characters.Wide_Wide_Latin_9 is pragma Pure; ------------------------ -- Control Characters -- ------------------------ NUL : constant Wide_Wide_Character := Wide_Wide_Character'Val (0); SOH : constant Wide_Wide_Character := Wide_Wide_Character'Val (1); STX : constant Wide_Wide_Character := Wide_Wide_Character'Val (2); ETX : constant Wide_Wide_Character := Wide_Wide_Character'Val (3); EOT : constant Wide_Wide_Character := Wide_Wide_Character'Val (4); ENQ : constant Wide_Wide_Character := Wide_Wide_Character'Val (5); ACK : constant Wide_Wide_Character := Wide_Wide_Character'Val (6); BEL : constant Wide_Wide_Character := Wide_Wide_Character'Val (7); BS : constant Wide_Wide_Character := Wide_Wide_Character'Val (8); HT : constant Wide_Wide_Character := Wide_Wide_Character'Val (9); LF : constant Wide_Wide_Character := Wide_Wide_Character'Val (10); VT : constant Wide_Wide_Character := Wide_Wide_Character'Val (11); FF : constant Wide_Wide_Character := Wide_Wide_Character'Val (12); CR : constant Wide_Wide_Character := Wide_Wide_Character'Val (13); SO : constant Wide_Wide_Character := Wide_Wide_Character'Val (14); SI : constant Wide_Wide_Character := Wide_Wide_Character'Val (15); DLE : constant Wide_Wide_Character := Wide_Wide_Character'Val (16); DC1 : constant Wide_Wide_Character := Wide_Wide_Character'Val (17); DC2 : constant Wide_Wide_Character := Wide_Wide_Character'Val (18); DC3 : constant Wide_Wide_Character := Wide_Wide_Character'Val (19); DC4 : constant Wide_Wide_Character := Wide_Wide_Character'Val (20); NAK : constant Wide_Wide_Character := Wide_Wide_Character'Val (21); SYN : constant Wide_Wide_Character := Wide_Wide_Character'Val (22); ETB : constant Wide_Wide_Character := Wide_Wide_Character'Val (23); CAN : constant Wide_Wide_Character := Wide_Wide_Character'Val (24); EM : constant Wide_Wide_Character := Wide_Wide_Character'Val (25); SUB : constant Wide_Wide_Character := Wide_Wide_Character'Val (26); ESC : constant Wide_Wide_Character := Wide_Wide_Character'Val (27); FS : constant Wide_Wide_Character := Wide_Wide_Character'Val (28); GS : constant Wide_Wide_Character := Wide_Wide_Character'Val (29); RS : constant Wide_Wide_Character := Wide_Wide_Character'Val (30); US : constant Wide_Wide_Character := Wide_Wide_Character'Val (31); ------------------------------------- -- ISO 646 Graphic Wide_Wide_Characters -- ------------------------------------- Space : constant Wide_Wide_Character := ' '; -- WC'Val(32) Exclamation : constant Wide_Wide_Character := '!'; -- WC'Val(33) Quotation : constant Wide_Wide_Character := '"'; -- WC'Val(34) Number_Sign : constant Wide_Wide_Character := '#'; -- WC'Val(35) Dollar_Sign : constant Wide_Wide_Character := '$'; -- WC'Val(36) Percent_Sign : constant Wide_Wide_Character := '%'; -- WC'Val(37) Ampersand : constant Wide_Wide_Character := '&'; -- WC'Val(38) Apostrophe : constant Wide_Wide_Character := '''; -- WC'Val(39) Left_Parenthesis : constant Wide_Wide_Character := '('; -- WC'Val(40) Right_Parenthesis : constant Wide_Wide_Character := ')'; -- WC'Val(41) Asterisk : constant Wide_Wide_Character := '*'; -- WC'Val(42) Plus_Sign : constant Wide_Wide_Character := '+'; -- WC'Val(43) Comma : constant Wide_Wide_Character := ','; -- WC'Val(44) Hyphen : constant Wide_Wide_Character := '-'; -- WC'Val(45) Minus_Sign : Wide_Wide_Character renames Hyphen; Full_Stop : constant Wide_Wide_Character := '.'; -- WC'Val(46) Solidus : constant Wide_Wide_Character := '/'; -- WC'Val(47) -- Decimal digits '0' though '9' are at positions 48 through 57 Colon : constant Wide_Wide_Character := ':'; -- WC'Val(58) Semicolon : constant Wide_Wide_Character := ';'; -- WC'Val(59) Less_Than_Sign : constant Wide_Wide_Character := '<'; -- WC'Val(60) Equals_Sign : constant Wide_Wide_Character := '='; -- WC'Val(61) Greater_Than_Sign : constant Wide_Wide_Character := '>'; -- WC'Val(62) Question : constant Wide_Wide_Character := '?'; -- WC'Val(63) Commercial_At : constant Wide_Wide_Character := '@'; -- WC'Val(64) -- Letters 'A' through 'Z' are at positions 65 through 90 Left_Square_Bracket : constant Wide_Wide_Character := '['; -- WC'Val (91) Reverse_Solidus : constant Wide_Wide_Character := '\'; -- WC'Val (92) Right_Square_Bracket : constant Wide_Wide_Character := ']'; -- WC'Val (93) Circumflex : constant Wide_Wide_Character := '^'; -- WC'Val (94) Low_Line : constant Wide_Wide_Character := '_'; -- WC'Val (95) Grave : constant Wide_Wide_Character := '`'; -- WC'Val (96) LC_A : constant Wide_Wide_Character := 'a'; -- WC'Val (97) LC_B : constant Wide_Wide_Character := 'b'; -- WC'Val (98) LC_C : constant Wide_Wide_Character := 'c'; -- WC'Val (99) LC_D : constant Wide_Wide_Character := 'd'; -- WC'Val (100) LC_E : constant Wide_Wide_Character := 'e'; -- WC'Val (101) LC_F : constant Wide_Wide_Character := 'f'; -- WC'Val (102) LC_G : constant Wide_Wide_Character := 'g'; -- WC'Val (103) LC_H : constant Wide_Wide_Character := 'h'; -- WC'Val (104) LC_I : constant Wide_Wide_Character := 'i'; -- WC'Val (105) LC_J : constant Wide_Wide_Character := 'j'; -- WC'Val (106) LC_K : constant Wide_Wide_Character := 'k'; -- WC'Val (107) LC_L : constant Wide_Wide_Character := 'l'; -- WC'Val (108) LC_M : constant Wide_Wide_Character := 'm'; -- WC'Val (109) LC_N : constant Wide_Wide_Character := 'n'; -- WC'Val (110) LC_O : constant Wide_Wide_Character := 'o'; -- WC'Val (111) LC_P : constant Wide_Wide_Character := 'p'; -- WC'Val (112) LC_Q : constant Wide_Wide_Character := 'q'; -- WC'Val (113) LC_R : constant Wide_Wide_Character := 'r'; -- WC'Val (114) LC_S : constant Wide_Wide_Character := 's'; -- WC'Val (115) LC_T : constant Wide_Wide_Character := 't'; -- WC'Val (116) LC_U : constant Wide_Wide_Character := 'u'; -- WC'Val (117) LC_V : constant Wide_Wide_Character := 'v'; -- WC'Val (118) LC_W : constant Wide_Wide_Character := 'w'; -- WC'Val (119) LC_X : constant Wide_Wide_Character := 'x'; -- WC'Val (120) LC_Y : constant Wide_Wide_Character := 'y'; -- WC'Val (121) LC_Z : constant Wide_Wide_Character := 'z'; -- WC'Val (122) Left_Curly_Bracket : constant Wide_Wide_Character := '{'; -- WC'Val (123) Vertical_Line : constant Wide_Wide_Character := '|'; -- WC'Val (124) Right_Curly_Bracket : constant Wide_Wide_Character := '}'; -- WC'Val (125) Tilde : constant Wide_Wide_Character := '~'; -- WC'Val (126) DEL : constant Wide_Wide_Character := Wide_Wide_Character'Val (127); -------------------------------------- -- ISO 6429 Control Wide_Wide_Characters -- -------------------------------------- IS4 : Wide_Wide_Character renames FS; IS3 : Wide_Wide_Character renames GS; IS2 : Wide_Wide_Character renames RS; IS1 : Wide_Wide_Character renames US; Reserved_128 : constant Wide_Wide_Character := Wide_Wide_Character'Val (128); Reserved_129 : constant Wide_Wide_Character := Wide_Wide_Character'Val (129); BPH : constant Wide_Wide_Character := Wide_Wide_Character'Val (130); NBH : constant Wide_Wide_Character := Wide_Wide_Character'Val (131); Reserved_132 : constant Wide_Wide_Character := Wide_Wide_Character'Val (132); NEL : constant Wide_Wide_Character := Wide_Wide_Character'Val (133); SSA : constant Wide_Wide_Character := Wide_Wide_Character'Val (134); ESA : constant Wide_Wide_Character := Wide_Wide_Character'Val (135); HTS : constant Wide_Wide_Character := Wide_Wide_Character'Val (136); HTJ : constant Wide_Wide_Character := Wide_Wide_Character'Val (137); VTS : constant Wide_Wide_Character := Wide_Wide_Character'Val (138); PLD : constant Wide_Wide_Character := Wide_Wide_Character'Val (139); PLU : constant Wide_Wide_Character := Wide_Wide_Character'Val (140); RI : constant Wide_Wide_Character := Wide_Wide_Character'Val (141); SS2 : constant Wide_Wide_Character := Wide_Wide_Character'Val (142); SS3 : constant Wide_Wide_Character := Wide_Wide_Character'Val (143); DCS : constant Wide_Wide_Character := Wide_Wide_Character'Val (144); PU1 : constant Wide_Wide_Character := Wide_Wide_Character'Val (145); PU2 : constant Wide_Wide_Character := Wide_Wide_Character'Val (146); STS : constant Wide_Wide_Character := Wide_Wide_Character'Val (147); CCH : constant Wide_Wide_Character := Wide_Wide_Character'Val (148); MW : constant Wide_Wide_Character := Wide_Wide_Character'Val (149); SPA : constant Wide_Wide_Character := Wide_Wide_Character'Val (150); EPA : constant Wide_Wide_Character := Wide_Wide_Character'Val (151); SOS : constant Wide_Wide_Character := Wide_Wide_Character'Val (152); Reserved_153 : constant Wide_Wide_Character := Wide_Wide_Character'Val (153); SCI : constant Wide_Wide_Character := Wide_Wide_Character'Val (154); CSI : constant Wide_Wide_Character := Wide_Wide_Character'Val (155); ST : constant Wide_Wide_Character := Wide_Wide_Character'Val (156); OSC : constant Wide_Wide_Character := Wide_Wide_Character'Val (157); PM : constant Wide_Wide_Character := Wide_Wide_Character'Val (158); APC : constant Wide_Wide_Character := Wide_Wide_Character'Val (159); ----------------------------------- -- Other Graphic Wide_Wide_Characters -- ----------------------------------- -- Wide_Wide_Character positions 160 (16#A0#) .. 175 (16#AF#) No_Break_Space : constant Wide_Wide_Character := Wide_Wide_Character'Val (160); NBSP : Wide_Wide_Character renames No_Break_Space; Inverted_Exclamation : constant Wide_Wide_Character := Wide_Wide_Character'Val (161); Cent_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (162); Pound_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (163); Euro_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (164); Yen_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (165); UC_S_Caron : constant Wide_Wide_Character := Wide_Wide_Character'Val (166); Section_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (167); LC_S_Caron : constant Wide_Wide_Character := Wide_Wide_Character'Val (168); Copyright_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (169); Feminine_Ordinal_Indicator : constant Wide_Wide_Character := Wide_Wide_Character'Val (170); Left_Angle_Quotation : constant Wide_Wide_Character := Wide_Wide_Character'Val (171); Not_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (172); Soft_Hyphen : constant Wide_Wide_Character := Wide_Wide_Character'Val (173); Registered_Trade_Mark_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (174); Macron : constant Wide_Wide_Character := Wide_Wide_Character'Val (175); -- Wide_Wide_Character positions 176 (16#B0#) .. 191 (16#BF#) Degree_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (176); Ring_Above : Wide_Wide_Character renames Degree_Sign; Plus_Minus_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (177); Superscript_Two : constant Wide_Wide_Character := Wide_Wide_Character'Val (178); Superscript_Three : constant Wide_Wide_Character := Wide_Wide_Character'Val (179); UC_Z_Caron : constant Wide_Wide_Character := Wide_Wide_Character'Val (180); Micro_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (181); Pilcrow_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (182); Paragraph_Sign : Wide_Wide_Character renames Pilcrow_Sign; Middle_Dot : constant Wide_Wide_Character := Wide_Wide_Character'Val (183); LC_Z_Caron : constant Wide_Wide_Character := Wide_Wide_Character'Val (184); Superscript_One : constant Wide_Wide_Character := Wide_Wide_Character'Val (185); Masculine_Ordinal_Indicator : constant Wide_Wide_Character := Wide_Wide_Character'Val (186); Right_Angle_Quotation : constant Wide_Wide_Character := Wide_Wide_Character'Val (187); UC_Ligature_OE : constant Wide_Wide_Character := Wide_Wide_Character'Val (188); LC_Ligature_OE : constant Wide_Wide_Character := Wide_Wide_Character'Val (189); UC_Y_Diaeresis : constant Wide_Wide_Character := Wide_Wide_Character'Val (190); Inverted_Question : constant Wide_Wide_Character := Wide_Wide_Character'Val (191); -- Wide_Wide_Character positions 192 (16#C0#) .. 207 (16#CF#) UC_A_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (192); UC_A_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (193); UC_A_Circumflex : constant Wide_Wide_Character := Wide_Wide_Character'Val (194); UC_A_Tilde : constant Wide_Wide_Character := Wide_Wide_Character'Val (195); UC_A_Diaeresis : constant Wide_Wide_Character := Wide_Wide_Character'Val (196); UC_A_Ring : constant Wide_Wide_Character := Wide_Wide_Character'Val (197); UC_AE_Diphthong : constant Wide_Wide_Character := Wide_Wide_Character'Val (198); UC_C_Cedilla : constant Wide_Wide_Character := Wide_Wide_Character'Val (199); UC_E_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (200); UC_E_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (201); UC_E_Circumflex : constant Wide_Wide_Character := Wide_Wide_Character'Val (202); UC_E_Diaeresis : constant Wide_Wide_Character := Wide_Wide_Character'Val (203); UC_I_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (204); UC_I_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (205); UC_I_Circumflex : constant Wide_Wide_Character := Wide_Wide_Character'Val (206); UC_I_Diaeresis : constant Wide_Wide_Character := Wide_Wide_Character'Val (207); -- Wide_Wide_Character positions 208 (16#D0#) .. 223 (16#DF#) UC_Icelandic_Eth : constant Wide_Wide_Character := Wide_Wide_Character'Val (208); UC_N_Tilde : constant Wide_Wide_Character := Wide_Wide_Character'Val (209); UC_O_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (210); UC_O_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (211); UC_O_Circumflex : constant Wide_Wide_Character := Wide_Wide_Character'Val (212); UC_O_Tilde : constant Wide_Wide_Character := Wide_Wide_Character'Val (213); UC_O_Diaeresis : constant Wide_Wide_Character := Wide_Wide_Character'Val (214); Multiplication_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (215); UC_O_Oblique_Stroke : constant Wide_Wide_Character := Wide_Wide_Character'Val (216); UC_U_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (217); UC_U_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (218); UC_U_Circumflex : constant Wide_Wide_Character := Wide_Wide_Character'Val (219); UC_U_Diaeresis : constant Wide_Wide_Character := Wide_Wide_Character'Val (220); UC_Y_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (221); UC_Icelandic_Thorn : constant Wide_Wide_Character := Wide_Wide_Character'Val (222); LC_German_Sharp_S : constant Wide_Wide_Character := Wide_Wide_Character'Val (223); -- Wide_Wide_Character positions 224 (16#E0#) .. 239 (16#EF#) LC_A_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (224); LC_A_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (225); LC_A_Circumflex : constant Wide_Wide_Character := Wide_Wide_Character'Val (226); LC_A_Tilde : constant Wide_Wide_Character := Wide_Wide_Character'Val (227); LC_A_Diaeresis : constant Wide_Wide_Character := Wide_Wide_Character'Val (228); LC_A_Ring : constant Wide_Wide_Character := Wide_Wide_Character'Val (229); LC_AE_Diphthong : constant Wide_Wide_Character := Wide_Wide_Character'Val (230); LC_C_Cedilla : constant Wide_Wide_Character := Wide_Wide_Character'Val (231); LC_E_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (232); LC_E_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (233); LC_E_Circumflex : constant Wide_Wide_Character := Wide_Wide_Character'Val (234); LC_E_Diaeresis : constant Wide_Wide_Character := Wide_Wide_Character'Val (235); LC_I_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (236); LC_I_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (237); LC_I_Circumflex : constant Wide_Wide_Character := Wide_Wide_Character'Val (238); LC_I_Diaeresis : constant Wide_Wide_Character := Wide_Wide_Character'Val (239); -- Wide_Wide_Character positions 240 (16#F0#) .. 255 (16#FF) LC_Icelandic_Eth : constant Wide_Wide_Character := Wide_Wide_Character'Val (240); LC_N_Tilde : constant Wide_Wide_Character := Wide_Wide_Character'Val (241); LC_O_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (242); LC_O_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (243); LC_O_Circumflex : constant Wide_Wide_Character := Wide_Wide_Character'Val (244); LC_O_Tilde : constant Wide_Wide_Character := Wide_Wide_Character'Val (245); LC_O_Diaeresis : constant Wide_Wide_Character := Wide_Wide_Character'Val (246); Division_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (247); LC_O_Oblique_Stroke : constant Wide_Wide_Character := Wide_Wide_Character'Val (248); LC_U_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (249); LC_U_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (250); LC_U_Circumflex : constant Wide_Wide_Character := Wide_Wide_Character'Val (251); LC_U_Diaeresis : constant Wide_Wide_Character := Wide_Wide_Character'Val (252); LC_Y_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (253); LC_Icelandic_Thorn : constant Wide_Wide_Character := Wide_Wide_Character'Val (254); LC_Y_Diaeresis : constant Wide_Wide_Character := Wide_Wide_Character'Val (255); ------------------------------------------------ -- Summary of Changes from Latin-1 => Latin-9 -- ------------------------------------------------ -- 164 Currency => Euro_Sign -- 166 Broken_Bar => UC_S_Caron -- 168 Diaeresis => LC_S_Caron -- 180 Acute => UC_Z_Caron -- 184 Cedilla => LC_Z_Caron -- 188 Fraction_One_Quarter => UC_Ligature_OE -- 189 Fraction_One_Half => LC_Ligature_OE -- 190 Fraction_Three_Quarters => UC_Y_Diaeresis end Ada.Characters.Wide_Wide_Latin_9;

59.143959

79

0.624723

067de0781a640dae65e985e83470dee97c7c3a89

4,844

ads

Ada

3-mid/impact/source/3d/math/impact-d3-graham_scan_2d_convex_hull.ads

charlie5/lace

e9b7dc751d500ff3f559617a6fc3089ace9dc134

[ "0BSD" ]

20

2015-11-04T09:23:59.000Z

2022-01-14T10:21:42.000Z

3-mid/impact/source/3d/math/impact-d3-graham_scan_2d_convex_hull.ads

charlie5/lace

e9b7dc751d500ff3f559617a6fc3089ace9dc134

[ "0BSD" ]

2

2015-11-04T17:05:56.000Z

2015-12-08T03:16:13.000Z

3-mid/impact/source/3d/math/impact-d3-graham_scan_2d_convex_hull.ads

charlie5/lace

e9b7dc751d500ff3f559617a6fc3089ace9dc134

[ "0BSD" ]

1

2015-12-07T12:53:52.000Z

with Ada.Containers.Vectors; -- #include "impact.d3.Vector.h" -- #include "btAlignedObjectArray.h" package Impact.d3.graham_scan_2d_convex_Hull -- -- -- is type GrahamVector2 is record Vector : Math.Vector_3; m_angle : Math.Real; m_orgIndex : Integer; -- m_anchor : math.Vector_3; -- Only for sorting. end record; function to_GrahamVector2 (org : in Math.Vector_3; orgIndex : in Integer) return GrahamVector2; -- GrahamVector2(const impact.d3.Vector& org, int orgIndex) -- :impact.d3.Vector(org), -- m_orgIndex(orgIndex) -- { -- } -- type btAngleCompareFunc is -- record -- m_anchor : math.Vector_3; -- end record; -- -- -- -- function to_btAngleCompareFunc (anchor : in math.Vector_3) return --btAngleCompareFunc; -- btAngleCompareFunc(const impact.d3.Vector& anchor) -- : m_anchor(anchor) -- { -- } -- function "<" (a, b : in GrahamVector2) return Boolean; -- function equivalent (Self : in btAngleCompareFunc; a, b : in --GrahamVector2) return Boolean; -- bool operator()(const GrahamVector2& a, const GrahamVector2& b) --{ -- if (a.m_angle != b.m_angle) -- return a.m_angle < b.m_angle; -- else -- { -- impact.d3.Scalar al = (a-m_anchor).length2(); -- impact.d3.Scalar bl = (b-m_anchor).length2(); -- if (al != bl) -- return al < bl; -- else -- { -- return a.m_orgIndex < b.m_orgIndex; -- } -- } -- } package GrahamVector2_Vectors is new Ada.Containers.Vectors ( Positive, GrahamVector2); subtype GrahamVector2_Vector is GrahamVector2_Vectors.Vector; procedure GrahamScanConvexHull2D (originalPoints : in out GrahamVector2_Vector; hull : in out GrahamVector2_Vector); -- inline void GrahamScanConvexHull2D(btAlignedObjectArray<GrahamVector2>& --originalPoints, btAlignedObjectArray<GrahamVector2>& hull) -- { -- if (originalPoints.size()<=1) -- { -- for (int i=0;i<originalPoints.size();i++) -- hull.push_back(originalPoints[0]); -- return; -- } -- //step1 : find anchor point with smallest x/y and move it to --first location -- //also precompute angles -- for (int i=0;i<originalPoints.size();i++) -- { -- const impact.d3.Vector& left = originalPoints[i]; -- const impact.d3.Vector& right = originalPoints[0]; -- if (left.x() < right.x() || !(right.x() < left.x()) && --left.y() < right.y()) -- { -- originalPoints.swap(0,i); -- } -- } -- -- for (int i=0;i<originalPoints.size();i++) -- { -- impact.d3.Vector xvec(1,0,0); -- impact.d3.Vector ar = --originalPoints[i]-originalPoints[0]; -- originalPoints[i].m_angle = btCross(xvec, --ar).dot(impact.d3.Vector(0,0,1)) / ar.length(); -- } -- -- //step 2: sort all points, based on 'angle' with this anchor -- btAngleCompareFunc comp(originalPoints[0]); -- originalPoints.quickSortInternal(comp,1,originalPoints.size()-1) --; -- -- int i; -- for (i = 0; i<2; i++) -- hull.push_back(originalPoints[i]); -- -- //step 3: keep all 'convex' points and discard concave points --(using back tracking) -- for (; i != originalPoints.size(); i++) -- { -- bool isConvex = false; -- while (!isConvex&& hull.size()>1) { -- impact.d3.Vector& a = hull[hull.size()-2]; -- impact.d3.Vector& b = hull[hull.size()-1]; -- isConvex = --btCross(a-b,a-originalPoints[i]).dot(impact.d3.Vector(0,0,1))> 0; -- if (!isConvex) -- hull.pop_back(); -- else -- hull.push_back(originalPoints[i]); -- } -- } -- } end Impact.d3.graham_scan_2d_convex_Hull;

35.357664

79

0.459331

dfbe4dd34190c7277e3fd08a473e515940c4a717

51,013

adb

Ada

gcc-gcc-7_3_0-release/gcc/ada/lib-xref-spark_specific.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/lib-xref-spark_specific.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/ada/lib-xref-spark_specific.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- L I B . X R E F . S P A R K _ S P E C I F I C -- -- -- -- B o d y -- -- -- -- Copyright (C) 2011-2016, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING3. If not, go to -- -- http://www.gnu.org/licenses for a complete copy of the license. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Einfo; use Einfo; with Nmake; use Nmake; with SPARK_Xrefs; use SPARK_Xrefs; with GNAT.HTable; separate (Lib.Xref) package body SPARK_Specific is --------------------- -- Local Constants -- --------------------- -- Table of SPARK_Entities, True for each entity kind used in SPARK SPARK_Entities : constant array (Entity_Kind) of Boolean := (E_Constant => True, E_Entry => True, E_Function => True, E_In_Out_Parameter => True, E_In_Parameter => True, E_Loop_Parameter => True, E_Operator => True, E_Out_Parameter => True, E_Procedure => True, E_Variable => True, others => False); -- True for each reference type used in SPARK SPARK_References : constant array (Character) of Boolean := ('m' => True, 'r' => True, 's' => True, others => False); type Entity_Hashed_Range is range 0 .. 255; -- Size of hash table headers --------------------- -- Local Variables -- --------------------- Heap : Entity_Id := Empty; -- A special entity which denotes the heap object package Drefs is new Table.Table ( Table_Component_Type => Xref_Entry, Table_Index_Type => Xref_Entry_Number, Table_Low_Bound => 1, Table_Initial => Alloc.Drefs_Initial, Table_Increment => Alloc.Drefs_Increment, Table_Name => "Drefs"); -- Table of cross-references for reads and writes through explicit -- dereferences, that are output as reads/writes to the special variable -- "Heap". These references are added to the regular references when -- computing SPARK cross-references. ----------------------- -- Local Subprograms -- ----------------------- procedure Add_SPARK_File (Uspec, Ubody : Unit_Number_Type; Dspec : Nat); -- Add file and corresponding scopes for unit to the tables -- SPARK_File_Table and SPARK_Scope_Table. When two units are present -- for the same compilation unit, as it happens for library-level -- instantiations of generics, then Ubody is the number of the body -- unit; otherwise it is No_Unit. procedure Add_SPARK_Xrefs; -- Filter table Xrefs to add all references used in SPARK to the table -- SPARK_Xref_Table. function Entity_Hash (E : Entity_Id) return Entity_Hashed_Range; -- Hash function for hash table -------------------- -- Add_SPARK_File -- -------------------- procedure Add_SPARK_File (Uspec, Ubody : Unit_Number_Type; Dspec : Nat) is File : constant Source_File_Index := Source_Index (Uspec); From : constant Scope_Index := SPARK_Scope_Table.Last + 1; Scope_Id : Pos := 1; procedure Add_SPARK_Scope (N : Node_Id); -- Add scope N to the table SPARK_Scope_Table procedure Detect_And_Add_SPARK_Scope (N : Node_Id); -- Call Add_SPARK_Scope on scopes --------------------- -- Add_SPARK_Scope -- --------------------- procedure Add_SPARK_Scope (N : Node_Id) is E : constant Entity_Id := Defining_Entity (N); Loc : constant Source_Ptr := Sloc (E); -- The character describing the kind of scope is chosen to be the -- same as the one describing the corresponding entity in cross -- references, see Xref_Entity_Letters in lib-xrefs.ads Typ : Character; begin -- Ignore scopes without a proper location if Sloc (N) = No_Location then return; end if; case Ekind (E) is when E_Entry | E_Entry_Family | E_Generic_Function | E_Generic_Package | E_Generic_Procedure | E_Package | E_Protected_Type | E_Task_Type => Typ := Xref_Entity_Letters (Ekind (E)); when E_Function | E_Procedure => -- In SPARK we need to distinguish protected functions and -- procedures from ordinary subprograms, but there are no -- special Xref letters for them. Since this distiction is -- only needed to detect protected calls, we pretend that -- such calls are entry calls. if Ekind (Scope (E)) = E_Protected_Type then Typ := Xref_Entity_Letters (E_Entry); else Typ := Xref_Entity_Letters (Ekind (E)); end if; when E_Package_Body | E_Protected_Body | E_Subprogram_Body | E_Task_Body => Typ := Xref_Entity_Letters (Ekind (Unique_Entity (E))); when E_Void => -- Compilation of prj-attr.adb with -gnatn creates a node with -- entity E_Void for the package defined at a-charac.ads16:13. -- ??? TBD return; when others => raise Program_Error; end case; -- File_Num and Scope_Num are filled later. From_Xref and To_Xref -- are filled even later, but are initialized to represent an empty -- range. SPARK_Scope_Table.Append ((Scope_Name => new String'(Unique_Name (E)), File_Num => Dspec, Scope_Num => Scope_Id, Spec_File_Num => 0, Spec_Scope_Num => 0, Line => Nat (Get_Logical_Line_Number (Loc)), Stype => Typ, Col => Nat (Get_Column_Number (Loc)), From_Xref => 1, To_Xref => 0, Scope_Entity => E)); Scope_Id := Scope_Id + 1; end Add_SPARK_Scope; -------------------------------- -- Detect_And_Add_SPARK_Scope -- -------------------------------- procedure Detect_And_Add_SPARK_Scope (N : Node_Id) is begin -- Entries if Nkind_In (N, N_Entry_Body, N_Entry_Declaration) -- Packages or else Nkind_In (N, N_Package_Body, N_Package_Body_Stub, N_Package_Declaration) -- Protected units or else Nkind_In (N, N_Protected_Body, N_Protected_Body_Stub, N_Protected_Type_Declaration) -- Subprograms or else Nkind_In (N, N_Subprogram_Body, N_Subprogram_Body_Stub, N_Subprogram_Declaration) -- Task units or else Nkind_In (N, N_Task_Body, N_Task_Body_Stub, N_Task_Type_Declaration) then Add_SPARK_Scope (N); end if; end Detect_And_Add_SPARK_Scope; procedure Traverse_Scopes is new Traverse_Compilation_Unit (Detect_And_Add_SPARK_Scope); -- Local variables File_Name : String_Ptr; Unit_File_Name : String_Ptr; -- Start of processing for Add_SPARK_File begin -- Source file could be inexistant as a result of an error, if option -- gnatQ is used. if File = No_Source_File then return; end if; -- Subunits are traversed as part of the top-level unit to which they -- belong. if Nkind (Unit (Cunit (Uspec))) = N_Subunit then return; end if; Traverse_Scopes (CU => Cunit (Uspec), Inside_Stubs => True); -- When two units are present for the same compilation unit, as it -- happens for library-level instantiations of generics, then add all -- scopes to the same SPARK file. if Ubody /= No_Unit then Traverse_Scopes (CU => Cunit (Ubody), Inside_Stubs => True); end if; -- Make entry for new file in file table Get_Name_String (Reference_Name (File)); File_Name := new String'(Name_Buffer (1 .. Name_Len)); -- For subunits, also retrieve the file name of the unit. Only do so if -- unit has an associated compilation unit. if Present (Cunit (Unit (File))) and then Nkind (Unit (Cunit (Unit (File)))) = N_Subunit then Get_Name_String (Reference_Name (Main_Source_File)); Unit_File_Name := new String'(Name_Buffer (1 .. Name_Len)); else Unit_File_Name := null; end if; SPARK_File_Table.Append ( (File_Name => File_Name, Unit_File_Name => Unit_File_Name, File_Num => Dspec, From_Scope => From, To_Scope => SPARK_Scope_Table.Last)); end Add_SPARK_File; --------------------- -- Add_SPARK_Xrefs -- --------------------- procedure Add_SPARK_Xrefs is function Entity_Of_Scope (S : Scope_Index) return Entity_Id; -- Return the entity which maps to the input scope index function Get_Entity_Type (E : Entity_Id) return Character; -- Return a character representing the type of entity function Get_Scope_Num (N : Entity_Id) return Nat; -- Return the scope number associated to entity N function Is_Constant_Object_Without_Variable_Input (E : Entity_Id) return Boolean; -- Return True if E is known to have no variable input, as defined in -- SPARK RM. function Is_Future_Scope_Entity (E : Entity_Id; S : Scope_Index) return Boolean; -- Check whether entity E is in SPARK_Scope_Table at index S or higher function Is_SPARK_Reference (E : Entity_Id; Typ : Character) return Boolean; -- Return whether entity reference E meets SPARK requirements. Typ is -- the reference type. function Is_SPARK_Scope (E : Entity_Id) return Boolean; -- Return whether the entity or reference scope meets requirements for -- being a SPARK scope. function Lt (Op1 : Natural; Op2 : Natural) return Boolean; -- Comparison function for Sort call procedure Move (From : Natural; To : Natural); -- Move procedure for Sort call procedure Set_Scope_Num (N : Entity_Id; Num : Nat); -- Associate entity N to scope number Num procedure Update_Scope_Range (S : Scope_Index; From : Xref_Index; To : Xref_Index); -- Update the scope which maps to S with the new range From .. To package Sorting is new GNAT.Heap_Sort_G (Move, Lt); No_Scope : constant Nat := 0; -- Initial scope counter type Scope_Rec is record Num : Nat; Entity : Entity_Id; end record; -- Type used to relate an entity and a scope number package Scopes is new GNAT.HTable.Simple_HTable (Header_Num => Entity_Hashed_Range, Element => Scope_Rec, No_Element => (Num => No_Scope, Entity => Empty), Key => Entity_Id, Hash => Entity_Hash, Equal => "="); -- Package used to build a correspondence between entities and scope -- numbers used in SPARK cross references. Nrefs : Nat := Xrefs.Last; -- Number of references in table. This value may get reset (reduced) -- when we eliminate duplicate reference entries as well as references -- not suitable for local cross-references. Nrefs_Add : constant Nat := Drefs.Last; -- Number of additional references which correspond to dereferences in -- the source code. Rnums : array (0 .. Nrefs + Nrefs_Add) of Nat; -- This array contains numbers of references in the Xrefs table. This -- list is sorted in output order. The extra 0'th entry is convenient -- for the call to sort. When we sort the table, we move the indices in -- Rnums around, but we do not move the original table entries. --------------------- -- Entity_Of_Scope -- --------------------- function Entity_Of_Scope (S : Scope_Index) return Entity_Id is begin return SPARK_Scope_Table.Table (S).Scope_Entity; end Entity_Of_Scope; --------------------- -- Get_Entity_Type -- --------------------- function Get_Entity_Type (E : Entity_Id) return Character is begin case Ekind (E) is when E_Out_Parameter => return '<'; when E_In_Out_Parameter => return '='; when E_In_Parameter => return '>'; when others => return '*'; end case; end Get_Entity_Type; ------------------- -- Get_Scope_Num -- ------------------- function Get_Scope_Num (N : Entity_Id) return Nat is begin return Scopes.Get (N).Num; end Get_Scope_Num; ----------------------------------------------- -- Is_Constant_Object_Without_Variable_Input -- ----------------------------------------------- function Is_Constant_Object_Without_Variable_Input (E : Entity_Id) return Boolean is Result : Boolean; begin case Ekind (E) is -- A constant is known to have no variable input if its -- initializing expression is static (a value which is -- compile-time-known is not guaranteed to have no variable input -- as defined in the SPARK RM). Otherwise, the constant may or not -- have variable input. when E_Constant => declare Decl : Node_Id; begin if Present (Full_View (E)) then Decl := Parent (Full_View (E)); else Decl := Parent (E); end if; if Is_Imported (E) then Result := False; else pragma Assert (Present (Expression (Decl))); Result := Is_Static_Expression (Expression (Decl)); end if; end; when E_In_Parameter | E_Loop_Parameter => Result := True; when others => Result := False; end case; return Result; end Is_Constant_Object_Without_Variable_Input; ---------------------------- -- Is_Future_Scope_Entity -- ---------------------------- function Is_Future_Scope_Entity (E : Entity_Id; S : Scope_Index) return Boolean is function Is_Past_Scope_Entity return Boolean; -- Check whether entity E is in SPARK_Scope_Table at index strictly -- lower than S. -------------------------- -- Is_Past_Scope_Entity -- -------------------------- function Is_Past_Scope_Entity return Boolean is begin for Index in SPARK_Scope_Table.First .. S - 1 loop if SPARK_Scope_Table.Table (Index).Scope_Entity = E then return True; end if; end loop; return False; end Is_Past_Scope_Entity; -- Start of processing for Is_Future_Scope_Entity begin for Index in S .. SPARK_Scope_Table.Last loop if SPARK_Scope_Table.Table (Index).Scope_Entity = E then return True; end if; end loop; -- If this assertion fails, this means that the scope which we are -- looking for has been treated already, which reveals a problem in -- the order of cross-references. pragma Assert (not Is_Past_Scope_Entity); return False; end Is_Future_Scope_Entity; ------------------------ -- Is_SPARK_Reference -- ------------------------ function Is_SPARK_Reference (E : Entity_Id; Typ : Character) return Boolean is begin -- The only references of interest on callable entities are calls. On -- uncallable entities, the only references of interest are reads and -- writes. if Ekind (E) in Overloadable_Kind then return Typ = 's'; -- In all other cases, result is true for reference/modify cases, -- and false for all other cases. else return Typ = 'r' or else Typ = 'm'; end if; end Is_SPARK_Reference; -------------------- -- Is_SPARK_Scope -- -------------------- function Is_SPARK_Scope (E : Entity_Id) return Boolean is begin return Present (E) and then not Is_Generic_Unit (E) and then Renamed_Entity (E) = Empty and then Get_Scope_Num (E) /= No_Scope; end Is_SPARK_Scope; -------- -- Lt -- -------- function Lt (Op1 : Natural; Op2 : Natural) return Boolean is T1 : constant Xref_Entry := Xrefs.Table (Rnums (Nat (Op1))); T2 : constant Xref_Entry := Xrefs.Table (Rnums (Nat (Op2))); begin -- First test: if entity is in different unit, sort by unit. Note: -- that we use Ent_Scope_File rather than Eun, as Eun may refer to -- the file where the generic scope is defined, which may differ from -- the file where the enclosing scope is defined. It is the latter -- which matters for a correct order here. if T1.Ent_Scope_File /= T2.Ent_Scope_File then return Dependency_Num (T1.Ent_Scope_File) < Dependency_Num (T2.Ent_Scope_File); -- Second test: within same unit, sort by location of the scope of -- the entity definition. elsif Get_Scope_Num (T1.Key.Ent_Scope) /= Get_Scope_Num (T2.Key.Ent_Scope) then return Get_Scope_Num (T1.Key.Ent_Scope) < Get_Scope_Num (T2.Key.Ent_Scope); -- Third test: within same unit and scope, sort by location of -- entity definition. elsif T1.Def /= T2.Def then return T1.Def < T2.Def; else -- Both entities must be equal at this point pragma Assert (T1.Key.Ent = T2.Key.Ent); pragma Assert (T1.Key.Ent_Scope = T2.Key.Ent_Scope); pragma Assert (T1.Ent_Scope_File = T2.Ent_Scope_File); -- Fourth test: if reference is in same unit as entity definition, -- sort first. if T1.Key.Lun /= T2.Key.Lun and then T1.Ent_Scope_File = T1.Key.Lun then return True; elsif T1.Key.Lun /= T2.Key.Lun and then T2.Ent_Scope_File = T2.Key.Lun then return False; -- Fifth test: if reference is in same unit and same scope as -- entity definition, sort first. elsif T1.Ent_Scope_File = T1.Key.Lun and then T1.Key.Ref_Scope /= T2.Key.Ref_Scope and then T1.Key.Ent_Scope = T1.Key.Ref_Scope then return True; elsif T2.Ent_Scope_File = T2.Key.Lun and then T1.Key.Ref_Scope /= T2.Key.Ref_Scope and then T2.Key.Ent_Scope = T2.Key.Ref_Scope then return False; -- Sixth test: for same entity, sort by reference location unit elsif T1.Key.Lun /= T2.Key.Lun then return Dependency_Num (T1.Key.Lun) < Dependency_Num (T2.Key.Lun); -- Seventh test: for same entity, sort by reference location scope elsif Get_Scope_Num (T1.Key.Ref_Scope) /= Get_Scope_Num (T2.Key.Ref_Scope) then return Get_Scope_Num (T1.Key.Ref_Scope) < Get_Scope_Num (T2.Key.Ref_Scope); -- Eighth test: order of location within referencing unit elsif T1.Key.Loc /= T2.Key.Loc then return T1.Key.Loc < T2.Key.Loc; -- Finally, for two locations at the same address prefer the one -- that does NOT have the type 'r', so that a modification or -- extension takes preference, when there are more than one -- reference at the same location. As a result, in the case of -- entities that are in-out actuals, the read reference follows -- the modify reference. else return T2.Key.Typ = 'r'; end if; end if; end Lt; ---------- -- Move -- ---------- procedure Move (From : Natural; To : Natural) is begin Rnums (Nat (To)) := Rnums (Nat (From)); end Move; ------------------- -- Set_Scope_Num -- ------------------- procedure Set_Scope_Num (N : Entity_Id; Num : Nat) is begin Scopes.Set (K => N, E => Scope_Rec'(Num => Num, Entity => N)); end Set_Scope_Num; ------------------------ -- Update_Scope_Range -- ------------------------ procedure Update_Scope_Range (S : Scope_Index; From : Xref_Index; To : Xref_Index) is begin SPARK_Scope_Table.Table (S).From_Xref := From; SPARK_Scope_Table.Table (S).To_Xref := To; end Update_Scope_Range; -- Local variables Col : Nat; From_Index : Xref_Index; Line : Nat; Prev_Loc : Source_Ptr; Prev_Typ : Character; Ref_Count : Nat; Ref_Id : Entity_Id; Ref_Name : String_Ptr; Scope_Id : Scope_Index; -- Start of processing for Add_SPARK_Xrefs begin for Index in SPARK_Scope_Table.First .. SPARK_Scope_Table.Last loop declare S : SPARK_Scope_Record renames SPARK_Scope_Table.Table (Index); begin Set_Scope_Num (S.Scope_Entity, S.Scope_Num); end; end loop; declare Drefs_Table : Drefs.Table_Type renames Drefs.Table (Drefs.First .. Drefs.Last); begin Xrefs.Append_All (Xrefs.Table_Type (Drefs_Table)); Nrefs := Nrefs + Drefs_Table'Length; end; -- Capture the definition Sloc values. As in the case of normal cross -- references, we have to wait until now to get the correct value. for Index in 1 .. Nrefs loop Xrefs.Table (Index).Def := Sloc (Xrefs.Table (Index).Key.Ent); end loop; -- Eliminate entries not appropriate for SPARK. Done prior to sorting -- cross-references, as it discards useless references which do not have -- a proper format for the comparison function (like no location). Ref_Count := Nrefs; Nrefs := 0; for Index in 1 .. Ref_Count loop declare Ref : Xref_Key renames Xrefs.Table (Index).Key; begin if SPARK_Entities (Ekind (Ref.Ent)) and then SPARK_References (Ref.Typ) and then Is_SPARK_Scope (Ref.Ent_Scope) and then Is_SPARK_Scope (Ref.Ref_Scope) and then Is_SPARK_Reference (Ref.Ent, Ref.Typ) -- Discard references from unknown scopes, e.g. generic scopes and then Get_Scope_Num (Ref.Ent_Scope) /= No_Scope and then Get_Scope_Num (Ref.Ref_Scope) /= No_Scope then Nrefs := Nrefs + 1; Rnums (Nrefs) := Index; end if; end; end loop; -- Sort the references Sorting.Sort (Integer (Nrefs)); -- Eliminate duplicate entries -- We need this test for Ref_Count because if we force ALI file -- generation in case of errors detected, it may be the case that -- Nrefs is 0, so we should not reset it here. if Nrefs >= 2 then Ref_Count := Nrefs; Nrefs := 1; for Index in 2 .. Ref_Count loop if Xrefs.Table (Rnums (Index)) /= Xrefs.Table (Rnums (Nrefs)) then Nrefs := Nrefs + 1; Rnums (Nrefs) := Rnums (Index); end if; end loop; end if; -- Eliminate the reference if it is at the same location as the previous -- one, unless it is a read-reference indicating that the entity is an -- in-out actual in a call. Ref_Count := Nrefs; Nrefs := 0; Prev_Loc := No_Location; Prev_Typ := 'm'; for Index in 1 .. Ref_Count loop declare Ref : Xref_Key renames Xrefs.Table (Rnums (Index)).Key; begin if Ref.Loc /= Prev_Loc or else (Prev_Typ = 'm' and then Ref.Typ = 'r') then Prev_Loc := Ref.Loc; Prev_Typ := Ref.Typ; Nrefs := Nrefs + 1; Rnums (Nrefs) := Rnums (Index); end if; end; end loop; -- The two steps have eliminated all references, nothing to do if SPARK_Scope_Table.Last = 0 then return; end if; Ref_Id := Empty; Scope_Id := 1; From_Index := 1; -- Loop to output references for Refno in 1 .. Nrefs loop declare Ref_Entry : Xref_Entry renames Xrefs.Table (Rnums (Refno)); Ref : Xref_Key renames Ref_Entry.Key; Typ : Character; begin -- If this assertion fails, the scope which we are looking for is -- not in SPARK scope table, which reveals either a problem in the -- construction of the scope table, or an erroneous scope for the -- current cross-reference. pragma Assert (Is_Future_Scope_Entity (Ref.Ent_Scope, Scope_Id)); -- Update the range of cross references to which the current scope -- refers to. This may be the empty range only for the first scope -- considered. if Ref.Ent_Scope /= Entity_Of_Scope (Scope_Id) then Update_Scope_Range (S => Scope_Id, From => From_Index, To => SPARK_Xref_Table.Last); From_Index := SPARK_Xref_Table.Last + 1; end if; while Ref.Ent_Scope /= Entity_Of_Scope (Scope_Id) loop Scope_Id := Scope_Id + 1; pragma Assert (Scope_Id <= SPARK_Scope_Table.Last); end loop; if Ref.Ent /= Ref_Id then Ref_Name := new String'(Unique_Name (Ref.Ent)); end if; if Ref.Ent = Heap then Line := 0; Col := 0; else Line := Nat (Get_Logical_Line_Number (Ref_Entry.Def)); Col := Nat (Get_Column_Number (Ref_Entry.Def)); end if; -- References to constant objects without variable inputs (see -- SPARK RM 3.3.1) are considered specially in SPARK section, -- because these will be translated as constants in the -- intermediate language for formal verification, and should -- therefore never appear in frame conditions. Other constants may -- later be treated the same, up to GNATprove to decide based on -- its flow analysis. if Is_Constant_Object_Without_Variable_Input (Ref.Ent) then Typ := 'c'; else Typ := Ref.Typ; end if; SPARK_Xref_Table.Append ( (Entity_Name => Ref_Name, Entity_Line => Line, Etype => Get_Entity_Type (Ref.Ent), Entity_Col => Col, File_Num => Dependency_Num (Ref.Lun), Scope_Num => Get_Scope_Num (Ref.Ref_Scope), Line => Nat (Get_Logical_Line_Number (Ref.Loc)), Rtype => Typ, Col => Nat (Get_Column_Number (Ref.Loc)))); end; end loop; -- Update the range of cross references to which the scope refers to Update_Scope_Range (S => Scope_Id, From => From_Index, To => SPARK_Xref_Table.Last); end Add_SPARK_Xrefs; ------------------------- -- Collect_SPARK_Xrefs -- ------------------------- procedure Collect_SPARK_Xrefs (Sdep_Table : Unit_Ref_Table; Num_Sdep : Nat) is Sdep : Pos; Sdep_Next : Pos; -- Index of the current and next source dependency Sdep_File : Pos; -- Index of the file to which the scopes need to be assigned; for -- library-level instances of generic units this points to the unit -- of the body, because this is where references are assigned to. Ubody : Unit_Number_Type; Uspec : Unit_Number_Type; -- Unit numbers for the dependency spec and possibly its body (only in -- the case of library-level instance of a generic package). begin -- Cross-references should have been computed first pragma Assert (Xrefs.Last /= 0); Initialize_SPARK_Tables; -- Generate file and scope SPARK cross-reference information Sdep := 1; while Sdep <= Num_Sdep loop -- Skip dependencies with no entity node, e.g. configuration files -- with pragmas (.adc) or target description (.atp), since they -- present no interest for SPARK cross references. if No (Cunit_Entity (Sdep_Table (Sdep))) then Sdep_Next := Sdep + 1; -- For library-level instantiation of a generic, two consecutive -- units refer to the same compilation unit node and entity (one to -- body, one to spec). In that case, treat them as a single unit for -- the sake of SPARK cross references by passing to Add_SPARK_File. else if Sdep < Num_Sdep and then Cunit_Entity (Sdep_Table (Sdep)) = Cunit_Entity (Sdep_Table (Sdep + 1)) then declare Cunit1 : Node_Id renames Cunit (Sdep_Table (Sdep)); Cunit2 : Node_Id renames Cunit (Sdep_Table (Sdep + 1)); begin -- Both Cunits point to compilation unit nodes pragma Assert (Nkind (Cunit1) = N_Compilation_Unit and then Nkind (Cunit2) = N_Compilation_Unit); -- Do not depend on the sorting order, which is based on -- Unit_Name, and for library-level instances of nested -- generic packages they are equal. -- If declaration comes before the body if Nkind (Unit (Cunit1)) = N_Package_Declaration and then Nkind (Unit (Cunit2)) = N_Package_Body then Uspec := Sdep_Table (Sdep); Ubody := Sdep_Table (Sdep + 1); Sdep_File := Sdep + 1; -- If body comes before declaration elsif Nkind (Unit (Cunit1)) = N_Package_Body and then Nkind (Unit (Cunit2)) = N_Package_Declaration then Uspec := Sdep_Table (Sdep + 1); Ubody := Sdep_Table (Sdep); Sdep_File := Sdep; -- Otherwise it is an error else raise Program_Error; end if; Sdep_Next := Sdep + 2; end; -- ??? otherwise? else Uspec := Sdep_Table (Sdep); Ubody := No_Unit; Sdep_File := Sdep; Sdep_Next := Sdep + 1; end if; Add_SPARK_File (Uspec => Uspec, Ubody => Ubody, Dspec => Sdep_File); end if; Sdep := Sdep_Next; end loop; -- Fill in the spec information when relevant declare package Entity_Hash_Table is new GNAT.HTable.Simple_HTable (Header_Num => Entity_Hashed_Range, Element => Scope_Index, No_Element => 0, Key => Entity_Id, Hash => Entity_Hash, Equal => "="); begin -- Fill in the hash-table for S in SPARK_Scope_Table.First .. SPARK_Scope_Table.Last loop declare Srec : SPARK_Scope_Record renames SPARK_Scope_Table.Table (S); begin Entity_Hash_Table.Set (Srec.Scope_Entity, S); end; end loop; -- Use the hash-table to locate spec entities for S in SPARK_Scope_Table.First .. SPARK_Scope_Table.Last loop declare Srec : SPARK_Scope_Record renames SPARK_Scope_Table.Table (S); Spec_Entity : constant Entity_Id := Unique_Entity (Srec.Scope_Entity); Spec_Scope : constant Scope_Index := Entity_Hash_Table.Get (Spec_Entity); begin -- Generic spec may be missing in which case Spec_Scope is zero if Spec_Entity /= Srec.Scope_Entity and then Spec_Scope /= 0 then Srec.Spec_File_Num := SPARK_Scope_Table.Table (Spec_Scope).File_Num; Srec.Spec_Scope_Num := SPARK_Scope_Table.Table (Spec_Scope).Scope_Num; end if; end; end loop; end; -- Generate SPARK cross-reference information Add_SPARK_Xrefs; end Collect_SPARK_Xrefs; ------------------------------------- -- Enclosing_Subprogram_Or_Package -- ------------------------------------- function Enclosing_Subprogram_Or_Library_Package (N : Node_Id) return Entity_Id is Context : Entity_Id; begin -- If N is the defining identifier for a subprogram, then return the -- enclosing subprogram or package, not this subprogram. if Nkind_In (N, N_Defining_Identifier, N_Defining_Operator_Symbol) and then (Ekind (N) in Entry_Kind or else Ekind (N) = E_Subprogram_Body or else Ekind (N) in Generic_Subprogram_Kind or else Ekind (N) in Subprogram_Kind) then Context := Parent (Unit_Declaration_Node (N)); -- If this was a library-level subprogram then replace Context with -- its Unit, which points to N_Subprogram_* node. if Nkind (Context) = N_Compilation_Unit then Context := Unit (Context); end if; else Context := N; end if; while Present (Context) loop case Nkind (Context) is when N_Package_Body | N_Package_Specification => -- Only return a library-level package if Is_Library_Level_Entity (Defining_Entity (Context)) then Context := Defining_Entity (Context); exit; else Context := Parent (Context); end if; when N_Pragma => -- The enclosing subprogram for a precondition, postcondition, -- or contract case should be the declaration preceding the -- pragma (skipping any other pragmas between this pragma and -- this declaration. while Nkind (Context) = N_Pragma and then Is_List_Member (Context) and then Present (Prev (Context)) loop Context := Prev (Context); end loop; if Nkind (Context) = N_Pragma then Context := Parent (Context); end if; when N_Entry_Body | N_Entry_Declaration | N_Protected_Type_Declaration | N_Subprogram_Body | N_Subprogram_Declaration | N_Subprogram_Specification | N_Task_Body | N_Task_Type_Declaration => Context := Defining_Entity (Context); exit; when others => Context := Parent (Context); end case; end loop; if Nkind (Context) = N_Defining_Program_Unit_Name then Context := Defining_Identifier (Context); end if; -- Do not return a scope without a proper location if Present (Context) and then Sloc (Context) = No_Location then return Empty; end if; return Context; end Enclosing_Subprogram_Or_Library_Package; ----------------- -- Entity_Hash -- ----------------- function Entity_Hash (E : Entity_Id) return Entity_Hashed_Range is begin return Entity_Hashed_Range (E mod (Entity_Id (Entity_Hashed_Range'Last) + 1)); end Entity_Hash; -------------------------- -- Generate_Dereference -- -------------------------- procedure Generate_Dereference (N : Node_Id; Typ : Character := 'r') is procedure Create_Heap; -- Create and decorate the special entity which denotes the heap ----------------- -- Create_Heap -- ----------------- procedure Create_Heap is begin Name_Len := Name_Of_Heap_Variable'Length; Name_Buffer (1 .. Name_Len) := Name_Of_Heap_Variable; Heap := Make_Defining_Identifier (Standard_Location, Name_Enter); Set_Ekind (Heap, E_Variable); Set_Is_Internal (Heap, True); Set_Has_Fully_Qualified_Name (Heap); end Create_Heap; -- Local variables Loc : constant Source_Ptr := Sloc (N); -- Start of processing for Generate_Dereference begin if Loc > No_Location then Drefs.Increment_Last; declare Deref_Entry : Xref_Entry renames Drefs.Table (Drefs.Last); Deref : Xref_Key renames Deref_Entry.Key; begin if No (Heap) then Create_Heap; end if; Deref.Ent := Heap; Deref.Loc := Loc; Deref.Typ := Typ; -- It is as if the special "Heap" was defined in the main unit, -- in the scope of the entity for the main unit. This single -- definition point is required to ensure that sorting cross -- references works for "Heap" references as well. Deref.Eun := Main_Unit; Deref.Lun := Get_Top_Level_Code_Unit (Loc); Deref.Ref_Scope := Enclosing_Subprogram_Or_Library_Package (N); Deref.Ent_Scope := Cunit_Entity (Main_Unit); Deref_Entry.Def := No_Location; Deref_Entry.Ent_Scope_File := Main_Unit; end; end if; end Generate_Dereference; ------------------------------- -- Traverse_Compilation_Unit -- ------------------------------- procedure Traverse_Compilation_Unit (CU : Node_Id; Inside_Stubs : Boolean) is procedure Traverse_Block (N : Node_Id); procedure Traverse_Declaration_Or_Statement (N : Node_Id); procedure Traverse_Declarations_And_HSS (N : Node_Id); procedure Traverse_Declarations_Or_Statements (L : List_Id); procedure Traverse_Handled_Statement_Sequence (N : Node_Id); procedure Traverse_Package_Body (N : Node_Id); procedure Traverse_Visible_And_Private_Parts (N : Node_Id); procedure Traverse_Protected_Body (N : Node_Id); procedure Traverse_Subprogram_Body (N : Node_Id); procedure Traverse_Task_Body (N : Node_Id); -- Traverse corresponding construct, calling Process on all declarations -------------------- -- Traverse_Block -- -------------------- procedure Traverse_Block (N : Node_Id) renames Traverse_Declarations_And_HSS; --------------------------------------- -- Traverse_Declaration_Or_Statement -- --------------------------------------- procedure Traverse_Declaration_Or_Statement (N : Node_Id) is function Traverse_Stub (N : Node_Id) return Boolean; -- Returns True iff stub N should be traversed function Traverse_Stub (N : Node_Id) return Boolean is begin pragma Assert (Nkind_In (N, N_Package_Body_Stub, N_Protected_Body_Stub, N_Subprogram_Body_Stub, N_Task_Body_Stub)); return Inside_Stubs and then Present (Library_Unit (N)); end Traverse_Stub; -- Start of processing for Traverse_Declaration_Or_Statement begin case Nkind (N) is when N_Package_Declaration => Traverse_Visible_And_Private_Parts (Specification (N)); when N_Package_Body => Traverse_Package_Body (N); when N_Package_Body_Stub => if Traverse_Stub (N) then Traverse_Package_Body (Get_Body_From_Stub (N)); end if; when N_Subprogram_Body => Traverse_Subprogram_Body (N); when N_Entry_Body => Traverse_Subprogram_Body (N); when N_Subprogram_Body_Stub => if Traverse_Stub (N) then Traverse_Subprogram_Body (Get_Body_From_Stub (N)); end if; when N_Protected_Body => Traverse_Protected_Body (N); when N_Protected_Body_Stub => if Traverse_Stub (N) then Traverse_Protected_Body (Get_Body_From_Stub (N)); end if; when N_Protected_Type_Declaration => Traverse_Visible_And_Private_Parts (Protected_Definition (N)); when N_Task_Definition => Traverse_Visible_And_Private_Parts (N); when N_Task_Body => Traverse_Task_Body (N); when N_Task_Body_Stub => if Traverse_Stub (N) then Traverse_Task_Body (Get_Body_From_Stub (N)); end if; when N_Block_Statement => Traverse_Block (N); when N_If_Statement => -- Traverse the statements in the THEN part Traverse_Declarations_Or_Statements (Then_Statements (N)); -- Loop through ELSIF parts if present if Present (Elsif_Parts (N)) then declare Elif : Node_Id := First (Elsif_Parts (N)); begin while Present (Elif) loop Traverse_Declarations_Or_Statements (Then_Statements (Elif)); Next (Elif); end loop; end; end if; -- Finally traverse the ELSE statements if present Traverse_Declarations_Or_Statements (Else_Statements (N)); when N_Case_Statement => -- Process case branches declare Alt : Node_Id := First (Alternatives (N)); begin loop Traverse_Declarations_Or_Statements (Statements (Alt)); Next (Alt); exit when No (Alt); end loop; end; when N_Extended_Return_Statement => Traverse_Handled_Statement_Sequence (Handled_Statement_Sequence (N)); when N_Loop_Statement => Traverse_Declarations_Or_Statements (Statements (N)); -- Generic declarations are ignored when others => null; end case; end Traverse_Declaration_Or_Statement; ----------------------------------- -- Traverse_Declarations_And_HSS -- ----------------------------------- procedure Traverse_Declarations_And_HSS (N : Node_Id) is begin Traverse_Declarations_Or_Statements (Declarations (N)); Traverse_Handled_Statement_Sequence (Handled_Statement_Sequence (N)); end Traverse_Declarations_And_HSS; ----------------------------------------- -- Traverse_Declarations_Or_Statements -- ----------------------------------------- procedure Traverse_Declarations_Or_Statements (L : List_Id) is N : Node_Id; begin -- Loop through statements or declarations N := First (L); while Present (N) loop -- Call Process on all declarations if Nkind (N) in N_Declaration or else Nkind (N) in N_Later_Decl_Item or else Nkind (N) = N_Entry_Body then Process (N); end if; Traverse_Declaration_Or_Statement (N); Next (N); end loop; end Traverse_Declarations_Or_Statements; ----------------------------------------- -- Traverse_Handled_Statement_Sequence -- ----------------------------------------- procedure Traverse_Handled_Statement_Sequence (N : Node_Id) is Handler : Node_Id; begin if Present (N) then Traverse_Declarations_Or_Statements (Statements (N)); if Present (Exception_Handlers (N)) then Handler := First (Exception_Handlers (N)); while Present (Handler) loop Traverse_Declarations_Or_Statements (Statements (Handler)); Next (Handler); end loop; end if; end if; end Traverse_Handled_Statement_Sequence; --------------------------- -- Traverse_Package_Body -- --------------------------- procedure Traverse_Package_Body (N : Node_Id) is Spec_E : constant Entity_Id := Unique_Defining_Entity (N); begin case Ekind (Spec_E) is when E_Package => Traverse_Declarations_And_HSS (N); when E_Generic_Package => null; when others => raise Program_Error; end case; end Traverse_Package_Body; ----------------------------- -- Traverse_Protected_Body -- ----------------------------- procedure Traverse_Protected_Body (N : Node_Id) is begin Traverse_Declarations_Or_Statements (Declarations (N)); end Traverse_Protected_Body; ------------------------------ -- Traverse_Subprogram_Body -- ------------------------------ procedure Traverse_Subprogram_Body (N : Node_Id) is Spec_E : constant Entity_Id := Unique_Defining_Entity (N); begin case Ekind (Spec_E) is when Entry_Kind | E_Function | E_Procedure => Traverse_Declarations_And_HSS (N); when Generic_Subprogram_Kind => null; when others => raise Program_Error; end case; end Traverse_Subprogram_Body; ------------------------ -- Traverse_Task_Body -- ------------------------ procedure Traverse_Task_Body (N : Node_Id) renames Traverse_Declarations_And_HSS; ---------------------------------------- -- Traverse_Visible_And_Private_Parts -- ---------------------------------------- procedure Traverse_Visible_And_Private_Parts (N : Node_Id) is begin Traverse_Declarations_Or_Statements (Visible_Declarations (N)); Traverse_Declarations_Or_Statements (Private_Declarations (N)); end Traverse_Visible_And_Private_Parts; -- Local variables Lu : Node_Id; -- Start of processing for Traverse_Compilation_Unit begin -- Get Unit (checking case of subunit) Lu := Unit (CU); if Nkind (Lu) = N_Subunit then Lu := Proper_Body (Lu); end if; -- Do not add scopes for generic units if Nkind (Lu) = N_Package_Body and then Ekind (Corresponding_Spec (Lu)) in Generic_Unit_Kind then return; end if; -- Call Process on all declarations if Nkind (Lu) in N_Declaration or else Nkind (Lu) in N_Later_Decl_Item then Process (Lu); end if; -- Traverse the unit Traverse_Declaration_Or_Statement (Lu); end Traverse_Compilation_Unit; end SPARK_Specific;

33.082361

79

0.533178

2f5b08e42671575188a3575e47e5798f4e8698c2

964

adb

Ada

src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/complete/pck.adb

alrooney/unum-sdk

bbccb10b0cd3500feccbbef22e27ea111c3d18eb

[ "Apache-2.0" ]

31

2018-08-01T21:25:24.000Z

2022-02-14T07:52:34.000Z

src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/complete/pck.adb

alrooney/unum-sdk

bbccb10b0cd3500feccbbef22e27ea111c3d18eb

[ "Apache-2.0" ]

40

2018-12-03T19:48:52.000Z

2021-03-10T06:34:26.000Z

src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/complete/pck.adb

alrooney/unum-sdk

bbccb10b0cd3500feccbbef22e27ea111c3d18eb

[ "Apache-2.0" ]

20

2018-11-16T21:19:22.000Z

2021-10-18T23:08:24.000Z

-- Copyright 2008-2019 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- This program is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. package body Pck is procedure Proc (I : Integer) is Not_In_Scope : Integer := 77; begin Inner.Inside_Variable := Not_In_Scope + I; end Proc; procedure Ambiguous_Func is begin null; end Ambiguous_Func; end Pck;

32.133333

73

0.715768

31162f9f793f6ebf7d4859d24c0d8235dc3e7118

1,592

adb

Ada

src/fltk-images-rgb-bmp.adb

micahwelf/FLTK-Ada

83e0c58ea98e5ede2cbbb158b42eae44196c3ba7

[ "Unlicense" ]

1

2020-12-18T15:20:13.000Z

src/fltk-images-rgb-bmp.adb

micahwelf/FLTK-Ada

83e0c58ea98e5ede2cbbb158b42eae44196c3ba7

[ "Unlicense" ]

null

src/fltk-images-rgb-bmp.adb

micahwelf/FLTK-Ada

83e0c58ea98e5ede2cbbb158b42eae44196c3ba7

[ "Unlicense" ]

null

with Interfaces.C, System; use type System.Address; package body FLTK.Images.RGB.BMP is function new_fl_bmp_image (F : in Interfaces.C.char_array) return System.Address; pragma Import (C, new_fl_bmp_image, "new_fl_bmp_image"); pragma Inline (new_fl_bmp_image); procedure free_fl_bmp_image (P : in System.Address); pragma Import (C, free_fl_bmp_image, "free_fl_bmp_image"); pragma Inline (free_fl_bmp_image); overriding procedure Finalize (This : in out BMP_Image) is begin if This.Void_Ptr /= System.Null_Address and then This in BMP_Image'Class then free_fl_bmp_image (This.Void_Ptr); This.Void_Ptr := System.Null_Address; end if; Finalize (RGB_Image (This)); end Finalize; package body Forge is function Create (Filename : in String) return BMP_Image is begin return This : BMP_Image do This.Void_Ptr := new_fl_bmp_image (Interfaces.C.To_C (Filename)); case fl_image_fail (This.Void_Ptr) is when 1 => raise No_Image_Error; when 2 => raise File_Access_Error; when 3 => raise Format_Error; when others => null; end case; end return; end Create; end Forge; end FLTK.Images.RGB.BMP;

22.111111

62

0.534548

fba6950d0d22221f95c467ded11f9731336ff07e

1,974

ads

Ada

src/model/grammar/lse-model-grammar-symbol-logopositionrestore.ads

mgrojo/lsystem-editor

1f855bc1f783c8d7a1c81594c8aee403e4b53132

[ "MIT" ]

2

2021-01-09T14:49:35.000Z

2022-01-18T18:57:45.000Z

src/model/grammar/lse-model-grammar-symbol-logopositionrestore.ads

mgrojo/lsystem-editor

1f855bc1f783c8d7a1c81594c8aee403e4b53132

[ "MIT" ]

1

2021-12-03T18:49:59.000Z

src/model/grammar/lse-model-grammar-symbol-logopositionrestore.ads

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. ------------------------------------------------------------------------------- with LSE.Model.IO.Turtle_Utils; with LSE.Model.Grammar.Symbol; use LSE.Model.IO.Turtle_Utils; use LSE.Model.Grammar.Symbol; -- @description -- This package provides position restoring LOGO Turtle Symbol. -- package LSE.Model.Grammar.Symbol.LogoPositionRestore is type Instance is new LSE.Model.Grammar.Symbol.Instance with null record; overriding procedure Initialize (This : out Instance); overriding procedure Interpret (This : in out Instance; T : in out Holder); end LSE.Model.Grammar.Symbol.LogoPositionRestore;

39.48

79

0.680344

12ef3d0dba232623e8af162dcc0c367c7490af85

9,807

ads

Ada

src/main/resources/project-templates/microbit_example/src/font5x5.ads

georgemackayshore/Ada-IntelliJ

581f87237a610b3142aed20358b955bdca807213

[ "Apache-2.0" ]

17

2018-10-03T21:31:03.000Z

2021-01-22T04:16:05.000Z

src/main/resources/project-templates/microbit_example/src/font5x5.ads

georgemackayshore/Ada-IntelliJ

581f87237a610b3142aed20358b955bdca807213

[ "Apache-2.0" ]

20

2018-11-01T21:17:09.000Z

2021-10-01T18:57:20.000Z

src/main/resources/project-templates/microbit_example/src/font5x5.ads

georgemackayshore/Ada-IntelliJ

581f87237a610b3142aed20358b955bdca807213

[ "Apache-2.0" ]

4

2020-04-14T15:02:37.000Z

2022-03-10T20:35:54.000Z

------------------------------------------------------------------------------ -- Copyright (C) 2018, AdaCore -- -- -- -- This is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. This software is distributed in the hope that it will be useful, -- -- but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHAN- -- -- TABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public -- -- License for more details. You should have received a copy of the GNU -- -- General Public License distributed with this software; see file -- -- COPYING3. If not, go to http://www.gnu.org/licenses for a complete copy -- -- of the license. -- ------------------------------------------------------------------------------ with HAL; package Font5x5 is type Glyph is array (0 .. 4) of HAL.UInt5; Font : constant array (0 .. 93) of Glyph := ((2#00100#, -- ! 2#00100#, 2#00100#, 2#00000#, 2#00100#), (2#01010#, -- " 2#01010#, 2#00000#, 2#00000#, 2#00000#), (2#01010#, -- # 2#11111#, 2#01010#, 2#11111#, 2#01010#), (2#11110#, -- $ 2#00101#, 2#01110#, 2#00100#, 2#01111#), (2#10001#, -- % 2#01000#, 2#00100#, 2#00010#, 2#10001#), (2#00100#, -- & 2#01010#, 2#00100#, 2#01010#, 2#10100#), (2#01000#, -- ' 2#00100#, 2#00000#, 2#00000#, 2#00000#), (2#01000#, -- ( 2#00100#, 2#00100#, 2#00100#, 2#01000#), (2#00010#, -- ) 2#00100#, 2#00100#, 2#00100#, 2#00010#), (2#00000#, -- * 2#00100#, 2#01010#, 2#00100#, 2#00000#), (2#00000#, -- + 2#00100#, 2#01110#, 2#00100#, 2#00000#), (2#00000#, -- , 2#00000#, 2#00000#, 2#00100#, 2#00010#), (2#00000#, -- - 2#00000#, 2#01110#, 2#00000#, 2#00000#), (2#00000#, -- . 2#00000#, 2#00000#, 2#00000#, 2#00010#), (2#10000#, -- / 2#01000#, 2#00100#, 2#00010#, 2#00001#), (2#01110#, -- 0 2#10001#, 2#10001#, 2#10001#, 2#01110#), (2#00100#, -- 1 2#00110#, 2#00100#, 2#00100#, 2#00100#), (2#01110#, -- 2 2#10001#, 2#01000#, 2#00100#, 2#11111#), (2#01111#, -- 3 2#10000#, 2#01111#, 2#10000#, 2#01111#), (2#01000#, -- 4 2#01010#, 2#01001#, 2#11111#, 2#01000#), (2#11111#, -- 5 2#00001#, 2#01111#, 2#10000#, 2#01111#), (2#01110#, -- 6 2#00001#, 2#00111#, 2#01001#, 2#01110#), (2#01110#, -- 7 2#01000#, 2#00100#, 2#00100#, 2#00100#), (2#01110#, -- 8 2#10001#, 2#01110#, 2#10001#, 2#01110#), (2#01110#, -- 9 2#10001#, 2#11110#, 2#10000#, 2#01110#), (2#00000#, -- : 2#00100#, 2#00000#, 2#00100#, 2#00000#), (2#00000#, -- ; 2#00100#, 2#00000#, 2#00100#, 2#00010#), (2#00000#, -- < 2#00100#, 2#00010#, 2#00100#, 2#00000#), (2#00000#, -- = 2#01110#, 2#00000#, 2#01110#, 2#00000#), (2#00000#, -- > 2#00100#, 2#01000#, 2#00100#, 2#00000#), (2#00100#, -- ? 2#01000#, 2#00100#, 2#00000#, 2#00100#), (2#01110#, -- @ 2#10001#, 2#10101#, 2#10001#, 2#00110#), (2#01110#, -- A 2#10001#, 2#11111#, 2#10001#, 2#10001#), (2#01111#, -- B 2#10001#, 2#01111#, 2#10001#, 2#01111#), (2#11110#, -- C 2#00001#, 2#00001#, 2#00001#, 2#11110#), (2#01111#, -- D 2#10001#, 2#10001#, 2#10001#, 2#01111#), (2#11111#, -- E 2#00001#, 2#00111#, 2#00001#, 2#11111#), (2#11111#, -- F 2#00001#, 2#00111#, 2#00001#, 2#00001#), (2#11110#, -- G 2#00001#, 2#11101#, 2#10001#, 2#01110#), (2#10001#, -- H 2#10001#, 2#11111#, 2#10001#, 2#10001#), (2#00100#, -- I 2#00100#, 2#00100#, 2#00100#, 2#00100#), (2#10000#, -- J 2#10000#, 2#10000#, 2#10001#, 2#01110#), (2#01001#, -- K 2#00101#, 2#00011#, 2#00101#, 2#01001#), (2#00001#, -- L 2#00001#, 2#00001#, 2#00001#, 2#11111#), (2#10001#, -- M 2#11011#, 2#10101#, 2#10001#, 2#10001#), (2#10001#, -- N 2#10011#, 2#10101#, 2#11001#, 2#10001#), (2#01110#, -- O 2#10001#, 2#10001#, 2#10001#, 2#01110#), (2#01111#, -- P 2#10001#, 2#01111#, 2#00001#, 2#00001#), (2#01110#, -- Q 2#10001#, 2#10001#, 2#11001#, 2#11110#), (2#01111#, -- R 2#10001#, 2#01111#, 2#01001#, 2#10001#), (2#11110#, -- S 2#00001#, 2#01110#, 2#10000#, 2#01111#), (2#11111#, -- T 2#00100#, 2#00100#, 2#00100#, 2#00100#), (2#10001#, -- U 2#10001#, 2#10001#, 2#10001#, 2#01110#), (2#10001#, -- V 2#10001#, 2#01010#, 2#01010#, 2#00100#), (2#10101#, -- W 2#10101#, 2#10101#, 2#01010#, 2#01010#), (2#10001#, -- X 2#01010#, 2#00100#, 2#01010#, 2#10001#), (2#10001#, -- Y 2#01010#, 2#00100#, 2#00100#, 2#00100#), (2#11111#, -- Z 2#01000#, 2#00100#, 2#00010#, 2#11111#), (2#01110#, -- [ 2#00010#, 2#00010#, 2#00010#, 2#01110#), (2#00001#, -- \ 2#00010#, 2#00100#, 2#01000#, 2#10000#), (2#01110#, -- ] 2#01000#, 2#01000#, 2#01000#, 2#01110#), (2#00100#, -- ^ 2#01010#, 2#10001#, 2#00000#, 2#00000#), (2#00000#, -- _ 2#00000#, 2#00000#, 2#00000#, 2#11111#), (2#00010#, -- ` 2#00100#, 2#00000#, 2#00000#, 2#00000#), (2#01111#, -- a 2#10000#, 2#11110#, 2#10001#, 2#11110#), (2#00001#, -- b 2#01111#, 2#10001#, 2#10001#, 2#01111#), (2#01110#, -- c 2#10001#, 2#00001#, 2#10001#, 2#01110#), (2#10000#, -- d 2#11110#, 2#10001#, 2#10001#, 2#11110#), (2#01110#, -- e 2#10001#, 2#11111#, 2#00001#, 2#11110#), (2#11110#, -- f 2#00001#, 2#00111#, 2#00001#, 2#00001#), (2#01110#, -- g 2#10001#, 2#11110#, 2#10000#, 2#01111#), (2#00001#, -- h 2#01111#, 2#10001#, 2#10001#, 2#10001#), (2#00100#, -- i 2#00000#, 2#00100#, 2#00100#, 2#00100#), (2#10000#, -- j 2#10000#, 2#10000#, 2#10000#, 2#01111#), (2#10001#, -- k 2#01001#, 2#00111#, 2#01001#, 2#10001#), (2#00001#, -- l 2#00001#, 2#00001#, 2#00001#, 2#11110#), (2#01010#, -- m 2#10101#, 2#10101#, 2#10101#, 2#10101#), (2#01111#, -- n 2#10001#, 2#10001#, 2#10001#, 2#10001#), (2#01110#, -- o 2#10001#, 2#10001#, 2#10001#, 2#01110#), (2#01111#, -- p 2#10001#, 2#10001#, 2#01111#, 2#00001#), (2#11110#, -- q 2#10001#, 2#10001#, 2#11110#, 2#10000#), (2#01101#, -- r 2#10011#, 2#00001#, 2#00001#, 2#00001#), (2#11110#, -- s 2#00001#, 2#01110#, 2#10000#, 2#01111#), (2#00001#, -- t 2#00111#, 2#00001#, 2#10001#, 2#01110#), (2#10001#, -- u 2#10001#, 2#10001#, 2#11001#, 2#10110#), (2#10001#, -- v 2#10001#, 2#01010#, 2#01010#, 2#00100#), (2#10101#, -- w 2#10101#, 2#10101#, 2#10101#, 2#01010#), (2#10001#, -- x 2#10001#, 2#01110#, 2#10001#, 2#10001#), (2#10001#, -- y 2#10001#, 2#11110#, 2#10000#, 2#01111#), (2#11111#, -- z 2#01000#, 2#00100#, 2#00010#, 2#11111#), (2#00100#, -- { 2#00100#, 2#00010#, 2#00100#, 2#00100#), (2#00100#, -- | 2#00100#, 2#00100#, 2#00100#, 2#00100#), (2#00100#, -- } 2#00100#, 2#01000#, 2#00100#, 2#00100#), (2#00000#, -- ~ 2#00000#, 2#01010#, 2#10101#, 2#00000#) ); end Font5x5;

19.812121

78

0.357704

06140d1074be3547c8304e53d3d4c33ff10ca443

3,808

ads

Ada

tools-src/gnu/gcc/gcc/ada/s-pack54.ads

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

80

2015-01-02T10:14:04.000Z

2021-06-07T06:29:49.000Z

tools-src/gnu/gcc/gcc/ada/s-pack54.ads

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

9

2015-05-14T11:03:12.000Z

2018-01-04T07:12:58.000Z

tools-src/gnu/gcc/gcc/ada/s-pack54.ads

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

69

2015-01-02T10:45:56.000Z

2021-09-06T07:52:13.000Z

------------------------------------------------------------------------------ -- -- -- GNAT RUNTIME COMPONENTS -- -- -- -- S Y S T E M . P A C K _ 5 4 -- -- -- -- S p e c -- -- -- -- $Revision$ -- -- -- Copyright (C) 1992-1999 Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 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. -- -- -- ------------------------------------------------------------------------------ -- Handling of packed arrays with Component_Size = 54 package System.Pack_54 is pragma Preelaborate (Pack_54); Bits : constant := 54; type Bits_54 is mod 2 ** Bits; for Bits_54'Size use Bits; function Get_54 (Arr : System.Address; N : Natural) return Bits_54; -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is extracted and returned. procedure Set_54 (Arr : System.Address; N : Natural; E : Bits_54); -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is set to the given value. function GetU_54 (Arr : System.Address; N : Natural) return Bits_54; -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is extracted and returned. This version -- is used when Arr may represent an unaligned address. procedure SetU_54 (Arr : System.Address; N : Natural; E : Bits_54); -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is set to the given value. This version -- is used when Arr may represent an unaligned address end System.Pack_54;

58.584615

78

0.485557

4dbb6eec1325dd419fb1b36e88cc59cc3b550988

6,272

ads

Ada

source/league/arch/x86_generic/matreshka-internals-strings-handlers-generic_x86_sse2.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/league/arch/x86_generic/matreshka-internals-strings-handlers-generic_x86_sse2.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/league/arch/x86_generic/matreshka-internals-strings-handlers-generic_x86_sse2.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Localization, Internationalization, Globalization for Ada -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2013, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ -- This package provides string handler optimized for SSE2 instructions set -- on x86 and x86_64 processors. ------------------------------------------------------------------------------ with Interfaces; generic type Base_String_Handler is abstract new Abstract_String_Handler with private; with procedure Update_Index_Forward (Mask : Interfaces.Unsigned_32; Index : in out Positive); -- Update character index based on value of the exclusion mask. It -- increments Index by 8 excluding 1 for each pair of 1 bits in exclusion -- mask. with procedure Update_Index_Backward (Mask : Interfaces.Unsigned_32; Index : in out Positive); -- Update character index based on value of the exclusion mask. It -- decrements Index by 8 excluding 1 for each pair of 1 bits in exclusion -- mask. package Matreshka.Internals.Strings.Handlers.Generic_X86_SSE2 is pragma Preelaborate; type X86_SSE2_String_Handler is new Base_String_Handler with null record; overriding procedure Fill_Null_Terminator (Self : X86_SSE2_String_Handler; Item : not null Shared_String_Access); overriding function Is_Equal (Self : X86_SSE2_String_Handler; Left : not null Shared_String_Access; Right : not null Shared_String_Access) return Boolean; overriding function Is_Less (Self : X86_SSE2_String_Handler; Left : not null Shared_String_Access; Right : not null Shared_String_Access) return Boolean; overriding function Is_Greater (Self : X86_SSE2_String_Handler; Left : not null Shared_String_Access; Right : not null Shared_String_Access) return Boolean; overriding function Is_Less_Or_Equal (Self : X86_SSE2_String_Handler; Left : not null Shared_String_Access; Right : not null Shared_String_Access) return Boolean; overriding function Is_Greater_Or_Equal (Self : X86_SSE2_String_Handler; Left : not null Shared_String_Access; Right : not null Shared_String_Access) return Boolean; overriding function Index (Self : X86_SSE2_String_Handler; Item : Matreshka.Internals.Strings.Shared_String_Access; From_Index : Positive; From_Position : Matreshka.Internals.Utf16.Utf16_String_Index; To_Position : Matreshka.Internals.Utf16.Utf16_String_Index; Code : Matreshka.Internals.Unicode.Code_Point) return Natural; overriding function Last_Index (Self : X86_SSE2_String_Handler; Item : Matreshka.Internals.Strings.Shared_String_Access; From_Position : Matreshka.Internals.Utf16.Utf16_String_Index; To_Index : Positive; To_Position : Matreshka.Internals.Utf16.Utf16_String_Index; Code : Matreshka.Internals.Unicode.Code_Point) return Natural; Handler : aliased X86_SSE2_String_Handler; end Matreshka.Internals.Strings.Handlers.Generic_X86_SSE2;

51.409836

78

0.547194

06e9c6b76b898511cc6d43ef1cfa371ea979be8f

9,469

ads

Ada

tools/scitools/conf/understand/ada/ada05/a-stwima.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

1

2020-01-20T21:26:46.000Z

tools/scitools/conf/understand/ada/ada05/a-stwima.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

tools/scitools/conf/understand/ada/ada05/a-stwima.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . S T R I N G S . W I D E _ M A P S -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2006, Free Software Foundation, Inc. -- -- -- -- This specification is derived from the Ada Reference Manual for use with -- -- GNAT. The copyright notice above, and the license provisions that follow -- -- apply solely to the contents of the part following the private keyword. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- -- -- -- -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Ada.Finalization; package Ada.Strings.Wide_Maps is pragma Preelaborate; ------------------------------------- -- Wide Character Set Declarations -- ------------------------------------- type Wide_Character_Set is private; pragma Preelaborable_Initialization (Wide_Character_Set); -- Representation for a set of Wide_Character values: Null_Set : constant Wide_Character_Set; ------------------------------------------ -- Constructors for Wide Character Sets -- ------------------------------------------ type Wide_Character_Range is record Low : Wide_Character; High : Wide_Character; end record; -- Represents Wide_Character range Low .. High type Wide_Character_Ranges is array (Positive range <>) of Wide_Character_Range; function To_Set (Ranges : Wide_Character_Ranges) return Wide_Character_Set; function To_Set (Span : Wide_Character_Range) return Wide_Character_Set; function To_Ranges (Set : Wide_Character_Set) return Wide_Character_Ranges; --------------------------------------- -- Operations on Wide Character Sets -- --------------------------------------- function "=" (Left, Right : Wide_Character_Set) return Boolean; function "not" (Right : Wide_Character_Set) return Wide_Character_Set; function "and" (Left, Right : Wide_Character_Set) return Wide_Character_Set; function "or" (Left, Right : Wide_Character_Set) return Wide_Character_Set; function "xor" (Left, Right : Wide_Character_Set) return Wide_Character_Set; function "-" (Left, Right : Wide_Character_Set) return Wide_Character_Set; function Is_In (Element : Wide_Character; Set : Wide_Character_Set) return Boolean; function Is_Subset (Elements : Wide_Character_Set; Set : Wide_Character_Set) return Boolean; function "<=" (Left : Wide_Character_Set; Right : Wide_Character_Set) return Boolean renames Is_Subset; subtype Wide_Character_Sequence is Wide_String; -- Alternative representation for a set of character values function To_Set (Sequence : Wide_Character_Sequence) return Wide_Character_Set; function To_Set (Singleton : Wide_Character) return Wide_Character_Set; function To_Sequence (Set : Wide_Character_Set) return Wide_Character_Sequence; ----------------------------------------- -- Wide Character Mapping Declarations -- ----------------------------------------- type Wide_Character_Mapping is private; pragma Preelaborable_Initialization (Wide_Character_Mapping); -- Representation for a wide character to wide character mapping: function Value (Map : Wide_Character_Mapping; Element : Wide_Character) return Wide_Character; Identity : constant Wide_Character_Mapping; --------------------------------- -- Operations on Wide Mappings -- --------------------------------- function To_Mapping (From, To : Wide_Character_Sequence) return Wide_Character_Mapping; function To_Domain (Map : Wide_Character_Mapping) return Wide_Character_Sequence; function To_Range (Map : Wide_Character_Mapping) return Wide_Character_Sequence; type Wide_Character_Mapping_Function is access function (From : Wide_Character) return Wide_Character; private package AF renames Ada.Finalization; ------------------------------------------ -- Representation of Wide_Character_Set -- ------------------------------------------ -- A wide character set is represented as a sequence of wide character -- ranges (i.e. an object of type Wide_Character_Ranges) in which the -- following hold: -- The lower bound is 1 -- The ranges are in order by increasing Low values -- The ranges are non-overlapping and discontigous -- A character value is in the set if it is contained in one of the -- ranges. The actual Wide_Character_Set value is a controlled pointer -- to this Wide_Character_Ranges value. The use of a controlled type -- is necessary to prevent storage leaks. type Wide_Character_Ranges_Access is access all Wide_Character_Ranges; type Wide_Character_Set is new AF.Controlled with record Set : Wide_Character_Ranges_Access; end record; pragma Finalize_Storage_Only (Wide_Character_Set); -- This avoids useless finalizations, and, more importantly avoids -- incorrect attempts to finalize constants that are statically -- declared here and in Ada.Strings.Wide_Maps, which is incorrect. procedure Initialize (Object : in out Wide_Character_Set); procedure Adjust (Object : in out Wide_Character_Set); procedure Finalize (Object : in out Wide_Character_Set); Null_Range : aliased constant Wide_Character_Ranges := (1 .. 0 => (Low => ' ', High => ' ')); Null_Set : constant Wide_Character_Set := (AF.Controlled with Set => Null_Range'Unrestricted_Access); ---------------------------------------------- -- Representation of Wide_Character_Mapping -- ---------------------------------------------- -- A wide character mapping is represented as two strings of equal -- length, where any character appearing in Domain is mapped to the -- corresponding character in Rangev. A character not appearing in -- Domain is mapped to itself. The characters in Domain are sorted -- in ascending order. -- The actual Wide_Character_Mapping value is a controlled record -- that contains a pointer to a discriminated record containing the -- range and domain values. -- Note: this representation is canonical, and the values stored in -- Domain and Rangev are exactly the values that are returned by the -- functions To_Domain and To_Range. The use of a controlled type is -- necessary to prevent storage leaks. type Wide_Character_Mapping_Values (Length : Natural) is record Domain : Wide_Character_Sequence (1 .. Length); Rangev : Wide_Character_Sequence (1 .. Length); end record; type Wide_Character_Mapping_Values_Access is access all Wide_Character_Mapping_Values; type Wide_Character_Mapping is new AF.Controlled with record Map : Wide_Character_Mapping_Values_Access; end record; pragma Finalize_Storage_Only (Wide_Character_Mapping); -- This avoids useless finalizations, and, more importantly avoids -- incorrect attempts to finalize constants that are statically -- declared here and in Ada.Strings.Wide_Maps, which is incorrect. procedure Initialize (Object : in out Wide_Character_Mapping); procedure Adjust (Object : in out Wide_Character_Mapping); procedure Finalize (Object : in out Wide_Character_Mapping); Null_Map : aliased constant Wide_Character_Mapping_Values := (Length => 0, Domain => "", Rangev => ""); Identity : constant Wide_Character_Mapping := (AF.Controlled with Map => Null_Map'Unrestricted_Access); end Ada.Strings.Wide_Maps;

38.967078

78

0.595417

0b6e87f23afd024cbed741d6343aad1f3f07a975

1,600

ads

Ada

src/css-core-errors-default.ads

stcarrez/ada-css

f7c337306094993186c507540701d04a4753b724

[ "Apache-2.0" ]

3

2017-01-03T22:18:22.000Z

2017-01-10T07:58:17.000Z

src/css-core-errors-default.ads

stcarrez/ada-css

f7c337306094993186c507540701d04a4753b724

[ "Apache-2.0" ]

null

src/css-core-errors-default.ads

stcarrez/ada-css

f7c337306094993186c507540701d04a4753b724

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- css-core-errors-default -- Error handler interface -- Copyright (C) 2017 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Ada.Text_IO; package CSS.Core.Errors.Default is type Error_Handler is limited new CSS.Core.Errors.Error_Handler with record File : Ada.Text_IO.File_Type; Error_Count : Natural := 0; Warning_Count : Natural := 0; end record; -- Report an error message at the given CSS source position. overriding procedure Error (Handler : in out Error_Handler; Loc : in Location; Message : in String); -- Report a warning message at the given CSS source position. overriding procedure Warning (Handler : in out Error_Handler; Loc : in Location; Message : in String); end CSS.Core.Errors.Default;

40

78

0.615

12ffd10dfc9489c040b9e55fc0488025b29d7705

16,673

adb

Ada

out/bigints.adb

Melyodas/metalang

399a9f1a71402c979d7f8024d4f98f081c80e771

[ "BSD-2-Clause" ]

22

2017-04-24T10:00:45.000Z

2021-04-01T10:11:05.000Z

out/bigints.adb

Melyodas/metalang

399a9f1a71402c979d7f8024d4f98f081c80e771

[ "BSD-2-Clause" ]

12

2017-03-26T18:34:21.000Z

2019-03-21T19:13:03.000Z

out/bigints.adb

Melyodas/metalang

399a9f1a71402c979d7f8024d4f98f081c80e771

[ "BSD-2-Clause" ]

7

2017-10-14T13:33:33.000Z

2021-03-18T15:18:50.000Z

with ada.text_io, ada.Integer_text_IO, Ada.Text_IO.Text_Streams, Ada.Strings.Fixed, Interfaces.C; use ada.text_io, ada.Integer_text_IO, Ada.Strings, Ada.Strings.Fixed, Interfaces.C; procedure bigints is type stringptr is access all char_array; procedure PString(s : stringptr) is begin String'Write (Text_Streams.Stream (Current_Output), To_Ada(s.all)); end; procedure PChar(c : in Character) is begin Character'Write (Text_Streams.Stream (Current_Output), c); end; procedure PInt(i : in Integer) is begin String'Write (Text_Streams.Stream (Current_Output), Trim(Integer'Image(i), Left)); end; procedure SkipSpaces is C : Character; Eol : Boolean; begin loop Look_Ahead(C, Eol); exit when Eol or C /= ' '; Get(C); end loop; end; function max2_0(a : in Integer; b : in Integer) return Integer is begin if a > b then return a; else return b; end if; end; function min2_0(a : in Integer; b : in Integer) return Integer is begin if a ) of Integer; type r_PTR is access r; type bigint is record bigint_sign : Boolean; bigint_len : Integer; bigint_chiffres : r_PTR; end record; function read_bigint(len : in Integer) return bigint_PTR is tmp : Integer; e : bigint_PTR; chiffres : r_PTR; c : Character; begin chiffres := new r (0..len - 1); for j in integer range 0..len - 1 loop Get(c); chiffres(j) := Character'Pos(c); end loop; for i in integer range 0..(len - 1) / 2 loop tmp := chiffres(i); chiffres(i) := chiffres(len - 1 - i); chiffres(len - 1 - i) := tmp; end loop; e := new bigint; e.bigint_sign := TRUE; e.bigint_len := len; e.bigint_chiffres := chiffres; return e; end; procedure print_bigint(a : in bigint_PTR) is begin if not a.bigint_sign then PChar('-'); end if; for i in integer range 0..a.bigint_len - 1 loop PInt(a.bigint_chiffres(a.bigint_len - 1 - i)); end loop; end; function bigint_eq(a : in bigint_PTR; b : in bigint_PTR) return Boolean is begin -- Renvoie vrai si a = b if a.bigint_sign /= b.bigint_sign then return FALSE; else if a.bigint_len /= b.bigint_len then return FALSE; else for i in integer range 0..a.bigint_len - 1 loop if a.bigint_chiffres(i) /= b.bigint_chiffres(i) then return FALSE; end if; end loop; return TRUE; end if; end if; end; function bigint_gt(a : in bigint_PTR; b : in bigint_PTR) return Boolean is j : Integer; begin -- Renvoie vrai si a > b if a.bigint_sign and then not b.bigint_sign then return TRUE; else if not a.bigint_sign and then b.bigint_sign then return FALSE; else if a.bigint_len > b.bigint_len then return a.bigint_sign; else if a.bigint_len < b.bigint_len then return not a.bigint_sign; else for i in integer range 0..a.bigint_len - 1 loop j := a.bigint_len - 1 - i; if a.bigint_chiffres(j) > b.bigint_chiffres(j) then return a.bigint_sign; else if a.bigint_chiffres(j) < b.bigint_chiffres(j) then return not a.bigint_sign; end if; end if; end loop; end if; end if; return TRUE; end if; end if; end; function bigint_lt(a : in bigint_PTR; b : in bigint_PTR) return Boolean is begin return not bigint_gt(a, b); end; function add_bigint_positif(a : in bigint_PTR; b : in bigint_PTR) return bigint_PTR is tmp : Integer; retenue : Integer; len : Integer; f : bigint_PTR; chiffres : r_PTR; begin -- Une addition ou on en a rien a faire des signes len := max2_0(a.bigint_len, b.bigint_len) + 1; retenue := 0; chiffres := new r (0..len - 1); for i in integer range 0..len - 1 loop tmp := retenue; if i < a.bigint_len then tmp := tmp + a.bigint_chiffres(i); end if; if i < b.bigint_len then tmp := tmp + b.bigint_chiffres(i); end if; retenue := tmp / 10; chiffres(i) := tmp rem 10; end loop; while len > 0 and then chiffres(len - 1) = 0 loop len := len - 1; end loop; f := new bigint; f.bigint_sign := TRUE; f.bigint_len := len; f.bigint_chiffres := chiffres; return f; end; function sub_bigint_positif(a : in bigint_PTR; b : in bigint_PTR) return bigint_PTR is tmp : Integer; retenue : Integer; len : Integer; g : bigint_PTR; chiffres : r_PTR; begin -- Une soustraction ou on en a rien a faire des signes --Pré-requis : a > b -- len := a.bigint_len; retenue := 0; chiffres := new r (0..len - 1); for i in integer range 0..len - 1 loop tmp := retenue + a.bigint_chiffres(i); if i < b.bigint_len then tmp := tmp - b.bigint_chiffres(i); end if; if tmp < 0 then tmp := tmp + 10; retenue := (-1); else retenue := 0; end if; chiffres(i) := tmp; end loop; while len > 0 and then chiffres(len - 1) = 0 loop len := len - 1; end loop; g := new bigint; g.bigint_sign := TRUE; g.bigint_len := len; g.bigint_chiffres := chiffres; return g; end; function neg_bigint(a : in bigint_PTR) return bigint_PTR is h : bigint_PTR; begin h := new bigint; h.bigint_sign := not a.bigint_sign; h.bigint_len := a.bigint_len; h.bigint_chiffres := a.bigint_chiffres; return h; end; function add_bigint(a : in bigint_PTR; b : in bigint_PTR) return bigint_PTR is begin if a.bigint_sign = b.bigint_sign then if a.bigint_sign then return add_bigint_positif(a, b); else return neg_bigint(add_bigint_positif(a, b)); end if; else if a.bigint_sign then -- a positif, b negatif if bigint_gt(a, neg_bigint(b)) then return sub_bigint_positif(a, b); else return neg_bigint(sub_bigint_positif(b, a)); end if; else -- a negatif, b positif if bigint_gt(neg_bigint(a), b) then return neg_bigint(sub_bigint_positif(a, b)); else return sub_bigint_positif(b, a); end if; end if; end if; end; function sub_bigint(a : in bigint_PTR; b : in bigint_PTR) return bigint_PTR is begin return add_bigint(a, neg_bigint(b)); end; function mul_bigint_cp(a : in bigint_PTR; b : in bigint_PTR) return bigint_PTR is retenue : Integer; m : bigint_PTR; len : Integer; chiffres : r_PTR; begin -- Cet algorithm est quadratique. --C'est le même que celui qu'on enseigne aux enfants en CP. --D'ou le nom de la fonction. len := a.bigint_len + b.bigint_len + 1; chiffres := new r (0..len - 1); for k in integer range 0..len - 1 loop chiffres(k) := 0; end loop; for i in integer range 0..a.bigint_len - 1 loop retenue := 0; for j in integer range 0..b.bigint_len - 1 loop chiffres(i + j) := chiffres(i + j) + retenue + b.bigint_chiffres(j) * a.bigint_chiffres(i); retenue := chiffres(i + j) / 10; chiffres(i + j) := chiffres(i + j) rem 10; end loop; chiffres(i + b.bigint_len) := chiffres(i + b.bigint_len) + retenue; end loop; chiffres(a.bigint_len + b.bigint_len) := chiffres(a.bigint_len + b.bigint_len - 1) / 10; chiffres(a.bigint_len + b.bigint_len - 1) := chiffres(a.bigint_len + b.bigint_len - 1) rem 10; for l in integer range 0..2 loop if len /= 0 and then chiffres(len - 1) = 0 then len := len - 1; end if; end loop; m := new bigint; m.bigint_sign := a.bigint_sign = b.bigint_sign; m.bigint_len := len; m.bigint_chiffres := chiffres; return m; end; function bigint_premiers_chiffres(a : in bigint_PTR; i : in Integer) return bigint_PTR is o : bigint_PTR; len : Integer; begin len := min2_0(i, a.bigint_len); while len /= 0 and then a.bigint_chiffres(len - 1) = 0 loop len := len - 1; end loop; o := new bigint; o.bigint_sign := a.bigint_sign; o.bigint_len := len; o.bigint_chiffres := a.bigint_chiffres; return o; end; function bigint_shift(a : in bigint_PTR; i : in Integer) return bigint_PTR is p : bigint_PTR; chiffres : r_PTR; begin chiffres := new r (0..a.bigint_len + i - 1); for k in integer range 0..a.bigint_len + i - 1 loop if k >= i then chiffres(k) := a.bigint_chiffres(k - i); else chiffres(k) := 0; end if; end loop; p := new bigint; p.bigint_sign := a.bigint_sign; p.bigint_len := a.bigint_len + i; p.bigint_chiffres := chiffres; return p; end; function mul_bigint(aa : in bigint_PTR; bb : in bigint_PTR) return bigint_PTR is split : Integer; d : bigint_PTR; cmoinsd : bigint_PTR; c : bigint_PTR; bd : bigint_PTR; b : bigint_PTR; amoinsbcmoinsd : bigint_PTR; amoinsb : bigint_PTR; acdec : bigint_PTR; ac : bigint_PTR; a : bigint_PTR; begin if aa.bigint_len = 0 then return aa; else if bb.bigint_len = 0 then return bb; else if aa.bigint_len < 3 or else bb.bigint_len < 3 then return mul_bigint_cp(aa, bb); end if; end if; end if; -- Algorithme de Karatsuba split := min2_0(aa.bigint_len, bb.bigint_len) / 2; a := bigint_shift(aa, (-split)); b := bigint_premiers_chiffres(aa, split); c := bigint_shift(bb, (-split)); d := bigint_premiers_chiffres(bb, split); amoinsb := sub_bigint(a, b); cmoinsd := sub_bigint(c, d); ac := mul_bigint(a, c); bd := mul_bigint(b, d); amoinsbcmoinsd := mul_bigint(amoinsb, cmoinsd); acdec := bigint_shift(ac, 2 * split); return add_bigint(add_bigint(acdec, bd), bigint_shift(sub_bigint(add_bigint(ac, bd), amoinsbcmoinsd), split)); -- ac × 102k + (ac + bd – (a – b)(c – d)) × 10k + bd end; -- --Division, --Modulo -- function log10(s : in Integer) return Integer is out0 : Integer; a : Integer; begin a := s; out0 := 1; while a >= 10 loop a := a / 10; out0 := out0 + 1; end loop; return out0; end; function bigint_of_int(u : in Integer) return bigint_PTR is t : r_PTR; size : Integer; q : bigint_PTR; i : Integer; begin i := u; size := log10(i); if i = 0 then size := 0; end if; t := new r (0..size - 1); for j in integer range 0..size - 1 loop t(j) := 0; end loop; for k in integer range 0..size - 1 loop t(k) := i rem 10; i := i / 10; end loop; q := new bigint; q.bigint_sign := TRUE; q.bigint_len := size; q.bigint_chiffres := t; return q; end; function fact_bigint(v : in bigint_PTR) return bigint_PTR is out0 : bigint_PTR; one : bigint_PTR; a : bigint_PTR; begin a := v; one := bigint_of_int(1); out0 := one; while not bigint_eq(a, one) loop out0 := mul_bigint(a, out0); a := sub_bigint(a, one); end loop; return out0; end; function sum_chiffres_bigint(a : in bigint_PTR) return Integer is out0 : Integer; begin out0 := 0; for i in integer range 0..a.bigint_len - 1 loop out0 := out0 + a.bigint_chiffres(i); end loop; return out0; end; -- http://projecteuler.net/problem=20 function euler20 return Integer is a : bigint_PTR; begin a := bigint_of_int(15); -- normalement c'est 100 a := fact_bigint(a); return sum_chiffres_bigint(a); end; function bigint_exp(a : in bigint_PTR; b : in Integer) return bigint_PTR is begin if b = 1 then return a; else if b rem 2 = 0 then return bigint_exp(mul_bigint(a, a), b / 2); else return mul_bigint(a, bigint_exp(a, b - 1)); end if; end if; end; function bigint_exp_10chiffres(w : in bigint_PTR; b : in Integer) return bigint_PTR is a : bigint_PTR; begin a := w; a := bigint_premiers_chiffres(a, 10); if b = 1 then return a; else if b rem 2 = 0 then return bigint_exp_10chiffres(mul_bigint(a, a), b / 2); else return mul_bigint(a, bigint_exp_10chiffres(a, b - 1)); end if; end if; end; procedure euler48 is sum : bigint_PTR; ibeib : bigint_PTR; ib : bigint_PTR; begin sum := bigint_of_int(0); for i in integer range 1..100 loop -- 1000 normalement ib := bigint_of_int(i); ibeib := bigint_exp_10chiffres(ib, i); sum := add_bigint(sum, ibeib); sum := bigint_premiers_chiffres(sum, 10); end loop; PString(new char_array'( To_C("euler 48 = "))); print_bigint(sum); PString(new char_array'( To_C("" & Character'Val(10)))); end; function euler16 return Integer is a : bigint_PTR; begin a := bigint_of_int(2); a := bigint_exp(a, 100); -- 1000 normalement return sum_chiffres_bigint(a); end; function euler25 return Integer is i : Integer; c : bigint_PTR; b : bigint_PTR; a : bigint_PTR; begin i := 2; a := bigint_of_int(1); b := bigint_of_int(1); while b.bigint_len < 100 loop -- 1000 normalement c := add_bigint(a, b); a := b; b := c; i := i + 1; end loop; return i; end; type x is Array (Integer range <>) of bigint_PTR; type x_PTR is access x; function euler29 return Integer is n : Integer; min0 : bigint_PTR; maxB : Integer; maxA : Integer; found : Boolean; b : r_PTR; a_bigint : x_PTR; a0_bigint : x_PTR; begin maxA := 5; maxB := 5; a_bigint := new x (0..maxA); for j in integer range 0..maxA loop a_bigint(j) := bigint_of_int(j * j); end loop; a0_bigint := new x (0..maxA); for j2 in integer range 0..maxA loop a0_bigint(j2) := bigint_of_int(j2); end loop; b := new r (0..maxA); for k in integer range 0..maxA loop b(k) := 2; end loop; n := 0; found := TRUE; while found loop min0 := a0_bigint(0); found := FALSE; for i in integer range 2..maxA loop if b(i) <= maxB then if found then if bigint_lt(a_bigint(i), min0) then min0 := a_bigint(i); end if; else min0 := a_bigint(i); found := TRUE; end if; end if; end loop; if found then n := n + 1; for l in integer range 2..maxA loop if bigint_eq(a_bigint(l), min0) and then b(l) <= maxB then b(l) := b(l) + 1; a_bigint(l) := mul_bigint(a_bigint(l), a0_bigint(l)); end if; end loop; end if; end loop; return n; end; tmp : bigint_PTR; sum : bigint_PTR; b : bigint_PTR; a : bigint_PTR; begin PInt(euler29); PString(new char_array'( To_C("" & Character'Val(10)))); sum := read_bigint(50); for i in integer range 2..100 loop SkipSpaces; tmp := read_bigint(50); sum := add_bigint(sum, tmp); end loop; PString(new char_array'( To_C("euler13 = "))); print_bigint(sum); PString(new char_array'( To_C("" & Character'Val(10) & "euler25 = "))); PInt(euler25); PString(new char_array'( To_C("" & Character'Val(10) & "euler16 = "))); PInt(euler16); PString(new char_array'( To_C("" & Character'Val(10)))); euler48; PString(new char_array'( To_C("euler20 = "))); PInt(euler20); PString(new char_array'( To_C("" & Character'Val(10)))); a := bigint_of_int(999999); b := bigint_of_int(9951263); print_bigint(a); PString(new char_array'( To_C(">>1="))); print_bigint(bigint_shift(a, (-1))); PString(new char_array'( To_C("" & Character'Val(10)))); print_bigint(a); PString(new char_array'( To_C("*"))); print_bigint(b); PString(new char_array'( To_C("="))); print_bigint(mul_bigint(a, b)); PString(new char_array'( To_C("" & Character'Val(10)))); print_bigint(a); PString(new char_array'( To_C("*"))); print_bigint(b); PString(new char_array'( To_C("="))); print_bigint(mul_bigint_cp(a, b)); PString(new char_array'( To_C("" & Character'Val(10)))); print_bigint(a); PString(new char_array'( To_C("+"))); print_bigint(b); PString(new char_array'( To_C("="))); print_bigint(add_bigint(a, b)); PString(new char_array'( To_C("" & Character'Val(10)))); print_bigint(b); PString(new char_array'( To_C("-"))); print_bigint(a); PString(new char_array'( To_C("="))); print_bigint(sub_bigint(b, a)); PString(new char_array'( To_C("" & Character'Val(10)))); print_bigint(a); PString(new char_array'( To_C("-"))); print_bigint(b); PString(new char_array'( To_C("="))); print_bigint(sub_bigint(a, b)); PString(new char_array'( To_C("" & Character'Val(10)))); print_bigint(a); PString(new char_array'( To_C(">"))); print_bigint(b); PString(new char_array'( To_C("="))); if bigint_gt(a, b) then PString(new char_array'( To_C("True"))); else PString(new char_array'( To_C("False"))); end if; PString(new char_array'( To_C("" & Character'Val(10)))); end;

24.664201

112

0.622264

06f24f5aad1dc4c4b643fce35ac7ece1aaec2a51

2,518

ads

Ada

orka_egl/src/egl-objects-devices.ads

onox/orka

9edf99559a16ffa96dfdb208322f4d18efbcbac6

[ "Apache-2.0" ]

52

2016-07-30T23:00:28.000Z

2022-02-05T11:54:55.000Z

orka_egl/src/egl-objects-devices.ads

onox/orka

9edf99559a16ffa96dfdb208322f4d18efbcbac6

[ "Apache-2.0" ]

79

2016-08-01T18:36:48.000Z

2022-02-27T12:14:20.000Z

orka_egl/src/egl-objects-devices.ads

onox/orka

9edf99559a16ffa96dfdb208322f4d18efbcbac6

[ "Apache-2.0" ]

4

2018-04-28T22:36:26.000Z

2020-11-14T23:00:29.000Z

-- SPDX-License-Identifier: Apache-2.0 -- -- Copyright (c) 2020 onox <[email protected]> -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. limited with EGL.Objects.Displays; package EGL.Objects.Devices is pragma Preelaborate; type Device is new EGL_Object with private; function Extensions (Object : Device) return String_List; -- Return a list of EGL device extensions -- -- Requires EGL_EXT_device_query extension function Name (Object : Device) return String; -- Return the name of a device, or empty string if device has -- no name -- -- Requires EGL_EXT_device_drm extension for DRM devices. function In_Use (Object : Device) return Boolean; -- Return True if the device was retrieved from a display, False otherwise No_Device : constant Device; type Device_List is array (Natural range <>) of aliased Device; function Devices return Device_List; -- Return a list of devices -- -- Requires EGL_EXT_device_enumeration extension function Get_Device (Subject : Displays.Display) return Device with Post => Get_Device'Result.In_Use; -- Return the device of a display -- -- Requires EGL_EXT_device_query extension. private type Fake_Display is new EGL_Object with null record; -- Contains the Reference of a real Display when a Device is -- retrieved via function Get_Device No_Display : constant Fake_Display := (EGL_Object with null record); type Device is new EGL_Object with record Display : Fake_Display := No_Display; -- Since a device is a property of a display, the display must -- not get finalized while the device is still allocated. Otherwise -- any further use will give undefined results. -- -- See EGL_EXT_device_query extension. end record; No_Device : constant Device := (EGL_Object with Display => <>); function In_Use (Object : Device) return Boolean is (Object.Display /= No_Display); end EGL.Objects.Devices;

33.573333

86

0.716442

10bcbf9a91f08e18ad2f6a36edd79cba6b91163a

8,517

adb

Ada

src/ncurses-5.5/Ada95/src/terminal_interface-curses-mouse.adb

erwinchang/minicom

3fe2ba7d8e8475c199b493a2b99cd3c690f6ea4f

[ "MIT" ]

null

src/ncurses-5.5/Ada95/src/terminal_interface-curses-mouse.adb

erwinchang/minicom

3fe2ba7d8e8475c199b493a2b99cd3c690f6ea4f

[ "MIT" ]

null

src/ncurses-5.5/Ada95/src/terminal_interface-curses-mouse.adb

erwinchang/minicom

3fe2ba7d8e8475c199b493a2b99cd3c690f6ea4f

[ "MIT" ]

3

2016-06-13T13:20:56.000Z

2019-12-05T02:31:23.000Z

------------------------------------------------------------------------------ -- -- -- GNAT ncurses Binding -- -- -- -- Terminal_Interface.Curses.Mouse -- -- -- -- B O D Y -- -- -- ------------------------------------------------------------------------------ -- Copyright (c) 1998,2004 Free Software Foundation, Inc. -- -- -- -- Permission is hereby granted, free of charge, to any person obtaining a -- -- copy of this software and associated documentation files (the -- -- "Software"), to deal in the Software without restriction, including -- -- without limitation the rights to use, copy, modify, merge, publish, -- -- distribute, distribute with modifications, sublicense, and/or sell -- -- copies of the Software, and to permit persons to whom the Software is -- -- furnished to do so, subject to the following conditions: -- -- -- -- The above copyright notice and this permission notice shall be included -- -- in all copies or substantial portions of the Software. -- -- -- -- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -- -- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -- -- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. -- -- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -- -- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -- -- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR -- -- THE USE OR OTHER DEALINGS IN THE SOFTWARE. -- -- -- -- Except as contained in this notice, the name(s) of the above copyright -- -- holders shall not be used in advertising or otherwise to promote the -- -- sale, use or other dealings in this Software without prior written -- -- authorization. -- ------------------------------------------------------------------------------ -- Author: Juergen Pfeifer, 1996 -- Version Control: -- $Revision: 1.21 $ -- $Date: 2004/08/21 21:37:00 $ -- Binding Version 01.00 ------------------------------------------------------------------------------ with System; with Terminal_Interface.Curses.Aux; use Terminal_Interface.Curses.Aux; with Interfaces.C; use Interfaces.C; use Interfaces; package body Terminal_Interface.Curses.Mouse is use type System.Bit_Order; use type Interfaces.C.int; function Has_Mouse return Boolean is function Mouse_Avail return C_Int; pragma Import (C, Mouse_Avail, "_nc_has_mouse"); begin if Has_Key (Key_Mouse) or else Mouse_Avail /= 0 then return True; else return False; end if; end Has_Mouse; function Get_Mouse return Mouse_Event is type Event_Access is access all Mouse_Event; function Getmouse (Ev : Event_Access) return C_Int; pragma Import (C, Getmouse, "getmouse"); Event : aliased Mouse_Event; begin if Getmouse (Event'Access) = Curses_Err then raise Curses_Exception; end if; return Event; end Get_Mouse; procedure Register_Reportable_Event (Button : in Mouse_Button; State : in Button_State; Mask : in out Event_Mask) is Button_Nr : constant Natural := Mouse_Button'Pos (Button); State_Nr : constant Natural := Button_State'Pos (State); begin if Button in Modifier_Keys and then State /= Pressed then raise Curses_Exception; else if Button in Real_Buttons then Mask := Mask or ((2 ** (6 * Button_Nr)) ** State_Nr); else Mask := Mask or (BUTTON_CTRL ** (Button_Nr - 4)); end if; end if; end Register_Reportable_Event; procedure Register_Reportable_Events (Button : in Mouse_Button; State : in Button_States; Mask : in out Event_Mask) is begin for S in Button_States'Range loop if State (S) then Register_Reportable_Event (Button, S, Mask); end if; end loop; end Register_Reportable_Events; function Start_Mouse (Mask : Event_Mask := All_Events) return Event_Mask is function MMask (M : Event_Mask; O : access Event_Mask) return Event_Mask; pragma Import (C, MMask, "mousemask"); R : Event_Mask; Old : aliased Event_Mask; begin R := MMask (Mask, Old'Access); if R = No_Events then Beep; end if; return Old; end Start_Mouse; procedure End_Mouse (Mask : in Event_Mask := No_Events) is begin if Mask /= No_Events then Beep; end if; end End_Mouse; procedure Dispatch_Event (Mask : in Event_Mask; Button : out Mouse_Button; State : out Button_State); procedure Dispatch_Event (Mask : in Event_Mask; Button : out Mouse_Button; State : out Button_State) is L : Event_Mask; begin Button := Alt; -- preset to non real button; if (Mask and BUTTON1_EVENTS) /= 0 then Button := Left; elsif (Mask and BUTTON2_EVENTS) /= 0 then Button := Middle; elsif (Mask and BUTTON3_EVENTS) /= 0 then Button := Right; elsif (Mask and BUTTON4_EVENTS) /= 0 then Button := Button4; end if; if Button in Real_Buttons then L := 2 ** (6 * Mouse_Button'Pos (Button)); for I in Button_State'Range loop if (Mask and L) /= 0 then State := I; exit; end if; L := 2 * L; end loop; else State := Pressed; if (Mask and BUTTON_CTRL) /= 0 then Button := Control; elsif (Mask and BUTTON_SHIFT) /= 0 then Button := Shift; elsif (Mask and BUTTON_ALT) /= 0 then Button := Alt; end if; end if; end Dispatch_Event; procedure Get_Event (Event : in Mouse_Event; Y : out Line_Position; X : out Column_Position; Button : out Mouse_Button; State : out Button_State) is Mask : constant Event_Mask := Event.Bstate; begin X := Column_Position (Event.X); Y := Line_Position (Event.Y); Dispatch_Event (Mask, Button, State); end Get_Event; procedure Unget_Mouse (Event : in Mouse_Event) is function Ungetmouse (Ev : Mouse_Event) return C_Int; pragma Import (C, Ungetmouse, "ungetmouse"); begin if Ungetmouse (Event) = Curses_Err then raise Curses_Exception; end if; end Unget_Mouse; function Enclosed_In_Window (Win : Window := Standard_Window; Event : Mouse_Event) return Boolean is function Wenclose (Win : Window; Y : C_Int; X : C_Int) return Curses_Bool; pragma Import (C, Wenclose, "wenclose"); begin if Wenclose (Win, C_Int (Event.Y), C_Int (Event.X)) = Curses_Bool_False then return False; else return True; end if; end Enclosed_In_Window; function Mouse_Interval (Msec : Natural := 200) return Natural is function Mouseinterval (Msec : C_Int) return C_Int; pragma Import (C, Mouseinterval, "mouseinterval"); begin return Natural (Mouseinterval (C_Int (Msec))); end Mouse_Interval; end Terminal_Interface.Curses.Mouse;

38.538462

78

0.512857

12f3660941d4ebe7177942e9dee4ace4360dfdc8

211

adb

Ada

src/test/resources/ada-sources/bad-syntax.adb

georgemackayshore/Ada-IntelliJ

581f87237a610b3142aed20358b955bdca807213

[ "Apache-2.0" ]

17

2018-10-03T21:31:03.000Z

2021-01-22T04:16:05.000Z

src/test/resources/ada-sources/bad-syntax.adb

georgemackayshore/Ada-IntelliJ

581f87237a610b3142aed20358b955bdca807213

[ "Apache-2.0" ]

20

2018-11-01T21:17:09.000Z

2021-10-01T18:57:20.000Z

src/test/resources/ada-sources/bad-syntax.adb

georgemackayshore/Ada-IntelliJ

581f87237a610b3142aed20358b955bdca807213

[ "Apache-2.0" ]

4

2020-04-14T15:02:37.000Z

2022-03-10T20:35:54.000Z

-- Numeric Literals 123__456 12345678_ 123. 123.456.789 1E+ 1234e56.7 16# 12#14 10#5. 8#2.3 6## 4#123.1.2# 2#101.# 16#123G#2 -- Textual Literals ' '' ' ' 'ab' " """ -- Non-Alphabet Characters Put_Line["oops"]

7.814815

26

0.635071

4dbcd3d0bb7adfd096ba6de2c48a86cd07ec64f6

15,006

ads

Ada

sources/webgl/opengl-programs.ads

godunko/adagl

5b62d3bac6aa4e11084b4b19171dadbf805e95d6

[ "BSD-3-Clause" ]

6

2018-01-18T16:57:21.000Z

2020-01-19T07:40:12.000Z

sources/webgl/opengl-programs.ads

godunko/adagl

5b62d3bac6aa4e11084b4b19171dadbf805e95d6

[ "BSD-3-Clause" ]

null

sources/webgl/opengl-programs.ads

godunko/adagl

5b62d3bac6aa4e11084b4b19171dadbf805e95d6

[ "BSD-3-Clause" ]

1

2018-01-20T16:12:26.000Z

------------------------------------------------------------------------------ -- -- -- Ada binding for OpenGL/WebGL -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2016-2018, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ with System.Storage_Elements; with League.Strings; private with WebAPI.WebGL.Programs; private with WebAPI.WebGL.Rendering_Contexts; with OpenGL.Shaders; package OpenGL.Programs is pragma Preelaborate; type OpenGL_Program is tagged limited private; type OpenGL_Program_Access is access all OpenGL_Program'Class; function Add_Shader_From_Source_Code (Self : in out OpenGL_Program'Class; Shader_Type : OpenGL.Shader_Type; Source : League.Strings.Universal_String) return Boolean; -- Compiles source as a shader of the specified type and adds it to this -- shader program. Returns True if compilation was successful, False -- otherwise. The compilation errors and warnings will be made available -- via Log. procedure Add_Shader_From_Source_Code (Self : in out OpenGL_Program'Class; Shader_Type : OpenGL.Shader_Type; Source : League.Strings.Universal_String); -- Compiles source as a shader of the specified type and adds it to this -- shader program. Raise Program_Error if compilation was not successful. -- The compilation errors and warnings will be made available via Log. function Attribute_Location (Self : in out OpenGL_Program'Class; Name : League.Strings.Universal_String) return OpenGL.Attribute_Location; -- Returns the location of the attribute Name within this shader program's -- parameter list. Returns -1 if name is not a valid attribute for this -- shader program. function Bind (Self : in out OpenGL_Program'Class) return Boolean; -- Binds this shader program to the active OpenGL_Context and makes it the -- current shader program. Any previously bound shader program is released. -- This is equivalent to calling glUseProgram(). procedure Bind (Self : in out OpenGL_Program'Class); -- Binds this shader program to the active OpenGL_Context and makes it the -- current shader program. Any previously bound shader program is released. -- This is equivalent to calling glUseProgram(). function Create (Self : in out OpenGL_Program'Class) return Boolean; -- Requests the shader program's id to be created immediately. Returns true -- if successful; false otherwise. procedure Disable_Attribute_Array (Self : in out OpenGL_Program'Class; Location : OpenGL.Attribute_Location); -- Disables the vertex array at Location in this shader program that was -- enabled by a previous call to Enable_Attribute_Array. procedure Disable_Attribute_Array (Self : in out OpenGL_Program'Class; Name : League.Strings.Universal_String); -- Disables the vertex array called name in this shader program that was -- enabled by a previous call to Enable_Attribute_Array. procedure Enable_Attribute_Array (Self : in out OpenGL_Program'Class; Location : OpenGL.Attribute_Location); -- Enables the vertex array at Location in this shader program so that the -- value set by Set_Attribute_Array on Location will be used by the shader -- program. procedure Enable_Attribute_Array (Self : in out OpenGL_Program'Class; Name : League.Strings.Universal_String); -- Enables the vertex array called Name in this shader program so that the -- value set by Set_Attribute_Array on Name will be used by the shader -- program. function Is_Linked (Self : OpenGL_Program'Class) return Boolean; -- Returns true if this shader program has been linked; false otherwise. not overriding function Link (Self : in out OpenGL_Program) return Boolean; -- Links together the shaders that were added to this program with -- Add_Shader. Returns True if the link was successful or False otherwise. -- If the link failed, the error messages can be retrieved with Log. procedure Release (Self : OpenGL_Program'Class); -- Releases the active shader program from the current OpenGL_Context. This -- is equivalent to calling glUseProgram(0). procedure Set_Attribute_Buffer (Self : in out OpenGL_Program'Class; Location : OpenGL.Attribute_Location; Data_Type : OpenGL.GLenum; Tuple_Size : Positive; Offset : System.Storage_Elements.Storage_Count := 0; Stride : System.Storage_Elements.Storage_Count := 0; Normalized : Boolean := True); -- Sets an array of vertex values on the attribute at Location in this -- shader program, starting at a specific Offset in the currently bound -- vertex buffer. The Stride indicates the number of bytes between -- vertices. A default Stride value of zero indicates that the vertices are -- densely packed in the value array. -- -- The Data_Type indicates the type of elements in the vertex value array, -- usually GL_FLOAT, GL_UNSIGNED_BYTE, etc. The Tuple_Size indicates the -- number of components per vertex: 1, 2, 3, or 4. -- -- The array will become active when Enable_Attribute_Array is called on -- the Location. Otherwise the value specified with Set_Attribute_Value for -- Location will be used. procedure Set_Attribute_Buffer (Self : in out OpenGL_Program'Class; Name : League.Strings.Universal_String; Data_Type : OpenGL.GLenum; Tuple_Size : Positive; Offset : System.Storage_Elements.Storage_Count := 0; Stride : System.Storage_Elements.Storage_Count := 0; Normalized : Boolean := True); -- Sets an array of vertex values on the attribute called Name in this -- shader program, starting at a specific Offset in the currently bound -- vertex buffer. The Stride indicates the number of bytes between -- vertices. A default stride value of zero indicates that the vertices are -- densely packed in the value array. -- -- The Data_Type indicates the type of elements in the vertex value array, -- usually GL_FLOAT, GL_UNSIGNED_BYTE, etc. The Tuple_Size indicates the -- number of components per vertex: 1, 2, 3, or 4. -- -- The array will become active when Enable_Attribute_Array is called on -- the Name. Otherwise the value specified with Set_Attribute_Value for -- Name will be used. procedure Set_Attribute_Value (Self : in out OpenGL_Program'Class; Location : OpenGL.Attribute_Location; Value : OpenGL.GLfloat); procedure Set_Attribute_Value (Self : in out OpenGL_Program'Class; Location : OpenGL.Attribute_Location; Value : OpenGL.GLfloat_Vector_2); procedure Set_Attribute_Value (Self : in out OpenGL_Program'Class; Location : OpenGL.Attribute_Location; Value : OpenGL.GLfloat_Vector_3); procedure Set_Attribute_Value (Self : in out OpenGL_Program'Class; Location : OpenGL.Attribute_Location; Value : OpenGL.GLfloat_Vector_4); procedure Set_Attribute_Value (Self : in out OpenGL_Program'Class; Location : OpenGL.Attribute_Location; Value : OpenGL.GLfloat_Matrix_2x2); procedure Set_Attribute_Value (Self : in out OpenGL_Program'Class; Location : OpenGL.Attribute_Location; Value : OpenGL.GLfloat_Matrix_3x3); procedure Set_Attribute_Value (Self : in out OpenGL_Program'Class; Location : OpenGL.Attribute_Location; Value : OpenGL.GLfloat_Matrix_4x4); -- Sets the attribute at Location in the current context to Value. procedure Set_Attribute_Value (Self : in out OpenGL_Program'Class; Name : League.Strings.Universal_String; Value : OpenGL.GLfloat); procedure Set_Attribute_Value (Self : in out OpenGL_Program'Class; Name : League.Strings.Universal_String; Value : OpenGL.GLfloat_Vector_2); procedure Set_Attribute_Value (Self : in out OpenGL_Program'Class; Name : League.Strings.Universal_String; Value : OpenGL.GLfloat_Vector_3); procedure Set_Attribute_Value (Self : in out OpenGL_Program'Class; Name : League.Strings.Universal_String; Value : OpenGL.GLfloat_Vector_4); procedure Set_Attribute_Value (Self : in out OpenGL_Program'Class; Name : League.Strings.Universal_String; Value : OpenGL.GLfloat_Matrix_2x2); procedure Set_Attribute_Value (Self : in out OpenGL_Program'Class; Name : League.Strings.Universal_String; Value : OpenGL.GLfloat_Matrix_3x3); procedure Set_Attribute_Value (Self : in out OpenGL_Program'Class; Name : League.Strings.Universal_String; Value : OpenGL.GLfloat_Matrix_4x4); -- Sets the attribute called Name in the current context to Value. procedure Set_Uniform_Value (Self : in out OpenGL_Program'Class; Location : OpenGL.Uniform_Location; Value : OpenGL.GLint); procedure Set_Uniform_Value (Self : in out OpenGL_Program'Class; Location : OpenGL.Uniform_Location; Value : OpenGL.Glfloat); procedure Set_Uniform_Value (Self : in out OpenGL_Program'Class; Location : OpenGL.Uniform_Location; Value : OpenGL.Glfloat_Vector_2); procedure Set_Uniform_Value (Self : in out OpenGL_Program'Class; Location : OpenGL.Uniform_Location; Value : OpenGL.Glfloat_Vector_3); procedure Set_Uniform_Value (Self : in out OpenGL_Program'Class; Location : OpenGL.Uniform_Location; Value : OpenGL.Glfloat_Vector_4); procedure Set_Uniform_Value (Self : in out OpenGL_Program'Class; Location : OpenGL.Uniform_Location; Value : OpenGL.Glfloat_Matrix_2x2); procedure Set_Uniform_Value (Self : in out OpenGL_Program'Class; Location : OpenGL.Uniform_Location; Value : OpenGL.Glfloat_Matrix_3x3); procedure Set_Uniform_Value (Self : in out OpenGL_Program'Class; Location : OpenGL.Uniform_Location; Value : OpenGL.Glfloat_Matrix_4x4); -- Sets the uniform variable at Location in the current context to Value. procedure Set_Uniform_Value (Self : in out OpenGL_Program'Class; Name : League.Strings.Universal_String; Value : OpenGL.GLint); procedure Set_Uniform_Value (Self : in out OpenGL_Program'Class; Name : League.Strings.Universal_String; Value : OpenGL.Glfloat); procedure Set_Uniform_Value (Self : in out OpenGL_Program'Class; Name : League.Strings.Universal_String; Value : OpenGL.Glfloat_Vector_2); procedure Set_Uniform_Value (Self : in out OpenGL_Program'Class; Name : League.Strings.Universal_String; Value : OpenGL.Glfloat_Vector_3); procedure Set_Uniform_Value (Self : in out OpenGL_Program'Class; Name : League.Strings.Universal_String; Value : OpenGL.Glfloat_Vector_4); procedure Set_Uniform_Value (Self : in out OpenGL_Program'Class; Name : League.Strings.Universal_String; Value : OpenGL.Glfloat_Matrix_2x2); procedure Set_Uniform_Value (Self : in out OpenGL_Program'Class; Name : League.Strings.Universal_String; Value : OpenGL.Glfloat_Matrix_3x3); procedure Set_Uniform_Value (Self : in out OpenGL_Program'Class; Name : League.Strings.Universal_String; Value : OpenGL.Glfloat_Matrix_4x4); -- Sets the uniform variable called Name in the current context to Value. function Uniform_Location (Self : in out OpenGL_Program'Class; Name : League.Strings.Universal_String) return OpenGL.Uniform_Location; -- Returns the location of the uniform variable Name within this shader -- program's parameter list. Returns No_Uniform_Location if Name is not a -- valid uniform variable for this shader program. private type OpenGL_Program is tagged limited record Program : WebAPI.WebGL.Programs.WebGL_Program_Access; Context : WebAPI.WebGL.Rendering_Contexts.WebGL_Rendering_Context_Access; end record; end OpenGL.Programs;

46.89375

79

0.656404

1d30946bf1712b506851fa5beec58e452bff84fd

4,133

adb

Ada

firehog/ncurses/Ada95/ada_include/terminal_interface-curses-text_io-enumeration_io.adb

KipodAfterFree/KAF-2019-FireHog

5f6ee3c3c3329459bc9daeabc1a16ff4619508d9

[ "MIT" ]

1

2019-04-02T20:28:58.000Z

Ada95/ada_include/terminal_interface-curses-text_io-enumeration_io.adb

mitchelhaan/ncurses

0b8ae5088202164ecc1769aa255ed1aad283d2ae

[ "X11" ]

null

Ada95/ada_include/terminal_interface-curses-text_io-enumeration_io.adb

mitchelhaan/ncurses

0b8ae5088202164ecc1769aa255ed1aad283d2ae

[ "X11" ]

1

2019-12-26T10:18:16.000Z

------------------------------------------------------------------------------ -- -- -- GNAT ncurses Binding -- -- -- -- Terminal_Interface.Curses.Text_IO.Enumeration_IO -- -- -- -- B O D Y -- -- -- ------------------------------------------------------------------------------ -- Copyright (c) 1998 Free Software Foundation, Inc. -- -- -- -- Permission is hereby granted, free of charge, to any person obtaining a -- -- copy of this software and associated documentation files (the -- -- "Software"), to deal in the Software without restriction, including -- -- without limitation the rights to use, copy, modify, merge, publish, -- -- distribute, distribute with modifications, sublicense, and/or sell -- -- copies of the Software, and to permit persons to whom the Software is -- -- furnished to do so, subject to the following conditions: -- -- -- -- The above copyright notice and this permission notice shall be included -- -- in all copies or substantial portions of the Software. -- -- -- -- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -- -- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -- -- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. -- -- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -- -- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -- -- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR -- -- THE USE OR OTHER DEALINGS IN THE SOFTWARE. -- -- -- -- Except as contained in this notice, the name(s) of the above copyright -- -- holders shall not be used in advertising or otherwise to promote the -- -- sale, use or other dealings in this Software without prior written -- -- authorization. -- ------------------------------------------------------------------------------ -- Author: Juergen Pfeifer <[email protected]> 1996 -- Version Control: -- $Revision: 1.6 $ -- Binding Version 00.93 ------------------------------------------------------------------------------ with Ada.Text_IO; with Ada.Characters.Handling; use Ada.Characters.Handling; with Terminal_Interface.Curses.Text_IO.Aux; package body Terminal_Interface.Curses.Text_IO.Enumeration_IO is package Aux renames Terminal_Interface.Curses.Text_IO.Aux; package EIO is new Ada.Text_IO.Enumeration_IO (Enum); procedure Put (Win : in Window; Item : in Enum; Width : in Field := Default_Width; Set : in Type_Set := Default_Setting) is Buf : String (1 .. Field'Last); Tset : Ada.Text_IO.Type_Set; begin if Set /= Mixed_Case then Tset := Ada.Text_IO.Type_Set'Val (Type_Set'Pos (Set)); else Tset := Ada.Text_IO.Lower_Case; end if; EIO.Put (Buf, Item, Tset); if Set = Mixed_Case then Buf (Buf'First) := To_Upper (Buf (Buf'First)); end if; Aux.Put_Buf (Win, Buf, Width, True, True); end Put; procedure Put (Item : in Enum; Width : in Field := Default_Width; Set : in Type_Set := Default_Setting) is begin Put (Get_Window, Item, Width, Set); end Put; end Terminal_Interface.Curses.Text_IO.Enumeration_IO;

51.024691

78

0.476651

1dd8c56c1a2bab0f0d2beae9d6a3843b44cb741c

1,930

ads

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/sso/init3.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/sso/init3.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/sso/init3.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

with System; package Init3 is type Small is mod 2**2; for Small'Size use 2; type Count is mod 2**9; for Count'Size use 9; type Nested1 is record C1 : Count; C2 : Count; C3 : Count; end record; pragma Pack (Nested1); for Nested1'Size use 27; for Nested1'Bit_Order use System.Low_Order_First; for Nested1'Scalar_Storage_Order use System.Low_Order_First; type R1 is record S1 : Small; I : Integer; S2 : Small; N : Nested1; B : Boolean; end record; for R1'Bit_Order use System.Low_Order_First; for R1'Scalar_Storage_Order use System.Low_Order_First; for R1 use record S1 at 0 range 0 .. 1; I at 0 range 2 .. 33; S2 at 0 range 34 .. 35; N at 0 range 36 .. 62; B at 0 range 63 .. 63; end record; for R1'Size use 64; type Nested2 is record C1 : Count; C2 : Count; C3 : Count; end record; pragma Pack (Nested2); for Nested2'Size use 27; for Nested2'Bit_Order use System.High_Order_First; for Nested2'Scalar_Storage_Order use System.High_Order_First; type R2 is record S1 : Small; I : Integer; S2 : Small; N : Nested2; B : Boolean; end record; for R2'Bit_Order use System.High_Order_First; for R2'Scalar_Storage_Order use System.High_Order_First; for R2 use record S1 at 0 range 0 .. 1; I at 0 range 2 .. 33; S2 at 0 range 34 .. 35; N at 0 range 36 .. 62; B at 0 range 63 .. 63; end record; for R2'Size use 64; My_R1 : constant R1 := (S1 => 2, I => 16#12345678#, S2 => 1, N => (16#AB#, 16#CD#, 16#EF#), B => True); My_R2 : constant R2 := (S1 => 2, I => 16#12345678#, S2 => 1, N => (16#AB#, 16#CD#, 16#EF#), B => True); end Init3;

24.43038

63

0.550259

1c22177622bca862f0298798a928e1dc82ca405c

13,534

ads

Ada

msp430x2/msp430g2452/svd/msp430_svd-port_1_2.ads

ekoeppen/MSP430_Generic_Ada_Drivers

12b8238ea22dbb0c0c6c63ca46bfa7e2cb80334a

[ "MIT" ]

null

msp430x2/msp430g2452/svd/msp430_svd-port_1_2.ads

ekoeppen/MSP430_Generic_Ada_Drivers

12b8238ea22dbb0c0c6c63ca46bfa7e2cb80334a

[ "MIT" ]

null

msp430x2/msp430g2452/svd/msp430_svd-port_1_2.ads

ekoeppen/MSP430_Generic_Ada_Drivers

12b8238ea22dbb0c0c6c63ca46bfa7e2cb80334a

[ "MIT" ]

null

-- This spec has been automatically generated from out.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with System; -- Port 1/2 package MSP430_SVD.PORT_1_2 is pragma Preelaborate; --------------- -- Registers -- --------------- -- P1IN_P array type P1IN_P_Field_Array is array (0 .. 7) of MSP430_SVD.Bit with Component_Size => 1, Size => 8; -- Port 1 Input type P1IN_Register (As_Array : Boolean := False) is record case As_Array is when False => -- P as a value Val : MSP430_SVD.Byte; when True => -- P as an array Arr : P1IN_P_Field_Array; end case; end record with Unchecked_Union, Size => 8, Volatile_Full_Access, Object_Size => 8, Bit_Order => System.Low_Order_First; for P1IN_Register use record Val at 0 range 0 .. 7; Arr at 0 range 0 .. 7; end record; -- P1OUT_P array type P1OUT_P_Field_Array is array (0 .. 7) of MSP430_SVD.Bit with Component_Size => 1, Size => 8; -- Port 1 Output type P1OUT_Register (As_Array : Boolean := False) is record case As_Array is when False => -- P as a value Val : MSP430_SVD.Byte; when True => -- P as an array Arr : P1OUT_P_Field_Array; end case; end record with Unchecked_Union, Size => 8, Volatile_Full_Access, Object_Size => 8, Bit_Order => System.Low_Order_First; for P1OUT_Register use record Val at 0 range 0 .. 7; Arr at 0 range 0 .. 7; end record; -- P1DIR_P array type P1DIR_P_Field_Array is array (0 .. 7) of MSP430_SVD.Bit with Component_Size => 1, Size => 8; -- Port 1 Direction type P1DIR_Register (As_Array : Boolean := False) is record case As_Array is when False => -- P as a value Val : MSP430_SVD.Byte; when True => -- P as an array Arr : P1DIR_P_Field_Array; end case; end record with Unchecked_Union, Size => 8, Volatile_Full_Access, Object_Size => 8, Bit_Order => System.Low_Order_First; for P1DIR_Register use record Val at 0 range 0 .. 7; Arr at 0 range 0 .. 7; end record; -- P1IFG_P array type P1IFG_P_Field_Array is array (0 .. 7) of MSP430_SVD.Bit with Component_Size => 1, Size => 8; -- Port 1 Interrupt Flag type P1IFG_Register (As_Array : Boolean := False) is record case As_Array is when False => -- P as a value Val : MSP430_SVD.Byte; when True => -- P as an array Arr : P1IFG_P_Field_Array; end case; end record with Unchecked_Union, Size => 8, Volatile_Full_Access, Object_Size => 8, Bit_Order => System.Low_Order_First; for P1IFG_Register use record Val at 0 range 0 .. 7; Arr at 0 range 0 .. 7; end record; -- P1IES_P array type P1IES_P_Field_Array is array (0 .. 7) of MSP430_SVD.Bit with Component_Size => 1, Size => 8; -- Port 1 Interrupt Edge Select type P1IES_Register (As_Array : Boolean := False) is record case As_Array is when False => -- P as a value Val : MSP430_SVD.Byte; when True => -- P as an array Arr : P1IES_P_Field_Array; end case; end record with Unchecked_Union, Size => 8, Volatile_Full_Access, Object_Size => 8, Bit_Order => System.Low_Order_First; for P1IES_Register use record Val at 0 range 0 .. 7; Arr at 0 range 0 .. 7; end record; -- P1IE_P array type P1IE_P_Field_Array is array (0 .. 7) of MSP430_SVD.Bit with Component_Size => 1, Size => 8; -- Port 1 Interrupt Enable type P1IE_Register (As_Array : Boolean := False) is record case As_Array is when False => -- P as a value Val : MSP430_SVD.Byte; when True => -- P as an array Arr : P1IE_P_Field_Array; end case; end record with Unchecked_Union, Size => 8, Volatile_Full_Access, Object_Size => 8, Bit_Order => System.Low_Order_First; for P1IE_Register use record Val at 0 range 0 .. 7; Arr at 0 range 0 .. 7; end record; -- P1SEL_P array type P1SEL_P_Field_Array is array (0 .. 7) of MSP430_SVD.Bit with Component_Size => 1, Size => 8; -- Port 1 Selection type P1SEL_Register (As_Array : Boolean := False) is record case As_Array is when False => -- P as a value Val : MSP430_SVD.Byte; when True => -- P as an array Arr : P1SEL_P_Field_Array; end case; end record with Unchecked_Union, Size => 8, Volatile_Full_Access, Object_Size => 8, Bit_Order => System.Low_Order_First; for P1SEL_Register use record Val at 0 range 0 .. 7; Arr at 0 range 0 .. 7; end record; -- P1REN_P array type P1REN_P_Field_Array is array (0 .. 7) of MSP430_SVD.Bit with Component_Size => 1, Size => 8; -- Port 1 Resistor Enable type P1REN_Register (As_Array : Boolean := False) is record case As_Array is when False => -- P as a value Val : MSP430_SVD.Byte; when True => -- P as an array Arr : P1REN_P_Field_Array; end case; end record with Unchecked_Union, Size => 8, Volatile_Full_Access, Object_Size => 8, Bit_Order => System.Low_Order_First; for P1REN_Register use record Val at 0 range 0 .. 7; Arr at 0 range 0 .. 7; end record; -- P2IN_P array type P2IN_P_Field_Array is array (0 .. 7) of MSP430_SVD.Bit with Component_Size => 1, Size => 8; -- Port 2 Input type P2IN_Register (As_Array : Boolean := False) is record case As_Array is when False => -- P as a value Val : MSP430_SVD.Byte; when True => -- P as an array Arr : P2IN_P_Field_Array; end case; end record with Unchecked_Union, Size => 8, Volatile_Full_Access, Object_Size => 8, Bit_Order => System.Low_Order_First; for P2IN_Register use record Val at 0 range 0 .. 7; Arr at 0 range 0 .. 7; end record; -- P2OUT_P array type P2OUT_P_Field_Array is array (0 .. 7) of MSP430_SVD.Bit with Component_Size => 1, Size => 8; -- Port 2 Output type P2OUT_Register (As_Array : Boolean := False) is record case As_Array is when False => -- P as a value Val : MSP430_SVD.Byte; when True => -- P as an array Arr : P2OUT_P_Field_Array; end case; end record with Unchecked_Union, Size => 8, Volatile_Full_Access, Object_Size => 8, Bit_Order => System.Low_Order_First; for P2OUT_Register use record Val at 0 range 0 .. 7; Arr at 0 range 0 .. 7; end record; -- P2DIR_P array type P2DIR_P_Field_Array is array (0 .. 7) of MSP430_SVD.Bit with Component_Size => 1, Size => 8; -- Port 2 Direction type P2DIR_Register (As_Array : Boolean := False) is record case As_Array is when False => -- P as a value Val : MSP430_SVD.Byte; when True => -- P as an array Arr : P2DIR_P_Field_Array; end case; end record with Unchecked_Union, Size => 8, Volatile_Full_Access, Object_Size => 8, Bit_Order => System.Low_Order_First; for P2DIR_Register use record Val at 0 range 0 .. 7; Arr at 0 range 0 .. 7; end record; -- P2IFG_P array type P2IFG_P_Field_Array is array (0 .. 7) of MSP430_SVD.Bit with Component_Size => 1, Size => 8; -- Port 2 Interrupt Flag type P2IFG_Register (As_Array : Boolean := False) is record case As_Array is when False => -- P as a value Val : MSP430_SVD.Byte; when True => -- P as an array Arr : P2IFG_P_Field_Array; end case; end record with Unchecked_Union, Size => 8, Volatile_Full_Access, Object_Size => 8, Bit_Order => System.Low_Order_First; for P2IFG_Register use record Val at 0 range 0 .. 7; Arr at 0 range 0 .. 7; end record; -- P2IES_P array type P2IES_P_Field_Array is array (0 .. 7) of MSP430_SVD.Bit with Component_Size => 1, Size => 8; -- Port 2 Interrupt Edge Select type P2IES_Register (As_Array : Boolean := False) is record case As_Array is when False => -- P as a value Val : MSP430_SVD.Byte; when True => -- P as an array Arr : P2IES_P_Field_Array; end case; end record with Unchecked_Union, Size => 8, Volatile_Full_Access, Object_Size => 8, Bit_Order => System.Low_Order_First; for P2IES_Register use record Val at 0 range 0 .. 7; Arr at 0 range 0 .. 7; end record; -- P2IE_P array type P2IE_P_Field_Array is array (0 .. 7) of MSP430_SVD.Bit with Component_Size => 1, Size => 8; -- Port 2 Interrupt Enable type P2IE_Register (As_Array : Boolean := False) is record case As_Array is when False => -- P as a value Val : MSP430_SVD.Byte; when True => -- P as an array Arr : P2IE_P_Field_Array; end case; end record with Unchecked_Union, Size => 8, Volatile_Full_Access, Object_Size => 8, Bit_Order => System.Low_Order_First; for P2IE_Register use record Val at 0 range 0 .. 7; Arr at 0 range 0 .. 7; end record; -- P2SEL_P array type P2SEL_P_Field_Array is array (0 .. 7) of MSP430_SVD.Bit with Component_Size => 1, Size => 8; -- Port 2 Selection type P2SEL_Register (As_Array : Boolean := False) is record case As_Array is when False => -- P as a value Val : MSP430_SVD.Byte; when True => -- P as an array Arr : P2SEL_P_Field_Array; end case; end record with Unchecked_Union, Size => 8, Volatile_Full_Access, Object_Size => 8, Bit_Order => System.Low_Order_First; for P2SEL_Register use record Val at 0 range 0 .. 7; Arr at 0 range 0 .. 7; end record; -- P2REN_P array type P2REN_P_Field_Array is array (0 .. 7) of MSP430_SVD.Bit with Component_Size => 1, Size => 8; -- Port 2 Resistor Enable type P2REN_Register (As_Array : Boolean := False) is record case As_Array is when False => -- P as a value Val : MSP430_SVD.Byte; when True => -- P as an array Arr : P2REN_P_Field_Array; end case; end record with Unchecked_Union, Size => 8, Volatile_Full_Access, Object_Size => 8, Bit_Order => System.Low_Order_First; for P2REN_Register use record Val at 0 range 0 .. 7; Arr at 0 range 0 .. 7; end record; ----------------- -- Peripherals -- ----------------- -- Port 1/2 type PORT_1_2_Peripheral is record -- Port 1 Input P1IN : aliased P1IN_Register; -- Port 1 Output P1OUT : aliased P1OUT_Register; -- Port 1 Direction P1DIR : aliased P1DIR_Register; -- Port 1 Interrupt Flag P1IFG : aliased P1IFG_Register; -- Port 1 Interrupt Edge Select P1IES : aliased P1IES_Register; -- Port 1 Interrupt Enable P1IE : aliased P1IE_Register; -- Port 1 Selection P1SEL : aliased P1SEL_Register; -- Port 1 Resistor Enable P1REN : aliased P1REN_Register; -- Port 2 Input P2IN : aliased P2IN_Register; -- Port 2 Output P2OUT : aliased P2OUT_Register; -- Port 2 Direction P2DIR : aliased P2DIR_Register; -- Port 2 Interrupt Flag P2IFG : aliased P2IFG_Register; -- Port 2 Interrupt Edge Select P2IES : aliased P2IES_Register; -- Port 2 Interrupt Enable P2IE : aliased P2IE_Register; -- Port 2 Selection P2SEL : aliased P2SEL_Register; -- Port 2 Resistor Enable P2REN : aliased P2REN_Register; -- Port 1 Selection 2 P1SEL2 : aliased P1SEL_Register; -- Port 2 Selection 2 P2SEL2 : aliased P2SEL_Register; end record with Volatile; for PORT_1_2_Peripheral use record P1IN at 16#0# range 0 .. 7; P1OUT at 16#1# range 0 .. 7; P1DIR at 16#2# range 0 .. 7; P1IFG at 16#3# range 0 .. 7; P1IES at 16#4# range 0 .. 7; P1IE at 16#5# range 0 .. 7; P1SEL at 16#6# range 0 .. 7; P1REN at 16#7# range 0 .. 7; P2IN at 16#8# range 0 .. 7; P2OUT at 16#9# range 0 .. 7; P2DIR at 16#A# range 0 .. 7; P2IFG at 16#B# range 0 .. 7; P2IES at 16#C# range 0 .. 7; P2IE at 16#D# range 0 .. 7; P2SEL at 16#E# range 0 .. 7; P2REN at 16#F# range 0 .. 7; P1SEL2 at 16#21# range 0 .. 7; P2SEL2 at 16#22# range 0 .. 7; end record; -- Port 1/2 PORT_1_2_Periph : aliased PORT_1_2_Peripheral with Import, Address => PORT_1_2_Base; end MSP430_SVD.PORT_1_2;

27.733607

77

0.575587

313a5a5c84ef56ccff56e6af4675f147c51c2b3a

918

ads

Ada

src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/set_pckd_arr_elt/pck.ads

alrooney/unum-sdk

bbccb10b0cd3500feccbbef22e27ea111c3d18eb

[ "Apache-2.0" ]

31

2018-08-01T21:25:24.000Z

2022-02-14T07:52:34.000Z

src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/set_pckd_arr_elt/pck.ads

alrooney/unum-sdk

bbccb10b0cd3500feccbbef22e27ea111c3d18eb

[ "Apache-2.0" ]

40

2018-12-03T19:48:52.000Z

2021-03-10T06:34:26.000Z

src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/set_pckd_arr_elt/pck.ads

alrooney/unum-sdk

bbccb10b0cd3500feccbbef22e27ea111c3d18eb

[ "Apache-2.0" ]

20

2018-11-16T21:19:22.000Z

2021-10-18T23:08:24.000Z

-- Copyright 2012-2016 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- This program is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. package Pck is type Small is new Integer range 0 .. 2 ** 6 - 1; type Simple_Array is array (1 .. 4) of Small; pragma Pack (Simple_Array); procedure Update_Small (S : in out Small); end Pck;

39.913043

73

0.721133

318f0dd085dc555738474cdebe8245177c2c54dc

4,179

adb

Ada

shared/src/tc_sender.adb

STR-UPM/ToyGS

43af123d5a0aaf0ee7b5f4e34fa378fe5edac607

[ "BSD-3-Clause" ]

null

shared/src/tc_sender.adb

STR-UPM/ToyGS

43af123d5a0aaf0ee7b5f4e34fa378fe5edac607

[ "BSD-3-Clause" ]

null

shared/src/tc_sender.adb

STR-UPM/ToyGS

43af123d5a0aaf0ee7b5f4e34fa378fe5edac607

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- Copyright (C) 2017, Universidad Politécnica de Madrid -- -- -- -- 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. -- -- -- ------------------------------------------------------------------------------- -- Implementation of telecommand subsystem with IP; use IP; with GNAT.Sockets; use GNAT.Sockets; with Ada.Real_Time; use Ada.Real_Time; with Ada.Streams; use Ada.Streams; with Ada.Characters.Handling; use Ada.Characters.Handling; with Ada.Unchecked_Conversion; with Ada.Calendar; with GNAT.Calendar.Time_IO; use GNAT.Calendar.Time_IO; pragma Warnings(Off); with System.IO; -- for debugging purposes pragma Warnings(On); package body TC_Sender is ---------------------- -- Data definitions -- ---------------------- subtype TC_Stream is Stream_Element_Array (1..TC_Message'Size/8); function To_Stream is new Ada.Unchecked_Conversion (TC_Message, TC_Stream); Socket : Socket_Type; OBSW_Address : Sock_Addr_Type; ---------- -- Init -- ---------- procedure Init is begin Create_Socket(Socket, Family_Inet, Socket_Datagram); OBSW_Address := (Family_Inet, IP.OBSW_IP, IP.OBSW_Port); pragma Debug (System.IO.Put_Line("... send TCs to " & Image(OBSW_Address))); end Init; --------------------- -- Send TC request -- --------------------- procedure Send(TC : TC_Type := HK) is T : Time; SC : Seconds_Count; TS : Time_Span; begin T := Clock; Split(T, SC, TS); declare Command : TC_Message := (Kind => TC, Timestamp => T); Stream : TC_Stream := To_Stream(Command); Last : Ada.Streams.Stream_Element_Offset; begin Send_Socket(Socket, Stream, Last, OBSW_Address); -- pragma Debug -- (System.IO.Put_Line(Image(Ada.Calendar.Clock, "%T ") -- & "TC " & SC'Img & " " & TC'Img)); end; end Send; end TC_Sender;

43.082474

79

0.536731

066d64ddc5264b5bdd511bfb1040061789a7eb52

5,155

adb

Ada

utils/sdl_display.adb

Fabien-Chouteau/GESTE-examples

1beb029d13d8b4f5b0fa235357eb35e2b7bec95c

[ "BSD-3-Clause" ]

1

2020-12-19T14:51:26.000Z

utils/sdl_display.adb

Fabien-Chouteau/GESTE-examples

1beb029d13d8b4f5b0fa235357eb35e2b7bec95c

[ "BSD-3-Clause" ]

null

utils/sdl_display.adb

Fabien-Chouteau/GESTE-examples

1beb029d13d8b4f5b0fa235357eb35e2b7bec95c

[ "BSD-3-Clause" ]

null

with SDL; with SDL.Video.Windows; with SDL.Video.Windows.Makers; with SDL.Video.Surfaces; with SDL.Video.Pixel_Formats; with SDL.Video.Palettes; use SDL.Video.Palettes; with SDL.Video.Pixel_Formats; use SDL.Video.Pixel_Formats; with SDL.Video.Textures; use SDL.Video.Textures; with SDL.Video.Textures.Makers; with SDL.Video.Renderers; with SDL.Video.Renderers.Makers; use SDL.Video; with Interfaces.C; use Interfaces.C; with SDL.Video.Pixels; with Ada.Unchecked_Conversion; with System; package body SDL_Display is W : SDL.Video.Windows.Window; Renderer : SDL.Video.Renderers.Renderer; Texture : SDL.Video.Textures.Texture; SDL_Pixels : System.Address; Screen_Offset : GESTE.Pix_Point := (0, 0); XS, XE, YS, YE : Natural := 0; X, Y : Natural := 0; type Texture_2D_Array is array (Natural range <>, Natural range <>) of aliased SDL_Pixel; type Texture_1D_Array is array (Natural range <>) of aliased SDL_Pixel; package Texture_2D is new SDL.Video.Pixels.Texture_Data (Index => Natural, Element => SDL_Pixel, Element_Array_1D => Texture_1D_Array, Element_Array_2D => Texture_2D_Array, Default_Terminator => 0); procedure Lock is new SDL.Video.Textures.Lock (Pixel_Pointer_Type => System.Address); ---------------- -- Initialize -- ---------------- procedure Initialize is begin if not SDL.Initialise (Flags => SDL.Enable_Screen) then raise Program_Error with "SDL Video init failed"; end if; SDL.Video.Windows.Makers.Create (W, "GESTE Example", 0, 0, 800 * Pixel_Scale, 600 * Pixel_Scale, Flags => SDL.Video.Windows.Resizable); SDL.Video.Renderers.Makers.Create (Renderer, W); SDL.Video.Textures.Makers.Create (Tex => Texture, Renderer => Renderer, Format => SDL.Video.Pixel_Formats.Pixel_Format_RGB_565, Kind => SDL.Video.Textures.Streaming, Size => (800 * Pixel_Scale, 600 * Pixel_Scale)); end Initialize; ---------------------- -- Set_Drawing_Area -- ---------------------- procedure Set_Drawing_Area (Area : GESTE.Pix_Rect) is begin XS := Area.TL.X - Screen_Offset.X; YS := Area.TL.Y - Screen_Offset.Y; XE := Area.BR.X - Screen_Offset.X; YE := Area.BR.Y - Screen_Offset.Y; X := XS; Y := YS; if XS < 0 then raise Program_Error; end if; if YS < 0 then raise Program_Error; end if; if XE >= Width then raise Program_Error; end if; if YE >= Height then raise Program_Error; end if; end Set_Drawing_Area; ----------------------- -- Set_Screen_Offset -- ----------------------- procedure Set_Screen_Offset (Pt : GESTE.Pix_Point) is begin Screen_Offset := Pt; end Set_Screen_Offset; ------------ -- Update -- ------------ procedure Update is Width : constant Natural := Texture.Get_Size.Width; Height : constant Natural := Texture.Get_Size.Height; begin Renderer.Clear; Renderer.Copy (Texture, To => (0, 0, int (Width * Pixel_Scale), int (Height * Pixel_Scale))); Renderer.Present; end Update; ------------------ -- To_SDL_Color -- ------------------ function To_SDL_Color (R, G, B : Unsigned_8) return SDL_Pixel is RB : constant Unsigned_16 := Shift_Right (Unsigned_16 (R), 3) and 16#1F#; GB : constant Unsigned_16 := Shift_Right (Unsigned_16 (G), 2) and 16#3F#; BB : constant Unsigned_16 := Shift_Right (Unsigned_16 (B), 3) and 16#1F#; begin return (Shift_Left (RB, 11) or Shift_Left (GB, 5) or BB); end To_SDL_Color; ----------------- -- Push_Pixels -- ----------------- procedure Push_Pixels (Pixels : GESTE.Output_Buffer) is function To_Address is new Ada.Unchecked_Conversion (Source => SDL.Video.Pixels.ARGB_8888_Access.Pointer, Target => System.Address); Width : constant Natural := Texture.Get_Size.Width; Height : constant Natural := Texture.Get_Size.Height; begin Lock (Texture, SDL_Pixels); declare Actual_Pixels : Texture_1D_Array (0 .. Natural (Width * Height - 1)) with Address => SDL_Pixels; begin for Pix of Pixels loop Actual_Pixels (X + Y * Width) := Pix; if X = XE then X := XS; if Y = YE then Y := YS; else Y := Y + 1; end if; else X := X + 1; end if; end loop; end; Texture.Unlock; end Push_Pixels; ---------- -- Kill -- ---------- procedure Kill is begin W.Finalize; SDL.Finalise; end Kill; begin Initialize; end SDL_Display;

25.775

77

0.550145

50ce920ca288206c58f744c80fada794f6df9182

3,682

ads

Ada

source/amf/uml/amf-uml-holders-expansion_kinds.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/uml/amf-uml-holders-expansion_kinds.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/uml/amf-uml-holders-expansion_kinds.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

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

70.807692

78

0.40956

1d790ba03c2e84885fb5603076a2674b57a390df

1,982

adb

Ada

ADA_RC_Car/src/sensor_behind.adb

Intelligente-sanntidssystemer/Ada-prosjekt

90797813f0c107dc1af7c073788d8c6f2d413bf8

[ "MIT" ]

null

ADA_RC_Car/src/sensor_behind.adb

Intelligente-sanntidssystemer/Ada-prosjekt

90797813f0c107dc1af7c073788d8c6f2d413bf8

[ "MIT" ]

null

ADA_RC_Car/src/sensor_behind.adb

Intelligente-sanntidssystemer/Ada-prosjekt

90797813f0c107dc1af7c073788d8c6f2d413bf8

[ "MIT" ]

null

with NRF52_DK.Time; with HAL; use HAL; with NRF52_DK.IOs; package body sensor_behind is --Declaration of the PinIDs and type of the variables TrigPin : NRF52_DK.IOs.Pin_Id := 12; EchoPin : NRF52_DK.IOs.Pin_Id := 11; CurrentTime : NRF52_DK.Time.Time_Ms; Duration_Result : Duration; Pulse : Boolean; function HCSR04_Behind_Distance return Float is begin CurrentTime := NRF52_DK.Time.Clock; --Making sure the TrigPin is clear so we set it on false for 2 microseconds. NRF52_DK.IOs.Set(TrigPin, False); NRF52_DK.Time.Delay_Ms(Uint64(CurrentTime / 1000) + UInt64 (2 / 1000)); CurrentTime := NRF52_DK.Time.Clock; --To generate the ultra sound wave we have to set the TrigPin on high/true state for 10 microseconds. NRF52_DK.IOs.Set(TrigPin, True); NRF52_DK.Time.Delay_Ms (Uint64(CurrentTime / 1000) +UInt64 (10 / 1000)); NRF52_DK.IOs.Set(TrigPin, False); --We need to make sure there isn't any interrupts between these parts Pulse := NRF52_DK.IOs.Set(EchoPin); --Returns duration when EchoPin is HIGH. if NRF52_DK.IOs.Set(EchoPin) = True then CurrentTime := NRF52_DK.Time.Clock; --Supposed to return make the result into a duration but due to --NRF52_DK packages not having a function for that and Ada.Real_time not working, we couldn't make the code function properly. Duration_Result := Ada.Real_Time.To_Duration(NRF52_DK.Time.Clock - CurrentTime); return (Float(Duration_Result) / 58.0) * 1000000.0; --In order to get the distance we will divide the Duration_Result with 58 --and then multiply it with 1000000 which turns the microseconds into seconds. end if; return -1.0; end HCSR04_Behind_Distance; --Source: https://github.com/gamegine/HCSR04-ultrasonic-sensor-lib/blob/master/src/HCSR04.cpp end sensor_behind;

37.396226

135

0.673058

06eaeb5c51222216bc8afb49173d3acdd7ac5cac

4,112

ads

Ada

tools/scitools/conf/understand/ada/ada12/g-locfil.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

1

2020-01-20T21:26:46.000Z

tools/scitools/conf/understand/ada/ada12/g-locfil.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

tools/scitools/conf/understand/ada/ada12/g-locfil.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- G N A T . L O C K _ F I L E S -- -- -- -- S p e c -- -- -- -- Copyright (C) 1995-2010, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- -- -- -- -- -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package contains the necessary routines for using files for the -- purpose of providing reliable system wide locking capability. package GNAT.Lock_Files is pragma Preelaborate; Lock_Error : exception; -- Exception raised if file cannot be locked subtype Path_Name is String; -- Pathname is used by all services provided in this unit to specified -- directory name and file name. On DOS based systems both directory -- separators are handled (i.e. slash and backslash). procedure Lock_File (Directory : Path_Name; Lock_File_Name : Path_Name; Wait : Duration := 1.0; Retries : Natural := Natural'Last); -- Create a lock file Lock_File_Name in directory Directory. If the file -- cannot be locked because someone already owns the lock, this procedure -- waits Wait seconds and retries at most Retries times. If the file -- still cannot be locked, Lock_Error is raised. The default is to try -- every second, almost forever (Natural'Last times). The full path of -- the file is constructed by concatenating Directory and Lock_File_Name. -- Directory can optionally terminate with a directory separator. procedure Lock_File (Lock_File_Name : Path_Name; Wait : Duration := 1.0; Retries : Natural := Natural'Last); -- See above. The full lock file path is given as one string procedure Unlock_File (Directory : Path_Name; Lock_File_Name : Path_Name); -- Unlock a file. Directory can optionally terminate with a directory -- separator. procedure Unlock_File (Lock_File_Name : Path_Name); -- Unlock a file whose full path is given in Lock_File_Name end GNAT.Lock_Files;

56.328767

78

0.464251

1dfc15fe9dd0130bfff37ac4918ce888e9bc2709

76,484

adb

Ada

awa/plugins/awa-workspaces/src/model/awa-workspaces-models.adb

twdroeger/ada-awa

77b824773747aecb912c37b1b7b59ea414679b80

[ "Apache-2.0" ]

null

awa/plugins/awa-workspaces/src/model/awa-workspaces-models.adb

twdroeger/ada-awa

77b824773747aecb912c37b1b7b59ea414679b80

[ "Apache-2.0" ]

null

awa/plugins/awa-workspaces/src/model/awa-workspaces-models.adb

twdroeger/ada-awa

77b824773747aecb912c37b1b7b59ea414679b80

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- AWA.Workspaces.Models -- AWA.Workspaces.Models ----------------------------------------------------------------------- -- File generated by ada-gen DO NOT MODIFY -- Template used: templates/model/package-body.xhtml -- Ada Generator: https://ada-gen.googlecode.com/svn/trunk Revision 1095 ----------------------------------------------------------------------- -- Copyright (C) 2019 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Ada.Unchecked_Deallocation; with Util.Beans.Objects.Time; with ASF.Events.Faces.Actions; package body AWA.Workspaces.Models is use type ADO.Objects.Object_Record_Access; use type ADO.Objects.Object_Ref; pragma Warnings (Off, "formal parameter * is not referenced"); function Workspace_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key is Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER, Of_Class => WORKSPACE_DEF'Access); begin ADO.Objects.Set_Value (Result, Id); return Result; end Workspace_Key; function Workspace_Key (Id : in String) return ADO.Objects.Object_Key is Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER, Of_Class => WORKSPACE_DEF'Access); begin ADO.Objects.Set_Value (Result, Id); return Result; end Workspace_Key; function "=" (Left, Right : Workspace_Ref'Class) return Boolean is begin return ADO.Objects.Object_Ref'Class (Left) = ADO.Objects.Object_Ref'Class (Right); end "="; procedure Set_Field (Object : in out Workspace_Ref'Class; Impl : out Workspace_Access) is Result : ADO.Objects.Object_Record_Access; begin Object.Prepare_Modify (Result); Impl := Workspace_Impl (Result.all)'Access; end Set_Field; -- Internal method to allocate the Object_Record instance procedure Allocate (Object : in out Workspace_Ref) is Impl : Workspace_Access; begin Impl := new Workspace_Impl; Impl.Version := 0; Impl.Create_Date := ADO.DEFAULT_TIME; ADO.Objects.Set_Object (Object, Impl.all'Access); end Allocate; -- ---------------------------------------- -- Data object: Workspace -- ---------------------------------------- procedure Set_Id (Object : in out Workspace_Ref; Value : in ADO.Identifier) is Impl : Workspace_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Key_Value (Impl.all, 1, Value); end Set_Id; function Get_Id (Object : in Workspace_Ref) return ADO.Identifier is Impl : constant Workspace_Access := Workspace_Impl (Object.Get_Object.all)'Access; begin return Impl.Get_Key_Value; end Get_Id; function Get_Version (Object : in Workspace_Ref) return Integer is Impl : constant Workspace_Access := Workspace_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Version; end Get_Version; procedure Set_Create_Date (Object : in out Workspace_Ref; Value : in Ada.Calendar.Time) is Impl : Workspace_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Time (Impl.all, 3, Impl.Create_Date, Value); end Set_Create_Date; function Get_Create_Date (Object : in Workspace_Ref) return Ada.Calendar.Time is Impl : constant Workspace_Access := Workspace_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Create_Date; end Get_Create_Date; procedure Set_Owner (Object : in out Workspace_Ref; Value : in AWA.Users.Models.User_Ref'Class) is Impl : Workspace_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Object (Impl.all, 4, Impl.Owner, Value); end Set_Owner; function Get_Owner (Object : in Workspace_Ref) return AWA.Users.Models.User_Ref'Class is Impl : constant Workspace_Access := Workspace_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Owner; end Get_Owner; -- Copy of the object. procedure Copy (Object : in Workspace_Ref; Into : in out Workspace_Ref) is Result : Workspace_Ref; begin if not Object.Is_Null then declare Impl : constant Workspace_Access := Workspace_Impl (Object.Get_Load_Object.all)'Access; Copy : constant Workspace_Access := new Workspace_Impl; begin ADO.Objects.Set_Object (Result, Copy.all'Access); Copy.Copy (Impl.all); Copy.Version := Impl.Version; Copy.Create_Date := Impl.Create_Date; Copy.Owner := Impl.Owner; end; end if; Into := Result; end Copy; procedure Find (Object : in out Workspace_Ref; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean) is Impl : constant Workspace_Access := new Workspace_Impl; begin Impl.Find (Session, Query, Found); if Found then ADO.Objects.Set_Object (Object, Impl.all'Access); else ADO.Objects.Set_Object (Object, null); Destroy (Impl); end if; end Find; procedure Load (Object : in out Workspace_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier) is Impl : constant Workspace_Access := new Workspace_Impl; Found : Boolean; Query : ADO.SQL.Query; begin Query.Bind_Param (Position => 1, Value => Id); Query.Set_Filter ("id = ?"); Impl.Find (Session, Query, Found); if not Found then Destroy (Impl); raise ADO.Objects.NOT_FOUND; end if; ADO.Objects.Set_Object (Object, Impl.all'Access); end Load; procedure Load (Object : in out Workspace_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier; Found : out Boolean) is Impl : constant Workspace_Access := new Workspace_Impl; Query : ADO.SQL.Query; begin Query.Bind_Param (Position => 1, Value => Id); Query.Set_Filter ("id = ?"); Impl.Find (Session, Query, Found); if not Found then Destroy (Impl); else ADO.Objects.Set_Object (Object, Impl.all'Access); end if; end Load; procedure Save (Object : in out Workspace_Ref; Session : in out ADO.Sessions.Master_Session'Class) is Impl : ADO.Objects.Object_Record_Access := Object.Get_Object; begin if Impl = null then Impl := new Workspace_Impl; ADO.Objects.Set_Object (Object, Impl); end if; if not ADO.Objects.Is_Created (Impl.all) then Impl.Create (Session); else Impl.Save (Session); end if; end Save; procedure Delete (Object : in out Workspace_Ref; Session : in out ADO.Sessions.Master_Session'Class) is Impl : constant ADO.Objects.Object_Record_Access := Object.Get_Object; begin if Impl /= null then Impl.Delete (Session); end if; end Delete; -- -------------------- -- Free the object -- -------------------- procedure Destroy (Object : access Workspace_Impl) is type Workspace_Impl_Ptr is access all Workspace_Impl; procedure Unchecked_Free is new Ada.Unchecked_Deallocation (Workspace_Impl, Workspace_Impl_Ptr); pragma Warnings (Off, "*redundant conversion*"); Ptr : Workspace_Impl_Ptr := Workspace_Impl (Object.all)'Access; pragma Warnings (On, "*redundant conversion*"); begin Unchecked_Free (Ptr); end Destroy; procedure Find (Object : in out Workspace_Impl; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean) is Stmt : ADO.Statements.Query_Statement := Session.Create_Statement (Query, WORKSPACE_DEF'Access); begin Stmt.Execute; if Stmt.Has_Elements then Object.Load (Stmt, Session); Stmt.Next; Found := not Stmt.Has_Elements; else Found := False; end if; end Find; overriding procedure Load (Object : in out Workspace_Impl; Session : in out ADO.Sessions.Session'Class) is Found : Boolean; Query : ADO.SQL.Query; Id : constant ADO.Identifier := Object.Get_Key_Value; begin Query.Bind_Param (Position => 1, Value => Id); Query.Set_Filter ("id = ?"); Object.Find (Session, Query, Found); if not Found then raise ADO.Objects.NOT_FOUND; end if; end Load; procedure Save (Object : in out Workspace_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Stmt : ADO.Statements.Update_Statement := Session.Create_Statement (WORKSPACE_DEF'Access); begin if Object.Is_Modified (1) then Stmt.Save_Field (Name => COL_0_1_NAME, -- id Value => Object.Get_Key); Object.Clear_Modified (1); end if; if Object.Is_Modified (3) then Stmt.Save_Field (Name => COL_2_1_NAME, -- create_date Value => Object.Create_Date); Object.Clear_Modified (3); end if; if Object.Is_Modified (4) then Stmt.Save_Field (Name => COL_3_1_NAME, -- owner_id Value => Object.Owner); Object.Clear_Modified (4); end if; if Stmt.Has_Save_Fields then Object.Version := Object.Version + 1; Stmt.Save_Field (Name => "version", Value => Object.Version); Stmt.Set_Filter (Filter => "id = ? and version = ?"); Stmt.Add_Param (Value => Object.Get_Key); Stmt.Add_Param (Value => Object.Version - 1); declare Result : Integer; begin Stmt.Execute (Result); if Result /= 1 then if Result /= 0 then raise ADO.Objects.UPDATE_ERROR; else raise ADO.Objects.LAZY_LOCK; end if; end if; end; end if; end Save; procedure Create (Object : in out Workspace_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Query : ADO.Statements.Insert_Statement := Session.Create_Statement (WORKSPACE_DEF'Access); Result : Integer; begin Object.Version := 1; Session.Allocate (Id => Object); Query.Save_Field (Name => COL_0_1_NAME, -- id Value => Object.Get_Key); Query.Save_Field (Name => COL_1_1_NAME, -- version Value => Object.Version); Query.Save_Field (Name => COL_2_1_NAME, -- create_date Value => Object.Create_Date); Query.Save_Field (Name => COL_3_1_NAME, -- owner_id Value => Object.Owner); Query.Execute (Result); if Result /= 1 then raise ADO.Objects.INSERT_ERROR; end if; ADO.Objects.Set_Created (Object); end Create; procedure Delete (Object : in out Workspace_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Stmt : ADO.Statements.Delete_Statement := Session.Create_Statement (WORKSPACE_DEF'Access); begin Stmt.Set_Filter (Filter => "id = ?"); Stmt.Add_Param (Value => Object.Get_Key); Stmt.Execute; end Delete; -- ------------------------------ -- Get the bean attribute identified by the name. -- ------------------------------ overriding function Get_Value (From : in Workspace_Ref; Name : in String) return Util.Beans.Objects.Object is Obj : ADO.Objects.Object_Record_Access; Impl : access Workspace_Impl; begin if From.Is_Null then return Util.Beans.Objects.Null_Object; end if; Obj := From.Get_Load_Object; Impl := Workspace_Impl (Obj.all)'Access; if Name = "id" then return ADO.Objects.To_Object (Impl.Get_Key); elsif Name = "create_date" then return Util.Beans.Objects.Time.To_Object (Impl.Create_Date); end if; return Util.Beans.Objects.Null_Object; end Get_Value; -- ------------------------------ -- Load the object from current iterator position -- ------------------------------ procedure Load (Object : in out Workspace_Impl; Stmt : in out ADO.Statements.Query_Statement'Class; Session : in out ADO.Sessions.Session'Class) is begin Object.Set_Key_Value (Stmt.Get_Identifier (0)); Object.Create_Date := Stmt.Get_Time (2); if not Stmt.Is_Null (3) then Object.Owner.Set_Key_Value (Stmt.Get_Identifier (3), Session); end if; Object.Version := Stmt.Get_Integer (1); ADO.Objects.Set_Created (Object); end Load; function Workspace_Member_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key is Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER, Of_Class => WORKSPACE_MEMBER_DEF'Access); begin ADO.Objects.Set_Value (Result, Id); return Result; end Workspace_Member_Key; function Workspace_Member_Key (Id : in String) return ADO.Objects.Object_Key is Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER, Of_Class => WORKSPACE_MEMBER_DEF'Access); begin ADO.Objects.Set_Value (Result, Id); return Result; end Workspace_Member_Key; function "=" (Left, Right : Workspace_Member_Ref'Class) return Boolean is begin return ADO.Objects.Object_Ref'Class (Left) = ADO.Objects.Object_Ref'Class (Right); end "="; procedure Set_Field (Object : in out Workspace_Member_Ref'Class; Impl : out Workspace_Member_Access) is Result : ADO.Objects.Object_Record_Access; begin Object.Prepare_Modify (Result); Impl := Workspace_Member_Impl (Result.all)'Access; end Set_Field; -- Internal method to allocate the Object_Record instance procedure Allocate (Object : in out Workspace_Member_Ref) is Impl : Workspace_Member_Access; begin Impl := new Workspace_Member_Impl; Impl.Join_Date.Is_Null := True; ADO.Objects.Set_Object (Object, Impl.all'Access); end Allocate; -- ---------------------------------------- -- Data object: Workspace_Member -- ---------------------------------------- procedure Set_Id (Object : in out Workspace_Member_Ref; Value : in ADO.Identifier) is Impl : Workspace_Member_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Key_Value (Impl.all, 1, Value); end Set_Id; function Get_Id (Object : in Workspace_Member_Ref) return ADO.Identifier is Impl : constant Workspace_Member_Access := Workspace_Member_Impl (Object.Get_Object.all)'Access; begin return Impl.Get_Key_Value; end Get_Id; procedure Set_Join_Date (Object : in out Workspace_Member_Ref; Value : in ADO.Nullable_Time) is Impl : Workspace_Member_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Time (Impl.all, 2, Impl.Join_Date, Value); end Set_Join_Date; function Get_Join_Date (Object : in Workspace_Member_Ref) return ADO.Nullable_Time is Impl : constant Workspace_Member_Access := Workspace_Member_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Join_Date; end Get_Join_Date; procedure Set_Role (Object : in out Workspace_Member_Ref; Value : in String) is Impl : Workspace_Member_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_String (Impl.all, 3, Impl.Role, Value); end Set_Role; procedure Set_Role (Object : in out Workspace_Member_Ref; Value : in Ada.Strings.Unbounded.Unbounded_String) is Impl : Workspace_Member_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Unbounded_String (Impl.all, 3, Impl.Role, Value); end Set_Role; function Get_Role (Object : in Workspace_Member_Ref) return String is begin return Ada.Strings.Unbounded.To_String (Object.Get_Role); end Get_Role; function Get_Role (Object : in Workspace_Member_Ref) return Ada.Strings.Unbounded.Unbounded_String is Impl : constant Workspace_Member_Access := Workspace_Member_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Role; end Get_Role; procedure Set_Member (Object : in out Workspace_Member_Ref; Value : in AWA.Users.Models.User_Ref'Class) is Impl : Workspace_Member_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Object (Impl.all, 4, Impl.Member, Value); end Set_Member; function Get_Member (Object : in Workspace_Member_Ref) return AWA.Users.Models.User_Ref'Class is Impl : constant Workspace_Member_Access := Workspace_Member_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Member; end Get_Member; procedure Set_Workspace (Object : in out Workspace_Member_Ref; Value : in AWA.Workspaces.Models.Workspace_Ref'Class) is Impl : Workspace_Member_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Object (Impl.all, 5, Impl.Workspace, Value); end Set_Workspace; function Get_Workspace (Object : in Workspace_Member_Ref) return AWA.Workspaces.Models.Workspace_Ref'Class is Impl : constant Workspace_Member_Access := Workspace_Member_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Workspace; end Get_Workspace; -- Copy of the object. procedure Copy (Object : in Workspace_Member_Ref; Into : in out Workspace_Member_Ref) is Result : Workspace_Member_Ref; begin if not Object.Is_Null then declare Impl : constant Workspace_Member_Access := Workspace_Member_Impl (Object.Get_Load_Object.all)'Access; Copy : constant Workspace_Member_Access := new Workspace_Member_Impl; begin ADO.Objects.Set_Object (Result, Copy.all'Access); Copy.Copy (Impl.all); Copy.Join_Date := Impl.Join_Date; Copy.Role := Impl.Role; Copy.Member := Impl.Member; Copy.Workspace := Impl.Workspace; end; end if; Into := Result; end Copy; procedure Find (Object : in out Workspace_Member_Ref; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean) is Impl : constant Workspace_Member_Access := new Workspace_Member_Impl; begin Impl.Find (Session, Query, Found); if Found then ADO.Objects.Set_Object (Object, Impl.all'Access); else ADO.Objects.Set_Object (Object, null); Destroy (Impl); end if; end Find; procedure Load (Object : in out Workspace_Member_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier) is Impl : constant Workspace_Member_Access := new Workspace_Member_Impl; Found : Boolean; Query : ADO.SQL.Query; begin Query.Bind_Param (Position => 1, Value => Id); Query.Set_Filter ("id = ?"); Impl.Find (Session, Query, Found); if not Found then Destroy (Impl); raise ADO.Objects.NOT_FOUND; end if; ADO.Objects.Set_Object (Object, Impl.all'Access); end Load; procedure Load (Object : in out Workspace_Member_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier; Found : out Boolean) is Impl : constant Workspace_Member_Access := new Workspace_Member_Impl; Query : ADO.SQL.Query; begin Query.Bind_Param (Position => 1, Value => Id); Query.Set_Filter ("id = ?"); Impl.Find (Session, Query, Found); if not Found then Destroy (Impl); else ADO.Objects.Set_Object (Object, Impl.all'Access); end if; end Load; procedure Save (Object : in out Workspace_Member_Ref; Session : in out ADO.Sessions.Master_Session'Class) is Impl : ADO.Objects.Object_Record_Access := Object.Get_Object; begin if Impl = null then Impl := new Workspace_Member_Impl; ADO.Objects.Set_Object (Object, Impl); end if; if not ADO.Objects.Is_Created (Impl.all) then Impl.Create (Session); else Impl.Save (Session); end if; end Save; procedure Delete (Object : in out Workspace_Member_Ref; Session : in out ADO.Sessions.Master_Session'Class) is Impl : constant ADO.Objects.Object_Record_Access := Object.Get_Object; begin if Impl /= null then Impl.Delete (Session); end if; end Delete; -- -------------------- -- Free the object -- -------------------- procedure Destroy (Object : access Workspace_Member_Impl) is type Workspace_Member_Impl_Ptr is access all Workspace_Member_Impl; procedure Unchecked_Free is new Ada.Unchecked_Deallocation (Workspace_Member_Impl, Workspace_Member_Impl_Ptr); pragma Warnings (Off, "*redundant conversion*"); Ptr : Workspace_Member_Impl_Ptr := Workspace_Member_Impl (Object.all)'Access; pragma Warnings (On, "*redundant conversion*"); begin Unchecked_Free (Ptr); end Destroy; procedure Find (Object : in out Workspace_Member_Impl; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean) is Stmt : ADO.Statements.Query_Statement := Session.Create_Statement (Query, WORKSPACE_MEMBER_DEF'Access); begin Stmt.Execute; if Stmt.Has_Elements then Object.Load (Stmt, Session); Stmt.Next; Found := not Stmt.Has_Elements; else Found := False; end if; end Find; overriding procedure Load (Object : in out Workspace_Member_Impl; Session : in out ADO.Sessions.Session'Class) is Found : Boolean; Query : ADO.SQL.Query; Id : constant ADO.Identifier := Object.Get_Key_Value; begin Query.Bind_Param (Position => 1, Value => Id); Query.Set_Filter ("id = ?"); Object.Find (Session, Query, Found); if not Found then raise ADO.Objects.NOT_FOUND; end if; end Load; procedure Save (Object : in out Workspace_Member_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Stmt : ADO.Statements.Update_Statement := Session.Create_Statement (WORKSPACE_MEMBER_DEF'Access); begin if Object.Is_Modified (1) then Stmt.Save_Field (Name => COL_0_2_NAME, -- id Value => Object.Get_Key); Object.Clear_Modified (1); end if; if Object.Is_Modified (2) then Stmt.Save_Field (Name => COL_1_2_NAME, -- join_date Value => Object.Join_Date); Object.Clear_Modified (2); end if; if Object.Is_Modified (3) then Stmt.Save_Field (Name => COL_2_2_NAME, -- role Value => Object.Role); Object.Clear_Modified (3); end if; if Object.Is_Modified (4) then Stmt.Save_Field (Name => COL_3_2_NAME, -- member_id Value => Object.Member); Object.Clear_Modified (4); end if; if Object.Is_Modified (5) then Stmt.Save_Field (Name => COL_4_2_NAME, -- workspace_id Value => Object.Workspace); Object.Clear_Modified (5); end if; if Stmt.Has_Save_Fields then Stmt.Set_Filter (Filter => "id = ?"); Stmt.Add_Param (Value => Object.Get_Key); declare Result : Integer; begin Stmt.Execute (Result); if Result /= 1 then if Result /= 0 then raise ADO.Objects.UPDATE_ERROR; end if; end if; end; end if; end Save; procedure Create (Object : in out Workspace_Member_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Query : ADO.Statements.Insert_Statement := Session.Create_Statement (WORKSPACE_MEMBER_DEF'Access); Result : Integer; begin Session.Allocate (Id => Object); Query.Save_Field (Name => COL_0_2_NAME, -- id Value => Object.Get_Key); Query.Save_Field (Name => COL_1_2_NAME, -- join_date Value => Object.Join_Date); Query.Save_Field (Name => COL_2_2_NAME, -- role Value => Object.Role); Query.Save_Field (Name => COL_3_2_NAME, -- member_id Value => Object.Member); Query.Save_Field (Name => COL_4_2_NAME, -- workspace_id Value => Object.Workspace); Query.Execute (Result); if Result /= 1 then raise ADO.Objects.INSERT_ERROR; end if; ADO.Objects.Set_Created (Object); end Create; procedure Delete (Object : in out Workspace_Member_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Stmt : ADO.Statements.Delete_Statement := Session.Create_Statement (WORKSPACE_MEMBER_DEF'Access); begin Stmt.Set_Filter (Filter => "id = ?"); Stmt.Add_Param (Value => Object.Get_Key); Stmt.Execute; end Delete; -- ------------------------------ -- Get the bean attribute identified by the name. -- ------------------------------ overriding function Get_Value (From : in Workspace_Member_Ref; Name : in String) return Util.Beans.Objects.Object is Obj : ADO.Objects.Object_Record_Access; Impl : access Workspace_Member_Impl; begin if From.Is_Null then return Util.Beans.Objects.Null_Object; end if; Obj := From.Get_Load_Object; Impl := Workspace_Member_Impl (Obj.all)'Access; if Name = "id" then return ADO.Objects.To_Object (Impl.Get_Key); elsif Name = "join_date" then if Impl.Join_Date.Is_Null then return Util.Beans.Objects.Null_Object; else return Util.Beans.Objects.Time.To_Object (Impl.Join_Date.Value); end if; elsif Name = "role" then return Util.Beans.Objects.To_Object (Impl.Role); end if; return Util.Beans.Objects.Null_Object; end Get_Value; -- ------------------------------ -- Load the object from current iterator position -- ------------------------------ procedure Load (Object : in out Workspace_Member_Impl; Stmt : in out ADO.Statements.Query_Statement'Class; Session : in out ADO.Sessions.Session'Class) is begin Object.Set_Key_Value (Stmt.Get_Identifier (0)); Object.Join_Date := Stmt.Get_Nullable_Time (1); Object.Role := Stmt.Get_Unbounded_String (2); if not Stmt.Is_Null (3) then Object.Member.Set_Key_Value (Stmt.Get_Identifier (3), Session); end if; if not Stmt.Is_Null (4) then Object.Workspace.Set_Key_Value (Stmt.Get_Identifier (4), Session); end if; ADO.Objects.Set_Created (Object); end Load; function Invitation_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key is Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER, Of_Class => INVITATION_DEF'Access); begin ADO.Objects.Set_Value (Result, Id); return Result; end Invitation_Key; function Invitation_Key (Id : in String) return ADO.Objects.Object_Key is Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER, Of_Class => INVITATION_DEF'Access); begin ADO.Objects.Set_Value (Result, Id); return Result; end Invitation_Key; function "=" (Left, Right : Invitation_Ref'Class) return Boolean is begin return ADO.Objects.Object_Ref'Class (Left) = ADO.Objects.Object_Ref'Class (Right); end "="; procedure Set_Field (Object : in out Invitation_Ref'Class; Impl : out Invitation_Access) is Result : ADO.Objects.Object_Record_Access; begin Object.Prepare_Modify (Result); Impl := Invitation_Impl (Result.all)'Access; end Set_Field; -- Internal method to allocate the Object_Record instance procedure Allocate (Object : in out Invitation_Ref) is Impl : Invitation_Access; begin Impl := new Invitation_Impl; Impl.Version := 0; Impl.Create_Date := ADO.DEFAULT_TIME; Impl.Acceptance_Date.Is_Null := True; ADO.Objects.Set_Object (Object, Impl.all'Access); end Allocate; -- ---------------------------------------- -- Data object: Invitation -- ---------------------------------------- procedure Set_Id (Object : in out Invitation_Ref; Value : in ADO.Identifier) is Impl : Invitation_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Key_Value (Impl.all, 1, Value); end Set_Id; function Get_Id (Object : in Invitation_Ref) return ADO.Identifier is Impl : constant Invitation_Access := Invitation_Impl (Object.Get_Object.all)'Access; begin return Impl.Get_Key_Value; end Get_Id; function Get_Version (Object : in Invitation_Ref) return Integer is Impl : constant Invitation_Access := Invitation_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Version; end Get_Version; procedure Set_Create_Date (Object : in out Invitation_Ref; Value : in Ada.Calendar.Time) is Impl : Invitation_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Time (Impl.all, 3, Impl.Create_Date, Value); end Set_Create_Date; function Get_Create_Date (Object : in Invitation_Ref) return Ada.Calendar.Time is Impl : constant Invitation_Access := Invitation_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Create_Date; end Get_Create_Date; procedure Set_Email (Object : in out Invitation_Ref; Value : in String) is Impl : Invitation_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_String (Impl.all, 4, Impl.Email, Value); end Set_Email; procedure Set_Email (Object : in out Invitation_Ref; Value : in Ada.Strings.Unbounded.Unbounded_String) is Impl : Invitation_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Unbounded_String (Impl.all, 4, Impl.Email, Value); end Set_Email; function Get_Email (Object : in Invitation_Ref) return String is begin return Ada.Strings.Unbounded.To_String (Object.Get_Email); end Get_Email; function Get_Email (Object : in Invitation_Ref) return Ada.Strings.Unbounded.Unbounded_String is Impl : constant Invitation_Access := Invitation_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Email; end Get_Email; procedure Set_Message (Object : in out Invitation_Ref; Value : in String) is Impl : Invitation_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_String (Impl.all, 5, Impl.Message, Value); end Set_Message; procedure Set_Message (Object : in out Invitation_Ref; Value : in Ada.Strings.Unbounded.Unbounded_String) is Impl : Invitation_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Unbounded_String (Impl.all, 5, Impl.Message, Value); end Set_Message; function Get_Message (Object : in Invitation_Ref) return String is begin return Ada.Strings.Unbounded.To_String (Object.Get_Message); end Get_Message; function Get_Message (Object : in Invitation_Ref) return Ada.Strings.Unbounded.Unbounded_String is Impl : constant Invitation_Access := Invitation_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Message; end Get_Message; procedure Set_Acceptance_Date (Object : in out Invitation_Ref; Value : in ADO.Nullable_Time) is Impl : Invitation_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Time (Impl.all, 6, Impl.Acceptance_Date, Value); end Set_Acceptance_Date; function Get_Acceptance_Date (Object : in Invitation_Ref) return ADO.Nullable_Time is Impl : constant Invitation_Access := Invitation_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Acceptance_Date; end Get_Acceptance_Date; procedure Set_Workspace (Object : in out Invitation_Ref; Value : in AWA.Workspaces.Models.Workspace_Ref'Class) is Impl : Invitation_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Object (Impl.all, 7, Impl.Workspace, Value); end Set_Workspace; function Get_Workspace (Object : in Invitation_Ref) return AWA.Workspaces.Models.Workspace_Ref'Class is Impl : constant Invitation_Access := Invitation_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Workspace; end Get_Workspace; procedure Set_Access_Key (Object : in out Invitation_Ref; Value : in AWA.Users.Models.Access_Key_Ref'Class) is Impl : Invitation_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Object (Impl.all, 8, Impl.Access_Key, Value); end Set_Access_Key; function Get_Access_Key (Object : in Invitation_Ref) return AWA.Users.Models.Access_Key_Ref'Class is Impl : constant Invitation_Access := Invitation_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Access_Key; end Get_Access_Key; procedure Set_Invitee (Object : in out Invitation_Ref; Value : in AWA.Users.Models.User_Ref'Class) is Impl : Invitation_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Object (Impl.all, 9, Impl.Invitee, Value); end Set_Invitee; function Get_Invitee (Object : in Invitation_Ref) return AWA.Users.Models.User_Ref'Class is Impl : constant Invitation_Access := Invitation_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Invitee; end Get_Invitee; procedure Set_Inviter (Object : in out Invitation_Ref; Value : in AWA.Users.Models.User_Ref'Class) is Impl : Invitation_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Object (Impl.all, 10, Impl.Inviter, Value); end Set_Inviter; function Get_Inviter (Object : in Invitation_Ref) return AWA.Users.Models.User_Ref'Class is Impl : constant Invitation_Access := Invitation_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Inviter; end Get_Inviter; procedure Set_Member (Object : in out Invitation_Ref; Value : in AWA.Workspaces.Models.Workspace_Member_Ref'Class) is Impl : Invitation_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Object (Impl.all, 11, Impl.Member, Value); end Set_Member; function Get_Member (Object : in Invitation_Ref) return AWA.Workspaces.Models.Workspace_Member_Ref'Class is Impl : constant Invitation_Access := Invitation_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Member; end Get_Member; -- Copy of the object. procedure Copy (Object : in Invitation_Ref; Into : in out Invitation_Ref) is Result : Invitation_Ref; begin if not Object.Is_Null then declare Impl : constant Invitation_Access := Invitation_Impl (Object.Get_Load_Object.all)'Access; Copy : constant Invitation_Access := new Invitation_Impl; begin ADO.Objects.Set_Object (Result, Copy.all'Access); Copy.Copy (Impl.all); Copy.Version := Impl.Version; Copy.Create_Date := Impl.Create_Date; Copy.Email := Impl.Email; Copy.Message := Impl.Message; Copy.Acceptance_Date := Impl.Acceptance_Date; Copy.Workspace := Impl.Workspace; Copy.Access_Key := Impl.Access_Key; Copy.Invitee := Impl.Invitee; Copy.Inviter := Impl.Inviter; Copy.Member := Impl.Member; end; end if; Into := Result; end Copy; procedure Find (Object : in out Invitation_Ref; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean) is Impl : constant Invitation_Access := new Invitation_Impl; begin Impl.Find (Session, Query, Found); if Found then ADO.Objects.Set_Object (Object, Impl.all'Access); else ADO.Objects.Set_Object (Object, null); Destroy (Impl); end if; end Find; procedure Load (Object : in out Invitation_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier) is Impl : constant Invitation_Access := new Invitation_Impl; Found : Boolean; Query : ADO.SQL.Query; begin Query.Bind_Param (Position => 1, Value => Id); Query.Set_Filter ("id = ?"); Impl.Find (Session, Query, Found); if not Found then Destroy (Impl); raise ADO.Objects.NOT_FOUND; end if; ADO.Objects.Set_Object (Object, Impl.all'Access); end Load; procedure Load (Object : in out Invitation_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier; Found : out Boolean) is Impl : constant Invitation_Access := new Invitation_Impl; Query : ADO.SQL.Query; begin Query.Bind_Param (Position => 1, Value => Id); Query.Set_Filter ("id = ?"); Impl.Find (Session, Query, Found); if not Found then Destroy (Impl); else ADO.Objects.Set_Object (Object, Impl.all'Access); end if; end Load; procedure Save (Object : in out Invitation_Ref; Session : in out ADO.Sessions.Master_Session'Class) is Impl : ADO.Objects.Object_Record_Access := Object.Get_Object; begin if Impl = null then Impl := new Invitation_Impl; ADO.Objects.Set_Object (Object, Impl); end if; if not ADO.Objects.Is_Created (Impl.all) then Impl.Create (Session); else Impl.Save (Session); end if; end Save; procedure Delete (Object : in out Invitation_Ref; Session : in out ADO.Sessions.Master_Session'Class) is Impl : constant ADO.Objects.Object_Record_Access := Object.Get_Object; begin if Impl /= null then Impl.Delete (Session); end if; end Delete; -- -------------------- -- Free the object -- -------------------- procedure Destroy (Object : access Invitation_Impl) is type Invitation_Impl_Ptr is access all Invitation_Impl; procedure Unchecked_Free is new Ada.Unchecked_Deallocation (Invitation_Impl, Invitation_Impl_Ptr); pragma Warnings (Off, "*redundant conversion*"); Ptr : Invitation_Impl_Ptr := Invitation_Impl (Object.all)'Access; pragma Warnings (On, "*redundant conversion*"); begin Unchecked_Free (Ptr); end Destroy; procedure Find (Object : in out Invitation_Impl; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean) is Stmt : ADO.Statements.Query_Statement := Session.Create_Statement (Query, INVITATION_DEF'Access); begin Stmt.Execute; if Stmt.Has_Elements then Object.Load (Stmt, Session); Stmt.Next; Found := not Stmt.Has_Elements; else Found := False; end if; end Find; overriding procedure Load (Object : in out Invitation_Impl; Session : in out ADO.Sessions.Session'Class) is Found : Boolean; Query : ADO.SQL.Query; Id : constant ADO.Identifier := Object.Get_Key_Value; begin Query.Bind_Param (Position => 1, Value => Id); Query.Set_Filter ("id = ?"); Object.Find (Session, Query, Found); if not Found then raise ADO.Objects.NOT_FOUND; end if; end Load; procedure Save (Object : in out Invitation_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Stmt : ADO.Statements.Update_Statement := Session.Create_Statement (INVITATION_DEF'Access); begin if Object.Is_Modified (1) then Stmt.Save_Field (Name => COL_0_3_NAME, -- id Value => Object.Get_Key); Object.Clear_Modified (1); end if; if Object.Is_Modified (3) then Stmt.Save_Field (Name => COL_2_3_NAME, -- create_date Value => Object.Create_Date); Object.Clear_Modified (3); end if; if Object.Is_Modified (4) then Stmt.Save_Field (Name => COL_3_3_NAME, -- email Value => Object.Email); Object.Clear_Modified (4); end if; if Object.Is_Modified (5) then Stmt.Save_Field (Name => COL_4_3_NAME, -- message Value => Object.Message); Object.Clear_Modified (5); end if; if Object.Is_Modified (6) then Stmt.Save_Field (Name => COL_5_3_NAME, -- acceptance_date Value => Object.Acceptance_Date); Object.Clear_Modified (6); end if; if Object.Is_Modified (7) then Stmt.Save_Field (Name => COL_6_3_NAME, -- workspace_id Value => Object.Workspace); Object.Clear_Modified (7); end if; if Object.Is_Modified (8) then Stmt.Save_Field (Name => COL_7_3_NAME, -- access_key_id Value => Object.Access_Key); Object.Clear_Modified (8); end if; if Object.Is_Modified (9) then Stmt.Save_Field (Name => COL_8_3_NAME, -- invitee_id Value => Object.Invitee); Object.Clear_Modified (9); end if; if Object.Is_Modified (10) then Stmt.Save_Field (Name => COL_9_3_NAME, -- inviter_id Value => Object.Inviter); Object.Clear_Modified (10); end if; if Object.Is_Modified (11) then Stmt.Save_Field (Name => COL_10_3_NAME, -- member_id Value => Object.Member); Object.Clear_Modified (11); end if; if Stmt.Has_Save_Fields then Object.Version := Object.Version + 1; Stmt.Save_Field (Name => "version", Value => Object.Version); Stmt.Set_Filter (Filter => "id = ? and version = ?"); Stmt.Add_Param (Value => Object.Get_Key); Stmt.Add_Param (Value => Object.Version - 1); declare Result : Integer; begin Stmt.Execute (Result); if Result /= 1 then if Result /= 0 then raise ADO.Objects.UPDATE_ERROR; else raise ADO.Objects.LAZY_LOCK; end if; end if; end; end if; end Save; procedure Create (Object : in out Invitation_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Query : ADO.Statements.Insert_Statement := Session.Create_Statement (INVITATION_DEF'Access); Result : Integer; begin Object.Version := 1; Session.Allocate (Id => Object); Query.Save_Field (Name => COL_0_3_NAME, -- id Value => Object.Get_Key); Query.Save_Field (Name => COL_1_3_NAME, -- version Value => Object.Version); Query.Save_Field (Name => COL_2_3_NAME, -- create_date Value => Object.Create_Date); Query.Save_Field (Name => COL_3_3_NAME, -- email Value => Object.Email); Query.Save_Field (Name => COL_4_3_NAME, -- message Value => Object.Message); Query.Save_Field (Name => COL_5_3_NAME, -- acceptance_date Value => Object.Acceptance_Date); Query.Save_Field (Name => COL_6_3_NAME, -- workspace_id Value => Object.Workspace); Query.Save_Field (Name => COL_7_3_NAME, -- access_key_id Value => Object.Access_Key); Query.Save_Field (Name => COL_8_3_NAME, -- invitee_id Value => Object.Invitee); Query.Save_Field (Name => COL_9_3_NAME, -- inviter_id Value => Object.Inviter); Query.Save_Field (Name => COL_10_3_NAME, -- member_id Value => Object.Member); Query.Execute (Result); if Result /= 1 then raise ADO.Objects.INSERT_ERROR; end if; ADO.Objects.Set_Created (Object); end Create; procedure Delete (Object : in out Invitation_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Stmt : ADO.Statements.Delete_Statement := Session.Create_Statement (INVITATION_DEF'Access); begin Stmt.Set_Filter (Filter => "id = ?"); Stmt.Add_Param (Value => Object.Get_Key); Stmt.Execute; end Delete; -- ------------------------------ -- Get the bean attribute identified by the name. -- ------------------------------ overriding function Get_Value (From : in Invitation_Ref; Name : in String) return Util.Beans.Objects.Object is Obj : ADO.Objects.Object_Record_Access; Impl : access Invitation_Impl; begin if From.Is_Null then return Util.Beans.Objects.Null_Object; end if; Obj := From.Get_Load_Object; Impl := Invitation_Impl (Obj.all)'Access; if Name = "id" then return ADO.Objects.To_Object (Impl.Get_Key); elsif Name = "create_date" then return Util.Beans.Objects.Time.To_Object (Impl.Create_Date); elsif Name = "email" then return Util.Beans.Objects.To_Object (Impl.Email); elsif Name = "message" then return Util.Beans.Objects.To_Object (Impl.Message); elsif Name = "acceptance_date" then if Impl.Acceptance_Date.Is_Null then return Util.Beans.Objects.Null_Object; else return Util.Beans.Objects.Time.To_Object (Impl.Acceptance_Date.Value); end if; end if; return Util.Beans.Objects.Null_Object; end Get_Value; -- ------------------------------ -- Load the object from current iterator position -- ------------------------------ procedure Load (Object : in out Invitation_Impl; Stmt : in out ADO.Statements.Query_Statement'Class; Session : in out ADO.Sessions.Session'Class) is begin Object.Set_Key_Value (Stmt.Get_Identifier (0)); Object.Create_Date := Stmt.Get_Time (2); Object.Email := Stmt.Get_Unbounded_String (3); Object.Message := Stmt.Get_Unbounded_String (4); Object.Acceptance_Date := Stmt.Get_Nullable_Time (5); if not Stmt.Is_Null (6) then Object.Workspace.Set_Key_Value (Stmt.Get_Identifier (6), Session); end if; if not Stmt.Is_Null (7) then Object.Access_Key.Set_Key_Value (Stmt.Get_Identifier (7), Session); end if; if not Stmt.Is_Null (8) then Object.Invitee.Set_Key_Value (Stmt.Get_Identifier (8), Session); end if; if not Stmt.Is_Null (9) then Object.Inviter.Set_Key_Value (Stmt.Get_Identifier (9), Session); end if; if not Stmt.Is_Null (10) then Object.Member.Set_Key_Value (Stmt.Get_Identifier (10), Session); end if; Object.Version := Stmt.Get_Integer (1); ADO.Objects.Set_Created (Object); end Load; function Workspace_Feature_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key is Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER, Of_Class => WORKSPACE_FEATURE_DEF'Access); begin ADO.Objects.Set_Value (Result, Id); return Result; end Workspace_Feature_Key; function Workspace_Feature_Key (Id : in String) return ADO.Objects.Object_Key is Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER, Of_Class => WORKSPACE_FEATURE_DEF'Access); begin ADO.Objects.Set_Value (Result, Id); return Result; end Workspace_Feature_Key; function "=" (Left, Right : Workspace_Feature_Ref'Class) return Boolean is begin return ADO.Objects.Object_Ref'Class (Left) = ADO.Objects.Object_Ref'Class (Right); end "="; procedure Set_Field (Object : in out Workspace_Feature_Ref'Class; Impl : out Workspace_Feature_Access) is Result : ADO.Objects.Object_Record_Access; begin Object.Prepare_Modify (Result); Impl := Workspace_Feature_Impl (Result.all)'Access; end Set_Field; -- Internal method to allocate the Object_Record instance procedure Allocate (Object : in out Workspace_Feature_Ref) is Impl : Workspace_Feature_Access; begin Impl := new Workspace_Feature_Impl; Impl.Limit := 0; ADO.Objects.Set_Object (Object, Impl.all'Access); end Allocate; -- ---------------------------------------- -- Data object: Workspace_Feature -- ---------------------------------------- procedure Set_Id (Object : in out Workspace_Feature_Ref; Value : in ADO.Identifier) is Impl : Workspace_Feature_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Key_Value (Impl.all, 1, Value); end Set_Id; function Get_Id (Object : in Workspace_Feature_Ref) return ADO.Identifier is Impl : constant Workspace_Feature_Access := Workspace_Feature_Impl (Object.Get_Object.all)'Access; begin return Impl.Get_Key_Value; end Get_Id; procedure Set_Limit (Object : in out Workspace_Feature_Ref; Value : in Integer) is Impl : Workspace_Feature_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Integer (Impl.all, 2, Impl.Limit, Value); end Set_Limit; function Get_Limit (Object : in Workspace_Feature_Ref) return Integer is Impl : constant Workspace_Feature_Access := Workspace_Feature_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Limit; end Get_Limit; procedure Set_Workspace (Object : in out Workspace_Feature_Ref; Value : in AWA.Workspaces.Models.Workspace_Ref'Class) is Impl : Workspace_Feature_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Object (Impl.all, 3, Impl.Workspace, Value); end Set_Workspace; function Get_Workspace (Object : in Workspace_Feature_Ref) return AWA.Workspaces.Models.Workspace_Ref'Class is Impl : constant Workspace_Feature_Access := Workspace_Feature_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Workspace; end Get_Workspace; -- Copy of the object. procedure Copy (Object : in Workspace_Feature_Ref; Into : in out Workspace_Feature_Ref) is Result : Workspace_Feature_Ref; begin if not Object.Is_Null then declare Impl : constant Workspace_Feature_Access := Workspace_Feature_Impl (Object.Get_Load_Object.all)'Access; Copy : constant Workspace_Feature_Access := new Workspace_Feature_Impl; begin ADO.Objects.Set_Object (Result, Copy.all'Access); Copy.Copy (Impl.all); Copy.Limit := Impl.Limit; Copy.Workspace := Impl.Workspace; end; end if; Into := Result; end Copy; procedure Find (Object : in out Workspace_Feature_Ref; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean) is Impl : constant Workspace_Feature_Access := new Workspace_Feature_Impl; begin Impl.Find (Session, Query, Found); if Found then ADO.Objects.Set_Object (Object, Impl.all'Access); else ADO.Objects.Set_Object (Object, null); Destroy (Impl); end if; end Find; procedure Load (Object : in out Workspace_Feature_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier) is Impl : constant Workspace_Feature_Access := new Workspace_Feature_Impl; Found : Boolean; Query : ADO.SQL.Query; begin Query.Bind_Param (Position => 1, Value => Id); Query.Set_Filter ("id = ?"); Impl.Find (Session, Query, Found); if not Found then Destroy (Impl); raise ADO.Objects.NOT_FOUND; end if; ADO.Objects.Set_Object (Object, Impl.all'Access); end Load; procedure Load (Object : in out Workspace_Feature_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier; Found : out Boolean) is Impl : constant Workspace_Feature_Access := new Workspace_Feature_Impl; Query : ADO.SQL.Query; begin Query.Bind_Param (Position => 1, Value => Id); Query.Set_Filter ("id = ?"); Impl.Find (Session, Query, Found); if not Found then Destroy (Impl); else ADO.Objects.Set_Object (Object, Impl.all'Access); end if; end Load; procedure Save (Object : in out Workspace_Feature_Ref; Session : in out ADO.Sessions.Master_Session'Class) is Impl : ADO.Objects.Object_Record_Access := Object.Get_Object; begin if Impl = null then Impl := new Workspace_Feature_Impl; ADO.Objects.Set_Object (Object, Impl); end if; if not ADO.Objects.Is_Created (Impl.all) then Impl.Create (Session); else Impl.Save (Session); end if; end Save; procedure Delete (Object : in out Workspace_Feature_Ref; Session : in out ADO.Sessions.Master_Session'Class) is Impl : constant ADO.Objects.Object_Record_Access := Object.Get_Object; begin if Impl /= null then Impl.Delete (Session); end if; end Delete; -- -------------------- -- Free the object -- -------------------- procedure Destroy (Object : access Workspace_Feature_Impl) is type Workspace_Feature_Impl_Ptr is access all Workspace_Feature_Impl; procedure Unchecked_Free is new Ada.Unchecked_Deallocation (Workspace_Feature_Impl, Workspace_Feature_Impl_Ptr); pragma Warnings (Off, "*redundant conversion*"); Ptr : Workspace_Feature_Impl_Ptr := Workspace_Feature_Impl (Object.all)'Access; pragma Warnings (On, "*redundant conversion*"); begin Unchecked_Free (Ptr); end Destroy; procedure Find (Object : in out Workspace_Feature_Impl; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean) is Stmt : ADO.Statements.Query_Statement := Session.Create_Statement (Query, WORKSPACE_FEATURE_DEF'Access); begin Stmt.Execute; if Stmt.Has_Elements then Object.Load (Stmt, Session); Stmt.Next; Found := not Stmt.Has_Elements; else Found := False; end if; end Find; overriding procedure Load (Object : in out Workspace_Feature_Impl; Session : in out ADO.Sessions.Session'Class) is Found : Boolean; Query : ADO.SQL.Query; Id : constant ADO.Identifier := Object.Get_Key_Value; begin Query.Bind_Param (Position => 1, Value => Id); Query.Set_Filter ("id = ?"); Object.Find (Session, Query, Found); if not Found then raise ADO.Objects.NOT_FOUND; end if; end Load; procedure Save (Object : in out Workspace_Feature_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Stmt : ADO.Statements.Update_Statement := Session.Create_Statement (WORKSPACE_FEATURE_DEF'Access); begin if Object.Is_Modified (1) then Stmt.Save_Field (Name => COL_0_4_NAME, -- id Value => Object.Get_Key); Object.Clear_Modified (1); end if; if Object.Is_Modified (2) then Stmt.Save_Field (Name => COL_1_4_NAME, -- limit Value => Object.Limit); Object.Clear_Modified (2); end if; if Object.Is_Modified (3) then Stmt.Save_Field (Name => COL_2_4_NAME, -- workspace_id Value => Object.Workspace); Object.Clear_Modified (3); end if; if Stmt.Has_Save_Fields then Stmt.Set_Filter (Filter => "id = ?"); Stmt.Add_Param (Value => Object.Get_Key); declare Result : Integer; begin Stmt.Execute (Result); if Result /= 1 then if Result /= 0 then raise ADO.Objects.UPDATE_ERROR; end if; end if; end; end if; end Save; procedure Create (Object : in out Workspace_Feature_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Query : ADO.Statements.Insert_Statement := Session.Create_Statement (WORKSPACE_FEATURE_DEF'Access); Result : Integer; begin Session.Allocate (Id => Object); Query.Save_Field (Name => COL_0_4_NAME, -- id Value => Object.Get_Key); Query.Save_Field (Name => COL_1_4_NAME, -- limit Value => Object.Limit); Query.Save_Field (Name => COL_2_4_NAME, -- workspace_id Value => Object.Workspace); Query.Execute (Result); if Result /= 1 then raise ADO.Objects.INSERT_ERROR; end if; ADO.Objects.Set_Created (Object); end Create; procedure Delete (Object : in out Workspace_Feature_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Stmt : ADO.Statements.Delete_Statement := Session.Create_Statement (WORKSPACE_FEATURE_DEF'Access); begin Stmt.Set_Filter (Filter => "id = ?"); Stmt.Add_Param (Value => Object.Get_Key); Stmt.Execute; end Delete; -- ------------------------------ -- Get the bean attribute identified by the name. -- ------------------------------ overriding function Get_Value (From : in Workspace_Feature_Ref; Name : in String) return Util.Beans.Objects.Object is Obj : ADO.Objects.Object_Record_Access; Impl : access Workspace_Feature_Impl; begin if From.Is_Null then return Util.Beans.Objects.Null_Object; end if; Obj := From.Get_Load_Object; Impl := Workspace_Feature_Impl (Obj.all)'Access; if Name = "id" then return ADO.Objects.To_Object (Impl.Get_Key); elsif Name = "limit" then return Util.Beans.Objects.To_Object (Long_Long_Integer (Impl.Limit)); end if; return Util.Beans.Objects.Null_Object; end Get_Value; -- ------------------------------ -- Load the object from current iterator position -- ------------------------------ procedure Load (Object : in out Workspace_Feature_Impl; Stmt : in out ADO.Statements.Query_Statement'Class; Session : in out ADO.Sessions.Session'Class) is begin Object.Set_Key_Value (Stmt.Get_Identifier (0)); Object.Limit := Stmt.Get_Integer (1); if not Stmt.Is_Null (2) then Object.Workspace.Set_Key_Value (Stmt.Get_Identifier (2), Session); end if; ADO.Objects.Set_Created (Object); end Load; -- ------------------------------ -- Get the bean attribute identified by the name. -- ------------------------------ overriding function Get_Value (From : in Member_Info; Name : in String) return Util.Beans.Objects.Object is begin if Name = "id" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Id)); elsif Name = "user_id" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.User_Id)); elsif Name = "name" then return Util.Beans.Objects.To_Object (From.Name); elsif Name = "email" then return Util.Beans.Objects.To_Object (From.Email); elsif Name = "role" then return Util.Beans.Objects.To_Object (From.Role); elsif Name = "join_date" then if From.Join_Date.Is_Null then return Util.Beans.Objects.Null_Object; else return Util.Beans.Objects.Time.To_Object (From.Join_Date.Value); end if; elsif Name = "invite_date" then if From.Invite_Date.Is_Null then return Util.Beans.Objects.Null_Object; else return Util.Beans.Objects.Time.To_Object (From.Invite_Date.Value); end if; end if; return Util.Beans.Objects.Null_Object; end Get_Value; -- ------------------------------ -- Set the value identified by the name -- ------------------------------ overriding procedure Set_Value (Item : in out Member_Info; Name : in String; Value : in Util.Beans.Objects.Object) is begin if Name = "id" then Item.Id := ADO.Identifier (Util.Beans.Objects.To_Long_Long_Integer (Value)); elsif Name = "user_id" then Item.User_Id := ADO.Identifier (Util.Beans.Objects.To_Long_Long_Integer (Value)); elsif Name = "name" then Item.Name := Util.Beans.Objects.To_Unbounded_String (Value); elsif Name = "email" then Item.Email := Util.Beans.Objects.To_Unbounded_String (Value); elsif Name = "role" then Item.Role := Util.Beans.Objects.To_Unbounded_String (Value); elsif Name = "join_date" then Item.Join_Date.Is_Null := Util.Beans.Objects.Is_Null (Value); if not Item.Join_Date.Is_Null then Item.Join_Date.Value := Util.Beans.Objects.Time.To_Time (Value); end if; elsif Name = "invite_date" then Item.Invite_Date.Is_Null := Util.Beans.Objects.Is_Null (Value); if not Item.Invite_Date.Is_Null then Item.Invite_Date.Value := Util.Beans.Objects.Time.To_Time (Value); end if; end if; end Set_Value; -- -------------------- -- Run the query controlled by Context and append the list in Object. -- -------------------- procedure List (Object : in out Member_Info_List_Bean'Class; Session : in out ADO.Sessions.Session'Class; Context : in out ADO.Queries.Context'Class) is begin List (Object.List, Session, Context); end List; -- -------------------- -- The Member_Info describes a member of the workspace. -- -------------------- procedure List (Object : in out Member_Info_Vector; Session : in out ADO.Sessions.Session'Class; Context : in out ADO.Queries.Context'Class) is procedure Read (Into : in out Member_Info); Stmt : ADO.Statements.Query_Statement := Session.Create_Statement (Context); Pos : Positive := 1; procedure Read (Into : in out Member_Info) is begin Into.Id := Stmt.Get_Identifier (0); Into.User_Id := Stmt.Get_Identifier (1); Into.Name := Stmt.Get_Unbounded_String (2); Into.Email := Stmt.Get_Unbounded_String (3); Into.Role := Stmt.Get_Unbounded_String (4); Into.Join_Date := Stmt.Get_Nullable_Time (5); Into.Invite_Date := Stmt.Get_Nullable_Time (6); end Read; begin Stmt.Execute; Member_Info_Vectors.Clear (Object); while Stmt.Has_Elements loop Object.Insert_Space (Before => Pos); Object.Update_Element (Index => Pos, Process => Read'Access); Pos := Pos + 1; Stmt.Next; end loop; end List; procedure Op_Load (Bean : in out Invitation_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); procedure Op_Load (Bean : in out Invitation_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is begin Invitation_Bean'Class (Bean).Load (Outcome); end Op_Load; package Binding_Invitation_Bean_1 is new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Invitation_Bean, Method => Op_Load, Name => "load"); procedure Op_Accept_Invitation (Bean : in out Invitation_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); procedure Op_Accept_Invitation (Bean : in out Invitation_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is begin Invitation_Bean'Class (Bean).Accept_Invitation (Outcome); end Op_Accept_Invitation; package Binding_Invitation_Bean_2 is new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Invitation_Bean, Method => Op_Accept_Invitation, Name => "accept_invitation"); procedure Op_Send (Bean : in out Invitation_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); procedure Op_Send (Bean : in out Invitation_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is begin Invitation_Bean'Class (Bean).Send (Outcome); end Op_Send; package Binding_Invitation_Bean_3 is new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Invitation_Bean, Method => Op_Send, Name => "send"); Binding_Invitation_Bean_Array : aliased constant Util.Beans.Methods.Method_Binding_Array := (1 => Binding_Invitation_Bean_1.Proxy'Access, 2 => Binding_Invitation_Bean_2.Proxy'Access, 3 => Binding_Invitation_Bean_3.Proxy'Access ); -- ------------------------------ -- This bean provides some methods that can be used in a Method_Expression. -- ------------------------------ overriding function Get_Method_Bindings (From : in Invitation_Bean) return Util.Beans.Methods.Method_Binding_Array_Access is pragma Unreferenced (From); begin return Binding_Invitation_Bean_Array'Access; end Get_Method_Bindings; -- ------------------------------ -- Get the bean attribute identified by the name. -- ------------------------------ overriding function Get_Value (From : in Invitation_Bean; Name : in String) return Util.Beans.Objects.Object is begin if Name = "key" then return Util.Beans.Objects.To_Object (From.Key); end if; return Awa.Workspaces.Models.Invitation_Ref (From).Get_Value (Name); end Get_Value; -- ------------------------------ -- Set the value identified by the name -- ------------------------------ overriding procedure Set_Value (Item : in out Invitation_Bean; Name : in String; Value : in Util.Beans.Objects.Object) is begin if Name = "key" then Item.Key := Util.Beans.Objects.To_Unbounded_String (Value); elsif Name = "create_date" then Item.Set_Create_Date (Util.Beans.Objects.Time.To_Time (Value)); elsif Name = "email" then Item.Set_Email (Util.Beans.Objects.To_String (Value)); elsif Name = "message" then Item.Set_Message (Util.Beans.Objects.To_String (Value)); elsif Name = "acceptance_date" then if Util.Beans.Objects.Is_Null (Value) then Item.Set_Acceptance_Date (ADO.Nullable_Time '(Is_Null => True, others => <>)); else Item.Set_Acceptance_Date (ADO.Nullable_Time '(Is_Null => False, Value => Util.Beans.Objects.Time.To_Time (Value))); end if; end if; end Set_Value; procedure Op_Load (Bean : in out Member_List_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); procedure Op_Load (Bean : in out Member_List_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is begin Member_List_Bean'Class (Bean).Load (Outcome); end Op_Load; package Binding_Member_List_Bean_1 is new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Member_List_Bean, Method => Op_Load, Name => "load"); Binding_Member_List_Bean_Array : aliased constant Util.Beans.Methods.Method_Binding_Array := (1 => Binding_Member_List_Bean_1.Proxy'Access ); -- ------------------------------ -- This bean provides some methods that can be used in a Method_Expression. -- ------------------------------ overriding function Get_Method_Bindings (From : in Member_List_Bean) return Util.Beans.Methods.Method_Binding_Array_Access is pragma Unreferenced (From); begin return Binding_Member_List_Bean_Array'Access; end Get_Method_Bindings; -- ------------------------------ -- Get the bean attribute identified by the name. -- ------------------------------ overriding function Get_Value (From : in Member_List_Bean; Name : in String) return Util.Beans.Objects.Object is begin if Name = "page_size" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Page_Size)); elsif Name = "count" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Count)); elsif Name = "page" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Page)); end if; return Util.Beans.Objects.Null_Object; end Get_Value; -- ------------------------------ -- Set the value identified by the name -- ------------------------------ overriding procedure Set_Value (Item : in out Member_List_Bean; Name : in String; Value : in Util.Beans.Objects.Object) is begin if Name = "page_size" then Item.Page_Size := Util.Beans.Objects.To_Integer (Value); elsif Name = "count" then Item.Count := Util.Beans.Objects.To_Integer (Value); elsif Name = "page" then Item.Page := Util.Beans.Objects.To_Integer (Value); end if; end Set_Value; procedure Op_Load (Bean : in out Member_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); procedure Op_Load (Bean : in out Member_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is begin Member_Bean'Class (Bean).Load (Outcome); end Op_Load; package Binding_Member_Bean_1 is new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Member_Bean, Method => Op_Load, Name => "load"); procedure Op_Delete (Bean : in out Member_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); procedure Op_Delete (Bean : in out Member_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is begin Member_Bean'Class (Bean).Delete (Outcome); end Op_Delete; package Binding_Member_Bean_2 is new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Member_Bean, Method => Op_Delete, Name => "delete"); Binding_Member_Bean_Array : aliased constant Util.Beans.Methods.Method_Binding_Array := (1 => Binding_Member_Bean_1.Proxy'Access, 2 => Binding_Member_Bean_2.Proxy'Access ); -- ------------------------------ -- This bean provides some methods that can be used in a Method_Expression. -- ------------------------------ overriding function Get_Method_Bindings (From : in Member_Bean) return Util.Beans.Methods.Method_Binding_Array_Access is pragma Unreferenced (From); begin return Binding_Member_Bean_Array'Access; end Get_Method_Bindings; -- ------------------------------ -- Set the value identified by the name -- ------------------------------ overriding procedure Set_Value (Item : in out Member_Bean; Name : in String; Value : in Util.Beans.Objects.Object) is begin if Name = "join_date" then if Util.Beans.Objects.Is_Null (Value) then Item.Set_Join_Date (ADO.Nullable_Time '(Is_Null => True, others => <>)); else Item.Set_Join_Date (ADO.Nullable_Time '(Is_Null => False, Value => Util.Beans.Objects.Time.To_Time (Value))); end if; elsif Name = "role" then Item.Set_Role (Util.Beans.Objects.To_String (Value)); end if; end Set_Value; end AWA.Workspaces.Models;

37.455436

94

0.597458

2f2cec54d3a1894fe8074b7557b90b65527035c3

852

adb

Ada

source/numerics/a-nudira.adb

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

33

2015-04-04T09:19:36.000Z

2021-11-10T05:33:34.000Z

source/numerics/a-nudira.adb

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

8

2017-11-14T13:05:07.000Z

2018-08-09T15:28:49.000Z

source/numerics/a-nudira.adb

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

9

2015-02-03T17:09:53.000Z

2021-11-12T01:16:05.000Z

with Ada.Numerics.Distributions; package body Ada.Numerics.Discrete_Random is function Random (Gen : Generator) return Result_Subtype is function Do_Random is new Distributions.Linear_Discrete_Random ( MT19937.Unsigned_32, Result_Subtype, Generator, Random_32); begin return Do_Random (Gen'Unrestricted_Access.all); end Random; function Random (Gen : Generator; First, Last : Result_Subtype) return Result_Subtype is subtype R is Result_Subtype range First .. Last; function Do_Random is new Distributions.Linear_Discrete_Random ( MT19937.Unsigned_32, R, Generator, Random_32); begin return Do_Random (Gen'Unrestricted_Access.all); end Random; end Ada.Numerics.Discrete_Random;

28.4

66

0.659624

0bbb8acb770b1e3621e82c54a71c085d845c1830

5,883

adb

Ada

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-imagew.adb

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-imagew.adb

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-imagew.adb

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . I M A G E _ W -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2021, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- -- -- -- -- -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ package body System.Image_W is ----------------------------- -- Set_Image_Width_Integer -- ----------------------------- procedure Set_Image_Width_Integer (V : Int; W : Integer; S : out String; P : in out Natural) is Start : Natural; begin -- Positive case can just use the unsigned circuit directly if V >= 0 then Set_Image_Width_Unsigned (Uns (V), W, S, P); -- Negative case has to set a minus sign. Note also that we have to be -- careful not to generate overflow with the largest negative number. else P := P + 1; S (P) := ' '; Start := P; declare pragma Suppress (Overflow_Check); pragma Suppress (Range_Check); begin Set_Image_Width_Unsigned (Uns (-V), W - 1, S, P); end; -- Set minus sign in last leading blank location. Because of the -- code above, there must be at least one such location. while S (Start + 1) = ' ' loop Start := Start + 1; end loop; S (Start) := '-'; end if; end Set_Image_Width_Integer; ------------------------------ -- Set_Image_Width_Unsigned -- ------------------------------ procedure Set_Image_Width_Unsigned (V : Uns; W : Integer; S : out String; P : in out Natural) is Start : constant Natural := P; F, T : Natural; procedure Set_Digits (T : Uns); -- Set digits of absolute value of T ---------------- -- Set_Digits -- ---------------- procedure Set_Digits (T : Uns) is begin if T >= 10 then Set_Digits (T / 10); pragma Assert (P >= (S'First - 1) and P < S'Last and P < Natural'Last); -- No check is done since, as documented in the specification, -- the caller guarantees that S is long enough to hold the result. P := P + 1; S (P) := Character'Val (T mod 10 + Character'Pos ('0')); else pragma Assert (P >= (S'First - 1) and P < S'Last and P < Natural'Last); -- No check is done since, as documented in the specification, -- the caller guarantees that S is long enough to hold the result. P := P + 1; S (P) := Character'Val (T + Character'Pos ('0')); end if; end Set_Digits; -- Start of processing for Set_Image_Width_Unsigned begin Set_Digits (V); -- Add leading spaces if required by width parameter if P - Start < W then F := P; P := P + (W - (P - Start)); T := P; while F > Start loop pragma Assert (T >= S'First and T <= S'Last and F >= S'First and F <= S'Last); -- No check is done since, as documented in the specification, -- the caller guarantees that S is long enough to hold the result. S (T) := S (F); T := T - 1; F := F - 1; end loop; for J in Start + 1 .. T loop pragma Assert (J >= S'First and J <= S'Last); -- No check is done since, as documented in the specification, -- the caller guarantees that S is long enough to hold the result. S (J) := ' '; end loop; end if; end Set_Image_Width_Unsigned; end System.Image_W;

38.45098

79

0.412035

18e213115863da8872ac25cb03e3781043ee4457

141

ads

Ada

source/textio/a-ssitio.ads

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

33

2015-04-04T09:19:36.000Z

2021-11-10T05:33:34.000Z

source/textio/a-ssitio.ads

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

8

2017-11-14T13:05:07.000Z

2018-08-09T15:28:49.000Z

source/textio/a-ssitio.ads

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

9

2015-02-03T17:09:53.000Z

2021-11-12T01:16:05.000Z

pragma License (Unrestricted); with Ada.Text_IO; package Ada.Short_Short_Integer_Text_IO is new Text_IO.Integer_IO (Short_Short_Integer);

28.2

48

0.829787

1d48c57c0bed9387a31ecd5f88f63f00da92f183

8,066

adb

Ada

bb-runtimes/examples/monitor/net/nettftp.adb

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/examples/monitor/net/nettftp.adb

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/examples/monitor/net/nettftp.adb

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT EXAMPLE -- -- -- -- Copyright (C) 2013, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Ada.Text_IO; use Ada.Text_IO; with Netutils; use Netutils; with Netproto; use Netproto; with Ethdrv; use Ethdrv; with Netcfg; with Memory_Copy; with Interfaces.C; -- Implement a tftp server (that accept only write requests). -- RFC1350 package body Nettftp is procedure Get_Next_Data; Block_Size : constant := 512; Pkt_Len : Natural; -- Length in byte of the last tftp data packet Tftp_File_Offset : Unsigned_32; -- Offset in the file of the last tftp data packet Blk_Num : Unsigned_16; -- Block number of the last received data packet (also the packet to ack) procedure Open is Rcv : Rcv_Status; Rq : Unsigned_16; B : Unsigned_8; Mode_Off : Natural; Octet : constant Netbuf := (Character'Pos ('o'), Character'Pos ('c'), Character'Pos ('t'), Character'Pos ('e'), Character'Pos ('t')); begin My_Udp_Port := 69; loop -- Accept request from anyone Netcfg.Srv_Ip_Addr := Null_Ip_Addr; -- Wait for a packet Eth_Rcv_Wait; Rcv := Handle_Eth_Packet; if Rcv = Rcv_Udp then if Packet_Len - Packet_Off >= 4 then Rq := Read_BE2 (Packet_Off); Packet_Off := Packet_Off + 2; if Rq = 2 then Put ("Got write request for: "); while Packet_Off < Packet_Len loop B := Packet (Packet_Off); Packet_Off := Packet_Off + 1; exit when B = 0; Put (Character'Val (B)); end loop; Put (", mode: "); Mode_Off := Packet_Off; while Packet_Off < Packet_Len loop B := Packet (Packet_Off); Packet_Off := Packet_Off + 1; exit when B = 0; Put (Character'Val (B)); end loop; New_Line; if Packet (Mode_Off .. Packet_Off - 2) = Octet then exit; else Put_Line ("not octet mode"); end if; Dump_Pkt (Packet_Off); else Put_Line ("Unhandled request"); Dump_Pkt (Packet_Off); end if; end if; end if; end loop; Route_To_Server; if Netcfg.Srv_Eth_Addr = Null_Eth_Addr then Put_Line ("Cannot route to server"); return; end if; My_Udp_Port := 49200; Pkt_Len := Block_Size; Blk_Num := 0; Get_Next_Data; Tftp_File_Offset := 0; end Open; procedure Send_Ack is Off : Natural; begin if False then Put ("tftp: ack "); Put_Hex (Blk_Num); New_Line; end if; Prepare_Udp (Off); -- Ack Write_BE2 (4); Write_BE2 (Blk_Num); Send_Udp (Off); end Send_Ack; procedure Get_Next_Data is Rcv : Rcv_Status; Rq : Unsigned_16; begin Send_Ack; loop -- Wait for a packet Eth_Rcv_Wait; Rcv := Handle_Eth_Packet; if Rcv = Rcv_Udp and then Packet_Len - Packet_Off >= 4 then Rq := Read_BE2 (Packet_Off); Packet_Off := Packet_Off + 2; if Rq = 3 then if Read_BE2 (Packet_Off) /= Blk_Num + 1 then Put ("Out of sync, got: "); Put_Hex (Read_BE2 (Packet_Off)); Put (", next is "); Put_Hex (Blk_Num + 1); New_Line; else Packet_Off := Packet_Off + 2; Pkt_Len := Packet_Len - Packet_Off; if False then Put ("Got "); Put_Dec (Unsigned_16 (Pkt_Len)); Put_Line (" bytes"); end if; Blk_Num := Blk_Num + 1; return; end if; else Put ("Got unhandled op: "); Put_Hex (Rq); New_Line; end if; end if; end loop; end Get_Next_Data; procedure Read (Off : Unsigned_32; Data : Address; Count : in out Natural) is Res : Natural; Pkt_Off : Natural; begin if Off < Tftp_File_Offset then -- Cannot rewind Put_Line ("tftp: cannot rewind"); Count := 0; return; end if; -- Skip data while Off >= Tftp_File_Offset + Unsigned_32 (Pkt_Len) loop if Pkt_Len < Block_Size then Count := 0; return; end if; Tftp_File_Offset := Tftp_File_Offset + Unsigned_32 (Pkt_Len); Get_Next_Data; end loop; Pkt_Off := Natural (Off - Tftp_File_Offset); Res := Pkt_Len - Pkt_Off; if Res > Count then Res := Count; end if; if False then Put ("tftp read: off="); Put_Dec (Unsigned_16 (Off)); Put ("/"); Put_Dec (Unsigned_16 (Tftp_File_Offset)); Put (" pkt_off="); Put_Dec (Unsigned_16 (Packet_Off)); Put ("+"); Put_Dec (Unsigned_16 (Pkt_Off)); Put (" res="); Put_Dec (Unsigned_16 (Res)); New_Line; end if; Memory_Copy.memcpy (Data, Packet (Packet_Off + Pkt_Off)'Address, C.size_t (Res)); Count := Res; end Read; procedure Close is begin Put_Line ("closing"); while Pkt_Len = Block_Size loop Get_Next_Data; end loop; Send_Ack; end Close; end Nettftp;

33.46888

78

0.471733

31336e08d9991466a986119f7243d5401d84498b

2,574

ads

Ada

stm32f0/stm32f051x/svd/stm32_svd-interrupts.ads

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

1

2021-04-06T07:57:56.000Z

stm32f0/stm32f051x/svd/stm32_svd-interrupts.ads

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

null

stm32f0/stm32f051x/svd/stm32_svd-interrupts.ads

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

2

2018-05-29T13:59:31.000Z

2019-02-03T19:48:08.000Z

-- This spec has been automatically generated from STM32F0xx.svd -- Definition of the device's interrupts package STM32_SVD.Interrupts is ---------------- -- Interrupts -- ---------------- -- Window Watchdog interrupt WWDG : constant := 0; -- PVD through EXTI line detection PVD : constant := 1; -- RTC global interrupt RTC : constant := 2; -- Flash global interrupt FLASH : constant := 3; -- RCC global interrupt RCC : constant := 4; -- EXTI Line[1:0] interrupts EXTI0_1 : constant := 5; -- EXTI Line[3:2] interrupts EXTI2_3 : constant := 6; -- EXTI Line15 and EXTI4 interrupts EXTI4_15 : constant := 7; -- Touch sensing interrupt TSC : constant := 8; -- DMA channel 1 interrupt DMA_CH1 : constant := 9; -- DMA channel 2 and 3 interrupts DMA_CH2_3 : constant := 10; -- DMA channel 4 and 5 interrupts DMA_CH4_5 : constant := 11; -- ADC and comparator 1 and 2 ADC_COMP : constant := 12; -- TIM1 Break, update, trigger and TIM1_BRK_UP : constant := 13; -- TIM1 Capture Compare interrupt TIM1_CC : constant := 14; -- TIM2 global interrupt TIM2 : constant := 15; -- TIM3 global interrupt TIM3 : constant := 16; -- TIM6 global interrupt and DAC TIM6_DAC : constant := 17; -- TIM14 global interrupt TIM14 : constant := 19; -- TIM15 global interrupt TIM15 : constant := 20; -- TIM16 global interrupt TIM16 : constant := 21; -- TIM17 global interrupt TIM17 : constant := 22; -- I2C1 global interrupt I2C1 : constant := 23; -- I2C2 global interrupt I2C2 : constant := 24; -- SPI1_global_interrupt SPI1 : constant := 25; -- SPI2 global interrupt SPI2 : constant := 26; -- USART1 global interrupt USART1 : constant := 27; -- USART2 global interrupt USART2 : constant := 28; -- CEC global interrupt CEC : constant := 30; end STM32_SVD.Interrupts;

26.265306

65

0.468143

502e6c591b077da42bb9c4d64006c9b2ac92ea43

12,328

adb

Ada

.emacs.d/elpa/ada-ref-man-2012.5/progs/arm_db.adb

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

.emacs.d/elpa/ada-ref-man-2012.5/progs/arm_db.adb

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

.emacs.d/elpa/ada-ref-man-2012.5/progs/arm_db.adb

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

-- with Ada.Text_IO; -- Debug. with Ada.Unchecked_Deallocation, Ada.Strings.Fixed, Ada.Characters.Handling; package body ARM_Database is -- -- Ada reference manual formatter (ARM_Form). -- -- This package contains the database to store items for non-normative -- appendixes. -- -- --------------------------------------- -- Copyright 2000, 2004, 2005, 2006, 2009, 2011, 2012 -- AXE Consultants. All rights reserved. -- P.O. Box 1512, Madison WI 53701 -- E-Mail: [email protected] -- -- ARM_Form is free software: you can redistribute it and/or modify -- it under the terms of the GNU General Public License version 3 -- as published by the Free Software Foundation. -- -- AXE CONSULTANTS MAKES THIS TOOL AND SOURCE CODE AVAILABLE ON AN "AS IS" -- BASIS AND MAKES NO WARRANTY, EXPRESS OR IMPLIED, AS TO THE ACCURACY, -- CAPABILITY, EFFICIENCY, MERCHANTABILITY, OR FUNCTIONING OF THIS TOOL. -- IN NO EVENT WILL AXE CONSULTANTS BE LIABLE FOR ANY GENERAL, -- CONSEQUENTIAL, INDIRECT, INCIDENTAL, EXEMPLARY, OR SPECIAL DAMAGES, -- EVEN IF AXE CONSULTANTS HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH -- DAMAGES. -- -- A copy of the GNU General Public License is available in the file -- gpl-3-0.txt in the standard distribution of the ARM_Form tool. -- Otherwise, see <http://www.gnu.org/licenses/>. -- -- If the GPLv3 license is not satisfactory for your needs, a commercial -- use license is available for this tool. Contact Randy at AXE Consultants -- for more information. -- -- --------------------------------------- -- -- Edit History: -- -- 5/16/00 - RLB - Created package. -- 8/28/00 - RLB - Added revision info to database. -- 10/28/04 - RLB - Added Inserted_Normal_Number change kind. -- 11/02/04 - RLB - Added Deleted_Inserted_Number change kind. -- 12/06/04 - RLB - Added Revised_Inserted_Number change kind. -- 12/14/04 - RLB - Made the hang item bigger. -- 1/19/05 - RLB - Added Added_Version. -- 10/17/05 - RLB - Fixed indexing of the Glossary. -- 10/18/06 - RLB - Added No_Deleted_Paragraph_Messages to Report. -- 11/30/09 - RLB - Made the hang item bigger again (to make room to -- handle commands like @ChgAdded). -- 10/18/11 - RLB - Changed to GPLv3 license. -- 10/20/11 - RLB - Added Initial_Version parameter. -- 3/19/12 - RLB - Added code to suppress indexing of deleted glossary items. type String_Ptr is access String; type Item is record Next : Item_List; Sort_Key : String(1 .. 50); Hang : String(1 .. 75); Hang_Len : Natural; Text : String_Ptr; Change_Kind : Paragraph_Change_Kind_Type; Version : Character; Initial_Version : Character; end record; procedure Free is new Ada.Unchecked_Deallocation (Item, Item_List); procedure Free is new Ada.Unchecked_Deallocation (String, String_Ptr); procedure Create (Database_Object : in out Database_Type) is -- Initialize a database object. begin Database_Object.Is_Valid := True; Database_Object.List := null; Database_Object.Item_Count := 0; end Create; procedure Destroy (Database_Object : in out Database_Type) is -- Destroy a database object, freeing any resources used. Temp : Item_List; begin if not Database_Object.Is_Valid then raise Not_Valid_Error; end if; while Database_Object.List /= null loop Temp := Database_Object.List; Database_Object.List := Temp.Next; Free (Temp.Text); Free (Temp); end loop; Database_Object.Is_Valid := False; end Destroy; procedure Insert (Database_Object : in out Database_Type; Sort_Key : in String; Hang_Item : in String; Text : in String; Change_Kind : in Paragraph_Change_Kind_Type := ARM_Database.None; Version : in Character := '0'; Initial_Version : in Character := '0') is -- Insert an item into the database object. -- Sort_Key is the string on which this item will be sorted (if it -- is sorted). Hang_Item is the item which hangs out for the item -- in the report (if any). Text is the text for the item; the text -- may include formatting codes. Change_Kind and Version are the -- revision status for this item. Initial_Version is the version of -- the initial text for this item. Temp_Item : Item; begin if not Database_Object.Is_Valid then raise Not_Valid_Error; end if; Ada.Strings.Fixed.Move (Target => Temp_Item.Sort_Key, Source => Ada.Characters.Handling.To_Lower(Sort_Key), Drop => Ada.Strings.Right, Pad => ' '); Ada.Strings.Fixed.Move (Target => Temp_Item.Hang, Source => Hang_Item, Drop => Ada.Strings.Error, Pad => ' '); Temp_Item.Hang_Len := Hang_Item'Length; -- Note: If this second item doesn't fit, we error so we can make -- the size larger. Temp_Item.Text := new String'(Text); Temp_Item.Change_Kind := Change_Kind; Temp_Item.Version := Version; Temp_Item.Initial_Version := Initial_Version; Temp_Item.Next := Database_Object.List; Database_Object.List := new Item'(Temp_Item); Database_Object.Item_Count := Database_Object.Item_Count + 1; end Insert; --generic -- with procedure Format_Text (Text : in String; -- Text_Name : in String); procedure Report (Database_Object : in out Database_Type; In_Format : in Format_Type; Sorted : in Boolean; Added_Version : Character := '0'; No_Deleted_Paragraph_Messages : in Boolean := False) is -- Output the items with the appropriate format to the -- "Format_Text" routine. "Format_Text" allows all commands -- for the full formatter. (Text_Name is an identifying name -- for error messages). This is an added list for Added_Version -- ('0' meaning it is not added); in that case, use normal numbers -- for items with a version less than or equal to Added_Version. -- (This is intended to be used to output the items to -- appropriate Format and Output objects; but we can't do that -- directly because that would make this unit recursive with -- ARM_Format. -- No paragraphs will be have deleted paragraph messages if -- No_Deleted_Paragraph_Messages is True. Temp : Item_List; function Change_if_Needed (Item : in Item_List) return String is begin -- Note: In the report, we always decide inserted/not inserted -- as determined by the initial version number, and not the -- original class. case Item.Change_Kind is when None => return ""; when Inserted | Inserted_Normal_Number => if Item.Initial_Version <= Added_Version then return "@ChgRef{Version=[" & Item.Version & "],Kind=[AddedNormal]}"; else return "@ChgRef{Version=[" & Item.Version & "],Kind=[Added]}"; end if; when Revised | Revised_Inserted_Number => if Item.Initial_Version <= Added_Version then return "@ChgRef{Version=[" & Item.Version & "],Kind=[Revised]}"; else return "@ChgRef{Version=[" & Item.Version & "],Kind=[RevisedAdded]}"; end if; when Deleted | Deleted_Inserted_Number => if Item.Initial_Version <= Added_Version then if No_Deleted_Paragraph_Messages then return "@ChgRef{Version=[" & Item.Version & "],Kind=[DeletedNoDelMsg]}"; else return "@ChgRef{Version=[" & Item.Version & "],Kind=[Deleted]}"; end if; else if No_Deleted_Paragraph_Messages then return "@ChgRef{Version=[" & Item.Version & "],Kind=[DeletedAddedNoDelMsg]}"; else return "@ChgRef{Version=[" & Item.Version & "],Kind=[DeletedAdded]}"; end if; end if; when Deleted_No_Delete_Message | Deleted_Inserted_Number_No_Delete_Message => if Item.Initial_Version <= Added_Version then return "@ChgRef{Version=[" & Item.Version & "],Kind=[DeletedNoDelMsg]}"; else return "@ChgRef{Version=[" & Item.Version & "],Kind=[DeletedAddedNoDelMsg]}"; end if; end case; end Change_if_Needed; begin if not Database_Object.Is_Valid then raise Not_Valid_Error; end if; if Sorted then declare Items : array (1..Database_Object.Item_Count) of Item_List; begin -- Load the items: Temp := Database_Object.List; for I in Items'range loop Items(I) := Temp; Temp := Temp.Next; end loop; -- Sort the items array (use an insertion sort because it is -- stable): declare Left : Natural; -- Left sorting stop begin for Right In Items'First+1 .. Items'Last loop -- Right sorting stop Temp := Items(Right); Left := Right - 1; while Temp.Sort_Key <= Items(Left).Sort_Key loop -- Switch items Items(Left + 1) := Items(Left); Left := Left - 1; exit when Left = 0; end loop; Items(Left + 1) := Temp; end loop; end; -- Relink the items in the sorted order: for I in Items'First .. Items'Last - 1 loop Items(I).Next := Items(I+1); end loop; if Items'Length > 0 then Items(Items'Last).Next := null; Database_Object.List := Items(1); else Database_Object.List := null; end if; end; end if; case In_Format is when Hanging_List => Format_Text ("@begin(description)" & Ascii.LF, "Prefix"); Temp := Database_Object.List; while Temp /= null loop --** Debug: --Ada.Text_IO.Put_Line ("^^ " & Paragraph_Change_Kind_Type'Image(Temp.Change_Kind) & -- " for " & Temp.Hang(1..Temp.Hang_Len) & " ref=" & Change_if_Needed (Temp)); --Ada.Text_IO.Put_Line (" " & Change_if_Needed (Temp) & --Temp.Hang(1..Temp.Hang_Len) & "@\" & --Temp.Text.all & Ascii.LF & Ascii.LF); Format_Text (Change_if_Needed (Temp) & Temp.Hang(1..Temp.Hang_Len) & "@\" & Temp.Text.all & Ascii.LF & Ascii.LF, Temp.Sort_Key); Temp := Temp.Next; end loop; Format_Text ("@end(description)" & Ascii.LF, "Suffix"); when Bullet_List => Format_Text ("@begin(itemize)" & Ascii.LF, "Prefix"); Temp := Database_Object.List; while Temp /= null loop Format_Text (Change_if_Needed (Temp) & Temp.Text.all & Ascii.LF & Ascii.LF, Temp.Sort_Key); Temp := Temp.Next; end loop; Format_Text ("@end(itemize)" & Ascii.LF, "Suffix"); when Normal_List => Format_Text ("@begin(intro)" & Ascii.LF, "Prefix"); Temp := Database_Object.List; while Temp /= null loop Format_Text (Change_if_Needed (Temp) & Temp.Text.all & Ascii.LF & Ascii.LF, Temp.Sort_Key); Temp := Temp.Next; end loop; Format_Text ("@end(intro)" & Ascii.LF, "Suffix"); when Normal_Indexed_List => Format_Text ("@begin(intro)" & Ascii.LF, "Prefix"); Temp := Database_Object.List; while Temp /= null loop case Temp.Change_Kind is when None | Inserted | Inserted_Normal_Number | Revised | Revised_Inserted_Number => --** Debug: --Ada.Text_IO.Put_Line("Format " & Change_if_Needed (Temp) & -- "@defn{" & Ada.Strings.Fixed.Trim (Temp.Sort_Key, Ada.Strings.Right) & "}" & Ascii.LF & -- Temp.Text.all); -- Index this item. Format_Text (Change_if_Needed (Temp) & "@defn{" & Ada.Strings.Fixed.Trim (Temp.Sort_Key, Ada.Strings.Right) & "}" & Ascii.LF & Temp.Text.all & Ascii.LF & Ascii.LF, Temp.Sort_Key); when Deleted | Deleted_Inserted_Number | Deleted_No_Delete_Message | Deleted_Inserted_Number_No_Delete_Message => --** Debug: --Ada.Text_IO.Put_Line("Format " & Change_if_Needed (Temp) & Ascii.LF & -- Temp.Text.all); -- Don't index deleted items. Format_Text (Change_if_Needed (Temp) & Ascii.LF & Temp.Text.all & Ascii.LF & Ascii.LF, Temp.Sort_Key); end case; Temp := Temp.Next; end loop; Format_Text ("@end(intro)" & Ascii.LF, "Suffix"); end case; end Report; end ARM_Database;

37.585366

99

0.629299

504b07d4faf972e87edc9f9c53340264a6f42750

4,167

adb

Ada

Ada95/src/terminal_interface-curses-panels-user_data.adb

neverware-mirrors/ncurses

931939e0d2765af13962820e59cb6629df3ee638

[ "X11" ]

269

2015-03-01T21:34:42.000Z

2022-03-30T23:07:18.000Z

Ada95/src/terminal_interface-curses-panels-user_data.adb

neverware-mirrors/ncurses

931939e0d2765af13962820e59cb6629df3ee638

[ "X11" ]

3

2020-10-09T15:00:37.000Z

2020-10-09T15:05:19.000Z

Ada95/src/terminal_interface-curses-panels-user_data.adb

neverware-mirrors/ncurses

931939e0d2765af13962820e59cb6629df3ee638

[ "X11" ]

97

2016-04-25T06:22:54.000Z

2022-03-30T23:07:19.000Z

------------------------------------------------------------------------------ -- -- -- GNAT ncurses Binding -- -- -- -- Terminal_Interface.Curses.Panels.User_Data -- -- -- -- B O D Y -- -- -- ------------------------------------------------------------------------------ -- Copyright 2020 Thomas E. Dickey -- -- Copyright 1999-2003,2009 Free Software Foundation, Inc. -- -- -- -- Permission is hereby granted, free of charge, to any person obtaining a -- -- copy of this software and associated documentation files (the -- -- "Software"), to deal in the Software without restriction, including -- -- without limitation the rights to use, copy, modify, merge, publish, -- -- distribute, distribute with modifications, sublicense, and/or sell -- -- copies of the Software, and to permit persons to whom the Software is -- -- furnished to do so, subject to the following conditions: -- -- -- -- The above copyright notice and this permission notice shall be included -- -- in all copies or substantial portions of the Software. -- -- -- -- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -- -- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -- -- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. -- -- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -- -- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -- -- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR -- -- THE USE OR OTHER DEALINGS IN THE SOFTWARE. -- -- -- -- Except as contained in this notice, the name(s) of the above copyright -- -- holders shall not be used in advertising or otherwise to promote the -- -- sale, use or other dealings in this Software without prior written -- -- authorization. -- ------------------------------------------------------------------------------ -- Author: Juergen Pfeifer, 1996 -- Version Control: -- $Revision: 1.13 $ -- Binding Version 01.00 ------------------------------------------------------------------------------ with Interfaces.C; with Terminal_Interface.Curses.Aux; use Terminal_Interface.Curses.Aux; with Terminal_Interface.Curses.Panels; use Terminal_Interface.Curses.Panels; package body Terminal_Interface.Curses.Panels.User_Data is use type Interfaces.C.int; procedure Set_User_Data (Pan : Panel; Data : User_Access) is function Set_Panel_Userptr (Pan : Panel; Addr : User_Access) return C_Int; pragma Import (C, Set_Panel_Userptr, "set_panel_userptr"); begin if Set_Panel_Userptr (Pan, Data) = Curses_Err then raise Panel_Exception; end if; end Set_User_Data; function Get_User_Data (Pan : Panel) return User_Access is function Panel_Userptr (Pan : Panel) return User_Access; pragma Import (C, Panel_Userptr, "panel_userptr"); begin return Panel_Userptr (Pan); end Get_User_Data; procedure Get_User_Data (Pan : Panel; Data : out User_Access) is begin Data := Get_User_Data (Pan); end Get_User_Data; end Terminal_Interface.Curses.Panels.User_Data;

52.0875

78

0.478522

a1558f8e1f2d5c7585019205b20ab9276e737943

360,354

adb

Ada

Vivado_HLS_Tutorial/Design_Analysis/lab1/dct_prj/solution3/.autopilot/db/dct_dct_1d.adb

williambong/Vivado

68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb

[ "MIT" ]

null

Vivado_HLS_Tutorial/Design_Analysis/lab1/dct_prj/solution3/.autopilot/db/dct_dct_1d.adb

williambong/Vivado

68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb

[ "MIT" ]

null

Vivado_HLS_Tutorial/Design_Analysis/lab1/dct_prj/solution3/.autopilot/db/dct_dct_1d.adb

williambong/Vivado

68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb

[ "MIT" ]

null

<?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>dct_dct_1d</name> <ret_bitwidth>0</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="3" tracking_level="1" version="0" object_id="_1"> <Value class_id="4" tracking_level="0" version="0"> <Obj class_id="5" tracking_level="0" version="0"> <type>1</type> <id>1</id> <name>src</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>src</originalName> <rtlName/> <coreName>RAM</coreName> </Obj> <bitwidth>16</bitwidth> </Value> <direction>0</direction> <if_type>1</if_type> <array_size>64</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>tmp_1</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <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>dst</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>dst</originalName> <rtlName/> <coreName>RAM</coreName> </Obj> <bitwidth>16</bitwidth> </Value> <direction>1</direction> <if_type>1</if_type> <array_size>64</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>tmp_11</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <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> </ports> <nodes class_id="8" tracking_level="0" version="0"> <count>105</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_5"> <Value> <Obj> <type>0</type> <id>13</id> <name>tmp_11_read</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>128</item> <item>129</item> </oprand_edges> <opcode>read</opcode> </item> <item class_id_reference="9" object_id="_6"> <Value> <Obj> <type>0</type> <id>14</id> <name>tmp_1_read</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>130</item> <item>131</item> </oprand_edges> <opcode>read</opcode> </item> <item class_id_reference="9" object_id="_7"> <Value> <Obj> <type>0</type> <id>15</id> <name>tmp_5</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName>tmp_5_fu_286_p3</rtlName> <coreName/> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>133</item> <item>134</item> <item>136</item> </oprand_edges> <opcode>bitconcatenate</opcode> </item> <item class_id_reference="9" object_id="_8"> <Value> <Obj> <type>0</type> <id>16</id> <name>tmp_6</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="11" tracking_level="0" version="0"> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second class_id="12" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="13" tracking_level="0" version="0"> <first class_id="14" tracking_level="0" version="0"> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_6_fu_294_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>137</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_9"> <Value> <Obj> <type>0</type> <id>17</id> <name>src_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>6</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>138</item> <item>140</item> <item>141</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_10"> <Value> <Obj> <type>0</type> <id>18</id> <name>tmp_7</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName>tmp_7_fu_299_p2</rtlName> <coreName/> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>142</item> <item>144</item> </oprand_edges> <opcode>or</opcode> </item> <item class_id_reference="9" object_id="_11"> <Value> <Obj> <type>0</type> <id>19</id> <name>p_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_addr_fu_305_p3</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>146</item> <item>148</item> <item>149</item> </oprand_edges> <opcode>bitconcatenate</opcode> </item> <item class_id_reference="9" object_id="_12"> <Value> <Obj> <type>0</type> <id>20</id> <name>tmp_9</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_9_fu_313_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>150</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_13"> <Value> <Obj> <type>0</type> <id>21</id> <name>src_addr_1</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>6</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>151</item> <item>152</item> <item>153</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_14"> <Value> <Obj> <type>0</type> <id>22</id> <name>tmp_10</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName>tmp_10_fu_318_p2</rtlName> <coreName/> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>154</item> <item>156</item> </oprand_edges> <opcode>or</opcode> </item> <item class_id_reference="9" object_id="_15"> <Value> <Obj> <type>0</type> <id>23</id> <name>p_addr1</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_addr1_fu_324_p3</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>157</item> <item>158</item> <item>159</item> </oprand_edges> <opcode>bitconcatenate</opcode> </item> <item class_id_reference="9" object_id="_16"> <Value> <Obj> <type>0</type> <id>24</id> <name>tmp_12</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_12_fu_332_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>160</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_17"> <Value> <Obj> <type>0</type> <id>25</id> <name>src_addr_2</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>6</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>161</item> <item>162</item> <item>163</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_18"> <Value> <Obj> <type>0</type> <id>26</id> <name>tmp_13</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName>tmp_13_fu_337_p2</rtlName> <coreName/> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>164</item> <item>166</item> </oprand_edges> <opcode>or</opcode> </item> <item class_id_reference="9" object_id="_19"> <Value> <Obj> <type>0</type> <id>27</id> <name>p_addr2</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_addr2_fu_343_p3</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>167</item> <item>168</item> <item>169</item> </oprand_edges> <opcode>bitconcatenate</opcode> </item> <item class_id_reference="9" object_id="_20"> <Value> <Obj> <type>0</type> <id>28</id> <name>tmp_14</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_14_fu_351_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>170</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_21"> <Value> <Obj> <type>0</type> <id>29</id> <name>src_addr_3</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>6</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>171</item> <item>172</item> <item>173</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_22"> <Value> <Obj> <type>0</type> <id>30</id> <name>tmp_15</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName>tmp_15_fu_356_p2</rtlName> <coreName/> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>174</item> <item>176</item> </oprand_edges> <opcode>or</opcode> </item> <item class_id_reference="9" object_id="_23"> <Value> <Obj> <type>0</type> <id>31</id> <name>p_addr3</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_addr3_fu_362_p3</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>177</item> <item>178</item> <item>179</item> </oprand_edges> <opcode>bitconcatenate</opcode> </item> <item class_id_reference="9" object_id="_24"> <Value> <Obj> <type>0</type> <id>32</id> <name>tmp_16</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_16_fu_370_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>180</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_25"> <Value> <Obj> <type>0</type> <id>33</id> <name>src_addr_4</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>6</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>181</item> <item>182</item> <item>183</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_26"> <Value> <Obj> <type>0</type> <id>34</id> <name>tmp_17</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName>tmp_17_fu_375_p2</rtlName> <coreName/> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>184</item> <item>186</item> </oprand_edges> <opcode>or</opcode> </item> <item class_id_reference="9" object_id="_27"> <Value> <Obj> <type>0</type> <id>35</id> <name>p_addr4</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_addr4_fu_381_p3</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>187</item> <item>188</item> <item>189</item> </oprand_edges> <opcode>bitconcatenate</opcode> </item> <item class_id_reference="9" object_id="_28"> <Value> <Obj> <type>0</type> <id>36</id> <name>tmp_18</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_18_fu_389_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>190</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_29"> <Value> <Obj> <type>0</type> <id>37</id> <name>src_addr_5</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>6</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>191</item> <item>192</item> <item>193</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_30"> <Value> <Obj> <type>0</type> <id>38</id> <name>tmp_19</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName>tmp_19_fu_394_p2</rtlName> <coreName/> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>194</item> <item>196</item> </oprand_edges> <opcode>or</opcode> </item> <item class_id_reference="9" object_id="_31"> <Value> <Obj> <type>0</type> <id>39</id> <name>p_addr5</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_addr5_fu_400_p3</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>197</item> <item>198</item> <item>199</item> </oprand_edges> <opcode>bitconcatenate</opcode> </item> <item class_id_reference="9" object_id="_32"> <Value> <Obj> <type>0</type> <id>40</id> <name>tmp_20</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_20_fu_408_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>200</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_33"> <Value> <Obj> <type>0</type> <id>41</id> <name>src_addr_6</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>6</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>201</item> <item>202</item> <item>203</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_34"> <Value> <Obj> <type>0</type> <id>42</id> <name>tmp_21</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName>tmp_21_fu_413_p2</rtlName> <coreName/> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>204</item> <item>206</item> </oprand_edges> <opcode>or</opcode> </item> <item class_id_reference="9" object_id="_35"> <Value> <Obj> <type>0</type> <id>43</id> <name>p_addr6</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_addr6_fu_419_p3</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>207</item> <item>208</item> <item>209</item> </oprand_edges> <opcode>bitconcatenate</opcode> </item> <item class_id_reference="9" object_id="_36"> <Value> <Obj> <type>0</type> <id>44</id> <name>tmp_22</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_22_fu_427_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>210</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_37"> <Value> <Obj> <type>0</type> <id>45</id> <name>src_addr_7</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>6</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>211</item> <item>212</item> <item>213</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_38"> <Value> <Obj> <type>0</type> <id>46</id> <name>tmp_23</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName>tmp_23_fu_432_p3</rtlName> <coreName/> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>214</item> <item>215</item> <item>216</item> </oprand_edges> <opcode>bitconcatenate</opcode> </item> <item class_id_reference="9" object_id="_39"> <Value> <Obj> <type>0</type> <id>47</id> <name>p_addr16_cast</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_addr16_cast_fu_440_p1</rtlName> <coreName/> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>217</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_40"> <Value> <Obj> <type>0</type> <id>48</id> <name/> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>218</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_41"> <Value> <Obj> <type>0</type> <id>50</id> <name>k</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>k</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>220</item> <item>221</item> <item>222</item> <item>223</item> </oprand_edges> <opcode>phi</opcode> </item> <item class_id_reference="9" object_id="_42"> <Value> <Obj> <type>0</type> <id>51</id> <name>exitcond1</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>exitcond1_fu_444_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>224</item> <item>226</item> </oprand_edges> <opcode>icmp</opcode> </item> <item class_id_reference="9" object_id="_43"> <Value> <Obj> <type>0</type> <id>52</id> <name>k_1</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName>k</originalName> <rtlName>k_1_fu_450_p2</rtlName> <coreName/> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>227</item> <item>229</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_44"> <Value> <Obj> <type>0</type> <id>53</id> <name/> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>230</item> <item>231</item> <item>232</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_45"> <Value> <Obj> <type>0</type> <id>59</id> <name>tmp</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_fu_456_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>233</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_46"> <Value> <Obj> <type>0</type> <id>60</id> <name>dct_coeff_table_0_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>234</item> <item>235</item> <item>236</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_47"> <Value> <Obj> <type>0</type> <id>61</id> <name>dct_coeff_table_0_load</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>237</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_48"> <Value> <Obj> <type>0</type> <id>62</id> <name>coeff_cast</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>grp_fu_592_p10</rtlName> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>238</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_49"> <Value> <Obj> <type>0</type> <id>63</id> <name>src_load</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>239</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_50"> <Value> <Obj> <type>0</type> <id>64</id> <name>tmp_7_cast</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>240</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_51"> <Value> <Obj> <type>0</type> <id>65</id> <name>tmp_8</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>dct_mac_muladd_16s_14ns_29s_29_1_U3</rtlName> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>241</item> <item>242</item> </oprand_edges> <opcode>mul</opcode> </item> <item class_id_reference="9" object_id="_52"> <Value> <Obj> <type>0</type> <id>66</id> <name>dct_coeff_table_1_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>3</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="_53"> <Value> <Obj> <type>0</type> <id>67</id> <name>dct_coeff_table_1_load</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>246</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_54"> <Value> <Obj> <type>0</type> <id>68</id> <name>coeff_1_cast</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>247</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_55"> <Value> <Obj> <type>0</type> <id>69</id> <name>src_load_1</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>248</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_56"> <Value> <Obj> <type>0</type> <id>70</id> <name>tmp_7_1_cast</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>249</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_57"> <Value> <Obj> <type>0</type> <id>71</id> <name>tmp_8_1</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_8_1_fu_477_p2</rtlName> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>250</item> <item>251</item> </oprand_edges> <opcode>mul</opcode> </item> <item class_id_reference="9" object_id="_58"> <Value> <Obj> <type>0</type> <id>72</id> <name>dct_coeff_table_2_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>252</item> <item>253</item> <item>254</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_59"> <Value> <Obj> <type>0</type> <id>73</id> <name>dct_coeff_table_2_load</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>255</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_60"> <Value> <Obj> <type>0</type> <id>74</id> <name>coeff_2_cast</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>256</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_61"> <Value> <Obj> <type>0</type> <id>75</id> <name>src_load_2</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>257</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_62"> <Value> <Obj> <type>0</type> <id>76</id> <name>tmp_7_2_cast</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>258</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_63"> <Value> <Obj> <type>0</type> <id>77</id> <name>tmp_8_2</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>dct_mac_muladd_16s_15s_29s_29_1_U0</rtlName> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>259</item> <item>260</item> </oprand_edges> <opcode>mul</opcode> </item> <item class_id_reference="9" object_id="_64"> <Value> <Obj> <type>0</type> <id>78</id> <name>dct_coeff_table_3_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>261</item> <item>262</item> <item>263</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_65"> <Value> <Obj> <type>0</type> <id>79</id> <name>dct_coeff_table_3_load</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>264</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_66"> <Value> <Obj> <type>0</type> <id>80</id> <name>coeff_3_cast</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>265</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_67"> <Value> <Obj> <type>0</type> <id>81</id> <name>src_load_3</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>266</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_68"> <Value> <Obj> <type>0</type> <id>82</id> <name>tmp_7_3_cast</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>267</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_69"> <Value> <Obj> <type>0</type> <id>83</id> <name>tmp_8_3</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_8_3_fu_497_p2</rtlName> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>268</item> <item>269</item> </oprand_edges> <opcode>mul</opcode> </item> <item class_id_reference="9" object_id="_70"> <Value> <Obj> <type>0</type> <id>84</id> <name>dct_coeff_table_4_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>270</item> <item>271</item> <item>272</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_71"> <Value> <Obj> <type>0</type> <id>85</id> <name>dct_coeff_table_4_load</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>273</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_72"> <Value> <Obj> <type>0</type> <id>86</id> <name>coeff_4_cast</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>274</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_73"> <Value> <Obj> <type>0</type> <id>87</id> <name>src_load_4</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>275</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_74"> <Value> <Obj> <type>0</type> <id>88</id> <name>tmp_7_4_cast</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>276</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_75"> <Value> <Obj> <type>0</type> <id>89</id> <name>tmp_8_4</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>dct_mac_muladd_16s_15s_29s_29_1_U1</rtlName> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>277</item> <item>278</item> </oprand_edges> <opcode>mul</opcode> </item> <item class_id_reference="9" object_id="_76"> <Value> <Obj> <type>0</type> <id>90</id> <name>dct_coeff_table_5_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>279</item> <item>280</item> <item>281</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_77"> <Value> <Obj> <type>0</type> <id>91</id> <name>dct_coeff_table_5_load</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>282</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_78"> <Value> <Obj> <type>0</type> <id>92</id> <name>coeff_5_cast</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>283</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_79"> <Value> <Obj> <type>0</type> <id>93</id> <name>src_load_5</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>16</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="_80"> <Value> <Obj> <type>0</type> <id>94</id> <name>tmp_7_5_cast</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>285</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_81"> <Value> <Obj> <type>0</type> <id>95</id> <name>tmp_8_5</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_8_5_fu_516_p2</rtlName> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>286</item> <item>287</item> </oprand_edges> <opcode>mul</opcode> </item> <item class_id_reference="9" object_id="_82"> <Value> <Obj> <type>0</type> <id>96</id> <name>dct_coeff_table_6_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>288</item> <item>289</item> <item>290</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_83"> <Value> <Obj> <type>0</type> <id>97</id> <name>dct_coeff_table_6_load</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>291</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_84"> <Value> <Obj> <type>0</type> <id>98</id> <name>coeff_6_cast</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>292</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_85"> <Value> <Obj> <type>0</type> <id>99</id> <name>src_load_6</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>293</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_86"> <Value> <Obj> <type>0</type> <id>100</id> <name>tmp_7_6_cast</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>294</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_87"> <Value> <Obj> <type>0</type> <id>101</id> <name>tmp_8_6</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>dct_mac_muladd_16s_15s_29s_29_1_U2</rtlName> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>295</item> <item>296</item> </oprand_edges> <opcode>mul</opcode> </item> <item class_id_reference="9" object_id="_88"> <Value> <Obj> <type>0</type> <id>102</id> <name>dct_coeff_table_7_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>297</item> <item>298</item> <item>299</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_89"> <Value> <Obj> <type>0</type> <id>103</id> <name>dct_coeff_table_7_load</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>300</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_90"> <Value> <Obj> <type>0</type> <id>104</id> <name>coeff_7_cast</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>301</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_91"> <Value> <Obj> <type>0</type> <id>105</id> <name>src_load_7</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>302</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_92"> <Value> <Obj> <type>0</type> <id>106</id> <name>tmp_7_7_cast</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>303</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_93"> <Value> <Obj> <type>0</type> <id>107</id> <name>tmp_8_7</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>dct_mac_muladd_16s_15s_14ns_29_1_U4</rtlName> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>304</item> <item>305</item> </oprand_edges> <opcode>mul</opcode> </item> <item class_id_reference="9" object_id="_94"> <Value> <Obj> <type>0</type> <id>108</id> <name>tmp2</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>dct_mac_muladd_16s_14ns_29s_29_1_U3</rtlName> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>306</item> <item>307</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_95"> <Value> <Obj> <type>0</type> <id>109</id> <name>tmp3</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>dct_mac_muladd_16s_15s_29s_29_1_U0</rtlName> <coreName/> </Obj> <bitwidth>29</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="_96"> <Value> <Obj> <type>0</type> <id>110</id> <name>tmp1</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp1_fu_522_p2</rtlName> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>310</item> <item>311</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_97"> <Value> <Obj> <type>0</type> <id>111</id> <name>tmp5</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>dct_mac_muladd_16s_15s_29s_29_1_U1</rtlName> <coreName/> </Obj> <bitwidth>29</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="_98"> <Value> <Obj> <type>0</type> <id>112</id> <name>tmp7</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>dct_mac_muladd_16s_15s_14ns_29_1_U4</rtlName> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>314</item> <item>316</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_99"> <Value> <Obj> <type>0</type> <id>113</id> <name>tmp6</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>dct_mac_muladd_16s_15s_29s_29_1_U2</rtlName> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>317</item> <item>318</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_100"> <Value> <Obj> <type>0</type> <id>114</id> <name>tmp4</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp4_fu_546_p2</rtlName> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>319</item> <item>320</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_101"> <Value> <Obj> <type>0</type> <id>115</id> <name>tmp_2</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_2_fu_550_p2</rtlName> <coreName/> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>321</item> <item>322</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_102"> <Value> <Obj> <type>0</type> <id>116</id> <name>tmp_4</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_4_reg_798</rtlName> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>324</item> <item>325</item> <item>327</item> <item>329</item> </oprand_edges> <opcode>partselect</opcode> </item> <item class_id_reference="9" object_id="_103"> <Value> <Obj> <type>0</type> <id>117</id> <name>tmp_trn_cast</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_trn_cast_fu_461_p1</rtlName> <coreName/> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>330</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_104"> <Value> <Obj> <type>0</type> <id>118</id> <name>p_addr7</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_addr7_fu_465_p2</rtlName> <coreName/> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>331</item> <item>332</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_105"> <Value> <Obj> <type>0</type> <id>119</id> <name>tmp_24</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_24_fu_565_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>333</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_106"> <Value> <Obj> <type>0</type> <id>120</id> <name>dst_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>6</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>334</item> <item>335</item> <item>336</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_107"> <Value> <Obj> <type>0</type> <id>121</id> <name/> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>337</item> <item>338</item> </oprand_edges> <opcode>store</opcode> </item> <item class_id_reference="9" object_id="_108"> <Value> <Obj> <type>0</type> <id>123</id> <name/> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>339</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_109"> <Value> <Obj> <type>0</type> <id>125</id> <name/> <fileName>dct.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>65</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>65</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>16</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_110"> <Value> <Obj> <type>2</type> <id>135</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>3</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_111"> <Value> <Obj> <type>2</type> <id>139</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="_112"> <Value> <Obj> <type>2</type> <id>143</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>7</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_113"> <Value> <Obj> <type>2</type> <id>147</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>25</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_114"> <Value> <Obj> <type>2</type> <id>155</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>7</bitwidth> </Value> <const_type>0</const_type> <content>2</content> </item> <item class_id_reference="16" object_id="_115"> <Value> <Obj> <type>2</type> <id>165</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>7</bitwidth> </Value> <const_type>0</const_type> <content>3</content> </item> <item class_id_reference="16" object_id="_116"> <Value> <Obj> <type>2</type> <id>175</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>7</bitwidth> </Value> <const_type>0</const_type> <content>4</content> </item> <item class_id_reference="16" object_id="_117"> <Value> <Obj> <type>2</type> <id>185</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>7</bitwidth> </Value> <const_type>0</const_type> <content>5</content> </item> <item class_id_reference="16" object_id="_118"> <Value> <Obj> <type>2</type> <id>195</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>7</bitwidth> </Value> <const_type>0</const_type> <content>6</content> </item> <item class_id_reference="16" object_id="_119"> <Value> <Obj> <type>2</type> <id>205</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>7</bitwidth> </Value> <const_type>0</const_type> <content>7</content> </item> <item class_id_reference="16" object_id="_120"> <Value> <Obj> <type>2</type> <id>219</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>4</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_121"> <Value> <Obj> <type>2</type> <id>225</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>4</bitwidth> </Value> <const_type>0</const_type> <content>8</content> </item> <item class_id_reference="16" object_id="_122"> <Value> <Obj> <type>2</type> <id>228</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>4</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_123"> <Value> <Obj> <type>2</type> <id>315</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>29</bitwidth> </Value> <const_type>0</const_type> <content>4096</content> </item> <item class_id_reference="16" object_id="_124"> <Value> <Obj> <type>2</type> <id>326</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>13</content> </item> <item class_id_reference="16" object_id="_125"> <Value> <Obj> <type>2</type> <id>328</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>28</content> </item> </consts> <blocks class_id="17" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="18" tracking_level="1" version="0" object_id="_126"> <Obj> <type>3</type> <id>49</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>36</count> <item_version>0</item_version> <item>13</item> <item>14</item> <item>15</item> <item>16</item> <item>17</item> <item>18</item> <item>19</item> <item>20</item> <item>21</item> <item>22</item> <item>23</item> <item>24</item> <item>25</item> <item>26</item> <item>27</item> <item>28</item> <item>29</item> <item>30</item> <item>31</item> <item>32</item> <item>33</item> <item>34</item> <item>35</item> <item>36</item> <item>37</item> <item>38</item> <item>39</item> <item>40</item> <item>41</item> <item>42</item> <item>43</item> <item>44</item> <item>45</item> <item>46</item> <item>47</item> <item>48</item> </node_objs> </item> <item class_id_reference="18" object_id="_127"> <Obj> <type>3</type> <id>54</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>4</count> <item_version>0</item_version> <item>50</item> <item>51</item> <item>52</item> <item>53</item> </node_objs> </item> <item class_id_reference="18" object_id="_128"> <Obj> <type>3</type> <id>124</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>64</count> <item_version>0</item_version> <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>72</item> <item>73</item> <item>74</item> <item>75</item> <item>76</item> <item>77</item> <item>78</item> <item>79</item> <item>80</item> <item>81</item> <item>82</item> <item>83</item> <item>84</item> <item>85</item> <item>86</item> <item>87</item> <item>88</item> <item>89</item> <item>90</item> <item>91</item> <item>92</item> <item>93</item> <item>94</item> <item>95</item> <item>96</item> <item>97</item> <item>98</item> <item>99</item> <item>100</item> <item>101</item> <item>102</item> <item>103</item> <item>104</item> <item>105</item> <item>106</item> <item>107</item> <item>108</item> <item>109</item> <item>110</item> <item>111</item> <item>112</item> <item>113</item> <item>114</item> <item>115</item> <item>116</item> <item>117</item> <item>118</item> <item>119</item> <item>120</item> <item>121</item> <item>123</item> </node_objs> </item> <item class_id_reference="18" object_id="_129"> <Obj> <type>3</type> <id>126</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>125</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>185</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_130"> <id>129</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>13</sink_obj> </item> <item class_id_reference="20" object_id="_131"> <id>131</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>14</sink_obj> </item> <item class_id_reference="20" object_id="_132"> <id>134</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>15</sink_obj> </item> <item class_id_reference="20" object_id="_133"> <id>136</id> <edge_type>1</edge_type> <source_obj>135</source_obj> <sink_obj>15</sink_obj> </item> <item class_id_reference="20" object_id="_134"> <id>137</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>16</sink_obj> </item> <item class_id_reference="20" object_id="_135"> <id>138</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>17</sink_obj> </item> <item class_id_reference="20" object_id="_136"> <id>140</id> <edge_type>1</edge_type> <source_obj>139</source_obj> <sink_obj>17</sink_obj> </item> <item class_id_reference="20" object_id="_137"> <id>141</id> <edge_type>1</edge_type> <source_obj>16</source_obj> <sink_obj>17</sink_obj> </item> <item class_id_reference="20" object_id="_138"> <id>142</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>18</sink_obj> </item> <item class_id_reference="20" object_id="_139"> <id>144</id> <edge_type>1</edge_type> <source_obj>143</source_obj> <sink_obj>18</sink_obj> </item> <item class_id_reference="20" object_id="_140"> <id>148</id> <edge_type>1</edge_type> <source_obj>147</source_obj> <sink_obj>19</sink_obj> </item> <item class_id_reference="20" object_id="_141"> <id>149</id> <edge_type>1</edge_type> <source_obj>18</source_obj> <sink_obj>19</sink_obj> </item> <item class_id_reference="20" object_id="_142"> <id>150</id> <edge_type>1</edge_type> <source_obj>19</source_obj> <sink_obj>20</sink_obj> </item> <item class_id_reference="20" object_id="_143"> <id>151</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>21</sink_obj> </item> <item class_id_reference="20" object_id="_144"> <id>152</id> <edge_type>1</edge_type> <source_obj>139</source_obj> <sink_obj>21</sink_obj> </item> <item class_id_reference="20" object_id="_145"> <id>153</id> <edge_type>1</edge_type> <source_obj>20</source_obj> <sink_obj>21</sink_obj> </item> <item class_id_reference="20" object_id="_146"> <id>154</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>22</sink_obj> </item> <item class_id_reference="20" object_id="_147"> <id>156</id> <edge_type>1</edge_type> <source_obj>155</source_obj> <sink_obj>22</sink_obj> </item> <item class_id_reference="20" object_id="_148"> <id>158</id> <edge_type>1</edge_type> <source_obj>147</source_obj> <sink_obj>23</sink_obj> </item> <item class_id_reference="20" object_id="_149"> <id>159</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>23</sink_obj> </item> <item class_id_reference="20" object_id="_150"> <id>160</id> <edge_type>1</edge_type> <source_obj>23</source_obj> <sink_obj>24</sink_obj> </item> <item class_id_reference="20" object_id="_151"> <id>161</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_152"> <id>162</id> <edge_type>1</edge_type> <source_obj>139</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_153"> <id>163</id> <edge_type>1</edge_type> <source_obj>24</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_154"> <id>164</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>26</sink_obj> </item> <item class_id_reference="20" object_id="_155"> <id>166</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>26</sink_obj> </item> <item class_id_reference="20" object_id="_156"> <id>168</id> <edge_type>1</edge_type> <source_obj>147</source_obj> <sink_obj>27</sink_obj> </item> <item class_id_reference="20" object_id="_157"> <id>169</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>27</sink_obj> </item> <item class_id_reference="20" object_id="_158"> <id>170</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>28</sink_obj> </item> <item class_id_reference="20" object_id="_159"> <id>171</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>29</sink_obj> </item> <item class_id_reference="20" object_id="_160"> <id>172</id> <edge_type>1</edge_type> <source_obj>139</source_obj> <sink_obj>29</sink_obj> </item> <item class_id_reference="20" object_id="_161"> <id>173</id> <edge_type>1</edge_type> <source_obj>28</source_obj> <sink_obj>29</sink_obj> </item> <item class_id_reference="20" object_id="_162"> <id>174</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>30</sink_obj> </item> <item class_id_reference="20" object_id="_163"> <id>176</id> <edge_type>1</edge_type> <source_obj>175</source_obj> <sink_obj>30</sink_obj> </item> <item class_id_reference="20" object_id="_164"> <id>178</id> <edge_type>1</edge_type> <source_obj>147</source_obj> <sink_obj>31</sink_obj> </item> <item class_id_reference="20" object_id="_165"> <id>179</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>31</sink_obj> </item> <item class_id_reference="20" object_id="_166"> <id>180</id> <edge_type>1</edge_type> <source_obj>31</source_obj> <sink_obj>32</sink_obj> </item> <item class_id_reference="20" object_id="_167"> <id>181</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>33</sink_obj> </item> <item class_id_reference="20" object_id="_168"> <id>182</id> <edge_type>1</edge_type> <source_obj>139</source_obj> <sink_obj>33</sink_obj> </item> <item class_id_reference="20" object_id="_169"> <id>183</id> <edge_type>1</edge_type> <source_obj>32</source_obj> <sink_obj>33</sink_obj> </item> <item class_id_reference="20" object_id="_170"> <id>184</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>34</sink_obj> </item> <item class_id_reference="20" object_id="_171"> <id>186</id> <edge_type>1</edge_type> <source_obj>185</source_obj> <sink_obj>34</sink_obj> </item> <item class_id_reference="20" object_id="_172"> <id>188</id> <edge_type>1</edge_type> <source_obj>147</source_obj> <sink_obj>35</sink_obj> </item> <item class_id_reference="20" object_id="_173"> <id>189</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>35</sink_obj> </item> <item class_id_reference="20" object_id="_174"> <id>190</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>36</sink_obj> </item> <item class_id_reference="20" object_id="_175"> <id>191</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>37</sink_obj> </item> <item class_id_reference="20" object_id="_176"> <id>192</id> <edge_type>1</edge_type> <source_obj>139</source_obj> <sink_obj>37</sink_obj> </item> <item class_id_reference="20" object_id="_177"> <id>193</id> <edge_type>1</edge_type> <source_obj>36</source_obj> <sink_obj>37</sink_obj> </item> <item class_id_reference="20" object_id="_178"> <id>194</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>38</sink_obj> </item> <item class_id_reference="20" object_id="_179"> <id>196</id> <edge_type>1</edge_type> <source_obj>195</source_obj> <sink_obj>38</sink_obj> </item> <item class_id_reference="20" object_id="_180"> <id>198</id> <edge_type>1</edge_type> <source_obj>147</source_obj> <sink_obj>39</sink_obj> </item> <item class_id_reference="20" object_id="_181"> <id>199</id> <edge_type>1</edge_type> <source_obj>38</source_obj> <sink_obj>39</sink_obj> </item> <item class_id_reference="20" object_id="_182"> <id>200</id> <edge_type>1</edge_type> <source_obj>39</source_obj> <sink_obj>40</sink_obj> </item> <item class_id_reference="20" object_id="_183"> <id>201</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>41</sink_obj> </item> <item class_id_reference="20" object_id="_184"> <id>202</id> <edge_type>1</edge_type> <source_obj>139</source_obj> <sink_obj>41</sink_obj> </item> <item class_id_reference="20" object_id="_185"> <id>203</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>41</sink_obj> </item> <item class_id_reference="20" object_id="_186"> <id>204</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>42</sink_obj> </item> <item class_id_reference="20" object_id="_187"> <id>206</id> <edge_type>1</edge_type> <source_obj>205</source_obj> <sink_obj>42</sink_obj> </item> <item class_id_reference="20" object_id="_188"> <id>208</id> <edge_type>1</edge_type> <source_obj>147</source_obj> <sink_obj>43</sink_obj> </item> <item class_id_reference="20" object_id="_189"> <id>209</id> <edge_type>1</edge_type> <source_obj>42</source_obj> <sink_obj>43</sink_obj> </item> <item class_id_reference="20" object_id="_190"> <id>210</id> <edge_type>1</edge_type> <source_obj>43</source_obj> <sink_obj>44</sink_obj> </item> <item class_id_reference="20" object_id="_191"> <id>211</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>45</sink_obj> </item> <item class_id_reference="20" object_id="_192"> <id>212</id> <edge_type>1</edge_type> <source_obj>139</source_obj> <sink_obj>45</sink_obj> </item> <item class_id_reference="20" object_id="_193"> <id>213</id> <edge_type>1</edge_type> <source_obj>44</source_obj> <sink_obj>45</sink_obj> </item> <item class_id_reference="20" object_id="_194"> <id>215</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>46</sink_obj> </item> <item class_id_reference="20" object_id="_195"> <id>216</id> <edge_type>1</edge_type> <source_obj>135</source_obj> <sink_obj>46</sink_obj> </item> <item class_id_reference="20" object_id="_196"> <id>217</id> <edge_type>1</edge_type> <source_obj>46</source_obj> <sink_obj>47</sink_obj> </item> <item class_id_reference="20" object_id="_197"> <id>218</id> <edge_type>2</edge_type> <source_obj>54</source_obj> <sink_obj>48</sink_obj> </item> <item class_id_reference="20" object_id="_198"> <id>220</id> <edge_type>1</edge_type> <source_obj>219</source_obj> <sink_obj>50</sink_obj> </item> <item class_id_reference="20" object_id="_199"> <id>221</id> <edge_type>2</edge_type> <source_obj>49</source_obj> <sink_obj>50</sink_obj> </item> <item class_id_reference="20" object_id="_200"> <id>222</id> <edge_type>1</edge_type> <source_obj>52</source_obj> <sink_obj>50</sink_obj> </item> <item class_id_reference="20" object_id="_201"> <id>223</id> <edge_type>2</edge_type> <source_obj>124</source_obj> <sink_obj>50</sink_obj> </item> <item class_id_reference="20" object_id="_202"> <id>224</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>51</sink_obj> </item> <item class_id_reference="20" object_id="_203"> <id>226</id> <edge_type>1</edge_type> <source_obj>225</source_obj> <sink_obj>51</sink_obj> </item> <item class_id_reference="20" object_id="_204"> <id>227</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>52</sink_obj> </item> <item class_id_reference="20" object_id="_205"> <id>229</id> <edge_type>1</edge_type> <source_obj>228</source_obj> <sink_obj>52</sink_obj> </item> <item class_id_reference="20" object_id="_206"> <id>230</id> <edge_type>1</edge_type> <source_obj>51</source_obj> <sink_obj>53</sink_obj> </item> <item class_id_reference="20" object_id="_207"> <id>231</id> <edge_type>2</edge_type> <source_obj>124</source_obj> <sink_obj>53</sink_obj> </item> <item class_id_reference="20" object_id="_208"> <id>232</id> <edge_type>2</edge_type> <source_obj>126</source_obj> <sink_obj>53</sink_obj> </item> <item class_id_reference="20" object_id="_209"> <id>233</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>59</sink_obj> </item> <item class_id_reference="20" object_id="_210"> <id>234</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>60</sink_obj> </item> <item class_id_reference="20" object_id="_211"> <id>235</id> <edge_type>1</edge_type> <source_obj>139</source_obj> <sink_obj>60</sink_obj> </item> <item class_id_reference="20" object_id="_212"> <id>236</id> <edge_type>1</edge_type> <source_obj>59</source_obj> <sink_obj>60</sink_obj> </item> <item class_id_reference="20" object_id="_213"> <id>237</id> <edge_type>1</edge_type> <source_obj>60</source_obj> <sink_obj>61</sink_obj> </item> <item class_id_reference="20" object_id="_214"> <id>238</id> <edge_type>1</edge_type> <source_obj>61</source_obj> <sink_obj>62</sink_obj> </item> <item class_id_reference="20" object_id="_215"> <id>239</id> <edge_type>1</edge_type> <source_obj>17</source_obj> <sink_obj>63</sink_obj> </item> <item class_id_reference="20" object_id="_216"> <id>240</id> <edge_type>1</edge_type> <source_obj>63</source_obj> <sink_obj>64</sink_obj> </item> <item class_id_reference="20" object_id="_217"> <id>241</id> <edge_type>1</edge_type> <source_obj>64</source_obj> <sink_obj>65</sink_obj> </item> <item class_id_reference="20" object_id="_218"> <id>242</id> <edge_type>1</edge_type> <source_obj>62</source_obj> <sink_obj>65</sink_obj> </item> <item class_id_reference="20" object_id="_219"> <id>243</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>66</sink_obj> </item> <item class_id_reference="20" object_id="_220"> <id>244</id> <edge_type>1</edge_type> <source_obj>139</source_obj> <sink_obj>66</sink_obj> </item> <item class_id_reference="20" object_id="_221"> <id>245</id> <edge_type>1</edge_type> <source_obj>59</source_obj> <sink_obj>66</sink_obj> </item> <item class_id_reference="20" object_id="_222"> <id>246</id> <edge_type>1</edge_type> <source_obj>66</source_obj> <sink_obj>67</sink_obj> </item> <item class_id_reference="20" object_id="_223"> <id>247</id> <edge_type>1</edge_type> <source_obj>67</source_obj> <sink_obj>68</sink_obj> </item> <item class_id_reference="20" object_id="_224"> <id>248</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>69</sink_obj> </item> <item class_id_reference="20" object_id="_225"> <id>249</id> <edge_type>1</edge_type> <source_obj>69</source_obj> <sink_obj>70</sink_obj> </item> <item class_id_reference="20" object_id="_226"> <id>250</id> <edge_type>1</edge_type> <source_obj>70</source_obj> <sink_obj>71</sink_obj> </item> <item class_id_reference="20" object_id="_227"> <id>251</id> <edge_type>1</edge_type> <source_obj>68</source_obj> <sink_obj>71</sink_obj> </item> <item class_id_reference="20" object_id="_228"> <id>252</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>72</sink_obj> </item> <item class_id_reference="20" object_id="_229"> <id>253</id> <edge_type>1</edge_type> <source_obj>139</source_obj> <sink_obj>72</sink_obj> </item> <item class_id_reference="20" object_id="_230"> <id>254</id> <edge_type>1</edge_type> <source_obj>59</source_obj> <sink_obj>72</sink_obj> </item> <item class_id_reference="20" object_id="_231"> <id>255</id> <edge_type>1</edge_type> <source_obj>72</source_obj> <sink_obj>73</sink_obj> </item> <item class_id_reference="20" object_id="_232"> <id>256</id> <edge_type>1</edge_type> <source_obj>73</source_obj> <sink_obj>74</sink_obj> </item> <item class_id_reference="20" object_id="_233"> <id>257</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>75</sink_obj> </item> <item class_id_reference="20" object_id="_234"> <id>258</id> <edge_type>1</edge_type> <source_obj>75</source_obj> <sink_obj>76</sink_obj> </item> <item class_id_reference="20" object_id="_235"> <id>259</id> <edge_type>1</edge_type> <source_obj>76</source_obj> <sink_obj>77</sink_obj> </item> <item class_id_reference="20" object_id="_236"> <id>260</id> <edge_type>1</edge_type> <source_obj>74</source_obj> <sink_obj>77</sink_obj> </item> <item class_id_reference="20" object_id="_237"> <id>261</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>78</sink_obj> </item> <item class_id_reference="20" object_id="_238"> <id>262</id> <edge_type>1</edge_type> <source_obj>139</source_obj> <sink_obj>78</sink_obj> </item> <item class_id_reference="20" object_id="_239"> <id>263</id> <edge_type>1</edge_type> <source_obj>59</source_obj> <sink_obj>78</sink_obj> </item> <item class_id_reference="20" object_id="_240"> <id>264</id> <edge_type>1</edge_type> <source_obj>78</source_obj> <sink_obj>79</sink_obj> </item> <item class_id_reference="20" object_id="_241"> <id>265</id> <edge_type>1</edge_type> <source_obj>79</source_obj> <sink_obj>80</sink_obj> </item> <item class_id_reference="20" object_id="_242"> <id>266</id> <edge_type>1</edge_type> <source_obj>29</source_obj> <sink_obj>81</sink_obj> </item> <item class_id_reference="20" object_id="_243"> <id>267</id> <edge_type>1</edge_type> <source_obj>81</source_obj> <sink_obj>82</sink_obj> </item> <item class_id_reference="20" object_id="_244"> <id>268</id> <edge_type>1</edge_type> <source_obj>82</source_obj> <sink_obj>83</sink_obj> </item> <item class_id_reference="20" object_id="_245"> <id>269</id> <edge_type>1</edge_type> <source_obj>80</source_obj> <sink_obj>83</sink_obj> </item> <item class_id_reference="20" object_id="_246"> <id>270</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>84</sink_obj> </item> <item class_id_reference="20" object_id="_247"> <id>271</id> <edge_type>1</edge_type> <source_obj>139</source_obj> <sink_obj>84</sink_obj> </item> <item class_id_reference="20" object_id="_248"> <id>272</id> <edge_type>1</edge_type> <source_obj>59</source_obj> <sink_obj>84</sink_obj> </item> <item class_id_reference="20" object_id="_249"> <id>273</id> <edge_type>1</edge_type> <source_obj>84</source_obj> <sink_obj>85</sink_obj> </item> <item class_id_reference="20" object_id="_250"> <id>274</id> <edge_type>1</edge_type> <source_obj>85</source_obj> <sink_obj>86</sink_obj> </item> <item class_id_reference="20" object_id="_251"> <id>275</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>87</sink_obj> </item> <item class_id_reference="20" object_id="_252"> <id>276</id> <edge_type>1</edge_type> <source_obj>87</source_obj> <sink_obj>88</sink_obj> </item> <item class_id_reference="20" object_id="_253"> <id>277</id> <edge_type>1</edge_type> <source_obj>88</source_obj> <sink_obj>89</sink_obj> </item> <item class_id_reference="20" object_id="_254"> <id>278</id> <edge_type>1</edge_type> <source_obj>86</source_obj> <sink_obj>89</sink_obj> </item> <item class_id_reference="20" object_id="_255"> <id>279</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>90</sink_obj> </item> <item class_id_reference="20" object_id="_256"> <id>280</id> <edge_type>1</edge_type> <source_obj>139</source_obj> <sink_obj>90</sink_obj> </item> <item class_id_reference="20" object_id="_257"> <id>281</id> <edge_type>1</edge_type> <source_obj>59</source_obj> <sink_obj>90</sink_obj> </item> <item class_id_reference="20" object_id="_258"> <id>282</id> <edge_type>1</edge_type> <source_obj>90</source_obj> <sink_obj>91</sink_obj> </item> <item class_id_reference="20" object_id="_259"> <id>283</id> <edge_type>1</edge_type> <source_obj>91</source_obj> <sink_obj>92</sink_obj> </item> <item class_id_reference="20" object_id="_260"> <id>284</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>93</sink_obj> </item> <item class_id_reference="20" object_id="_261"> <id>285</id> <edge_type>1</edge_type> <source_obj>93</source_obj> <sink_obj>94</sink_obj> </item> <item class_id_reference="20" object_id="_262"> <id>286</id> <edge_type>1</edge_type> <source_obj>94</source_obj> <sink_obj>95</sink_obj> </item> <item class_id_reference="20" object_id="_263"> <id>287</id> <edge_type>1</edge_type> <source_obj>92</source_obj> <sink_obj>95</sink_obj> </item> <item class_id_reference="20" object_id="_264"> <id>288</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>96</sink_obj> </item> <item class_id_reference="20" object_id="_265"> <id>289</id> <edge_type>1</edge_type> <source_obj>139</source_obj> <sink_obj>96</sink_obj> </item> <item class_id_reference="20" object_id="_266"> <id>290</id> <edge_type>1</edge_type> <source_obj>59</source_obj> <sink_obj>96</sink_obj> </item> <item class_id_reference="20" object_id="_267"> <id>291</id> <edge_type>1</edge_type> <source_obj>96</source_obj> <sink_obj>97</sink_obj> </item> <item class_id_reference="20" object_id="_268"> <id>292</id> <edge_type>1</edge_type> <source_obj>97</source_obj> <sink_obj>98</sink_obj> </item> <item class_id_reference="20" object_id="_269"> <id>293</id> <edge_type>1</edge_type> <source_obj>41</source_obj> <sink_obj>99</sink_obj> </item> <item class_id_reference="20" object_id="_270"> <id>294</id> <edge_type>1</edge_type> <source_obj>99</source_obj> <sink_obj>100</sink_obj> </item> <item class_id_reference="20" object_id="_271"> <id>295</id> <edge_type>1</edge_type> <source_obj>100</source_obj> <sink_obj>101</sink_obj> </item> <item class_id_reference="20" object_id="_272"> <id>296</id> <edge_type>1</edge_type> <source_obj>98</source_obj> <sink_obj>101</sink_obj> </item> <item class_id_reference="20" object_id="_273"> <id>297</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>102</sink_obj> </item> <item class_id_reference="20" object_id="_274"> <id>298</id> <edge_type>1</edge_type> <source_obj>139</source_obj> <sink_obj>102</sink_obj> </item> <item class_id_reference="20" object_id="_275"> <id>299</id> <edge_type>1</edge_type> <source_obj>59</source_obj> <sink_obj>102</sink_obj> </item> <item class_id_reference="20" object_id="_276"> <id>300</id> <edge_type>1</edge_type> <source_obj>102</source_obj> <sink_obj>103</sink_obj> </item> <item class_id_reference="20" object_id="_277"> <id>301</id> <edge_type>1</edge_type> <source_obj>103</source_obj> <sink_obj>104</sink_obj> </item> <item class_id_reference="20" object_id="_278"> <id>302</id> <edge_type>1</edge_type> <source_obj>45</source_obj> <sink_obj>105</sink_obj> </item> <item class_id_reference="20" object_id="_279"> <id>303</id> <edge_type>1</edge_type> <source_obj>105</source_obj> <sink_obj>106</sink_obj> </item> <item class_id_reference="20" object_id="_280"> <id>304</id> <edge_type>1</edge_type> <source_obj>106</source_obj> <sink_obj>107</sink_obj> </item> <item class_id_reference="20" object_id="_281"> <id>305</id> <edge_type>1</edge_type> <source_obj>104</source_obj> <sink_obj>107</sink_obj> </item> <item class_id_reference="20" object_id="_282"> <id>306</id> <edge_type>1</edge_type> <source_obj>71</source_obj> <sink_obj>108</sink_obj> </item> <item class_id_reference="20" object_id="_283"> <id>307</id> <edge_type>1</edge_type> <source_obj>65</source_obj> <sink_obj>108</sink_obj> </item> <item class_id_reference="20" object_id="_284"> <id>308</id> <edge_type>1</edge_type> <source_obj>83</source_obj> <sink_obj>109</sink_obj> </item> <item class_id_reference="20" object_id="_285"> <id>309</id> <edge_type>1</edge_type> <source_obj>77</source_obj> <sink_obj>109</sink_obj> </item> <item class_id_reference="20" object_id="_286"> <id>310</id> <edge_type>1</edge_type> <source_obj>108</source_obj> <sink_obj>110</sink_obj> </item> <item class_id_reference="20" object_id="_287"> <id>311</id> <edge_type>1</edge_type> <source_obj>109</source_obj> <sink_obj>110</sink_obj> </item> <item class_id_reference="20" object_id="_288"> <id>312</id> <edge_type>1</edge_type> <source_obj>95</source_obj> <sink_obj>111</sink_obj> </item> <item class_id_reference="20" object_id="_289"> <id>313</id> <edge_type>1</edge_type> <source_obj>89</source_obj> <sink_obj>111</sink_obj> </item> <item class_id_reference="20" object_id="_290"> <id>314</id> <edge_type>1</edge_type> <source_obj>107</source_obj> <sink_obj>112</sink_obj> </item> <item class_id_reference="20" object_id="_291"> <id>316</id> <edge_type>1</edge_type> <source_obj>315</source_obj> <sink_obj>112</sink_obj> </item> <item class_id_reference="20" object_id="_292"> <id>317</id> <edge_type>1</edge_type> <source_obj>101</source_obj> <sink_obj>113</sink_obj> </item> <item class_id_reference="20" object_id="_293"> <id>318</id> <edge_type>1</edge_type> <source_obj>112</source_obj> <sink_obj>113</sink_obj> </item> <item class_id_reference="20" object_id="_294"> <id>319</id> <edge_type>1</edge_type> <source_obj>111</source_obj> <sink_obj>114</sink_obj> </item> <item class_id_reference="20" object_id="_295"> <id>320</id> <edge_type>1</edge_type> <source_obj>113</source_obj> <sink_obj>114</sink_obj> </item> <item class_id_reference="20" object_id="_296"> <id>321</id> <edge_type>1</edge_type> <source_obj>110</source_obj> <sink_obj>115</sink_obj> </item> <item class_id_reference="20" object_id="_297"> <id>322</id> <edge_type>1</edge_type> <source_obj>114</source_obj> <sink_obj>115</sink_obj> </item> <item class_id_reference="20" object_id="_298"> <id>325</id> <edge_type>1</edge_type> <source_obj>115</source_obj> <sink_obj>116</sink_obj> </item> <item class_id_reference="20" object_id="_299"> <id>327</id> <edge_type>1</edge_type> <source_obj>326</source_obj> <sink_obj>116</sink_obj> </item> <item class_id_reference="20" object_id="_300"> <id>329</id> <edge_type>1</edge_type> <source_obj>328</source_obj> <sink_obj>116</sink_obj> </item> <item class_id_reference="20" object_id="_301"> <id>330</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>117</sink_obj> </item> <item class_id_reference="20" object_id="_302"> <id>331</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>118</sink_obj> </item> <item class_id_reference="20" object_id="_303"> <id>332</id> <edge_type>1</edge_type> <source_obj>117</source_obj> <sink_obj>118</sink_obj> </item> <item class_id_reference="20" object_id="_304"> <id>333</id> <edge_type>1</edge_type> <source_obj>118</source_obj> <sink_obj>119</sink_obj> </item> <item class_id_reference="20" object_id="_305"> <id>334</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>120</sink_obj> </item> <item class_id_reference="20" object_id="_306"> <id>335</id> <edge_type>1</edge_type> <source_obj>139</source_obj> <sink_obj>120</sink_obj> </item> <item class_id_reference="20" object_id="_307"> <id>336</id> <edge_type>1</edge_type> <source_obj>119</source_obj> <sink_obj>120</sink_obj> </item> <item class_id_reference="20" object_id="_308"> <id>337</id> <edge_type>1</edge_type> <source_obj>116</source_obj> <sink_obj>121</sink_obj> </item> <item class_id_reference="20" object_id="_309"> <id>338</id> <edge_type>1</edge_type> <source_obj>120</source_obj> <sink_obj>121</sink_obj> </item> <item class_id_reference="20" object_id="_310"> <id>339</id> <edge_type>2</edge_type> <source_obj>54</source_obj> <sink_obj>123</sink_obj> </item> <item class_id_reference="20" object_id="_311"> <id>367</id> <edge_type>2</edge_type> <source_obj>49</source_obj> <sink_obj>54</sink_obj> </item> <item class_id_reference="20" object_id="_312"> <id>368</id> <edge_type>2</edge_type> <source_obj>54</source_obj> <sink_obj>126</sink_obj> </item> <item class_id_reference="20" object_id="_313"> <id>369</id> <edge_type>2</edge_type> <source_obj>54</source_obj> <sink_obj>124</sink_obj> </item> <item class_id_reference="20" object_id="_314"> <id>370</id> <edge_type>2</edge_type> <source_obj>124</source_obj> <sink_obj>54</sink_obj> </item> </edges> </cdfg> <cdfg_regions class_id="21" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="22" tracking_level="1" version="0" object_id="_315"> <mId>1</mId> <mTag>dct_dct_1d</mTag> <mType>0</mType> <sub_regions> <count>3</count> <item_version>0</item_version> <item>2</item> <item>3</item> <item>4</item> </sub_regions> <basic_blocks> <count>0</count> <item_version>0</item_version> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>37</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> <item class_id_reference="22" object_id="_316"> <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>49</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="_317"> <mId>3</mId> <mTag>DCT_Outer_Loop</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>54</item> <item>124</item> </basic_blocks> <mII>4</mII> <mDepth>8</mDepth> <mMinTripCount>8</mMinTripCount> <mMaxTripCount>8</mMaxTripCount> <mMinLatency>35</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> <item class_id_reference="22" object_id="_318"> <mId>4</mId> <mTag>Return</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>1</count> <item_version>0</item_version> <item>126</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="_319"> <states class_id="25" tracking_level="0" version="0"> <count>10</count> <item_version>0</item_version> <item class_id="26" tracking_level="1" version="0" object_id="_320"> <id>1</id> <operations class_id="27" tracking_level="0" version="0"> <count>36</count> <item_version>0</item_version> <item class_id="28" tracking_level="1" version="0" object_id="_321"> <id>13</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_322"> <id>14</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_323"> <id>15</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_324"> <id>16</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_325"> <id>17</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_326"> <id>18</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_327"> <id>19</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_328"> <id>20</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_329"> <id>21</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_330"> <id>22</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_331"> <id>23</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_332"> <id>24</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_333"> <id>25</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_334"> <id>26</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_335"> <id>27</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_336"> <id>28</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_337"> <id>29</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_338"> <id>30</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_339"> <id>31</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_340"> <id>32</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_341"> <id>33</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_342"> <id>34</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_343"> <id>35</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_344"> <id>36</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_345"> <id>37</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_346"> <id>38</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_347"> <id>39</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_348"> <id>40</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_349"> <id>41</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_350"> <id>42</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_351"> <id>43</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_352"> <id>44</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_353"> <id>45</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_354"> <id>46</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_355"> <id>47</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_356"> <id>48</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_357"> <id>2</id> <operations> <count>11</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_358"> <id>50</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_359"> <id>51</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_360"> <id>52</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_361"> <id>53</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_362"> <id>59</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_363"> <id>66</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_364"> <id>67</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_365"> <id>69</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_366"> <id>81</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_367"> <id>117</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_368"> <id>118</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_369"> <id>3</id> <operations> <count>9</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_370"> <id>60</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_371"> <id>61</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_372"> <id>63</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_373"> <id>67</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_374"> <id>69</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_375"> <id>78</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_376"> <id>79</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_377"> <id>81</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_378"> <id>93</id> <stage>2</stage> <latency>2</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_379"> <id>4</id> <operations> <count>19</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_380"> <id>61</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_381"> <id>63</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_382"> <id>68</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_383"> <id>70</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_384"> <id>71</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_385"> <id>72</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_386"> <id>73</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_387"> <id>75</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_388"> <id>79</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_389"> <id>84</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_390"> <id>85</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_391"> <id>87</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_392"> <id>90</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_393"> <id>91</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_394"> <id>93</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_395"> <id>96</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_396"> <id>97</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_397"> <id>102</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_398"> <id>103</id> <stage>2</stage> <latency>2</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_399"> <id>5</id> <operations> <count>16</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_400"> <id>62</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_401"> <id>64</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_402"> <id>65</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_403"> <id>73</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_404"> <id>75</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_405"> <id>80</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_406"> <id>82</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_407"> <id>83</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_408"> <id>85</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_409"> <id>87</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_410"> <id>91</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_411"> <id>97</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_412"> <id>99</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_413"> <id>103</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_414"> <id>105</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_415"> <id>108</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_416"> <id>6</id> <operations> <count>10</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_417"> <id>74</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_418"> <id>76</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_419"> <id>77</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_420"> <id>92</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_421"> <id>94</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_422"> <id>95</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_423"> <id>99</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_424"> <id>105</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_425"> <id>109</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_426"> <id>110</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_427"> <id>7</id> <operations> <count>8</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_428"> <id>98</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_429"> <id>100</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_430"> <id>101</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_431"> <id>104</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_432"> <id>106</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_433"> <id>107</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_434"> <id>112</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_435"> <id>113</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_436"> <id>8</id> <operations> <count>7</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_437"> <id>86</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_438"> <id>88</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_439"> <id>89</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_440"> <id>111</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_441"> <id>114</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_442"> <id>115</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_443"> <id>116</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_444"> <id>9</id> <operations> <count>9</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_445"> <id>55</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_446"> <id>56</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_447"> <id>57</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_448"> <id>58</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_449"> <id>119</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_450"> <id>120</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_451"> <id>121</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_452"> <id>122</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_453"> <id>123</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_454"> <id>10</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_455"> <id>125</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> </states> <transitions class_id="29" tracking_level="0" version="0"> <count>10</count> <item_version>0</item_version> <item class_id="30" tracking_level="1" version="0" object_id="_456"> <inState>1</inState> <outState>2</outState> <condition class_id="31" tracking_level="0" version="0"> <id>18</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="_457"> <inState>3</inState> <outState>4</outState> <condition> <id>32</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="_458"> <inState>4</inState> <outState>5</outState> <condition> <id>33</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_459"> <inState>5</inState> <outState>6</outState> <condition> <id>34</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_460"> <inState>6</inState> <outState>7</outState> <condition> <id>35</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_461"> <inState>7</inState> <outState>8</outState> <condition> <id>36</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_462"> <inState>8</inState> <outState>9</outState> <condition> <id>37</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="_463"> <inState>9</inState> <outState>2</outState> <condition> <id>38</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="_464"> <inState>2</inState> <outState>10</outState> <condition> <id>31</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>51</first> <second>0</second> </first> <second>0</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_465"> <inState>2</inState> <outState>3</outState> <condition> <id>39</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>51</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="_466"> <dp_component_resource class_id="37" tracking_level="0" version="0"> <count>5</count> <item_version>0</item_version> <item class_id="38" tracking_level="0" version="0"> <first>dct_mac_muladd_16s_14ns_29s_29_1_U3 (dct_mac_muladd_16s_14ns_29s_29_1)</first> <second class_id="39" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="40" tracking_level="0" version="0"> <first>DSP48E</first> <second>1</second> </item> </second> </item> <item> <first>dct_mac_muladd_16s_15s_14ns_29_1_U4 (dct_mac_muladd_16s_15s_14ns_29_1)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>DSP48E</first> <second>1</second> </item> </second> </item> <item> <first>dct_mac_muladd_16s_15s_29s_29_1_U0 (dct_mac_muladd_16s_15s_29s_29_1)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>DSP48E</first> <second>1</second> </item> </second> </item> <item> <first>dct_mac_muladd_16s_15s_29s_29_1_U1 (dct_mac_muladd_16s_15s_29s_29_1)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>DSP48E</first> <second>1</second> </item> </second> </item> <item> <first>dct_mac_muladd_16s_15s_29s_29_1_U2 (dct_mac_muladd_16s_15s_29s_29_1)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>DSP48E</first> <second>1</second> </item> </second> </item> </dp_component_resource> <dp_expression_resource> <count>16</count> <item_version>0</item_version> <item> <first>exitcond1_fu_444_p2 ( icmp ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>4</second> </item> <item> <first>(1P1)</first> <second>5</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>2</second> </item> </second> </item> <item> <first>k_1_fu_450_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>4</second> </item> <item> <first>(1P1)</first> <second>1</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>4</second> </item> </second> </item> <item> <first>p_addr7_fu_465_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>8</second> </item> <item> <first>(1P1)</first> <second>8</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>8</second> </item> </second> </item> <item> <first>tmp1_fu_522_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>29</second> </item> <item> <first>(1P1)</first> <second>29</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>29</second> </item> </second> </item> <item> <first>tmp4_fu_546_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>29</second> </item> <item> <first>(1P1)</first> <second>29</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_318_p2 ( or ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>7</second> </item> <item> <first>(1P1)</first> <second>2</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>10</second> </item> </second> </item> <item> <first>tmp_13_fu_337_p2 ( or ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>7</second> </item> <item> <first>(1P1)</first> <second>2</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>10</second> </item> </second> </item> <item> <first>tmp_15_fu_356_p2 ( or ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>7</second> </item> <item> <first>(1P1)</first> <second>3</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>10</second> </item> </second> </item> <item> <first>tmp_17_fu_375_p2 ( or ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>7</second> </item> <item> <first>(1P1)</first> <second>3</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>10</second> </item> </second> </item> <item> <first>tmp_19_fu_394_p2 ( or ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>7</second> </item> <item> <first>(1P1)</first> <second>3</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>10</second> </item> </second> </item> <item> <first>tmp_21_fu_413_p2 ( or ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>7</second> </item> <item> <first>(1P1)</first> <second>3</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>10</second> </item> </second> </item> <item> <first>tmp_2_fu_550_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>29</second> </item> <item> <first>(1P1)</first> <second>29</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>14</second> </item> </second> </item> <item> <first>tmp_7_fu_299_p2 ( or ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>7</second> </item> <item> <first>(1P1)</first> <second>1</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>10</second> </item> </second> </item> <item> <first>tmp_8_1_fu_477_p2 ( * ) </first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>16</second> </item> <item> <first>(1P1)</first> <second>15</second> </item> <item> <first>DSP48E</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>tmp_8_3_fu_497_p2 ( * ) </first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>16</second> </item> <item> <first>(1P1)</first> <second>15</second> </item> <item> <first>DSP48E</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>tmp_8_5_fu_516_p2 ( * ) </first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>16</second> </item> <item> <first>(1P1)</first> <second>15</second> </item> <item> <first>DSP48E</first> <second>1</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>0</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>8</count> <item_version>0</item_version> <item> <first>dct_coeff_table_0_U</first> <second> <count>7</count> <item_version>0</item_version> <item> <first>(0Words)</first> <second>8</second> </item> <item> <first>(1Bits)</first> <second>14</second> </item> <item> <first>(2Banks)</first> <second>1</second> </item> <item> <first>(3W*Bits*Banks)</first> <second>112</second> </item> <item> <first>BRAM</first> <second>0</second> </item> <item> <first>FF</first> <second>14</second> </item> <item> <first>LUT</first> <second>2</second> </item> </second> </item> <item> <first>dct_coeff_table_1_U</first> <second> <count>7</count> <item_version>0</item_version> <item> <first>(0Words)</first> <second>8</second> </item> <item> <first>(1Bits)</first> <second>15</second> </item> <item> <first>(2Banks)</first> <second>1</second> </item> <item> <first>(3W*Bits*Banks)</first> <second>120</second> </item> <item> <first>BRAM</first> <second>0</second> </item> <item> <first>FF</first> <second>15</second> </item> <item> <first>LUT</first> <second>2</second> </item> </second> </item> <item> <first>dct_coeff_table_2_U</first> <second> <count>7</count> <item_version>0</item_version> <item> <first>(0Words)</first> <second>8</second> </item> <item> <first>(1Bits)</first> <second>15</second> </item> <item> <first>(2Banks)</first> <second>1</second> </item> <item> <first>(3W*Bits*Banks)</first> <second>120</second> </item> <item> <first>BRAM</first> <second>0</second> </item> <item> <first>FF</first> <second>15</second> </item> <item> <first>LUT</first> <second>2</second> </item> </second> </item> <item> <first>dct_coeff_table_3_U</first> <second> <count>7</count> <item_version>0</item_version> <item> <first>(0Words)</first> <second>8</second> </item> <item> <first>(1Bits)</first> <second>15</second> </item> <item> <first>(2Banks)</first> <second>1</second> </item> <item> <first>(3W*Bits*Banks)</first> <second>120</second> </item> <item> <first>BRAM</first> <second>0</second> </item> <item> <first>FF</first> <second>15</second> </item> <item> <first>LUT</first> <second>2</second> </item> </second> </item> <item> <first>dct_coeff_table_4_U</first> <second> <count>7</count> <item_version>0</item_version> <item> <first>(0Words)</first> <second>8</second> </item> <item> <first>(1Bits)</first> <second>15</second> </item> <item> <first>(2Banks)</first> <second>1</second> </item> <item> <first>(3W*Bits*Banks)</first> <second>120</second> </item> <item> <first>BRAM</first> <second>0</second> </item> <item> <first>FF</first> <second>15</second> </item> <item> <first>LUT</first> <second>2</second> </item> </second> </item> <item> <first>dct_coeff_table_5_U</first> <second> <count>7</count> <item_version>0</item_version> <item> <first>(0Words)</first> <second>8</second> </item> <item> <first>(1Bits)</first> <second>15</second> </item> <item> <first>(2Banks)</first> <second>1</second> </item> <item> <first>(3W*Bits*Banks)</first> <second>120</second> </item> <item> <first>BRAM</first> <second>0</second> </item> <item> <first>FF</first> <second>15</second> </item> <item> <first>LUT</first> <second>2</second> </item> </second> </item> <item> <first>dct_coeff_table_6_U</first> <second> <count>7</count> <item_version>0</item_version> <item> <first>(0Words)</first> <second>8</second> </item> <item> <first>(1Bits)</first> <second>15</second> </item> <item> <first>(2Banks)</first> <second>1</second> </item> <item> <first>(3W*Bits*Banks)</first> <second>120</second> </item> <item> <first>BRAM</first> <second>0</second> </item> <item> <first>FF</first> <second>15</second> </item> <item> <first>LUT</first> <second>2</second> </item> </second> </item> <item> <first>dct_coeff_table_7_U</first> <second> <count>7</count> <item_version>0</item_version> <item> <first>(0Words)</first> <second>8</second> </item> <item> <first>(1Bits)</first> <second>15</second> </item> <item> <first>(2Banks)</first> <second>1</second> </item> <item> <first>(3W*Bits*Banks)</first> <second>120</second> </item> <item> <first>BRAM</first> <second>0</second> </item> <item> <first>FF</first> <second>15</second> </item> <item> <first>LUT</first> <second>2</second> </item> </second> </item> </dp_memory_resource> <dp_multiplexer_resource> <count>5</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>7</second> </item> <item> <first>(1Bits)</first> <second>1</second> </item> <item> <first>(2Count)</first> <second>7</second> </item> <item> <first>LUT</first> <second>1</second> </item> </second> </item> <item> <first>k_phi_fu_271_p4</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>4</second> </item> <item> <first>(2Count)</first> <second>8</second> </item> <item> <first>LUT</first> <second>4</second> </item> </second> </item> <item> <first>k_reg_267</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>4</second> </item> <item> <first>(2Count)</first> <second>8</second> </item> <item> <first>LUT</first> <second>4</second> </item> </second> </item> <item> <first>src_address0</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>5</second> </item> <item> <first>(1Bits)</first> <second>6</second> </item> <item> <first>(2Count)</first> <second>30</second> </item> <item> <first>LUT</first> <second>6</second> </item> </second> </item> <item> <first>src_address1</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>5</second> </item> <item> <first>(1Bits)</first> <second>6</second> </item> <item> <first>(2Count)</first> <second>30</second> </item> <item> <first>LUT</first> <second>6</second> </item> </second> </item> </dp_multiplexer_resource> <dp_register_resource> <count>38</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>6</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>6</second> </item> </second> </item> <item> <first>ap_reg_ppiten_pp0_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_pp0_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>ap_reg_ppstg_exitcond1_reg_653_pp0_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>ap_reg_ppstg_p_addr7_reg_678_pp0_it1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>8</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>8</second> </item> </second> </item> <item> <first>dct_coeff_table_0_load_reg_698</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>dct_coeff_table_1_load_reg_688</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>15</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>15</second> </item> </second> </item> <item> <first>dct_coeff_table_2_load_reg_743</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>15</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>15</second> </item> </second> </item> <item> <first>dct_coeff_table_3_load_reg_713</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>15</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>15</second> </item> </second> </item> <item> <first>dct_coeff_table_4_load_reg_753</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>15</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>15</second> </item> </second> </item> <item> <first>dct_coeff_table_5_load_reg_763</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>15</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>15</second> </item> </second> </item> <item> <first>dct_coeff_table_6_load_reg_768</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>15</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>15</second> </item> </second> </item> <item> <first>dct_coeff_table_7_load_reg_773</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>15</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>15</second> </item> </second> </item> <item> <first>exitcond1_reg_653</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>k_1_reg_657</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>4</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>4</second> </item> </second> </item> <item> <first>k_reg_267</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>4</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>4</second> </item> </second> </item> <item> <first>p_addr16_cast_reg_648</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>8</second> </item> <item> <first>(Consts)</first> <second>4</second> </item> <item> <first>FF</first> <second>4</second> </item> </second> </item> <item> <first>p_addr7_reg_678</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>8</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>8</second> </item> </second> </item> <item> <first>reg_278</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>16</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>16</second> </item> </second> </item> <item> <first>reg_282</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>16</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>16</second> </item> </second> </item> <item> <first>src_addr_1_reg_613</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>6</second> </item> <item> <first>(Consts)</first> <second>3</second> </item> <item> <first>FF</first> <second>3</second> </item> </second> </item> <item> <first>src_addr_2_reg_618</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>6</second> </item> <item> <first>(Consts)</first> <second>3</second> </item> <item> <first>FF</first> <second>3</second> </item> </second> </item> <item> <first>src_addr_3_reg_623</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>6</second> </item> <item> <first>(Consts)</first> <second>3</second> </item> <item> <first>FF</first> <second>3</second> </item> </second> </item> <item> <first>src_addr_4_reg_628</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>6</second> </item> <item> <first>(Consts)</first> <second>3</second> </item> <item> <first>FF</first> <second>3</second> </item> </second> </item> <item> <first>src_addr_5_reg_633</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>6</second> </item> <item> <first>(Consts)</first> <second>3</second> </item> <item> <first>FF</first> <second>3</second> </item> </second> </item> <item> <first>src_addr_6_reg_638</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>6</second> </item> <item> <first>(Consts)</first> <second>3</second> </item> <item> <first>FF</first> <second>3</second> </item> </second> </item> <item> <first>src_addr_7_reg_643</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>6</second> </item> <item> <first>(Consts)</first> <second>3</second> </item> <item> <first>FF</first> <second>3</second> </item> </second> </item> <item> <first>src_addr_reg_608</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>6</second> </item> <item> <first>(Consts)</first> <second>3</second> </item> <item> <first>FF</first> <second>3</second> </item> </second> </item> <item> <first>src_load_4_reg_758</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>16</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>16</second> </item> </second> </item> <item> <first>src_load_5_reg_728</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>16</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>16</second> </item> </second> </item> <item> <first>tmp1_reg_788</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>29</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>29</second> </item> </second> </item> <item> <first>tmp2_reg_778</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>29</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>29</second> </item> </second> </item> <item> <first>tmp6_reg_793</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>29</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>29</second> </item> </second> </item> <item> <first>tmp_4_reg_798</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>16</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>16</second> </item> </second> </item> <item> <first>tmp_8_1_reg_703</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>29</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>29</second> </item> </second> </item> <item> <first>tmp_8_3_reg_748</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>29</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>29</second> </item> </second> </item> <item> <first>tmp_8_5_reg_783</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>29</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>29</second> </item> </second> </item> <item> <first>tmp_reg_662</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>64</second> </item> <item> <first>(Consts)</first> <second>60</second> </item> <item> <first>FF</first> <second>4</second> </item> </second> </item> </dp_register_resource> <dp_component_map class_id="41" tracking_level="0" version="0"> <count>5</count> <item_version>0</item_version> <item class_id="42" tracking_level="0" version="0"> <first>dct_mac_muladd_16s_14ns_29s_29_1_U3 (dct_mac_muladd_16s_14ns_29s_29_1)</first> <second> <count>2</count> <item_version>0</item_version> <item>65</item> <item>108</item> </second> </item> <item> <first>dct_mac_muladd_16s_15s_14ns_29_1_U4 (dct_mac_muladd_16s_15s_14ns_29_1)</first> <second> <count>2</count> <item_version>0</item_version> <item>107</item> <item>112</item> </second> </item> <item> <first>dct_mac_muladd_16s_15s_29s_29_1_U0 (dct_mac_muladd_16s_15s_29s_29_1)</first> <second> <count>2</count> <item_version>0</item_version> <item>77</item> <item>109</item> </second> </item> <item> <first>dct_mac_muladd_16s_15s_29s_29_1_U1 (dct_mac_muladd_16s_15s_29s_29_1)</first> <second> <count>2</count> <item_version>0</item_version> <item>89</item> <item>111</item> </second> </item> <item> <first>dct_mac_muladd_16s_15s_29s_29_1_U2 (dct_mac_muladd_16s_15s_29s_29_1)</first> <second> <count>2</count> <item_version>0</item_version> <item>101</item> <item>113</item> </second> </item> </dp_component_map> <dp_expression_map> <count>16</count> <item_version>0</item_version> <item> <first>exitcond1_fu_444_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>51</item> </second> </item> <item> <first>k_1_fu_450_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>p_addr7_fu_465_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>118</item> </second> </item> <item> <first>tmp1_fu_522_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>110</item> </second> </item> <item> <first>tmp4_fu_546_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>114</item> </second> </item> <item> <first>tmp_10_fu_318_p2 ( or ) </first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>tmp_13_fu_337_p2 ( or ) </first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>tmp_15_fu_356_p2 ( or ) </first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>tmp_17_fu_375_p2 ( or ) </first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>tmp_19_fu_394_p2 ( or ) </first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>tmp_21_fu_413_p2 ( or ) </first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>tmp_2_fu_550_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>115</item> </second> </item> <item> <first>tmp_7_fu_299_p2 ( or ) </first> <second> <count>1</count> <item_version>0</item_version> <item>18</item> </second> </item> <item> <first>tmp_8_1_fu_477_p2 ( * ) </first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>tmp_8_3_fu_497_p2 ( * ) </first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>tmp_8_5_fu_516_p2 ( * ) </first> <second> <count>1</count> <item_version>0</item_version> <item>95</item> </second> </item> </dp_expression_map> <dp_fifo_map> <count>0</count> <item_version>0</item_version> </dp_fifo_map> <dp_memory_map> <count>8</count> <item_version>0</item_version> <item> <first>dct_coeff_table_0_U</first> <second> <count>1</count> <item_version>0</item_version> <item>49</item> </second> </item> <item> <first>dct_coeff_table_1_U</first> <second> <count>1</count> <item_version>0</item_version> <item>56</item> </second> </item> <item> <first>dct_coeff_table_2_U</first> <second> <count>1</count> <item_version>0</item_version> <item>63</item> </second> </item> <item> <first>dct_coeff_table_3_U</first> <second> <count>1</count> <item_version>0</item_version> <item>70</item> </second> </item> <item> <first>dct_coeff_table_4_U</first> <second> <count>1</count> <item_version>0</item_version> <item>77</item> </second> </item> <item> <first>dct_coeff_table_5_U</first> <second> <count>1</count> <item_version>0</item_version> <item>84</item> </second> </item> <item> <first>dct_coeff_table_6_U</first> <second> <count>1</count> <item_version>0</item_version> <item>91</item> </second> </item> <item> <first>dct_coeff_table_7_U</first> <second> <count>1</count> <item_version>0</item_version> <item>98</item> </second> </item> </dp_memory_map> </res> <node_label_latency class_id="43" tracking_level="0" version="0"> <count>105</count> <item_version>0</item_version> <item class_id="44" tracking_level="0" version="0"> <first>13</first> <second class_id="45" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>14</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>15</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>16</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>17</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>18</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>19</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>20</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>21</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>22</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>23</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>24</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>25</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>26</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>27</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>28</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>29</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>30</first> <second> <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>37</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>38</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>39</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>40</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>41</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>42</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>43</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>44</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>45</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>46</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>47</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>48</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>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>59</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>60</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>61</first> <second> <first>2</first> <second>1</second> </second> </item> <item> <first>62</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>63</first> <second> <first>2</first> <second>1</second> </second> </item> <item> <first>64</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>65</first> <second> <first>4</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>1</second> </second> </item> <item> <first>68</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>69</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>70</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>71</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>72</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>73</first> <second> <first>3</first> <second>1</second> </second> </item> <item> <first>74</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>75</first> <second> <first>3</first> <second>1</second> </second> </item> <item> <first>76</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>77</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>78</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>79</first> <second> <first>2</first> <second>1</second> </second> </item> <item> <first>80</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>81</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>82</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>83</first> <second> <first>4</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>1</second> </second> </item> <item> <first>86</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>87</first> <second> <first>3</first> <second>1</second> </second> </item> <item> <first>88</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>89</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>90</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>91</first> <second> <first>3</first> <second>1</second> </second> </item> <item> <first>92</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>93</first> <second> <first>2</first> <second>1</second> </second> </item> <item> <first>94</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>95</first> <second> <first>5</first> <second>0</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>6</first> <second>0</second> </second> </item> <item> <first>99</first> <second> <first>4</first> <second>1</second> </second> </item> <item> <first>100</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>101</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>102</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>103</first> <second> <first>3</first> <second>1</second> </second> </item> <item> <first>104</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>105</first> <second> <first>4</first> <second>1</second> </second> </item> <item> <first>106</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>107</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>108</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>109</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>110</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>111</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>112</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>113</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>114</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>115</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>116</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>117</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>118</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>119</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>120</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>121</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>123</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>125</first> <second> <first>2</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="46" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="47" tracking_level="0" version="0"> <first>49</first> <second class_id="48" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>54</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>124</first> <second> <first>1</first> <second>8</second> </second> </item> <item> <first>126</first> <second> <first>2</first> <second>2</second> </second> </item> </bblk_ent_exit> <regions class_id="49" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="50" tracking_level="1" version="0" object_id="_467"> <region_name>DCT_Outer_Loop</region_name> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>54</item> <item>124</item> </basic_blocks> <nodes> <count>0</count> <item_version>0</item_version> </nodes> <anchor_node>-1</anchor_node> <region_type>8</region_type> <interval>4</interval> <pipe_depth>8</pipe_depth> </item> </regions> <dp_fu_nodes class_id="51" tracking_level="0" version="0"> <count>89</count> <item_version>0</item_version> <item class_id="52" tracking_level="0" version="0"> <first>84</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>90</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> <item> <first>96</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> <item> <first>103</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>110</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>117</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>124</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>131</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>138</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>145</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>152</first> <second> <count>1</count> <item_version>0</item_version> <item>66</item> </second> </item> <item> <first>159</first> <second> <count>2</count> <item_version>0</item_version> <item>67</item> <item>67</item> </second> </item> <item> <first>164</first> <second> <count>16</count> <item_version>0</item_version> <item>69</item> <item>69</item> <item>81</item> <item>81</item> <item>63</item> <item>63</item> <item>93</item> <item>93</item> <item>75</item> <item>75</item> <item>87</item> <item>87</item> <item>99</item> <item>99</item> <item>105</item> <item>105</item> </second> </item> <item> <first>171</first> <second> <count>1</count> <item_version>0</item_version> <item>60</item> </second> </item> <item> <first>178</first> <second> <count>2</count> <item_version>0</item_version> <item>61</item> <item>61</item> </second> </item> <item> <first>183</first> <second> <count>1</count> <item_version>0</item_version> <item>78</item> </second> </item> <item> <first>190</first> <second> <count>2</count> <item_version>0</item_version> <item>79</item> <item>79</item> </second> </item> <item> <first>195</first> <second> <count>1</count> <item_version>0</item_version> <item>72</item> </second> </item> <item> <first>202</first> <second> <count>2</count> <item_version>0</item_version> <item>73</item> <item>73</item> </second> </item> <item> <first>207</first> <second> <count>1</count> <item_version>0</item_version> <item>84</item> </second> </item> <item> <first>214</first> <second> <count>2</count> <item_version>0</item_version> <item>85</item> <item>85</item> </second> </item> <item> <first>219</first> <second> <count>1</count> <item_version>0</item_version> <item>90</item> </second> </item> <item> <first>226</first> <second> <count>2</count> <item_version>0</item_version> <item>91</item> <item>91</item> </second> </item> <item> <first>231</first> <second> <count>1</count> <item_version>0</item_version> <item>96</item> </second> </item> <item> <first>238</first> <second> <count>2</count> <item_version>0</item_version> <item>97</item> <item>97</item> </second> </item> <item> <first>243</first> <second> <count>1</count> <item_version>0</item_version> <item>102</item> </second> </item> <item> <first>250</first> <second> <count>2</count> <item_version>0</item_version> <item>103</item> <item>103</item> </second> </item> <item> <first>255</first> <second> <count>1</count> <item_version>0</item_version> <item>120</item> </second> </item> <item> <first>262</first> <second> <count>1</count> <item_version>0</item_version> <item>121</item> </second> </item> <item> <first>271</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>286</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>294</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>299</first> <second> <count>1</count> <item_version>0</item_version> <item>18</item> </second> </item> <item> <first>305</first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> <item> <first>313</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>318</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>324</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>332</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>337</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>343</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> <item> <first>351</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>356</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>362</first> <second> <count>1</count> <item_version>0</item_version> <item>31</item> </second> </item> <item> <first>370</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>375</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>381</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>389</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>394</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>400</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> <item> <first>408</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>413</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>419</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>427</first> <second> <count>1</count> <item_version>0</item_version> <item>44</item> </second> </item> <item> <first>432</first> <second> <count>1</count> <item_version>0</item_version> <item>46</item> </second> </item> <item> <first>440</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>444</first> <second> <count>1</count> <item_version>0</item_version> <item>51</item> </second> </item> <item> <first>450</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>456</first> <second> <count>1</count> <item_version>0</item_version> <item>59</item> </second> </item> <item> <first>461</first> <second> <count>1</count> <item_version>0</item_version> <item>117</item> </second> </item> <item> <first>465</first> <second> <count>1</count> <item_version>0</item_version> <item>118</item> </second> </item> <item> <first>470</first> <second> <count>1</count> <item_version>0</item_version> <item>68</item> </second> </item> <item> <first>473</first> <second> <count>1</count> <item_version>0</item_version> <item>70</item> </second> </item> <item> <first>477</first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>483</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>486</first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> <item> <first>490</first> <second> <count>1</count> <item_version>0</item_version> <item>80</item> </second> </item> <item> <first>493</first> <second> <count>1</count> <item_version>0</item_version> <item>82</item> </second> </item> <item> <first>497</first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>503</first> <second> <count>1</count> <item_version>0</item_version> <item>74</item> </second> </item> <item> <first>506</first> <second> <count>1</count> <item_version>0</item_version> <item>76</item> </second> </item> <item> <first>510</first> <second> <count>1</count> <item_version>0</item_version> <item>92</item> </second> </item> <item> <first>513</first> <second> <count>1</count> <item_version>0</item_version> <item>94</item> </second> </item> <item> <first>516</first> <second> <count>1</count> <item_version>0</item_version> <item>95</item> </second> </item> <item> <first>522</first> <second> <count>1</count> <item_version>0</item_version> <item>110</item> </second> </item> <item> <first>526</first> <second> <count>1</count> <item_version>0</item_version> <item>98</item> </second> </item> <item> <first>529</first> <second> <count>1</count> <item_version>0</item_version> <item>100</item> </second> </item> <item> <first>533</first> <second> <count>1</count> <item_version>0</item_version> <item>104</item> </second> </item> <item> <first>536</first> <second> <count>1</count> <item_version>0</item_version> <item>106</item> </second> </item> <item> <first>540</first> <second> <count>1</count> <item_version>0</item_version> <item>86</item> </second> </item> <item> <first>543</first> <second> <count>1</count> <item_version>0</item_version> <item>88</item> </second> </item> <item> <first>546</first> <second> <count>1</count> <item_version>0</item_version> <item>114</item> </second> </item> <item> <first>550</first> <second> <count>1</count> <item_version>0</item_version> <item>115</item> </second> </item> <item> <first>555</first> <second> <count>1</count> <item_version>0</item_version> <item>116</item> </second> </item> <item> <first>565</first> <second> <count>1</count> <item_version>0</item_version> <item>119</item> </second> </item> <item> <first>569</first> <second> <count>2</count> <item_version>0</item_version> <item>77</item> <item>109</item> </second> </item> <item> <first>577</first> <second> <count>2</count> <item_version>0</item_version> <item>89</item> <item>111</item> </second> </item> <item> <first>585</first> <second> <count>2</count> <item_version>0</item_version> <item>101</item> <item>113</item> </second> </item> <item> <first>592</first> <second> <count>2</count> <item_version>0</item_version> <item>65</item> <item>108</item> </second> </item> <item> <first>599</first> <second> <count>2</count> <item_version>0</item_version> <item>107</item> <item>112</item> </second> </item> </dp_fu_nodes> <dp_fu_nodes_expression class_id="54" tracking_level="0" version="0"> <count>77</count> <item_version>0</item_version> <item class_id="55" tracking_level="0" version="0"> <first>coeff_1_cast_fu_470</first> <second> <count>1</count> <item_version>0</item_version> <item>68</item> </second> </item> <item> <first>coeff_2_cast_fu_503</first> <second> <count>1</count> <item_version>0</item_version> <item>74</item> </second> </item> <item> <first>coeff_3_cast_fu_490</first> <second> <count>1</count> <item_version>0</item_version> <item>80</item> </second> </item> <item> <first>coeff_4_cast_fu_540</first> <second> <count>1</count> <item_version>0</item_version> <item>86</item> </second> </item> <item> <first>coeff_5_cast_fu_510</first> <second> <count>1</count> <item_version>0</item_version> <item>92</item> </second> </item> <item> <first>coeff_6_cast_fu_526</first> <second> <count>1</count> <item_version>0</item_version> <item>98</item> </second> </item> <item> <first>coeff_7_cast_fu_533</first> <second> <count>1</count> <item_version>0</item_version> <item>104</item> </second> </item> <item> <first>coeff_cast_fu_483</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>dct_coeff_table_0_addr_gep_fu_171</first> <second> <count>1</count> <item_version>0</item_version> <item>60</item> </second> </item> <item> <first>dct_coeff_table_1_addr_gep_fu_152</first> <second> <count>1</count> <item_version>0</item_version> <item>66</item> </second> </item> <item> <first>dct_coeff_table_2_addr_gep_fu_195</first> <second> <count>1</count> <item_version>0</item_version> <item>72</item> </second> </item> <item> <first>dct_coeff_table_3_addr_gep_fu_183</first> <second> <count>1</count> <item_version>0</item_version> <item>78</item> </second> </item> <item> <first>dct_coeff_table_4_addr_gep_fu_207</first> <second> <count>1</count> <item_version>0</item_version> <item>84</item> </second> </item> <item> <first>dct_coeff_table_5_addr_gep_fu_219</first> <second> <count>1</count> <item_version>0</item_version> <item>90</item> </second> </item> <item> <first>dct_coeff_table_6_addr_gep_fu_231</first> <second> <count>1</count> <item_version>0</item_version> <item>96</item> </second> </item> <item> <first>dct_coeff_table_7_addr_gep_fu_243</first> <second> <count>1</count> <item_version>0</item_version> <item>102</item> </second> </item> <item> <first>dst_addr_gep_fu_255</first> <second> <count>1</count> <item_version>0</item_version> <item>120</item> </second> </item> <item> <first>exitcond1_fu_444</first> <second> <count>1</count> <item_version>0</item_version> <item>51</item> </second> </item> <item> <first>grp_fu_569</first> <second> <count>2</count> <item_version>0</item_version> <item>77</item> <item>109</item> </second> </item> <item> <first>grp_fu_577</first> <second> <count>2</count> <item_version>0</item_version> <item>89</item> <item>111</item> </second> </item> <item> <first>grp_fu_585</first> <second> <count>2</count> <item_version>0</item_version> <item>101</item> <item>113</item> </second> </item> <item> <first>grp_fu_592</first> <second> <count>2</count> <item_version>0</item_version> <item>65</item> <item>108</item> </second> </item> <item> <first>grp_fu_599</first> <second> <count>2</count> <item_version>0</item_version> <item>107</item> <item>112</item> </second> </item> <item> <first>k_1_fu_450</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>k_phi_fu_271</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>p_addr16_cast_fu_440</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>p_addr1_fu_324</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>p_addr2_fu_343</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> <item> <first>p_addr3_fu_362</first> <second> <count>1</count> <item_version>0</item_version> <item>31</item> </second> </item> <item> <first>p_addr4_fu_381</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>p_addr5_fu_400</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> <item> <first>p_addr6_fu_419</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>p_addr7_fu_465</first> <second> <count>1</count> <item_version>0</item_version> <item>118</item> </second> </item> <item> <first>p_addr_fu_305</first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> <item> <first>src_addr_1_gep_fu_103</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>src_addr_2_gep_fu_110</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>src_addr_3_gep_fu_117</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>src_addr_4_gep_fu_124</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>src_addr_5_gep_fu_131</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>src_addr_6_gep_fu_138</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>src_addr_7_gep_fu_145</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>src_addr_gep_fu_96</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> <item> <first>tmp1_fu_522</first> <second> <count>1</count> <item_version>0</item_version> <item>110</item> </second> </item> <item> <first>tmp4_fu_546</first> <second> <count>1</count> <item_version>0</item_version> <item>114</item> </second> </item> <item> <first>tmp_10_fu_318</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>tmp_12_fu_332</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>tmp_13_fu_337</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>tmp_14_fu_351</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>tmp_15_fu_356</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>tmp_16_fu_370</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>tmp_17_fu_375</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>tmp_18_fu_389</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>tmp_19_fu_394</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>tmp_20_fu_408</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>tmp_21_fu_413</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>tmp_22_fu_427</first> <second> <count>1</count> <item_version>0</item_version> <item>44</item> </second> </item> <item> <first>tmp_23_fu_432</first> <second> <count>1</count> <item_version>0</item_version> <item>46</item> </second> </item> <item> <first>tmp_24_fu_565</first> <second> <count>1</count> <item_version>0</item_version> <item>119</item> </second> </item> <item> <first>tmp_2_fu_550</first> <second> <count>1</count> <item_version>0</item_version> <item>115</item> </second> </item> <item> <first>tmp_4_fu_555</first> <second> <count>1</count> <item_version>0</item_version> <item>116</item> </second> </item> <item> <first>tmp_5_fu_286</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>tmp_6_fu_294</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>tmp_7_1_cast_fu_473</first> <second> <count>1</count> <item_version>0</item_version> <item>70</item> </second> </item> <item> <first>tmp_7_2_cast_fu_506</first> <second> <count>1</count> <item_version>0</item_version> <item>76</item> </second> </item> <item> <first>tmp_7_3_cast_fu_493</first> <second> <count>1</count> <item_version>0</item_version> <item>82</item> </second> </item> <item> <first>tmp_7_4_cast_fu_543</first> <second> <count>1</count> <item_version>0</item_version> <item>88</item> </second> </item> <item> <first>tmp_7_5_cast_fu_513</first> <second> <count>1</count> <item_version>0</item_version> <item>94</item> </second> </item> <item> <first>tmp_7_6_cast_fu_529</first> <second> <count>1</count> <item_version>0</item_version> <item>100</item> </second> </item> <item> <first>tmp_7_7_cast_fu_536</first> <second> <count>1</count> <item_version>0</item_version> <item>106</item> </second> </item> <item> <first>tmp_7_cast_fu_486</first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> <item> <first>tmp_7_fu_299</first> <second> <count>1</count> <item_version>0</item_version> <item>18</item> </second> </item> <item> <first>tmp_8_1_fu_477</first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>tmp_8_3_fu_497</first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>tmp_8_5_fu_516</first> <second> <count>1</count> <item_version>0</item_version> <item>95</item> </second> </item> <item> <first>tmp_9_fu_313</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>tmp_fu_456</first> <second> <count>1</count> <item_version>0</item_version> <item>59</item> </second> </item> <item> <first>tmp_trn_cast_fu_461</first> <second> <count>1</count> <item_version>0</item_version> <item>117</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>tmp_11_read_read_fu_84</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>tmp_1_read_read_fu_90</first> <second> <count>1</count> <item_version>0</item_version> <item>14</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>11</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>dct_coeff_table_0</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>61</item> <item>61</item> </second> </item> <item> <first> <first>dct_coeff_table_1</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>67</item> <item>67</item> </second> </item> <item> <first> <first>dct_coeff_table_2</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>73</item> <item>73</item> </second> </item> <item> <first> <first>dct_coeff_table_3</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>79</item> <item>79</item> </second> </item> <item> <first> <first>dct_coeff_table_4</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>85</item> <item>85</item> </second> </item> <item> <first> <first>dct_coeff_table_5</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>91</item> <item>91</item> </second> </item> <item> <first> <first>dct_coeff_table_6</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>97</item> <item>97</item> </second> </item> <item> <first> <first>dct_coeff_table_7</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>103</item> <item>103</item> </second> </item> <item> <first> <first>dst</first> <second>0</second> </first> <second> <count>1</count> <item_version>0</item_version> <item>121</item> </second> </item> <item> <first> <first>src</first> <second>0</second> </first> <second> <count>8</count> <item_version>0</item_version> <item>69</item> <item>69</item> <item>63</item> <item>63</item> <item>75</item> <item>75</item> <item>99</item> <item>99</item> </second> </item> <item> <first> <first>src</first> <second>1</second> </first> <second> <count>8</count> <item_version>0</item_version> <item>81</item> <item>81</item> <item>93</item> <item>93</item> <item>87</item> <item>87</item> <item>105</item> <item>105</item> </second> </item> </dp_mem_port_nodes> <dp_reg_nodes> <count>41</count> <item_version>0</item_version> <item> <first>267</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>278</first> <second> <count>4</count> <item_version>0</item_version> <item>69</item> <item>63</item> <item>75</item> <item>99</item> </second> </item> <item> <first>282</first> <second> <count>2</count> <item_version>0</item_version> <item>81</item> <item>105</item> </second> </item> <item> <first>608</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> <item> <first>613</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>618</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>623</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>628</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>633</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>638</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>643</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>648</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>653</first> <second> <count>1</count> <item_version>0</item_version> <item>51</item> </second> </item> <item> <first>657</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>662</first> <second> <count>1</count> <item_version>0</item_version> <item>59</item> </second> </item> <item> <first>673</first> <second> <count>1</count> <item_version>0</item_version> <item>66</item> </second> </item> <item> <first>678</first> <second> <count>1</count> <item_version>0</item_version> <item>118</item> </second> </item> <item> <first>683</first> <second> <count>1</count> <item_version>0</item_version> <item>60</item> </second> </item> <item> <first>688</first> <second> <count>1</count> <item_version>0</item_version> <item>67</item> </second> </item> <item> <first>693</first> <second> <count>1</count> <item_version>0</item_version> <item>78</item> </second> </item> <item> <first>698</first> <second> <count>1</count> <item_version>0</item_version> <item>61</item> </second> </item> <item> <first>703</first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>708</first> <second> <count>1</count> <item_version>0</item_version> <item>72</item> </second> </item> <item> <first>713</first> <second> <count>1</count> <item_version>0</item_version> <item>79</item> </second> </item> <item> <first>718</first> <second> <count>1</count> <item_version>0</item_version> <item>84</item> </second> </item> <item> <first>723</first> <second> <count>1</count> <item_version>0</item_version> <item>90</item> </second> </item> <item> <first>728</first> <second> <count>1</count> <item_version>0</item_version> <item>93</item> </second> </item> <item> <first>733</first> <second> <count>1</count> <item_version>0</item_version> <item>96</item> </second> </item> <item> <first>738</first> <second> <count>1</count> <item_version>0</item_version> <item>102</item> </second> </item> <item> <first>743</first> <second> <count>1</count> <item_version>0</item_version> <item>73</item> </second> </item> <item> <first>748</first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>753</first> <second> <count>1</count> <item_version>0</item_version> <item>85</item> </second> </item> <item> <first>758</first> <second> <count>1</count> <item_version>0</item_version> <item>87</item> </second> </item> <item> <first>763</first> <second> <count>1</count> <item_version>0</item_version> <item>91</item> </second> </item> <item> <first>768</first> <second> <count>1</count> <item_version>0</item_version> <item>97</item> </second> </item> <item> <first>773</first> <second> <count>1</count> <item_version>0</item_version> <item>103</item> </second> </item> <item> <first>778</first> <second> <count>1</count> <item_version>0</item_version> <item>108</item> </second> </item> <item> <first>783</first> <second> <count>1</count> <item_version>0</item_version> <item>95</item> </second> </item> <item> <first>788</first> <second> <count>1</count> <item_version>0</item_version> <item>110</item> </second> </item> <item> <first>793</first> <second> <count>1</count> <item_version>0</item_version> <item>113</item> </second> </item> <item> <first>798</first> <second> <count>1</count> <item_version>0</item_version> <item>116</item> </second> </item> </dp_reg_nodes> <dp_regname_nodes> <count>41</count> <item_version>0</item_version> <item> <first>dct_coeff_table_0_addr_reg_683</first> <second> <count>1</count> <item_version>0</item_version> <item>60</item> </second> </item> <item> <first>dct_coeff_table_0_load_reg_698</first> <second> <count>1</count> <item_version>0</item_version> <item>61</item> </second> </item> <item> <first>dct_coeff_table_1_addr_reg_673</first> <second> <count>1</count> <item_version>0</item_version> <item>66</item> </second> </item> <item> <first>dct_coeff_table_1_load_reg_688</first> <second> <count>1</count> <item_version>0</item_version> <item>67</item> </second> </item> <item> <first>dct_coeff_table_2_addr_reg_708</first> <second> <count>1</count> <item_version>0</item_version> <item>72</item> </second> </item> <item> <first>dct_coeff_table_2_load_reg_743</first> <second> <count>1</count> <item_version>0</item_version> <item>73</item> </second> </item> <item> <first>dct_coeff_table_3_addr_reg_693</first> <second> <count>1</count> <item_version>0</item_version> <item>78</item> </second> </item> <item> <first>dct_coeff_table_3_load_reg_713</first> <second> <count>1</count> <item_version>0</item_version> <item>79</item> </second> </item> <item> <first>dct_coeff_table_4_addr_reg_718</first> <second> <count>1</count> <item_version>0</item_version> <item>84</item> </second> </item> <item> <first>dct_coeff_table_4_load_reg_753</first> <second> <count>1</count> <item_version>0</item_version> <item>85</item> </second> </item> <item> <first>dct_coeff_table_5_addr_reg_723</first> <second> <count>1</count> <item_version>0</item_version> <item>90</item> </second> </item> <item> <first>dct_coeff_table_5_load_reg_763</first> <second> <count>1</count> <item_version>0</item_version> <item>91</item> </second> </item> <item> <first>dct_coeff_table_6_addr_reg_733</first> <second> <count>1</count> <item_version>0</item_version> <item>96</item> </second> </item> <item> <first>dct_coeff_table_6_load_reg_768</first> <second> <count>1</count> <item_version>0</item_version> <item>97</item> </second> </item> <item> <first>dct_coeff_table_7_addr_reg_738</first> <second> <count>1</count> <item_version>0</item_version> <item>102</item> </second> </item> <item> <first>dct_coeff_table_7_load_reg_773</first> <second> <count>1</count> <item_version>0</item_version> <item>103</item> </second> </item> <item> <first>exitcond1_reg_653</first> <second> <count>1</count> <item_version>0</item_version> <item>51</item> </second> </item> <item> <first>k_1_reg_657</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>k_reg_267</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>p_addr16_cast_reg_648</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>p_addr7_reg_678</first> <second> <count>1</count> <item_version>0</item_version> <item>118</item> </second> </item> <item> <first>reg_278</first> <second> <count>4</count> <item_version>0</item_version> <item>69</item> <item>63</item> <item>75</item> <item>99</item> </second> </item> <item> <first>reg_282</first> <second> <count>2</count> <item_version>0</item_version> <item>81</item> <item>105</item> </second> </item> <item> <first>src_addr_1_reg_613</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>src_addr_2_reg_618</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>src_addr_3_reg_623</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>src_addr_4_reg_628</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>src_addr_5_reg_633</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>src_addr_6_reg_638</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>src_addr_7_reg_643</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>src_addr_reg_608</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> <item> <first>src_load_4_reg_758</first> <second> <count>1</count> <item_version>0</item_version> <item>87</item> </second> </item> <item> <first>src_load_5_reg_728</first> <second> <count>1</count> <item_version>0</item_version> <item>93</item> </second> </item> <item> <first>tmp1_reg_788</first> <second> <count>1</count> <item_version>0</item_version> <item>110</item> </second> </item> <item> <first>tmp2_reg_778</first> <second> <count>1</count> <item_version>0</item_version> <item>108</item> </second> </item> <item> <first>tmp6_reg_793</first> <second> <count>1</count> <item_version>0</item_version> <item>113</item> </second> </item> <item> <first>tmp_4_reg_798</first> <second> <count>1</count> <item_version>0</item_version> <item>116</item> </second> </item> <item> <first>tmp_8_1_reg_703</first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>tmp_8_3_reg_748</first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>tmp_8_5_reg_783</first> <second> <count>1</count> <item_version>0</item_version> <item>95</item> </second> </item> <item> <first>tmp_reg_662</first> <second> <count>1</count> <item_version>0</item_version> <item>59</item> </second> </item> </dp_regname_nodes> <dp_reg_phi> <count>1</count> <item_version>0</item_version> <item> <first>267</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> </dp_reg_phi> <dp_regname_phi> <count>1</count> <item_version>0</item_version> <item> <first>k_reg_267</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> </dp_regname_phi> <dp_port_io_nodes class_id="59" tracking_level="0" version="0"> <count>5</count> <item_version>0</item_version> <item class_id="60" tracking_level="0" version="0"> <first>dst(p0)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>store</first> <second> <count>1</count> <item_version>0</item_version> <item>121</item> </second> </item> </second> </item> <item> <first>src(p0)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>load</first> <second> <count>8</count> <item_version>0</item_version> <item>69</item> <item>69</item> <item>63</item> <item>63</item> <item>75</item> <item>75</item> <item>99</item> <item>99</item> </second> </item> </second> </item> <item> <first>src(p1)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>load</first> <second> <count>8</count> <item_version>0</item_version> <item>81</item> <item>81</item> <item>93</item> <item>93</item> <item>87</item> <item>87</item> <item>105</item> <item>105</item> </second> </item> </second> </item> <item> <first>tmp_1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> </second> </item> <item> <first>tmp_11</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> </second> </item> </dp_port_io_nodes> <port2core class_id="61" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="62" tracking_level="0" version="0"> <first>1</first> <second>RAM</second> </item> <item> <first>3</first> <second>RAM</second> </item> </port2core> <node2core> <count>0</count> <item_version>0</item_version> </node2core> </syndb> </boost_serialization>

30.074612

95

0.432955