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

2fdde95b258e8eb1182c192f3490b7c00cb775e8

9,837

adb

Ada

awa/plugins/awa-mail/src/aws/awa-mail-clients-aws_smtp.adb

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

81

2015-01-18T23:02:30.000Z

2022-03-19T17:34:57.000Z

awa/plugins/awa-mail/src/aws/awa-mail-clients-aws_smtp.adb

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

20

2015-12-09T19:26:19.000Z

2022-03-23T14:32:43.000Z

awa/plugins/awa-mail/src/aws/awa-mail-clients-aws_smtp.adb

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

16

2015-06-29T02:44:06.000Z

2021-09-23T18:47:50.000Z

----------------------------------------------------------------------- -- awa-mail-clients-aws_smtp -- Mail client implementation on top of AWS SMTP client -- Copyright (C) 2012, 2016, 2017, 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 Ada.Unchecked_Deallocation; with AWS.SMTP.Client; with Util.Log.Loggers; package body AWA.Mail.Clients.AWS_SMTP is use AWS.SMTP; Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("AWA.Mail.Clients.AWS_SMTP"); procedure Free is new Ada.Unchecked_Deallocation (Object => AWS.SMTP.Recipients, Name => Recipients_Access); -- Get a printable representation of the email recipients. function Image (Recipients : in Recipients_Access) return String; -- ------------------------------ -- Set the <tt>From</tt> part of the message. -- ------------------------------ overriding procedure Set_From (Message : in out AWS_Mail_Message; Name : in String; Address : in String) is begin Message.From := AWS.SMTP.E_Mail (Name => Name, Address => Address); end Set_From; -- ------------------------------ -- Add a recipient for the message. -- ------------------------------ overriding procedure Add_Recipient (Message : in out AWS_Mail_Message; Kind : in Recipient_Type; Name : in String; Address : in String) is List : Recipients_Access := Message.To (Kind); begin if List = null then List := new AWS.SMTP.Recipients (1 .. 1); else declare To : constant Recipients_Access := new AWS.SMTP.Recipients (1 .. List'Last + 1); begin List (List'Range) := List.all; Free (List); List := To; end; end if; List (List'Last) := AWS.SMTP.E_Mail (Name => Name, Address => Address); Message.To (Kind) := List; end Add_Recipient; -- ------------------------------ -- Set the subject of the message. -- ------------------------------ overriding procedure Set_Subject (Message : in out AWS_Mail_Message; Subject : in String) is begin Message.Subject := To_Unbounded_String (Subject); end Set_Subject; -- ------------------------------ -- Set the body of the message. -- ------------------------------ overriding procedure Set_Body (Message : in out AWS_Mail_Message; Content : in Unbounded_String; Alternative : in Unbounded_String; Content_Type : in String) is begin if Length (Alternative) = 0 then AWS.Attachments.Add (Message.Attachments, "", AWS.Attachments.Value (To_String (Content))); else declare Parts : AWS.Attachments.Alternatives; begin AWS.Attachments.Add (Parts, AWS.Attachments.Value (To_String (Content), Content_Type => Content_Type)); AWS.Attachments.Add (Parts, AWS.Attachments.Value (To_String (Alternative), Content_Type => "text/plain; charset='UTF-8'")); AWS.Attachments.Add (Message.Attachments, Parts); end; end if; end Set_Body; -- ------------------------------ -- Add an attachment with the given content. -- ------------------------------ overriding procedure Add_Attachment (Message : in out AWS_Mail_Message; Content : in Unbounded_String; Content_Id : in String; Content_Type : in String) is Data : constant AWS.Attachments.Content := AWS.Attachments.Value (Data => To_String (Content), Content_Id => Content_Id, Content_Type => Content_Type); begin AWS.Attachments.Add (Attachments => Message.Attachments, Name => Content_Id, Data => Data); end Add_Attachment; overriding procedure Add_File_Attachment (Message : in out AWS_Mail_Message; Filename : in String; Content_Id : in String; Content_Type : in String) is Data : constant AWS.Attachments.Content := AWS.Attachments.File (Filename => Filename, Encode => AWS.Attachments.Base64, Content_Id => Content_Id, Content_Type => Content_Type); begin AWS.Attachments.Add (Attachments => Message.Attachments, Name => Content_Id, Data => Data); end Add_File_Attachment; -- ------------------------------ -- Get a printable representation of the email recipients. -- ------------------------------ function Image (Recipients : in Recipients_Access) return String is Result : Unbounded_String; begin if Recipients /= null then for I in Recipients'Range loop Append (Result, AWS.SMTP.Image (Recipients (I))); end loop; end if; return To_String (Result); end Image; -- ------------------------------ -- Send the email message. -- ------------------------------ overriding procedure Send (Message : in out AWS_Mail_Message) is function Get_To return AWS.SMTP.Recipients is (if Message.To (Clients.TO) /= null then Message.To (Clients.TO).all else No_Recipient); function Get_Cc return AWS.SMTP.Recipients is (if Message.To (Clients.CC) /= null then Message.To (Clients.CC).all else No_Recipient); function Get_Bcc return AWS.SMTP.Recipients is (if Message.To (Clients.BCC) /= null then Message.To (Clients.BCC).all else No_Recipient); Result : AWS.SMTP.Status; begin if (for all Recipient of Message.To => Recipient = null) then return; end if; if Message.Manager.Enable then Log.Info ("Send email from {0} to {1}", AWS.SMTP.Image (Message.From), Image (Message.To (Clients.TO))); AWS.SMTP.Client.Send (Server => Message.Manager.Server, From => Message.From, To => Get_To, CC => Get_Cc, BCC => Get_Bcc, Subject => To_String (Message.Subject), Attachments => Message.Attachments, Status => Result); if not AWS.SMTP.Is_Ok (Result) then Log.Error ("Cannot send email: {0}", AWS.SMTP.Status_Message (Result)); end if; else Log.Info ("Disable send email from {0} to {1}", AWS.SMTP.Image (Message.From), Image (Message.To (Clients.TO))); end if; end Send; -- ------------------------------ -- Deletes the mail message. -- ------------------------------ overriding procedure Finalize (Message : in out AWS_Mail_Message) is begin Log.Info ("Finalize mail message"); Free (Message.To (AWA.Mail.Clients.TO)); Free (Message.To (AWA.Mail.Clients.CC)); Free (Message.To (AWA.Mail.Clients.BCC)); end Finalize; procedure Initialize (Client : in out AWS_Mail_Manager'Class; Props : in Util.Properties.Manager'Class) is separate; -- ------------------------------ -- Create a SMTP based mail manager and configure it according to the properties. -- ------------------------------ function Create_Manager (Props : in Util.Properties.Manager'Class) return Mail_Manager_Access is Server : constant String := Props.Get (Name => "smtp.host", Default => "localhost"); Port : constant String := Props.Get (Name => "smtp.port", Default => "25"); Enable : constant String := Props.Get (Name => "smtp.enable", Default => "1"); Result : constant AWS_Mail_Manager_Access := new AWS_Mail_Manager; begin Log.Info ("Creating SMTP mail manager to server {0}:{1}", Server, Port); Result.Port := Positive'Value (Port); Result.Enable := Enable = "1" or Enable = "yes" or Enable = "true"; Result.Self := Result; Initialize (Result.all, Props); return Result.all'Access; end Create_Manager; -- ------------------------------ -- Create a new mail message. -- ------------------------------ overriding function Create_Message (Manager : in AWS_Mail_Manager) return Mail_Message_Access is Result : constant AWS_Mail_Message_Access := new AWS_Mail_Message; begin Result.Manager := Manager.Self; return Result.all'Access; end Create_Message; end AWA.Mail.Clients.AWS_SMTP;

39.191235

99

0.527702

220e5739b2ed74673b6ad8d80d0ded74b135497f

264

adb

Ada

day03/src/main.adb

jwarwick/aoc_2019_ada

2168249071d235ec76d8424967811d03e9415f5c

[ "MIT" ]

null

day03/src/main.adb

jwarwick/aoc_2019_ada

2168249071d235ec76d8424967811d03e9415f5c

[ "MIT" ]

null

day03/src/main.adb

jwarwick/aoc_2019_ada

2168249071d235ec76d8424967811d03e9415f5c

[ "MIT" ]

null

-- AOC, Day 3 with Ada.Text_IO; use Ada.Text_IO; with FMS; procedure main is begin FMS.load_file("day3_input.txt"); put_line("Part 1: " & Positive'Image(FMS.closest_intersection)); put_line("Part 2: " & Positive'Image(FMS.shortest_intersection)); end main;

24

67

0.727273

22c0582ac2505562512e52433ba30f444ee20a6f

3,191

ada

Ada

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c4/c48006a.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- C48006A.ADA -- Grant of Unlimited Rights -- -- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687, -- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained -- unlimited rights in the software and documentation contained herein. -- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making -- this public release, the Government intends to confer upon all -- recipients unlimited rights equal to those held by the Government. -- These rights include rights to use, duplicate, release or disclose the -- released technical data and computer software in whole or in part, in -- any manner and for any purpose whatsoever, and to have or permit others -- to do so. -- -- DISCLAIMER -- -- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR -- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED -- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE -- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE -- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A -- PARTICULAR PURPOSE OF SAID MATERIAL. --* -- CHECK THAT AN ALLOCATOR OF THE FORM "NEW T'(X)" ALLOCATES A NEW -- OBJECT EACH TIME IT IS EXECUTED AND THAT IF T IS A SCALAR OR ACCESS -- TYPE, THE ALLOCATED OBJECT HAS THE VALUE OF X. -- RM 01/14/80 -- RM 01/O1/82 -- SPS 10/27/82 -- EG 07/05/84 WITH REPORT; PROCEDURE C48006A IS USE REPORT; BEGIN TEST("C48006A","CHECK THAT THE FORM 'NEW T'(X)' " & "ALLOCATES A NEW OBJECT " & "AND THAT IF T IS A SCALAR OR ACCESS TYPE, THE " & "ALLOCATED OBJECT HAS THE VALUE OF X"); DECLARE TYPE ATA IS ACCESS INTEGER; TYPE AATA IS ACCESS ATA; VA1, VA2, VA3 : ATA; VAA1, VAA2, VAA3 : AATA; BEGIN VA1 := NEW INTEGER'(5 + 7); IF VA1.ALL /= IDENT_INT(12) THEN FAILED("WRONG VALUES - VA1"); END IF; VA2 := NEW INTEGER'(1 + 2); IF (VA1.ALL /= IDENT_INT(12) OR VA2.ALL /= IDENT_INT( 3)) THEN FAILED("WRONG VALUES - VA2"); END IF; VA3 := NEW INTEGER'(IDENT_INT(3) + IDENT_INT(4)); IF (VA1.ALL /= IDENT_INT(12) OR VA2.ALL /= IDENT_INT( 3) OR VA3.ALL /= IDENT_INT( 7)) THEN FAILED("WRONG VALUES - VA3"); END IF; VAA1 := NEW ATA'(NEW INTEGER'(3)); IF VAA1.ALL.ALL /= IDENT_INT(3) THEN FAILED ("WRONG VALUES - VAA1"); END IF; VAA2 := NEW ATA'(NEW INTEGER'(IDENT_INT(5))); IF (VAA1.ALL.ALL /= 3 OR VAA2.ALL.ALL /= 5 ) THEN FAILED ("WRONG VALUES - VAA2"); END IF; VAA3 := NEW ATA'(NEW INTEGER'(IDENT_INT(6))); IF (VAA1.ALL.ALL /= 3 OR VAA2.ALL.ALL /= 5 OR VAA3.ALL.ALL /= 6 ) THEN FAILED ("WRONG VALUES - VAA3"); END IF; END; RESULT; END C48006A;

32.896907

79

0.563146

587940ff94f904edcc895128c781789d82752876

11,396

adb

Ada

disorderly/chi_gaussian_cdf.adb

jscparker/math_packages

b112a90338014d5c2dfae3f7265ee30841fb6cfd

[ "ISC", "MIT" ]

30

2018-12-09T01:15:04.000Z

2022-03-20T16:14:54.000Z

disorderly/chi_gaussian_cdf.adb

jscparker/math_packages

b112a90338014d5c2dfae3f7265ee30841fb6cfd

[ "ISC", "MIT" ]

null

disorderly/chi_gaussian_cdf.adb

jscparker/math_packages

b112a90338014d5c2dfae3f7265ee30841fb6cfd

[ "ISC", "MIT" ]

null

------------------------------------------------------------------------------- -- package body Chi_Gaussian_CDF, CDF of Normal and Chi-square distributions -- Copyright (C) 1995-2018 Jonathan S. Parker -- -- Permission to use, copy, modify, and/or distribute this software for any -- purpose with or without fee is hereby granted, provided that the above -- copyright notice and this permission notice appear in all copies. -- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES -- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF -- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR -- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES -- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN -- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF -- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. ------------------------------------------------------------------------------- with Ada.Numerics.Generic_Elementary_Functions; with Gamma; package body Chi_Gaussian_CDF is package Math is new Ada.Numerics.Generic_Elementary_Functions(Real); use Math; package Gam is new Gamma(Real); use Gam; --provides log_gamma; for reals to 32 digits Real_Epsilon : constant Real := Real'Epsilon * 0.5; -- 4.4*e-16 for ieee Max_Log : constant Real := 666.0; --------------------- -- Chi_Squared_CDF -- --------------------- -- Cumulative distribution function for Chi^2 distribution. function Chi_Squared_CDF (True_Degrees_Freedom : Real; Chi_Squared : Real) return Real is a : constant Real := True_Degrees_Freedom * 0.5; x : constant Real := Chi_Squared * 0.5; begin if not x'Valid then raise Constraint_Error; end if; -- In some cases, input of (say) inf or NaN will make numeric programs -- hang rather than crash .. very difficult to diagnose, so this seems -- best policy for function calls that are rarely found in time-sensitive -- inner loops return Incomplete_Gamma (a, x); end Chi_Squared_CDF; function Normal_CDF_x (x : in Real) return Real; ----------------- -- Normal_CDF -- ----------------- -- Cumulative distribution function for Standard Normal Distribution. -- -- Normal (v) = exp(-v*v/2) / Sqrt(2 pi) -- -- Want to integrate this from -inf to x using the Incomplete Gamma function: -- -- Inc_Gamma(a, w) = Int{from 0 to w} [exp(-t) t**(a-1) dt] / Gamma(a) -- -- Set a = 0.5. Use Gamma(0.5) = Sqrt(pi) and let t = u*u/2: -- -- Inc_Gamma(0.5, w) = Int{from 0 to sqrt(2w)} [2 exp(-v*v/2) dv] / Sqrt(2 pi) -- -- Inc_Gamma(0.5, x*x/2) / 2 = Int{from 0 to x)} [exp(-v*v/2) dv] / Sqrt(2 pi) -- -- function Normal_CDF (x : Real) return Real is a : constant Real := 0.5; begin if not x'Valid then raise Constraint_Error; end if; -- In some cases, input of (say) inf or NaN will make numeric programs -- hang rather than crash .. very difficult to diagnose, so this seems -- best policy for function calls that are rarely found in time-sensitive -- inner loops. if x > 0.0 then return 0.5 * (1.0 + Incomplete_Gamma (a, x*x*0.5)); elsif x <= -4.5 then return Normal_CDF_x (x); -- get better accuracy here out on tail. else return 0.5 * (1.0 - Incomplete_Gamma (a, x*x*0.5)); end if; end Normal_CDF; ------------------------ -- Incomplete_Gamma_C -- ------------------------ -- This is the complemented Incomplete_Gamma function: -- -- Incomplete_Gamma_C (a,x) -- = Integral {t=x to inf} [exp(-t) * t**(a-1) * dt] / Gamma(a) -- -- Notice that because the integrals are nomalized by 1 / Gamma(a): -- -- Incomplete_Gamma (a,x) + Incomplete_Gamma_C (a,x) = 1.0 -- -- Uses Gauss' (c. 1813) continued fraction (see wikipedia for inc. gamma) -- function Incomplete_Gamma_C (a : Real; x : Real) return Real is Exagam, Arg : Real; C_Fraction, N, g_2, g_1 : Real; r, t : Real; P, P_1, P_2 : Real; Q, Q_1, Q_2 : Real; Max_Allowed_Val : constant Real := 2.0**48; Reciprocal_of_Max_Allowed_Val : constant Real := 2.0**(-48); Min_Allowed_Real : constant Real := 2.0**(Real'Machine_Emin / 2); begin if not x'Valid then raise Constraint_Error; end if; if (x <= 0.0) or (a <= 0.0) then return 1.0; end if; -- Use series solution for small x: if (x < 1.0) or (x < a) then return 1.0 - Incomplete_Gamma(a,x); end if; -- Exagam := x**a * Exp(-x) / Gamma(a): Arg := a * Log (x) - x - Log_Gamma (a); -- notice never gets big > 0 if x>0 if (Arg < -Max_Log) then return 0.0; else Exagam := Exp (Arg); end if; N := 0.0; g_1 := x - a + 2.0; P_2 := 1.0; --P(-2) Q_2 := x; --Q(-2) P_1 := x + 1.0; --P(-1) Q_1 := Q_2 * g_1; --Q(-1) C_Fraction := P_1 / Q_1; Continued_Fraction_Evaluation: loop N := N + 1.0; g_1 := g_1 + 2.0; g_2 := (N + 1.0 - a) * N; P := P_1 * g_1 - P_2 * g_2; Q := Q_1 * g_1 - Q_2 * g_2; if (Abs Q > Min_Allowed_Real) then r := P / Q; t := Abs ((C_Fraction - r) / r); C_Fraction := r; else t := 1.0; end if; -- scale P's and Q's identically with 2.0**n if P gets too large. -- Final answer is P/Q. P_2 := P_1; P_1 := P; Q_2 := Q_1; Q_1 := Q; if (Abs (P) > Max_Allowed_Val) then P_2 := P_2 * Reciprocal_of_Max_Allowed_Val; P_1 := P_1 * Reciprocal_of_Max_Allowed_Val; Q_2 := Q_2 * Reciprocal_of_Max_Allowed_Val; Q_1 := Q_1 * Reciprocal_of_Max_Allowed_Val; end if; if (t < Real_Epsilon) then exit Continued_Fraction_Evaluation; end if; end loop Continued_Fraction_Evaluation; return C_Fraction * Exagam; end Incomplete_Gamma_C; ---------------------- -- Incomplete_Gamma -- ---------------------- -- Incomplete_Gamma (a,x) = Integral {t=0 to x} [exp(-t) * t**(a-1) * dt] / Gamma(a) -- -- Notice as x -> inf, the Integral -> Gamma(a), and Incomplete_Gamma (a,x) -> 1.0 -- -- Abramowitz, Stegun 6.5.29: -- -- = Exp(-x) * x**a * Sum {k=0 to inf} [x**k / Gamma(a+k+1)] -- -- use Gamma(a+1) = a * Gamma(a): -- -- = Exp(-x) * x**a * Sum {k=0 to inf} [a! * (-x)**k / (a+k)!] / Gamma(a) -- -- = Exp(-x) * x**a * [1/a + x/(a(a+1)) + x^2/(a(a+1)(a+2)) + ...] / Gamma(a) -- function Incomplete_Gamma (a : Real; x : Real) return Real is Sum, Exagam, Arg, Next_Term, a_plus_n : Real; begin if not x'Valid then raise Constraint_Error; end if; if (x <= 0.0) or (a <= 0.0) then return 0.0; end if; if not ((x < 1.0) or (x < a)) then return (1.0 - Incomplete_Gamma_C (a,x)); end if; -- Exagam := x**a * Exp(-x) / Gamma(a): Arg := a * Log (x) - x - Log_Gamma (a); if Arg < -Max_Log then return 0.0; else Exagam := Exp (Arg); end if; -- -- (Exp(-x) * x**a / Gamma(a))* [1/a + x/(a(a+1)) + x^2/(a(a+1)(a+2)) + ...] -- -- factor out the 1/a: -- -- = (Exagam / a) * [1 + x/(a+1) + x^2/((a+1)(a+2)) + ...] -- a_plus_n := a; -- n = 0 Next_Term := 1.0; Sum := 1.0; -- max number of allowed iterations arbitrarily set at 2**12: Series_Summation: for Iteration_id in 1 .. 2**12 loop a_plus_n := a_plus_n + 1.0; Next_Term := Next_Term * x / a_plus_n; Sum := Sum + Next_Term; if (Next_Term/Sum < Real_Epsilon) then exit Series_Summation; end if; end loop Series_Summation; return Sum * Exagam / a; end Incomplete_Gamma; ------------------ -- Normal_CDF_x -- ------------------ -- Here just used for x out on tail, where it seems more accurate -- than the other method used above. -- -- Evaluates the cumulative distribution function of a gaussian. -- Finds area of the standardized normal distribution -- (normalized gaussian with unit width) from -inf to x. -- based on Algorithm AS66 Applied Statistics (1973) vol.22, no.3. -- Usually 7 digits accuracy; better on x<<0 tail. function Normal_CDF_x (x : in Real) return Real is z, y, Result : Real; con : constant Real := 1.28; ltone : constant Real := 7.0; utzero : constant Real := 40.0; p : constant Real := 0.398942280444; q : constant Real := 0.39990348504; r : constant Real := 0.398942280385; a1 : constant Real := 5.75885480458; a2 : constant Real := 2.62433121679; a3 : constant Real := 5.92885724438; b1 : constant Real :=-29.8213557807; b2 : constant Real := 48.6959930692; c1 : constant Real :=-3.8052E-8; c2 : constant Real := 3.98064794E-4; c3 : constant Real :=-0.151679116635; c4 : constant Real := 4.8385912808; c5 : constant Real := 0.742380924027; c6 : constant Real := 3.99019417011; d1 : constant Real := 1.00000615302; d2 : constant Real := 1.98615381364; d3 : constant Real := 5.29330324926; d4 : constant Real :=-15.1508972451; d5 : constant Real := 30.789933034; begin if not x'Valid then raise Constraint_Error; end if; z := Abs (x); if (z <= ltone OR (x < 0.0 AND (z <= utzero)) ) then y := 0.5*z*z; if (z > con) then Result := r*Exp(-y) / (z+c1+d1/(z+c2+d2/(z+c3+d3/(z+c4+d4/(z+c5+d5/(z+c6)))))); else Result := 0.5 - z*(p-q*y/(y+a1+b1/(y+a2+b2/(y+a3)))); end if; else Result := 0.0; end if; if (x >= 0.0) then Result := 1.0 - Result; end if; return Result; end Normal_CDF_x; -- rough test; more of working order than actual accuracy procedure Test_Normal_CDF (x_0 : in Real; Error : out Real) is Delta_x : constant Real := 2.0**(-6); -- 6 ok. type First_Deriv_Range_17 is range -8 .. 8; d_17 : constant array(First_Deriv_Range_17) of Real := (9.71250971250971250971250971250971250E-6 , -1.77600177600177600177600177600177600E-4 , 1.55400155400155400155400155400155400E-3 , -8.70240870240870240870240870240870240E-3 , 3.53535353535353535353535353535353535E-2 , -1.13131313131313131313131313131313131E-1 , 3.11111111111111111111111111111111111E-1 , -8.88888888888888888888888888888888888E-1 , 0.0, 8.88888888888888888888888888888888888E-1 , -3.11111111111111111111111111111111111E-1 , 1.13131313131313131313131313131313131E-1 , -3.53535353535353535353535353535353535E-2 , 8.70240870240870240870240870240870240E-3 , -1.55400155400155400155400155400155400E-3 , 1.77600177600177600177600177600177600E-4 , -9.71250971250971250971250971250971250E-6); One_over_sqrt_2_pi : constant := 0.398942280401432677939946; sum, x, Integral_of_Gaussian, Deriv : Real; begin sum := 0.0; for i in First_Deriv_Range_17 loop x := x_0 + Real(i)*Delta_x; Integral_of_Gaussian := Normal_CDF (x); sum := sum + d_17 (i) * Integral_of_Gaussian; end loop; Deriv := sum / Delta_x; -- relative --Error := (Deriv - Exp (-x_0**2 * 0.5) * One_over_sqrt_2_pi) / (Abs(Deriv)+1.0e-307); -- absolute Error := (Deriv - Exp (-x_0**2 * 0.5) * One_over_sqrt_2_pi); end Test_Normal_CDF; end Chi_Gaussian_CDF;

29.447028

88

0.585381

5707d7263f7f6d70348fe42f9ad41dfa0bcecd11

3,792

ads

Ada

tools/scitools/conf/understand/ada/ada05/g-casuti.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

1

2020-01-20T21:26:46.000Z

tools/scitools/conf/understand/ada/ada05/g-casuti.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

tools/scitools/conf/understand/ada/ada05/g-casuti.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- G N A T . C A S E _ U T I L -- -- -- -- S p e c -- -- -- -- Copyright (C) 1995-2005, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- -- -- -- -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- Simple casing functions -- This package provides simple casing functions that do not require the -- overhead of the full casing tables found in Ada.Characters.Handling. -- Note: actual code is found in System.Case_Util, which is used internally -- by the GNAT run time. Applications programs should always use this package -- rather than using System.Case_Util directly. with System.Case_Util; package GNAT.Case_Util is pragma Pure; pragma Elaborate_Body; -- The elaborate body is because we have a dummy body to deal with -- bootstrap path problems (we used to have a real body, and now we don't -- need it any more, but the bootstrap requires that we have a dummy body, -- since otherwise the old body gets picked up. -- Note: all the following functions handle the full Latin-1 set function To_Upper (A : Character) return Character renames System.Case_Util.To_Upper; -- Converts A to upper case if it is a lower case letter, otherwise -- returns the input argument unchanged. procedure To_Upper (A : in out String) renames System.Case_Util.To_Upper; -- Folds all characters of string A to upper csae function To_Lower (A : Character) return Character renames System.Case_Util.To_Lower; -- Converts A to lower case if it is an upper case letter, otherwise -- returns the input argument unchanged. procedure To_Lower (A : in out String) renames System.Case_Util.To_Lower; -- Folds all characters of string A to lower case procedure To_Mixed (A : in out String) renames System.Case_Util.To_Mixed; -- Converts A to mixed case (i.e. lower case, except for initial -- character and any character after an underscore, which are -- converted to upper case. end GNAT.Case_Util;

47.4

78

0.530327

58aac610fc55beae78a1d23df85b4a05013fe342

59,655

adb

Ada

src/replicant.adb

Qrbaker/synth

2e4436de6a0614d5c79eb2fc9c27fb597c506210

[ "0BSD" ]

null

src/replicant.adb

Qrbaker/synth

2e4436de6a0614d5c79eb2fc9c27fb597c506210

[ "0BSD" ]

null

src/replicant.adb

Qrbaker/synth

2e4436de6a0614d5c79eb2fc9c27fb597c506210

[ "0BSD" ]

null

-- This file is covered by the Internet Software Consortium (ISC) License -- Reference: ../License.txt with Replicant.Platform; with Ada.Containers.Vectors; with Ada.Exceptions; with GNAT.OS_Lib; package body Replicant is package AC renames Ada.Containers; package EX renames Ada.Exceptions; package OSL renames GNAT.OS_Lib; package PLT renames Replicant.Platform; ------------------- -- mount_point -- ------------------- function location (mount_base : String; point : folder) return String is begin case point is when bin => return mount_base & root_bin; when sbin => return mount_base & root_sbin; when usr_bin => return mount_base & root_usr_bin; when usr_games => return mount_base & root_usr_games; when usr_include => return mount_base & root_usr_include; when usr_lib => return mount_base & root_usr_lib; when usr_lib32 => return mount_base & root_usr_lib32; when usr_libdata => return mount_base & root_usr_libdata; when usr_libexec => return mount_base & root_usr_libexec; when usr_local => return mount_base & root_localbase; when usr_sbin => return mount_base & root_usr_sbin; when usr_share => return mount_base & root_usr_share; when usr_src => return mount_base & root_usr_src; when usr_x11r7 => return mount_base & root_X11R7; when lib => return mount_base & root_lib; when dev => return mount_base & root_dev; when etc => return mount_base & root_etc; when etc_default => return mount_base & root_etc_default; when etc_mtree => return mount_base & root_etc_mtree; when etc_rcd => return mount_base & root_etc_rcd; when tmp => return mount_base & root_tmp; when var => return mount_base & root_var; when home => return mount_base & root_home; when proc => return mount_base & root_proc; when linux => return mount_base & root_linux; when boot => return mount_base & root_boot; when root => return mount_base & root_root; when xports => return mount_base & root_xports; when options => return mount_base & root_options; when libexec => return mount_base & root_libexec; when packages => return mount_base & root_packages; when distfiles => return mount_base & root_distfiles; when wrkdirs => return mount_base & root_wrkdirs; when ccache => return mount_base & root_ccache; end case; end location; -------------------- -- mount_target -- -------------------- function mount_target (point : folder) return String is begin case point is when xports => return JT.USS (PM.configuration.dir_portsdir); when options => return JT.USS (PM.configuration.dir_options); when packages => return JT.USS (PM.configuration.dir_packages); when distfiles => return JT.USS (PM.configuration.dir_distfiles); when ccache => return JT.USS (PM.configuration.dir_ccache); when others => return "ERROR"; end case; end mount_target; ------------------------ -- get_master_mount -- ------------------------ function get_master_mount return String is begin return JT.USS (PM.configuration.dir_buildbase) & "/" & reference_base; end get_master_mount; ----------------------- -- get_slave_mount -- ----------------------- function get_slave_mount (id : builders) return String is begin return JT.USS (PM.configuration.dir_buildbase) & "/" & slave_name (id); end get_slave_mount; ------------------------------ -- procedure set_platform -- ------------------------------ procedure set_platform is begin if JT.equivalent (PM.configuration.operating_sys, "FreeBSD") then platform_type := freebsd; elsif JT.equivalent (PM.configuration.operating_sys, "NetBSD") then platform_type := netbsd; elsif JT.equivalent (PM.configuration.operating_sys, "Linux") then platform_type := linux; elsif JT.equivalent (PM.configuration.operating_sys, "SunOS") then platform_type := solaris; else platform_type := dragonfly; end if; end set_platform; ------------------ -- initialize -- ------------------ procedure initialize (testmode : Boolean; num_cores : cpu_range) is mm : constant String := get_master_mount; etcmp : constant String := "/etc/master.passwd"; command : constant String := "/usr/sbin/pwd_mkdb -p -d "; begin smp_cores := num_cores; developer_mode := testmode; support_locks := testmode and then Unix.env_variable_defined ("LOCK"); start_abnormal_logging; if AD.Exists (mm) then annihilate_directory_tree (mm); end if; AD.Create_Path (mm & "/etc"); case platform_type is when dragonfly | netbsd | freebsd => create_base_passwd (mm); when linux => null; -- master.passwd not used when solaris => null; -- master.passwd not used when unknown => null; end case; create_base_group (mm); case platform_type is when dragonfly | freebsd => execute (command & mm & "/etc " & mm & etcmp); when netbsd => execute (command & mm & " " & mm & etcmp); when others => null; end case; PLT.cache_port_variables (mm); create_mtree_exc_preinst (mm); create_mtree_exc_preconfig (mm); end initialize; ---------------- -- finalize -- ---------------- procedure finalize is mm : constant String := get_master_mount; begin if AD.Exists (mm) then annihilate_directory_tree (mm); end if; stop_abnormal_logging; end finalize; -------------------- -- mount_nullfs -- -------------------- procedure mount_nullfs (target, mount_point : String; mode : mount_mode := readonly) is cmd_freebsd : constant String := "/sbin/mount_nullfs"; cmd_dragonfly : constant String := "/sbin/mount_null"; cmd_solaris : constant String := "/usr/sbin/mount -F lofs"; cmd_linux : constant String := "/usr/bin/mount --bind"; command : JT.Text; begin if not AD.Exists (mount_point) then raise scenario_unexpected with "mount point " & mount_point & " does not exist"; end if; if not AD.Exists (target) then raise scenario_unexpected with "mount target " & target & " does not exist"; end if; case platform_type is when freebsd => command := JT.SUS (cmd_freebsd); when dragonfly | netbsd => command := JT.SUS (cmd_dragonfly); when solaris => command := JT.SUS (cmd_solaris); when linux => command := JT.SUS (cmd_linux); when unknown => raise scenario_unexpected with "Mounting on unknown operating system"; end case; case mode is when readonly => JT.SU.Append (command, " -o ro"); when readwrite => null; end case; JT.SU.Append (command, " " & target); JT.SU.Append (command, " " & mount_point); execute (JT.USS (command)); end mount_nullfs; ----------------------- -- mount_linprocfs -- ----------------------- procedure mount_linprocfs (mount_point : String) is cmd_freebsd : constant String := "/sbin/mount -t linprocfs linproc " & mount_point; cmd_netbsd : constant String := "/sbin/mount_procfs -o linux procfs " & mount_point; begin -- DragonFly has lost it's Linux Emulation capability. -- FreeBSD has it for both amd64 and i386 -- We should return if FreeBSD arch is not amd64 or i386, but synth -- will not run on any other arches at the moment, so we don't have -- to check (and we don't have that information yet anyway) case platform_type is when freebsd => execute (cmd_freebsd); when netbsd => execute (cmd_netbsd); when dragonfly => null; when solaris => null; when linux => null; when unknown => null; end case; end mount_linprocfs; ------------------------------ -- set_mount_as_read_only -- ------------------------------ procedure set_mount_as_read_only (mount_point : String) is -- synth only supports BSD these days command : constant String := "/sbin/umount -u -o ro " & mount_point; begin execute (command); exception when others => TIO.Put_Line (abnormal_log, "Failed to set mount to read-only mode: " & mount_point); end set_mount_as_read_only; --------------- -- unmount -- --------------- procedure unmount (device_or_node : String) is bsd_command : constant String := "/sbin/umount " & device_or_node; sol_command : constant String := "/usr/sbin/umount " & device_or_node; lin_command : constant String := "/usr/bin/umount " & device_or_node; begin -- failure to unmount causes stderr squawks which messes up curses display -- Just log it and ignore for now (Add robustness later) case platform_type is when dragonfly | freebsd | netbsd => execute (bsd_command); when linux => execute (lin_command); when solaris => execute (sol_command); when unknown => null; end case; exception when others => TIO.Put_Line (abnormal_log, "Failed to umount " & device_or_node); TIO.Put_Line (abnormal_log, "Resetting " & device_or_node & " to read-only mode"); set_mount_as_read_only (device_or_node); end unmount; ----------------------- -- forge_directory -- ----------------------- procedure forge_directory (target : String) is begin AD.Create_Path (New_Directory => target); exception when failed : others => TIO.Put_Line (EX.Exception_Information (failed)); raise scenario_unexpected with "failed to create " & target & " directory"; end forge_directory; ------------------- -- mount_tmpfs -- ------------------- procedure mount_tmpfs (mount_point : String; max_size_M : Natural := 0) is cmd_freebsd : constant String := "/sbin/mount -t tmpfs"; cmd_dragonfly : constant String := "/sbin/mount_tmpfs"; cmd_solaris : constant String := "/sbin/mount -F tmpfs"; command : JT.Text; begin case platform_type is when freebsd | netbsd | linux => command := JT.SUS (cmd_freebsd); when dragonfly => command := JT.SUS (cmd_dragonfly); when solaris => command := JT.SUS (cmd_solaris); when unknown => raise scenario_unexpected with "Mounting on unknown operating system"; end case; if max_size_M > 0 then JT.SU.Append (command, " -o size=" & JT.trim (max_size_M'Img) & "M"); end if; case platform_type is when solaris => JT.SU.Append (command, " swap " & mount_point); when freebsd | dragonfly | netbsd | linux => JT.SU.Append (command, " tmpfs " & mount_point); when unknown => null; end case; execute (JT.USS (command)); end mount_tmpfs; --------------------- -- mount_devices -- --------------------- procedure mount_devices (path_to_dev : String) is bsd_command : constant String := "/sbin/mount -t devfs devfs " & path_to_dev; lin_command : constant String := "/usr/bin/mount --bind /dev " & path_to_dev; begin case platform_type is when dragonfly | freebsd => execute (bsd_command); when linux => execute (lin_command); when netbsd => mount_nullfs (target => "/dev", mount_point => path_to_dev); when solaris => null; when unknown => null; end case; end mount_devices; ----------------------- -- unmount_devices -- ----------------------- procedure unmount_devices (path_to_dev : String) is begin case platform_type is when dragonfly | freebsd | linux => unmount (path_to_dev); when netbsd => unmount (path_to_dev); when solaris => null; when unknown => null; end case; end unmount_devices; -------------------- -- mount_procfs -- -------------------- procedure mount_procfs (path_to_proc : String) is bsd_command : constant String := "/sbin/mount -t procfs proc " & path_to_proc; net_command : constant String := "/sbin/mount_procfs /proc " & path_to_proc; lin_command : constant String := "/usr/bin/mount --bind /proc " & path_to_proc; begin case platform_type is when dragonfly | freebsd => execute (bsd_command); when netbsd => execute (net_command); when linux => execute (lin_command); when solaris => null; when unknown => null; end case; end mount_procfs; --------------------- -- umount_procfs -- --------------------- procedure unmount_procfs (path_to_proc : String) is begin case platform_type is when dragonfly | freebsd | netbsd | linux => unmount (path_to_proc); when solaris => null; when unknown => null; end case; end unmount_procfs; ------------------ -- get_suffix -- ------------------ function slave_name (id : builders) return String is id_image : constant String := Integer (id)'Img; suffix : String := "SL00"; begin if id < 10 then suffix (4) := id_image (2); else suffix (3 .. 4) := id_image (2 .. 3); end if; return suffix; end slave_name; --------------------- -- folder_access -- --------------------- procedure folder_access (path : String; operation : folder_operation) is cmd_fallback : constant String := "/bin/chmod"; fback_lock : constant String := " 555 "; fback_unlock : constant String := " 755 "; command : JT.Text := JT.SUS (cmd_fallback); begin if not AD.Exists (path) then return; end if; case operation is when lock => JT.SU.Append (command, fback_lock & path); when unlock => JT.SU.Append (command, fback_unlock & path); end case; execute (JT.USS (command)); end folder_access; ---------------------- -- create_symlink -- ---------------------- procedure create_symlink (destination, symbolic_link : String) is bsd_command : constant String := "/bin/ln -s "; lin_command : constant String := "/usr/bin/ln -s "; begin case platform_type is when dragonfly | freebsd | netbsd | solaris => execute (bsd_command & destination & " " & symbolic_link); when linux => execute (lin_command & destination & " " & symbolic_link); when unknown => raise scenario_unexpected with "Executing ln on unknown operating system"; end case; end create_symlink; --------------------------- -- populate_var_folder -- --------------------------- procedure populate_var_folder (path : String) is bsd_command : constant String := "/usr/sbin/mtree -p " & path & " -f /etc/mtree/BSD.var.dist -deqU"; net_command : constant String := "/usr/sbin/mtree -p " & path & " -f /etc/mtree/special -deqU"; begin case platform_type is when dragonfly | freebsd => silent_exec (bsd_command); when netbsd => silent_exec (net_command); when linux => null; when solaris => null; when unknown => null; end case; end populate_var_folder; --------------- -- execute -- --------------- procedure execute (command : String) is Exit_Status : Integer; output : JT.Text := Unix.piped_command (command, Exit_Status); begin if abn_log_ready and then not JT.IsBlank (output) then TIO.Put_Line (abnormal_log, JT.USS (output)); end if; if Exit_Status /= 0 then raise scenario_unexpected with command & " => failed with code" & Exit_Status'Img; end if; end execute; ------------------- -- silent_exec -- ------------------- procedure silent_exec (command : String) is cmd_output : JT.Text; success : Boolean := Unix.piped_mute_command (command, cmd_output); begin if not success then if abn_log_ready and then not JT.IsBlank (cmd_output) then TIO.Put_Line (abnormal_log, "piped_mute_command failure:"); TIO.Put_Line (abnormal_log, JT.USS (cmd_output)); end if; raise scenario_unexpected with command & " => failed (exit code not 0)"; end if; end silent_exec; ------------------------------ -- internal_system_command -- ------------------------------ function internal_system_command (command : String) return JT.Text is content : JT.Text; status : Integer; begin content := Unix.piped_command (command, status); if status /= 0 then raise scenario_unexpected with "cmd: " & command & " (return code =" & status'Img & ")"; end if; return content; end internal_system_command; ------------------------- -- create_base_group -- ------------------------- procedure create_base_group (path_to_mm : String) is subtype sysgroup is String (1 .. 8); type groupset is array (1 .. 52) of sysgroup; users : constant groupset := ("wheel ", "daemon ", "kmem ", "sys ", "tty ", "operator", "mail ", "bin ", "news ", "man ", "games ", "staff ", "sshd ", "smmsp ", "mailnull", "guest ", "bind ", "proxy ", "authpf ", "_pflogd ", "unbound ", "ftp ", "video ", "hast ", "uucp ", "xten ", "dialer ", "network ", "_sdpd ", "_dhcp ", "www ", "vknet ", "nogroup ", "nobody ", -- Unique to NetBSD "wsrc ", "maildrop", "postfix ", "named ", "ntpd ", "_rwhod ", "_proxy ", "_timedc ", "_httpd ", "_mdnsd ", "_tests ", "_tcpdump", "_tss ", "_gpio ", "_rtadvd ", "_unbound", "utmp ", "users "); group : TIO.File_Type; live_file : TIO.File_Type; keepit : Boolean; target : constant String := path_to_mm & "/group"; live_origin : constant String := "/etc/group"; begin TIO.Open (File => live_file, Mode => TIO.In_File, Name => live_origin); TIO.Create (File => group, Mode => TIO.Out_File, Name => target); while not TIO.End_Of_File (live_file) loop keepit := False; declare line : String := TIO.Get_Line (live_file); begin for grpindex in groupset'Range loop declare grpcolon : String := JT.trim (users (grpindex)) & ":"; begin if grpcolon'Length <= line'Length then if grpcolon = line (1 .. grpcolon'Last) then keepit := True; exit; end if; end if; end; end loop; if keepit then TIO.Put_Line (group, line); end if; end; end loop; TIO.Close (live_file); TIO.Close (group); end create_base_group; -------------------------- -- create_base_passwd -- -------------------------- procedure create_base_passwd (path_to_mm : String) is subtype syspasswd is String (1 .. 10); type passwdset is array (1 .. 41) of syspasswd; users : constant passwdset := ("root ", "toor ", "daemon ", "operator ", "bin ", "tty ", "kmem ", "mail ", "games ", "news ", "man ", "sshd ", "smmsp ", "mailnull ", "bind ", "unbound ", "proxy ", "_pflogd ", "_dhcp ", "uucp ", "xten ", "pop ", "auditdistd", "_sdpd ", "www ", "_ypldap ", "hast ", "nobody ", -- Unique to NetBSD "postfix ", "named ", "ntpd ", "_rwhod ", "_proxy ", "_timedc ", "_httpd ", "_mdnsd ", "_tests ", "_tcpdump ", "_tss ", "_rtadvd ", "_unbound "); masterpwd : TIO.File_Type; live_file : TIO.File_Type; keepit : Boolean; live_origin : constant String := "/etc/master.passwd"; target : constant String := path_to_mm & live_origin; begin TIO.Open (File => live_file, Mode => TIO.In_File, Name => live_origin); TIO.Create (File => masterpwd, Mode => TIO.Out_File, Name => target); while not TIO.End_Of_File (live_file) loop keepit := False; declare line : String := TIO.Get_Line (live_file); begin for pwdindex in passwdset'Range loop declare pwdcolon : String := JT.trim (users (pwdindex)) & ":"; begin if pwdcolon'Length <= line'Length then if pwdcolon = line (1 .. pwdcolon'Last) then keepit := True; exit; end if; end if; end; end loop; if keepit then TIO.Put_Line (masterpwd, line); end if; end; end loop; TIO.Close (live_file); TIO.Close (masterpwd); end create_base_passwd; -------------------- -- create_group -- -------------------- procedure create_group (path_to_etc : String) is mm : constant String := get_master_mount; group : constant String := "/group"; begin AD.Copy_File (Source_Name => mm & group, Target_Name => path_to_etc & group); end create_group; --------------------- -- create_passwd -- --------------------- procedure create_passwd (path_to_etc : String) is mmetc : constant String := get_master_mount & "/etc"; maspwd : constant String := "/master.passwd"; passwd : constant String := "/passwd"; spwd : constant String := "/spwd.db"; pwd : constant String := "/pwd.db"; begin AD.Copy_File (Source_Name => mmetc & passwd, Target_Name => path_to_etc & passwd); AD.Copy_File (Source_Name => mmetc & maspwd, Target_Name => path_to_etc & maspwd); AD.Copy_File (Source_Name => mmetc & spwd, Target_Name => path_to_etc & spwd); AD.Copy_File (Source_Name => mmetc & pwd, Target_Name => path_to_etc & pwd); end create_passwd; ------------------------ -- copy_mtree_files -- ------------------------ procedure copy_mtree_files (path_to_mtree : String) is mtree : constant String := "/etc/mtree"; root : constant String := "/BSD.root.dist"; usr : constant String := "/BSD.usr.dist"; var : constant String := "/BSD.var.dist"; spec : constant String := "/special"; begin case platform_type is when dragonfly | freebsd => AD.Copy_File (Source_Name => mtree & root, Target_Name => path_to_mtree & root); AD.Copy_File (Source_Name => mtree & usr, Target_Name => path_to_mtree & usr); AD.Copy_File (Source_Name => mtree & var, Target_Name => path_to_mtree & var); when netbsd => AD.Copy_File (Source_Name => mtree & spec, Target_Name => path_to_mtree & spec); when solaris => null; when linux => null; when unknown => null; end case; end copy_mtree_files; ------------------------ -- create_make_conf -- ------------------------ procedure create_make_conf (path_to_etc : String; skip_cwrappers : Boolean) is makeconf : TIO.File_Type; profilemc : constant String := PM.synth_confdir & "/" & JT.USS (PM.configuration.profile) & "-make.conf"; varcache : constant String := get_master_mount & "/varcache.conf"; profile : constant String := JT.USS (PM.configuration.profile); mjnum : constant Integer := Integer (PM.configuration.jobs_limit); begin case software_framework is when ports_collection => TIO.Create (File => makeconf, Mode => TIO.Out_File, Name => path_to_etc & "/make.conf"); TIO.Put_Line (makeconf, "SYNTHPROFILE=" & profile & LAT.LF & "USE_PACKAGE_DEPENDS_ONLY=yes" & LAT.LF & "PACKAGE_BUILDING=yes" & LAT.LF & "BATCH=yes" & LAT.LF & "PKG_CREATE_VERBOSE=yes" & LAT.LF & "PORTSDIR=/xports" & LAT.LF & "DISTDIR=/distfiles" & LAT.LF & "WRKDIRPREFIX=/construction" & LAT.LF & "PORT_DBDIR=/options" & LAT.LF & "PACKAGES=/packages" & LAT.LF & "MAKE_JOBS_NUMBER_LIMIT=" & JT.int2str (mjnum)); if developer_mode then TIO.Put_Line (makeconf, "DEVELOPER=1"); end if; if AD.Exists (JT.USS (PM.configuration.dir_ccache)) then TIO.Put_Line (makeconf, "WITH_CCACHE_BUILD=yes"); TIO.Put_Line (makeconf, "CCACHE_DIR=/ccache"); end if; when pkgsrc => TIO.Create (File => makeconf, Mode => TIO.Out_File, Name => path_to_etc & "/mk.conf"); -- Note there is no equivalent for PORT_DBDIR -- Custom options must be set in <profile>-make.conf TIO.Put_Line (makeconf, "SYNTHPROFILE=" & profile & LAT.LF & "USE_PACKAGE_DEPENDS_ONLY=yes" & LAT.LF & "PACKAGE_BUILDING=yes" & LAT.LF & "ALLOW_VULNERABLE_PACKAGES=yes" & LAT.LF & "PKG_CREATE_VERBOSE=yes" & LAT.LF & "PKG_FORMAT=pkgng" & LAT.LF & "PKGSRCDIR=/xports" & LAT.LF & "DISTDIR=/distfiles" & LAT.LF & "WRKOBJDIR=/construction" & LAT.LF & "PACKAGES=/packages" & LAT.LF & "MAKE_JOBS=" & JT.int2str (mjnum)); if skip_cwrappers then TIO.Put_Line (makeconf, "USE_CWRAPPERS=no"); end if; if developer_mode then TIO.Put_Line (makeconf, "PKG_DEVELOPER=yes"); end if; if AD.Exists (JT.USS (PM.configuration.dir_ccache)) then TIO.Put_Line (makeconf, "PKGSRC_COMPILER=ccache gcc"); TIO.Put_Line (makeconf, "CCACHE_DIR=/ccache"); end if; end case; concatenate_makeconf (makeconf, profilemc); concatenate_makeconf (makeconf, varcache); TIO.Close (makeconf); end create_make_conf; ------------------------ -- copy_resolv_conf -- ------------------------ procedure copy_resolv_conf (path_to_etc : String) is original : constant String := "/etc/resolv.conf"; begin if not AD.Exists (original) then return; end if; AD.Copy_File (Source_Name => original, Target_Name => path_to_etc & "/resolv.conf"); end copy_resolv_conf; ----------------------- -- copy_rc_default -- ----------------------- procedure copy_rc_default (path_to_etc : String) is rc_default : constant String := "/defaults/rc.conf"; etc_rcconf : constant String := "/etc" & rc_default; begin if not AD.Exists (etc_rcconf) then return; end if; AD.Copy_File (Source_Name => etc_rcconf, Target_Name => path_to_etc & rc_default); end copy_rc_default; ------------------- -- copy_etc_rc -- ------------------- procedure copy_etc_rcsubr (path_to_etc : String) is rcsubr : constant String := "/rc.subr"; etc_rcsubr : constant String := "/etc" & rcsubr; begin if not AD.Exists (etc_rcsubr) then return; end if; AD.Copy_File (Source_Name => etc_rcsubr, Target_Name => path_to_etc & rcsubr); end copy_etc_rcsubr; --------------------- -- copy_ldconfig -- --------------------- procedure copy_ldconfig (path_to_etc : String) is ldconfig : constant String := "/rc.d/ldconfig"; etc_ldconfig : constant String := "/etc" & ldconfig; begin if not AD.Exists (etc_ldconfig) then return; end if; AD.Copy_File (Source_Name => etc_ldconfig, Target_Name => path_to_etc & ldconfig, Form => "mode=copy,preserve=all_attributes"); end copy_ldconfig; --------------------------- -- create_etc_services -- --------------------------- procedure create_etc_services (path_to_etc : String) is svcfile : TIO.File_Type; begin TIO.Create (File => svcfile, Mode => TIO.Out_File, Name => path_to_etc & "/services"); TIO.Put_Line (svcfile, "ftp 21/tcp" & LAT.LF & "ftp 21/udp" & LAT.LF & "ssh 22/tcp" & LAT.LF & "ssh 22/udp" & LAT.LF & "http 80/tcp" & LAT.LF & "http 80/udp" & LAT.LF & "https 443/tcp" & LAT.LF & "https 443/udp" & LAT.LF); TIO.Close (svcfile); end create_etc_services; ------------------------ -- create_etc_fstab -- ------------------------ procedure create_etc_fstab (path_to_etc : String) is fstab : TIO.File_Type; begin TIO.Create (File => fstab, Mode => TIO.Out_File, Name => path_to_etc & "/fstab"); case platform_type is when dragonfly | freebsd => TIO.Put_Line (fstab, "linproc /usr/compat/proc linprocfs rw 0 0"); when netbsd => TIO.Put_Line (fstab, "procfs /emul/linux/proc procfs ro,linux 0 0"); when linux | solaris => null; when unknown => null; end case; TIO.Close (fstab); end create_etc_fstab; ------------------------- -- create_etc_shells -- ------------------------- procedure create_etc_shells (path_to_etc : String) is shells : TIO.File_Type; begin TIO.Create (File => shells, Mode => TIO.Out_File, Name => path_to_etc & "/shells"); case platform_type is when dragonfly | freebsd => TIO.Put_Line (shells, "/bin/sh" & LAT.LF & "/bin/csh" & LAT.LF & "/bin/tcsh" & LAT.LF); when netbsd => TIO.Put_Line (shells, "/bin/sh" & LAT.LF & "/bin/csh" & LAT.LF & "/bin/ksh" & LAT.LF); when linux => TIO.Put_Line (shells, "/bin/sh" & LAT.LF & "/bin/bash" & LAT.LF & "/sbin/nologin" & LAT.LF & "/usr/bin/sh" & LAT.LF & "/usr/bin/bash" & LAT.LF & "/usr/sbin/nologin" & LAT.LF); when solaris => TIO.Put_Line (shells, "/bin/bash" & LAT.LF & "/bin/csh" & LAT.LF & "/bin/ksh" & LAT.LF & "/bin/ksh93" & LAT.LF & "/bin/sh" & LAT.LF & "/bin/tcsh" & LAT.LF & "/bin/zsh" & LAT.LF & "/sbin/sh" & LAT.LF & "/usr/bin/bash" & LAT.LF & "/usr/bin/csh" & LAT.LF & "/usr/bin/ksh" & LAT.LF & "/usr/bin/ksh93" & LAT.LF & "/usr/bin/sh" & LAT.LF & "/usr/bin/tcsh" & LAT.LF & "/usr/bin/zsh"); when unknown => null; end case; TIO.Close (shells); end create_etc_shells; ------------------------ -- execute_ldconfig -- ------------------------ procedure execute_ldconfig (id : builders) is smount : constant String := get_slave_mount (id); bsd_command : constant String := chroot & smount & " /sbin/ldconfig -m /lib /usr/lib"; lin_command : constant String := chroot & smount & " /usr/sbin/ldconfig /lib /usr/lib"; begin case platform_type is when dragonfly | freebsd => execute (bsd_command); when linux => execute (lin_command); when netbsd | solaris => null; when unknown => null; end case; end execute_ldconfig; ------------------------------- -- copy_directory_contents -- ------------------------------- function copy_directory_contents (src_directory : String; tgt_directory : String; pattern : String) return Boolean is Search : AD.Search_Type; Dir_Ent : AD.Directory_Entry_Type; Filter : constant AD.Filter_Type := (AD.Ordinary_File => True, AD.Special_File => False, AD.Directory => False); begin if not AD.Exists (src_directory) then return False; end if; AD.Create_Path (tgt_directory); AD.Start_Search (Search => Search, Directory => src_directory, Filter => Filter, Pattern => pattern); while AD.More_Entries (Search => Search) loop AD.Get_Next_Entry (Search => Search, Directory_Entry => Dir_Ent); AD.Copy_File (Source_Name => src_directory & "/" & AD.Simple_Name (Dir_Ent), Target_Name => tgt_directory & "/" & AD.Simple_Name (Dir_Ent)); end loop; return True; exception when others => return False; end copy_directory_contents; ------------------------ -- build_repository -- ------------------------ function build_repository (id : builders; sign_command : String := "") return Boolean is smount : constant String := get_slave_mount (id); command : constant String := chroot & smount & " " & root_localbase & "/sbin/pkg-static repo /packages"; sc_cmd : constant String := host_pkg8 & " repo " & smount & "/packages signing_command: "; key_loc : constant String := "/etc/repo.key"; use_key : constant Boolean := AD.Exists (smount & key_loc); use_cmd : constant Boolean := not JT.IsBlank (sign_command); begin if not PLT.standalone_pkg8_install (id) then TIO.Put_Line ("Failed to install pkg-static in builder" & id'Img); return False; end if; if use_key then silent_exec (command & " " & key_loc); elsif use_cmd then silent_exec (sc_cmd & sign_command); else silent_exec (command); end if; return True; exception when quepaso : others => TIO.Put_Line (EX.Exception_Message (quepaso)); return False; end build_repository; --------------------------------- -- annihilate_directory_tree -- --------------------------------- procedure annihilate_directory_tree (tree : String) is command : constant String := "/bin/rm -rf " & tree; begin silent_exec (command); exception when others => null; end annihilate_directory_tree; -------------------- -- launch_slave -- -------------------- procedure launch_slave (id : builders; opts : slave_options) is function clean_mount_point (point : folder) return String; slave_base : constant String := get_slave_mount (id); slave_work : constant String := slave_base & "_work"; slave_local : constant String := slave_base & "_localbase"; slave_linux : constant String := slave_base & "_linux"; dir_system : constant String := JT.USS (PM.configuration.dir_system); live_system : constant Boolean := (dir_system = "/"); function clean_mount_point (point : folder) return String is begin if live_system then return location ("", point); else return location (dir_system, point); end if; end clean_mount_point; begin forge_directory (slave_base); mount_tmpfs (slave_base); for mnt in folder'Range loop forge_directory (location (slave_base, mnt)); end loop; for mnt in subfolder'Range loop mount_nullfs (target => clean_mount_point (mnt), mount_point => location (slave_base, mnt)); end loop; folder_access (location (slave_base, home), lock); folder_access (location (slave_base, root), lock); mount_nullfs (mount_target (xports), location (slave_base, xports)); mount_nullfs (mount_target (options), location (slave_base, options)); mount_nullfs (mount_target (packages), location (slave_base, packages), mode => readwrite); mount_nullfs (mount_target (distfiles), location (slave_base, distfiles), mode => readwrite); if PM.configuration.tmpfs_workdir then -- The mount cap of 16Gb was removed; rust was the latest port to bust it mount_tmpfs (location (slave_base, wrkdirs)); else forge_directory (slave_work); mount_nullfs (slave_work, location (slave_base, wrkdirs), readwrite); end if; if not support_locks and then PM.configuration.tmpfs_localbase then mount_tmpfs (slave_base & root_localbase, 12 * 1024); else forge_directory (slave_local); mount_nullfs (slave_local, slave_base & root_localbase, readwrite); end if; if opts.need_procfs then mount_procfs (path_to_proc => location (slave_base, proc)); end if; -- special platform handling case platform_type is when dragonfly => declare bootdir : String := clean_mount_point (boot); begin if AD.Exists (bootdir) then mount_nullfs (target => bootdir, mount_point => location (slave_base, boot)); mount_tmpfs (slave_base & root_lmodules, 100); end if; end; declare games : String := clean_mount_point (usr_games); begin if AD.Exists (games) then mount_nullfs (target => games, mount_point => location (slave_base, usr_games)); end if; end; when freebsd => if opts.need_linprocfs then if PM.configuration.tmpfs_localbase then mount_tmpfs (slave_base & root_linux, 12 * 1024); else forge_directory (slave_linux); mount_nullfs (target => slave_linux, mount_point => slave_base & root_linux, mode => readwrite); end if; forge_directory (slave_base & root_linproc); mount_linprocfs (mount_point => slave_base & root_linproc); end if; declare lib32 : String := clean_mount_point (usr_lib32); begin if AD.Exists (lib32) then mount_nullfs (target => lib32, mount_point => location (slave_base, usr_lib32)); end if; end; declare bootdir : String := clean_mount_point (boot); begin if AD.Exists (bootdir) then mount_nullfs (target => bootdir, mount_point => location (slave_base, boot)); mount_tmpfs (slave_base & root_boot_fw, 100); mount_tmpfs (slave_base & root_kmodules, 100); end if; end; declare games : String := clean_mount_point (usr_games); begin if AD.Exists (games) then mount_nullfs (target => games, mount_point => location (slave_base, usr_games)); end if; end; when netbsd => declare x11_dir : String := clean_mount_point (usr_x11r7); begin if AD.Exists (x11_dir) then mount_nullfs (target => x11_dir, mount_point => location (slave_base, usr_x11r7)); end if; end; when linux => null; -- for now when solaris => null; -- for now when unknown => null; end case; declare srcdir : String := clean_mount_point (usr_src); begin if AD.Exists (srcdir) then mount_nullfs (srcdir, location (slave_base, usr_src)); if AD.Exists (srcdir & "/sys") then create_symlink (destination => "usr/src/sys", symbolic_link => slave_base & "/sys"); end if; end if; end; if AD.Exists (mount_target (ccache)) then mount_nullfs (mount_target (ccache), location (slave_base, ccache), mode => readwrite); end if; mount_devices (location (slave_base, dev)); populate_var_folder (location (slave_base, var)); copy_mtree_files (location (slave_base, etc_mtree)); copy_rc_default (location (slave_base, etc)); copy_resolv_conf (location (slave_base, etc)); create_make_conf (location (slave_base, etc), opts.skip_cwrappers); create_passwd (location (slave_base, etc)); create_group (location (slave_base, etc)); create_etc_services (location (slave_base, etc)); create_etc_shells (location (slave_base, etc)); create_etc_fstab (location (slave_base, etc)); copy_etc_rcsubr (location (slave_base, etc)); copy_ldconfig (location (slave_base, etc)); execute_ldconfig (id); exception when hiccup : others => EX.Reraise_Occurrence (hiccup); end launch_slave; --------------------- -- destroy_slave -- --------------------- procedure destroy_slave (id : builders; opts : slave_options) is slave_base : constant String := get_slave_mount (id); slave_work : constant String := slave_base & "_work"; slave_local : constant String := slave_base & "_localbase"; slave_linux : constant String := slave_base & "_linux"; dir_system : constant String := JT.USS (PM.configuration.dir_system); begin unmount (slave_base & root_localbase); if support_locks or else not PM.configuration.tmpfs_localbase then -- We can't use AD.Delete_Tree because it skips directories -- starting with "." (pretty useless then) annihilate_directory_tree (slave_local); end if; unmount (location (slave_base, wrkdirs)); if not PM.configuration.tmpfs_workdir then annihilate_directory_tree (slave_work); end if; if AD.Exists (location (dir_system, usr_src)) then unmount (location (slave_base, usr_src)); end if; if AD.Exists (mount_target (ccache)) then unmount (location (slave_base, ccache)); end if; case platform_type is when dragonfly => if AD.Exists (location (dir_system, boot)) then unmount (slave_base & root_lmodules); unmount (location (slave_base, boot)); end if; if AD.Exists (location (dir_system, usr_games)) then unmount (location (slave_base, usr_games)); end if; when freebsd => if opts.need_linprocfs then unmount (slave_base & root_linproc); unmount (slave_base & root_linux); if not PM.configuration.tmpfs_localbase then annihilate_directory_tree (slave_linux); end if; end if; if AD.Exists (location (dir_system, usr_lib32)) then unmount (location (slave_base, usr_lib32)); end if; if AD.Exists (location (dir_system, boot)) then unmount (slave_base & root_kmodules); unmount (slave_base & root_boot_fw); unmount (location (slave_base, boot)); end if; if AD.Exists (location (dir_system, usr_games)) then unmount (location (slave_base, usr_games)); end if; when netbsd => if AD.Exists (location (dir_system, usr_x11r7)) then unmount (location (slave_base, usr_x11r7)); end if; when linux => null; when solaris => null; when unknown => null; end case; if opts.need_procfs then unmount_procfs (location (slave_base, proc)); end if; unmount_devices (location (slave_base, dev)); unmount (location (slave_base, xports)); unmount (location (slave_base, options)); unmount (location (slave_base, packages)); unmount (location (slave_base, distfiles)); for mnt in subfolder'Range loop unmount (location (slave_base, mnt)); end loop; unmount (slave_base); annihilate_directory_tree (slave_base); exception when hiccup : others => EX.Reraise_Occurrence (hiccup); end destroy_slave; -------------------------- -- synth_mounts_exist -- -------------------------- function synth_mounts_exist return Boolean is buildbase : constant String := JT.USS (PM.configuration.dir_buildbase); comres : JT.Text; topline : JT.Text; crlen1 : Natural; crlen2 : Natural; begin comres := internal_system_command (PLT.df_command); crlen1 := JT.SU.Length (comres); loop JT.nextline (lineblock => comres, firstline => topline); crlen2 := JT.SU.Length (comres); exit when crlen1 = crlen2; crlen1 := crlen2; if JT.contains (topline, buildbase) then return True; end if; end loop; return False; exception when others => return True; end synth_mounts_exist; ----------------------------- -- clear_existing_mounts -- ----------------------------- function clear_existing_mounts return Boolean is package crate is new AC.Vectors (Index_Type => Positive, Element_Type => JT.Text, "=" => JT.SU."="); procedure annihilate (cursor : crate.Cursor); buildbase : constant String := JT.USS (PM.configuration.dir_buildbase); comres : JT.Text; topline : JT.Text; crlen1 : Natural; crlen2 : Natural; mindex : Natural; mlength : Natural; mpoints : crate.Vector; procedure annihilate (cursor : crate.Cursor) is mountpoint : constant String := JT.USS (crate.Element (cursor)); begin unmount (mountpoint); if AD.Exists (mountpoint) then AD.Delete_Directory (mountpoint); end if; exception when others => null; end annihilate; begin comres := internal_system_command (PLT.df_command); crlen1 := JT.SU.Length (comres); loop JT.nextline (lineblock => comres, firstline => topline); crlen2 := JT.SU.Length (comres); exit when crlen1 = crlen2; crlen1 := crlen2; if JT.contains (topline, buildbase) then mindex := JT.SU.Index (topline, buildbase); mlength := JT.SU.Length (topline); mpoints.Append (JT.SUS (JT.SU.Slice (topline, mindex, mlength))); end if; end loop; mpoints.Reverse_Iterate (Process => annihilate'Access); if synth_mounts_exist then return False; end if; -- No need to remove empty dirs, the upcoming run will do that. return True; end clear_existing_mounts; ---------------------------- -- disk_workareas_exist -- ---------------------------- function disk_workareas_exist return Boolean is Search : AD.Search_Type; buildbase : constant String := JT.USS (PM.configuration.dir_buildbase); result : Boolean := False; begin if not AD.Exists (buildbase) then return False; end if; AD.Start_Search (Search => Search, Directory => buildbase, Filter => (AD.Directory => True, others => False), Pattern => "SL*_*"); result := AD.More_Entries (Search => Search); return result; end disk_workareas_exist; -------------------------------- -- clear_existing_workareas -- -------------------------------- function clear_existing_workareas return Boolean is Search : AD.Search_Type; Dir_Ent : AD.Directory_Entry_Type; buildbase : constant String := JT.USS (PM.configuration.dir_buildbase); begin AD.Start_Search (Search => Search, Directory => buildbase, Filter => (AD.Directory => True, others => False), Pattern => "SL*_*"); while AD.More_Entries (Search => Search) loop AD.Get_Next_Entry (Search => Search, Directory_Entry => Dir_Ent); declare target : constant String := buildbase & "/" & AD.Simple_Name (Dir_Ent); begin annihilate_directory_tree (target); end; end loop; return True; exception when others => return False; end clear_existing_workareas; ---------------------------- -- concatenate_makeconf -- ---------------------------- procedure concatenate_makeconf (makeconf_handle : TIO.File_Type; target_name : String) is fragment : TIO.File_Type; begin if AD.Exists (target_name) then TIO.Open (File => fragment, Mode => TIO.In_File, Name => target_name); while not TIO.End_Of_File (fragment) loop declare Line : String := TIO.Get_Line (fragment); begin TIO.Put_Line (makeconf_handle, Line); end; end loop; TIO.Close (fragment); end if; exception when others => null; end concatenate_makeconf; --------------------------------------- -- write_common_mtree_exclude_base -- --------------------------------------- procedure write_common_mtree_exclude_base (mtreefile : TIO.File_Type) is begin TIO.Put_Line (mtreefile, "./bin" & LAT.LF & "./boot" & LAT.LF & "./ccache" & LAT.LF & "./compat/linux/proc" & LAT.LF & "./construction" & LAT.LF & "./dev" & LAT.LF & "./distfiles" & LAT.LF & "./lib" & LAT.LF & "./libexec" & LAT.LF & "./home" & LAT.LF & "./options" & LAT.LF & "./packages" & LAT.LF & "./proc" & LAT.LF & "./root" & LAT.LF & "./sbin" & LAT.LF & "./tmp" & LAT.LF & "./usr/bin" & LAT.LF & "./usr/include" & LAT.LF & "./usr/lib" & LAT.LF & "./usr/lib32" & LAT.LF & "./usr/libdata" & LAT.LF & "./usr/libexec" & LAT.LF & "./usr/sbin" & LAT.LF & "./usr/share" & LAT.LF & "./usr/src" & LAT.LF & "./var/db/fontconfig" & LAT.LF & "./var/run" & LAT.LF & "./var/tmp" & LAT.LF & "./xports" ); end write_common_mtree_exclude_base; -------------------------------- -- write_preinstall_section -- -------------------------------- procedure write_preinstall_section (mtreefile : TIO.File_Type) is begin case software_framework is when ports_collection => TIO.Put_Line (mtreefile, "./etc/group" & LAT.LF & "./etc/make.conf" & LAT.LF & "./etc/make.conf.bak" & LAT.LF & "./etc/make.nxb.conf" & LAT.LF & "./etc/master.passwd" & LAT.LF & "./etc/passwd" & LAT.LF & "./etc/pwd.db" & LAT.LF & "./etc/shells" & LAT.LF & "./etc/spwd.db" & LAT.LF & "./var/db" & LAT.LF & "./var/log" & LAT.LF & "./var/mail" & LAT.LF & "./var/spool" & LAT.LF & "./var/tmp" & LAT.LF & "./usr/local/etc/gconf/gconf.xml.defaults/%gconf-tree*.xml" & LAT.LF & "./usr/local/lib/gio/modules/giomodule.cache" & LAT.LF & "./usr/local/info/dir" & LAT.LF & "./usr/local/info" & LAT.LF & "./usr/local/*/info/dir" & LAT.LF & "./usr/local/*/info" & LAT.LF & "./usr/local/*/ls-R" & LAT.LF & "./usr/local/share/octave/octave_packages" & LAT.LF & "./usr/local/share/xml/catalog.ports" ); when pkgsrc => TIO.Put_Line (mtreefile, "./etc/group" & LAT.LF & "./etc/mk.conf" & LAT.LF & "./etc/master.passwd" & LAT.LF & "./etc/passwd" & LAT.LF & "./etc/pwd.db" & LAT.LF & "./etc/shells" & LAT.LF & "./etc/spwd.db" & LAT.LF & "./var/db" & LAT.LF & "./var/log" & LAT.LF & "./var/mail" & LAT.LF & "./var/spool" & LAT.LF & "./var/tmp" & LAT.LF & "./usr/pkg/etc/gconf/gconf.xml.defaults/%gconf-tree*.xml" & LAT.LF & "./usr/pkg/lib/gio/modules/giomodule.cache" & LAT.LF & "./usr/pkg/info/dir" & LAT.LF & "./usr/pkg/info" & LAT.LF & "./usr/pkg/*/info/dir" & LAT.LF & "./usr/pkg/*/info" & LAT.LF & "./usr/pkg/*/ls-R" & LAT.LF & "./usr/pkg/share/xml/catalog.ports" ); end case; end write_preinstall_section; -------------------------------- -- create_mtree_exc_preinst -- -------------------------------- procedure create_mtree_exc_preinst (path_to_mm : String) is mtreefile : TIO.File_Type; filename : constant String := path_to_mm & "/mtree.prestage.exclude"; begin TIO.Create (File => mtreefile, Mode => TIO.Out_File, Name => filename); write_common_mtree_exclude_base (mtreefile); write_preinstall_section (mtreefile); TIO.Close (mtreefile); end create_mtree_exc_preinst; ---------------------------------- -- create_mtree_exc_preconfig -- ---------------------------------- procedure create_mtree_exc_preconfig (path_to_mm : String) is mtreefile : TIO.File_Type; filename : constant String := path_to_mm & "/mtree.preconfig.exclude"; begin TIO.Create (File => mtreefile, Mode => TIO.Out_File, Name => filename); write_common_mtree_exclude_base (mtreefile); TIO.Close (mtreefile); end create_mtree_exc_preconfig; ------------------------ -- jail_environment -- ------------------------ function jail_environment return JT.Text is begin return builder_env; end jail_environment; -------------------------------------- -- boot_modules_directory_missing -- -------------------------------------- function boot_modules_directory_missing return Boolean is begin if JT.equivalent (PM.configuration.operating_sys, "DragonFly") then declare sroot : constant String := JT.USS (PM.configuration.dir_system); bootdir : constant String := sroot & root_boot; modsdir : constant String := sroot & root_lmodules; begin if AD.Exists (bootdir) and then not AD.Exists (modsdir) then return True; end if; end; end if; if JT.equivalent (PM.configuration.operating_sys, "FreeBSD") then declare sroot : constant String := JT.USS (PM.configuration.dir_system); bootdir : constant String := sroot & root_boot; modsdir : constant String := sroot & root_kmodules; begin if AD.Exists (bootdir) and then not AD.Exists (modsdir) then return True; end if; end; end if; return False; end boot_modules_directory_missing; ------------------------------ -- start_abnormal_logging -- ------------------------------ procedure start_abnormal_logging is logpath : constant String := JT.USS (PM.configuration.dir_logs) & "/" & abnormal_cmd_logname; begin if AD.Exists (logpath) then AD.Delete_File (logpath); end if; TIO.Create (File => abnormal_log, Mode => TIO.Out_File, Name => logpath); abn_log_ready := True; exception when others => abn_log_ready := False; end start_abnormal_logging; ----------------------------- -- stop_abnormal_logging -- ----------------------------- procedure stop_abnormal_logging is begin if abn_log_ready then TIO.Close (abnormal_log); end if; end stop_abnormal_logging; end Replicant;

35.236267

94

0.519001

3d5785c195ca275bf71e8f1862add64b5fa84124

2,962

ads

Ada

source/calendar/machine-apple-darwin/s-natcal.ads

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

33

2015-04-04T09:19:36.000Z

2021-11-10T05:33:34.000Z

source/calendar/machine-apple-darwin/s-natcal.ads

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

8

2017-11-14T13:05:07.000Z

2018-08-09T15:28:49.000Z

source/calendar/machine-apple-darwin/s-natcal.ads

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

9

2015-02-03T17:09:53.000Z

2021-11-12T01:16:05.000Z

pragma License (Unrestricted); -- implementation unit specialized for POSIX (Darwin, FreeBSD, or Linux) with C.time; package System.Native_Calendar is pragma Preelaborate; subtype Native_Time is C.time.struct_timespec; function To_Native_Time (T : Duration) return Native_Time; function To_Time (T : Native_Time) return Duration; pragma Pure_Function (To_Native_Time); pragma Pure_Function (To_Time); function Clock return Native_Time; -- same as Ada.Calendar subtype Time is Duration; subtype Year_Number is Integer range 1901 .. 2399; subtype Month_Number is Integer range 1 .. 12; subtype Day_Number is Integer range 1 .. 31; subtype Day_Duration is Duration range 0.0 .. 86_400.0; -- same as Ada.Calendar.Formatting subtype Time_Offset is Integer range -28 * 60 .. 28 * 60; subtype Day_Name is Integer range 0 .. 6; subtype Hour_Number is Natural range 0 .. 23; subtype Minute_Number is Natural range 0 .. 59; subtype Second_Number is Natural range 0 .. 59; subtype Second_Duration is Day_Duration range 0.0 .. 1.0; -- decomposing/composing procedure Split ( Date : Time; Year : out Year_Number; Month : out Month_Number; Day : out Day_Number; Seconds : out Day_Duration; Leap_Second : out Boolean; Time_Zone : Time_Offset; Error : out Boolean); procedure Split ( Date : Time; Year : out Year_Number; Month : out Month_Number; Day : out Day_Number; Hour : out Hour_Number; Minute : out Minute_Number; Second : out Second_Number; Sub_Second : out Second_Duration; Leap_Second : out Boolean; Day_of_Week : out Day_Name; Time_Zone : Time_Offset; Error : out Boolean); procedure Time_Of ( Year : Year_Number; Month : Month_Number; Day : Day_Number; Seconds : Day_Duration; Leap_Second : Boolean; Time_Zone : Time_Offset; Result : out Time; Error : out Boolean); procedure Time_Of ( Year : Year_Number; Month : Month_Number; Day : Day_Number; Hour : Hour_Number; Minute : Minute_Number; Second : Second_Number; Sub_Second : Second_Duration; Leap_Second : Boolean; Time_Zone : Time_Offset; Result : out Time; Error : out Boolean); -- for Time_Zones procedure UTC_Time_Offset ( Date : Time; Time_Zone : out Time_Offset; Error : out Boolean); procedure Initialize_Time_Zones renames C.time.tzset; -- for delay until procedure Simple_Delay_Until (T : Native_Time); type Delay_Until_Handler is access procedure (T : Native_Time); pragma Favor_Top_Level (Delay_Until_Handler); -- equivalent to Timed_Delay (s-soflin.ads) Delay_Until_Hook : not null Delay_Until_Handler := Simple_Delay_Until'Access; procedure Delay_Until (T : Native_Time); end System.Native_Calendar;

26.927273

73

0.674544

06232aadaab3f3ba82e0f8d5d505fda938323340

1,289

ada

Ada

Task/Read-a-configuration-file/Ada/read-a-configuration-file-1.ada

djgoku/RosettaCodeData

91df62d46142e921b3eacdb52b0316c39ee236bc

[ "Info-ZIP" ]

null

Task/Read-a-configuration-file/Ada/read-a-configuration-file-1.ada

djgoku/RosettaCodeData

91df62d46142e921b3eacdb52b0316c39ee236bc

[ "Info-ZIP" ]

null

Task/Read-a-configuration-file/Ada/read-a-configuration-file-1.ada

djgoku/RosettaCodeData

91df62d46142e921b3eacdb52b0316c39ee236bc

[ "Info-ZIP" ]

null

with Ada.Strings.Unbounded; with Config_File_Parser; pragma Elaborate_All (Config_File_Parser); package Config is function TUS (S : String) return Ada.Strings.Unbounded.Unbounded_String renames Ada.Strings.Unbounded.To_Unbounded_String; -- Convenience rename. TUS is much shorter than To_Unbounded_String. type Keys is ( FULLNAME, FAVOURITEFRUIT, NEEDSPEELING, SEEDSREMOVED, OTHERFAMILY); -- These are the valid configuration keys. type Defaults_Array is array (Keys) of Ada.Strings.Unbounded.Unbounded_String; -- The array type we'll use to hold our default configuration settings. Defaults_Conf : Defaults_Array := (FULLNAME => TUS ("John Doe"), FAVOURITEFRUIT => TUS ("blackberry"), NEEDSPEELING => TUS ("False"), SEEDSREMOVED => TUS ("False"), OTHERFAMILY => TUS ("Daniel Defoe, Ada Byron")); -- Default values for the Program object. These can be overwritten by -- the contents of the rosetta.cfg file(see below). package Rosetta_Config is new Config_File_Parser ( Keys => Keys, Defaults_Array => Defaults_Array, Defaults => Defaults_Conf, Config_File => "rosetta.cfg"); -- Instantiate the Config configuration object. end Config;

32.225

75

0.68813

575e520f0f578a5c2e0f2b8b5709da0c108964ff

6,041

ads

Ada

tests/aco-od-example.ads

osannolik/ada-canopen

2ebf21a20da87dc367172d9e402cb6a8cdb7e8c7

[ "Apache-2.0" ]

6

2018-05-12T22:08:04.000Z

2021-07-25T20:55:12.000Z

tests/aco-od-example.ads

osannolik/ada-canopen

2ebf21a20da87dc367172d9e402cb6a8cdb7e8c7

[ "Apache-2.0" ]

null

tests/aco-od-example.ads

osannolik/ada-canopen

2ebf21a20da87dc367172d9e402cb6a8cdb7e8c7

[ "Apache-2.0" ]

2

2021-06-15T11:56:46.000Z

2021-06-21T13:56:01.000Z

with ACO.OD_Types.Entries; with ACO.Generic_Entry_Types; package ACO.OD.Example is -- Shall be generated based on an EDS file type Dictionary is new Object_Dictionary with private; use ACO.OD_Types.Entries; -- 0x1008 Manufacturer Device Name VAR Device_Name_Str : constant String := "A device name"; type Device_Name_String is new Visible_String (Device_Name_Str'Range) with Alignment => 1; package Device_Name_Pack is new ACO.Generic_Entry_Types (Device_Name_String); type Device_Name_Entry is new Device_Name_Pack.Entry_Type with null record; private use type ACO.OD_Types.Object_Subindex; -- 0x1000 Device Type VAR Device_Type_Var : aliased Entry_U32 := Create (RO, 16#00000000#); Device_Type_Data : aliased Entry_Array := (0 => Device_Type_Var'Access); Device_Type : aliased Object_Base (Device_Type_Data'Access); -- 0x1001 Error Register VAR Error_Register_Var : aliased Entry_U8 := Create (RO, 16#00#); Error_Register_Data : aliased Entry_Array := (0 => Error_Register_Var'Access); Error_Register : aliased Object_Base (Error_Register_Data'Access); -- 0x1003 Pre-defined Error Field ARRAY Predef_Err_Field_Nof : aliased Entry_U8 := Create (RW, 16#00#); Predef_Err_Field_1 : aliased Entry_U32 := Create (RO, 16#00000000#); Predef_Err_Field_Data : aliased Entry_Array := (0 => Predef_Err_Field_Nof'Access, 1 => Predef_Err_Field_1'Access); Predef_Err_Field : aliased Object_Base (Predef_Err_Field_Data'Access); -- 0x1005 Sync COB-ID VAR Sync_COB_ID_Var : aliased Entry_U32 := Create (RW, 16#00000080#); Sync_COB_ID_Data : aliased Entry_Array := (0 => Sync_COB_ID_Var'Access); Sync_COB_ID : aliased Object_Base (Sync_COB_ID_Data'Access); -- 0x1006 Communication Cycle Period VAR Comm_Cycle_Per_Var : aliased Entry_U32 := Create (RW, 10_000); Comm_Cycle_Per_Data : aliased Entry_Array := (0 => Comm_Cycle_Per_Var'Access); Comm_Cycle_Per : aliased Object_Base (Comm_Cycle_Per_Data'Access); -- 0x1007 Synchronous Window Length VAR Sync_Win_Length_Var : aliased Entry_U32 := Create (RW, 16#00000000#); Sync_Win_Length_Data : aliased Entry_Array := (0 => Sync_Win_Length_Var'Access); Sync_Win_Length : aliased Object_Base (Sync_Win_Length_Data'Access); -- 0x1008 Manufacturer Device Name VAR Device_Name_Var : aliased Device_Name_Entry := Create (RW, Device_Name_String (Device_Name_Str)); Device_Name_Data : aliased Entry_Array := (0 => Device_Name_Var'Access); Device_Name : aliased Object_Base (Device_Name_Data'Access); -- 0x1016 Consumer Heartbeat Time ARRAY Consumer_Hbt_Nof : aliased Entry_U8 := Create (RO, 16#01#); Consumer_Hbt_1 : aliased Entry_U32 := Create (RW, 16#00040010#); Consumer_Hbt_Data : aliased Entry_Array := (0 => Consumer_Hbt_Nof'Access, 1 => Consumer_Hbt_1'Access); Consumer_Hbt : aliased Object_Base (Consumer_Hbt_Data'Access); -- 0x1017 Producer Heartbeat Time Producer_Hbt_Var : aliased Entry_U16 := Create (RW, 10); Producer_Hbt_Data : aliased Entry_Array := (0 => Producer_Hbt_Var'Access); Producer_Hbt : aliased Object_Base (Producer_Hbt_Data'Access); -- 0x1019 Synchronous Counter Overflow Value VAR Sync_Counter_Overflow_Var : aliased Entry_U8 := Create (RW, 16); Sync_Counter_Overflow_Data : aliased Entry_Array := (0 => Sync_Counter_Overflow_Var'Access); Sync_Counter_Overflow : aliased Object_Base (Sync_Counter_Overflow_Data'Access); -- 0x1200-0x127F SDO Server Parameter SDO_Server_Field_Nof : aliased Entry_U8 := Create (RO, 16#03#); SDO_Server_COBID_C2S : aliased Entry_U32 := Create (RO, 16#00000600# + 1); SDO_Server_COBID_S2C : aliased Entry_U32 := Create (RO, 16#00000580# + 1); SDO_Server_Client_ID : aliased Entry_U8 := Create (RO, 16#01#); SDO_Server_Data : aliased Entry_Array := (0 => SDO_Server_Field_Nof'Access, 1 => SDO_Server_COBID_C2S'Access, 2 => SDO_Server_COBID_S2C'Access, 3 => SDO_Server_Client_ID'Access); SDO_Servers : aliased Object_Base (SDO_Server_Data'Access); -- 0x1280-0x12FF SDO Client Parameter SDO_Client_Field_Nof : aliased Entry_U8 := Create (RO, 16#03#); SDO_Client_COBID_C2S : aliased Entry_U32 := Create (RO, 16#00000600# + 1); SDO_Client_COBID_S2C : aliased Entry_U32 := Create (RO, 16#00000580# + 1); SDO_Client_Server_ID : aliased Entry_U8 := Create (RO, 16#01#); SDO_Client_Data : aliased Entry_Array := (0 => SDO_Client_Field_Nof'Access, 1 => SDO_Client_COBID_C2S'Access, 2 => SDO_Client_COBID_S2C'Access, 3 => SDO_Client_Server_ID'Access); SDO_Clients : aliased Object_Base (SDO_Client_Data'Access); -- Communication Profile Data Com_Profile : aliased Profile_Objects := (0 => Device_Type'Access, 1 => Error_Register'Access, 2 => Predef_Err_Field'Access, 3 => Sync_COB_ID'Access, 4 => Comm_Cycle_Per'Access, 5 => Sync_Win_Length'Access, 6 => Device_Name'Access, 7 => Consumer_Hbt'Access, 8 => Producer_Hbt'Access, 9 => Sync_Counter_Overflow'Access, 10 => SDO_Servers'Access, 11 => SDO_Clients'Access); overriding function Index_Map (This : Dictionary; Index : Object_Index) return Index_Type is (case Index is when 16#1000# => 0, when 16#1001# => 1, when 16#1003# => 2, when 16#1005# => 3, when 16#1006# => 4, when 16#1007# => 5, when 16#1008# => 6, when 16#1016# => 7, when 16#1017# => 8, when 16#1019# => 9, when 16#1200# => 10, when 16#1280# => 11, when others => No_Index); overriding function Objects (This : Dictionary) return Profile_Objects_Ref is (Com_Profile'Access); type Dictionary is new Object_Dictionary with null record; end ACO.OD.Example;

29.468293

83

0.685814

060909c4ab3264f23835bb412d54bbb07cd3cb3a

3,506

ada

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce2201j.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce2201j.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce2201j.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- CE2201J.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 READ, WRITE, AND END_OF_FILE ARE SUPPORTED FOR -- SEQUENTIAL FILES WITH ELEMENT TYPE ENUMERATION. -- APPLICABILITY CRITERIA: -- THIS TEST IS APPLICABLE ONLY TO IMPLEMENTATIONS WHICH SUPPORT -- SEQUENTIAL FILES. -- HISTORY: -- JLH 07/28/87 CREATED ORIGINAL TEST. WITH REPORT; USE REPORT; WITH SEQUENTIAL_IO; PROCEDURE CE2201J IS BEGIN TEST ("CE2201J", "CHECK THAT READ, WRITE, AND " & "END_OF_FILE ARE SUPPORTED FOR " & "SEQUENTIAL FILES - ENUMERATION TYPE"); DECLARE TYPE ENUMERATION IS (ONE, TWO, '4'); PACKAGE SEQ_ENUM IS NEW SEQUENTIAL_IO (ENUMERATION); USE SEQ_ENUM; FILE_ENUM : FILE_TYPE; INCOMPLETE : EXCEPTION; ENUM : ENUMERATION := ('4'); ITEM_ENUM : ENUMERATION; BEGIN BEGIN CREATE (FILE_ENUM, OUT_FILE, LEGAL_FILE_NAME); EXCEPTION WHEN USE_ERROR | NAME_ERROR => NOT_APPLICABLE ("CREATE OF SEQUENTIAL FILE WITH " & "MODE OUT_FILE NOT SUPPORTED"); RAISE INCOMPLETE; END; WRITE (FILE_ENUM, ENUM); CLOSE (FILE_ENUM); BEGIN OPEN (FILE_ENUM, IN_FILE, LEGAL_FILE_NAME); EXCEPTION WHEN USE_ERROR => NOT_APPLICABLE ("OPEN OF SEQUENTIAL FILE WITH " & "MODE IN_FILE NOT SUPPORTED"); RAISE INCOMPLETE; END; IF END_OF_FILE (FILE_ENUM) THEN FAILED ("WRONG END_OF_FILE VALUE FOR TYPE ENUMERATION"); END IF; READ (FILE_ENUM, ITEM_ENUM); IF ITEM_ENUM /= '4' THEN FAILED ("READ WRONG VALUE - ENUMERATION"); END IF; IF NOT END_OF_FILE (FILE_ENUM) THEN FAILED ("END OF FILE NOT TRUE - ENUMERATION"); END IF; BEGIN DELETE (FILE_ENUM); EXCEPTION WHEN USE_ERROR => NULL; END; EXCEPTION WHEN INCOMPLETE => NULL; END; RESULT; END CE2201J;

32.766355

79

0.578152

c72117d5a59972b3bf51da5807ca1acfeddb2876

841

adb

Ada

Read Only/gdb-6.8/gdb/testsuite/gdb.ada/null_record/null_record.adb

samyvic/OS-Project

1622bc1641876584964effd91d65ef02e92728e1

[ "Apache-2.0" ]

null

Read Only/gdb-6.8/gdb/testsuite/gdb.ada/null_record/null_record.adb

samyvic/OS-Project

1622bc1641876584964effd91d65ef02e92728e1

[ "Apache-2.0" ]

null

Read Only/gdb-6.8/gdb/testsuite/gdb.ada/null_record/null_record.adb

samyvic/OS-Project

1622bc1641876584964effd91d65ef02e92728e1

[ "Apache-2.0" ]

null

-- Copyright 2004, 2007, 2008 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- This program is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. with Bar; use Bar; procedure Null_Record is E : Void_Star := new Empty; begin Do_Nothing (E); end Null_Record;

35.041667

73

0.731272

c73b4a9346b8677d53ab1a02513aba8e6d3403a0

7,437

ads

Ada

tools/scitools/conf/understand/ada/ada12/s-rannum.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

1

2020-01-20T21:26:46.000Z

tools/scitools/conf/understand/ada/ada12/s-rannum.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

tools/scitools/conf/understand/ada/ada12/s-rannum.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . R A N D O M _ N U M B E R S -- -- -- -- S p e c -- -- -- -- Copyright (C) 2007-2010, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- -- -- -- -- -- -- -- -- 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. -- -- -- ------------------------------------------------------------------------------ -- Extended pseudo-random number generation -- This package provides a type representing pseudo-random number generators, -- and subprograms to extract various uniform distributions of numbers -- from them. It also provides types for representing initialization values -- and snapshots of internal generator state, which permit reproducible -- pseudo-random streams. -- The generator currently provided by this package has an extremely long -- period (at least 2**19937-1), and passes the Big Crush test suite, with the -- exception of the two linear complexity tests. Therefore, it is suitable -- for simulations, but should not be used as a cryptographic pseudo-random -- source without additional processing. -- Note: this package is in the System hierarchy so that it can be directly -- used by other predefined packages. User access to this package is via -- the package GNAT.Random_Numbers (file g-rannum.ads), which also extends -- its capabilities. The interfaces are different so as to include in -- System.Random_Numbers only the definitions necessary to implement the -- standard random-number packages Ada.Numerics.Float_Random and -- Ada.Numerics.Discrete_Random. with Interfaces; package System.Random_Numbers is type Generator is limited private; type State is private; -- A non-limited version of a Generator's internal state function Random (Gen : Generator) return Float; function Random (Gen : Generator) return Long_Float; -- Return pseudo-random numbers uniformly distributed on [0 .. 1) function Random (Gen : Generator) return Interfaces.Unsigned_32; function Random (Gen : Generator) return Interfaces.Unsigned_64; -- Return pseudo-random numbers uniformly distributed on T'First .. T'Last -- for builtin integer types. generic type Result_Subtype is (<>); Default_Min : Result_Subtype := Result_Subtype'Val (0); function Random_Discrete (Gen : Generator; Min : Result_Subtype := Default_Min; Max : Result_Subtype := Result_Subtype'Last) return Result_Subtype; -- Returns pseudo-random numbers uniformly distributed on Min .. Max generic type Result_Subtype is digits <>; function Random_Float (Gen : Generator) return Result_Subtype; -- Returns pseudo-random numbers uniformly distributed on [0 .. 1) type Initialization_Vector is array (Integer range <>) of Interfaces.Unsigned_32; -- Provides the most general initialization values for a generator (used -- in Reset). In general, there is little point in providing more than -- a certain number of values (currently 624). procedure Reset (Gen : Generator); -- Re-initialize the state of Gen from the time of day procedure Reset (Gen : Generator; Initiator : Initialization_Vector); procedure Reset (Gen : Generator; Initiator : Interfaces.Integer_32); procedure Reset (Gen : Generator; Initiator : Interfaces.Unsigned_32); procedure Reset (Gen : Generator; Initiator : Integer); -- Re-initialize Gen based on the Initiator in various ways. Identical -- values of Initiator cause identical sequences of values. procedure Reset (Gen : Generator; From_State : Generator); -- Causes the state of Gen to be identical to that of From_State; Gen -- and From_State will produce identical sequences of values subsequently. procedure Reset (Gen : Generator; From_State : State); procedure Save (Gen : Generator; To_State : out State); -- The sequence -- Save (Gen2, S); Reset (Gen1, S) -- has the same effect as Reset (Gen2, Gen1). procedure Reset (Gen : Generator; From_Image : String); function Image (Gen : Generator) return String; -- The call -- Reset (Gen2, Image (Gen1)) -- has the same effect as Reset (Gen2, Gen1); Max_Image_Width : constant := 11 * 624; -- Maximum possible length of result of Image (...) function Image (Of_State : State) return String; -- A String representation of Of_State. Identical to the result of -- Image (Gen), if Of_State has been set with Save (Gen, Of_State). function Value (Coded_State : String) return State; -- Inverse of Image on States private N : constant := 624; -- The number of 32-bit integers in the shift register M : constant := 397; -- Feedback distance from the current position subtype State_Val is Interfaces.Unsigned_32; type State is array (0 .. N - 1) of State_Val; type Writable_Access (Self : access Generator) is limited null record; -- Auxiliary type to make Generator a self-referential type type Generator is limited record Writable : Writable_Access (Generator'Access); -- This self reference allows functions to modify Generator arguments S : State := (others => 0); -- The shift register, a circular buffer I : Integer := N; -- Current starting position in shift register S (N means uninitialized) -- We should avoid using the identifier I here ??? end record; end System.Random_Numbers;

48.292208

79

0.584913

22186d5f6d54abcd82f5a64c185620c7caa050ef

10,717

ads

Ada

src/aco-sdo_commands.ads

jonashaggstrom/ada-canopen

8e0f32323a0f09b41e8b51ef7123738bbf29f194

[ "Apache-2.0" ]

6

2018-05-12T22:08:04.000Z

2021-07-25T20:55:12.000Z

src/aco-sdo_commands.ads

jonashaggstrom/ada-canopen

8e0f32323a0f09b41e8b51ef7123738bbf29f194

[ "Apache-2.0" ]

null

src/aco-sdo_commands.ads

jonashaggstrom/ada-canopen

8e0f32323a0f09b41e8b51ef7123738bbf29f194

[ "Apache-2.0" ]

2

2021-06-15T11:56:46.000Z

2021-06-21T13:56:01.000Z

with ACO.Messages; with ACO.OD_Types; with ACO.Utils.Byte_Order; with Interfaces; with System; package ACO.SDO_Commands is use Interfaces; use ACO.Messages; use ACO.OD_Types; use ACO.Utils.Byte_Order; type Unsigned_3 is mod 2 ** 3 with Size => 3; type Unsigned_2 is mod 2 ** 2 with Size => 2; subtype Abort_Code_Type is Interfaces.Unsigned_32; Download_Initiate_Req : constant := 1; Download_Initiate_Conf : constant := 3; Download_Segment_Req : constant := 0; Download_Segment_Conf : constant := 1; Upload_Initiate_Req : constant := 2; Upload_Initiate_Conf : constant := 2; Upload_Segment_Req : constant := 3; Upload_Segment_Conf : constant := 0; Abort_Req : constant := 4; function Get_CS (Msg : Message) return Unsigned_3 is (Unsigned_3 (Shift_Right (Msg.Data (0), 5) and 2#111#)); function Get_Index (Msg : Message) return Entry_Index is ((Object => Swap_Bus (Octets_2 (Msg.Data (1 .. 2))), Sub => Msg.Data (3))); -- function Index_To_Bus (Index : Object_Index) return Data_Array is -- (Data_Array (Octets_2' (Swap_Bus (Unsigned_16 (Index))))); type Download_Initiate_Cmd (As_Raw : Boolean := False) is record case As_Raw is when True => Raw : Data_Array (0 .. 7); when False => Command : Unsigned_3; Nof_No_Data : Unsigned_2; Is_Expedited : Boolean; Is_Size_Indicated : Boolean; Index : Unsigned_16; Subindex : Unsigned_8; Data : Data_Array (0 .. 3); end case; end record with Unchecked_Union, Size => 64, Bit_Order => System.Low_Order_First; for Download_Initiate_Cmd use record Raw at 0 range 0 .. 63; Data at 0 range 32 .. 63; Subindex at 0 range 24 .. 31; Index at 0 range 8 .. 23; Command at 0 range 5 .. 7; Nof_No_Data at 0 range 2 .. 3; Is_Expedited at 0 range 1 .. 1; Is_Size_Indicated at 0 range 0 .. 0; end record; function Get_Data_Size (Cmd : Download_Initiate_Cmd) return Natural is (if Cmd.Is_Expedited then 4 - Natural (Cmd.Nof_No_Data) else Natural (Swap_Bus (Octets_4 (Cmd.Data)))); function Convert (Msg : Message) return Download_Initiate_Cmd is ((As_Raw => True, Raw => Msg.Data)); subtype Expedited_Data is Data_Array (0 .. 3); function Create (Index : Entry_Index; Data : Data_Array) return Download_Initiate_Cmd with Pre => Data'Length <= Expedited_Data'Length; function Create (Index : Entry_Index; Size : Natural) return Download_Initiate_Cmd; subtype Segment_Data is Data_Array (0 .. 6); type Download_Segment_Cmd (As_Raw : Boolean := False) is record case As_Raw is when True => Raw : Data_Array (0 .. 7); when False => Command : Unsigned_3; Toggle : Boolean; Nof_No_Data : Unsigned_3; Is_Complete : Boolean; Data : Segment_Data; end case; end record with Unchecked_Union, Size => 64, Bit_Order => System.Low_Order_First; for Download_Segment_Cmd use record Raw at 0 range 0 .. 63; Data at 0 range 8 .. 63; Command at 0 range 5 .. 7; Toggle at 0 range 4 .. 4; Nof_No_Data at 0 range 1 .. 3; Is_Complete at 0 range 0 .. 0; end record; function Convert (Msg : Message) return Download_Segment_Cmd is ((As_Raw => True, Raw => Msg.Data)); function Create (Toggle : Boolean; Is_Complete : Boolean; Data : Data_Array) return Download_Segment_Cmd with Pre => Data'Length <= Segment_Data'Length; type Download_Initiate_Resp (As_Raw : Boolean := False) is record case As_Raw is when True => Raw : Data_Array (0 .. 7) := (others => 0); when False => Command : Unsigned_3; Index : Unsigned_16; Subindex : Unsigned_8; end case; end record with Unchecked_Union, Size => 64, Bit_Order => System.Low_Order_First; for Download_Initiate_Resp use record Raw at 0 range 0 .. 63; Subindex at 0 range 24 .. 31; Index at 0 range 8 .. 23; Command at 0 range 5 .. 7; end record; function Convert (Msg : Message) return Download_Initiate_Resp is ((As_Raw => True, Raw => Msg.Data)); function Create (Index : Entry_Index) return Download_Initiate_Resp; type Download_Segment_Resp (As_Raw : Boolean := False) is record case As_Raw is when True => Raw : Data_Array (0 .. 7) := (others => 0); when False => Command : Unsigned_3; Toggle : Boolean; end case; end record with Unchecked_Union, Size => 64, Bit_Order => System.Low_Order_First; for Download_Segment_Resp use record Raw at 0 range 0 .. 63; Command at 0 range 5 .. 7; Toggle at 0 range 4 .. 4; end record; function Convert (Msg : Message) return Download_Segment_Resp is ((As_Raw => True, Raw => Msg.Data)); function Create (Toggle : Boolean) return Download_Segment_Resp; type Abort_Cmd (As_Raw : Boolean := False) is record case As_Raw is when True => Raw : Data_Array (0 .. 7) := (others => 0); when False => Command : Unsigned_3; Index : Unsigned_16; Subindex : Unsigned_8; Code : Unsigned_32; end case; end record with Unchecked_Union, Size => 64, Bit_Order => System.Low_Order_First; for Abort_Cmd use record Raw at 0 range 0 .. 63; Code at 0 range 32 .. 63; Subindex at 0 range 24 .. 31; Index at 0 range 8 .. 23; Command at 0 range 5 .. 7; end record; function Convert (Msg : Message) return Abort_Cmd is ((As_Raw => True, Raw => Msg.Data)); function Create (Index : Entry_Index; Code : Abort_Code_Type) return Abort_Cmd; function Code (Cmd : Abort_Cmd) return Abort_Code_Type is (Abort_Code_Type (Unsigned_32' (Swap_Bus (Cmd.Code)))); type Upload_Initiate_Cmd (As_Raw : Boolean := False) is record case As_Raw is when True => Raw : Data_Array (0 .. 7) := (others => 0); when False => Command : Unsigned_3; Index : Unsigned_16; Subindex : Unsigned_8; end case; end record with Unchecked_Union, Size => 64, Bit_Order => System.Low_Order_First; for Upload_Initiate_Cmd use record Raw at 0 range 0 .. 63; Subindex at 0 range 24 .. 31; Index at 0 range 8 .. 23; Command at 0 range 5 .. 7; end record; function Convert (Msg : Message) return Upload_Initiate_Cmd is ((As_Raw => True, Raw => Msg.Data)); function Create (Index : Entry_Index) return Upload_Initiate_Cmd; type Upload_Initiate_Resp (As_Raw : Boolean := False) is record case As_Raw is when True => Raw : Data_Array (0 .. 7); when False => Command : Unsigned_3; Nof_No_Data : Unsigned_2; Is_Expedited : Boolean; Is_Size_Indicated : Boolean; Index : Unsigned_16; Subindex : Unsigned_8; Data : Data_Array (0 .. 3); end case; end record with Unchecked_Union, Size => 64, Bit_Order => System.Low_Order_First; for Upload_Initiate_Resp use record Raw at 0 range 0 .. 63; Data at 0 range 32 .. 63; Subindex at 0 range 24 .. 31; Index at 0 range 8 .. 23; Command at 0 range 5 .. 7; Nof_No_Data at 0 range 2 .. 3; Is_Expedited at 0 range 1 .. 1; Is_Size_Indicated at 0 range 0 .. 0; end record; function Get_Data_Size (Cmd : Upload_Initiate_Resp) return Natural is (if Cmd.Is_Expedited then 4 - Natural (Cmd.Nof_No_Data) else Natural (Swap_Bus (Octets_4 (Cmd.Data)))); function Convert (Msg : Message) return Upload_Initiate_Resp is ((As_Raw => True, Raw => Msg.Data)); function Create (Index : Entry_Index; Data : Data_Array) return Upload_Initiate_Resp with Pre => Data'Length <= Expedited_Data'Length; function Create (Index : Entry_Index; Size : Natural) return Upload_Initiate_Resp; type Upload_Segment_Cmd (As_Raw : Boolean := False) is record case As_Raw is when True => Raw : Data_Array (0 .. 7) := (others => 0); when False => Command : Unsigned_3; Toggle : Boolean; end case; end record with Unchecked_Union, Size => 64, Bit_Order => System.Low_Order_First; for Upload_Segment_Cmd use record Raw at 0 range 0 .. 63; Command at 0 range 5 .. 7; Toggle at 0 range 4 .. 4; end record; function Convert (Msg : Message) return Upload_Segment_Cmd is ((As_Raw => True, Raw => Msg.Data)); function Create (Toggle : Boolean) return Upload_Segment_Cmd; type Upload_Segment_Resp (As_Raw : Boolean := False) is record case As_Raw is when True => Raw : Data_Array (0 .. 7); when False => Command : Unsigned_3; Toggle : Boolean; Nof_No_Data : Unsigned_3; Is_Complete : Boolean; Data : Segment_Data; end case; end record with Unchecked_Union, Size => 64, Bit_Order => System.Low_Order_First; for Upload_Segment_Resp use record Raw at 0 range 0 .. 63; Data at 0 range 8 .. 63; Command at 0 range 5 .. 7; Toggle at 0 range 4 .. 4; Nof_No_Data at 0 range 1 .. 3; Is_Complete at 0 range 0 .. 0; end record; function Convert (Msg : Message) return Upload_Segment_Resp is ((As_Raw => True, Raw => Msg.Data)); function Create (Toggle : Boolean; Is_Complete : Boolean; Data : Data_Array) return Upload_Segment_Resp with Pre => Data'Length <= Segment_Data'Length; end ACO.SDO_Commands;

30.532764

78

0.568909

c71f3b90d22677515f43457c0d8c3c8b41ddcdbb

1,201

adb

Ada

testcases/fruit3/fruit3.adb

jrmarino/AdaBase

660f278613773dc4007c8b3fab21bcfddc1828b3

[ "0BSD" ]

30

2016-02-21T11:09:30.000Z

2021-12-08T14:12:32.000Z

testcases/fruit3/fruit3.adb

jrmarino/AdaBase

660f278613773dc4007c8b3fab21bcfddc1828b3

[ "0BSD" ]

3

2018-10-29T18:44:48.000Z

2022-03-12T23:14:20.000Z

testcases/fruit3/fruit3.adb

jrmarino/AdaBase

660f278613773dc4007c8b3fab21bcfddc1828b3

[ "0BSD" ]

3

2015-04-22T12:17:27.000Z

2017-01-19T14:29:59.000Z

with AdaBase; with Connect; with Ada.Text_IO; with AdaBase.Logger.Facility; procedure Fruit3 is package CON renames Connect; package TIO renames Ada.Text_IO; package ALF renames AdaBase.Logger.Facility; numrows : AdaBase.Affected_Rows; log : constant String := "/tmp/fruit3.test.log"; cmd : constant String := "DELETE FROM fruits WHERE color = 'red'"; begin CON.DR.command_standard_logger (device => ALF.file, action => ALF.attach); CON.DR.set_logger_filename (filename => log); TIO.Put_Line ("The " & log & " has been attached."); CON.connect_database; numrows := CON.DR.execute (sql => cmd); TIO.Put_Line ("SQL: " & cmd); TIO.Put_Line ("Result: Deleted" & numrows'Img & " rows"); CON.DR.command_standard_logger (device => ALF.file, action => ALF.detach); TIO.Put_Line ("The " & log & " has been deattached."); numrows := CON.DR.execute (sql => cmd); TIO.Put_Line ("Second execution:"); TIO.Put_Line ("Result: Deleted" & numrows'Img & " rows"); CON.DR.command_standard_logger (device => ALF.file, action => ALF.attach); TIO.Put_Line ("The " & log & " has been attached."); CON.DR.rollback; CON.DR.disconnect; end Fruit3;

27.930233

77

0.669442

58ed4f15dca2b1464d7ccdf729386215cc5fda67

1,183

ads

Ada

source/numerics/a-nuflra.ads

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

33

2015-04-04T09:19:36.000Z

2021-11-10T05:33:34.000Z

source/numerics/a-nuflra.ads

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

8

2017-11-14T13:05:07.000Z

2018-08-09T15:28:49.000Z

source/numerics/a-nuflra.ads

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

9

2015-02-03T17:09:53.000Z

2021-11-12T01:16:05.000Z

pragma License (Unrestricted); with Ada.Numerics.MT19937; package Ada.Numerics.Float_Random is -- Basic facilities -- type Generator is limited private; subtype Generator is MT19937.Generator; subtype Uniformly_Distributed is Float range 0.0 .. 1.0; function Random (Gen : Generator) return Uniformly_Distributed; -- procedure Reset (Gen : Generator; Initiator : Integer); procedure Reset (Gen : in out Generator; Initiator : Integer) renames MT19937.Reset; -- procedure Reset (Gen : Generator); procedure Reset (Gen : in out Generator) renames MT19937.Reset; -- Advanced facilities -- type State is private; subtype State is MT19937.State; procedure Save (Gen : Generator; To_State : out State) renames MT19937.Save; -- procedure Reset (Gen : Generator; From_State : State); procedure Reset (Gen : in out Generator; From_State : State) renames MT19937.Reset; Max_Image_Width : constant := MT19937.Max_Image_Width; function Image (Of_State : State) return String renames MT19937.Image; function Value (Coded_State : String) return State renames MT19937.Value; end Ada.Numerics.Float_Random;

30.333333

66

0.721048

59509a8fcf69f2eaf19f1fe908f10fb8466f2b27

9,318

adb

Ada

src/dds-request_reply-impl.adb

persan/dds-requestreply

226ce4fdeb4cdc65fdb90ea73baf9f012c31b42a

[ "MIT" ]

null

src/dds-request_reply-impl.adb

persan/dds-requestreply

226ce4fdeb4cdc65fdb90ea73baf9f012c31b42a

[ "MIT" ]

null

src/dds-request_reply-impl.adb

persan/dds-requestreply

226ce4fdeb4cdc65fdb90ea73baf9f012c31b42a

[ "MIT" ]

2

2020-04-06T19:34:15.000Z

2020-04-06T19:50:03.000Z

with DDS.Condition; with DDS.ConditionSeq; with GNAT.Source_Info; with Interfaces.C.Extensions; package body DDS.Request_Reply.Impl is use DDS.DomainParticipant; use DDS.Publisher; use DDS.Subscriber; -------------------------- -- Create_Request_Topic -- -------------------------- function Create_Request_Topic (Self : not null access Ref; Topic_Name : DDS.String; Type_Name : DDS.String; QoS : DDS.TopicQos := DDS.DomainParticipant.TOPIC_QOS_DEFAULT) return DDS.Topic.Ref_Access is begin return Self.Participant.Get_Or_Create_Topic (Topic_Name, Type_Name, Qos); end Create_Request_Topic; ------------------------ -- Create_Reply_Topic -- ------------------------ function Create_Reply_Topic (Self : not null access Ref; Topic_Name : DDS.String; Type_Name : DDS.String; QoS : DDS.TopicQos := DDS.DomainParticipant.TOPIC_QOS_DEFAULT) return DDS.Topic.Ref_Access is begin return Self.Participant.Get_Or_Create_Topic (Topic_Name, Type_Name, Qos); end Create_Reply_Topic; --------------------------------------- -- Create_Request_Topic_With_Profile -- --------------------------------------- function Create_Request_Topic_With_Profile (Self : not null access Ref; Topic_Name : DDS.String; Type_Name : DDS.String; Library_Name : DDS.String; Profile_Name : DDS.String) return DDS.Topic.Ref_Access is begin return Self.Participant.Get_Or_Create_Topic_With_Profile (Topic_Name, Type_Name, Library_Name, Profile_Name); end Create_Request_Topic_With_Profile; ------------------------------------- -- Create_Reply_Topic_With_Profile -- ------------------------------------- function Create_Reply_Topic_With_Profile (Self : not null access Ref; Topic_Name : DDS.String; Type_Name : DDS.String; Library_Name : DDS.String; Profile_Name : DDS.String) return DDS.Topic.Ref_Access is begin return Self.Participant.Get_Or_Create_Topic_With_Profile (Topic_Name, Type_Name, Library_Name, Profile_Name); end Create_Reply_Topic_With_Profile; -------------- -- Validate -- -------------- function CreateContentFilteredTopicName ( Self : not null access Ref; RelatedTopicName : DDS.String; Guid : Guid_T) return Standard.String is begin return raise Program_Error with "CreateContentFilteredTopicName Unimplemented"; end; procedure Validate (Self : not null access Ref; Publisher : DDS.Publisher.Ref_Access; Subscriber : DDS.Subscriber.Ref_Access) is begin if (Publisher /= null) then if Self.Participant /= Publisher.Get_Participant then raise Program_Error with "Publisher dont belong to participant"; else Self.Publisher := Publisher; end if; else Self.Publisher := Self.Participant.Get_Implicit_Publisher; end if; if (Subscriber /= null) then if Self.Participant /= Subscriber.Get_Participant then raise Program_Error with "Subscriber dont belong to participant"; else Self.Subscriber := Self.Participant.Get_Implicit_Subscriber; end if; else Self.Subscriber := Subscriber; end if; end Validate; procedure Wait_For_Any_Sample (Self : not null access Ref; Max_Wait : DDS.Duration_T; Min_Sample_Count : DDS.Natural) is begin Self.Wait_For_Samples (Max_Wait, Min_Sample_Count, Self.Waitset, Self.Any_Sample_Cond, Self.Not_Read_Sample_Cond); end Wait_For_Any_Sample; function Get_Sample_Loaned_W_Len (Self : not null access Ref; Received_Data : System.Address; Data_Count : out Integer; Is_Loan : out Boolean; DataSeqContiguousBuffer : Interfaces.C.Extensions.Void_Ptr; Info_Seq : DDS.SampleInfo_Seq.Sequence; Data_Seq_Len : Long_Integer; Data_Seq_Max_Len : Long_Integer; Data_Seq_Has_Ownership : Boolean; Max_Samples : Natural; Read_Condition : not null DDS.ReadCondition.Ref_Access; Take : Boolean)return DDS.ReturnCode_T is begin return DDS.ReturnCode_T'Val(Self.Reader.read_or_take_w_condition_untypedI (Is_Loan => Is_Loan'Unrestricted_Access, Received_Data => Received_Data, Data_Count => Data_Count'Unrestricted_Access, Info_Seq => Info_Seq, Data_Seq_Len => Data_Seq_Len, Data_Seq_Max_Len => Data_Seq_Max_Len, Data_Seq_Has_Ownership => Boolean'Pos(Data_Seq_Has_Ownership), Data_Seq_Contiguous_Buffer_For_Copy => DataSeqContiguousBuffer, Data_Size => Self.Sample_Size, Max_Samples => Standard.Long_integer(Max_Samples), Condition => Read_Condition, Take => Take)); end Get_Sample_Loaned_W_Len; function Touch_Samples (Self : not null access Ref; Max_Count : DDS.Natural; ReadCondition : not null DDS.ReadCondition.Ref_Access) return Integer is Received_Data : System.Address := System.Null_Address; Info_Seq : aliased DDS.SampleInfo_Seq.Sequence; Data_Count : Integer := -1; IsLoan : Boolean := True; retCode : DDS.ReturnCode_T; begin retCode:= Self.Get_Sample_Loaned_W_Len (Received_Data => Received_Data'Address, Data_Count => Data_Count, Is_Loan => IsLoan, DataSeqContiguousBuffer => System.Null_Address, Info_Seq => Info_Seq, Data_Seq_Len => 0, Data_Seq_Max_Len => 0, Data_Seq_Has_Ownership => True, Max_Samples => Max_Count, Read_Condition => ReadCondition, Take => False); if retCode = DDS.RETCODE_OK then self.Reader.Return_Loan_UntypedI(Received_Data,Data_Count,Info_Seq); elsif retCode /= DDS.RETCODE_NO_DATA then Ret_Code_To_Exception(retCode,"error with getting sample loan"); end if; return Data_Count; end Touch_Samples; procedure Wait_For_Samples (Self : not null access Ref; Max_Wait : DDS.Duration_T; Min_Sample_Count : DDS.Integer; WaitSet : not null DDS.WaitSet.Ref_Access; Initial_Condition : not null DDS.ReadCondition.Ref_Access; Condition : not null DDS.ReadCondition.Ref_Access) is Sample_Count : DDS.Natural := (if Min_Sample_Count =DDS.LENGTH_UNLIMITED then DDS.Natural'last else Min_Sample_Count); TimeBefore, TimeAfter : DDS.Time_T; RemainingWait : aliased DDS.Duration_T; ActiveConditions : aliased DDS.ConditionSeq.Sequence; use DDS.ConditionSeq; use Dds.Condition; begin if Condition.Get_Sample_State_Mask /= DDS.NOT_READ_SAMPLE_STATE then raise PRECONDITION_NOT_MET; end if; if Initial_Condition.Get_Sample_State_Mask /= DDS.ANY_SAMPLE_STATE then raise PRECONDITION_NOT_MET; end if; Sample_Count := Sample_Count - Self.Touch_Samples (Min_Sample_Count, Initial_Condition); while Sample_Count > 0 loop if Sample_Count = 1 then WaitSet.Wait (ActiveConditions'Access, RemainingWait); else TimeBefore := Self.Participant.Get_Current_Time; WaitSet.Wait (ActiveConditions'Access, RemainingWait); TimeAfter := Self.Participant.Get_Current_Time; RemainingWait := RemainingWait -(TimeAfter - TimeBefore); exit when Get_Length (ActiveConditions'Access) /= 1 or Get (ActiveConditions'Access, 0) /= DDS.Condition.Ref_Access (Condition); if Sample_Count > 1 then Sample_Count := Sample_Count - Self.Touch_Samples (Min_Sample_Count, Condition); else Sample_Count := Sample_Count - 1; end if; end if; end loop; end Wait_For_Samples; end DDS.Request_Reply.Impl;

41.230088

133

0.557523

061abda1f566764c2ad88fde7510d156d84bea14

5,459

ads

Ada

source/amf/uml/amf-uml-link_end_destruction_datas-collections.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/uml/amf-uml-link_end_destruction_datas-collections.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/uml/amf-uml-link_end_destruction_datas-collections.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

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

59.336957

110

0.556879

58ab4dd563eb478a8666494274796bf8debd8992

1,892

ads

Ada

src/registre.ads

GauBen/Arbre-Genealogique

410dfd4e783871846a87aa2198ab37e05413f5b6

[ "MIT" ]

1

2021-01-26T16:03:10.000Z

src/registre.ads

GauBen/Arbre-Genealogique

410dfd4e783871846a87aa2198ab37e05413f5b6

[ "MIT" ]

null

src/registre.ads

GauBen/Arbre-Genealogique

410dfd4e783871846a87aa2198ab37e05413f5b6

[ "MIT" ]

null

generic Modulo : Integer; type T_Element is private; -- Un registre est une table de hachage. package Registre is type T_Registre is limited private; Cle_Absente_Exception : exception; -- Renvoie vrai si le registre est entièrement vide. function Est_Vide (Registre : T_Registre) return Boolean; -- Initialiser un registre vide. procedure Initialiser (Registre : out T_Registre) with Post => Est_Vide (Registre); -- Renvoie vrai si la clé est presente dans le registre. function Existe (Registre : T_Registre; Cle : Integer) return Boolean; -- Insère ou modifie un élément dans le registre. procedure Attribuer (Registre : in out T_Registre; Cle : in Integer; Element : in T_Element); -- Renvoie un élément du registre. -- Lance Cle_Absente_Exception si la clé n'est pas trouvee. function Acceder (Registre : T_Registre; Cle : Integer) return T_Element; -- Applique une procédure P sur tous les éléments du registre. generic with procedure P (Cle : in Integer; Element : in T_Element); procedure Appliquer_Sur_Tous (Registre : in T_Registre); -- Supprime un élément du registre. procedure Supprimer (Registre : in out T_Registre; Cle : in Integer); -- Supprime tous les éléments du registre. procedure Detruire (Registre : in out T_Registre) with Post => Est_Vide (Registre); private -- On choisit de representer un registre par un tableau de pointeurs. -- Une case de ce tableau contient une chaîne de tous les elements dont -- la valeur de la clé par la fonction de hachage est la même. type T_Maillon; type T_Pointeur_Sur_Maillon is access T_Maillon; type T_Maillon is record Cle : Integer; Element : T_Element; Suivant : T_Pointeur_Sur_Maillon; end record; type T_Registre is array (1 .. Modulo) of T_Pointeur_Sur_Maillon; end Registre;

32.067797

78

0.71723

22c1747f4c7e2d7f752529b00e4fa8ee1c6577ef

1,051

ads

Ada

src/sys/os-win64/util-systems-constants.ads

yrashk/ada-util

2aaa1d87e92a7137e1c63dce90f0722c549dfafd

[ "Apache-2.0" ]

60

2015-01-18T23:05:34.000Z

2022-03-20T18:56:30.000Z

src/sys/os-win64/util-systems-constants.ads

yrashk/ada-util

2aaa1d87e92a7137e1c63dce90f0722c549dfafd

[ "Apache-2.0" ]

20

2016-09-15T16:41:30.000Z

2022-03-29T22:02:32.000Z

src/sys/os-win64/util-systems-constants.ads

yrashk/ada-util

2aaa1d87e92a7137e1c63dce90f0722c549dfafd

[ "Apache-2.0" ]

10

2015-02-13T04:00:45.000Z

2022-03-20T18:57:54.000Z

-- Generated by utildgen.c from system includes with Interfaces.C; package Util.Systems.Constants is pragma Pure; -- Flags used when opening a file with open/creat. O_RDONLY : constant Interfaces.C.int := 8#000000#; O_WRONLY : constant Interfaces.C.int := 8#000001#; O_RDWR : constant Interfaces.C.int := 8#000002#; O_CREAT : constant Interfaces.C.int := 8#000400#; O_EXCL : constant Interfaces.C.int := 8#002000#; O_TRUNC : constant Interfaces.C.int := 8#001000#; O_APPEND : constant Interfaces.C.int := 8#000010#; O_CLOEXEC : constant Interfaces.C.int := 8#100000#; O_SYNC : constant Interfaces.C.int := 0; O_DIRECT : constant Interfaces.C.int := 0; DLL_OPTIONS : constant String := "-ldl"; SYMBOL_PREFIX : constant String := ""; end Util.Systems.Constants;

43.791667

75

0.531874

220a93edac3d4e025f049fdf9b1651d0801058f8

218

adb

Ada

src/lab-code/cpu-affinity/src/main.adb

hannesb0/rtpl18

6cd1ff776b98695713de88586391139447edb320

[ "MIT" ]

null

src/lab-code/cpu-affinity/src/main.adb

hannesb0/rtpl18

6cd1ff776b98695713de88586391139447edb320

[ "MIT" ]

null

src/lab-code/cpu-affinity/src/main.adb

hannesb0/rtpl18

6cd1ff776b98695713de88586391139447edb320

[ "MIT" ]

null

with Dispatch; with System.Multiprocessors.Dispatching_Domains; use System.Multiprocessors.Dispatching_Domains; procedure Main is begin Set_CPU(1); for i in 1 .. 100 loop delay 1.0; end loop; end Main;

18.166667

48

0.743119

12ca6c7637e39d77d0a80819e70d5604fd99b8e6

2,230

ads

Ada

source/oasis/program-elements-loop_statements.ads

reznikmm/gela

20134f1d154fb763812e73860c6f4b04f353df79

[ "MIT" ]

null

source/oasis/program-elements-loop_statements.ads

reznikmm/gela

20134f1d154fb763812e73860c6f4b04f353df79

[ "MIT" ]

null

source/oasis/program-elements-loop_statements.ads

reznikmm/gela

20134f1d154fb763812e73860c6f4b04f353df79

[ "MIT" ]

1

2019-10-16T09:05:27.000Z

-- SPDX-FileCopyrightText: 2019 Max Reznik <[email protected]> -- -- SPDX-License-Identifier: MIT ------------------------------------------------------------- with Program.Elements.Statements; with Program.Elements.Defining_Identifiers; with Program.Lexical_Elements; with Program.Element_Vectors; with Program.Elements.Identifiers; package Program.Elements.Loop_Statements is pragma Pure (Program.Elements.Loop_Statements); type Loop_Statement is limited interface and Program.Elements.Statements.Statement; type Loop_Statement_Access is access all Loop_Statement'Class with Storage_Size => 0; not overriding function Statement_Identifier (Self : Loop_Statement) return Program.Elements.Defining_Identifiers.Defining_Identifier_Access is abstract; not overriding function Statements (Self : Loop_Statement) return not null Program.Element_Vectors.Element_Vector_Access is abstract; not overriding function End_Statement_Identifier (Self : Loop_Statement) return Program.Elements.Identifiers.Identifier_Access is abstract; type Loop_Statement_Text is limited interface; type Loop_Statement_Text_Access is access all Loop_Statement_Text'Class with Storage_Size => 0; not overriding function To_Loop_Statement_Text (Self : in out Loop_Statement) return Loop_Statement_Text_Access is abstract; not overriding function Colon_Token (Self : Loop_Statement_Text) return Program.Lexical_Elements.Lexical_Element_Access is abstract; not overriding function Loop_Token (Self : Loop_Statement_Text) return not null Program.Lexical_Elements.Lexical_Element_Access is abstract; not overriding function End_Token (Self : Loop_Statement_Text) return not null Program.Lexical_Elements.Lexical_Element_Access is abstract; not overriding function Loop_Token_2 (Self : Loop_Statement_Text) return not null Program.Lexical_Elements.Lexical_Element_Access is abstract; not overriding function Semicolon_Token (Self : Loop_Statement_Text) return not null Program.Lexical_Elements.Lexical_Element_Access is abstract; end Program.Elements.Loop_Statements;

31.857143

77

0.760538

29aef9cc0494a5567016dc22508c06c62e6fe3ae

6,345

ads

Ada

llvm-gcc-4.2-2.9/gcc/ada/a-direio.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

llvm-gcc-4.2-2.9/gcc/ada/a-direio.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

llvm-gcc-4.2-2.9/gcc/ada/a-direio.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . D I R E C T _ I O -- -- -- -- 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. -- -- -- -- 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.IO_Exceptions; with System.Direct_IO; with Interfaces.C_Streams; generic type Element_Type is private; package Ada.Direct_IO is pragma Compile_Time_Warning (Element_Type'Has_Access_Values, "?Element_Type for Direct_'I'O instance has access values"); type File_Type is limited private; type File_Mode is (In_File, Inout_File, Out_File); -- The following representation clause allows the use of unchecked -- conversion for rapid translation between the File_Mode type -- used in this package and System.File_IO. for File_Mode use (In_File => 0, -- System.File_IO.File_Mode'Pos (In_File) Inout_File => 1, -- System.File_IO.File_Mode'Pos (Inout_File); Out_File => 2); -- System.File_IO.File_Mode'Pos (Out_File) type Count is range 0 .. System.Direct_IO.Count'Last; subtype Positive_Count is Count range 1 .. Count'Last; --------------------- -- File Management -- --------------------- procedure Create (File : in out File_Type; Mode : File_Mode := Inout_File; Name : String := ""; Form : String := ""); procedure Open (File : in out File_Type; Mode : File_Mode; Name : String; Form : String := ""); procedure Close (File : in out File_Type); procedure Delete (File : in out File_Type); procedure Reset (File : in out File_Type; Mode : File_Mode); procedure Reset (File : in out File_Type); function Mode (File : File_Type) return File_Mode; function Name (File : File_Type) return String; function Form (File : File_Type) return String; function Is_Open (File : File_Type) return Boolean; --------------------------------- -- Input and Output Operations -- --------------------------------- procedure Read (File : File_Type; Item : out Element_Type; From : Positive_Count); procedure Read (File : File_Type; Item : out Element_Type); procedure Write (File : File_Type; Item : Element_Type; To : Positive_Count); procedure Write (File : File_Type; Item : Element_Type); procedure Set_Index (File : File_Type; To : Positive_Count); function Index (File : File_Type) return Positive_Count; function Size (File : File_Type) return Count; function End_Of_File (File : File_Type) return Boolean; ---------------- -- Exceptions -- ---------------- Status_Error : exception renames IO_Exceptions.Status_Error; Mode_Error : exception renames IO_Exceptions.Mode_Error; Name_Error : exception renames IO_Exceptions.Name_Error; Use_Error : exception renames IO_Exceptions.Use_Error; Device_Error : exception renames IO_Exceptions.Device_Error; End_Error : exception renames IO_Exceptions.End_Error; Data_Error : exception renames IO_Exceptions.Data_Error; private type File_Type is new System.Direct_IO.File_Type; Bytes : constant Interfaces.C_Streams.size_t := Element_Type'Max_Size_In_Storage_Elements; -- Size of an element in storage units pragma Inline (Close); pragma Inline (Create); pragma Inline (Delete); pragma Inline (End_Of_File); pragma Inline (Form); pragma Inline (Index); pragma Inline (Is_Open); pragma Inline (Mode); pragma Inline (Name); pragma Inline (Open); pragma Inline (Read); pragma Inline (Reset); pragma Inline (Set_Index); pragma Inline (Size); pragma Inline (Write); end Ada.Direct_IO;

39.65625

78

0.553664

57dbc3c288cca734d1326d6fc300c03ecadb4780

434

adb

Ada

src/gl/implementation/gl-enums-indexes.adb

Roldak/OpenGLAda

6807605b7321249d71286fa25231bdfd537d3eac

[ "MIT" ]

79

2015-04-20T23:10:02.000Z

2022-03-04T13:50:56.000Z

src/gl/implementation/gl-enums-indexes.adb

Roldak/OpenGLAda

6807605b7321249d71286fa25231bdfd537d3eac

[ "MIT" ]

126

2015-09-10T10:41:34.000Z

2022-03-20T11:25:40.000Z

src/gl/implementation/gl-enums-indexes.adb

Roldak/OpenGLAda

6807605b7321249d71286fa25231bdfd537d3eac

[ "MIT" ]

20

2015-03-17T07:15:57.000Z

2022-02-02T17:12:11.000Z

-- part of OpenGLAda, (c) 2017 Felix Krause -- released under the terms of the MIT license, see the file "COPYING" package body GL.Enums.Indexes is function Representation (Value : Index) return Int is begin return Min_Representation + Value; end Representation; function Value (Representation : Int) return Index is begin return Representation - Min_Representation; end Value; end GL.Enums.Indexes;

28.933333

71

0.728111

5883056b92dbbf67e9621047e388c39af64cf137

6,775

adb

Ada

awa/plugins/awa-images/src/awa-images-modules.adb

Letractively/ada-awa

3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe

[ "Apache-2.0" ]

null

awa/plugins/awa-images/src/awa-images-modules.adb

Letractively/ada-awa

3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe

[ "Apache-2.0" ]

null

awa/plugins/awa-images/src/awa-images-modules.adb

Letractively/ada-awa

3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- awa-images-modules -- Image management module -- Copyright (C) 2012 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- -- with AWA.Modules.Beans; with AWA.Modules.Get; with AWA.Applications; with AWA.Storages.Modules; with Util.Strings; with Util.Log.Loggers; package body AWA.Images.Modules is Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("AWA.Images.Module"); -- package Register is new AWA.Modules.Beans (Module => Image_Module, -- Module_Access => Image_Module_Access); -- ------------------------------ -- Initialize the image module. -- ------------------------------ overriding procedure Initialize (Plugin : in out Image_Module; App : in AWA.Modules.Application_Access; Props : in ASF.Applications.Config) is begin Log.Info ("Initializing the image module"); -- Setup the resource bundles. App.Register ("imageMsg", "images"); -- Register.Register (Plugin => Plugin, -- Name => "AWA.Storages.Beans.Upload_Bean", -- Handler => AWA.Storages.Beans.Factories.Create_Upload_Bean'Access); -- App.Add_Servlet ("storage", Plugin.Storage_Servlet'Unchecked_Access); AWA.Modules.Module (Plugin).Initialize (App, Props); -- Register the image module as listener to the storage module events. declare use AWA.Storages.Modules; Storage : constant Storage_Module_Access := AWA.Storages.Modules.Get_Storage_Module; begin if Storage = null then Log.Error ("Cannot initialize the image module: there is no storage module."); else Storage.Add_Listener (Plugin'Unchecked_Access); end if; end; end Initialize; -- ------------------------------ -- Configures the module after its initialization and after having read its XML configuration. -- ------------------------------ overriding procedure Configure (Plugin : in out Image_Module; Props : in ASF.Applications.Config) is pragma Unreferenced (Props); begin -- Create the image manager when everything is initialized. Plugin.Manager := Plugin.Create_Image_Manager; end Configure; -- ------------------------------ -- Get the image manager. -- ------------------------------ function Get_Image_Manager (Plugin : in Image_Module) return Services.Image_Service_Access is begin return Plugin.Manager; end Get_Image_Manager; -- ------------------------------ -- Create an image manager. This operation can be overridden to provide another -- image service implementation. -- ------------------------------ function Create_Image_Manager (Plugin : in Image_Module) return Services.Image_Service_Access is Result : constant Services.Image_Service_Access := new Services.Image_Service; begin Result.Initialize (Plugin); return Result; end Create_Image_Manager; -- ------------------------------ -- Returns true if the storage file has an image mime type. -- ------------------------------ function Is_Image (File : in AWA.Storages.Models.Storage_Ref'Class) return Boolean is Mime : constant String := File.Get_Mime_Type; Pos : constant Natural := Util.Strings.Index (Mime, '/'); begin if Pos = 0 then return False; else return Mime (Mime'First .. Pos - 1) = "image"; end if; end Is_Image; -- ------------------------------ -- The `On_Create` procedure is called by `Notify_Create` to notify the creation of the item. -- ------------------------------ overriding procedure On_Create (Instance : in Image_Module; Item : in AWA.Storages.Models.Storage_Ref'Class) is begin if Is_Image (Item) then Instance.Manager.Create_Image (Item); end if; end On_Create; -- ------------------------------ -- The `On_Update` procedure is called by `Notify_Update` to notify the update of the item. -- ------------------------------ overriding procedure On_Update (Instance : in Image_Module; Item : in AWA.Storages.Models.Storage_Ref'Class) is begin if Is_Image (Item) then Instance.Manager.Create_Image (Item); else Instance.Manager.Delete_Image (Item); end if; end On_Update; -- ------------------------------ -- The `On_Delete` procedure is called by `Notify_Delete` to notify the deletion of the item. -- ------------------------------ overriding procedure On_Delete (Instance : in Image_Module; Item : in AWA.Storages.Models.Storage_Ref'Class) is begin Instance.Manager.Delete_Image (Item); end On_Delete; -- ------------------------------ -- Get the image module instance associated with the current application. -- ------------------------------ function Get_Image_Module return Image_Module_Access is function Get is new AWA.Modules.Get (Image_Module, Image_Module_Access, NAME); begin return Get; end Get_Image_Module; -- ------------------------------ -- Get the image manager instance associated with the current application. -- ------------------------------ function Get_Image_Manager return Services.Image_Service_Access is Module : constant Image_Module_Access := Get_Image_Module; begin if Module = null then Log.Error ("There is no active Storage_Module"); return null; else return Module.Get_Image_Manager; end if; end Get_Image_Manager; end AWA.Images.Modules;

39.16185

99

0.558967

2fbc090625b94d6a3a7aaddf03da58a288f83945

16,310

ada

Ada

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/cc/cc3016b.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- CC3016B.ADA -- Grant of Unlimited Rights -- -- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687, -- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained -- unlimited rights in the software and documentation contained herein. -- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making -- this public release, the Government intends to confer upon all -- recipients unlimited rights equal to those held by the Government. -- These rights include rights to use, duplicate, release or disclose the -- released technical data and computer software in whole or in part, in -- any manner and for any purpose whatsoever, and to have or permit others -- to do so. -- -- DISCLAIMER -- -- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR -- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED -- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE -- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE -- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A -- PARTICULAR PURPOSE OF SAID MATERIAL. --* -- CHECK THAT AN INSTANCE OF A GENERIC PACKAGE MUST DECLARE A -- PACKAGE. CHECK THAT THE DECLARATIVE ITEMS IN AN INSTANTIATION -- OF A GENERIC PACKAGE SPECIFICATION ARE ELABORATED IN THE ORDER -- DECLARED. -- HISTORY: -- EDWARD V. BERARD, 8 AUGUST 1990 WITH REPORT ; PROCEDURE CC3016B IS WHEN_ELABORATED : NATURAL := 0 ; TYPE REAL IS DIGITS 6 ; REAL_VALUE : REAL := 3.14159 ; TRUE_VALUE : BOOLEAN := TRUE ; CHARACTER_VALUE : CHARACTER := 'Z' ; TYPE MONTH_TYPE IS (JAN, FEB, MAR, APR, MAY, JUN, JUL, AUG, SEP, OCT, NOV, DEC) ; TYPE DAY_TYPE IS RANGE 1 .. 31 ; TYPE YEAR_TYPE IS RANGE 1904 .. 2050 ; TYPE DATE IS RECORD MONTH : MONTH_TYPE ; DAY : DAY_TYPE ; YEAR : YEAR_TYPE ; END RECORD ; TYPE DATE_ACCESS IS ACCESS DATE ; THIS_MONTH : MONTH_TYPE := AUG ; THIS_YEAR : YEAR_TYPE := 1990 ; TODAY : DATE := (MONTH => AUG, DAY => 8, YEAR => 1990) ; FIRST_DATE : DATE_ACCESS := NEW DATE'(DAY => 6, MONTH => JUN, YEAR => 1967) ; TYPE DUE_DATES IS ARRAY (MONTH_TYPE RANGE JAN .. DEC) OF DATE ; REPORT_DATES : DUE_DATES := ((JAN, 23, 1990), (FEB, 23, 1990), (MAR, 23, 1990), (APR, 23, 1990), (MAY, 23, 1990), (JUN, 22, 1990), (JUL, 23, 1990), (AUG, 23, 1990), (SEP, 24, 1990), (OCT, 23, 1990), (NOV, 23, 1990), (DEC, 20, 1990)) ; TYPE LIST_INDEX IS RANGE 1 .. 16 ; TYPE LIST IS ARRAY (LIST_INDEX) OF NATURAL ; ORDER_LIST : LIST := (OTHERS => 0) ; GENERIC TYPE RETURN_TYPE IS PRIVATE ; RETURN_VALUE : IN OUT RETURN_TYPE ; POSITION : IN NATURAL ; OFFSET : IN NATURAL ; WHEN_ELAB : IN OUT NATURAL ; TYPE INDEX IS RANGE <> ; TYPE LIST IS ARRAY (INDEX) OF NATURAL ; ORDER_LIST : IN OUT LIST ; FUNCTION NAME (VALUE : IN NATURAL) RETURN RETURN_TYPE ; FUNCTION NAME (VALUE : IN NATURAL) RETURN RETURN_TYPE IS BEGIN -- NAME IF (VALUE = POSITION) THEN WHEN_ELAB := NATURAL'SUCC (WHEN_ELAB) ; ORDER_LIST (INDEX (POSITION)) := WHEN_ELAB ; RETURN RETURN_VALUE ; ELSIF (VALUE = (POSITION + OFFSET)) THEN WHEN_ELAB := NATURAL'SUCC (WHEN_ELAB) ; ORDER_LIST (INDEX (POSITION + OFFSET)) := WHEN_ELAB ; RETURN RETURN_VALUE ; END IF ; END NAME ; GENERIC TYPE FIRST_TYPE IS PRIVATE ; WITH FUNCTION FIRST (POSITION : IN NATURAL) RETURN FIRST_TYPE ; FIRST_VALUE : IN NATURAL ; TYPE SECOND_TYPE IS PRIVATE ; WITH FUNCTION SECOND (POSITION : IN NATURAL) RETURN SECOND_TYPE ; SECOND_VALUE : IN NATURAL ; TYPE THIRD_TYPE IS PRIVATE ; WITH FUNCTION THIRD (POSITION : IN NATURAL) RETURN THIRD_TYPE ; THIRD_VALUE : IN NATURAL ; TYPE FOURTH_TYPE IS PRIVATE ; WITH FUNCTION FOURTH (POSITION : IN NATURAL) RETURN FOURTH_TYPE ; FOURTH_VALUE : IN NATURAL ; TYPE FIFTH_TYPE IS PRIVATE ; WITH FUNCTION FIFTH (POSITION : IN NATURAL) RETURN FIFTH_TYPE ; FIFTH_VALUE : IN NATURAL ; TYPE SIXTH_TYPE IS PRIVATE ; WITH FUNCTION SIXTH (POSITION : IN NATURAL) RETURN SIXTH_TYPE ; SIXTH_VALUE : IN NATURAL ; TYPE SEVENTH_TYPE IS PRIVATE ; WITH FUNCTION SEVENTH (POSITION : IN NATURAL) RETURN SEVENTH_TYPE ; SEVENTH_VALUE : IN NATURAL ; TYPE EIGHTH_TYPE IS PRIVATE ; WITH FUNCTION EIGHTH (POSITION : IN NATURAL) RETURN EIGHTH_TYPE ; EIGHTH_VALUE : IN NATURAL ; TYPE NINTH_TYPE IS PRIVATE ; WITH FUNCTION NINTH (POSITION : IN NATURAL) RETURN NINTH_TYPE ; NINTH_VALUE : IN NATURAL ; TYPE TENTH_TYPE IS PRIVATE ; WITH FUNCTION TENTH (POSITION : IN NATURAL) RETURN TENTH_TYPE ; TENTH_VALUE : IN NATURAL ; TYPE ELEVENTH_TYPE IS PRIVATE ; WITH FUNCTION ELEVENTH (POSITION : IN NATURAL) RETURN ELEVENTH_TYPE ; ELEVENTH_VALUE : IN NATURAL ; TYPE TWELFTH_TYPE IS PRIVATE ; WITH FUNCTION TWELFTH (POSITION : IN NATURAL) RETURN TWELFTH_TYPE ; TWELFTH_VALUE : IN NATURAL ; TYPE THIRTEENTH_TYPE IS PRIVATE ; WITH FUNCTION THIRTEENTH (POSITION : IN NATURAL) RETURN THIRTEENTH_TYPE ; THIRTEENTH_VALUE : IN NATURAL ; TYPE FOURTEENTH_TYPE IS PRIVATE ; WITH FUNCTION FOURTEENTH (POSITION : IN NATURAL) RETURN FOURTEENTH_TYPE ; FOURTEENTH_VALUE : IN NATURAL ; TYPE FIFTEENTH_TYPE IS PRIVATE ; WITH FUNCTION FIFTEENTH (POSITION : IN NATURAL) RETURN FIFTEENTH_TYPE ; FIFTEENTH_VALUE : IN NATURAL ; TYPE SIXTEENTH_TYPE IS PRIVATE ; WITH FUNCTION SIXTEENTH (POSITION : IN NATURAL) RETURN SIXTEENTH_TYPE ; SIXTEENTH_VALUE : IN NATURAL ; PACKAGE ORDER_PACKAGE IS A : FIRST_TYPE := FIRST (FIRST_VALUE) ; B : SECOND_TYPE := SECOND (SECOND_VALUE) ; C : THIRD_TYPE := THIRD (THIRD_VALUE) ; D : FOURTH_TYPE := FOURTH (FOURTH_VALUE) ; E : FIFTH_TYPE := FIFTH (FIFTH_VALUE) ; F : SIXTH_TYPE := SIXTH (SIXTH_VALUE) ; G : SEVENTH_TYPE := SEVENTH (SEVENTH_VALUE) ; H : EIGHTH_TYPE := EIGHTH (EIGHTH_VALUE) ; I : NINTH_TYPE := NINTH (NINTH_VALUE) ; J : TENTH_TYPE := TENTH (TENTH_VALUE) ; K : ELEVENTH_TYPE := ELEVENTH (ELEVENTH_VALUE) ; L : TWELFTH_TYPE := TWELFTH (TWELFTH_VALUE) ; M : THIRTEENTH_TYPE := THIRTEENTH (THIRTEENTH_VALUE) ; N : FOURTEENTH_TYPE := FOURTEENTH (FOURTEENTH_VALUE) ; O : FIFTEENTH_TYPE := FIFTEENTH (FIFTEENTH_VALUE) ; P : SIXTEENTH_TYPE := SIXTEENTH (SIXTEENTH_VALUE) ; END ORDER_PACKAGE ; FUNCTION BOOL IS NEW NAME (RETURN_TYPE => BOOLEAN, RETURN_VALUE => TRUE_VALUE, POSITION => 1, OFFSET => 8, WHEN_ELAB => WHEN_ELABORATED, INDEX => LIST_INDEX, LIST => LIST, ORDER_LIST => ORDER_LIST) ; FUNCTION INT IS NEW NAME (RETURN_TYPE => YEAR_TYPE, RETURN_VALUE => THIS_YEAR, POSITION => 2, OFFSET => 8, WHEN_ELAB => WHEN_ELABORATED, INDEX => LIST_INDEX, LIST => LIST, ORDER_LIST => ORDER_LIST) ; FUNCTION FLOAT IS NEW NAME (RETURN_TYPE => REAL, RETURN_VALUE => REAL_VALUE, POSITION => 3, OFFSET => 8, WHEN_ELAB => WHEN_ELABORATED, INDEX => LIST_INDEX, LIST => LIST, ORDER_LIST => ORDER_LIST) ; FUNCTION CHAR IS NEW NAME (RETURN_TYPE => CHARACTER, RETURN_VALUE => CHARACTER_VALUE, POSITION => 4, OFFSET => 8, WHEN_ELAB => WHEN_ELABORATED, INDEX => LIST_INDEX, LIST => LIST, ORDER_LIST => ORDER_LIST) ; FUNCTION ENUM IS NEW NAME (RETURN_TYPE => MONTH_TYPE, RETURN_VALUE => THIS_MONTH, POSITION => 5, OFFSET => 8, WHEN_ELAB => WHEN_ELABORATED, INDEX => LIST_INDEX, LIST => LIST, ORDER_LIST => ORDER_LIST) ; FUNCTION ARRY IS NEW NAME (RETURN_TYPE => DUE_DATES, RETURN_VALUE => REPORT_DATES, POSITION => 6, OFFSET => 8, WHEN_ELAB => WHEN_ELABORATED, INDEX => LIST_INDEX, LIST => LIST, ORDER_LIST => ORDER_LIST) ; FUNCTION RCRD IS NEW NAME (RETURN_TYPE => DATE, RETURN_VALUE => TODAY, POSITION => 7, OFFSET => 8, WHEN_ELAB => WHEN_ELABORATED, INDEX => LIST_INDEX, LIST => LIST, ORDER_LIST => ORDER_LIST) ; FUNCTION ACSS IS NEW NAME (RETURN_TYPE => DATE_ACCESS, RETURN_VALUE => FIRST_DATE, POSITION => 8, OFFSET => 8, WHEN_ELAB => WHEN_ELABORATED, INDEX => LIST_INDEX, LIST => LIST, ORDER_LIST => ORDER_LIST) ; PACKAGE ELABORATION_ORDER IS NEW ORDER_PACKAGE (FIRST_TYPE => BOOLEAN, FIRST => BOOL, FIRST_VALUE => 1, THIRD_TYPE => REAL, THIRD => FLOAT, THIRD_VALUE => 3, SECOND_TYPE => YEAR_TYPE, -- ORDERING OF PARAMETERS SECOND => INT, -- IS DELIBERATE. SECOND_VALUE => 2, FOURTH_TYPE => CHARACTER, FOURTH => CHAR, FOURTH_VALUE => 4, FIFTH_TYPE => MONTH_TYPE, FIFTH => ENUM, FIFTH_VALUE => 5, SIXTH_TYPE => DUE_DATES, SIXTH => ARRY, SIXTH_VALUE => 6, SEVENTH_TYPE => DATE, SEVENTH => RCRD, SEVENTH_VALUE => 7, EIGHTH_TYPE => DATE_ACCESS, EIGHTH => ACSS, EIGHTH_VALUE => 8, NINTH_TYPE => BOOLEAN, NINTH => BOOL, NINTH_VALUE => 9, TENTH_TYPE => YEAR_TYPE, TENTH => INT, TENTH_VALUE => 10, ELEVENTH_TYPE => REAL, ELEVENTH => FLOAT, ELEVENTH_VALUE => 11, TWELFTH_TYPE => CHARACTER, TWELFTH => CHAR, TWELFTH_VALUE => 12, THIRTEENTH_TYPE => MONTH_TYPE, THIRTEENTH => ENUM, THIRTEENTH_VALUE => 13, FOURTEENTH_TYPE => DUE_DATES, FOURTEENTH => ARRY, FOURTEENTH_VALUE => 14, FIFTEENTH_TYPE => DATE, FIFTEENTH => RCRD, FIFTEENTH_VALUE => 15, SIXTEENTH_TYPE => DATE_ACCESS, SIXTEENTH => ACSS, SIXTEENTH_VALUE => 16) ; BEGIN REPORT.TEST("CC3016B", "CHECK THAT AN INSTANCE OF A GENERIC " & "PACKAGE MUST DECLARE A PACKAGE. CHECK THAT THE " & "DECLARATIVE ITEMS IN AN INSTANTIATION OF A GENERIC " & "PACKAGE SPECIFICATION ARE ELABORATED IN THE ORDER " & "DECLARED."); IF ORDER_LIST(1) /= REPORT.IDENT_INT(1) THEN REPORT.FAILED("BOOLEAN 1 ELABORATED OUT OF ORDER"); END IF; IF ORDER_LIST(2) /= REPORT.IDENT_INT(2) THEN REPORT.FAILED("INTEGER TYPE 1 ELABORATED OUT OF ORDER"); END IF; IF ORDER_LIST(3) /= REPORT.IDENT_INT(3) THEN REPORT.FAILED("REAL 1 ELABORATED OUT OF ORDER"); END IF; IF ORDER_LIST(4) /= REPORT.IDENT_INT(4) THEN REPORT.FAILED("CHARACTER 1 ELABORATED OUT OF ORDER"); END IF; IF ORDER_LIST(5) /= REPORT.IDENT_INT(5) THEN REPORT.FAILED("ENUMERATION 1 ELABORATED OUT OF ORDER"); END IF; IF ORDER_LIST(6) /= REPORT.IDENT_INT(6) THEN REPORT.FAILED("ARRAY 1 ELABORATED OUT OF ORDER"); END IF; IF ORDER_LIST(7) /= REPORT.IDENT_INT(7) THEN REPORT.FAILED("RECORD 1 ELABORATED OUT OF ORDER"); END IF; IF ORDER_LIST(8) /= REPORT.IDENT_INT(8) THEN REPORT.FAILED("ACCESS 1 ELABORATED OUT OF ORDER"); END IF; IF ORDER_LIST(9) /= REPORT.IDENT_INT(9) THEN REPORT.FAILED("BOOLEAN 2 ELABORATED OUT OF ORDER"); END IF; IF ORDER_LIST(10) /= REPORT.IDENT_INT(10) THEN REPORT.FAILED("INTEGER TYPE 2 ELABORATED OUT OF ORDER"); END IF; IF ORDER_LIST(11) /= REPORT.IDENT_INT(11) THEN REPORT.FAILED("REAL 2 ELABORATED OUT OF ORDER"); END IF; IF ORDER_LIST(12) /= REPORT.IDENT_INT(12) THEN REPORT.FAILED("CHARACTER 2 ELABORATED OUT OF ORDER"); END IF; IF ORDER_LIST(13) /= REPORT.IDENT_INT(13) THEN REPORT.FAILED("ENUMERATION 2 ELABORATED OUT OF ORDER"); END IF; IF ORDER_LIST(14) /= REPORT.IDENT_INT(14) THEN REPORT.FAILED("ARRAY 2 ELABORATED OUT OF ORDER"); END IF; IF ORDER_LIST(15) /= REPORT.IDENT_INT(15) THEN REPORT.FAILED("RECORD 2 ELABORATED OUT OF ORDER"); END IF; IF ORDER_LIST(16) /= REPORT.IDENT_INT(16) THEN REPORT.FAILED("ACCESS 2 ELABORATED OUT OF ORDER"); END IF; REPORT.RESULT ; END CC3016B;

41.083123

79

0.479828

57ec15ab76dc4b1c2736b763a86150fdbdb79b92

4,439

ads

Ada

tools-src/gnu/gcc/gcc/ada/g-moreex.ads

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

80

2015-01-02T10:14:04.000Z

2021-06-07T06:29:49.000Z

tools-src/gnu/gcc/gcc/ada/g-moreex.ads

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

9

2015-05-14T11:03:12.000Z

2018-01-04T07:12:58.000Z

tools-src/gnu/gcc/gcc/ada/g-moreex.ads

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

69

2015-01-02T10:45:56.000Z

2021-09-06T07:52:13.000Z

------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- G N A T . M O S T _ R E C E N T _ E X C E P T I O N -- -- -- -- S p e c -- -- -- -- $Revision$ -- -- -- Copyright (C) 2000 Ada Core Technologies, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- It is now maintained by Ada Core Technologies Inc (http://www.gnat.com). -- -- -- ------------------------------------------------------------------------------ -- This package provides routines for accessing the most recently raised -- exception. This may be useful for certain logging activities. It may -- also be useful for mimicing implementation dependent capabilities in -- Ada 83 compilers, but see also GNAT.Current_Exceptions for this usage. with Ada.Exceptions; package GNAT.Most_Recent_Exception is ----------------- -- Subprograms -- ----------------- function Occurrence return Ada.Exceptions.Exception_Occurrence; -- Returns the Exception_Occurrence for the most recently raised -- exception in the current task. If no exception has been raised -- in the current task prior to the call, returns Null_Occurrence. function Occurrence_Access return Ada.Exceptions.Exception_Occurrence_Access; -- Similar to the above, but returns an access to the occurrence value. -- This value is in a task specific location, and may be validly accessed -- as long as no further exception is raised in the calling task. -- Note: unlike the routines in GNAT.Current_Exception, these functions -- access the most recently raised exception, regardless of where they -- are called. Consider the following example: -- exception -- when Constraint_Error => -- begin -- ... -- exception -- when Tasking_Error => ... -- end; -- -- -- Assuming a Tasking_Error was raised in the inner block, -- -- a call to GNAT.Most_Recent_Exception.Occurrence will -- -- return information about this Tasking_Error exception, -- -- not about the Constraint_Error exception being handled -- -- by the current handler code. end GNAT.Most_Recent_Exception;

55.4875

78

0.502816

2219ff2d1b811ad30bee31157fb3b6f473c640ba

10,367

adb

Ada

sources/flac-reader.adb

HeisenbugLtd/flac-ada

54ee813e05ec91207cbf3dcb3a36449ecb48db5d

[ "WTFPL" ]

5

2020-07-05T18:45:12.000Z

2020-12-18T22:58:55.000Z

sources/flac-reader.adb

HeisenbugLtd/flac-ada

54ee813e05ec91207cbf3dcb3a36449ecb48db5d

[ "WTFPL" ]

null

sources/flac-reader.adb

HeisenbugLtd/flac-ada

54ee813e05ec91207cbf3dcb3a36449ecb48db5d

[ "WTFPL" ]

null

------------------------------------------------------------------------------ -- Copyright (C) 2020 by Heisenbug Ltd. ([email protected]) -- -- This work is free. You can redistribute it and/or modify it under the -- terms of the Do What The Fuck You Want To Public License, Version 2, -- as published by Sam Hocevar. See the LICENSE file for more details. ------------------------------------------------------------------------------ pragma License (Unrestricted); with Ada.Streams.Stream_IO; with Flac.Debug; with Flac.Frames; with Flac.Headers.Meta_Data; with Flac.Headers.Stream_Info; with Flac.Types; with SPARK_Stream_IO; package body Flac.Reader with SPARK_Mode => On is --------------------------------------------------------------------------- -- Local helper subroutines. --------------------------------------------------------------------------- --------------------------------------------------------------------------- -- Validate_Header -- -- Tries reading the first block of data from the file stream and checks -- if a valid flac file signature could be found. --------------------------------------------------------------------------- procedure Validate_Header (Flac_File : in out File_Handle) with Pre => (Is_Open (Handle => Flac_File) and then Flac_File.Error = No_Error), Post => (case Flac_File.Error.Main is when None => Is_Open (Handle => Flac_File), when others => not Is_Open (Handle => Flac_File)), Depends => (Flac_File => Flac_File); --------------------------------------------------------------------------- -- Read_Metadata_Block --------------------------------------------------------------------------- procedure Read_Metadata_Block (Flac_File : in out File_Handle; Meta_Data : out Headers.Meta_Data.T) with Relaxed_Initialization => Meta_Data, Pre => (Is_Open (Handle => Flac_File) and then Flac_File.Error = No_Error), Post => (case Flac_File.Error.Main is when None => Is_Open (Handle => Flac_File) and then Meta_Data'Initialized, when others => not Is_Open (Handle => Flac_File)), Depends => (Flac_File => Flac_File, Meta_Data => Flac_File); --------------------------------------------------------------------------- -- Read_Stream_Info -- -- Reads basic stream info from current position. -- Requires to have read a meta data block with Info = Stream_Info before. --------------------------------------------------------------------------- procedure Read_Stream_Info (Flac_File : in out File_Handle; Meta_Data : out Headers.Meta_Data.T) with Relaxed_Initialization => Meta_Data, Pre => (Is_Open (Handle => Flac_File) and then Flac_File.Error = No_Error), Post => (case Flac_File.Error.Main is when None => Is_Open (Handle => Flac_File) and then Meta_Data'Initialized, when others => not Is_Open (Handle => Flac_File)), Depends => (Flac_File => Flac_File, Meta_Data => Flac_File); --------------------------------------------------------------------------- -- Read_Metadata_Block --------------------------------------------------------------------------- procedure Read_Metadata_Block (Flac_File : in out File_Handle; Meta_Data : out Headers.Meta_Data.T) is Error : Boolean; begin Headers.Meta_Data.Read (File => Flac_File.File, Item => Meta_Data, Error => Error); if Error then Close (Flac_File => Flac_File); Flac_File.Error := Error_Type'(Main => Not_A_Flac_File, Sub => Corrupt_Meta_Data); return; end if; end Read_Metadata_Block; --------------------------------------------------------------------------- -- Read_Stream_Info --------------------------------------------------------------------------- procedure Read_Stream_Info (Flac_File : in out File_Handle; Meta_Data : out Headers.Meta_Data.T) is Stream_Info : Headers.Stream_Info.T; Error : Boolean; use type Types.Block_Type; use type Types.Length_24; begin Read_Metadata_Block (Flac_File => Flac_File, Meta_Data => Meta_Data); if Flac_File.Error.Main /= None then return; end if; if Meta_Data.Block_Type /= Types.Stream_Info or else Meta_Data.Length /= Headers.Stream_Info.Stream_Info_Length then Close (Flac_File => Flac_File); Flac_File.Error := Error_Type'(Main => Not_A_Flac_File, Sub => Corrupt_Stream_Info); return; end if; Headers.Stream_Info.Read (File => Flac_File.File, Item => Stream_Info, Error => Error); if Error then Close (Flac_File => Flac_File); Flac_File.Error := Error_Type'(Main => Not_A_Flac_File, Sub => Invalid_Stream_Info); return; end if; Flac_File.Properties := Stream_Properties'(Num_Channels => Stream_Info.Num_Channels, Bits_Per_Sample => Stream_Info.Bits_Per_Sample, Sample_Rate => Stream_Info.Sample_Rate, Num_Samples => Stream_Info.Total_Samples); end Read_Stream_Info; --------------------------------------------------------------------------- -- Validate_Header --------------------------------------------------------------------------- procedure Validate_Header (Flac_File : in out File_Handle) is Header : Headers.Four_CC; Error : Boolean; use type Ada.Streams.Stream_Element_Array; begin SPARK_Stream_IO.Read (File => Flac_File.File, Item => Header, Error => Error); -- Check header. if Error or else Header /= Headers.Stream then Close (Flac_File => Flac_File); Flac_File.Error := Error_Type'(Main => Not_A_Flac_File, Sub => Header_Not_Found); end if; end Validate_Header; --------------------------------------------------------------------------- -- Close --------------------------------------------------------------------------- procedure Close (Flac_File : in out File_Handle) is begin SPARK_Stream_IO.Close (Flac_File.File); Flac_File.Open := False; end Close; --------------------------------------------------------------------------- -- Open --------------------------------------------------------------------------- procedure Open (File : in String; Flac_File : in out File_Handle) is Meta_Data : Headers.Meta_Data.T; Error : Boolean; begin -- Try opening the actual file. SPARK_Stream_IO.Open (File => Flac_File.File, Name => File, Error => Error); if Error then Flac_File.Error := Error_Type'(Main => Open_Error, Sub => None); return; end if; Flac_File.Open := True; -- For precondition of "Close" below. Flac_File.Error := No_Error; Validate_Header (Flac_File => Flac_File); if Flac_File.Error /= No_Error then return; end if; -- Header check went fine, now we should go for the first Stream_Info -- meta data block. This is mandatory according to the spec. Read_Stream_Info (Flac_File => Flac_File, Meta_Data => Meta_Data); if Flac_File.Error /= No_Error then return; end if; -- There may be more meta data blocks. For now, we just skip them. Skip_All_Meta_Data : declare use type Ada.Streams.Stream_IO.Count; use type Types.Block_Type; begin while not Meta_Data.Last loop pragma Loop_Invariant (Get_Error (Handle => Flac_File) = No_Error and then Is_Open (Handle => Flac_File)); Read_Metadata_Block (Flac_File => Flac_File, Meta_Data => Meta_Data); if Flac_File.Error /= No_Error then return; end if; if Meta_Data.Block_Type = Types.Invalid then Close (Flac_File => Flac_File); Flac_File.Error := Error_Type'(Main => Not_A_Flac_File, Sub => Invalid_Meta_Data); return; end if; SPARK_Stream_IO.Skip (File => Flac_File.File, Num_Elements => Ada.Streams.Stream_IO.Count (Meta_Data.Length), Error => Error); if Error then Close (Flac_File => Flac_File); Flac_File.Error := Error_Type'(Main => Not_A_Flac_File, Sub => Corrupt_Meta_Data); return; end if; end loop; end Skip_All_Meta_Data; -- Now the file should be positioned at the first frame. declare Frame : Frames.T; begin Frames.Read (File => Flac_File.File, Sample_Rate => Sample_Rate (Handle => Flac_File), Sample_Size => Bits_Per_Sample (Handle => Flac_File), Item => Frame, Error => Error); if Error then Flac.Debug.Print_Frame_Info (Frame => Frame); else Flac.Debug.Print_Frame_Info (Frame => Frame); end if; end; end Open; end Flac.Reader;

37.974359

78

0.45857

2292aca8d511fc7c925248e28ab20abe128dfbb9

2,000

ads

Ada

src/tom/library/sl/ada/abstractstrategypackage.ads

rewriting/tom

2918e95c78006f08a2a0919ef440413fa5c2342a

[ "BSD-3-Clause" ]

36

2016-02-19T12:09:49.000Z

2022-02-03T13:13:21.000Z

src/tom/library/sl/ada/abstractstrategypackage.ads

rewriting/tom

2918e95c78006f08a2a0919ef440413fa5c2342a

[ "BSD-3-Clause" ]

null

src/tom/library/sl/ada/abstractstrategypackage.ads

rewriting/tom

2918e95c78006f08a2a0919ef440413fa5c2342a

[ "BSD-3-Clause" ]

6

2017-11-30T17:07:10.000Z

2022-03-12T14:46:21.000Z

with ObjectPack, StrategyPackage, EnvironmentPackage, IntrospectorPackage, VisitablePackage, PositionPackage; use ObjectPack, StrategyPackage, EnvironmentPackage, IntrospectorPackage, VisitablePackage, PositionPackage; package AbstractStrategyPackage is type AbstractStrategy is abstract new Strategy and Object with record env: EnvironmentPtr := null; end record; type AbstractStrategyPtr is access all AbstractStrategy'Class; ---------------------------------------------------------------------------- -- Strategy implementation ---------------------------------------------------------------------------- function visit(str: access AbstractStrategy; any: access Environment) return VisitablePtr; function visit(str: access AbstractStrategy; any: VisitablePtr) return VisitablePtr; function visit(str: access AbstractStrategy; envt: access Environment; i: access Introspector'Class) return ObjectPtr; function visit(str: access AbstractStrategy; any: ObjectPtr; i: access Introspector'Class) return ObjectPtr; function visitLight(str: access AbstractStrategy; any: VisitablePtr) return VisitablePtr; function getEnvironment(str: AbstractStrategy) return access Environment; procedure setEnvironment(str: in out AbstractStrategy; env: access Environment); ---------------------------------------------------------------------------- function getRoot(str: AbstractStrategy) return ObjectPtr; procedure setRoot(str: in out AbstractStrategy; any: ObjectPtr); function getSubject(str: AbstractStrategy) return ObjectPtr; procedure setSubject(str: in out AbstractStrategy; any: ObjectPtr); function getPosition(str: AbstractStrategy) return Position; function getAncestor(str: AbstractStrategy) return ObjectPtr; procedure init(str: in out Strategy'Class; i: IntrospectorPtr); procedure init(str: in out Strategy'Class; env: access Environment); ---------------------------------------------------------------------------- end AbstractStrategyPackage;

52.631579

120

0.688

3d50f5e86c36ce66fb4e508e5bb6a007cb42f7e0

384,713

adb

Ada

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

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

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

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

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

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S E M _ C H 8 -- -- -- -- 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 Atree; use Atree; with Debug; use Debug; with Einfo; use Einfo; with Elists; use Elists; with Errout; use Errout; with Exp_Disp; use Exp_Disp; with Exp_Tss; use Exp_Tss; with Exp_Util; use Exp_Util; with Freeze; use Freeze; with Ghost; use Ghost; with Impunit; use Impunit; with Lib; use Lib; with Lib.Load; use Lib.Load; with Lib.Xref; use Lib.Xref; with Namet; use Namet; with Namet.Sp; use Namet.Sp; with Nlists; use Nlists; with Nmake; use Nmake; with Opt; use Opt; with Output; use Output; with Restrict; use Restrict; with Rident; use Rident; with Rtsfind; use Rtsfind; with Sem; use Sem; with Sem_Aux; use Sem_Aux; with Sem_Cat; use Sem_Cat; with Sem_Ch3; use Sem_Ch3; with Sem_Ch4; use Sem_Ch4; with Sem_Ch6; use Sem_Ch6; with Sem_Ch12; use Sem_Ch12; with Sem_Ch13; use Sem_Ch13; with Sem_Dim; use Sem_Dim; with Sem_Disp; use Sem_Disp; with Sem_Dist; use Sem_Dist; with Sem_Elab; use Sem_Elab; with Sem_Eval; use Sem_Eval; with Sem_Prag; use Sem_Prag; with Sem_Res; use Sem_Res; with Sem_Util; use Sem_Util; with Sem_Type; use Sem_Type; with Stand; use Stand; with Sinfo; use Sinfo; with Sinfo.CN; use Sinfo.CN; with Snames; use Snames; with Style; with Table; with Tbuild; use Tbuild; with Uintp; use Uintp; package body Sem_Ch8 is ------------------------------------ -- Visibility and Name Resolution -- ------------------------------------ -- This package handles name resolution and the collection of possible -- interpretations for overloaded names, prior to overload resolution. -- Name resolution is the process that establishes a mapping between source -- identifiers and the entities they denote at each point in the program. -- Each entity is represented by a defining occurrence. Each identifier -- that denotes an entity points to the corresponding defining occurrence. -- This is the entity of the applied occurrence. Each occurrence holds -- an index into the names table, where source identifiers are stored. -- Each entry in the names table for an identifier or designator uses the -- Info pointer to hold a link to the currently visible entity that has -- this name (see subprograms Get_Name_Entity_Id and Set_Name_Entity_Id -- in package Sem_Util). The visibility is initialized at the beginning of -- semantic processing to make entities in package Standard immediately -- visible. The visibility table is used in a more subtle way when -- compiling subunits (see below). -- Entities that have the same name (i.e. homonyms) are chained. In the -- case of overloaded entities, this chain holds all the possible meanings -- of a given identifier. The process of overload resolution uses type -- information to select from this chain the unique meaning of a given -- identifier. -- Entities are also chained in their scope, through the Next_Entity link. -- As a consequence, the name space is organized as a sparse matrix, where -- each row corresponds to a scope, and each column to a source identifier. -- Open scopes, that is to say scopes currently being compiled, have their -- corresponding rows of entities in order, innermost scope first. -- The scopes of packages that are mentioned in context clauses appear in -- no particular order, interspersed among open scopes. This is because -- in the course of analyzing the context of a compilation, a package -- declaration is first an open scope, and subsequently an element of the -- context. If subunits or child units are present, a parent unit may -- appear under various guises at various times in the compilation. -- When the compilation of the innermost scope is complete, the entities -- defined therein are no longer visible. If the scope is not a package -- declaration, these entities are never visible subsequently, and can be -- removed from visibility chains. If the scope is a package declaration, -- its visible declarations may still be accessible. Therefore the entities -- defined in such a scope are left on the visibility chains, and only -- their visibility (immediately visibility or potential use-visibility) -- is affected. -- The ordering of homonyms on their chain does not necessarily follow -- the order of their corresponding scopes on the scope stack. For -- example, if package P and the enclosing scope both contain entities -- named E, then when compiling the package body the chain for E will -- hold the global entity first, and the local one (corresponding to -- the current inner scope) next. As a result, name resolution routines -- do not assume any relative ordering of the homonym chains, either -- for scope nesting or to order of appearance of context clauses. -- When compiling a child unit, entities in the parent scope are always -- immediately visible. When compiling the body of a child unit, private -- entities in the parent must also be made immediately visible. There -- are separate routines to make the visible and private declarations -- visible at various times (see package Sem_Ch7). -- +--------+ +-----+ -- | In use |-------->| EU1 |--------------------------> -- +--------+ +-----+ -- | | -- +--------+ +-----+ +-----+ -- | Stand. |---------------->| ES1 |--------------->| ES2 |---> -- +--------+ +-----+ +-----+ -- | | -- +---------+ | +-----+ -- | with'ed |------------------------------>| EW2 |---> -- +---------+ | +-----+ -- | | -- +--------+ +-----+ +-----+ -- | Scope2 |---------------->| E12 |--------------->| E22 |---> -- +--------+ +-----+ +-----+ -- | | -- +--------+ +-----+ +-----+ -- | Scope1 |---------------->| E11 |--------------->| E12 |---> -- +--------+ +-----+ +-----+ -- ^ | | -- | | | -- | +---------+ | | -- | | with'ed |-----------------------------------------> -- | +---------+ | | -- | | | -- Scope stack | | -- (innermost first) | | -- +----------------------------+ -- Names table => | Id1 | | | | Id2 | -- +----------------------------+ -- Name resolution must deal with several syntactic forms: simple names, -- qualified names, indexed names, and various forms of calls. -- Each identifier points to an entry in the names table. The resolution -- of a simple name consists in traversing the homonym chain, starting -- from the names table. If an entry is immediately visible, it is the one -- designated by the identifier. If only potentially use-visible entities -- are on the chain, we must verify that they do not hide each other. If -- the entity we find is overloadable, we collect all other overloadable -- entities on the chain as long as they are not hidden. -- -- To resolve expanded names, we must find the entity at the intersection -- of the entity chain for the scope (the prefix) and the homonym chain -- for the selector. In general, homonym chains will be much shorter than -- entity chains, so it is preferable to start from the names table as -- well. If the entity found is overloadable, we must collect all other -- interpretations that are defined in the scope denoted by the prefix. -- For records, protected types, and tasks, their local entities are -- removed from visibility chains on exit from the corresponding scope. -- From the outside, these entities are always accessed by selected -- notation, and the entity chain for the record type, protected type, -- etc. is traversed sequentially in order to find the designated entity. -- The discriminants of a type and the operations of a protected type or -- task are unchained on exit from the first view of the type, (such as -- a private or incomplete type declaration, or a protected type speci- -- fication) and re-chained when compiling the second view. -- In the case of operators, we do not make operators on derived types -- explicit. As a result, the notation P."+" may denote either a user- -- defined function with name "+", or else an implicit declaration of the -- operator "+" in package P. The resolution of expanded names always -- tries to resolve an operator name as such an implicitly defined entity, -- in addition to looking for explicit declarations. -- All forms of names that denote entities (simple names, expanded names, -- character literals in some cases) have a Entity attribute, which -- identifies the entity denoted by the name. --------------------- -- The Scope Stack -- --------------------- -- The Scope stack keeps track of the scopes currently been compiled. -- Every entity that contains declarations (including records) is placed -- on the scope stack while it is being processed, and removed at the end. -- Whenever a non-package scope is exited, the entities defined therein -- are removed from the visibility table, so that entities in outer scopes -- become visible (see previous description). On entry to Sem, the scope -- stack only contains the package Standard. As usual, subunits complicate -- this picture ever so slightly. -- The Rtsfind mechanism can force a call to Semantics while another -- compilation is in progress. The unit retrieved by Rtsfind must be -- compiled in its own context, and has no access to the visibility of -- the unit currently being compiled. The procedures Save_Scope_Stack and -- Restore_Scope_Stack make entities in current open scopes invisible -- before compiling the retrieved unit, and restore the compilation -- environment afterwards. ------------------------ -- Compiling subunits -- ------------------------ -- Subunits must be compiled in the environment of the corresponding stub, -- that is to say with the same visibility into the parent (and its -- context) that is available at the point of the stub declaration, but -- with the additional visibility provided by the context clause of the -- subunit itself. As a result, compilation of a subunit forces compilation -- of the parent (see description in lib-). At the point of the stub -- declaration, Analyze is called recursively to compile the proper body of -- the subunit, but without reinitializing the names table, nor the scope -- stack (i.e. standard is not pushed on the stack). In this fashion the -- context of the subunit is added to the context of the parent, and the -- subunit is compiled in the correct environment. Note that in the course -- of processing the context of a subunit, Standard will appear twice on -- the scope stack: once for the parent of the subunit, and once for the -- unit in the context clause being compiled. However, the two sets of -- entities are not linked by homonym chains, so that the compilation of -- any context unit happens in a fresh visibility environment. ------------------------------- -- Processing of USE Clauses -- ------------------------------- -- Every defining occurrence has a flag indicating if it is potentially use -- visible. Resolution of simple names examines this flag. The processing -- of use clauses consists in setting this flag on all visible entities -- defined in the corresponding package. On exit from the scope of the use -- clause, the corresponding flag must be reset. However, a package may -- appear in several nested use clauses (pathological but legal, alas) -- which forces us to use a slightly more involved scheme: -- a) The defining occurrence for a package holds a flag -In_Use- to -- indicate that it is currently in the scope of a use clause. If a -- redundant use clause is encountered, then the corresponding occurrence -- of the package name is flagged -Redundant_Use-. -- b) On exit from a scope, the use clauses in its declarative part are -- scanned. The visibility flag is reset in all entities declared in -- package named in a use clause, as long as the package is not flagged -- as being in a redundant use clause (in which case the outer use -- clause is still in effect, and the direct visibility of its entities -- must be retained). -- Note that entities are not removed from their homonym chains on exit -- from the package specification. A subsequent use clause does not need -- to rechain the visible entities, but only to establish their direct -- visibility. ----------------------------------- -- Handling private declarations -- ----------------------------------- -- The principle that each entity has a single defining occurrence clashes -- with the presence of two separate definitions for private types: the -- first is the private type declaration, and second is the full type -- declaration. It is important that all references to the type point to -- the same defining occurrence, namely the first one. To enforce the two -- separate views of the entity, the corresponding information is swapped -- between the two declarations. Outside of the package, the defining -- occurrence only contains the private declaration information, while in -- the private part and the body of the package the defining occurrence -- contains the full declaration. To simplify the swap, the defining -- occurrence that currently holds the private declaration points to the -- full declaration. During semantic processing the defining occurrence -- also points to a list of private dependents, that is to say access types -- or composite types whose designated types or component types are -- subtypes or derived types of the private type in question. After the -- full declaration has been seen, the private dependents are updated to -- indicate that they have full definitions. ------------------------------------ -- Handling of Undefined Messages -- ------------------------------------ -- In normal mode, only the first use of an undefined identifier generates -- a message. The table Urefs is used to record error messages that have -- been issued so that second and subsequent ones do not generate further -- messages. However, the second reference causes text to be added to the -- original undefined message noting "(more references follow)". The -- full error list option (-gnatf) forces messages to be generated for -- every reference and disconnects the use of this table. type Uref_Entry is record Node : Node_Id; -- Node for identifier for which original message was posted. The -- Chars field of this identifier is used to detect later references -- to the same identifier. Err : Error_Msg_Id; -- Records error message Id of original undefined message. Reset to -- No_Error_Msg after the second occurrence, where it is used to add -- text to the original message as described above. Nvis : Boolean; -- Set if the message is not visible rather than undefined Loc : Source_Ptr; -- Records location of error message. Used to make sure that we do -- not consider a, b : undefined as two separate instances, which -- would otherwise happen, since the parser converts this sequence -- to a : undefined; b : undefined. end record; package Urefs is new Table.Table ( Table_Component_Type => Uref_Entry, Table_Index_Type => Nat, Table_Low_Bound => 1, Table_Initial => 10, Table_Increment => 100, Table_Name => "Urefs"); Candidate_Renaming : Entity_Id; -- Holds a candidate interpretation that appears in a subprogram renaming -- declaration and does not match the given specification, but matches at -- least on the first formal. Allows better error message when given -- specification omits defaulted parameters, a common error. ----------------------- -- Local Subprograms -- ----------------------- procedure Analyze_Generic_Renaming (N : Node_Id; K : Entity_Kind); -- Common processing for all three kinds of generic renaming declarations. -- Enter new name and indicate that it renames the generic unit. procedure Analyze_Renamed_Character (N : Node_Id; New_S : Entity_Id; Is_Body : Boolean); -- Renamed entity is given by a character literal, which must belong -- to the return type of the new entity. Is_Body indicates whether the -- declaration is a renaming_as_body. If the original declaration has -- already been frozen (because of an intervening body, e.g.) the body of -- the function must be built now. The same applies to the following -- various renaming procedures. procedure Analyze_Renamed_Dereference (N : Node_Id; New_S : Entity_Id; Is_Body : Boolean); -- Renamed entity is given by an explicit dereference. Prefix must be a -- conformant access_to_subprogram type. procedure Analyze_Renamed_Entry (N : Node_Id; New_S : Entity_Id; Is_Body : Boolean); -- If the renamed entity in a subprogram renaming is an entry or protected -- subprogram, build a body for the new entity whose only statement is a -- call to the renamed entity. procedure Analyze_Renamed_Family_Member (N : Node_Id; New_S : Entity_Id; Is_Body : Boolean); -- Used when the renamed entity is an indexed component. The prefix must -- denote an entry family. procedure Analyze_Renamed_Primitive_Operation (N : Node_Id; New_S : Entity_Id; Is_Body : Boolean); -- If the renamed entity in a subprogram renaming is a primitive operation -- or a class-wide operation in prefix form, save the target object, -- which must be added to the list of actuals in any subsequent call. -- The renaming operation is intrinsic because the compiler must in -- fact generate a wrapper for it (6.3.1 (10 1/2)). procedure Attribute_Renaming (N : Node_Id); -- Analyze renaming of attribute as subprogram. The renaming declaration N -- is rewritten as a subprogram body that returns the attribute reference -- applied to the formals of the function. procedure Set_Entity_Or_Discriminal (N : Node_Id; E : Entity_Id); -- Set Entity, with style check if need be. For a discriminant reference, -- replace by the corresponding discriminal, i.e. the parameter of the -- initialization procedure that corresponds to the discriminant. procedure Check_Frozen_Renaming (N : Node_Id; Subp : Entity_Id); -- A renaming_as_body may occur after the entity of the original decla- -- ration has been frozen. In that case, the body of the new entity must -- be built now, because the usual mechanism of building the renamed -- body at the point of freezing will not work. Subp is the subprogram -- for which N provides the Renaming_As_Body. procedure Check_In_Previous_With_Clause (N : Node_Id; Nam : Node_Id); -- N is a use_package clause and Nam the package name, or N is a use_type -- clause and Nam is the prefix of the type name. In either case, verify -- that the package is visible at that point in the context: either it -- appears in a previous with_clause, or because it is a fully qualified -- name and the root ancestor appears in a previous with_clause. procedure Check_Library_Unit_Renaming (N : Node_Id; Old_E : Entity_Id); -- Verify that the entity in a renaming declaration that is a library unit -- is itself a library unit and not a nested unit or subunit. Also check -- that if the renaming is a child unit of a generic parent, then the -- renamed unit must also be a child unit of that parent. Finally, verify -- that a renamed generic unit is not an implicit child declared within -- an instance of the parent. procedure Chain_Use_Clause (N : Node_Id); -- Chain use clause onto list of uses clauses headed by First_Use_Clause in -- the proper scope table entry. This is usually the current scope, but it -- will be an inner scope when installing the use clauses of the private -- declarations of a parent unit prior to compiling the private part of a -- child unit. This chain is traversed when installing/removing use clauses -- when compiling a subunit or instantiating a generic body on the fly, -- when it is necessary to save and restore full environments. function Enclosing_Instance return Entity_Id; -- In an instance nested within another one, several semantic checks are -- unnecessary because the legality of the nested instance has been checked -- in the enclosing generic unit. This applies in particular to legality -- checks on actuals for formal subprograms of the inner instance, which -- are checked as subprogram renamings, and may be complicated by confusion -- in private/full views. This function returns the instance enclosing the -- current one if there is such, else it returns Empty. -- -- If the renaming determines the entity for the default of a formal -- subprogram nested within another instance, choose the innermost -- candidate. This is because if the formal has a box, and we are within -- an enclosing instance where some candidate interpretations are local -- to this enclosing instance, we know that the default was properly -- resolved when analyzing the generic, so we prefer the local -- candidates to those that are external. This is not always the case -- but is a reasonable heuristic on the use of nested generics. The -- proper solution requires a full renaming model. function Entity_Of_Unit (U : Node_Id) return Entity_Id; -- Return the appropriate entity for determining which unit has a deeper -- scope: the defining entity for U, unless U is a package instance, in -- which case we retrieve the entity of the instance spec. procedure Find_Expanded_Name (N : Node_Id); -- The input is a selected component known to be an expanded name. Verify -- legality of selector given the scope denoted by prefix, and change node -- N into a expanded name with a properly set Entity field. function Find_Most_Prev (Use_Clause : Node_Id) return Node_Id; -- Find the most previous use clause (that is, the first one to appear in -- the source) by traversing the previous clause chain that exists in both -- N_Use_Package_Clause nodes and N_Use_Type_Clause nodes. -- ??? a better subprogram name is in order function Find_Renamed_Entity (N : Node_Id; Nam : Node_Id; New_S : Entity_Id; Is_Actual : Boolean := False) return Entity_Id; -- Find the renamed entity that corresponds to the given parameter profile -- in a subprogram renaming declaration. The renamed entity may be an -- operator, a subprogram, an entry, or a protected operation. Is_Actual -- indicates that the renaming is the one generated for an actual subpro- -- gram in an instance, for which special visibility checks apply. function Has_Implicit_Character_Literal (N : Node_Id) return Boolean; -- Find a type derived from Character or Wide_Character in the prefix of N. -- Used to resolved qualified names whose selector is a character literal. function Has_Private_With (E : Entity_Id) return Boolean; -- Ada 2005 (AI-262): Determines if the current compilation unit has a -- private with on E. function Has_Components (Typ : Entity_Id) return Boolean; -- Determine if given type has components, i.e. is either a record type or -- type or a type that has discriminants. function Has_Implicit_Operator (N : Node_Id) return Boolean; -- N is an expanded name whose selector is an operator name (e.g. P."+"). -- declarative part contains an implicit declaration of an operator if it -- has a declaration of a type to which one of the predefined operators -- apply. The existence of this routine is an implementation artifact. A -- more straightforward but more space-consuming choice would be to make -- all inherited operators explicit in the symbol table. procedure Inherit_Renamed_Profile (New_S : Entity_Id; Old_S : Entity_Id); -- A subprogram defined by a renaming declaration inherits the parameter -- profile of the renamed entity. The subtypes given in the subprogram -- specification are discarded and replaced with those of the renamed -- subprogram, which are then used to recheck the default values. function Most_Descendant_Use_Clause (Clause1 : Entity_Id; Clause2 : Entity_Id) return Entity_Id; -- Determine which use clause parameter is the most descendant in terms of -- scope. -- ??? a better subprogram name is in order procedure Premature_Usage (N : Node_Id); -- Diagnose usage of an entity before it is visible procedure Use_One_Package (N : Node_Id; Pack_Name : Entity_Id := Empty; Force : Boolean := False); -- Make visible entities declared in package P potentially use-visible -- in the current context. Also used in the analysis of subunits, when -- re-installing use clauses of parent units. N is the use_clause that -- names P (and possibly other packages). procedure Use_One_Type (Id : Node_Id; Installed : Boolean := False; Force : Boolean := False); -- Id is the subtype mark from a use_type_clause. This procedure makes -- the primitive operators of the type potentially use-visible. The -- boolean flag Installed indicates that the clause is being reinstalled -- after previous analysis, and primitive operations are already chained -- on the Used_Operations list of the clause. procedure Write_Info; -- Write debugging information on entities declared in current scope -------------------------------- -- Analyze_Exception_Renaming -- -------------------------------- -- The language only allows a single identifier, but the tree holds an -- identifier list. The parser has already issued an error message if -- there is more than one element in the list. procedure Analyze_Exception_Renaming (N : Node_Id) is Id : constant Entity_Id := Defining_Entity (N); Nam : constant Node_Id := Name (N); begin Enter_Name (Id); Analyze (Nam); Set_Ekind (Id, E_Exception); Set_Etype (Id, Standard_Exception_Type); Set_Is_Pure (Id, Is_Pure (Current_Scope)); if Is_Entity_Name (Nam) and then Present (Entity (Nam)) and then Ekind (Entity (Nam)) = E_Exception then if Present (Renamed_Object (Entity (Nam))) then Set_Renamed_Object (Id, Renamed_Object (Entity (Nam))); else Set_Renamed_Object (Id, Entity (Nam)); end if; -- The exception renaming declaration may become Ghost if it renames -- a Ghost entity. Mark_Ghost_Renaming (N, Entity (Nam)); else Error_Msg_N ("invalid exception name in renaming", Nam); end if; -- Implementation-defined aspect specifications can appear in a renaming -- declaration, but not language-defined ones. The call to procedure -- Analyze_Aspect_Specifications will take care of this error check. if Has_Aspects (N) then Analyze_Aspect_Specifications (N, Id); end if; end Analyze_Exception_Renaming; --------------------------- -- Analyze_Expanded_Name -- --------------------------- procedure Analyze_Expanded_Name (N : Node_Id) is begin -- If the entity pointer is already set, this is an internal node, or a -- node that is analyzed more than once, after a tree modification. In -- such a case there is no resolution to perform, just set the type. In -- either case, start by analyzing the prefix. Analyze (Prefix (N)); if Present (Entity (N)) then if Is_Type (Entity (N)) then Set_Etype (N, Entity (N)); else Set_Etype (N, Etype (Entity (N))); end if; else Find_Expanded_Name (N); end if; -- In either case, propagate dimension of entity to expanded name Analyze_Dimension (N); end Analyze_Expanded_Name; --------------------------------------- -- Analyze_Generic_Function_Renaming -- --------------------------------------- procedure Analyze_Generic_Function_Renaming (N : Node_Id) is begin Analyze_Generic_Renaming (N, E_Generic_Function); end Analyze_Generic_Function_Renaming; -------------------------------------- -- Analyze_Generic_Package_Renaming -- -------------------------------------- procedure Analyze_Generic_Package_Renaming (N : Node_Id) is begin -- Test for the Text_IO special unit case here, since we may be renaming -- one of the subpackages of Text_IO, then join common routine. Check_Text_IO_Special_Unit (Name (N)); Analyze_Generic_Renaming (N, E_Generic_Package); end Analyze_Generic_Package_Renaming; ---------------------------------------- -- Analyze_Generic_Procedure_Renaming -- ---------------------------------------- procedure Analyze_Generic_Procedure_Renaming (N : Node_Id) is begin Analyze_Generic_Renaming (N, E_Generic_Procedure); end Analyze_Generic_Procedure_Renaming; ------------------------------ -- Analyze_Generic_Renaming -- ------------------------------ procedure Analyze_Generic_Renaming (N : Node_Id; K : Entity_Kind) is New_P : constant Entity_Id := Defining_Entity (N); Inst : Boolean := False; Old_P : Entity_Id; begin if Name (N) = Error then return; end if; Generate_Definition (New_P); if Current_Scope /= Standard_Standard then Set_Is_Pure (New_P, Is_Pure (Current_Scope)); end if; if Nkind (Name (N)) = N_Selected_Component then Check_Generic_Child_Unit (Name (N), Inst); else Analyze (Name (N)); end if; if not Is_Entity_Name (Name (N)) then Error_Msg_N ("expect entity name in renaming declaration", Name (N)); Old_P := Any_Id; else Old_P := Entity (Name (N)); end if; Enter_Name (New_P); Set_Ekind (New_P, K); if Etype (Old_P) = Any_Type then null; elsif Ekind (Old_P) /= K then Error_Msg_N ("invalid generic unit name", Name (N)); else if Present (Renamed_Object (Old_P)) then Set_Renamed_Object (New_P, Renamed_Object (Old_P)); else Set_Renamed_Object (New_P, Old_P); end if; -- The generic renaming declaration may become Ghost if it renames a -- Ghost entity. Mark_Ghost_Renaming (N, Old_P); Set_Is_Pure (New_P, Is_Pure (Old_P)); Set_Is_Preelaborated (New_P, Is_Preelaborated (Old_P)); Set_Etype (New_P, Etype (Old_P)); Set_Has_Completion (New_P); if In_Open_Scopes (Old_P) then Error_Msg_N ("within its scope, generic denotes its instance", N); end if; -- For subprograms, propagate the Intrinsic flag, to allow, e.g. -- renamings and subsequent instantiations of Unchecked_Conversion. if Is_Generic_Subprogram (Old_P) then Set_Is_Intrinsic_Subprogram (New_P, Is_Intrinsic_Subprogram (Old_P)); end if; Check_Library_Unit_Renaming (N, Old_P); end if; -- Implementation-defined aspect specifications can appear in a renaming -- declaration, but not language-defined ones. The call to procedure -- Analyze_Aspect_Specifications will take care of this error check. if Has_Aspects (N) then Analyze_Aspect_Specifications (N, New_P); end if; end Analyze_Generic_Renaming; ----------------------------- -- Analyze_Object_Renaming -- ----------------------------- procedure Analyze_Object_Renaming (N : Node_Id) is Id : constant Entity_Id := Defining_Identifier (N); Loc : constant Source_Ptr := Sloc (N); Nam : constant Node_Id := Name (N); Is_Object_Ref : Boolean; Dec : Node_Id; T : Entity_Id; T2 : Entity_Id; procedure Check_Constrained_Object; -- If the nominal type is unconstrained but the renamed object is -- constrained, as can happen with renaming an explicit dereference or -- a function return, build a constrained subtype from the object. If -- the renaming is for a formal in an accept statement, the analysis -- has already established its actual subtype. This is only relevant -- if the renamed object is an explicit dereference. function Get_Object_Name (Nod : Node_Id) return Node_Id; -- Obtain the name of the object from node Nod which is being renamed by -- the object renaming declaration N. ------------------------------ -- Check_Constrained_Object -- ------------------------------ procedure Check_Constrained_Object is Typ : constant Entity_Id := Etype (Nam); Subt : Entity_Id; Loop_Scheme : Node_Id; begin if Nkind (Nam) in N_Function_Call | N_Explicit_Dereference and then Is_Composite_Type (Typ) and then not Is_Constrained (Typ) and then not Has_Unknown_Discriminants (Typ) and then Expander_Active then -- If Actual_Subtype is already set, nothing to do if Ekind (Id) in E_Variable | E_Constant and then Present (Actual_Subtype (Id)) then null; -- A renaming of an unchecked union has no actual subtype elsif Is_Unchecked_Union (Typ) then null; -- If a record is limited its size is invariant. This is the case -- in particular with record types with an access discriminant -- that are used in iterators. This is an optimization, but it -- also prevents typing anomalies when the prefix is further -- expanded. -- Note that we cannot just use the Is_Limited_Record flag because -- it does not apply to records with limited components, for which -- this syntactic flag is not set, but whose size is also fixed. elsif Is_Limited_Type (Typ) then null; else Subt := Make_Temporary (Loc, 'T'); Remove_Side_Effects (Nam); Insert_Action (N, Make_Subtype_Declaration (Loc, Defining_Identifier => Subt, Subtype_Indication => Make_Subtype_From_Expr (Nam, Typ))); Rewrite (Subtype_Mark (N), New_Occurrence_Of (Subt, Loc)); Set_Etype (Nam, Subt); -- Suppress discriminant checks on this subtype if the original -- type has defaulted discriminants and Id is a "for of" loop -- iterator. if Has_Defaulted_Discriminants (Typ) and then Nkind (Original_Node (Parent (N))) = N_Loop_Statement then Loop_Scheme := Iteration_Scheme (Original_Node (Parent (N))); if Present (Loop_Scheme) and then Present (Iterator_Specification (Loop_Scheme)) and then Defining_Identifier (Iterator_Specification (Loop_Scheme)) = Id then Set_Checks_May_Be_Suppressed (Subt); Push_Local_Suppress_Stack_Entry (Entity => Subt, Check => Discriminant_Check, Suppress => True); end if; end if; -- Freeze subtype at once, to prevent order of elaboration -- issues in the backend. The renamed object exists, so its -- type is already frozen in any case. Freeze_Before (N, Subt); end if; end if; end Check_Constrained_Object; --------------------- -- Get_Object_Name -- --------------------- function Get_Object_Name (Nod : Node_Id) return Node_Id is Obj_Nam : Node_Id; begin Obj_Nam := Nod; while Present (Obj_Nam) loop case Nkind (Obj_Nam) is when N_Attribute_Reference | N_Explicit_Dereference | N_Indexed_Component | N_Slice => Obj_Nam := Prefix (Obj_Nam); when N_Selected_Component => Obj_Nam := Selector_Name (Obj_Nam); when N_Qualified_Expression | N_Type_Conversion => Obj_Nam := Expression (Obj_Nam); when others => exit; end case; end loop; return Obj_Nam; end Get_Object_Name; -- Start of processing for Analyze_Object_Renaming begin if Nam = Error then return; end if; Set_Is_Pure (Id, Is_Pure (Current_Scope)); Enter_Name (Id); -- The renaming of a component that depends on a discriminant requires -- an actual subtype, because in subsequent use of the object Gigi will -- be unable to locate the actual bounds. This explicit step is required -- when the renaming is generated in removing side effects of an -- already-analyzed expression. if Nkind (Nam) = N_Selected_Component and then Analyzed (Nam) then -- The object renaming declaration may become Ghost if it renames a -- Ghost entity. if Is_Entity_Name (Nam) then Mark_Ghost_Renaming (N, Entity (Nam)); end if; T := Etype (Nam); Dec := Build_Actual_Subtype_Of_Component (Etype (Nam), Nam); if Present (Dec) then Insert_Action (N, Dec); T := Defining_Identifier (Dec); Set_Etype (Nam, T); end if; elsif Present (Subtype_Mark (N)) or else not Present (Access_Definition (N)) then if Present (Subtype_Mark (N)) then Find_Type (Subtype_Mark (N)); T := Entity (Subtype_Mark (N)); Analyze (Nam); -- AI12-0275: Case of object renaming without a subtype_mark else Analyze (Nam); -- Normal case of no overloading in object name if not Is_Overloaded (Nam) then -- Catch error cases (such as attempting to rename a procedure -- or package) using the shorthand form. if No (Etype (Nam)) or else Etype (Nam) = Standard_Void_Type then Error_Msg_N ("object name or value expected in renaming", Nam); Set_Ekind (Id, E_Variable); Set_Etype (Id, Any_Type); return; else T := Etype (Nam); end if; -- Case of overloaded name, which will be illegal if there's more -- than one acceptable interpretation (such as overloaded function -- calls). else declare I : Interp_Index; I1 : Interp_Index; It : Interp; It1 : Interp; Nam1 : Entity_Id; begin -- More than one candidate interpretation is available -- Remove procedure calls, which syntactically cannot appear -- in this context, but which cannot be removed by type -- checking, because the context does not impose a type. Get_First_Interp (Nam, I, It); while Present (It.Typ) loop if It.Typ = Standard_Void_Type then Remove_Interp (I); end if; Get_Next_Interp (I, It); end loop; Get_First_Interp (Nam, I, It); I1 := I; It1 := It; -- If there's no type present, we have an error case (such -- as overloaded procedures named in the object renaming). if No (It.Typ) then Error_Msg_N ("object name or value expected in renaming", Nam); Set_Ekind (Id, E_Variable); Set_Etype (Id, Any_Type); return; end if; Get_Next_Interp (I, It); if Present (It.Typ) then Nam1 := It1.Nam; It1 := Disambiguate (Nam, I1, I, Any_Type); if It1 = No_Interp then Error_Msg_N ("ambiguous name in object renaming", Nam); Error_Msg_Sloc := Sloc (It.Nam); Error_Msg_N ("\\possible interpretation#!", Nam); Error_Msg_Sloc := Sloc (Nam1); Error_Msg_N ("\\possible interpretation#!", Nam); return; end if; end if; Set_Etype (Nam, It1.Typ); T := It1.Typ; end; end if; if Etype (Nam) = Standard_Exception_Type then Error_Msg_N ("exception requires a subtype mark in renaming", Nam); return; end if; end if; -- The object renaming declaration may become Ghost if it renames a -- Ghost entity. if Is_Entity_Name (Nam) then Mark_Ghost_Renaming (N, Entity (Nam)); end if; Resolve (Nam, T); -- If the renamed object is a function call of a limited type, -- the expansion of the renaming is complicated by the presence -- of various temporaries and subtypes that capture constraints -- of the renamed object. Rewrite node as an object declaration, -- whose expansion is simpler. Given that the object is limited -- there is no copy involved and no performance hit. if Nkind (Nam) = N_Function_Call and then Is_Limited_View (Etype (Nam)) and then not Is_Constrained (Etype (Nam)) and then Comes_From_Source (N) then Set_Etype (Id, T); Set_Ekind (Id, E_Constant); Rewrite (N, Make_Object_Declaration (Loc, Defining_Identifier => Id, Constant_Present => True, Object_Definition => New_Occurrence_Of (Etype (Nam), Loc), Expression => Relocate_Node (Nam))); return; end if; -- Ada 2012 (AI05-149): Reject renaming of an anonymous access object -- when renaming declaration has a named access type. The Ada 2012 -- coverage rules allow an anonymous access type in the context of -- an expected named general access type, but the renaming rules -- require the types to be the same. (An exception is when the type -- of the renaming is also an anonymous access type, which can only -- happen due to a renaming created by the expander.) if Nkind (Nam) = N_Type_Conversion and then not Comes_From_Source (Nam) and then Is_Anonymous_Access_Type (Etype (Expression (Nam))) and then not Is_Anonymous_Access_Type (T) then Wrong_Type (Expression (Nam), T); -- Should we give better error??? end if; -- Check that a class-wide object is not being renamed as an object -- of a specific type. The test for access types is needed to exclude -- cases where the renamed object is a dynamically tagged access -- result, such as occurs in certain expansions. if Is_Tagged_Type (T) then Check_Dynamically_Tagged_Expression (Expr => Nam, Typ => T, Related_Nod => N); end if; -- Ada 2005 (AI-230/AI-254): Access renaming else pragma Assert (Present (Access_Definition (N))); T := Access_Definition (Related_Nod => N, N => Access_Definition (N)); Analyze (Nam); -- The object renaming declaration may become Ghost if it renames a -- Ghost entity. if Is_Entity_Name (Nam) then Mark_Ghost_Renaming (N, Entity (Nam)); end if; -- Ada 2005 AI05-105: if the declaration has an anonymous access -- type, the renamed object must also have an anonymous type, and -- this is a name resolution rule. This was implicit in the last part -- of the first sentence in 8.5.1(3/2), and is made explicit by this -- recent AI. if not Is_Overloaded (Nam) then if Ekind (Etype (Nam)) /= Ekind (T) then Error_Msg_N ("expect anonymous access type in object renaming", N); end if; else declare I : Interp_Index; It : Interp; Typ : Entity_Id := Empty; Seen : Boolean := False; begin Get_First_Interp (Nam, I, It); while Present (It.Typ) loop -- Renaming is ambiguous if more than one candidate -- interpretation is type-conformant with the context. if Ekind (It.Typ) = Ekind (T) then if Ekind (T) = E_Anonymous_Access_Subprogram_Type and then Type_Conformant (Designated_Type (T), Designated_Type (It.Typ)) then if not Seen then Seen := True; else Error_Msg_N ("ambiguous expression in renaming", Nam); end if; elsif Ekind (T) = E_Anonymous_Access_Type and then Covers (Designated_Type (T), Designated_Type (It.Typ)) then if not Seen then Seen := True; else Error_Msg_N ("ambiguous expression in renaming", Nam); end if; end if; if Covers (T, It.Typ) then Typ := It.Typ; Set_Etype (Nam, Typ); Set_Is_Overloaded (Nam, False); end if; end if; Get_Next_Interp (I, It); end loop; end; end if; Resolve (Nam, T); -- Do not perform the legality checks below when the resolution of -- the renaming name failed because the associated type is Any_Type. if Etype (Nam) = Any_Type then null; -- Ada 2005 (AI-231): In the case where the type is defined by an -- access_definition, the renamed entity shall be of an access-to- -- constant type if and only if the access_definition defines an -- access-to-constant type. ARM 8.5.1(4) elsif Constant_Present (Access_Definition (N)) and then not Is_Access_Constant (Etype (Nam)) then Error_Msg_N ("(Ada 2005): the renamed object is not access-to-constant " & "(RM 8.5.1(6))", N); elsif not Constant_Present (Access_Definition (N)) and then Is_Access_Constant (Etype (Nam)) then Error_Msg_N ("(Ada 2005): the renamed object is not access-to-variable " & "(RM 8.5.1(6))", N); end if; if Is_Access_Subprogram_Type (Etype (Nam)) then Check_Subtype_Conformant (Designated_Type (T), Designated_Type (Etype (Nam))); elsif not Subtypes_Statically_Match (Designated_Type (T), Available_View (Designated_Type (Etype (Nam)))) then Error_Msg_N ("subtype of renamed object does not statically match", N); end if; end if; -- Special processing for renaming function return object. Some errors -- and warnings are produced only for calls that come from source. if Nkind (Nam) = N_Function_Call then case Ada_Version is -- Usage is illegal in Ada 83, but renamings are also introduced -- during expansion, and error does not apply to those. when Ada_83 => if Comes_From_Source (N) then Error_Msg_N ("(Ada 83) cannot rename function return object", Nam); end if; -- In Ada 95, warn for odd case of renaming parameterless function -- call if this is not a limited type (where this is useful). when others => if Warn_On_Object_Renames_Function and then No (Parameter_Associations (Nam)) and then not Is_Limited_Type (Etype (Nam)) and then Comes_From_Source (Nam) then Error_Msg_N ("renaming function result object is suspicious?R?", Nam); Error_Msg_NE ("\function & will be called only once?R?", Nam, Entity (Name (Nam))); Error_Msg_N -- CODEFIX ("\suggest using an initialized constant object " & "instead?R?", Nam); end if; end case; end if; Check_Constrained_Object; -- An object renaming requires an exact match of the type. Class-wide -- matching is not allowed. if Is_Class_Wide_Type (T) and then Base_Type (Etype (Nam)) /= Base_Type (T) then Wrong_Type (Nam, T); end if; -- We must search for an actual subtype here so that the bounds of -- objects of unconstrained types don't get dropped on the floor - such -- as with renamings of formal parameters. T2 := Get_Actual_Subtype_If_Available (Nam); -- Ada 2005 (AI-326): Handle wrong use of incomplete type if Nkind (Nam) = N_Explicit_Dereference and then Ekind (Etype (T2)) = E_Incomplete_Type then Error_Msg_NE ("invalid use of incomplete type&", Id, T2); return; elsif Ekind (Etype (T)) = E_Incomplete_Type then Error_Msg_NE ("invalid use of incomplete type&", Id, T); return; end if; if Ada_Version >= Ada_2005 and then Nkind (Nam) in N_Has_Entity then declare Nam_Ent : constant Entity_Id := Entity (Get_Object_Name (Nam)); Nam_Decl : constant Node_Id := Declaration_Node (Nam_Ent); begin if Has_Null_Exclusion (N) and then not Has_Null_Exclusion (Nam_Decl) then -- Ada 2005 (AI-423): If the object name denotes a generic -- formal object of a generic unit G, and the object renaming -- declaration occurs within the body of G or within the body -- of a generic unit declared within the declarative region -- of G, then the declaration of the formal object of G must -- have a null exclusion or a null-excluding subtype. if Is_Formal_Object (Nam_Ent) and then In_Generic_Scope (Id) then if not Can_Never_Be_Null (Etype (Nam_Ent)) then Error_Msg_N ("object does not exclude `NULL` " & "(RM 8.5.1(4.6/2))", N); elsif In_Package_Body (Scope (Id)) then Error_Msg_N ("formal object does not have a null exclusion" & "(RM 8.5.1(4.6/2))", N); end if; -- Ada 2005 (AI-423): Otherwise, the subtype of the object name -- shall exclude null. elsif not Can_Never_Be_Null (Etype (Nam_Ent)) then Error_Msg_N ("object does not exclude `NULL` " & "(RM 8.5.1(4.6/2))", N); -- An instance is illegal if it contains a renaming that -- excludes null, and the actual does not. The renaming -- declaration has already indicated that the declaration -- of the renamed actual in the instance will raise -- constraint_error. elsif Nkind (Nam_Decl) = N_Object_Declaration and then In_Instance and then Present (Corresponding_Generic_Association (Nam_Decl)) and then Nkind (Expression (Nam_Decl)) = N_Raise_Constraint_Error then Error_Msg_N ("actual does not exclude `NULL` (RM 8.5.1(4.6/2))", N); -- Finally, if there is a null exclusion, the subtype mark -- must not be null-excluding. elsif No (Access_Definition (N)) and then Can_Never_Be_Null (T) then Error_Msg_NE ("`NOT NULL` not allowed (& already excludes null)", N, T); end if; elsif Can_Never_Be_Null (T) and then not Can_Never_Be_Null (Etype (Nam_Ent)) then Error_Msg_N ("object does not exclude `NULL` (RM 8.5.1(4.6/2))", N); elsif Has_Null_Exclusion (N) and then No (Access_Definition (N)) and then Can_Never_Be_Null (T) then Error_Msg_NE ("`NOT NULL` not allowed (& already excludes null)", N, T); end if; end; end if; -- Set the Ekind of the entity, unless it has been set already, as is -- the case for the iteration object over a container with no variable -- indexing. In that case it's been marked as a constant, and we do not -- want to change it to a variable. if Ekind (Id) /= E_Constant then Set_Ekind (Id, E_Variable); end if; -- Initialize the object size and alignment. Note that we used to call -- Init_Size_Align here, but that's wrong for objects which have only -- an Esize, not an RM_Size field. Init_Object_Size_Align (Id); -- If N comes from source then check that the original node is an -- object reference since there may have been several rewritting and -- folding. Do not do this for N_Function_Call or N_Explicit_Dereference -- which might correspond to rewrites of e.g. N_Selected_Component -- (for example Object.Method rewriting). -- If N does not come from source then assume the tree is properly -- formed and accept any object reference. In such cases we do support -- more cases of renamings anyway, so the actual check on which renaming -- is valid is better left to the code generator as a last sanity -- check. if Comes_From_Source (N) then if Nkind (Nam) in N_Function_Call | N_Explicit_Dereference then Is_Object_Ref := Is_Object_Reference (Nam); else Is_Object_Ref := Is_Object_Reference (Original_Node (Nam)); end if; else Is_Object_Ref := True; end if; if T = Any_Type or else Etype (Nam) = Any_Type then return; -- Verify that the renamed entity is an object or function call elsif Is_Object_Ref then if Comes_From_Source (N) then if Is_Dependent_Component_Of_Mutable_Object (Nam) then Error_Msg_N ("illegal renaming of discriminant-dependent component", Nam); end if; -- If the renaming comes from source and the renamed object is a -- dereference, then mark the prefix as needing debug information, -- since it might have been rewritten hence internally generated -- and Debug_Renaming_Declaration will link the renaming to it. if Nkind (Nam) = N_Explicit_Dereference and then Is_Entity_Name (Prefix (Nam)) then Set_Debug_Info_Needed (Entity (Prefix (Nam))); end if; end if; -- Weird but legal, equivalent to renaming a function call. Illegal -- if the literal is the result of constant-folding an attribute -- reference that is not a function. elsif Is_Entity_Name (Nam) and then Ekind (Entity (Nam)) = E_Enumeration_Literal and then Nkind (Original_Node (Nam)) /= N_Attribute_Reference then null; -- A named number can only be renamed without a subtype mark elsif Nkind (Nam) in N_Real_Literal | N_Integer_Literal and then Present (Subtype_Mark (N)) and then Present (Original_Entity (Nam)) then Error_Msg_N ("incompatible types in renaming", Nam); -- AI12-0383: Names that denote values can be renamed elsif Ada_Version < Ada_2020 then Error_Msg_N ("value in renaming requires -gnat2020", Nam); end if; Set_Etype (Id, T2); if not Is_Variable (Nam) then Set_Ekind (Id, E_Constant); Set_Never_Set_In_Source (Id, True); Set_Is_True_Constant (Id, True); end if; -- The entity of the renaming declaration needs to reflect whether the -- renamed object is atomic, independent, volatile or VFA. These flags -- are set on the renamed object in the RM legality sense. Set_Is_Atomic (Id, Is_Atomic_Object (Nam)); Set_Is_Independent (Id, Is_Independent_Object (Nam)); Set_Is_Volatile (Id, Is_Volatile_Object (Nam)); Set_Is_Volatile_Full_Access (Id, Is_Volatile_Full_Access_Object (Nam)); -- Treat as volatile if we just set the Volatile flag if Is_Volatile (Id) -- Or if we are renaming an entity which was marked this way -- Are there more cases, e.g. X(J) where X is Treat_As_Volatile ??? or else (Is_Entity_Name (Nam) and then Treat_As_Volatile (Entity (Nam))) then Set_Treat_As_Volatile (Id, True); end if; -- Now make the link to the renamed object Set_Renamed_Object (Id, Nam); -- Implementation-defined aspect specifications can appear in a renaming -- declaration, but not language-defined ones. The call to procedure -- Analyze_Aspect_Specifications will take care of this error check. if Has_Aspects (N) then Analyze_Aspect_Specifications (N, Id); end if; -- Deal with dimensions Analyze_Dimension (N); end Analyze_Object_Renaming; ------------------------------ -- Analyze_Package_Renaming -- ------------------------------ procedure Analyze_Package_Renaming (N : Node_Id) is New_P : constant Entity_Id := Defining_Entity (N); Old_P : Entity_Id; Spec : Node_Id; begin if Name (N) = Error then return; end if; -- Check for Text_IO special unit (we may be renaming a Text_IO child) Check_Text_IO_Special_Unit (Name (N)); if Current_Scope /= Standard_Standard then Set_Is_Pure (New_P, Is_Pure (Current_Scope)); end if; Enter_Name (New_P); Analyze (Name (N)); if Is_Entity_Name (Name (N)) then Old_P := Entity (Name (N)); else Old_P := Any_Id; end if; if Etype (Old_P) = Any_Type then Error_Msg_N ("expect package name in renaming", Name (N)); elsif Ekind (Old_P) /= E_Package and then not (Ekind (Old_P) = E_Generic_Package and then In_Open_Scopes (Old_P)) then if Ekind (Old_P) = E_Generic_Package then Error_Msg_N ("generic package cannot be renamed as a package", Name (N)); else Error_Msg_Sloc := Sloc (Old_P); Error_Msg_NE ("expect package name in renaming, found& declared#", Name (N), Old_P); end if; -- Set basic attributes to minimize cascaded errors Set_Ekind (New_P, E_Package); Set_Etype (New_P, Standard_Void_Type); -- Here for OK package renaming else -- Entities in the old package are accessible through the renaming -- entity. The simplest implementation is to have both packages share -- the entity list. Set_Ekind (New_P, E_Package); Set_Etype (New_P, Standard_Void_Type); if Present (Renamed_Object (Old_P)) then Set_Renamed_Object (New_P, Renamed_Object (Old_P)); else Set_Renamed_Object (New_P, Old_P); end if; -- The package renaming declaration may become Ghost if it renames a -- Ghost entity. Mark_Ghost_Renaming (N, Old_P); Set_Has_Completion (New_P); Set_First_Entity (New_P, First_Entity (Old_P)); Set_Last_Entity (New_P, Last_Entity (Old_P)); Set_First_Private_Entity (New_P, First_Private_Entity (Old_P)); Check_Library_Unit_Renaming (N, Old_P); Generate_Reference (Old_P, Name (N)); -- If the renaming is in the visible part of a package, then we set -- Renamed_In_Spec for the renamed package, to prevent giving -- warnings about no entities referenced. Such a warning would be -- overenthusiastic, since clients can see entities in the renamed -- package via the visible package renaming. declare Ent : constant Entity_Id := Cunit_Entity (Current_Sem_Unit); begin if Ekind (Ent) = E_Package and then not In_Private_Part (Ent) and then In_Extended_Main_Source_Unit (N) and then Ekind (Old_P) = E_Package then Set_Renamed_In_Spec (Old_P); end if; end; -- If this is the renaming declaration of a package instantiation -- within itself, it is the declaration that ends the list of actuals -- for the instantiation. At this point, the subtypes that rename -- the actuals are flagged as generic, to avoid spurious ambiguities -- if the actuals for two distinct formals happen to coincide. If -- the actual is a private type, the subtype has a private completion -- that is flagged in the same fashion. -- Resolution is identical to what is was in the original generic. -- On exit from the generic instance, these are turned into regular -- subtypes again, so they are compatible with types in their class. if not Is_Generic_Instance (Old_P) then return; else Spec := Specification (Unit_Declaration_Node (Old_P)); end if; if Nkind (Spec) = N_Package_Specification and then Present (Generic_Parent (Spec)) and then Old_P = Current_Scope and then Chars (New_P) = Chars (Generic_Parent (Spec)) then declare E : Entity_Id; begin E := First_Entity (Old_P); while Present (E) and then E /= New_P loop if Is_Type (E) and then Nkind (Parent (E)) = N_Subtype_Declaration then Set_Is_Generic_Actual_Type (E); if Is_Private_Type (E) and then Present (Full_View (E)) then Set_Is_Generic_Actual_Type (Full_View (E)); end if; end if; Next_Entity (E); end loop; end; end if; end if; -- Implementation-defined aspect specifications can appear in a renaming -- declaration, but not language-defined ones. The call to procedure -- Analyze_Aspect_Specifications will take care of this error check. if Has_Aspects (N) then Analyze_Aspect_Specifications (N, New_P); end if; end Analyze_Package_Renaming; ------------------------------- -- Analyze_Renamed_Character -- ------------------------------- procedure Analyze_Renamed_Character (N : Node_Id; New_S : Entity_Id; Is_Body : Boolean) is C : constant Node_Id := Name (N); begin if Ekind (New_S) = E_Function then Resolve (C, Etype (New_S)); if Is_Body then Check_Frozen_Renaming (N, New_S); end if; else Error_Msg_N ("character literal can only be renamed as function", N); end if; end Analyze_Renamed_Character; --------------------------------- -- Analyze_Renamed_Dereference -- --------------------------------- procedure Analyze_Renamed_Dereference (N : Node_Id; New_S : Entity_Id; Is_Body : Boolean) is Nam : constant Node_Id := Name (N); P : constant Node_Id := Prefix (Nam); Typ : Entity_Id; Ind : Interp_Index; It : Interp; begin if not Is_Overloaded (P) then if Ekind (Etype (Nam)) /= E_Subprogram_Type or else not Type_Conformant (Etype (Nam), New_S) then Error_Msg_N ("designated type does not match specification", P); else Resolve (P); end if; return; else Typ := Any_Type; Get_First_Interp (Nam, Ind, It); while Present (It.Nam) loop if Ekind (It.Nam) = E_Subprogram_Type and then Type_Conformant (It.Nam, New_S) then if Typ /= Any_Id then Error_Msg_N ("ambiguous renaming", P); return; else Typ := It.Nam; end if; end if; Get_Next_Interp (Ind, It); end loop; if Typ = Any_Type then Error_Msg_N ("designated type does not match specification", P); else Resolve (N, Typ); if Is_Body then Check_Frozen_Renaming (N, New_S); end if; end if; end if; end Analyze_Renamed_Dereference; --------------------------- -- Analyze_Renamed_Entry -- --------------------------- procedure Analyze_Renamed_Entry (N : Node_Id; New_S : Entity_Id; Is_Body : Boolean) is Nam : constant Node_Id := Name (N); Sel : constant Node_Id := Selector_Name (Nam); Is_Actual : constant Boolean := Present (Corresponding_Formal_Spec (N)); Old_S : Entity_Id; begin if Entity (Sel) = Any_Id then -- Selector is undefined on prefix. Error emitted already Set_Has_Completion (New_S); return; end if; -- Otherwise find renamed entity and build body of New_S as a call to it Old_S := Find_Renamed_Entity (N, Selector_Name (Nam), New_S); if Old_S = Any_Id then Error_Msg_N (" no subprogram or entry matches specification", N); else if Is_Body then Check_Subtype_Conformant (New_S, Old_S, N); Generate_Reference (New_S, Defining_Entity (N), 'b'); Style.Check_Identifier (Defining_Entity (N), New_S); else -- Only mode conformance required for a renaming_as_declaration Check_Mode_Conformant (New_S, Old_S, N); end if; Inherit_Renamed_Profile (New_S, Old_S); -- The prefix can be an arbitrary expression that yields a task or -- protected object, so it must be resolved. if Is_Access_Type (Etype (Prefix (Nam))) then Insert_Explicit_Dereference (Prefix (Nam)); end if; Resolve (Prefix (Nam), Scope (Old_S)); end if; Set_Convention (New_S, Convention (Old_S)); Set_Has_Completion (New_S, Inside_A_Generic); -- AI05-0225: If the renamed entity is a procedure or entry of a -- protected object, the target object must be a variable. if Is_Protected_Type (Scope (Old_S)) and then Ekind (New_S) = E_Procedure and then not Is_Variable (Prefix (Nam)) then if Is_Actual then Error_Msg_N ("target object of protected operation used as actual for " & "formal procedure must be a variable", Nam); else Error_Msg_N ("target object of protected operation renamed as procedure, " & "must be a variable", Nam); end if; end if; if Is_Body then Check_Frozen_Renaming (N, New_S); end if; end Analyze_Renamed_Entry; ----------------------------------- -- Analyze_Renamed_Family_Member -- ----------------------------------- procedure Analyze_Renamed_Family_Member (N : Node_Id; New_S : Entity_Id; Is_Body : Boolean) is Nam : constant Node_Id := Name (N); P : constant Node_Id := Prefix (Nam); Old_S : Entity_Id; begin if (Is_Entity_Name (P) and then Ekind (Entity (P)) = E_Entry_Family) or else (Nkind (P) = N_Selected_Component and then Ekind (Entity (Selector_Name (P))) = E_Entry_Family) then if Is_Entity_Name (P) then Old_S := Entity (P); else Old_S := Entity (Selector_Name (P)); end if; if not Entity_Matches_Spec (Old_S, New_S) then Error_Msg_N ("entry family does not match specification", N); elsif Is_Body then Check_Subtype_Conformant (New_S, Old_S, N); Generate_Reference (New_S, Defining_Entity (N), 'b'); Style.Check_Identifier (Defining_Entity (N), New_S); end if; else Error_Msg_N ("no entry family matches specification", N); end if; Set_Has_Completion (New_S, Inside_A_Generic); if Is_Body then Check_Frozen_Renaming (N, New_S); end if; end Analyze_Renamed_Family_Member; ----------------------------------------- -- Analyze_Renamed_Primitive_Operation -- ----------------------------------------- procedure Analyze_Renamed_Primitive_Operation (N : Node_Id; New_S : Entity_Id; Is_Body : Boolean) is Old_S : Entity_Id; Nam : Entity_Id; function Conforms (Subp : Entity_Id; Ctyp : Conformance_Type) return Boolean; -- Verify that the signatures of the renamed entity and the new entity -- match. The first formal of the renamed entity is skipped because it -- is the target object in any subsequent call. -------------- -- Conforms -- -------------- function Conforms (Subp : Entity_Id; Ctyp : Conformance_Type) return Boolean is Old_F : Entity_Id; New_F : Entity_Id; begin if Ekind (Subp) /= Ekind (New_S) then return False; end if; Old_F := Next_Formal (First_Formal (Subp)); New_F := First_Formal (New_S); while Present (Old_F) and then Present (New_F) loop if not Conforming_Types (Etype (Old_F), Etype (New_F), Ctyp) then return False; end if; if Ctyp >= Mode_Conformant and then Ekind (Old_F) /= Ekind (New_F) then return False; end if; Next_Formal (New_F); Next_Formal (Old_F); end loop; return True; end Conforms; -- Start of processing for Analyze_Renamed_Primitive_Operation begin if not Is_Overloaded (Selector_Name (Name (N))) then Old_S := Entity (Selector_Name (Name (N))); if not Conforms (Old_S, Type_Conformant) then Old_S := Any_Id; end if; else -- Find the operation that matches the given signature declare It : Interp; Ind : Interp_Index; begin Old_S := Any_Id; Get_First_Interp (Selector_Name (Name (N)), Ind, It); while Present (It.Nam) loop if Conforms (It.Nam, Type_Conformant) then Old_S := It.Nam; end if; Get_Next_Interp (Ind, It); end loop; end; end if; if Old_S = Any_Id then Error_Msg_N ("no subprogram or entry matches specification", N); else if Is_Body then if not Conforms (Old_S, Subtype_Conformant) then Error_Msg_N ("subtype conformance error in renaming", N); end if; Generate_Reference (New_S, Defining_Entity (N), 'b'); Style.Check_Identifier (Defining_Entity (N), New_S); else -- Only mode conformance required for a renaming_as_declaration if not Conforms (Old_S, Mode_Conformant) then Error_Msg_N ("mode conformance error in renaming", N); end if; -- AI12-0204: The prefix of a prefixed view that is renamed or -- passed as a formal subprogram must be renamable as an object. Nam := Prefix (Name (N)); if Is_Object_Reference (Nam) then if Is_Dependent_Component_Of_Mutable_Object (Nam) then Error_Msg_N ("illegal renaming of discriminant-dependent component", Nam); end if; else Error_Msg_N ("expect object name in renaming", Nam); end if; -- Enforce the rule given in (RM 6.3.1 (10.1/2)): a prefixed -- view of a subprogram is intrinsic, because the compiler has -- to generate a wrapper for any call to it. If the name in a -- subprogram renaming is a prefixed view, the entity is thus -- intrinsic, and 'Access cannot be applied to it. Set_Convention (New_S, Convention_Intrinsic); end if; -- Inherit_Renamed_Profile (New_S, Old_S); -- The prefix can be an arbitrary expression that yields an -- object, so it must be resolved. Resolve (Prefix (Name (N))); end if; end Analyze_Renamed_Primitive_Operation; --------------------------------- -- Analyze_Subprogram_Renaming -- --------------------------------- procedure Analyze_Subprogram_Renaming (N : Node_Id) is Formal_Spec : constant Entity_Id := Corresponding_Formal_Spec (N); Is_Actual : constant Boolean := Present (Formal_Spec); Nam : constant Node_Id := Name (N); Save_AV : constant Ada_Version_Type := Ada_Version; Save_AVP : constant Node_Id := Ada_Version_Pragma; Save_AV_Exp : constant Ada_Version_Type := Ada_Version_Explicit; Spec : constant Node_Id := Specification (N); Old_S : Entity_Id := Empty; Rename_Spec : Entity_Id; procedure Build_Class_Wide_Wrapper (Ren_Id : out Entity_Id; Wrap_Id : out Entity_Id); -- Ada 2012 (AI05-0071): A generic/instance scenario involving a formal -- type with unknown discriminants and a generic primitive operation of -- the said type with a box require special processing when the actual -- is a class-wide type: -- -- generic -- type Formal_Typ (<>) is private; -- with procedure Prim_Op (Param : Formal_Typ) is <>; -- package Gen is ... -- -- package Inst is new Gen (Actual_Typ'Class); -- -- In this case the general renaming mechanism used in the prologue of -- an instance no longer applies: -- -- procedure Prim_Op (Param : Formal_Typ) renames Prim_Op; -- -- The above is replaced the following wrapper/renaming combination: -- -- procedure Wrapper (Param : Formal_Typ) is -- wrapper -- begin -- Prim_Op (Param); -- primitive -- end Wrapper; -- -- procedure Prim_Op (Param : Formal_Typ) renames Wrapper; -- -- This transformation applies only if there is no explicit visible -- class-wide operation at the point of the instantiation. Ren_Id is -- the entity of the renaming declaration. When the transformation -- applies, Wrap_Id is the entity of the generated class-wide wrapper -- (or Any_Id). Otherwise, Wrap_Id is the entity of the class-wide -- operation. procedure Check_Null_Exclusion (Ren : Entity_Id; Sub : Entity_Id); -- Ada 2005 (AI-423): Given renaming Ren of subprogram Sub, check the -- following AI rules: -- -- If Ren denotes a generic formal object of a generic unit G, and the -- renaming (or instantiation containing the actual) occurs within the -- body of G or within the body of a generic unit declared within the -- declarative region of G, then the corresponding parameter of G -- shall have a null_exclusion; Otherwise the subtype of the Sub's -- formal parameter shall exclude null. -- -- Similarly for its return profile. procedure Check_SPARK_Primitive_Operation (Subp_Id : Entity_Id); -- Ensure that a SPARK renaming denoted by its entity Subp_Id does not -- declare a primitive operation of a tagged type (SPARK RM 6.1.1(3)). procedure Freeze_Actual_Profile; -- In Ada 2012, enforce the freezing rule concerning formal incomplete -- types: a callable entity freezes its profile, unless it has an -- incomplete untagged formal (RM 13.14(10.2/3)). function Has_Class_Wide_Actual return Boolean; -- Ada 2012 (AI05-071, AI05-0131): True if N is the renaming for a -- defaulted formal subprogram where the actual for the controlling -- formal type is class-wide. function Original_Subprogram (Subp : Entity_Id) return Entity_Id; -- Find renamed entity when the declaration is a renaming_as_body and -- the renamed entity may itself be a renaming_as_body. Used to enforce -- rule that a renaming_as_body is illegal if the declaration occurs -- before the subprogram it completes is frozen, and renaming indirectly -- renames the subprogram itself.(Defect Report 8652/0027). ------------------------------ -- Build_Class_Wide_Wrapper -- ------------------------------ procedure Build_Class_Wide_Wrapper (Ren_Id : out Entity_Id; Wrap_Id : out Entity_Id) is Loc : constant Source_Ptr := Sloc (N); function Build_Call (Subp_Id : Entity_Id; Params : List_Id) return Node_Id; -- Create a dispatching call to invoke routine Subp_Id with actuals -- built from the parameter specifications of list Params. function Build_Expr_Fun_Call (Subp_Id : Entity_Id; Params : List_Id) return Node_Id; -- Create a dispatching call to invoke function Subp_Id with actuals -- built from the parameter specifications of list Params. Return -- directly the call, so that it can be used inside an expression -- function. This is a specificity of the GNATprove mode. function Build_Spec (Subp_Id : Entity_Id) return Node_Id; -- Create a subprogram specification based on the subprogram profile -- of Subp_Id. function Find_Primitive (Typ : Entity_Id) return Entity_Id; -- Find a primitive subprogram of type Typ which matches the profile -- of the renaming declaration. procedure Interpretation_Error (Subp_Id : Entity_Id); -- Emit a continuation error message suggesting subprogram Subp_Id as -- a possible interpretation. function Is_Intrinsic_Equality (Subp_Id : Entity_Id) return Boolean; -- Determine whether subprogram Subp_Id denotes the intrinsic "=" -- operator. function Is_Suitable_Candidate (Subp_Id : Entity_Id) return Boolean; -- Determine whether subprogram Subp_Id is a suitable candidate for -- the role of a wrapped subprogram. ---------------- -- Build_Call -- ---------------- function Build_Call (Subp_Id : Entity_Id; Params : List_Id) return Node_Id is Actuals : constant List_Id := New_List; Call_Ref : constant Node_Id := New_Occurrence_Of (Subp_Id, Loc); Formal : Node_Id; begin -- Build the actual parameters of the call Formal := First (Params); while Present (Formal) loop Append_To (Actuals, Make_Identifier (Loc, Chars (Defining_Identifier (Formal)))); Next (Formal); end loop; -- Generate: -- return Subp_Id (Actuals); if Ekind (Subp_Id) in E_Function | E_Operator then return Make_Simple_Return_Statement (Loc, Expression => Make_Function_Call (Loc, Name => Call_Ref, Parameter_Associations => Actuals)); -- Generate: -- Subp_Id (Actuals); else return Make_Procedure_Call_Statement (Loc, Name => Call_Ref, Parameter_Associations => Actuals); end if; end Build_Call; ------------------------- -- Build_Expr_Fun_Call -- ------------------------- function Build_Expr_Fun_Call (Subp_Id : Entity_Id; Params : List_Id) return Node_Id is Actuals : constant List_Id := New_List; Call_Ref : constant Node_Id := New_Occurrence_Of (Subp_Id, Loc); Formal : Node_Id; begin pragma Assert (Ekind (Subp_Id) in E_Function | E_Operator); -- Build the actual parameters of the call Formal := First (Params); while Present (Formal) loop Append_To (Actuals, Make_Identifier (Loc, Chars (Defining_Identifier (Formal)))); Next (Formal); end loop; -- Generate: -- Subp_Id (Actuals); return Make_Function_Call (Loc, Name => Call_Ref, Parameter_Associations => Actuals); end Build_Expr_Fun_Call; ---------------- -- Build_Spec -- ---------------- function Build_Spec (Subp_Id : Entity_Id) return Node_Id is Params : constant List_Id := Copy_Parameter_List (Subp_Id); Spec_Id : constant Entity_Id := Make_Defining_Identifier (Loc, Chars => New_External_Name (Chars (Subp_Id), 'R')); begin if Ekind (Formal_Spec) = E_Procedure then return Make_Procedure_Specification (Loc, Defining_Unit_Name => Spec_Id, Parameter_Specifications => Params); else return Make_Function_Specification (Loc, Defining_Unit_Name => Spec_Id, Parameter_Specifications => Params, Result_Definition => New_Copy_Tree (Result_Definition (Spec))); end if; end Build_Spec; -------------------- -- Find_Primitive -- -------------------- function Find_Primitive (Typ : Entity_Id) return Entity_Id is procedure Replace_Parameter_Types (Spec : Node_Id); -- Given a specification Spec, replace all class-wide parameter -- types with reference to type Typ. ----------------------------- -- Replace_Parameter_Types -- ----------------------------- procedure Replace_Parameter_Types (Spec : Node_Id) is Formal : Node_Id; Formal_Id : Entity_Id; Formal_Typ : Node_Id; begin Formal := First (Parameter_Specifications (Spec)); while Present (Formal) loop Formal_Id := Defining_Identifier (Formal); Formal_Typ := Parameter_Type (Formal); -- Create a new entity for each class-wide formal to prevent -- aliasing with the original renaming. Replace the type of -- such a parameter with the candidate type. if Nkind (Formal_Typ) = N_Identifier and then Is_Class_Wide_Type (Etype (Formal_Typ)) then Set_Defining_Identifier (Formal, Make_Defining_Identifier (Loc, Chars (Formal_Id))); Set_Parameter_Type (Formal, New_Occurrence_Of (Typ, Loc)); end if; Next (Formal); end loop; end Replace_Parameter_Types; -- Local variables Alt_Ren : constant Node_Id := New_Copy_Tree (N); Alt_Nam : constant Node_Id := Name (Alt_Ren); Alt_Spec : constant Node_Id := Specification (Alt_Ren); Subp_Id : Entity_Id; -- Start of processing for Find_Primitive begin -- Each attempt to find a suitable primitive of a particular type -- operates on its own copy of the original renaming. As a result -- the original renaming is kept decoration and side-effect free. -- Inherit the overloaded status of the renamed subprogram name if Is_Overloaded (Nam) then Set_Is_Overloaded (Alt_Nam); Save_Interps (Nam, Alt_Nam); end if; -- The copied renaming is hidden from visibility to prevent the -- pollution of the enclosing context. Set_Defining_Unit_Name (Alt_Spec, Make_Temporary (Loc, 'R')); -- The types of all class-wide parameters must be changed to the -- candidate type. Replace_Parameter_Types (Alt_Spec); -- Try to find a suitable primitive which matches the altered -- profile of the renaming specification. Subp_Id := Find_Renamed_Entity (N => Alt_Ren, Nam => Name (Alt_Ren), New_S => Analyze_Subprogram_Specification (Alt_Spec), Is_Actual => Is_Actual); -- Do not return Any_Id if the resolion of the altered profile -- failed as this complicates further checks on the caller side, -- return Empty instead. if Subp_Id = Any_Id then return Empty; else return Subp_Id; end if; end Find_Primitive; -------------------------- -- Interpretation_Error -- -------------------------- procedure Interpretation_Error (Subp_Id : Entity_Id) is begin Error_Msg_Sloc := Sloc (Subp_Id); if Is_Internal (Subp_Id) then Error_Msg_NE ("\\possible interpretation: predefined & #", Spec, Formal_Spec); else Error_Msg_NE ("\\possible interpretation: & defined #", Spec, Formal_Spec); end if; end Interpretation_Error; --------------------------- -- Is_Intrinsic_Equality -- --------------------------- function Is_Intrinsic_Equality (Subp_Id : Entity_Id) return Boolean is begin return Ekind (Subp_Id) = E_Operator and then Chars (Subp_Id) = Name_Op_Eq and then Is_Intrinsic_Subprogram (Subp_Id); end Is_Intrinsic_Equality; --------------------------- -- Is_Suitable_Candidate -- --------------------------- function Is_Suitable_Candidate (Subp_Id : Entity_Id) return Boolean is begin if No (Subp_Id) then return False; -- An intrinsic subprogram is never a good candidate. This is an -- indication of a missing primitive, either defined directly or -- inherited from a parent tagged type. elsif Is_Intrinsic_Subprogram (Subp_Id) then return False; else return True; end if; end Is_Suitable_Candidate; -- Local variables Actual_Typ : Entity_Id := Empty; -- The actual class-wide type for Formal_Typ CW_Prim_OK : Boolean; CW_Prim_Op : Entity_Id; -- The class-wide subprogram (if available) which corresponds to the -- renamed generic formal subprogram. Formal_Typ : Entity_Id := Empty; -- The generic formal type with unknown discriminants Root_Prim_OK : Boolean; Root_Prim_Op : Entity_Id; -- The root type primitive (if available) which corresponds to the -- renamed generic formal subprogram. Root_Typ : Entity_Id := Empty; -- The root type of Actual_Typ Body_Decl : Node_Id; Formal : Node_Id; Prim_Op : Entity_Id; Spec_Decl : Node_Id; New_Spec : Node_Id; -- Start of processing for Build_Class_Wide_Wrapper begin -- Analyze the specification of the renaming in case the generation -- of the class-wide wrapper fails. Ren_Id := Analyze_Subprogram_Specification (Spec); Wrap_Id := Any_Id; -- Do not attempt to build a wrapper if the renaming is in error if Error_Posted (Nam) then return; end if; -- Analyze the renamed name, but do not resolve it. The resolution is -- completed once a suitable subprogram is found. Analyze (Nam); -- When the renamed name denotes the intrinsic operator equals, the -- name must be treated as overloaded. This allows for a potential -- match against the root type's predefined equality function. if Is_Intrinsic_Equality (Entity (Nam)) then Set_Is_Overloaded (Nam); Collect_Interps (Nam); end if; -- Step 1: Find the generic formal type with unknown discriminants -- and its corresponding class-wide actual type from the renamed -- generic formal subprogram. Formal := First_Formal (Formal_Spec); while Present (Formal) loop if Has_Unknown_Discriminants (Etype (Formal)) and then not Is_Class_Wide_Type (Etype (Formal)) and then Is_Class_Wide_Type (Get_Instance_Of (Etype (Formal))) then Formal_Typ := Etype (Formal); Actual_Typ := Get_Instance_Of (Formal_Typ); Root_Typ := Etype (Actual_Typ); exit; end if; Next_Formal (Formal); end loop; -- The specification of the generic formal subprogram should always -- contain a formal type with unknown discriminants whose actual is -- a class-wide type, otherwise this indicates a failure in routine -- Has_Class_Wide_Actual. pragma Assert (Present (Formal_Typ)); -- Step 2: Find the proper class-wide subprogram or primitive which -- corresponds to the renamed generic formal subprogram. CW_Prim_Op := Find_Primitive (Actual_Typ); CW_Prim_OK := Is_Suitable_Candidate (CW_Prim_Op); Root_Prim_Op := Find_Primitive (Root_Typ); Root_Prim_OK := Is_Suitable_Candidate (Root_Prim_Op); -- The class-wide actual type has two subprograms which correspond to -- the renamed generic formal subprogram: -- with procedure Prim_Op (Param : Formal_Typ); -- procedure Prim_Op (Param : Actual_Typ); -- may be inherited -- procedure Prim_Op (Param : Actual_Typ'Class); -- Even though the declaration of the two subprograms is legal, a -- call to either one is ambiguous and therefore illegal. if CW_Prim_OK and Root_Prim_OK then -- A user-defined primitive has precedence over a predefined one if Is_Internal (CW_Prim_Op) and then not Is_Internal (Root_Prim_Op) then Prim_Op := Root_Prim_Op; elsif Is_Internal (Root_Prim_Op) and then not Is_Internal (CW_Prim_Op) then Prim_Op := CW_Prim_Op; elsif CW_Prim_Op = Root_Prim_Op then Prim_Op := Root_Prim_Op; -- Otherwise both candidate subprograms are user-defined and -- ambiguous. else Error_Msg_NE ("ambiguous actual for generic subprogram &", Spec, Formal_Spec); Interpretation_Error (Root_Prim_Op); Interpretation_Error (CW_Prim_Op); return; end if; elsif CW_Prim_OK and not Root_Prim_OK then Prim_Op := CW_Prim_Op; elsif not CW_Prim_OK and Root_Prim_OK then Prim_Op := Root_Prim_Op; -- An intrinsic equality may act as a suitable candidate in the case -- of a null type extension where the parent's equality is hidden. A -- call to an intrinsic equality is expanded as dispatching. elsif Present (Root_Prim_Op) and then Is_Intrinsic_Equality (Root_Prim_Op) then Prim_Op := Root_Prim_Op; -- Otherwise there are no candidate subprograms. Let the caller -- diagnose the error. else return; end if; -- At this point resolution has taken place and the name is no longer -- overloaded. Mark the primitive as referenced. Set_Is_Overloaded (Name (N), False); Set_Referenced (Prim_Op); -- Do not generate a wrapper when the only candidate is a class-wide -- subprogram. Instead modify the renaming to directly map the actual -- to the generic formal. if CW_Prim_OK and then Prim_Op = CW_Prim_Op then Wrap_Id := Prim_Op; Rewrite (Nam, New_Occurrence_Of (Prim_Op, Loc)); return; end if; -- Step 3: Create the declaration and the body of the wrapper, insert -- all the pieces into the tree. -- In GNATprove mode, create a function wrapper in the form of an -- expression function, so that an implicit postcondition relating -- the result of calling the wrapper function and the result of the -- dispatching call to the wrapped function is known during proof. if GNATprove_Mode and then Ekind (Ren_Id) in E_Function | E_Operator then New_Spec := Build_Spec (Ren_Id); Body_Decl := Make_Expression_Function (Loc, Specification => New_Spec, Expression => Build_Expr_Fun_Call (Subp_Id => Prim_Op, Params => Parameter_Specifications (New_Spec))); Wrap_Id := Defining_Entity (Body_Decl); -- Otherwise, create separate spec and body for the subprogram else Spec_Decl := Make_Subprogram_Declaration (Loc, Specification => Build_Spec (Ren_Id)); Insert_Before_And_Analyze (N, Spec_Decl); Wrap_Id := Defining_Entity (Spec_Decl); Body_Decl := Make_Subprogram_Body (Loc, Specification => Build_Spec (Ren_Id), Declarations => New_List, Handled_Statement_Sequence => Make_Handled_Sequence_Of_Statements (Loc, Statements => New_List ( Build_Call (Subp_Id => Prim_Op, Params => Parameter_Specifications (Specification (Spec_Decl)))))); Set_Corresponding_Body (Spec_Decl, Defining_Entity (Body_Decl)); end if; -- If the operator carries an Eliminated pragma, indicate that the -- wrapper is also to be eliminated, to prevent spurious error when -- using gnatelim on programs that include box-initialization of -- equality operators. Set_Is_Eliminated (Wrap_Id, Is_Eliminated (Prim_Op)); -- In GNATprove mode, insert the body in the tree for analysis if GNATprove_Mode then Insert_Before_And_Analyze (N, Body_Decl); end if; -- The generated body does not freeze and must be analyzed when the -- class-wide wrapper is frozen. The body is only needed if expansion -- is enabled. if Expander_Active then Append_Freeze_Action (Wrap_Id, Body_Decl); end if; -- Step 4: The subprogram renaming aliases the wrapper Rewrite (Nam, New_Occurrence_Of (Wrap_Id, Loc)); end Build_Class_Wide_Wrapper; -------------------------- -- Check_Null_Exclusion -- -------------------------- procedure Check_Null_Exclusion (Ren : Entity_Id; Sub : Entity_Id) is Ren_Formal : Entity_Id; Sub_Formal : Entity_Id; function Null_Exclusion_Mismatch (Renaming : Entity_Id; Renamed : Entity_Id) return Boolean; -- Return True if there is a null exclusion mismatch between -- Renaming and Renamed, False otherwise. ----------------------------- -- Null_Exclusion_Mismatch -- ----------------------------- function Null_Exclusion_Mismatch (Renaming : Entity_Id; Renamed : Entity_Id) return Boolean is begin return Has_Null_Exclusion (Parent (Renaming)) and then not (Has_Null_Exclusion (Parent (Renamed)) or else (Can_Never_Be_Null (Etype (Renamed)) and then not (Is_Formal_Subprogram (Sub) and then In_Generic_Body (Current_Scope)))); end Null_Exclusion_Mismatch; begin -- Parameter check Ren_Formal := First_Formal (Ren); Sub_Formal := First_Formal (Sub); while Present (Ren_Formal) and then Present (Sub_Formal) loop if Null_Exclusion_Mismatch (Ren_Formal, Sub_Formal) then Error_Msg_Sloc := Sloc (Sub_Formal); Error_Msg_NE ("`NOT NULL` required for parameter &#", Ren_Formal, Sub_Formal); end if; Next_Formal (Ren_Formal); Next_Formal (Sub_Formal); end loop; -- Return profile check if Nkind (Parent (Ren)) = N_Function_Specification and then Nkind (Parent (Sub)) = N_Function_Specification and then Null_Exclusion_Mismatch (Ren, Sub) then Error_Msg_Sloc := Sloc (Sub); Error_Msg_N ("return must specify `NOT NULL`#", Ren); end if; end Check_Null_Exclusion; ------------------------------------- -- Check_SPARK_Primitive_Operation -- ------------------------------------- procedure Check_SPARK_Primitive_Operation (Subp_Id : Entity_Id) is Prag : constant Node_Id := SPARK_Pragma (Subp_Id); Typ : Entity_Id; begin -- Nothing to do when the subprogram is not subject to SPARK_Mode On -- because this check applies to SPARK code only. if not (Present (Prag) and then Get_SPARK_Mode_From_Annotation (Prag) = On) then return; -- Nothing to do when the subprogram is not a primitive operation elsif not Is_Primitive (Subp_Id) then return; end if; Typ := Find_Dispatching_Type (Subp_Id); -- Nothing to do when the subprogram is a primitive operation of an -- untagged type. if No (Typ) then return; end if; -- At this point a renaming declaration introduces a new primitive -- operation for a tagged type. Error_Msg_Node_2 := Typ; Error_Msg_NE ("subprogram renaming & cannot declare primitive for type & " & "(SPARK RM 6.1.1(3))", N, Subp_Id); end Check_SPARK_Primitive_Operation; --------------------------- -- Freeze_Actual_Profile -- --------------------------- procedure Freeze_Actual_Profile is F : Entity_Id; Has_Untagged_Inc : Boolean; Instantiation_Node : constant Node_Id := Parent (N); begin if Ada_Version >= Ada_2012 then F := First_Formal (Formal_Spec); Has_Untagged_Inc := False; while Present (F) loop if Ekind (Etype (F)) = E_Incomplete_Type and then not Is_Tagged_Type (Etype (F)) then Has_Untagged_Inc := True; exit; end if; Next_Formal (F); end loop; if Ekind (Formal_Spec) = E_Function and then not Is_Tagged_Type (Etype (Formal_Spec)) then Has_Untagged_Inc := True; end if; if not Has_Untagged_Inc then F := First_Formal (Old_S); while Present (F) loop Freeze_Before (Instantiation_Node, Etype (F)); if Is_Incomplete_Or_Private_Type (Etype (F)) and then No (Underlying_Type (Etype (F))) then -- Exclude generic types, or types derived from them. -- They will be frozen in the enclosing instance. if Is_Generic_Type (Etype (F)) or else Is_Generic_Type (Root_Type (Etype (F))) then null; -- A limited view of a type declared elsewhere needs no -- freezing actions. elsif From_Limited_With (Etype (F)) then null; else Error_Msg_NE ("type& must be frozen before this point", Instantiation_Node, Etype (F)); end if; end if; Next_Formal (F); end loop; end if; end if; end Freeze_Actual_Profile; --------------------------- -- Has_Class_Wide_Actual -- --------------------------- function Has_Class_Wide_Actual return Boolean is Formal : Entity_Id; Formal_Typ : Entity_Id; begin if Is_Actual then Formal := First_Formal (Formal_Spec); while Present (Formal) loop Formal_Typ := Etype (Formal); if Has_Unknown_Discriminants (Formal_Typ) and then not Is_Class_Wide_Type (Formal_Typ) and then Is_Class_Wide_Type (Get_Instance_Of (Formal_Typ)) then return True; end if; Next_Formal (Formal); end loop; end if; return False; end Has_Class_Wide_Actual; ------------------------- -- Original_Subprogram -- ------------------------- function Original_Subprogram (Subp : Entity_Id) return Entity_Id is Orig_Decl : Node_Id; Orig_Subp : Entity_Id; begin -- First case: renamed entity is itself a renaming if Present (Alias (Subp)) then return Alias (Subp); elsif Nkind (Unit_Declaration_Node (Subp)) = N_Subprogram_Declaration and then Present (Corresponding_Body (Unit_Declaration_Node (Subp))) then -- Check if renamed entity is a renaming_as_body Orig_Decl := Unit_Declaration_Node (Corresponding_Body (Unit_Declaration_Node (Subp))); if Nkind (Orig_Decl) = N_Subprogram_Renaming_Declaration then Orig_Subp := Entity (Name (Orig_Decl)); if Orig_Subp = Rename_Spec then -- Circularity detected return Orig_Subp; else return (Original_Subprogram (Orig_Subp)); end if; else return Subp; end if; else return Subp; end if; end Original_Subprogram; -- Local variables CW_Actual : constant Boolean := Has_Class_Wide_Actual; -- Ada 2012 (AI05-071, AI05-0131): True if the renaming is for a -- defaulted formal subprogram when the actual for a related formal -- type is class-wide. Inst_Node : Node_Id := Empty; New_S : Entity_Id; -- Start of processing for Analyze_Subprogram_Renaming begin -- We must test for the attribute renaming case before the Analyze -- call because otherwise Sem_Attr will complain that the attribute -- is missing an argument when it is analyzed. if Nkind (Nam) = N_Attribute_Reference then -- In the case of an abstract formal subprogram association, rewrite -- an actual given by a stream or Put_Image attribute as the name of -- the corresponding stream or Put_Image primitive of the type. -- In a generic context the stream and Put_Image operations are not -- generated, and this must be treated as a normal attribute -- reference, to be expanded in subsequent instantiations. if Is_Actual and then Is_Abstract_Subprogram (Formal_Spec) and then Expander_Active then declare Prefix_Type : constant Entity_Id := Entity (Prefix (Nam)); Prim : Entity_Id; begin -- The class-wide forms of the stream and Put_Image attributes -- are not primitive dispatching operations (even though they -- internally dispatch). if Is_Class_Wide_Type (Prefix_Type) then Error_Msg_N ("attribute must be a primitive dispatching operation", Nam); return; end if; -- Retrieve the primitive subprogram associated with the -- attribute. This can only be a stream attribute, since those -- are the only ones that are dispatching (and the actual for -- an abstract formal subprogram must be dispatching -- operation). case Attribute_Name (Nam) is when Name_Input => Prim := Find_Optional_Prim_Op (Prefix_Type, TSS_Stream_Input); when Name_Output => Prim := Find_Optional_Prim_Op (Prefix_Type, TSS_Stream_Output); when Name_Read => Prim := Find_Optional_Prim_Op (Prefix_Type, TSS_Stream_Read); when Name_Write => Prim := Find_Optional_Prim_Op (Prefix_Type, TSS_Stream_Write); when Name_Put_Image => Prim := Find_Optional_Prim_Op (Prefix_Type, TSS_Put_Image); when others => Error_Msg_N ("attribute must be a primitive dispatching operation", Nam); return; end case; -- If no stream operation was found, and the type is limited, -- the user should have defined one. This rule does not apply -- to Put_Image. if No (Prim) and then Attribute_Name (Nam) /= Name_Put_Image then if Is_Limited_Type (Prefix_Type) then Error_Msg_NE ("stream operation not defined for type&", N, Prefix_Type); return; -- Otherwise, compiler should have generated default else raise Program_Error; end if; end if; -- Rewrite the attribute into the name of its corresponding -- primitive dispatching subprogram. We can then proceed with -- the usual processing for subprogram renamings. declare Prim_Name : constant Node_Id := Make_Identifier (Sloc (Nam), Chars => Chars (Prim)); begin Set_Entity (Prim_Name, Prim); Rewrite (Nam, Prim_Name); Analyze (Nam); end; end; -- Normal processing for a renaming of an attribute else Attribute_Renaming (N); return; end if; end if; -- Check whether this declaration corresponds to the instantiation of a -- formal subprogram. -- If this is an instantiation, the corresponding actual is frozen and -- error messages can be made more precise. If this is a default -- subprogram, the entity is already established in the generic, and is -- not retrieved by visibility. If it is a default with a box, the -- candidate interpretations, if any, have been collected when building -- the renaming declaration. If overloaded, the proper interpretation is -- determined in Find_Renamed_Entity. If the entity is an operator, -- Find_Renamed_Entity applies additional visibility checks. if Is_Actual then Inst_Node := Unit_Declaration_Node (Formal_Spec); -- Check whether the renaming is for a defaulted actual subprogram -- with a class-wide actual. -- The class-wide wrapper is not needed in GNATprove_Mode and there -- is an external axiomatization on the package. if CW_Actual and then Box_Present (Inst_Node) and then not (GNATprove_Mode and then Present (Containing_Package_With_Ext_Axioms (Formal_Spec))) then Build_Class_Wide_Wrapper (New_S, Old_S); elsif Is_Entity_Name (Nam) and then Present (Entity (Nam)) and then not Comes_From_Source (Nam) and then not Is_Overloaded (Nam) then Old_S := Entity (Nam); -- The subprogram renaming declaration may become Ghost if it -- renames a Ghost entity. Mark_Ghost_Renaming (N, Old_S); New_S := Analyze_Subprogram_Specification (Spec); -- Operator case if Ekind (Old_S) = E_Operator then -- Box present if Box_Present (Inst_Node) then Old_S := Find_Renamed_Entity (N, Name (N), New_S, Is_Actual); -- If there is an immediately visible homonym of the operator -- and the declaration has a default, this is worth a warning -- because the user probably did not intend to get the pre- -- defined operator, visible in the generic declaration. To -- find if there is an intended candidate, analyze the renaming -- again in the current context. elsif Scope (Old_S) = Standard_Standard and then Present (Default_Name (Inst_Node)) then declare Decl : constant Node_Id := New_Copy_Tree (N); Hidden : Entity_Id; begin Set_Entity (Name (Decl), Empty); Analyze (Name (Decl)); Hidden := Find_Renamed_Entity (Decl, Name (Decl), New_S, True); if Present (Hidden) and then In_Open_Scopes (Scope (Hidden)) and then Is_Immediately_Visible (Hidden) and then Comes_From_Source (Hidden) and then Hidden /= Old_S then Error_Msg_Sloc := Sloc (Hidden); Error_Msg_N ("default subprogram is resolved in the generic " & "declaration (RM 12.6(17))??", N); Error_Msg_NE ("\and will not use & #??", N, Hidden); end if; end; end if; end if; else Analyze (Nam); -- The subprogram renaming declaration may become Ghost if it -- renames a Ghost entity. if Is_Entity_Name (Nam) then Mark_Ghost_Renaming (N, Entity (Nam)); end if; New_S := Analyze_Subprogram_Specification (Spec); end if; else -- Renamed entity must be analyzed first, to avoid being hidden by -- new name (which might be the same in a generic instance). Analyze (Nam); -- The subprogram renaming declaration may become Ghost if it renames -- a Ghost entity. if Is_Entity_Name (Nam) then Mark_Ghost_Renaming (N, Entity (Nam)); end if; -- The renaming defines a new overloaded entity, which is analyzed -- like a subprogram declaration. New_S := Analyze_Subprogram_Specification (Spec); end if; if Current_Scope /= Standard_Standard then Set_Is_Pure (New_S, Is_Pure (Current_Scope)); end if; -- Set SPARK mode from current context Set_SPARK_Pragma (New_S, SPARK_Mode_Pragma); Set_SPARK_Pragma_Inherited (New_S); Rename_Spec := Find_Corresponding_Spec (N); -- Case of Renaming_As_Body if Present (Rename_Spec) then Check_Previous_Null_Procedure (N, Rename_Spec); -- Renaming declaration is the completion of the declaration of -- Rename_Spec. We build an actual body for it at the freezing point. Set_Corresponding_Spec (N, Rename_Spec); -- Deal with special case of stream functions of abstract types -- and interfaces. if Nkind (Unit_Declaration_Node (Rename_Spec)) = N_Abstract_Subprogram_Declaration then -- Input stream functions are abstract if the object type is -- abstract. Similarly, all default stream functions for an -- interface type are abstract. However, these subprograms may -- receive explicit declarations in representation clauses, making -- the attribute subprograms usable as defaults in subsequent -- type extensions. -- In this case we rewrite the declaration to make the subprogram -- non-abstract. We remove the previous declaration, and insert -- the new one at the point of the renaming, to prevent premature -- access to unfrozen types. The new declaration reuses the -- specification of the previous one, and must not be analyzed. pragma Assert (Is_Primitive (Entity (Nam)) and then Is_Abstract_Type (Find_Dispatching_Type (Entity (Nam)))); declare Old_Decl : constant Node_Id := Unit_Declaration_Node (Rename_Spec); New_Decl : constant Node_Id := Make_Subprogram_Declaration (Sloc (N), Specification => Relocate_Node (Specification (Old_Decl))); begin Remove (Old_Decl); Insert_After (N, New_Decl); Set_Is_Abstract_Subprogram (Rename_Spec, False); Set_Analyzed (New_Decl); end; end if; Set_Corresponding_Body (Unit_Declaration_Node (Rename_Spec), New_S); if Ada_Version = Ada_83 and then Comes_From_Source (N) then Error_Msg_N ("(Ada 83) renaming cannot serve as a body", N); end if; Set_Convention (New_S, Convention (Rename_Spec)); Check_Fully_Conformant (New_S, Rename_Spec); Set_Public_Status (New_S); if No_Return (Rename_Spec) and then not No_Return (Entity (Nam)) then Error_Msg_NE ("renamed subprogram & must be No_Return", N, Entity (Nam)); Error_Msg_N ("\since renaming subprogram is No_Return (RM 6.5.1(7/2))", N); end if; -- The specification does not introduce new formals, but only -- repeats the formals of the original subprogram declaration. -- For cross-reference purposes, and for refactoring tools, we -- treat the formals of the renaming declaration as body formals. Reference_Body_Formals (Rename_Spec, New_S); -- Indicate that the entity in the declaration functions like the -- corresponding body, and is not a new entity. The body will be -- constructed later at the freeze point, so indicate that the -- completion has not been seen yet. Set_Ekind (New_S, E_Subprogram_Body); New_S := Rename_Spec; Set_Has_Completion (Rename_Spec, False); -- Ada 2005: check overriding indicator if Present (Overridden_Operation (Rename_Spec)) then if Must_Not_Override (Specification (N)) then Error_Msg_NE ("subprogram& overrides inherited operation", N, Rename_Spec); elsif Style_Check and then not Must_Override (Specification (N)) then Style.Missing_Overriding (N, Rename_Spec); end if; elsif Must_Override (Specification (N)) then Error_Msg_NE ("subprogram& is not overriding", N, Rename_Spec); end if; -- AI12-0132: a renames-as-body freezes the expression of any -- expression function that it renames. if Is_Entity_Name (Nam) and then Is_Expression_Function (Entity (Nam)) and then not Inside_A_Generic then Freeze_Expr_Types (Def_Id => Entity (Nam), Typ => Etype (Entity (Nam)), Expr => Expression (Original_Node (Unit_Declaration_Node (Entity (Nam)))), N => N); end if; -- Normal subprogram renaming (not renaming as body) else Generate_Definition (New_S); New_Overloaded_Entity (New_S); if not (Is_Entity_Name (Nam) and then Is_Intrinsic_Subprogram (Entity (Nam))) then Check_Delayed_Subprogram (New_S); end if; -- Verify that a SPARK renaming does not declare a primitive -- operation of a tagged type. Check_SPARK_Primitive_Operation (New_S); end if; -- There is no need for elaboration checks on the new entity, which may -- be called before the next freezing point where the body will appear. -- Elaboration checks refer to the real entity, not the one created by -- the renaming declaration. Set_Kill_Elaboration_Checks (New_S, True); -- If we had a previous error, indicate a completion is present to stop -- junk cascaded messages, but don't take any further action. if Etype (Nam) = Any_Type then Set_Has_Completion (New_S); return; -- Case where name has the form of a selected component elsif Nkind (Nam) = N_Selected_Component then -- A name which has the form A.B can designate an entry of task A, a -- protected operation of protected object A, or finally a primitive -- operation of object A. In the later case, A is an object of some -- tagged type, or an access type that denotes one such. To further -- distinguish these cases, note that the scope of a task entry or -- protected operation is type of the prefix. -- The prefix could be an overloaded function call that returns both -- kinds of operations. This overloading pathology is left to the -- dedicated reader ??? declare T : constant Entity_Id := Etype (Prefix (Nam)); begin if Present (T) and then (Is_Tagged_Type (T) or else (Is_Access_Type (T) and then Is_Tagged_Type (Designated_Type (T)))) and then Scope (Entity (Selector_Name (Nam))) /= T then Analyze_Renamed_Primitive_Operation (N, New_S, Present (Rename_Spec)); return; else -- Renamed entity is an entry or protected operation. For those -- cases an explicit body is built (at the point of freezing of -- this entity) that contains a call to the renamed entity. -- This is not allowed for renaming as body if the renamed -- spec is already frozen (see RM 8.5.4(5) for details). if Present (Rename_Spec) and then Is_Frozen (Rename_Spec) then Error_Msg_N ("renaming-as-body cannot rename entry as subprogram", N); Error_Msg_NE ("\since & is already frozen (RM 8.5.4(5))", N, Rename_Spec); else Analyze_Renamed_Entry (N, New_S, Present (Rename_Spec)); end if; return; end if; end; -- Case where name is an explicit dereference X.all elsif Nkind (Nam) = N_Explicit_Dereference then -- Renamed entity is designated by access_to_subprogram expression. -- Must build body to encapsulate call, as in the entry case. Analyze_Renamed_Dereference (N, New_S, Present (Rename_Spec)); return; -- Indexed component elsif Nkind (Nam) = N_Indexed_Component then Analyze_Renamed_Family_Member (N, New_S, Present (Rename_Spec)); return; -- Character literal elsif Nkind (Nam) = N_Character_Literal then Analyze_Renamed_Character (N, New_S, Present (Rename_Spec)); return; -- Only remaining case is where we have a non-entity name, or a renaming -- of some other non-overloadable entity. elsif not Is_Entity_Name (Nam) or else not Is_Overloadable (Entity (Nam)) then -- Do not mention the renaming if it comes from an instance if not Is_Actual then Error_Msg_N ("expect valid subprogram name in renaming", N); else Error_Msg_NE ("no visible subprogram for formal&", N, Nam); end if; return; end if; -- Find the renamed entity that matches the given specification. Disable -- Ada_83 because there is no requirement of full conformance between -- renamed entity and new entity, even though the same circuit is used. -- This is a bit of an odd case, which introduces a really irregular use -- of Ada_Version[_Explicit]. Would be nice to find cleaner way to do -- this. ??? Ada_Version := Ada_Version_Type'Max (Ada_Version, Ada_95); Ada_Version_Pragma := Empty; Ada_Version_Explicit := Ada_Version; if No (Old_S) then Old_S := Find_Renamed_Entity (N, Name (N), New_S, Is_Actual); -- The visible operation may be an inherited abstract operation that -- was overridden in the private part, in which case a call will -- dispatch to the overriding operation. Use the overriding one in -- the renaming declaration, to prevent spurious errors below. if Is_Overloadable (Old_S) and then Is_Abstract_Subprogram (Old_S) and then No (DTC_Entity (Old_S)) and then Present (Alias (Old_S)) and then not Is_Abstract_Subprogram (Alias (Old_S)) and then Present (Overridden_Operation (Alias (Old_S))) then Old_S := Alias (Old_S); end if; -- When the renamed subprogram is overloaded and used as an actual -- of a generic, its entity is set to the first available homonym. -- We must first disambiguate the name, then set the proper entity. if Is_Actual and then Is_Overloaded (Nam) then Set_Entity (Nam, Old_S); end if; end if; -- Most common case: subprogram renames subprogram. No body is generated -- in this case, so we must indicate the declaration is complete as is. -- and inherit various attributes of the renamed subprogram. if No (Rename_Spec) then Set_Has_Completion (New_S); Set_Is_Imported (New_S, Is_Imported (Entity (Nam))); Set_Is_Pure (New_S, Is_Pure (Entity (Nam))); Set_Is_Preelaborated (New_S, Is_Preelaborated (Entity (Nam))); -- Ada 2005 (AI-423): Check the consistency of null exclusions -- between a subprogram and its correct renaming. -- Note: the Any_Id check is a guard that prevents compiler crashes -- when performing a null exclusion check between a renaming and a -- renamed subprogram that has been found to be illegal. if Ada_Version >= Ada_2005 and then Entity (Nam) /= Any_Id then Check_Null_Exclusion (Ren => New_S, Sub => Entity (Nam)); end if; -- Enforce the Ada 2005 rule that the renamed entity cannot require -- overriding. The flag Requires_Overriding is set very selectively -- and misses some other illegal cases. The additional conditions -- checked below are sufficient but not necessary ??? -- The rule does not apply to the renaming generated for an actual -- subprogram in an instance. if Is_Actual then null; -- Guard against previous errors, and omit renamings of predefined -- operators. elsif Ekind (Old_S) not in E_Function | E_Procedure then null; elsif Requires_Overriding (Old_S) or else (Is_Abstract_Subprogram (Old_S) and then Present (Find_Dispatching_Type (Old_S)) and then not Is_Abstract_Type (Find_Dispatching_Type (Old_S))) then Error_Msg_N ("renamed entity cannot be subprogram that requires overriding " & "(RM 8.5.4 (5.1))", N); end if; declare Prev : constant Entity_Id := Overridden_Operation (New_S); begin if Present (Prev) and then (Has_Non_Trivial_Precondition (Prev) or else Has_Non_Trivial_Precondition (Old_S)) then Error_Msg_NE ("conflicting inherited classwide preconditions in renaming " & "of& (RM 6.1.1 (17)", N, Old_S); end if; end; end if; if Old_S /= Any_Id then if Is_Actual and then From_Default (N) then -- This is an implicit reference to the default actual Generate_Reference (Old_S, Nam, Typ => 'i', Force => True); else Generate_Reference (Old_S, Nam); end if; Check_Internal_Protected_Use (N, Old_S); -- For a renaming-as-body, require subtype conformance, but if the -- declaration being completed has not been frozen, then inherit the -- convention of the renamed subprogram prior to checking conformance -- (unless the renaming has an explicit convention established; the -- rule stated in the RM doesn't seem to address this ???). if Present (Rename_Spec) then Generate_Reference (Rename_Spec, Defining_Entity (Spec), 'b'); Style.Check_Identifier (Defining_Entity (Spec), Rename_Spec); if not Is_Frozen (Rename_Spec) then if not Has_Convention_Pragma (Rename_Spec) then Set_Convention (New_S, Convention (Old_S)); end if; if Ekind (Old_S) /= E_Operator then Check_Mode_Conformant (New_S, Old_S, Spec); end if; if Original_Subprogram (Old_S) = Rename_Spec then Error_Msg_N ("unfrozen subprogram cannot rename itself ", N); else Check_Formal_Subprogram_Conformance (New_S, Old_S, Spec); end if; else Check_Subtype_Conformant (New_S, Old_S, Spec); end if; Check_Frozen_Renaming (N, Rename_Spec); -- Check explicitly that renamed entity is not intrinsic, because -- in a generic the renamed body is not built. In this case, -- the renaming_as_body is a completion. if Inside_A_Generic then if Is_Frozen (Rename_Spec) and then Is_Intrinsic_Subprogram (Old_S) then Error_Msg_N ("subprogram in renaming_as_body cannot be intrinsic", Name (N)); end if; Set_Has_Completion (Rename_Spec); end if; elsif Ekind (Old_S) /= E_Operator then -- If this a defaulted subprogram for a class-wide actual there is -- no check for mode conformance, given that the signatures don't -- match (the source mentions T but the actual mentions T'Class). if CW_Actual then null; -- No need for a redundant error message if this is a nested -- instance, unless the current instantiation (of a child unit) -- is a compilation unit, which is not analyzed when the parent -- generic is analyzed. elsif not Is_Actual or else No (Enclosing_Instance) or else Is_Compilation_Unit (Current_Scope) then Check_Mode_Conformant (New_S, Old_S); end if; end if; if No (Rename_Spec) then -- The parameter profile of the new entity is that of the renamed -- entity: the subtypes given in the specification are irrelevant. Inherit_Renamed_Profile (New_S, Old_S); -- A call to the subprogram is transformed into a call to the -- renamed entity. This is transitive if the renamed entity is -- itself a renaming. if Present (Alias (Old_S)) then Set_Alias (New_S, Alias (Old_S)); else Set_Alias (New_S, Old_S); end if; -- Note that we do not set Is_Intrinsic_Subprogram if we have a -- renaming as body, since the entity in this case is not an -- intrinsic (it calls an intrinsic, but we have a real body for -- this call, and it is in this body that the required intrinsic -- processing will take place). -- Also, if this is a renaming of inequality, the renamed operator -- is intrinsic, but what matters is the corresponding equality -- operator, which may be user-defined. Set_Is_Intrinsic_Subprogram (New_S, Is_Intrinsic_Subprogram (Old_S) and then (Chars (Old_S) /= Name_Op_Ne or else Ekind (Old_S) = E_Operator or else Is_Intrinsic_Subprogram (Corresponding_Equality (Old_S)))); if Ekind (Alias (New_S)) = E_Operator then Set_Has_Delayed_Freeze (New_S, False); end if; -- If the renaming corresponds to an association for an abstract -- formal subprogram, then various attributes must be set to -- indicate that the renaming is an abstract dispatching operation -- with a controlling type. if Is_Actual and then Is_Abstract_Subprogram (Formal_Spec) then -- Mark the renaming as abstract here, so Find_Dispatching_Type -- see it as corresponding to a generic association for a -- formal abstract subprogram Set_Is_Abstract_Subprogram (New_S); declare New_S_Ctrl_Type : constant Entity_Id := Find_Dispatching_Type (New_S); Old_S_Ctrl_Type : constant Entity_Id := Find_Dispatching_Type (Old_S); begin -- The actual must match the (instance of the) formal, -- and must be a controlling type. if Old_S_Ctrl_Type /= New_S_Ctrl_Type or else No (New_S_Ctrl_Type) then if No (New_S_Ctrl_Type) then Error_Msg_N ("actual must be dispatching subprogram", Nam); else Error_Msg_NE ("actual must be dispatching subprogram for type&", Nam, New_S_Ctrl_Type); end if; else Set_Is_Dispatching_Operation (New_S); Check_Controlling_Formals (New_S_Ctrl_Type, New_S); -- If the actual in the formal subprogram is itself a -- formal abstract subprogram association, there's no -- dispatch table component or position to inherit. if Present (DTC_Entity (Old_S)) then Set_DTC_Entity (New_S, DTC_Entity (Old_S)); Set_DT_Position_Value (New_S, DT_Position (Old_S)); end if; end if; end; end if; end if; if Is_Actual then null; -- The following is illegal, because F hides whatever other F may -- be around: -- function F (...) renames F; elsif Old_S = New_S or else (Nkind (Nam) /= N_Expanded_Name and then Chars (Old_S) = Chars (New_S)) then Error_Msg_N ("subprogram cannot rename itself", N); -- This is illegal even if we use a selector: -- function F (...) renames Pkg.F; -- because F is still hidden. elsif Nkind (Nam) = N_Expanded_Name and then Entity (Prefix (Nam)) = Current_Scope and then Chars (Selector_Name (Nam)) = Chars (New_S) then -- This is an error, but we overlook the error and accept the -- renaming if the special Overriding_Renamings mode is in effect. if not Overriding_Renamings then Error_Msg_NE ("implicit operation& is not visible (RM 8.3 (15))", Nam, Old_S); end if; end if; Set_Convention (New_S, Convention (Old_S)); if Is_Abstract_Subprogram (Old_S) then if Present (Rename_Spec) then Error_Msg_N ("a renaming-as-body cannot rename an abstract subprogram", N); Set_Has_Completion (Rename_Spec); else Set_Is_Abstract_Subprogram (New_S); end if; end if; Check_Library_Unit_Renaming (N, Old_S); -- Pathological case: procedure renames entry in the scope of its -- task. Entry is given by simple name, but body must be built for -- procedure. Of course if called it will deadlock. if Ekind (Old_S) = E_Entry then Set_Has_Completion (New_S, False); Set_Alias (New_S, Empty); end if; -- Do not freeze the renaming nor the renamed entity when the context -- is an enclosing generic. Freezing is an expansion activity, and in -- addition the renamed entity may depend on the generic formals of -- the enclosing generic. if Is_Actual and not Inside_A_Generic then Freeze_Before (N, Old_S); Freeze_Actual_Profile; Set_Has_Delayed_Freeze (New_S, False); Freeze_Before (N, New_S); -- An abstract subprogram is only allowed as an actual in the case -- where the formal subprogram is also abstract. if (Ekind (Old_S) = E_Procedure or else Ekind (Old_S) = E_Function) and then Is_Abstract_Subprogram (Old_S) and then not Is_Abstract_Subprogram (Formal_Spec) then Error_Msg_N ("abstract subprogram not allowed as generic actual", Nam); end if; end if; else -- A common error is to assume that implicit operators for types are -- defined in Standard, or in the scope of a subtype. In those cases -- where the renamed entity is given with an expanded name, it is -- worth mentioning that operators for the type are not declared in -- the scope given by the prefix. if Nkind (Nam) = N_Expanded_Name and then Nkind (Selector_Name (Nam)) = N_Operator_Symbol and then Scope (Entity (Nam)) = Standard_Standard then declare T : constant Entity_Id := Base_Type (Etype (First_Formal (New_S))); begin Error_Msg_Node_2 := Prefix (Nam); Error_Msg_NE ("operator for type& is not declared in&", Prefix (Nam), T); end; else Error_Msg_NE ("no visible subprogram matches the specification for&", Spec, New_S); end if; if Present (Candidate_Renaming) then declare F1 : Entity_Id; F2 : Entity_Id; T1 : Entity_Id; begin F1 := First_Formal (Candidate_Renaming); F2 := First_Formal (New_S); T1 := First_Subtype (Etype (F1)); while Present (F1) and then Present (F2) loop Next_Formal (F1); Next_Formal (F2); end loop; if Present (F1) and then Present (Default_Value (F1)) then if Present (Next_Formal (F1)) then Error_Msg_NE ("\missing specification for & and other formals with " & "defaults", Spec, F1); else Error_Msg_NE ("\missing specification for &", Spec, F1); end if; end if; if Nkind (Nam) = N_Operator_Symbol and then From_Default (N) then Error_Msg_Node_2 := T1; Error_Msg_NE ("default & on & is not directly visible", Nam, Nam); end if; end; end if; end if; -- Ada 2005 AI 404: if the new subprogram is dispatching, verify that -- controlling access parameters are known non-null for the renamed -- subprogram. Test also applies to a subprogram instantiation that -- is dispatching. Test is skipped if some previous error was detected -- that set Old_S to Any_Id. if Ada_Version >= Ada_2005 and then Old_S /= Any_Id and then not Is_Dispatching_Operation (Old_S) and then Is_Dispatching_Operation (New_S) then declare Old_F : Entity_Id; New_F : Entity_Id; begin Old_F := First_Formal (Old_S); New_F := First_Formal (New_S); while Present (Old_F) loop if Ekind (Etype (Old_F)) = E_Anonymous_Access_Type and then Is_Controlling_Formal (New_F) and then not Can_Never_Be_Null (Old_F) then Error_Msg_N ("access parameter is controlling,", New_F); Error_Msg_NE ("\corresponding parameter of& must be explicitly null " & "excluding", New_F, Old_S); end if; Next_Formal (Old_F); Next_Formal (New_F); end loop; end; end if; -- A useful warning, suggested by Ada Bug Finder (Ada-Europe 2005) -- is to warn if an operator is being renamed as a different operator. -- If the operator is predefined, examine the kind of the entity, not -- the abbreviated declaration in Standard. if Comes_From_Source (N) and then Present (Old_S) and then (Nkind (Old_S) = N_Defining_Operator_Symbol or else Ekind (Old_S) = E_Operator) and then Nkind (New_S) = N_Defining_Operator_Symbol and then Chars (Old_S) /= Chars (New_S) then Error_Msg_NE ("& is being renamed as a different operator??", N, Old_S); end if; -- Check for renaming of obsolescent subprogram Check_Obsolescent_2005_Entity (Entity (Nam), Nam); -- Another warning or some utility: if the new subprogram as the same -- name as the old one, the old one is not hidden by an outer homograph, -- the new one is not a public symbol, and the old one is otherwise -- directly visible, the renaming is superfluous. if Chars (Old_S) = Chars (New_S) and then Comes_From_Source (N) and then Scope (Old_S) /= Standard_Standard and then Warn_On_Redundant_Constructs and then (Is_Immediately_Visible (Old_S) or else Is_Potentially_Use_Visible (Old_S)) and then Is_Overloadable (Current_Scope) and then Chars (Current_Scope) /= Chars (Old_S) then Error_Msg_N ("redundant renaming, entity is directly visible?r?", Name (N)); end if; -- Implementation-defined aspect specifications can appear in a renaming -- declaration, but not language-defined ones. The call to procedure -- Analyze_Aspect_Specifications will take care of this error check. if Has_Aspects (N) then Analyze_Aspect_Specifications (N, New_S); end if; -- AI12-0279 if Is_Actual and then Has_Yield_Aspect (Formal_Spec) and then not Has_Yield_Aspect (Old_S) then Error_Msg_Name_1 := Name_Yield; Error_Msg_N ("actual subprogram& must have aspect% to match formal", Name (N)); end if; Ada_Version := Save_AV; Ada_Version_Pragma := Save_AVP; Ada_Version_Explicit := Save_AV_Exp; -- In GNATprove mode, the renamings of actual subprograms are replaced -- with wrapper functions that make it easier to propagate axioms to the -- points of call within an instance. Wrappers are generated if formal -- subprogram is subject to axiomatization. -- The types in the wrapper profiles are obtained from (instances of) -- the types of the formal subprogram. if Is_Actual and then GNATprove_Mode and then Present (Containing_Package_With_Ext_Axioms (Formal_Spec)) and then not Inside_A_Generic then if Ekind (Old_S) = E_Function then Rewrite (N, Build_Function_Wrapper (Formal_Spec, Old_S)); Analyze (N); elsif Ekind (Old_S) = E_Operator then Rewrite (N, Build_Operator_Wrapper (Formal_Spec, Old_S)); Analyze (N); end if; end if; -- Check if we are looking at an Ada 2012 defaulted formal subprogram -- and mark any use_package_clauses that affect the visibility of the -- implicit generic actual. -- Also, we may be looking at an internal renaming of a user-defined -- subprogram created for a generic formal subprogram association, -- which will also have to be marked here. This can occur when the -- corresponding formal subprogram contains references to other generic -- formals. if Is_Generic_Actual_Subprogram (New_S) and then (Is_Intrinsic_Subprogram (New_S) or else From_Default (N) or else Nkind (N) = N_Subprogram_Renaming_Declaration) then Mark_Use_Clauses (New_S); -- Handle overloaded subprograms if Present (Alias (New_S)) then Mark_Use_Clauses (Alias (New_S)); end if; end if; end Analyze_Subprogram_Renaming; ------------------------- -- Analyze_Use_Package -- ------------------------- -- Resolve the package names in the use clause, and make all the visible -- entities defined in the package potentially use-visible. If the package -- is already in use from a previous use clause, its visible entities are -- already use-visible. In that case, mark the occurrence as a redundant -- use. If the package is an open scope, i.e. if the use clause occurs -- within the package itself, ignore it. procedure Analyze_Use_Package (N : Node_Id; Chain : Boolean := True) is procedure Analyze_Package_Name (Clause : Node_Id); -- Perform analysis on a package name from a use_package_clause procedure Analyze_Package_Name_List (Head_Clause : Node_Id); -- Similar to Analyze_Package_Name but iterates over all the names -- in a use clause. -------------------------- -- Analyze_Package_Name -- -------------------------- procedure Analyze_Package_Name (Clause : Node_Id) is Pack : constant Node_Id := Name (Clause); Pref : Node_Id; begin pragma Assert (Nkind (Clause) = N_Use_Package_Clause); Analyze (Pack); -- Verify that the package standard is not directly named in a -- use_package_clause. if Nkind (Parent (Clause)) = N_Compilation_Unit and then Nkind (Pack) = N_Expanded_Name then Pref := Prefix (Pack); while Nkind (Pref) = N_Expanded_Name loop Pref := Prefix (Pref); end loop; if Entity (Pref) = Standard_Standard then Error_Msg_N ("predefined package Standard cannot appear in a context " & "clause", Pref); end if; end if; end Analyze_Package_Name; ------------------------------- -- Analyze_Package_Name_List -- ------------------------------- procedure Analyze_Package_Name_List (Head_Clause : Node_Id) is Curr : Node_Id; begin -- Due to the way source use clauses are split during parsing we are -- forced to simply iterate through all entities in scope until the -- clause representing the last name in the list is found. Curr := Head_Clause; while Present (Curr) loop Analyze_Package_Name (Curr); -- Stop iterating over the names in the use clause when we are at -- the last one. exit when not More_Ids (Curr) and then Prev_Ids (Curr); Next (Curr); end loop; end Analyze_Package_Name_List; -- Local variables Pack : Entity_Id; -- Start of processing for Analyze_Use_Package begin Set_Hidden_By_Use_Clause (N, No_Elist); -- Use clause not allowed in a spec of a predefined package declaration -- except that packages whose file name starts a-n are OK (these are -- children of Ada.Numerics, which are never loaded by Rtsfind). if Is_Predefined_Unit (Current_Sem_Unit) and then Get_Name_String (Unit_File_Name (Current_Sem_Unit)) (1 .. 3) /= "a-n" and then Nkind (Unit (Cunit (Current_Sem_Unit))) = N_Package_Declaration then Error_Msg_N ("use clause not allowed in predefined spec", N); end if; -- Loop through all package names from the original use clause in -- order to analyze referenced packages. A use_package_clause with only -- one name does not have More_Ids or Prev_Ids set, while a clause with -- More_Ids only starts the chain produced by the parser. if not More_Ids (N) and then not Prev_Ids (N) then Analyze_Package_Name (N); elsif More_Ids (N) and then not Prev_Ids (N) then Analyze_Package_Name_List (N); end if; if not Is_Entity_Name (Name (N)) then Error_Msg_N ("& is not a package", Name (N)); return; end if; if Chain then Chain_Use_Clause (N); end if; Pack := Entity (Name (N)); -- There are many cases where scopes are manipulated during analysis, so -- check that Pack's current use clause has not already been chained -- before setting its previous use clause. if Ekind (Pack) = E_Package and then Present (Current_Use_Clause (Pack)) and then Current_Use_Clause (Pack) /= N and then No (Prev_Use_Clause (N)) and then Prev_Use_Clause (Current_Use_Clause (Pack)) /= N then Set_Prev_Use_Clause (N, Current_Use_Clause (Pack)); end if; -- Mark all entities as potentially use visible if Ekind (Pack) /= E_Package and then Etype (Pack) /= Any_Type then if Ekind (Pack) = E_Generic_Package then Error_Msg_N -- CODEFIX ("a generic package is not allowed in a use clause", Name (N)); elsif Is_Generic_Subprogram (Pack) then Error_Msg_N -- CODEFIX ("a generic subprogram is not allowed in a use clause", Name (N)); elsif Is_Subprogram (Pack) then Error_Msg_N -- CODEFIX ("a subprogram is not allowed in a use clause", Name (N)); else Error_Msg_N ("& is not allowed in a use clause", Name (N)); end if; else if Nkind (Parent (N)) = N_Compilation_Unit then Check_In_Previous_With_Clause (N, Name (N)); end if; Use_One_Package (N, Name (N)); end if; Mark_Ghost_Clause (N); end Analyze_Use_Package; ---------------------- -- Analyze_Use_Type -- ---------------------- procedure Analyze_Use_Type (N : Node_Id; Chain : Boolean := True) is E : Entity_Id; Id : Node_Id; begin Set_Hidden_By_Use_Clause (N, No_Elist); -- Chain clause to list of use clauses in current scope when flagged if Chain then Chain_Use_Clause (N); end if; -- Obtain the base type of the type denoted within the use_type_clause's -- subtype mark. Id := Subtype_Mark (N); Find_Type (Id); E := Base_Type (Entity (Id)); -- There are many cases where a use_type_clause may be reanalyzed due to -- manipulation of the scope stack so we much guard against those cases -- here, otherwise, we must add the new use_type_clause to the previous -- use_type_clause chain in order to mark redundant use_type_clauses as -- used. When the redundant use-type clauses appear in a parent unit and -- a child unit we must prevent a circularity in the chain that would -- otherwise result from the separate steps of analysis and installation -- of the parent context. if Present (Current_Use_Clause (E)) and then Current_Use_Clause (E) /= N and then Prev_Use_Clause (Current_Use_Clause (E)) /= N and then No (Prev_Use_Clause (N)) then Set_Prev_Use_Clause (N, Current_Use_Clause (E)); end if; -- If the Used_Operations list is already initialized, the clause has -- been analyzed previously, and it is being reinstalled, for example -- when the clause appears in a package spec and we are compiling the -- corresponding package body. In that case, make the entities on the -- existing list use_visible, and mark the corresponding types In_Use. if Present (Used_Operations (N)) then declare Elmt : Elmt_Id; begin Use_One_Type (Subtype_Mark (N), Installed => True); Elmt := First_Elmt (Used_Operations (N)); while Present (Elmt) loop Set_Is_Potentially_Use_Visible (Node (Elmt)); Next_Elmt (Elmt); end loop; end; return; end if; -- Otherwise, create new list and attach to it the operations that are -- made use-visible by the clause. Set_Used_Operations (N, New_Elmt_List); E := Entity (Id); if E /= Any_Type then Use_One_Type (Id); if Nkind (Parent (N)) = N_Compilation_Unit then if Nkind (Id) = N_Identifier then Error_Msg_N ("type is not directly visible", Id); elsif Is_Child_Unit (Scope (E)) and then Scope (E) /= System_Aux_Id then Check_In_Previous_With_Clause (N, Prefix (Id)); end if; end if; else -- If the use_type_clause appears in a compilation unit context, -- check whether it comes from a unit that may appear in a -- limited_with_clause, for a better error message. if Nkind (Parent (N)) = N_Compilation_Unit and then Nkind (Id) /= N_Identifier then declare Item : Node_Id; Pref : Node_Id; function Mentioned (Nam : Node_Id) return Boolean; -- Check whether the prefix of expanded name for the type -- appears in the prefix of some limited_with_clause. --------------- -- Mentioned -- --------------- function Mentioned (Nam : Node_Id) return Boolean is begin return Nkind (Name (Item)) = N_Selected_Component and then Chars (Prefix (Name (Item))) = Chars (Nam); end Mentioned; begin Pref := Prefix (Id); Item := First (Context_Items (Parent (N))); while Present (Item) and then Item /= N loop if Nkind (Item) = N_With_Clause and then Limited_Present (Item) and then Mentioned (Pref) then Change_Error_Text (Get_Msg_Id, "premature usage of incomplete type"); end if; Next (Item); end loop; end; end if; end if; Mark_Ghost_Clause (N); end Analyze_Use_Type; ------------------------ -- Attribute_Renaming -- ------------------------ procedure Attribute_Renaming (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Nam : constant Node_Id := Name (N); Spec : constant Node_Id := Specification (N); New_S : constant Entity_Id := Defining_Unit_Name (Spec); Aname : constant Name_Id := Attribute_Name (Nam); Form_Num : Nat := 0; Expr_List : List_Id := No_List; Attr_Node : Node_Id; Body_Node : Node_Id; Param_Spec : Node_Id; begin Generate_Definition (New_S); -- This procedure is called in the context of subprogram renaming, and -- thus the attribute must be one that is a subprogram. All of those -- have at least one formal parameter, with the exceptions of the GNAT -- attribute 'Img, which GNAT treats as renameable. if not Is_Non_Empty_List (Parameter_Specifications (Spec)) then if Aname /= Name_Img then Error_Msg_N ("subprogram renaming an attribute must have formals", N); return; end if; else Param_Spec := First (Parameter_Specifications (Spec)); while Present (Param_Spec) loop Form_Num := Form_Num + 1; if Nkind (Parameter_Type (Param_Spec)) /= N_Access_Definition then Find_Type (Parameter_Type (Param_Spec)); -- The profile of the new entity denotes the base type (s) of -- the types given in the specification. For access parameters -- there are no subtypes involved. Rewrite (Parameter_Type (Param_Spec), New_Occurrence_Of (Base_Type (Entity (Parameter_Type (Param_Spec))), Loc)); end if; if No (Expr_List) then Expr_List := New_List; end if; Append_To (Expr_List, Make_Identifier (Loc, Chars => Chars (Defining_Identifier (Param_Spec)))); -- The expressions in the attribute reference are not freeze -- points. Neither is the attribute as a whole, see below. Set_Must_Not_Freeze (Last (Expr_List)); Next (Param_Spec); end loop; end if; -- Immediate error if too many formals. Other mismatches in number or -- types of parameters are detected when we analyze the body of the -- subprogram that we construct. if Form_Num > 2 then Error_Msg_N ("too many formals for attribute", N); -- Error if the attribute reference has expressions that look like -- formal parameters. elsif Present (Expressions (Nam)) then Error_Msg_N ("illegal expressions in attribute reference", Nam); elsif Aname in Name_Compose | Name_Exponent | Name_Leading_Part | Name_Pos | Name_Round | Name_Scaling | Name_Val then if Nkind (N) = N_Subprogram_Renaming_Declaration and then Present (Corresponding_Formal_Spec (N)) then Error_Msg_N ("generic actual cannot be attribute involving universal type", Nam); else Error_Msg_N ("attribute involving a universal type cannot be renamed", Nam); end if; end if; -- Rewrite attribute node to have a list of expressions corresponding to -- the subprogram formals. A renaming declaration is not a freeze point, -- and the analysis of the attribute reference should not freeze the -- type of the prefix. We use the original node in the renaming so that -- its source location is preserved, and checks on stream attributes are -- properly applied. Attr_Node := Relocate_Node (Nam); Set_Expressions (Attr_Node, Expr_List); Set_Must_Not_Freeze (Attr_Node); Set_Must_Not_Freeze (Prefix (Nam)); -- Case of renaming a function if Nkind (Spec) = N_Function_Specification then if Is_Procedure_Attribute_Name (Aname) then Error_Msg_N ("attribute can only be renamed as procedure", Nam); return; end if; Find_Type (Result_Definition (Spec)); Rewrite (Result_Definition (Spec), New_Occurrence_Of (Base_Type (Entity (Result_Definition (Spec))), Loc)); Body_Node := Make_Subprogram_Body (Loc, Specification => Spec, Declarations => New_List, Handled_Statement_Sequence => Make_Handled_Sequence_Of_Statements (Loc, Statements => New_List ( Make_Simple_Return_Statement (Loc, Expression => Attr_Node)))); -- Case of renaming a procedure else if not Is_Procedure_Attribute_Name (Aname) then Error_Msg_N ("attribute can only be renamed as function", Nam); return; end if; Body_Node := Make_Subprogram_Body (Loc, Specification => Spec, Declarations => New_List, Handled_Statement_Sequence => Make_Handled_Sequence_Of_Statements (Loc, Statements => New_List (Attr_Node))); end if; -- Signal the ABE mechanism that the generated subprogram body has not -- ABE ramifications. Set_Was_Attribute_Reference (Body_Node); -- In case of tagged types we add the body of the generated function to -- the freezing actions of the type (because in the general case such -- type is still not frozen). We exclude from this processing generic -- formal subprograms found in instantiations. -- We must exclude restricted run-time libraries because -- entity AST_Handler is defined in package System.Aux_Dec which is not -- available in those platforms. Note that we cannot use the function -- Restricted_Profile (instead of Configurable_Run_Time_Mode) because -- the ZFP run-time library is not defined as a profile, and we do not -- want to deal with AST_Handler in ZFP mode. if not Configurable_Run_Time_Mode and then not Present (Corresponding_Formal_Spec (N)) and then Etype (Nam) /= RTE (RE_AST_Handler) then declare P : constant Node_Id := Prefix (Nam); begin -- The prefix of 'Img is an object that is evaluated for each call -- of the function that renames it. if Aname = Name_Img then Preanalyze_And_Resolve (P); -- For all other attribute renamings, the prefix is a subtype else Find_Type (P); end if; -- If the target type is not yet frozen, add the body to the -- actions to be elaborated at freeze time. if Is_Tagged_Type (Etype (P)) and then In_Open_Scopes (Scope (Etype (P))) then Ensure_Freeze_Node (Etype (P)); Append_Freeze_Action (Etype (P), Body_Node); else Rewrite (N, Body_Node); Analyze (N); Set_Etype (New_S, Base_Type (Etype (New_S))); end if; end; -- Generic formal subprograms or AST_Handler renaming else Rewrite (N, Body_Node); Analyze (N); Set_Etype (New_S, Base_Type (Etype (New_S))); end if; if Is_Compilation_Unit (New_S) then Error_Msg_N ("a library unit can only rename another library unit", N); end if; -- We suppress elaboration warnings for the resulting entity, since -- clearly they are not needed, and more particularly, in the case -- of a generic formal subprogram, the resulting entity can appear -- after the instantiation itself, and thus look like a bogus case -- of access before elaboration. if Legacy_Elaboration_Checks then Set_Suppress_Elaboration_Warnings (New_S); end if; end Attribute_Renaming; ---------------------- -- Chain_Use_Clause -- ---------------------- procedure Chain_Use_Clause (N : Node_Id) is Level : Int := Scope_Stack.Last; Pack : Entity_Id; begin -- Common case if not Is_Compilation_Unit (Current_Scope) or else not Is_Child_Unit (Current_Scope) then null; -- Common case for compilation unit elsif Defining_Entity (Parent (N)) = Current_Scope then null; else -- If declaration appears in some other scope, it must be in some -- parent unit when compiling a child. Pack := Defining_Entity (Parent (N)); if not In_Open_Scopes (Pack) then null; -- If the use clause appears in an ancestor and we are in the -- private part of the immediate parent, the use clauses are -- already installed. elsif Pack /= Scope (Current_Scope) and then In_Private_Part (Scope (Current_Scope)) then null; else -- Find entry for parent unit in scope stack while Scope_Stack.Table (Level).Entity /= Pack loop Level := Level - 1; end loop; end if; end if; Set_Next_Use_Clause (N, Scope_Stack.Table (Level).First_Use_Clause); Scope_Stack.Table (Level).First_Use_Clause := N; end Chain_Use_Clause; --------------------------- -- Check_Frozen_Renaming -- --------------------------- procedure Check_Frozen_Renaming (N : Node_Id; Subp : Entity_Id) is B_Node : Node_Id; Old_S : Entity_Id; begin if Is_Frozen (Subp) and then not Has_Completion (Subp) then B_Node := Build_Renamed_Body (Parent (Declaration_Node (Subp)), Defining_Entity (N)); if Is_Entity_Name (Name (N)) then Old_S := Entity (Name (N)); if not Is_Frozen (Old_S) and then Operating_Mode /= Check_Semantics then Append_Freeze_Action (Old_S, B_Node); else Insert_After (N, B_Node); Analyze (B_Node); end if; if Is_Intrinsic_Subprogram (Old_S) and then not In_Instance and then not Relaxed_RM_Semantics then Error_Msg_N ("subprogram used in renaming_as_body cannot be intrinsic", Name (N)); end if; else Insert_After (N, B_Node); Analyze (B_Node); end if; end if; end Check_Frozen_Renaming; ------------------------------- -- Set_Entity_Or_Discriminal -- ------------------------------- procedure Set_Entity_Or_Discriminal (N : Node_Id; E : Entity_Id) is P : Node_Id; begin -- If the entity is not a discriminant, or else expansion is disabled, -- simply set the entity. if not In_Spec_Expression or else Ekind (E) /= E_Discriminant or else Inside_A_Generic then Set_Entity_With_Checks (N, E); -- The replacement of a discriminant by the corresponding discriminal -- is not done for a task discriminant that appears in a default -- expression of an entry parameter. See Exp_Ch2.Expand_Discriminant -- for details on their handling. elsif Is_Concurrent_Type (Scope (E)) then P := Parent (N); while Present (P) and then Nkind (P) not in N_Parameter_Specification | N_Component_Declaration loop P := Parent (P); end loop; if Present (P) and then Nkind (P) = N_Parameter_Specification then null; else Set_Entity (N, Discriminal (E)); end if; -- Otherwise, this is a discriminant in a context in which -- it is a reference to the corresponding parameter of the -- init proc for the enclosing type. else Set_Entity (N, Discriminal (E)); end if; end Set_Entity_Or_Discriminal; ----------------------------------- -- Check_In_Previous_With_Clause -- ----------------------------------- procedure Check_In_Previous_With_Clause (N : Node_Id; Nam : Entity_Id) is Pack : constant Entity_Id := Entity (Original_Node (Nam)); Item : Node_Id; Par : Node_Id; begin Item := First (Context_Items (Parent (N))); while Present (Item) and then Item /= N loop if Nkind (Item) = N_With_Clause -- Protect the frontend against previous critical errors and then Nkind (Name (Item)) /= N_Selected_Component and then Entity (Name (Item)) = Pack then Par := Nam; -- Find root library unit in with_clause while Nkind (Par) = N_Expanded_Name loop Par := Prefix (Par); end loop; if Is_Child_Unit (Entity (Original_Node (Par))) then Error_Msg_NE ("& is not directly visible", Par, Entity (Par)); else return; end if; end if; Next (Item); end loop; -- On exit, package is not mentioned in a previous with_clause. -- Check if its prefix is. if Nkind (Nam) = N_Expanded_Name then Check_In_Previous_With_Clause (N, Prefix (Nam)); elsif Pack /= Any_Id then Error_Msg_NE ("& is not visible", Nam, Pack); end if; end Check_In_Previous_With_Clause; --------------------------------- -- Check_Library_Unit_Renaming -- --------------------------------- procedure Check_Library_Unit_Renaming (N : Node_Id; Old_E : Entity_Id) is New_E : Entity_Id; begin if Nkind (Parent (N)) /= N_Compilation_Unit then return; -- Check for library unit. Note that we used to check for the scope -- being Standard here, but that was wrong for Standard itself. elsif not Is_Compilation_Unit (Old_E) and then not Is_Child_Unit (Old_E) then Error_Msg_N ("renamed unit must be a library unit", Name (N)); -- Entities defined in Standard (operators and boolean literals) cannot -- be renamed as library units. elsif Scope (Old_E) = Standard_Standard and then Sloc (Old_E) = Standard_Location then Error_Msg_N ("renamed unit must be a library unit", Name (N)); elsif Present (Parent_Spec (N)) and then Nkind (Unit (Parent_Spec (N))) = N_Generic_Package_Declaration and then not Is_Child_Unit (Old_E) then Error_Msg_N ("renamed unit must be a child unit of generic parent", Name (N)); elsif Nkind (N) in N_Generic_Renaming_Declaration and then Nkind (Name (N)) = N_Expanded_Name and then Is_Generic_Instance (Entity (Prefix (Name (N)))) and then Is_Generic_Unit (Old_E) then Error_Msg_N ("renamed generic unit must be a library unit", Name (N)); elsif Is_Package_Or_Generic_Package (Old_E) then -- Inherit categorization flags New_E := Defining_Entity (N); Set_Is_Pure (New_E, Is_Pure (Old_E)); Set_Is_Preelaborated (New_E, Is_Preelaborated (Old_E)); Set_Is_Remote_Call_Interface (New_E, Is_Remote_Call_Interface (Old_E)); Set_Is_Remote_Types (New_E, Is_Remote_Types (Old_E)); Set_Is_Shared_Passive (New_E, Is_Shared_Passive (Old_E)); end if; end Check_Library_Unit_Renaming; ------------------------ -- Enclosing_Instance -- ------------------------ function Enclosing_Instance return Entity_Id is S : Entity_Id; begin if not Is_Generic_Instance (Current_Scope) then return Empty; end if; S := Scope (Current_Scope); while S /= Standard_Standard loop if Is_Generic_Instance (S) then return S; end if; S := Scope (S); end loop; return Empty; end Enclosing_Instance; --------------- -- End_Scope -- --------------- procedure End_Scope is Id : Entity_Id; Prev : Entity_Id; Outer : Entity_Id; begin Id := First_Entity (Current_Scope); while Present (Id) loop -- An entity in the current scope is not necessarily the first one -- on its homonym chain. Find its predecessor if any, -- If it is an internal entity, it will not be in the visibility -- chain altogether, and there is nothing to unchain. if Id /= Current_Entity (Id) then Prev := Current_Entity (Id); while Present (Prev) and then Present (Homonym (Prev)) and then Homonym (Prev) /= Id loop Prev := Homonym (Prev); end loop; -- Skip to end of loop if Id is not in the visibility chain if No (Prev) or else Homonym (Prev) /= Id then goto Next_Ent; end if; else Prev := Empty; end if; Set_Is_Immediately_Visible (Id, False); Outer := Homonym (Id); while Present (Outer) and then Scope (Outer) = Current_Scope loop Outer := Homonym (Outer); end loop; -- Reset homonym link of other entities, but do not modify link -- between entities in current scope, so that the back-end can have -- a proper count of local overloadings. if No (Prev) then Set_Name_Entity_Id (Chars (Id), Outer); elsif Scope (Prev) /= Scope (Id) then Set_Homonym (Prev, Outer); end if; <<Next_Ent>> Next_Entity (Id); end loop; -- If the scope generated freeze actions, place them before the -- current declaration and analyze them. Type declarations and -- the bodies of initialization procedures can generate such nodes. -- We follow the parent chain until we reach a list node, which is -- the enclosing list of declarations. If the list appears within -- a protected definition, move freeze nodes outside the protected -- type altogether. if Present (Scope_Stack.Table (Scope_Stack.Last).Pending_Freeze_Actions) then declare Decl : Node_Id; L : constant List_Id := Scope_Stack.Table (Scope_Stack.Last).Pending_Freeze_Actions; begin if Is_Itype (Current_Scope) then Decl := Associated_Node_For_Itype (Current_Scope); else Decl := Parent (Current_Scope); end if; Pop_Scope; while not (Is_List_Member (Decl)) or else Nkind (Parent (Decl)) in N_Protected_Definition | N_Task_Definition loop Decl := Parent (Decl); end loop; Insert_List_Before_And_Analyze (Decl, L); end; else Pop_Scope; end if; end End_Scope; --------------------- -- End_Use_Clauses -- --------------------- procedure End_Use_Clauses (Clause : Node_Id) is U : Node_Id; begin -- Remove use_type_clauses first, because they affect the visibility of -- operators in subsequent used packages. U := Clause; while Present (U) loop if Nkind (U) = N_Use_Type_Clause then End_Use_Type (U); end if; Next_Use_Clause (U); end loop; U := Clause; while Present (U) loop if Nkind (U) = N_Use_Package_Clause then End_Use_Package (U); end if; Next_Use_Clause (U); end loop; end End_Use_Clauses; --------------------- -- End_Use_Package -- --------------------- procedure End_Use_Package (N : Node_Id) is Pack : Entity_Id; Pack_Name : Node_Id; Id : Entity_Id; Elmt : Elmt_Id; function Is_Primitive_Operator_In_Use (Op : Entity_Id; F : Entity_Id) return Boolean; -- Check whether Op is a primitive operator of a use-visible type ---------------------------------- -- Is_Primitive_Operator_In_Use -- ---------------------------------- function Is_Primitive_Operator_In_Use (Op : Entity_Id; F : Entity_Id) return Boolean is T : constant Entity_Id := Base_Type (Etype (F)); begin return In_Use (T) and then Scope (T) = Scope (Op); end Is_Primitive_Operator_In_Use; -- Start of processing for End_Use_Package begin Pack_Name := Name (N); -- Test that Pack_Name actually denotes a package before processing if Is_Entity_Name (Pack_Name) and then Ekind (Entity (Pack_Name)) = E_Package then Pack := Entity (Pack_Name); if In_Open_Scopes (Pack) then null; elsif not Redundant_Use (Pack_Name) then Set_In_Use (Pack, False); Set_Current_Use_Clause (Pack, Empty); Id := First_Entity (Pack); while Present (Id) loop -- Preserve use-visibility of operators that are primitive -- operators of a type that is use-visible through an active -- use_type_clause. if Nkind (Id) = N_Defining_Operator_Symbol and then (Is_Primitive_Operator_In_Use (Id, First_Formal (Id)) or else (Present (Next_Formal (First_Formal (Id))) and then Is_Primitive_Operator_In_Use (Id, Next_Formal (First_Formal (Id))))) then null; else Set_Is_Potentially_Use_Visible (Id, False); end if; if Is_Private_Type (Id) and then Present (Full_View (Id)) then Set_Is_Potentially_Use_Visible (Full_View (Id), False); end if; Next_Entity (Id); end loop; if Present (Renamed_Object (Pack)) then Set_In_Use (Renamed_Object (Pack), False); Set_Current_Use_Clause (Renamed_Object (Pack), Empty); end if; if Chars (Pack) = Name_System and then Scope (Pack) = Standard_Standard and then Present_System_Aux then Id := First_Entity (System_Aux_Id); while Present (Id) loop Set_Is_Potentially_Use_Visible (Id, False); if Is_Private_Type (Id) and then Present (Full_View (Id)) then Set_Is_Potentially_Use_Visible (Full_View (Id), False); end if; Next_Entity (Id); end loop; Set_In_Use (System_Aux_Id, False); end if; else Set_Redundant_Use (Pack_Name, False); end if; end if; if Present (Hidden_By_Use_Clause (N)) then Elmt := First_Elmt (Hidden_By_Use_Clause (N)); while Present (Elmt) loop declare E : constant Entity_Id := Node (Elmt); begin -- Reset either Use_Visibility or Direct_Visibility, depending -- on how the entity was hidden by the use clause. if In_Use (Scope (E)) and then Used_As_Generic_Actual (Scope (E)) then Set_Is_Potentially_Use_Visible (Node (Elmt)); else Set_Is_Immediately_Visible (Node (Elmt)); end if; Next_Elmt (Elmt); end; end loop; Set_Hidden_By_Use_Clause (N, No_Elist); end if; end End_Use_Package; ------------------ -- End_Use_Type -- ------------------ procedure End_Use_Type (N : Node_Id) is Elmt : Elmt_Id; Id : Entity_Id; T : Entity_Id; -- Start of processing for End_Use_Type begin Id := Subtype_Mark (N); -- A call to Rtsfind may occur while analyzing a use_type_clause, in -- which case the type marks are not resolved yet, so guard against that -- here. if Is_Entity_Name (Id) and then Present (Entity (Id)) then T := Entity (Id); if T = Any_Type or else From_Limited_With (T) then null; -- Note that the use_type_clause may mention a subtype of the type -- whose primitive operations have been made visible. Here as -- elsewhere, it is the base type that matters for visibility. elsif In_Open_Scopes (Scope (Base_Type (T))) then null; elsif not Redundant_Use (Id) then Set_In_Use (T, False); Set_In_Use (Base_Type (T), False); Set_Current_Use_Clause (T, Empty); Set_Current_Use_Clause (Base_Type (T), Empty); -- See Use_One_Type for the rationale. This is a bit on the naive -- side, but should be good enough in practice. if Is_Tagged_Type (T) then Set_In_Use (Class_Wide_Type (T), False); end if; end if; end if; if Is_Empty_Elmt_List (Used_Operations (N)) then return; else Elmt := First_Elmt (Used_Operations (N)); while Present (Elmt) loop Set_Is_Potentially_Use_Visible (Node (Elmt), False); Next_Elmt (Elmt); end loop; end if; end End_Use_Type; -------------------- -- Entity_Of_Unit -- -------------------- function Entity_Of_Unit (U : Node_Id) return Entity_Id is begin if Nkind (U) = N_Package_Instantiation and then Analyzed (U) then return Defining_Entity (Instance_Spec (U)); else return Defining_Entity (U); end if; end Entity_Of_Unit; ---------------------- -- Find_Direct_Name -- ---------------------- procedure Find_Direct_Name (N : Node_Id) is E : Entity_Id; E2 : Entity_Id; Msg : Boolean; Homonyms : Entity_Id; -- Saves start of homonym chain Inst : Entity_Id := Empty; -- Enclosing instance, if any Nvis_Entity : Boolean; -- Set True to indicate that there is at least one entity on the homonym -- chain which, while not visible, is visible enough from the user point -- of view to warrant an error message of "not visible" rather than -- undefined. Nvis_Is_Private_Subprg : Boolean := False; -- Ada 2005 (AI-262): Set True to indicate that a form of Beaujolais -- effect concerning library subprograms has been detected. Used to -- generate the precise error message. function From_Actual_Package (E : Entity_Id) return Boolean; -- Returns true if the entity is an actual for a package that is itself -- an actual for a formal package of the current instance. Such an -- entity requires special handling because it may be use-visible but -- hides directly visible entities defined outside the instance, because -- the corresponding formal did so in the generic. function Is_Actual_Parameter return Boolean; -- This function checks if the node N is an identifier that is an actual -- parameter of a procedure call. If so it returns True, otherwise it -- return False. The reason for this check is that at this stage we do -- not know what procedure is being called if the procedure might be -- overloaded, so it is premature to go setting referenced flags or -- making calls to Generate_Reference. We will wait till Resolve_Actuals -- for that processing. -- Note: there is a similar routine Sem_Util.Is_Actual_Parameter, but -- it works for both function and procedure calls, while here we are -- only concerned with procedure calls (and with entry calls as well, -- but they are parsed as procedure calls and only later rewritten to -- entry calls). function Known_But_Invisible (E : Entity_Id) return Boolean; -- This function determines whether a reference to the entity E, which -- is not visible, can reasonably be considered to be known to the -- writer of the reference. This is a heuristic test, used only for -- the purposes of figuring out whether we prefer to complain that an -- entity is undefined or invisible (and identify the declaration of -- the invisible entity in the latter case). The point here is that we -- don't want to complain that something is invisible and then point to -- something entirely mysterious to the writer. procedure Nvis_Messages; -- Called if there are no visible entries for N, but there is at least -- one non-directly visible, or hidden declaration. This procedure -- outputs an appropriate set of error messages. procedure Undefined (Nvis : Boolean); -- This function is called if the current node has no corresponding -- visible entity or entities. The value set in Msg indicates whether -- an error message was generated (multiple error messages for the -- same variable are generally suppressed, see body for details). -- Msg is True if an error message was generated, False if not. This -- value is used by the caller to determine whether or not to output -- additional messages where appropriate. The parameter is set False -- to get the message "X is undefined", and True to get the message -- "X is not visible". ------------------------- -- From_Actual_Package -- ------------------------- function From_Actual_Package (E : Entity_Id) return Boolean is Scop : constant Entity_Id := Scope (E); -- Declared scope of candidate entity function Declared_In_Actual (Pack : Entity_Id) return Boolean; -- Recursive function that does the work and examines actuals of -- actual packages of current instance. ------------------------ -- Declared_In_Actual -- ------------------------ function Declared_In_Actual (Pack : Entity_Id) return Boolean is Act : Entity_Id; begin if No (Associated_Formal_Package (Pack)) then return False; else Act := First_Entity (Pack); while Present (Act) loop if Renamed_Object (Pack) = Scop then return True; -- Check for end of list of actuals elsif Ekind (Act) = E_Package and then Renamed_Object (Act) = Pack then return False; elsif Ekind (Act) = E_Package and then Declared_In_Actual (Act) then return True; end if; Next_Entity (Act); end loop; return False; end if; end Declared_In_Actual; -- Local variables Act : Entity_Id; -- Start of processing for From_Actual_Package begin if not In_Instance then return False; else Inst := Current_Scope; while Present (Inst) and then Ekind (Inst) /= E_Package and then not Is_Generic_Instance (Inst) loop Inst := Scope (Inst); end loop; if No (Inst) then return False; end if; Act := First_Entity (Inst); while Present (Act) loop if Ekind (Act) = E_Package and then Declared_In_Actual (Act) then return True; end if; Next_Entity (Act); end loop; return False; end if; end From_Actual_Package; ------------------------- -- Is_Actual_Parameter -- ------------------------- function Is_Actual_Parameter return Boolean is begin if Nkind (N) = N_Identifier then case Nkind (Parent (N)) is when N_Procedure_Call_Statement => return Is_List_Member (N) and then List_Containing (N) = Parameter_Associations (Parent (N)); when N_Parameter_Association => return N = Explicit_Actual_Parameter (Parent (N)) and then Nkind (Parent (Parent (N))) = N_Procedure_Call_Statement; when others => return False; end case; else return False; end if; end Is_Actual_Parameter; ------------------------- -- Known_But_Invisible -- ------------------------- function Known_But_Invisible (E : Entity_Id) return Boolean is Fname : File_Name_Type; begin -- Entities in Standard are always considered to be known if Sloc (E) <= Standard_Location then return True; -- An entity that does not come from source is always considered -- to be unknown, since it is an artifact of code expansion. elsif not Comes_From_Source (E) then return False; -- In gnat internal mode, we consider all entities known. The -- historical reason behind this discrepancy is not known??? But the -- only effect is to modify the error message given, so it is not -- critical. Since it only affects the exact wording of error -- messages in illegal programs, we do not mention this as an -- effect of -gnatg, since it is not a language modification. elsif GNAT_Mode then return True; end if; -- Here we have an entity that is not from package Standard, and -- which comes from Source. See if it comes from an internal file. Fname := Unit_File_Name (Get_Source_Unit (E)); -- Case of from internal file if In_Internal_Unit (E) then -- Private part entities in internal files are never considered -- to be known to the writer of normal application code. if Is_Hidden (E) then return False; end if; -- Entities from System packages other than System and -- System.Storage_Elements are not considered to be known. -- System.Auxxxx files are also considered known to the user. -- Should refine this at some point to generally distinguish -- between known and unknown internal files ??? Get_Name_String (Fname); return Name_Len < 2 or else Name_Buffer (1 .. 2) /= "s-" or else Name_Buffer (3 .. 8) = "stoele" or else Name_Buffer (3 .. 5) = "aux"; -- If not an internal file, then entity is definitely known, even if -- it is in a private part (the message generated will note that it -- is in a private part). else return True; end if; end Known_But_Invisible; ------------------- -- Nvis_Messages -- ------------------- procedure Nvis_Messages is Comp_Unit : Node_Id; Ent : Entity_Id; Found : Boolean := False; Hidden : Boolean := False; Item : Node_Id; begin -- Ada 2005 (AI-262): Generate a precise error concerning the -- Beaujolais effect that was previously detected if Nvis_Is_Private_Subprg then pragma Assert (Nkind (E2) = N_Defining_Identifier and then Ekind (E2) = E_Function and then Scope (E2) = Standard_Standard and then Has_Private_With (E2)); -- Find the sloc corresponding to the private with'ed unit Comp_Unit := Cunit (Current_Sem_Unit); Error_Msg_Sloc := No_Location; Item := First (Context_Items (Comp_Unit)); while Present (Item) loop if Nkind (Item) = N_With_Clause and then Private_Present (Item) and then Entity (Name (Item)) = E2 then Error_Msg_Sloc := Sloc (Item); exit; end if; Next (Item); end loop; pragma Assert (Error_Msg_Sloc /= No_Location); Error_Msg_N ("(Ada 2005): hidden by private with clause #", N); return; end if; Undefined (Nvis => True); if Msg then -- First loop does hidden declarations Ent := Homonyms; while Present (Ent) loop if Is_Potentially_Use_Visible (Ent) then if not Hidden then Error_Msg_N -- CODEFIX ("multiple use clauses cause hiding!", N); Hidden := True; end if; Error_Msg_Sloc := Sloc (Ent); Error_Msg_N -- CODEFIX ("hidden declaration#!", N); end if; Ent := Homonym (Ent); end loop; -- If we found hidden declarations, then that's enough, don't -- bother looking for non-visible declarations as well. if Hidden then return; end if; -- Second loop does non-directly visible declarations Ent := Homonyms; while Present (Ent) loop if not Is_Potentially_Use_Visible (Ent) then -- Do not bother the user with unknown entities if not Known_But_Invisible (Ent) then goto Continue; end if; Error_Msg_Sloc := Sloc (Ent); -- Output message noting that there is a non-visible -- declaration, distinguishing the private part case. if Is_Hidden (Ent) then Error_Msg_N ("non-visible (private) declaration#!", N); -- If the entity is declared in a generic package, it -- cannot be visible, so there is no point in adding it -- to the list of candidates if another homograph from a -- non-generic package has been seen. elsif Ekind (Scope (Ent)) = E_Generic_Package and then Found then null; else Error_Msg_N -- CODEFIX ("non-visible declaration#!", N); if Ekind (Scope (Ent)) /= E_Generic_Package then Found := True; end if; if Is_Compilation_Unit (Ent) and then Nkind (Parent (Parent (N))) = N_Use_Package_Clause then Error_Msg_Qual_Level := 99; Error_Msg_NE -- CODEFIX ("\\missing `WITH &;`", N, Ent); Error_Msg_Qual_Level := 0; end if; if Ekind (Ent) = E_Discriminant and then Present (Corresponding_Discriminant (Ent)) and then Scope (Corresponding_Discriminant (Ent)) = Etype (Scope (Ent)) then Error_Msg_N ("inherited discriminant not allowed here" & " (RM 3.8 (12), 3.8.1 (6))!", N); end if; end if; -- Set entity and its containing package as referenced. We -- can't be sure of this, but this seems a better choice -- to avoid unused entity messages. if Comes_From_Source (Ent) then Set_Referenced (Ent); Set_Referenced (Cunit_Entity (Get_Source_Unit (Ent))); end if; end if; <<Continue>> Ent := Homonym (Ent); end loop; end if; end Nvis_Messages; --------------- -- Undefined -- --------------- procedure Undefined (Nvis : Boolean) is Emsg : Error_Msg_Id; begin -- We should never find an undefined internal name. If we do, then -- see if we have previous errors. If so, ignore on the grounds that -- it is probably a cascaded message (e.g. a block label from a badly -- formed block). If no previous errors, then we have a real internal -- error of some kind so raise an exception. if Is_Internal_Name (Chars (N)) then if Total_Errors_Detected /= 0 then return; else raise Program_Error; end if; end if; -- A very specialized error check, if the undefined variable is -- a case tag, and the case type is an enumeration type, check -- for a possible misspelling, and if so, modify the identifier -- Named aggregate should also be handled similarly ??? if Nkind (N) = N_Identifier and then Nkind (Parent (N)) = N_Case_Statement_Alternative then declare Case_Stm : constant Node_Id := Parent (Parent (N)); Case_Typ : constant Entity_Id := Etype (Expression (Case_Stm)); Lit : Node_Id; begin if Is_Enumeration_Type (Case_Typ) and then not Is_Standard_Character_Type (Case_Typ) then Lit := First_Literal (Case_Typ); Get_Name_String (Chars (Lit)); if Chars (Lit) /= Chars (N) and then Is_Bad_Spelling_Of (Chars (N), Chars (Lit)) then Error_Msg_Node_2 := Lit; Error_Msg_N -- CODEFIX ("& is undefined, assume misspelling of &", N); Rewrite (N, New_Occurrence_Of (Lit, Sloc (N))); return; end if; Next_Literal (Lit); end if; end; end if; -- Normal processing Set_Entity (N, Any_Id); Set_Etype (N, Any_Type); -- We use the table Urefs to keep track of entities for which we -- have issued errors for undefined references. Multiple errors -- for a single name are normally suppressed, however we modify -- the error message to alert the programmer to this effect. for J in Urefs.First .. Urefs.Last loop if Chars (N) = Chars (Urefs.Table (J).Node) then if Urefs.Table (J).Err /= No_Error_Msg and then Sloc (N) /= Urefs.Table (J).Loc then Error_Msg_Node_1 := Urefs.Table (J).Node; if Urefs.Table (J).Nvis then Change_Error_Text (Urefs.Table (J).Err, "& is not visible (more references follow)"); else Change_Error_Text (Urefs.Table (J).Err, "& is undefined (more references follow)"); end if; Urefs.Table (J).Err := No_Error_Msg; end if; -- Although we will set Msg False, and thus suppress the -- message, we also set Error_Posted True, to avoid any -- cascaded messages resulting from the undefined reference. Msg := False; Set_Error_Posted (N); return; end if; end loop; -- If entry not found, this is first undefined occurrence if Nvis then Error_Msg_N ("& is not visible!", N); Emsg := Get_Msg_Id; else Error_Msg_N ("& is undefined!", N); Emsg := Get_Msg_Id; -- A very bizarre special check, if the undefined identifier -- is Put or Put_Line, then add a special error message (since -- this is a very common error for beginners to make). if Chars (N) in Name_Put | Name_Put_Line then Error_Msg_N -- CODEFIX ("\\possible missing `WITH Ada.Text_'I'O; " & "USE Ada.Text_'I'O`!", N); -- Another special check if N is the prefix of a selected -- component which is a known unit: add message complaining -- about missing with for this unit. elsif Nkind (Parent (N)) = N_Selected_Component and then N = Prefix (Parent (N)) and then Is_Known_Unit (Parent (N)) then Error_Msg_Node_2 := Selector_Name (Parent (N)); Error_Msg_N -- CODEFIX ("\\missing `WITH &.&;`", Prefix (Parent (N))); end if; -- Now check for possible misspellings declare E : Entity_Id; Ematch : Entity_Id := Empty; begin for Nam in First_Name_Id .. Last_Name_Id loop E := Get_Name_Entity_Id (Nam); if Present (E) and then (Is_Immediately_Visible (E) or else Is_Potentially_Use_Visible (E)) then if Is_Bad_Spelling_Of (Chars (N), Nam) then Ematch := E; exit; end if; end if; end loop; if Present (Ematch) then Error_Msg_NE -- CODEFIX ("\possible misspelling of&", N, Ematch); end if; end; end if; -- Make entry in undefined references table unless the full errors -- switch is set, in which case by refraining from generating the -- table entry we guarantee that we get an error message for every -- undefined reference. The entry is not added if we are ignoring -- errors. if not All_Errors_Mode and then Ignore_Errors_Enable = 0 then Urefs.Append ( (Node => N, Err => Emsg, Nvis => Nvis, Loc => Sloc (N))); end if; Msg := True; end Undefined; -- Local variables Nested_Inst : Entity_Id := Empty; -- The entity of a nested instance which appears within Inst (if any) -- Start of processing for Find_Direct_Name begin -- If the entity pointer is already set, this is an internal node, or -- a node that is analyzed more than once, after a tree modification. -- In such a case there is no resolution to perform, just set the type. if Present (Entity (N)) then if Is_Type (Entity (N)) then Set_Etype (N, Entity (N)); -- The exception to this general rule are constants associated with -- discriminals of protected types because for each protected op -- a new set of discriminals is internally created by the frontend -- (see Exp_Ch9.Set_Discriminals), and the current decoration of the -- entity pointer may have been set as part of a preanalysis, where -- discriminals still reference the first subprogram or entry to be -- expanded (see Expand_Protected_Body_Declarations). elsif Full_Analysis and then Ekind (Entity (N)) = E_Constant and then Present (Discriminal_Link (Entity (N))) and then Is_Protected_Type (Scope (Discriminal_Link (Entity (N)))) then goto Find_Name; else declare Entyp : constant Entity_Id := Etype (Entity (N)); begin -- One special case here. If the Etype field is already set, -- and references the packed array type corresponding to the -- etype of the referenced entity, then leave it alone. This -- happens for trees generated from Exp_Pakd, where expressions -- can be deliberately "mis-typed" to the packed array type. if Is_Array_Type (Entyp) and then Is_Packed (Entyp) and then Present (Etype (N)) and then Etype (N) = Packed_Array_Impl_Type (Entyp) then null; -- If not that special case, then just reset the Etype else Set_Etype (N, Etype (Entity (N))); end if; end; end if; -- Although the marking of use clauses happens at the end of -- Find_Direct_Name, a certain case where a generic actual satisfies -- a use clause must be checked here due to how the generic machinery -- handles the analysis of said actuals. if In_Instance and then Nkind (Parent (N)) = N_Generic_Association then Mark_Use_Clauses (Entity (N)); end if; return; end if; <<Find_Name>> -- Preserve relevant elaboration-related attributes of the context which -- are no longer available or very expensive to recompute once analysis, -- resolution, and expansion are over. if Nkind (N) = N_Identifier then Mark_Elaboration_Attributes (N_Id => N, Checks => True, Modes => True, Warnings => True); end if; -- Here if Entity pointer was not set, we need full visibility analysis -- First we generate debugging output if the debug E flag is set. if Debug_Flag_E then Write_Str ("Looking for "); Write_Name (Chars (N)); Write_Eol; end if; Homonyms := Current_Entity (N); Nvis_Entity := False; E := Homonyms; while Present (E) loop -- If entity is immediately visible or potentially use visible, then -- process the entity and we are done. if Is_Immediately_Visible (E) then goto Immediately_Visible_Entity; elsif Is_Potentially_Use_Visible (E) then goto Potentially_Use_Visible_Entity; -- Note if a known but invisible entity encountered elsif Known_But_Invisible (E) then Nvis_Entity := True; end if; -- Move to next entity in chain and continue search E := Homonym (E); end loop; -- If we are ignoring errors, skip the error processing if Get_Ignore_Errors then return; end if; -- If no entries on homonym chain that were potentially visible, -- and no entities reasonably considered as non-visible, then -- we have a plain undefined reference, with no additional -- explanation required. if not Nvis_Entity then Undefined (Nvis => False); -- Otherwise there is at least one entry on the homonym chain that -- is reasonably considered as being known and non-visible. else Nvis_Messages; end if; goto Done; -- Processing for a potentially use visible entry found. We must search -- the rest of the homonym chain for two reasons. First, if there is a -- directly visible entry, then none of the potentially use-visible -- entities are directly visible (RM 8.4(10)). Second, we need to check -- for the case of multiple potentially use-visible entries hiding one -- another and as a result being non-directly visible (RM 8.4(11)). <<Potentially_Use_Visible_Entity>> declare Only_One_Visible : Boolean := True; All_Overloadable : Boolean := Is_Overloadable (E); begin E2 := Homonym (E); while Present (E2) loop if Is_Immediately_Visible (E2) then -- If the use-visible entity comes from the actual for a -- formal package, it hides a directly visible entity from -- outside the instance. if From_Actual_Package (E) and then Scope_Depth (Scope (E2)) < Scope_Depth (Inst) then goto Found; else E := E2; goto Immediately_Visible_Entity; end if; elsif Is_Potentially_Use_Visible (E2) then Only_One_Visible := False; All_Overloadable := All_Overloadable and Is_Overloadable (E2); -- Ada 2005 (AI-262): Protect against a form of Beaujolais effect -- that can occur in private_with clauses. Example: -- with A; -- private with B; package A is -- package C is function B return Integer; -- use A; end A; -- V1 : Integer := B; -- private function B return Integer; -- V2 : Integer := B; -- end C; -- V1 resolves to A.B, but V2 resolves to library unit B elsif Ekind (E2) = E_Function and then Scope (E2) = Standard_Standard and then Has_Private_With (E2) then Only_One_Visible := False; All_Overloadable := False; Nvis_Is_Private_Subprg := True; exit; end if; E2 := Homonym (E2); end loop; -- On falling through this loop, we have checked that there are no -- immediately visible entities. Only_One_Visible is set if exactly -- one potentially use visible entity exists. All_Overloadable is -- set if all the potentially use visible entities are overloadable. -- The condition for legality is that either there is one potentially -- use visible entity, or if there is more than one, then all of them -- are overloadable. if Only_One_Visible or All_Overloadable then goto Found; -- If there is more than one potentially use-visible entity and at -- least one of them non-overloadable, we have an error (RM 8.4(11)). -- Note that E points to the first such entity on the homonym list. else -- If one of the entities is declared in an actual package, it -- was visible in the generic, and takes precedence over other -- entities that are potentially use-visible. The same applies -- if the entity is declared in a local instantiation of the -- current instance. if In_Instance then -- Find the current instance Inst := Current_Scope; while Present (Inst) and then Inst /= Standard_Standard loop if Is_Generic_Instance (Inst) then exit; end if; Inst := Scope (Inst); end loop; -- Reexamine the candidate entities, giving priority to those -- that were visible within the generic. E2 := E; while Present (E2) loop Nested_Inst := Nearest_Enclosing_Instance (E2); -- The entity is declared within an actual package, or in a -- nested instance. The ">=" accounts for the case where the -- current instance and the nested instance are the same. if From_Actual_Package (E2) or else (Present (Nested_Inst) and then Scope_Depth (Nested_Inst) >= Scope_Depth (Inst)) then E := E2; goto Found; end if; E2 := Homonym (E2); end loop; Nvis_Messages; goto Done; elsif Is_Predefined_Unit (Current_Sem_Unit) then -- A use clause in the body of a system file creates conflict -- with some entity in a user scope, while rtsfind is active. -- Keep only the entity coming from another predefined unit. E2 := E; while Present (E2) loop if In_Predefined_Unit (E2) then E := E2; goto Found; end if; E2 := Homonym (E2); end loop; -- Entity must exist because predefined unit is correct raise Program_Error; else Nvis_Messages; goto Done; end if; end if; end; -- Come here with E set to the first immediately visible entity on -- the homonym chain. This is the one we want unless there is another -- immediately visible entity further on in the chain for an inner -- scope (RM 8.3(8)). <<Immediately_Visible_Entity>> declare Level : Int; Scop : Entity_Id; begin -- Find scope level of initial entity. When compiling through -- Rtsfind, the previous context is not completely invisible, and -- an outer entity may appear on the chain, whose scope is below -- the entry for Standard that delimits the current scope stack. -- Indicate that the level for this spurious entry is outside of -- the current scope stack. Level := Scope_Stack.Last; loop Scop := Scope_Stack.Table (Level).Entity; exit when Scop = Scope (E); Level := Level - 1; exit when Scop = Standard_Standard; end loop; -- Now search remainder of homonym chain for more inner entry -- If the entity is Standard itself, it has no scope, and we -- compare it with the stack entry directly. E2 := Homonym (E); while Present (E2) loop if Is_Immediately_Visible (E2) then -- If a generic package contains a local declaration that -- has the same name as the generic, there may be a visibility -- conflict in an instance, where the local declaration must -- also hide the name of the corresponding package renaming. -- We check explicitly for a package declared by a renaming, -- whose renamed entity is an instance that is on the scope -- stack, and that contains a homonym in the same scope. Once -- we have found it, we know that the package renaming is not -- immediately visible, and that the identifier denotes the -- other entity (and its homonyms if overloaded). if Scope (E) = Scope (E2) and then Ekind (E) = E_Package and then Present (Renamed_Object (E)) and then Is_Generic_Instance (Renamed_Object (E)) and then In_Open_Scopes (Renamed_Object (E)) and then Comes_From_Source (N) then Set_Is_Immediately_Visible (E, False); E := E2; else for J in Level + 1 .. Scope_Stack.Last loop if Scope_Stack.Table (J).Entity = Scope (E2) or else Scope_Stack.Table (J).Entity = E2 then Level := J; E := E2; exit; end if; end loop; end if; end if; E2 := Homonym (E2); end loop; -- At the end of that loop, E is the innermost immediately -- visible entity, so we are all set. end; -- Come here with entity found, and stored in E <<Found>> begin -- Check violation of No_Wide_Characters restriction Check_Wide_Character_Restriction (E, N); -- When distribution features are available (Get_PCS_Name /= -- Name_No_DSA), a remote access-to-subprogram type is converted -- into a record type holding whatever information is needed to -- perform a remote call on an RCI subprogram. In that case we -- rewrite any occurrence of the RAS type into the equivalent record -- type here. 'Access attribute references and RAS dereferences are -- then implemented using specific TSSs. However when distribution is -- not available (case of Get_PCS_Name = Name_No_DSA), we bypass the -- generation of these TSSs, and we must keep the RAS type in its -- original access-to-subprogram form (since all calls through a -- value of such type will be local anyway in the absence of a PCS). if Comes_From_Source (N) and then Is_Remote_Access_To_Subprogram_Type (E) and then Ekind (E) = E_Access_Subprogram_Type and then Expander_Active and then Get_PCS_Name /= Name_No_DSA then Rewrite (N, New_Occurrence_Of (Equivalent_Type (E), Sloc (N))); goto Done; end if; -- Set the entity. Note that the reason we call Set_Entity for the -- overloadable case, as opposed to Set_Entity_With_Checks is -- that in the overloaded case, the initial call can set the wrong -- homonym. The call that sets the right homonym is in Sem_Res and -- that call does use Set_Entity_With_Checks, so we don't miss -- a style check. if Is_Overloadable (E) then Set_Entity (N, E); else Set_Entity_With_Checks (N, E); end if; if Is_Type (E) then Set_Etype (N, E); else Set_Etype (N, Get_Full_View (Etype (E))); end if; if Debug_Flag_E then Write_Str (" found "); Write_Entity_Info (E, " "); end if; -- If the Ekind of the entity is Void, it means that all homonyms -- are hidden from all visibility (RM 8.3(5,14-20)). However, this -- test is skipped if the current scope is a record and the name is -- a pragma argument expression (case of Atomic and Volatile pragmas -- and possibly other similar pragmas added later, which are allowed -- to reference components in the current record). if Ekind (E) = E_Void and then (not Is_Record_Type (Current_Scope) or else Nkind (Parent (N)) /= N_Pragma_Argument_Association) then Premature_Usage (N); -- If the entity is overloadable, collect all interpretations of the -- name for subsequent overload resolution. We optimize a bit here to -- do this only if we have an overloadable entity that is not on its -- own on the homonym chain. elsif Is_Overloadable (E) and then (Present (Homonym (E)) or else Current_Entity (N) /= E) then Collect_Interps (N); -- If no homonyms were visible, the entity is unambiguous if not Is_Overloaded (N) then if not Is_Actual_Parameter then Generate_Reference (E, N); end if; end if; -- Case of non-overloadable entity, set the entity providing that -- we do not have the case of a discriminant reference within a -- default expression. Such references are replaced with the -- corresponding discriminal, which is the formal corresponding to -- to the discriminant in the initialization procedure. else -- Entity is unambiguous, indicate that it is referenced here -- For a renaming of an object, always generate simple reference, -- we don't try to keep track of assignments in this case, except -- in SPARK mode where renamings are traversed for generating -- local effects of subprograms. if Is_Object (E) and then Present (Renamed_Object (E)) and then not GNATprove_Mode then Generate_Reference (E, N); -- If the renamed entity is a private protected component, -- reference the original component as well. This needs to be -- done because the private renamings are installed before any -- analysis has occurred. Reference to a private component will -- resolve to the renaming and the original component will be -- left unreferenced, hence the following. if Is_Prival (E) then Generate_Reference (Prival_Link (E), N); end if; -- One odd case is that we do not want to set the Referenced flag -- if the entity is a label, and the identifier is the label in -- the source, since this is not a reference from the point of -- view of the user. elsif Nkind (Parent (N)) = N_Label then declare R : constant Boolean := Referenced (E); begin -- Generate reference unless this is an actual parameter -- (see comment below). if not Is_Actual_Parameter then Generate_Reference (E, N); Set_Referenced (E, R); end if; end; -- Normal case, not a label: generate reference else if not Is_Actual_Parameter then -- Package or generic package is always a simple reference if Is_Package_Or_Generic_Package (E) then Generate_Reference (E, N, 'r'); -- Else see if we have a left hand side else case Is_LHS (N) is when Yes => Generate_Reference (E, N, 'm'); when No => Generate_Reference (E, N, 'r'); -- If we don't know now, generate reference later when Unknown => Defer_Reference ((E, N)); end case; end if; end if; end if; Set_Entity_Or_Discriminal (N, E); -- The name may designate a generalized reference, in which case -- the dereference interpretation will be included. Context is -- one in which a name is legal. if Ada_Version >= Ada_2012 and then (Nkind (Parent (N)) in N_Subexpr or else Nkind (Parent (N)) in N_Assignment_Statement | N_Object_Declaration | N_Parameter_Association) then Check_Implicit_Dereference (N, Etype (E)); end if; end if; end; -- Mark relevant use-type and use-package clauses as effective if the -- node in question is not overloaded and therefore does not require -- resolution. -- -- Note: Generic actual subprograms do not follow the normal resolution -- path, so ignore the fact that they are overloaded and mark them -- anyway. if Nkind (N) not in N_Subexpr or else not Is_Overloaded (N) then Mark_Use_Clauses (N); end if; -- Come here with entity set <<Done>> Check_Restriction_No_Use_Of_Entity (N); -- Annotate the tree by creating a variable reference marker in case the -- original variable reference is folded or optimized away. The variable -- reference marker is automatically saved for later examination by the -- ABE Processing phase. Variable references which act as actuals in a -- call require special processing and are left to Resolve_Actuals. The -- reference is a write when it appears on the left hand side of an -- assignment. if Needs_Variable_Reference_Marker (N => N, Calls_OK => False) then declare Is_Assignment_LHS : constant Boolean := Is_LHS (N) = Yes; begin Build_Variable_Reference_Marker (N => N, Read => not Is_Assignment_LHS, Write => Is_Assignment_LHS); end; end if; end Find_Direct_Name; ------------------------ -- Find_Expanded_Name -- ------------------------ -- This routine searches the homonym chain of the entity until it finds -- an entity declared in the scope denoted by the prefix. If the entity -- is private, it may nevertheless be immediately visible, if we are in -- the scope of its declaration. procedure Find_Expanded_Name (N : Node_Id) is function In_Abstract_View_Pragma (Nod : Node_Id) return Boolean; -- Determine whether expanded name Nod appears within a pragma which is -- a suitable context for an abstract view of a state or variable. The -- following pragmas fall in this category: -- Depends -- Global -- Initializes -- Refined_Depends -- Refined_Global -- -- In addition, pragma Abstract_State is also considered suitable even -- though it is an illegal context for an abstract view as this allows -- for proper resolution of abstract views of variables. This illegal -- context is later flagged in the analysis of indicator Part_Of. ----------------------------- -- In_Abstract_View_Pragma -- ----------------------------- function In_Abstract_View_Pragma (Nod : Node_Id) return Boolean is Par : Node_Id; begin -- Climb the parent chain looking for a pragma Par := Nod; while Present (Par) loop if Nkind (Par) = N_Pragma then if Pragma_Name_Unmapped (Par) in Name_Abstract_State | Name_Depends | Name_Global | Name_Initializes | Name_Refined_Depends | Name_Refined_Global then return True; -- Otherwise the pragma is not a legal context for an abstract -- view. else exit; end if; -- Prevent the search from going too far elsif Is_Body_Or_Package_Declaration (Par) then exit; end if; Par := Parent (Par); end loop; return False; end In_Abstract_View_Pragma; -- Local variables Selector : constant Node_Id := Selector_Name (N); Candidate : Entity_Id := Empty; P_Name : Entity_Id; Id : Entity_Id; -- Start of processing for Find_Expanded_Name begin P_Name := Entity (Prefix (N)); -- If the prefix is a renamed package, look for the entity in the -- original package. if Ekind (P_Name) = E_Package and then Present (Renamed_Object (P_Name)) then P_Name := Renamed_Object (P_Name); -- Rewrite node with entity field pointing to renamed object Rewrite (Prefix (N), New_Copy (Prefix (N))); Set_Entity (Prefix (N), P_Name); -- If the prefix is an object of a concurrent type, look for -- the entity in the associated task or protected type. elsif Is_Concurrent_Type (Etype (P_Name)) then P_Name := Etype (P_Name); end if; Id := Current_Entity (Selector); declare Is_New_Candidate : Boolean; begin while Present (Id) loop if Scope (Id) = P_Name then Candidate := Id; Is_New_Candidate := True; -- Handle abstract views of states and variables. These are -- acceptable candidates only when the reference to the view -- appears in certain pragmas. if Ekind (Id) = E_Abstract_State and then From_Limited_With (Id) and then Present (Non_Limited_View (Id)) then if In_Abstract_View_Pragma (N) then Candidate := Non_Limited_View (Id); Is_New_Candidate := True; -- Hide the candidate because it is not used in a proper -- context. else Candidate := Empty; Is_New_Candidate := False; end if; end if; -- Ada 2005 (AI-217): Handle shadow entities associated with -- types declared in limited-withed nested packages. We don't need -- to handle E_Incomplete_Subtype entities because the entities -- in the limited view are always E_Incomplete_Type and -- E_Class_Wide_Type entities (see Build_Limited_Views). -- Regarding the expression used to evaluate the scope, it -- is important to note that the limited view also has shadow -- entities associated nested packages. For this reason the -- correct scope of the entity is the scope of the real entity. -- The non-limited view may itself be incomplete, in which case -- get the full view if available. elsif Ekind (Id) in E_Incomplete_Type | E_Class_Wide_Type and then From_Limited_With (Id) and then Present (Non_Limited_View (Id)) and then Scope (Non_Limited_View (Id)) = P_Name then Candidate := Get_Full_View (Non_Limited_View (Id)); Is_New_Candidate := True; -- An unusual case arises with a fully qualified name for an -- entity local to a generic child unit package, within an -- instantiation of that package. The name of the unit now -- denotes the renaming created within the instance. This is -- only relevant in an instance body, see below. elsif Is_Generic_Instance (Scope (Id)) and then In_Open_Scopes (Scope (Id)) and then In_Instance_Body and then Ekind (Scope (Id)) = E_Package and then Ekind (Id) = E_Package and then Renamed_Entity (Id) = Scope (Id) and then Is_Immediately_Visible (P_Name) then Is_New_Candidate := True; else Is_New_Candidate := False; end if; if Is_New_Candidate then -- If entity is a child unit, either it is a visible child of -- the prefix, or we are in the body of a generic prefix, as -- will happen when a child unit is instantiated in the body -- of a generic parent. This is because the instance body does -- not restore the full compilation context, given that all -- non-local references have been captured. if Is_Child_Unit (Id) or else P_Name = Standard_Standard then exit when Is_Visible_Lib_Unit (Id) or else (Is_Child_Unit (Id) and then In_Open_Scopes (Scope (Id)) and then In_Instance_Body); else exit when not Is_Hidden (Id); end if; exit when Is_Immediately_Visible (Id); end if; Id := Homonym (Id); end loop; end; if No (Id) and then Ekind (P_Name) in E_Procedure | E_Function and then Is_Generic_Instance (P_Name) then -- Expanded name denotes entity in (instance of) generic subprogram. -- The entity may be in the subprogram instance, or may denote one of -- the formals, which is declared in the enclosing wrapper package. P_Name := Scope (P_Name); Id := Current_Entity (Selector); while Present (Id) loop exit when Scope (Id) = P_Name; Id := Homonym (Id); end loop; end if; if No (Id) or else Chars (Id) /= Chars (Selector) then Set_Etype (N, Any_Type); -- If we are looking for an entity defined in System, try to find it -- in the child package that may have been provided as an extension -- to System. The Extend_System pragma will have supplied the name of -- the extension, which may have to be loaded. if Chars (P_Name) = Name_System and then Scope (P_Name) = Standard_Standard and then Present (System_Extend_Unit) and then Present_System_Aux (N) then Set_Entity (Prefix (N), System_Aux_Id); Find_Expanded_Name (N); return; -- There is an implicit instance of the predefined operator in -- the given scope. The operator entity is defined in Standard. -- Has_Implicit_Operator makes the node into an Expanded_Name. elsif Nkind (Selector) = N_Operator_Symbol and then Has_Implicit_Operator (N) then return; -- If there is no literal defined in the scope denoted by the -- prefix, the literal may belong to (a type derived from) -- Standard_Character, for which we have no explicit literals. elsif Nkind (Selector) = N_Character_Literal and then Has_Implicit_Character_Literal (N) then return; else -- If the prefix is a single concurrent object, use its name in -- the error message, rather than that of the anonymous type. if Is_Concurrent_Type (P_Name) and then Is_Internal_Name (Chars (P_Name)) then Error_Msg_Node_2 := Entity (Prefix (N)); else Error_Msg_Node_2 := P_Name; end if; if P_Name = System_Aux_Id then P_Name := Scope (P_Name); Set_Entity (Prefix (N), P_Name); end if; if Present (Candidate) then -- If we know that the unit is a child unit we can give a more -- accurate error message. if Is_Child_Unit (Candidate) then -- If the candidate is a private child unit and we are in -- the visible part of a public unit, specialize the error -- message. There might be a private with_clause for it, -- but it is not currently active. if Is_Private_Descendant (Candidate) and then Ekind (Current_Scope) = E_Package and then not In_Private_Part (Current_Scope) and then not Is_Private_Descendant (Current_Scope) then Error_Msg_N ("private child unit& is not visible here", Selector); -- Normal case where we have a missing with for a child unit else Error_Msg_Qual_Level := 99; Error_Msg_NE -- CODEFIX ("missing `WITH &;`", Selector, Candidate); Error_Msg_Qual_Level := 0; end if; -- Here we don't know that this is a child unit else Error_Msg_NE ("& is not a visible entity of&", N, Selector); end if; else -- Within the instantiation of a child unit, the prefix may -- denote the parent instance, but the selector has the name -- of the original child. That is to say, when A.B appears -- within an instantiation of generic child unit B, the scope -- stack includes an instance of A (P_Name) and an instance -- of B under some other name. We scan the scope to find this -- child instance, which is the desired entity. -- Note that the parent may itself be a child instance, if -- the reference is of the form A.B.C, in which case A.B has -- already been rewritten with the proper entity. if In_Open_Scopes (P_Name) and then Is_Generic_Instance (P_Name) then declare Gen_Par : constant Entity_Id := Generic_Parent (Specification (Unit_Declaration_Node (P_Name))); S : Entity_Id := Current_Scope; P : Entity_Id; begin for J in reverse 0 .. Scope_Stack.Last loop S := Scope_Stack.Table (J).Entity; exit when S = Standard_Standard; if Ekind (S) in E_Function | E_Package | E_Procedure then P := Generic_Parent (Specification (Unit_Declaration_Node (S))); -- Check that P is a generic child of the generic -- parent of the prefix. if Present (P) and then Chars (P) = Chars (Selector) and then Scope (P) = Gen_Par then Id := S; goto Found; end if; end if; end loop; end; end if; -- If this is a selection from Ada, System or Interfaces, then -- we assume a missing with for the corresponding package. if Is_Known_Unit (N) and then not (Present (Entity (Prefix (N))) and then Scope (Entity (Prefix (N))) /= Standard_Standard) then if not Error_Posted (N) then Error_Msg_Node_2 := Selector; Error_Msg_N -- CODEFIX ("missing `WITH &.&;`", Prefix (N)); end if; -- If this is a selection from a dummy package, then suppress -- the error message, of course the entity is missing if the -- package is missing. elsif Sloc (Error_Msg_Node_2) = No_Location then null; -- Here we have the case of an undefined component else -- The prefix may hide a homonym in the context that -- declares the desired entity. This error can use a -- specialized message. if In_Open_Scopes (P_Name) then declare H : constant Entity_Id := Homonym (P_Name); begin if Present (H) and then Is_Compilation_Unit (H) and then (Is_Immediately_Visible (H) or else Is_Visible_Lib_Unit (H)) then Id := First_Entity (H); while Present (Id) loop if Chars (Id) = Chars (Selector) then Error_Msg_Qual_Level := 99; Error_Msg_Name_1 := Chars (Selector); Error_Msg_NE ("% not declared in&", N, P_Name); Error_Msg_NE ("\use fully qualified name starting with " & "Standard to make& visible", N, H); Error_Msg_Qual_Level := 0; goto Done; end if; Next_Entity (Id); end loop; end if; -- If not found, standard error message Error_Msg_NE ("& not declared in&", N, Selector); <<Done>> null; end; else -- Might be worth specializing the case when the prefix -- is a limited view. -- ... not declared in limited view of... Error_Msg_NE ("& not declared in&", N, Selector); end if; -- Check for misspelling of some entity in prefix Id := First_Entity (P_Name); while Present (Id) loop if Is_Bad_Spelling_Of (Chars (Id), Chars (Selector)) and then not Is_Internal_Name (Chars (Id)) then Error_Msg_NE -- CODEFIX ("possible misspelling of&", Selector, Id); exit; end if; Next_Entity (Id); end loop; -- Specialize the message if this may be an instantiation -- of a child unit that was not mentioned in the context. if Nkind (Parent (N)) = N_Package_Instantiation and then Is_Generic_Instance (Entity (Prefix (N))) and then Is_Compilation_Unit (Generic_Parent (Parent (Entity (Prefix (N))))) then Error_Msg_Node_2 := Selector; Error_Msg_N -- CODEFIX ("\missing `WITH &.&;`", Prefix (N)); end if; end if; end if; Id := Any_Id; end if; end if; <<Found>> if Comes_From_Source (N) and then Is_Remote_Access_To_Subprogram_Type (Id) and then Ekind (Id) = E_Access_Subprogram_Type and then Present (Equivalent_Type (Id)) then -- If we are not actually generating distribution code (i.e. the -- current PCS is the dummy non-distributed version), then the -- Equivalent_Type will be missing, and Id should be treated as -- a regular access-to-subprogram type. Id := Equivalent_Type (Id); Set_Chars (Selector, Chars (Id)); end if; -- Ada 2005 (AI-50217): Check usage of entities in limited withed units if Ekind (P_Name) = E_Package and then From_Limited_With (P_Name) then if From_Limited_With (Id) or else Is_Type (Id) or else Ekind (Id) = E_Package then null; else Error_Msg_N ("limited withed package can only be used to access incomplete " & "types", N); end if; end if; if Is_Task_Type (P_Name) and then ((Ekind (Id) = E_Entry and then Nkind (Parent (N)) /= N_Attribute_Reference) or else (Ekind (Id) = E_Entry_Family and then Nkind (Parent (Parent (N))) /= N_Attribute_Reference)) then -- If both the task type and the entry are in scope, this may still -- be the expanded name of an entry formal. if In_Open_Scopes (Id) and then Nkind (Parent (N)) = N_Selected_Component then null; else -- It is an entry call after all, either to the current task -- (which will deadlock) or to an enclosing task. Analyze_Selected_Component (N); return; end if; end if; Change_Selected_Component_To_Expanded_Name (N); -- Preserve relevant elaboration-related attributes of the context which -- are no longer available or very expensive to recompute once analysis, -- resolution, and expansion are over. Mark_Elaboration_Attributes (N_Id => N, Checks => True, Modes => True, Warnings => True); -- Set appropriate type if Is_Type (Id) then Set_Etype (N, Id); else Set_Etype (N, Get_Full_View (Etype (Id))); end if; -- Do style check and generate reference, but skip both steps if this -- entity has homonyms, since we may not have the right homonym set yet. -- The proper homonym will be set during the resolve phase. if Has_Homonym (Id) then Set_Entity (N, Id); else Set_Entity_Or_Discriminal (N, Id); case Is_LHS (N) is when Yes => Generate_Reference (Id, N, 'm'); when No => Generate_Reference (Id, N, 'r'); when Unknown => Defer_Reference ((Id, N)); end case; end if; -- Check for violation of No_Wide_Characters Check_Wide_Character_Restriction (Id, N); -- If the Ekind of the entity is Void, it means that all homonyms are -- hidden from all visibility (RM 8.3(5,14-20)). if Ekind (Id) = E_Void then Premature_Usage (N); elsif Is_Overloadable (Id) and then Present (Homonym (Id)) then declare H : Entity_Id := Homonym (Id); begin while Present (H) loop if Scope (H) = Scope (Id) and then (not Is_Hidden (H) or else Is_Immediately_Visible (H)) then Collect_Interps (N); exit; end if; H := Homonym (H); end loop; -- If an extension of System is present, collect possible explicit -- overloadings declared in the extension. if Chars (P_Name) = Name_System and then Scope (P_Name) = Standard_Standard and then Present (System_Extend_Unit) and then Present_System_Aux (N) then H := Current_Entity (Id); while Present (H) loop if Scope (H) = System_Aux_Id then Add_One_Interp (N, H, Etype (H)); end if; H := Homonym (H); end loop; end if; end; end if; if Nkind (Selector_Name (N)) = N_Operator_Symbol and then Scope (Id) /= Standard_Standard then -- In addition to user-defined operators in the given scope, there -- may be an implicit instance of the predefined operator. The -- operator (defined in Standard) is found in Has_Implicit_Operator, -- and added to the interpretations. Procedure Add_One_Interp will -- determine which hides which. if Has_Implicit_Operator (N) then null; end if; end if; -- If there is a single interpretation for N we can generate a -- reference to the unique entity found. if Is_Overloadable (Id) and then not Is_Overloaded (N) then Generate_Reference (Id, N); end if; -- Mark relevant use-type and use-package clauses as effective if the -- node in question is not overloaded and therefore does not require -- resolution. if Nkind (N) not in N_Subexpr or else not Is_Overloaded (N) then Mark_Use_Clauses (N); end if; Check_Restriction_No_Use_Of_Entity (N); -- Annotate the tree by creating a variable reference marker in case the -- original variable reference is folded or optimized away. The variable -- reference marker is automatically saved for later examination by the -- ABE Processing phase. Variable references which act as actuals in a -- call require special processing and are left to Resolve_Actuals. The -- reference is a write when it appears on the left hand side of an -- assignment. if Needs_Variable_Reference_Marker (N => N, Calls_OK => False) then declare Is_Assignment_LHS : constant Boolean := Is_LHS (N) = Yes; begin Build_Variable_Reference_Marker (N => N, Read => not Is_Assignment_LHS, Write => Is_Assignment_LHS); end; end if; end Find_Expanded_Name; -------------------- -- Find_Most_Prev -- -------------------- function Find_Most_Prev (Use_Clause : Node_Id) return Node_Id is Curr : Node_Id; begin -- Loop through the Prev_Use_Clause chain Curr := Use_Clause; while Present (Prev_Use_Clause (Curr)) loop Curr := Prev_Use_Clause (Curr); end loop; return Curr; end Find_Most_Prev; ------------------------- -- Find_Renamed_Entity -- ------------------------- function Find_Renamed_Entity (N : Node_Id; Nam : Node_Id; New_S : Entity_Id; Is_Actual : Boolean := False) return Entity_Id is Ind : Interp_Index; I1 : Interp_Index := 0; -- Suppress junk warnings It : Interp; It1 : Interp; Old_S : Entity_Id; Inst : Entity_Id; function Find_Nearer_Entity (New_S : Entity_Id; Old1_S : Entity_Id; Old2_S : Entity_Id) return Entity_Id; -- Determine whether one of Old_S1 and Old_S2 is nearer to New_S than -- the other, and return it if so. Return Empty otherwise. We use this -- in conjunction with Inherit_Renamed_Profile to simplify later type -- disambiguation for actual subprograms in instances. function Is_Visible_Operation (Op : Entity_Id) return Boolean; -- If the renamed entity is an implicit operator, check whether it is -- visible because its operand type is properly visible. This check -- applies to explicit renamed entities that appear in the source in a -- renaming declaration or a formal subprogram instance, but not to -- default generic actuals with a name. function Report_Overload return Entity_Id; -- List possible interpretations, and specialize message in the -- case of a generic actual. function Within (Inner, Outer : Entity_Id) return Boolean; -- Determine whether a candidate subprogram is defined within the -- enclosing instance. If yes, it has precedence over outer candidates. -------------------------- -- Find_Nearer_Entity -- -------------------------- function Find_Nearer_Entity (New_S : Entity_Id; Old1_S : Entity_Id; Old2_S : Entity_Id) return Entity_Id is New_F : Entity_Id; Old1_F : Entity_Id; Old2_F : Entity_Id; Anc_T : Entity_Id; begin New_F := First_Formal (New_S); Old1_F := First_Formal (Old1_S); Old2_F := First_Formal (Old2_S); -- The criterion is whether the type of the formals of one of Old1_S -- and Old2_S is an ancestor subtype of the type of the corresponding -- formals of New_S while the other is not (we already know that they -- are all subtypes of the same base type). -- This makes it possible to find the more correct renamed entity in -- the case of a generic instantiation nested in an enclosing one for -- which different formal types get the same actual type, which will -- in turn make it possible for Inherit_Renamed_Profile to preserve -- types on formal parameters and ultimately simplify disambiguation. -- Consider the follow package G: -- generic -- type Item_T is private; -- with function Compare (L, R: Item_T) return Boolean is <>; -- type Bound_T is private; -- with function Compare (L, R : Bound_T) return Boolean is <>; -- package G is -- ... -- end G; -- package body G is -- package My_Inner is Inner_G (Bound_T); -- ... -- end G; -- with the following package Inner_G: -- generic -- type T is private; -- with function Compare (L, R: T) return Boolean is <>; -- package Inner_G is -- function "<" (L, R: T) return Boolean is (Compare (L, R)); -- end Inner_G; -- If G is instantiated on the same actual type with a single Compare -- function: -- type T is ... -- function Compare (L, R : T) return Boolean; -- package My_G is new (T, T); -- then the renaming generated for Compare in the inner instantiation -- is ambiguous: it can rename either of the renamings generated for -- the outer instantiation. Now if the first one is picked up, then -- the subtypes of the formal parameters of the renaming will not be -- preserved in Inherit_Renamed_Profile because they are subtypes of -- the Bound_T formal type and not of the Item_T formal type, so we -- need to arrange for the second one to be picked up instead. while Present (New_F) loop if Etype (Old1_F) /= Etype (Old2_F) then Anc_T := Ancestor_Subtype (Etype (New_F)); if Etype (Old1_F) = Anc_T then return Old1_S; elsif Etype (Old2_F) = Anc_T then return Old2_S; end if; end if; Next_Formal (New_F); Next_Formal (Old1_F); Next_Formal (Old2_F); end loop; pragma Assert (No (Old1_F)); pragma Assert (No (Old2_F)); return Empty; end Find_Nearer_Entity; -------------------------- -- Is_Visible_Operation -- -------------------------- function Is_Visible_Operation (Op : Entity_Id) return Boolean is Scop : Entity_Id; Typ : Entity_Id; Btyp : Entity_Id; begin if Ekind (Op) /= E_Operator or else Scope (Op) /= Standard_Standard or else (In_Instance and then (not Is_Actual or else Present (Enclosing_Instance))) then return True; else -- For a fixed point type operator, check the resulting type, -- because it may be a mixed mode integer * fixed operation. if Present (Next_Formal (First_Formal (New_S))) and then Is_Fixed_Point_Type (Etype (New_S)) then Typ := Etype (New_S); else Typ := Etype (First_Formal (New_S)); end if; Btyp := Base_Type (Typ); if Nkind (Nam) /= N_Expanded_Name then return (In_Open_Scopes (Scope (Btyp)) or else Is_Potentially_Use_Visible (Btyp) or else In_Use (Btyp) or else In_Use (Scope (Btyp))); else Scop := Entity (Prefix (Nam)); if Ekind (Scop) = E_Package and then Present (Renamed_Object (Scop)) then Scop := Renamed_Object (Scop); end if; -- Operator is visible if prefix of expanded name denotes -- scope of type, or else type is defined in System_Aux -- and the prefix denotes System. return Scope (Btyp) = Scop or else (Scope (Btyp) = System_Aux_Id and then Scope (Scope (Btyp)) = Scop); end if; end if; end Is_Visible_Operation; ------------ -- Within -- ------------ function Within (Inner, Outer : Entity_Id) return Boolean is Sc : Entity_Id; begin Sc := Scope (Inner); while Sc /= Standard_Standard loop if Sc = Outer then return True; else Sc := Scope (Sc); end if; end loop; return False; end Within; --------------------- -- Report_Overload -- --------------------- function Report_Overload return Entity_Id is begin if Is_Actual then Error_Msg_NE -- CODEFIX ("ambiguous actual subprogram&, " & "possible interpretations:", N, Nam); else Error_Msg_N -- CODEFIX ("ambiguous subprogram, " & "possible interpretations:", N); end if; List_Interps (Nam, N); return Old_S; end Report_Overload; -- Start of processing for Find_Renamed_Entity begin Old_S := Any_Id; Candidate_Renaming := Empty; if Is_Overloaded (Nam) then Get_First_Interp (Nam, Ind, It); while Present (It.Nam) loop if Entity_Matches_Spec (It.Nam, New_S) and then Is_Visible_Operation (It.Nam) then if Old_S /= Any_Id then -- Note: The call to Disambiguate only happens if a -- previous interpretation was found, in which case I1 -- has received a value. It1 := Disambiguate (Nam, I1, Ind, Etype (Old_S)); if It1 = No_Interp then Inst := Enclosing_Instance; if Present (Inst) then if Within (It.Nam, Inst) then if Within (Old_S, Inst) then declare It_D : constant Uint := Scope_Depth (It.Nam); Old_D : constant Uint := Scope_Depth (Old_S); N_Ent : Entity_Id; begin -- Choose the innermost subprogram, which -- would hide the outer one in the generic. if Old_D > It_D then return Old_S; elsif It_D > Old_D then return It.Nam; end if; -- Otherwise, if we can determine that one -- of the entities is nearer to the renaming -- than the other, choose it. If not, then -- return the newer one as done historically. N_Ent := Find_Nearer_Entity (New_S, Old_S, It.Nam); if Present (N_Ent) then return N_Ent; else return It.Nam; end if; end; end if; elsif Within (Old_S, Inst) then return Old_S; else return Report_Overload; end if; -- If not within an instance, ambiguity is real else return Report_Overload; end if; else Old_S := It1.Nam; exit; end if; else I1 := Ind; Old_S := It.Nam; end if; elsif Present (First_Formal (It.Nam)) and then Present (First_Formal (New_S)) and then (Base_Type (Etype (First_Formal (It.Nam))) = Base_Type (Etype (First_Formal (New_S)))) then Candidate_Renaming := It.Nam; end if; Get_Next_Interp (Ind, It); end loop; Set_Entity (Nam, Old_S); if Old_S /= Any_Id then Set_Is_Overloaded (Nam, False); end if; -- Non-overloaded case else if Is_Actual and then Present (Enclosing_Instance) and then Entity_Matches_Spec (Entity (Nam), New_S) then Old_S := Entity (Nam); elsif Entity_Matches_Spec (Entity (Nam), New_S) then Candidate_Renaming := New_S; if Is_Visible_Operation (Entity (Nam)) then Old_S := Entity (Nam); end if; elsif Present (First_Formal (Entity (Nam))) and then Present (First_Formal (New_S)) and then (Base_Type (Etype (First_Formal (Entity (Nam)))) = Base_Type (Etype (First_Formal (New_S)))) then Candidate_Renaming := Entity (Nam); end if; end if; return Old_S; end Find_Renamed_Entity; ----------------------------- -- Find_Selected_Component -- ----------------------------- procedure Find_Selected_Component (N : Node_Id) is P : constant Node_Id := Prefix (N); P_Name : Entity_Id; -- Entity denoted by prefix P_Type : Entity_Id; -- and its type Nam : Node_Id; function Available_Subtype return Boolean; -- A small optimization: if the prefix is constrained and the component -- is an array type we may already have a usable subtype for it, so we -- can use it rather than generating a new one, because the bounds -- will be the values of the discriminants and not discriminant refs. -- This simplifies value tracing in GNATprove. For consistency, both -- the entity name and the subtype come from the constrained component. -- This is only used in GNATprove mode: when generating code it may be -- necessary to create an itype in the scope of use of the selected -- component, e.g. in the context of a expanded record equality. function Is_Reference_In_Subunit return Boolean; -- In a subunit, the scope depth is not a proper measure of hiding, -- because the context of the proper body may itself hide entities in -- parent units. This rare case requires inspecting the tree directly -- because the proper body is inserted in the main unit and its context -- is simply added to that of the parent. ----------------------- -- Available_Subtype -- ----------------------- function Available_Subtype return Boolean is Comp : Entity_Id; begin if GNATprove_Mode then Comp := First_Entity (Etype (P)); while Present (Comp) loop if Chars (Comp) = Chars (Selector_Name (N)) then Set_Etype (N, Etype (Comp)); Set_Entity (Selector_Name (N), Comp); Set_Etype (Selector_Name (N), Etype (Comp)); return True; end if; Next_Component (Comp); end loop; end if; return False; end Available_Subtype; ----------------------------- -- Is_Reference_In_Subunit -- ----------------------------- function Is_Reference_In_Subunit return Boolean is Clause : Node_Id; Comp_Unit : Node_Id; begin Comp_Unit := N; while Present (Comp_Unit) and then Nkind (Comp_Unit) /= N_Compilation_Unit loop Comp_Unit := Parent (Comp_Unit); end loop; if No (Comp_Unit) or else Nkind (Unit (Comp_Unit)) /= N_Subunit then return False; end if; -- Now check whether the package is in the context of the subunit Clause := First (Context_Items (Comp_Unit)); while Present (Clause) loop if Nkind (Clause) = N_With_Clause and then Entity (Name (Clause)) = P_Name then return True; end if; Next (Clause); end loop; return False; end Is_Reference_In_Subunit; -- Start of processing for Find_Selected_Component begin Analyze (P); if Nkind (P) = N_Error then return; end if; -- If the selector already has an entity, the node has been constructed -- in the course of expansion, and is known to be valid. Do not verify -- that it is defined for the type (it may be a private component used -- in the expansion of record equality). if Present (Entity (Selector_Name (N))) then if No (Etype (N)) or else Etype (N) = Any_Type then declare Sel_Name : constant Node_Id := Selector_Name (N); Selector : constant Entity_Id := Entity (Sel_Name); C_Etype : Node_Id; begin Set_Etype (Sel_Name, Etype (Selector)); if not Is_Entity_Name (P) then Resolve (P); end if; -- Build an actual subtype except for the first parameter -- of an init proc, where this actual subtype is by -- definition incorrect, since the object is uninitialized -- (and does not even have defined discriminants etc.) if Is_Entity_Name (P) and then Ekind (Entity (P)) = E_Function then Nam := New_Copy (P); if Is_Overloaded (P) then Save_Interps (P, Nam); end if; Rewrite (P, Make_Function_Call (Sloc (P), Name => Nam)); Analyze_Call (P); Analyze_Selected_Component (N); return; elsif Ekind (Selector) = E_Component and then (not Is_Entity_Name (P) or else Chars (Entity (P)) /= Name_uInit) then -- Check if we already have an available subtype we can use if Ekind (Etype (P)) = E_Record_Subtype and then Nkind (Parent (Etype (P))) = N_Subtype_Declaration and then Is_Array_Type (Etype (Selector)) and then not Is_Packed (Etype (Selector)) and then Available_Subtype then return; -- Do not build the subtype when referencing components of -- dispatch table wrappers. Required to avoid generating -- elaboration code with HI runtimes. elsif RTU_Loaded (Ada_Tags) and then ((RTE_Available (RE_Dispatch_Table_Wrapper) and then Scope (Selector) = RTE (RE_Dispatch_Table_Wrapper)) or else (RTE_Available (RE_No_Dispatch_Table_Wrapper) and then Scope (Selector) = RTE (RE_No_Dispatch_Table_Wrapper))) then C_Etype := Empty; else C_Etype := Build_Actual_Subtype_Of_Component (Etype (Selector), N); end if; else C_Etype := Empty; end if; if No (C_Etype) then C_Etype := Etype (Selector); else Insert_Action (N, C_Etype); C_Etype := Defining_Identifier (C_Etype); end if; Set_Etype (N, C_Etype); end; -- If the selected component appears within a default expression -- and it has an actual subtype, the preanalysis has not yet -- completed its analysis, because Insert_Actions is disabled in -- that context. Within the init proc of the enclosing type we -- must complete this analysis, if an actual subtype was created. elsif Inside_Init_Proc then declare Typ : constant Entity_Id := Etype (N); Decl : constant Node_Id := Declaration_Node (Typ); begin if Nkind (Decl) = N_Subtype_Declaration and then not Analyzed (Decl) and then Is_List_Member (Decl) and then No (Parent (Decl)) then Remove (Decl); Insert_Action (N, Decl); end if; end; end if; return; elsif Is_Entity_Name (P) then P_Name := Entity (P); -- The prefix may denote an enclosing type which is the completion -- of an incomplete type declaration. if Is_Type (P_Name) then Set_Entity (P, Get_Full_View (P_Name)); Set_Etype (P, Entity (P)); P_Name := Entity (P); end if; P_Type := Base_Type (Etype (P)); if Debug_Flag_E then Write_Str ("Found prefix type to be "); Write_Entity_Info (P_Type, " "); Write_Eol; end if; -- If the prefix's type is an access type, get to the record type if Is_Access_Type (P_Type) then P_Type := Implicitly_Designated_Type (P_Type); end if; -- First check for components of a record object (not the -- result of a call, which is handled below). if Has_Components (P_Type) and then not Is_Overloadable (P_Name) and then not Is_Type (P_Name) then -- Selected component of record. Type checking will validate -- name of selector. -- ??? Could we rewrite an implicit dereference into an explicit -- one here? Analyze_Selected_Component (N); -- Reference to type name in predicate/invariant expression elsif (Is_Task_Type (P_Type) or else Is_Protected_Type (P_Type)) and then not In_Open_Scopes (P_Name) and then (not Is_Concurrent_Type (Etype (P_Name)) or else not In_Open_Scopes (Etype (P_Name))) then -- Call to protected operation or entry. Type checking is -- needed on the prefix. Analyze_Selected_Component (N); elsif (In_Open_Scopes (P_Name) and then Ekind (P_Name) /= E_Void and then not Is_Overloadable (P_Name)) or else (Is_Concurrent_Type (Etype (P_Name)) and then In_Open_Scopes (Etype (P_Name))) then -- Prefix denotes an enclosing loop, block, or task, i.e. an -- enclosing construct that is not a subprogram or accept. -- A special case: a protected body may call an operation -- on an external object of the same type, in which case it -- is not an expanded name. If the prefix is the type itself, -- or the context is a single synchronized object it can only -- be interpreted as an expanded name. if Is_Concurrent_Type (Etype (P_Name)) then if Is_Type (P_Name) or else Present (Anonymous_Object (Etype (P_Name))) then Find_Expanded_Name (N); else Analyze_Selected_Component (N); return; end if; else Find_Expanded_Name (N); end if; elsif Ekind (P_Name) = E_Package then Find_Expanded_Name (N); elsif Is_Overloadable (P_Name) then -- The subprogram may be a renaming (of an enclosing scope) as -- in the case of the name of the generic within an instantiation. if Ekind (P_Name) in E_Procedure | E_Function and then Present (Alias (P_Name)) and then Is_Generic_Instance (Alias (P_Name)) then P_Name := Alias (P_Name); end if; if Is_Overloaded (P) then -- The prefix must resolve to a unique enclosing construct declare Found : Boolean := False; Ind : Interp_Index; It : Interp; begin Get_First_Interp (P, Ind, It); while Present (It.Nam) loop if In_Open_Scopes (It.Nam) then if Found then Error_Msg_N ( "prefix must be unique enclosing scope", N); Set_Entity (N, Any_Id); Set_Etype (N, Any_Type); return; else Found := True; P_Name := It.Nam; end if; end if; Get_Next_Interp (Ind, It); end loop; end; end if; if In_Open_Scopes (P_Name) then Set_Entity (P, P_Name); Set_Is_Overloaded (P, False); Find_Expanded_Name (N); else -- If no interpretation as an expanded name is possible, it -- must be a selected component of a record returned by a -- function call. Reformat prefix as a function call, the rest -- is done by type resolution. -- Error if the prefix is procedure or entry, as is P.X if Ekind (P_Name) /= E_Function and then (not Is_Overloaded (P) or else Nkind (Parent (N)) = N_Procedure_Call_Statement) then -- Prefix may mention a package that is hidden by a local -- declaration: let the user know. Scan the full homonym -- chain, the candidate package may be anywhere on it. if Present (Homonym (Current_Entity (P_Name))) then P_Name := Current_Entity (P_Name); while Present (P_Name) loop exit when Ekind (P_Name) = E_Package; P_Name := Homonym (P_Name); end loop; if Present (P_Name) then if not Is_Reference_In_Subunit then Error_Msg_Sloc := Sloc (Entity (Prefix (N))); Error_Msg_NE ("package& is hidden by declaration#", N, P_Name); end if; Set_Entity (Prefix (N), P_Name); Find_Expanded_Name (N); return; else P_Name := Entity (Prefix (N)); end if; end if; Error_Msg_NE ("invalid prefix in selected component&", N, P_Name); Change_Selected_Component_To_Expanded_Name (N); Set_Entity (N, Any_Id); Set_Etype (N, Any_Type); -- Here we have a function call, so do the reformatting else Nam := New_Copy (P); Save_Interps (P, Nam); -- We use Replace here because this is one of those cases -- where the parser has missclassified the node, and we fix -- things up and then do the semantic analysis on the fixed -- up node. Normally we do this using one of the Sinfo.CN -- routines, but this is too tricky for that. -- Note that using Rewrite would be wrong, because we would -- have a tree where the original node is unanalyzed. Replace (P, Make_Function_Call (Sloc (P), Name => Nam)); -- Now analyze the reformatted node Analyze_Call (P); -- If the prefix is illegal after this transformation, there -- may be visibility errors on the prefix. The safest is to -- treat the selected component as an error. if Error_Posted (P) then Set_Etype (N, Any_Type); return; else Analyze_Selected_Component (N); end if; end if; end if; -- Remaining cases generate various error messages else -- Format node as expanded name, to avoid cascaded errors Change_Selected_Component_To_Expanded_Name (N); Set_Entity (N, Any_Id); Set_Etype (N, Any_Type); -- Issue error message, but avoid this if error issued already. -- Use identifier of prefix if one is available. if P_Name = Any_Id then null; -- It is not an error if the prefix is the current instance of -- type name, e.g. the expression of a type aspect, when it is -- analyzed within a generic unit. We still have to verify that a -- component of that name exists, and decorate the node -- accordingly. elsif Is_Entity_Name (P) and then Is_Current_Instance (P) then declare Comp : Entity_Id; begin Comp := First_Entity (Entity (P)); while Present (Comp) loop if Chars (Comp) = Chars (Selector_Name (N)) then Set_Entity (N, Comp); Set_Etype (N, Etype (Comp)); Set_Entity (Selector_Name (N), Comp); Set_Etype (Selector_Name (N), Etype (Comp)); return; end if; Next_Entity (Comp); end loop; end; elsif Ekind (P_Name) = E_Void then Premature_Usage (P); elsif Nkind (P) /= N_Attribute_Reference then -- This may have been meant as a prefixed call to a primitive -- of an untagged type. If it is a function call check type of -- its first formal and add explanation. declare F : constant Entity_Id := Current_Entity (Selector_Name (N)); begin if Present (F) and then Is_Overloadable (F) and then Present (First_Entity (F)) and then not Is_Tagged_Type (Etype (First_Entity (F))) then Error_Msg_N ("prefixed call is only allowed for objects of a " & "tagged type", N); end if; end; Error_Msg_N ("invalid prefix in selected component&", P); if Is_Incomplete_Type (P_Type) and then Is_Access_Type (Etype (P)) then Error_Msg_N ("\dereference must not be of an incomplete type " & "(RM 3.10.1)", P); end if; else Error_Msg_N ("invalid prefix in selected component", P); end if; end if; else -- If prefix is not the name of an entity, it must be an expression, -- whose type is appropriate for a record. This is determined by -- type resolution. Analyze_Selected_Component (N); end if; Analyze_Dimension (N); end Find_Selected_Component; --------------- -- Find_Type -- --------------- procedure Find_Type (N : Node_Id) is C : Entity_Id; Typ : Entity_Id; T : Entity_Id; T_Name : Entity_Id; begin if N = Error then return; elsif Nkind (N) = N_Attribute_Reference then -- Class attribute. This is not valid in Ada 83 mode, but we do not -- need to enforce that at this point, since the declaration of the -- tagged type in the prefix would have been flagged already. if Attribute_Name (N) = Name_Class then Check_Restriction (No_Dispatch, N); Find_Type (Prefix (N)); -- Propagate error from bad prefix if Etype (Prefix (N)) = Any_Type then Set_Entity (N, Any_Type); Set_Etype (N, Any_Type); return; end if; T := Base_Type (Entity (Prefix (N))); -- Case where type is not known to be tagged. Its appearance in -- the prefix of the 'Class attribute indicates that the full view -- will be tagged. if not Is_Tagged_Type (T) then if Ekind (T) = E_Incomplete_Type then -- It is legal to denote the class type of an incomplete -- type. The full type will have to be tagged, of course. -- In Ada 2005 this usage is declared obsolescent, so we -- warn accordingly. This usage is only legal if the type -- is completed in the current scope, and not for a limited -- view of a type. if Ada_Version >= Ada_2005 then -- Test whether the Available_View of a limited type view -- is tagged, since the limited view may not be marked as -- tagged if the type itself has an untagged incomplete -- type view in its package. if From_Limited_With (T) and then not Is_Tagged_Type (Available_View (T)) then Error_Msg_N ("prefix of Class attribute must be tagged", N); Set_Etype (N, Any_Type); Set_Entity (N, Any_Type); return; -- ??? This test is temporarily disabled (always -- False) because it causes an unwanted warning on -- GNAT sources (built with -gnatg, which includes -- Warn_On_Obsolescent_ Feature). Once this issue -- is cleared in the sources, it can be enabled. elsif Warn_On_Obsolescent_Feature and then False then Error_Msg_N ("applying 'Class to an untagged incomplete type" & " is an obsolescent feature (RM J.11)?r?", N); end if; end if; Set_Is_Tagged_Type (T); Set_Direct_Primitive_Operations (T, New_Elmt_List); Make_Class_Wide_Type (T); Set_Entity (N, Class_Wide_Type (T)); Set_Etype (N, Class_Wide_Type (T)); elsif Ekind (T) = E_Private_Type and then not Is_Generic_Type (T) and then In_Private_Part (Scope (T)) then -- The Class attribute can be applied to an untagged private -- type fulfilled by a tagged type prior to the full type -- declaration (but only within the parent package's private -- part). Create the class-wide type now and check that the -- full type is tagged later during its analysis. Note that -- we do not mark the private type as tagged, unlike the -- case of incomplete types, because the type must still -- appear untagged to outside units. if No (Class_Wide_Type (T)) then Make_Class_Wide_Type (T); end if; Set_Entity (N, Class_Wide_Type (T)); Set_Etype (N, Class_Wide_Type (T)); else -- Should we introduce a type Any_Tagged and use Wrong_Type -- here, it would be a bit more consistent??? Error_Msg_NE ("tagged type required, found}", Prefix (N), First_Subtype (T)); Set_Entity (N, Any_Type); return; end if; -- Case of tagged type else if Is_Concurrent_Type (T) then if No (Corresponding_Record_Type (Entity (Prefix (N)))) then -- Previous error. Create a class-wide type for the -- synchronized type itself, with minimal semantic -- attributes, to catch other errors in some ACATS tests. pragma Assert (Serious_Errors_Detected /= 0); Make_Class_Wide_Type (T); C := Class_Wide_Type (T); Set_First_Entity (C, First_Entity (T)); else C := Class_Wide_Type (Corresponding_Record_Type (Entity (Prefix (N)))); end if; else C := Class_Wide_Type (Entity (Prefix (N))); end if; Set_Entity_With_Checks (N, C); Generate_Reference (C, N); Set_Etype (N, C); end if; -- Base attribute, not allowed in Ada 83 elsif Attribute_Name (N) = Name_Base then if Ada_Version = Ada_83 and then Comes_From_Source (N) then Error_Msg_N ("(Ada 83) Base attribute not allowed in subtype mark", N); else Find_Type (Prefix (N)); Typ := Entity (Prefix (N)); if Ada_Version >= Ada_95 and then not Is_Scalar_Type (Typ) and then not Is_Generic_Type (Typ) then Error_Msg_N ("prefix of Base attribute must be scalar type", Prefix (N)); elsif Warn_On_Redundant_Constructs and then Base_Type (Typ) = Typ then Error_Msg_NE -- CODEFIX ("redundant attribute, & is its own base type?r?", N, Typ); end if; T := Base_Type (Typ); -- Rewrite attribute reference with type itself (see similar -- processing in Analyze_Attribute, case Base). Preserve prefix -- if present, for other legality checks. if Nkind (Prefix (N)) = N_Expanded_Name then Rewrite (N, Make_Expanded_Name (Sloc (N), Chars => Chars (T), Prefix => New_Copy (Prefix (Prefix (N))), Selector_Name => New_Occurrence_Of (T, Sloc (N)))); else Rewrite (N, New_Occurrence_Of (T, Sloc (N))); end if; Set_Entity (N, T); Set_Etype (N, T); end if; elsif Attribute_Name (N) = Name_Stub_Type then -- This is handled in Analyze_Attribute Analyze (N); -- All other attributes are invalid in a subtype mark else Error_Msg_N ("invalid attribute in subtype mark", N); end if; else Analyze (N); if Is_Entity_Name (N) then T_Name := Entity (N); else Error_Msg_N ("subtype mark required in this context", N); Set_Etype (N, Any_Type); return; end if; if T_Name = Any_Id or else Etype (N) = Any_Type then -- Undefined id. Make it into a valid type Set_Entity (N, Any_Type); elsif not Is_Type (T_Name) and then T_Name /= Standard_Void_Type then Error_Msg_Sloc := Sloc (T_Name); Error_Msg_N ("subtype mark required in this context", N); Error_Msg_NE ("\\found & declared#", N, T_Name); Set_Entity (N, Any_Type); else -- If the type is an incomplete type created to handle -- anonymous access components of a record type, then the -- incomplete type is the visible entity and subsequent -- references will point to it. Mark the original full -- type as referenced, to prevent spurious warnings. if Is_Incomplete_Type (T_Name) and then Present (Full_View (T_Name)) and then not Comes_From_Source (T_Name) then Set_Referenced (Full_View (T_Name)); end if; T_Name := Get_Full_View (T_Name); -- Ada 2005 (AI-251, AI-50217): Handle interfaces visible through -- limited-with clauses if From_Limited_With (T_Name) and then Is_Incomplete_Type (T_Name) and then Present (Non_Limited_View (T_Name)) and then Is_Interface (Non_Limited_View (T_Name)) then T_Name := Non_Limited_View (T_Name); end if; if In_Open_Scopes (T_Name) then if Ekind (Base_Type (T_Name)) = E_Task_Type then -- In Ada 2005, a task name can be used in an access -- definition within its own body. It cannot be used -- in the discriminant part of the task declaration, -- nor anywhere else in the declaration because entries -- cannot have access parameters. if Ada_Version >= Ada_2005 and then Nkind (Parent (N)) = N_Access_Definition then Set_Entity (N, T_Name); Set_Etype (N, T_Name); if Has_Completion (T_Name) then return; else Error_Msg_N ("task type cannot be used as type mark " & "within its own declaration", N); end if; else Error_Msg_N ("task type cannot be used as type mark " & "within its own spec or body", N); end if; elsif Ekind (Base_Type (T_Name)) = E_Protected_Type then -- In Ada 2005, a protected name can be used in an access -- definition within its own body. if Ada_Version >= Ada_2005 and then Nkind (Parent (N)) = N_Access_Definition then Set_Entity (N, T_Name); Set_Etype (N, T_Name); return; else Error_Msg_N ("protected type cannot be used as type mark " & "within its own spec or body", N); end if; else Error_Msg_N ("type declaration cannot refer to itself", N); end if; Set_Etype (N, Any_Type); Set_Entity (N, Any_Type); Set_Error_Posted (T_Name); return; end if; Set_Entity (N, T_Name); Set_Etype (N, T_Name); end if; end if; if Present (Etype (N)) and then Comes_From_Source (N) then if Is_Fixed_Point_Type (Etype (N)) then Check_Restriction (No_Fixed_Point, N); elsif Is_Floating_Point_Type (Etype (N)) then Check_Restriction (No_Floating_Point, N); end if; -- A Ghost type must appear in a specific context if Is_Ghost_Entity (Etype (N)) then Check_Ghost_Context (Etype (N), N); end if; end if; end Find_Type; -------------------- -- Has_Components -- -------------------- function Has_Components (Typ : Entity_Id) return Boolean is begin return Is_Record_Type (Typ) or else (Is_Private_Type (Typ) and then Has_Discriminants (Typ)) or else (Is_Task_Type (Typ) and then Has_Discriminants (Typ)) or else (Is_Incomplete_Type (Typ) and then From_Limited_With (Typ) and then Is_Record_Type (Available_View (Typ))); end Has_Components; ------------------------------------ -- Has_Implicit_Character_Literal -- ------------------------------------ function Has_Implicit_Character_Literal (N : Node_Id) return Boolean is Id : Entity_Id; Found : Boolean := False; P : constant Entity_Id := Entity (Prefix (N)); Priv_Id : Entity_Id := Empty; begin if Ekind (P) = E_Package and then not In_Open_Scopes (P) then Priv_Id := First_Private_Entity (P); end if; if P = Standard_Standard then Change_Selected_Component_To_Expanded_Name (N); Rewrite (N, Selector_Name (N)); Analyze (N); Set_Etype (Original_Node (N), Standard_Character); return True; end if; Id := First_Entity (P); while Present (Id) and then Id /= Priv_Id loop if Is_Standard_Character_Type (Id) and then Is_Base_Type (Id) then -- We replace the node with the literal itself, resolve as a -- character, and set the type correctly. if not Found then Change_Selected_Component_To_Expanded_Name (N); Rewrite (N, Selector_Name (N)); Analyze (N); Set_Etype (N, Id); Set_Etype (Original_Node (N), Id); Found := True; else -- More than one type derived from Character in given scope. -- Collect all possible interpretations. Add_One_Interp (N, Id, Id); end if; end if; Next_Entity (Id); end loop; return Found; end Has_Implicit_Character_Literal; ---------------------- -- Has_Private_With -- ---------------------- function Has_Private_With (E : Entity_Id) return Boolean is Comp_Unit : constant Node_Id := Cunit (Current_Sem_Unit); Item : Node_Id; begin Item := First (Context_Items (Comp_Unit)); while Present (Item) loop if Nkind (Item) = N_With_Clause and then Private_Present (Item) and then Entity (Name (Item)) = E then return True; end if; Next (Item); end loop; return False; end Has_Private_With; --------------------------- -- Has_Implicit_Operator -- --------------------------- function Has_Implicit_Operator (N : Node_Id) return Boolean is Op_Id : constant Name_Id := Chars (Selector_Name (N)); P : constant Entity_Id := Entity (Prefix (N)); Id : Entity_Id; Priv_Id : Entity_Id := Empty; procedure Add_Implicit_Operator (T : Entity_Id; Op_Type : Entity_Id := Empty); -- Add implicit interpretation to node N, using the type for which a -- predefined operator exists. If the operator yields a boolean type, -- the Operand_Type is implicitly referenced by the operator, and a -- reference to it must be generated. --------------------------- -- Add_Implicit_Operator -- --------------------------- procedure Add_Implicit_Operator (T : Entity_Id; Op_Type : Entity_Id := Empty) is Predef_Op : Entity_Id; begin Predef_Op := Current_Entity (Selector_Name (N)); while Present (Predef_Op) and then Scope (Predef_Op) /= Standard_Standard loop Predef_Op := Homonym (Predef_Op); end loop; if Nkind (N) = N_Selected_Component then Change_Selected_Component_To_Expanded_Name (N); end if; -- If the context is an unanalyzed function call, determine whether -- a binary or unary interpretation is required. if Nkind (Parent (N)) = N_Indexed_Component then declare Is_Binary_Call : constant Boolean := Present (Next (First (Expressions (Parent (N))))); Is_Binary_Op : constant Boolean := First_Entity (Predef_Op) /= Last_Entity (Predef_Op); Predef_Op2 : constant Entity_Id := Homonym (Predef_Op); begin if Is_Binary_Call then if Is_Binary_Op then Add_One_Interp (N, Predef_Op, T); else Add_One_Interp (N, Predef_Op2, T); end if; else if not Is_Binary_Op then Add_One_Interp (N, Predef_Op, T); -- Predef_Op2 may be empty in case of previous errors elsif Present (Predef_Op2) then Add_One_Interp (N, Predef_Op2, T); end if; end if; end; else Add_One_Interp (N, Predef_Op, T); -- For operators with unary and binary interpretations, if -- context is not a call, add both if Present (Homonym (Predef_Op)) then Add_One_Interp (N, Homonym (Predef_Op), T); end if; end if; -- The node is a reference to a predefined operator, and -- an implicit reference to the type of its operands. if Present (Op_Type) then Generate_Operator_Reference (N, Op_Type); else Generate_Operator_Reference (N, T); end if; end Add_Implicit_Operator; -- Start of processing for Has_Implicit_Operator begin if Ekind (P) = E_Package and then not In_Open_Scopes (P) then Priv_Id := First_Private_Entity (P); end if; Id := First_Entity (P); case Op_Id is -- Boolean operators: an implicit declaration exists if the scope -- contains a declaration for a derived Boolean type, or for an -- array of Boolean type. when Name_Op_And | Name_Op_Not | Name_Op_Or | Name_Op_Xor => while Id /= Priv_Id loop if Valid_Boolean_Arg (Id) and then Is_Base_Type (Id) then Add_Implicit_Operator (Id); return True; end if; Next_Entity (Id); end loop; -- Equality: look for any non-limited type (result is Boolean) when Name_Op_Eq | Name_Op_Ne => while Id /= Priv_Id loop if Is_Type (Id) and then not Is_Limited_Type (Id) and then Is_Base_Type (Id) then Add_Implicit_Operator (Standard_Boolean, Id); return True; end if; Next_Entity (Id); end loop; -- Comparison operators: scalar type, or array of scalar when Name_Op_Ge | Name_Op_Gt | Name_Op_Le | Name_Op_Lt => while Id /= Priv_Id loop if (Is_Scalar_Type (Id) or else (Is_Array_Type (Id) and then Is_Scalar_Type (Component_Type (Id)))) and then Is_Base_Type (Id) then Add_Implicit_Operator (Standard_Boolean, Id); return True; end if; Next_Entity (Id); end loop; -- Arithmetic operators: any numeric type when Name_Op_Abs | Name_Op_Add | Name_Op_Divide | Name_Op_Expon | Name_Op_Mod | Name_Op_Multiply | Name_Op_Rem | Name_Op_Subtract => while Id /= Priv_Id loop if Is_Numeric_Type (Id) and then Is_Base_Type (Id) then Add_Implicit_Operator (Id); return True; end if; Next_Entity (Id); end loop; -- Concatenation: any one-dimensional array type when Name_Op_Concat => while Id /= Priv_Id loop if Is_Array_Type (Id) and then Number_Dimensions (Id) = 1 and then Is_Base_Type (Id) then Add_Implicit_Operator (Id); return True; end if; Next_Entity (Id); end loop; -- What is the others condition here? Should we be using a -- subtype of Name_Id that would restrict to operators ??? when others => null; end case; -- If we fall through, then we do not have an implicit operator return False; end Has_Implicit_Operator; ----------------------------------- -- Has_Loop_In_Inner_Open_Scopes -- ----------------------------------- function Has_Loop_In_Inner_Open_Scopes (S : Entity_Id) return Boolean is begin -- Several scope stacks are maintained by Scope_Stack. The base of the -- currently active scope stack is denoted by the Is_Active_Stack_Base -- flag in the scope stack entry. Note that the scope stacks used to -- simply be delimited implicitly by the presence of Standard_Standard -- at their base, but there now are cases where this is not sufficient -- because Standard_Standard actually may appear in the middle of the -- active set of scopes. for J in reverse 0 .. Scope_Stack.Last loop -- S was reached without seing a loop scope first if Scope_Stack.Table (J).Entity = S then return False; -- S was not yet reached, so it contains at least one inner loop elsif Ekind (Scope_Stack.Table (J).Entity) = E_Loop then return True; end if; -- Check Is_Active_Stack_Base to tell us when to stop, as there are -- cases where Standard_Standard appears in the middle of the active -- set of scopes. This affects the declaration and overriding of -- private inherited operations in instantiations of generic child -- units. pragma Assert (not Scope_Stack.Table (J).Is_Active_Stack_Base); end loop; raise Program_Error; -- unreachable end Has_Loop_In_Inner_Open_Scopes; -------------------- -- In_Open_Scopes -- -------------------- function In_Open_Scopes (S : Entity_Id) return Boolean is begin -- Several scope stacks are maintained by Scope_Stack. The base of the -- currently active scope stack is denoted by the Is_Active_Stack_Base -- flag in the scope stack entry. Note that the scope stacks used to -- simply be delimited implicitly by the presence of Standard_Standard -- at their base, but there now are cases where this is not sufficient -- because Standard_Standard actually may appear in the middle of the -- active set of scopes. for J in reverse 0 .. Scope_Stack.Last loop if Scope_Stack.Table (J).Entity = S then return True; end if; -- Check Is_Active_Stack_Base to tell us when to stop, as there are -- cases where Standard_Standard appears in the middle of the active -- set of scopes. This affects the declaration and overriding of -- private inherited operations in instantiations of generic child -- units. exit when Scope_Stack.Table (J).Is_Active_Stack_Base; end loop; return False; end In_Open_Scopes; ----------------------------- -- Inherit_Renamed_Profile -- ----------------------------- procedure Inherit_Renamed_Profile (New_S : Entity_Id; Old_S : Entity_Id) is New_F : Entity_Id; Old_F : Entity_Id; Old_T : Entity_Id; New_T : Entity_Id; begin if Ekind (Old_S) = E_Operator then New_F := First_Formal (New_S); while Present (New_F) loop Set_Etype (New_F, Base_Type (Etype (New_F))); Next_Formal (New_F); end loop; Set_Etype (New_S, Base_Type (Etype (New_S))); else New_F := First_Formal (New_S); Old_F := First_Formal (Old_S); while Present (New_F) loop New_T := Etype (New_F); Old_T := Etype (Old_F); -- If the new type is a renaming of the old one, as is the case -- for actuals in instances, retain its name, to simplify later -- disambiguation. if Nkind (Parent (New_T)) = N_Subtype_Declaration and then Is_Entity_Name (Subtype_Indication (Parent (New_T))) and then Entity (Subtype_Indication (Parent (New_T))) = Old_T then null; else Set_Etype (New_F, Old_T); end if; Next_Formal (New_F); Next_Formal (Old_F); end loop; pragma Assert (No (Old_F)); if Ekind (Old_S) in E_Function | E_Enumeration_Literal then Set_Etype (New_S, Etype (Old_S)); end if; end if; end Inherit_Renamed_Profile; ---------------- -- Initialize -- ---------------- procedure Initialize is begin Urefs.Init; end Initialize; ------------------------- -- Install_Use_Clauses -- ------------------------- procedure Install_Use_Clauses (Clause : Node_Id; Force_Installation : Boolean := False) is U : Node_Id; begin U := Clause; while Present (U) loop -- Case of USE package if Nkind (U) = N_Use_Package_Clause then Use_One_Package (U, Name (U), True); -- Case of USE TYPE else Use_One_Type (Subtype_Mark (U), Force => Force_Installation); end if; Next_Use_Clause (U); end loop; end Install_Use_Clauses; ---------------------- -- Mark_Use_Clauses -- ---------------------- procedure Mark_Use_Clauses (Id : Node_Or_Entity_Id) is procedure Mark_Parameters (Call : Entity_Id); -- Perform use_type_clause marking for all parameters in a subprogram -- or operator call. procedure Mark_Use_Package (Pak : Entity_Id); -- Move up the Prev_Use_Clause chain for packages denoted by Pak - -- marking each clause in the chain as effective in the process. procedure Mark_Use_Type (E : Entity_Id); -- Similar to Do_Use_Package_Marking except we move up the -- Prev_Use_Clause chain for the type denoted by E. --------------------- -- Mark_Parameters -- --------------------- procedure Mark_Parameters (Call : Entity_Id) is Curr : Node_Id; begin -- Move through all of the formals Curr := First_Formal (Call); while Present (Curr) loop Mark_Use_Type (Curr); Next_Formal (Curr); end loop; -- Handle the return type Mark_Use_Type (Call); end Mark_Parameters; ---------------------- -- Mark_Use_Package -- ---------------------- procedure Mark_Use_Package (Pak : Entity_Id) is Curr : Node_Id; begin -- Ignore cases where the scope of the type is not a package (e.g. -- Standard_Standard). if Ekind (Pak) /= E_Package then return; end if; Curr := Current_Use_Clause (Pak); while Present (Curr) and then not Is_Effective_Use_Clause (Curr) loop -- We need to mark the previous use clauses as effective, but -- each use clause may in turn render other use_package_clauses -- effective. Additionally, it is possible to have a parent -- package renamed as a child of itself so we must check the -- prefix entity is not the same as the package we are marking. if Nkind (Name (Curr)) /= N_Identifier and then Present (Prefix (Name (Curr))) and then Entity (Prefix (Name (Curr))) /= Pak then Mark_Use_Package (Entity (Prefix (Name (Curr)))); -- It is also possible to have a child package without a prefix -- that relies on a previous use_package_clause. elsif Nkind (Name (Curr)) = N_Identifier and then Is_Child_Unit (Entity (Name (Curr))) then Mark_Use_Package (Scope (Entity (Name (Curr)))); end if; -- Mark the use_package_clause as effective and move up the chain Set_Is_Effective_Use_Clause (Curr); Curr := Prev_Use_Clause (Curr); end loop; end Mark_Use_Package; ------------------- -- Mark_Use_Type -- ------------------- procedure Mark_Use_Type (E : Entity_Id) is Curr : Node_Id; Base : Entity_Id; begin -- Ignore void types and unresolved string literals and primitives if Nkind (E) = N_String_Literal or else Nkind (Etype (E)) not in N_Entity or else not Is_Type (Etype (E)) then return; end if; -- Primitives with class-wide operands might additionally render -- their base type's use_clauses effective - so do a recursive check -- here. Base := Base_Type (Etype (E)); if Ekind (Base) = E_Class_Wide_Type then Mark_Use_Type (Base); end if; -- The package containing the type or operator function being used -- may be in use as well, so mark any use_package_clauses for it as -- effective. There are also additional sanity checks performed here -- for ignoring previous errors. Mark_Use_Package (Scope (Base)); if Nkind (E) in N_Op and then Present (Entity (E)) and then Present (Scope (Entity (E))) then Mark_Use_Package (Scope (Entity (E))); end if; Curr := Current_Use_Clause (Base); while Present (Curr) and then not Is_Effective_Use_Clause (Curr) loop -- Current use_type_clause may render other use_package_clauses -- effective. if Nkind (Subtype_Mark (Curr)) /= N_Identifier and then Present (Prefix (Subtype_Mark (Curr))) then Mark_Use_Package (Entity (Prefix (Subtype_Mark (Curr)))); end if; -- Mark the use_type_clause as effective and move up the chain Set_Is_Effective_Use_Clause (Curr); Curr := Prev_Use_Clause (Curr); end loop; end Mark_Use_Type; -- Start of processing for Mark_Use_Clauses begin -- Use clauses in and of themselves do not count as a "use" of a -- package. if Nkind (Parent (Id)) in N_Use_Package_Clause | N_Use_Type_Clause then return; end if; -- Handle entities if Nkind (Id) in N_Entity then -- Mark the entity's package if Is_Potentially_Use_Visible (Id) then Mark_Use_Package (Scope (Id)); end if; -- Mark enumeration literals if Ekind (Id) = E_Enumeration_Literal then Mark_Use_Type (Id); -- Mark primitives elsif (Ekind (Id) in Overloadable_Kind or else Ekind (Id) in E_Generic_Function | E_Generic_Procedure) and then (Is_Potentially_Use_Visible (Id) or else Is_Intrinsic_Subprogram (Id) or else (Ekind (Id) in E_Function | E_Procedure and then Is_Generic_Actual_Subprogram (Id))) then Mark_Parameters (Id); end if; -- Handle nodes else -- Mark operators if Nkind (Id) in N_Op then -- At this point the left operand may not be resolved if we are -- encountering multiple operators next to eachother in an -- expression. if Nkind (Id) in N_Binary_Op and then not (Nkind (Left_Opnd (Id)) in N_Op) then Mark_Use_Type (Left_Opnd (Id)); end if; Mark_Use_Type (Right_Opnd (Id)); Mark_Use_Type (Id); -- Mark entity identifiers elsif Nkind (Id) in N_Has_Entity and then (Is_Potentially_Use_Visible (Entity (Id)) or else (Is_Generic_Instance (Entity (Id)) and then Is_Immediately_Visible (Entity (Id)))) then -- Ignore fully qualified names as they do not count as a "use" of -- a package. if Nkind (Id) in N_Identifier | N_Operator_Symbol or else (Present (Prefix (Id)) and then Scope (Entity (Id)) /= Entity (Prefix (Id))) then Mark_Use_Clauses (Entity (Id)); end if; end if; end if; end Mark_Use_Clauses; -------------------------------- -- Most_Descendant_Use_Clause -- -------------------------------- function Most_Descendant_Use_Clause (Clause1 : Entity_Id; Clause2 : Entity_Id) return Entity_Id is Scope1 : Entity_Id; Scope2 : Entity_Id; begin if Clause1 = Clause2 then return Clause1; end if; -- We determine which one is the most descendant by the scope distance -- to the ultimate parent unit. Scope1 := Entity_Of_Unit (Unit (Parent (Clause1))); Scope2 := Entity_Of_Unit (Unit (Parent (Clause2))); while Scope1 /= Standard_Standard and then Scope2 /= Standard_Standard loop Scope1 := Scope (Scope1); Scope2 := Scope (Scope2); if not Present (Scope1) then return Clause1; elsif not Present (Scope2) then return Clause2; end if; end loop; if Scope1 = Standard_Standard then return Clause1; end if; return Clause2; end Most_Descendant_Use_Clause; --------------- -- Pop_Scope -- --------------- procedure Pop_Scope is SST : Scope_Stack_Entry renames Scope_Stack.Table (Scope_Stack.Last); S : constant Entity_Id := SST.Entity; begin if Debug_Flag_E then Write_Info; end if; -- Set Default_Storage_Pool field of the library unit if necessary if Is_Package_Or_Generic_Package (S) and then Nkind (Parent (Unit_Declaration_Node (S))) = N_Compilation_Unit then declare Aux : constant Node_Id := Aux_Decls_Node (Parent (Unit_Declaration_Node (S))); begin if No (Default_Storage_Pool (Aux)) then Set_Default_Storage_Pool (Aux, Default_Pool); end if; end; end if; Scope_Suppress := SST.Save_Scope_Suppress; Local_Suppress_Stack_Top := SST.Save_Local_Suppress_Stack_Top; Check_Policy_List := SST.Save_Check_Policy_List; Default_Pool := SST.Save_Default_Storage_Pool; No_Tagged_Streams := SST.Save_No_Tagged_Streams; SPARK_Mode := SST.Save_SPARK_Mode; SPARK_Mode_Pragma := SST.Save_SPARK_Mode_Pragma; Default_SSO := SST.Save_Default_SSO; Uneval_Old := SST.Save_Uneval_Old; if Debug_Flag_W then Write_Str ("<-- exiting scope: "); Write_Name (Chars (Current_Scope)); Write_Str (", Depth="); Write_Int (Int (Scope_Stack.Last)); Write_Eol; end if; End_Use_Clauses (SST.First_Use_Clause); -- If the actions to be wrapped are still there they will get lost -- causing incomplete code to be generated. It is better to abort in -- this case (and we do the abort even with assertions off since the -- penalty is incorrect code generation). if SST.Actions_To_Be_Wrapped /= Scope_Actions'(others => No_List) then raise Program_Error; end if; -- Free last subprogram name if allocated, and pop scope Free (SST.Last_Subprogram_Name); Scope_Stack.Decrement_Last; end Pop_Scope; ---------------- -- Push_Scope -- ---------------- procedure Push_Scope (S : Entity_Id) is E : constant Entity_Id := Scope (S); begin if Ekind (S) = E_Void then null; -- Set scope depth if not a non-concurrent type, and we have not yet set -- the scope depth. This means that we have the first occurrence of the -- scope, and this is where the depth is set. elsif (not Is_Type (S) or else Is_Concurrent_Type (S)) and then not Scope_Depth_Set (S) then if S = Standard_Standard then Set_Scope_Depth_Value (S, Uint_0); elsif Is_Child_Unit (S) then Set_Scope_Depth_Value (S, Uint_1); elsif not Is_Record_Type (Current_Scope) then if Ekind (S) = E_Loop then Set_Scope_Depth_Value (S, Scope_Depth (Current_Scope)); else Set_Scope_Depth_Value (S, Scope_Depth (Current_Scope) + 1); end if; end if; end if; Scope_Stack.Increment_Last; declare SST : Scope_Stack_Entry renames Scope_Stack.Table (Scope_Stack.Last); begin SST.Entity := S; SST.Save_Scope_Suppress := Scope_Suppress; SST.Save_Local_Suppress_Stack_Top := Local_Suppress_Stack_Top; SST.Save_Check_Policy_List := Check_Policy_List; SST.Save_Default_Storage_Pool := Default_Pool; SST.Save_No_Tagged_Streams := No_Tagged_Streams; SST.Save_SPARK_Mode := SPARK_Mode; SST.Save_SPARK_Mode_Pragma := SPARK_Mode_Pragma; SST.Save_Default_SSO := Default_SSO; SST.Save_Uneval_Old := Uneval_Old; -- Each new scope pushed onto the scope stack inherits the component -- alignment of the previous scope. This emulates the "visibility" -- semantics of pragma Component_Alignment. if Scope_Stack.Last > Scope_Stack.First then SST.Component_Alignment_Default := Scope_Stack.Table (Scope_Stack.Last - 1).Component_Alignment_Default; -- Otherwise, this is the first scope being pushed on the scope -- stack. Inherit the component alignment from the configuration -- form of pragma Component_Alignment (if any). else SST.Component_Alignment_Default := Configuration_Component_Alignment; end if; SST.Last_Subprogram_Name := null; SST.Is_Transient := False; SST.Node_To_Be_Wrapped := Empty; SST.Pending_Freeze_Actions := No_List; SST.Actions_To_Be_Wrapped := (others => No_List); SST.First_Use_Clause := Empty; SST.Is_Active_Stack_Base := False; SST.Previous_Visibility := False; SST.Locked_Shared_Objects := No_Elist; end; if Debug_Flag_W then Write_Str ("--> new scope: "); Write_Name (Chars (Current_Scope)); Write_Str (", Id="); Write_Int (Int (Current_Scope)); Write_Str (", Depth="); Write_Int (Int (Scope_Stack.Last)); Write_Eol; end if; -- Deal with copying flags from the previous scope to this one. This is -- not necessary if either scope is standard, or if the new scope is a -- child unit. if S /= Standard_Standard and then Scope (S) /= Standard_Standard and then not Is_Child_Unit (S) then if Nkind (E) not in N_Entity then return; end if; -- Copy categorization flags from Scope (S) to S, this is not done -- when Scope (S) is Standard_Standard since propagation is from -- library unit entity inwards. Copy other relevant attributes as -- well (Discard_Names in particular). -- We only propagate inwards for library level entities, -- inner level subprograms do not inherit the categorization. if Is_Library_Level_Entity (S) then Set_Is_Preelaborated (S, Is_Preelaborated (E)); Set_Is_Shared_Passive (S, Is_Shared_Passive (E)); Set_Discard_Names (S, Discard_Names (E)); Set_Suppress_Value_Tracking_On_Call (S, Suppress_Value_Tracking_On_Call (E)); Set_Categorization_From_Scope (E => S, Scop => E); end if; end if; if Is_Child_Unit (S) and then Present (E) and then Is_Package_Or_Generic_Package (E) and then Nkind (Parent (Unit_Declaration_Node (E))) = N_Compilation_Unit then declare Aux : constant Node_Id := Aux_Decls_Node (Parent (Unit_Declaration_Node (E))); begin if Present (Default_Storage_Pool (Aux)) then Default_Pool := Default_Storage_Pool (Aux); end if; end; end if; end Push_Scope; --------------------- -- Premature_Usage -- --------------------- procedure Premature_Usage (N : Node_Id) is Kind : constant Node_Kind := Nkind (Parent (Entity (N))); E : Entity_Id := Entity (N); begin -- Within an instance, the analysis of the actual for a formal object -- does not see the name of the object itself. This is significant only -- if the object is an aggregate, where its analysis does not do any -- name resolution on component associations. (see 4717-008). In such a -- case, look for the visible homonym on the chain. if In_Instance and then Present (Homonym (E)) then E := Homonym (E); while Present (E) and then not In_Open_Scopes (Scope (E)) loop E := Homonym (E); end loop; if Present (E) then Set_Entity (N, E); Set_Etype (N, Etype (E)); return; end if; end if; case Kind is when N_Component_Declaration => Error_Msg_N ("component&! cannot be used before end of record declaration", N); when N_Parameter_Specification => Error_Msg_N ("formal parameter&! cannot be used before end of specification", N); when N_Discriminant_Specification => Error_Msg_N ("discriminant&! cannot be used before end of discriminant part", N); when N_Procedure_Specification | N_Function_Specification => Error_Msg_N ("subprogram&! cannot be used before end of its declaration", N); when N_Full_Type_Declaration | N_Subtype_Declaration => Error_Msg_N ("type& cannot be used before end of its declaration!", N); when others => Error_Msg_N ("object& cannot be used before end of its declaration!", N); -- If the premature reference appears as the expression in its own -- declaration, rewrite it to prevent compiler loops in subsequent -- uses of this mangled declaration in address clauses. if Nkind (Parent (N)) = N_Object_Declaration then Set_Entity (N, Any_Id); end if; end case; end Premature_Usage; ------------------------ -- Present_System_Aux -- ------------------------ function Present_System_Aux (N : Node_Id := Empty) return Boolean is Loc : Source_Ptr; Aux_Name : Unit_Name_Type; Unum : Unit_Number_Type; Withn : Node_Id; With_Sys : Node_Id; The_Unit : Node_Id; function Find_System (C_Unit : Node_Id) return Entity_Id; -- Scan context clause of compilation unit to find with_clause -- for System. ----------------- -- Find_System -- ----------------- function Find_System (C_Unit : Node_Id) return Entity_Id is With_Clause : Node_Id; begin With_Clause := First (Context_Items (C_Unit)); while Present (With_Clause) loop if (Nkind (With_Clause) = N_With_Clause and then Chars (Name (With_Clause)) = Name_System) and then Comes_From_Source (With_Clause) then return With_Clause; end if; Next (With_Clause); end loop; return Empty; end Find_System; -- Start of processing for Present_System_Aux begin -- The child unit may have been loaded and analyzed already if Present (System_Aux_Id) then return True; -- If no previous pragma for System.Aux, nothing to load elsif No (System_Extend_Unit) then return False; -- Use the unit name given in the pragma to retrieve the unit. -- Verify that System itself appears in the context clause of the -- current compilation. If System is not present, an error will -- have been reported already. else With_Sys := Find_System (Cunit (Current_Sem_Unit)); The_Unit := Unit (Cunit (Current_Sem_Unit)); if No (With_Sys) and then (Nkind (The_Unit) = N_Package_Body or else (Nkind (The_Unit) = N_Subprogram_Body and then not Acts_As_Spec (Cunit (Current_Sem_Unit)))) then With_Sys := Find_System (Library_Unit (Cunit (Current_Sem_Unit))); end if; if No (With_Sys) and then Present (N) then -- If we are compiling a subunit, we need to examine its -- context as well (Current_Sem_Unit is the parent unit); The_Unit := Parent (N); while Nkind (The_Unit) /= N_Compilation_Unit loop The_Unit := Parent (The_Unit); end loop; if Nkind (Unit (The_Unit)) = N_Subunit then With_Sys := Find_System (The_Unit); end if; end if; if No (With_Sys) then return False; end if; Loc := Sloc (With_Sys); Get_Name_String (Chars (Expression (System_Extend_Unit))); Name_Buffer (8 .. Name_Len + 7) := Name_Buffer (1 .. Name_Len); Name_Buffer (1 .. 7) := "system."; Name_Buffer (Name_Len + 8) := '%'; Name_Buffer (Name_Len + 9) := 's'; Name_Len := Name_Len + 9; Aux_Name := Name_Find; Unum := Load_Unit (Load_Name => Aux_Name, Required => False, Subunit => False, Error_Node => With_Sys); if Unum /= No_Unit then Semantics (Cunit (Unum)); System_Aux_Id := Defining_Entity (Specification (Unit (Cunit (Unum)))); Withn := Make_With_Clause (Loc, Name => Make_Expanded_Name (Loc, Chars => Chars (System_Aux_Id), Prefix => New_Occurrence_Of (Scope (System_Aux_Id), Loc), Selector_Name => New_Occurrence_Of (System_Aux_Id, Loc))); Set_Entity (Name (Withn), System_Aux_Id); Set_Corresponding_Spec (Withn, System_Aux_Id); Set_First_Name (Withn); Set_Implicit_With (Withn); Set_Library_Unit (Withn, Cunit (Unum)); Insert_After (With_Sys, Withn); Mark_Rewrite_Insertion (Withn); Set_Context_Installed (Withn); return True; -- Here if unit load failed else Error_Msg_Name_1 := Name_System; Error_Msg_Name_2 := Chars (Expression (System_Extend_Unit)); Error_Msg_N ("extension package `%.%` does not exist", Opt.System_Extend_Unit); return False; end if; end if; end Present_System_Aux; ------------------------- -- Restore_Scope_Stack -- ------------------------- procedure Restore_Scope_Stack (List : Elist_Id; Handle_Use : Boolean := True) is SS_Last : constant Int := Scope_Stack.Last; Elmt : Elmt_Id; begin -- Restore visibility of previous scope stack, if any, using the list -- we saved (we use Remove, since this list will not be used again). loop Elmt := Last_Elmt (List); exit when Elmt = No_Elmt; Set_Is_Immediately_Visible (Node (Elmt)); Remove_Last_Elmt (List); end loop; -- Restore use clauses if SS_Last >= Scope_Stack.First and then Scope_Stack.Table (SS_Last).Entity /= Standard_Standard and then Handle_Use then Install_Use_Clauses (Scope_Stack.Table (SS_Last).First_Use_Clause, Force_Installation => True); end if; end Restore_Scope_Stack; ---------------------- -- Save_Scope_Stack -- ---------------------- -- Save_Scope_Stack/Restore_Scope_Stack were originally designed to avoid -- consuming any memory. That is, Save_Scope_Stack took care of removing -- from immediate visibility entities and Restore_Scope_Stack took care -- of restoring their visibility analyzing the context of each entity. The -- problem of such approach is that it was fragile and caused unexpected -- visibility problems, and indeed one test was found where there was a -- real problem. -- Furthermore, the following experiment was carried out: -- - Save_Scope_Stack was modified to store in an Elist1 all those -- entities whose attribute Is_Immediately_Visible is modified -- from True to False. -- - Restore_Scope_Stack was modified to store in another Elist2 -- all the entities whose attribute Is_Immediately_Visible is -- modified from False to True. -- - Extra code was added to verify that all the elements of Elist1 -- are found in Elist2 -- This test shows that there may be more occurrences of this problem which -- have not yet been detected. As a result, we replaced that approach by -- the current one in which Save_Scope_Stack returns the list of entities -- whose visibility is changed, and that list is passed to Restore_Scope_ -- Stack to undo that change. This approach is simpler and safer, although -- it consumes more memory. function Save_Scope_Stack (Handle_Use : Boolean := True) return Elist_Id is Result : constant Elist_Id := New_Elmt_List; E : Entity_Id; S : Entity_Id; SS_Last : constant Int := Scope_Stack.Last; procedure Remove_From_Visibility (E : Entity_Id); -- If E is immediately visible then append it to the result and remove -- it temporarily from visibility. ---------------------------- -- Remove_From_Visibility -- ---------------------------- procedure Remove_From_Visibility (E : Entity_Id) is begin if Is_Immediately_Visible (E) then Append_Elmt (E, Result); Set_Is_Immediately_Visible (E, False); end if; end Remove_From_Visibility; -- Start of processing for Save_Scope_Stack begin if SS_Last >= Scope_Stack.First and then Scope_Stack.Table (SS_Last).Entity /= Standard_Standard then if Handle_Use then End_Use_Clauses (Scope_Stack.Table (SS_Last).First_Use_Clause); end if; -- If the call is from within a compilation unit, as when called from -- Rtsfind, make current entries in scope stack invisible while we -- analyze the new unit. for J in reverse 0 .. SS_Last loop exit when Scope_Stack.Table (J).Entity = Standard_Standard or else No (Scope_Stack.Table (J).Entity); S := Scope_Stack.Table (J).Entity; Remove_From_Visibility (S); E := First_Entity (S); while Present (E) loop Remove_From_Visibility (E); Next_Entity (E); end loop; end loop; end if; return Result; end Save_Scope_Stack; ------------- -- Set_Use -- ------------- procedure Set_Use (L : List_Id) is Decl : Node_Id; begin if Present (L) then Decl := First (L); while Present (Decl) loop if Nkind (Decl) = N_Use_Package_Clause then Chain_Use_Clause (Decl); Use_One_Package (Decl, Name (Decl)); elsif Nkind (Decl) = N_Use_Type_Clause then Chain_Use_Clause (Decl); Use_One_Type (Subtype_Mark (Decl)); end if; Next (Decl); end loop; end if; end Set_Use; ----------------------------- -- Update_Use_Clause_Chain -- ----------------------------- procedure Update_Use_Clause_Chain is procedure Update_Chain_In_Scope (Level : Int); -- Iterate through one level in the scope stack verifying each use-type -- clause within said level is used then reset the Current_Use_Clause -- to a redundant use clause outside of the current ending scope if such -- a clause exists. --------------------------- -- Update_Chain_In_Scope -- --------------------------- procedure Update_Chain_In_Scope (Level : Int) is Curr : Node_Id; N : Node_Id; begin -- Loop through all use clauses within the scope dictated by Level Curr := Scope_Stack.Table (Level).First_Use_Clause; while Present (Curr) loop -- Retrieve the subtype mark or name within the current current -- use clause. if Nkind (Curr) = N_Use_Type_Clause then N := Subtype_Mark (Curr); else N := Name (Curr); end if; -- If warnings for unreferenced entities are enabled and the -- current use clause has not been marked effective. if Check_Unreferenced and then Comes_From_Source (Curr) and then not Is_Effective_Use_Clause (Curr) and then not In_Instance and then not In_Inlined_Body then -- We are dealing with a potentially unused use_package_clause if Nkind (Curr) = N_Use_Package_Clause then -- Renamings and formal subprograms may cause the associated -- node to be marked as effective instead of the original. if not (Present (Associated_Node (N)) and then Present (Current_Use_Clause (Associated_Node (N))) and then Is_Effective_Use_Clause (Current_Use_Clause (Associated_Node (N)))) then Error_Msg_Node_1 := Entity (N); Error_Msg_NE ("use clause for package & has no effect?u?", Curr, Entity (N)); end if; -- We are dealing with an unused use_type_clause else Error_Msg_Node_1 := Etype (N); Error_Msg_NE ("use clause for } has no effect?u?", Curr, Etype (N)); end if; end if; -- Verify that we haven't already processed a redundant -- use_type_clause within the same scope before we move the -- current use clause up to a previous one for type T. if Present (Prev_Use_Clause (Curr)) then Set_Current_Use_Clause (Entity (N), Prev_Use_Clause (Curr)); end if; Next_Use_Clause (Curr); end loop; end Update_Chain_In_Scope; -- Start of processing for Update_Use_Clause_Chain begin Update_Chain_In_Scope (Scope_Stack.Last); -- Deal with use clauses within the context area if the current -- scope is a compilation unit. if Is_Compilation_Unit (Current_Scope) and then Sloc (Scope_Stack.Table (Scope_Stack.Last - 1).Entity) = Standard_Location then Update_Chain_In_Scope (Scope_Stack.Last - 1); end if; end Update_Use_Clause_Chain; --------------------- -- Use_One_Package -- --------------------- procedure Use_One_Package (N : Node_Id; Pack_Name : Entity_Id := Empty; Force : Boolean := False) is procedure Note_Redundant_Use (Clause : Node_Id); -- Mark the name in a use clause as redundant if the corresponding -- entity is already use-visible. Emit a warning if the use clause comes -- from source and the proper warnings are enabled. ------------------------ -- Note_Redundant_Use -- ------------------------ procedure Note_Redundant_Use (Clause : Node_Id) is Decl : constant Node_Id := Parent (Clause); Pack_Name : constant Entity_Id := Entity (Clause); Cur_Use : Node_Id := Current_Use_Clause (Pack_Name); Prev_Use : Node_Id := Empty; Redundant : Node_Id := Empty; -- The Use_Clause which is actually redundant. In the simplest case -- it is Pack itself, but when we compile a body we install its -- context before that of its spec, in which case it is the -- use_clause in the spec that will appear to be redundant, and we -- want the warning to be placed on the body. Similar complications -- appear when the redundancy is between a child unit and one of its -- ancestors. begin -- Could be renamed... if No (Cur_Use) then Cur_Use := Current_Use_Clause (Renamed_Entity (Pack_Name)); end if; Set_Redundant_Use (Clause, True); -- Do not check for redundant use if clause is generated, or in an -- instance, or in a predefined unit to avoid misleading warnings -- that may occur as part of a rtsfind load. if not Comes_From_Source (Clause) or else In_Instance or else not Warn_On_Redundant_Constructs or else Is_Predefined_Unit (Current_Sem_Unit) then return; end if; if not Is_Compilation_Unit (Current_Scope) then -- If the use_clause is in an inner scope, it is made redundant by -- some clause in the current context, with one exception: If we -- are compiling a nested package body, and the use_clause comes -- from then corresponding spec, the clause is not necessarily -- fully redundant, so we should not warn. If a warning was -- warranted, it would have been given when the spec was -- processed. if Nkind (Parent (Decl)) = N_Package_Specification then declare Package_Spec_Entity : constant Entity_Id := Defining_Unit_Name (Parent (Decl)); begin if In_Package_Body (Package_Spec_Entity) then return; end if; end; end if; Redundant := Clause; Prev_Use := Cur_Use; elsif Nkind (Unit (Cunit (Current_Sem_Unit))) = N_Package_Body then declare Cur_Unit : constant Unit_Number_Type := Get_Source_Unit (Cur_Use); New_Unit : constant Unit_Number_Type := Get_Source_Unit (Clause); Scop : Entity_Id; begin if Cur_Unit = New_Unit then -- Redundant clause in same body Redundant := Clause; Prev_Use := Cur_Use; elsif Cur_Unit = Current_Sem_Unit then -- If the new clause is not in the current unit it has been -- analyzed first, and it makes the other one redundant. -- However, if the new clause appears in a subunit, Cur_Unit -- is still the parent, and in that case the redundant one -- is the one appearing in the subunit. if Nkind (Unit (Cunit (New_Unit))) = N_Subunit then Redundant := Clause; Prev_Use := Cur_Use; -- Most common case: redundant clause in body, original -- clause in spec. Current scope is spec entity. elsif Current_Scope = Cunit_Entity (Current_Sem_Unit) then Redundant := Cur_Use; Prev_Use := Clause; else -- The new clause may appear in an unrelated unit, when -- the parents of a generic are being installed prior to -- instantiation. In this case there must be no warning. -- We detect this case by checking whether the current -- top of the stack is related to the current -- compilation. Scop := Current_Scope; while Present (Scop) and then Scop /= Standard_Standard loop if Is_Compilation_Unit (Scop) and then not Is_Child_Unit (Scop) then return; elsif Scop = Cunit_Entity (Current_Sem_Unit) then exit; end if; Scop := Scope (Scop); end loop; Redundant := Cur_Use; Prev_Use := Clause; end if; elsif New_Unit = Current_Sem_Unit then Redundant := Clause; Prev_Use := Cur_Use; else -- Neither is the current unit, so they appear in parent or -- sibling units. Warning will be emitted elsewhere. return; end if; end; elsif Nkind (Unit (Cunit (Current_Sem_Unit))) = N_Package_Declaration and then Present (Parent_Spec (Unit (Cunit (Current_Sem_Unit)))) then -- Use_clause is in child unit of current unit, and the child unit -- appears in the context of the body of the parent, so it has -- been installed first, even though it is the redundant one. -- Depending on their placement in the context, the visible or the -- private parts of the two units, either might appear as -- redundant, but the message has to be on the current unit. if Get_Source_Unit (Cur_Use) = Current_Sem_Unit then Redundant := Cur_Use; Prev_Use := Clause; else Redundant := Clause; Prev_Use := Cur_Use; end if; -- If the new use clause appears in the private part of a parent -- unit it may appear to be redundant w.r.t. a use clause in a -- child unit, but the previous use clause was needed in the -- visible part of the child, and no warning should be emitted. if Nkind (Parent (Decl)) = N_Package_Specification and then List_Containing (Decl) = Private_Declarations (Parent (Decl)) then declare Par : constant Entity_Id := Defining_Entity (Parent (Decl)); Spec : constant Node_Id := Specification (Unit (Cunit (Current_Sem_Unit))); Cur_List : constant List_Id := List_Containing (Cur_Use); begin if Is_Compilation_Unit (Par) and then Par /= Cunit_Entity (Current_Sem_Unit) then if Cur_List = Context_Items (Cunit (Current_Sem_Unit)) or else Cur_List = Visible_Declarations (Spec) then return; end if; end if; end; end if; -- Finally, if the current use clause is in the context then the -- clause is redundant when it is nested within the unit. elsif Nkind (Parent (Cur_Use)) = N_Compilation_Unit and then Nkind (Parent (Parent (Clause))) /= N_Compilation_Unit and then Get_Source_Unit (Cur_Use) = Get_Source_Unit (Clause) then Redundant := Clause; Prev_Use := Cur_Use; end if; if Present (Redundant) and then Parent (Redundant) /= Prev_Use then -- Make sure we are looking at most-descendant use_package_clause -- by traversing the chain with Find_Most_Prev and then verifying -- there is no scope manipulation via Most_Descendant_Use_Clause. if Nkind (Prev_Use) = N_Use_Package_Clause and then (Nkind (Parent (Prev_Use)) /= N_Compilation_Unit or else Most_Descendant_Use_Clause (Prev_Use, Find_Most_Prev (Prev_Use)) /= Prev_Use) then Prev_Use := Find_Most_Prev (Prev_Use); end if; Error_Msg_Sloc := Sloc (Prev_Use); Error_Msg_NE -- CODEFIX ("& is already use-visible through previous use_clause #?r?", Redundant, Pack_Name); end if; end Note_Redundant_Use; -- Local variables Current_Instance : Entity_Id := Empty; Id : Entity_Id; P : Entity_Id; Prev : Entity_Id; Private_With_OK : Boolean := False; Real_P : Entity_Id; -- Start of processing for Use_One_Package begin -- Use_One_Package may have been called recursively to handle an -- implicit use for a auxiliary system package, so set P accordingly -- and skip redundancy checks. if No (Pack_Name) and then Present_System_Aux (N) then P := System_Aux_Id; -- Check for redundant use_package_clauses else -- Ignore cases where we are dealing with a non user defined package -- like Standard_Standard or something other than a valid package. if not Is_Entity_Name (Pack_Name) or else No (Entity (Pack_Name)) or else Ekind (Entity (Pack_Name)) /= E_Package then return; end if; -- When a renaming exists we must check it for redundancy. The -- original package would have already been seen at this point. if Present (Renamed_Object (Entity (Pack_Name))) then P := Renamed_Object (Entity (Pack_Name)); else P := Entity (Pack_Name); end if; -- Check for redundant clauses then set the current use clause for -- P if were are not "forcing" an installation from a scope -- reinstallation that is done throughout analysis for various -- reasons. if In_Use (P) then Note_Redundant_Use (Pack_Name); if not Force then Set_Current_Use_Clause (P, N); end if; return; -- Warn about detected redundant clauses elsif not Force and then In_Open_Scopes (P) and then not Is_Hidden_Open_Scope (P) then if Warn_On_Redundant_Constructs and then P = Current_Scope then Error_Msg_NE -- CODEFIX ("& is already use-visible within itself?r?", Pack_Name, P); end if; return; end if; -- Set P back to the non-renamed package so that visiblilty of the -- entities within the package can be properly set below. P := Entity (Pack_Name); end if; Set_In_Use (P); Set_Current_Use_Clause (P, N); -- Ada 2005 (AI-50217): Check restriction if From_Limited_With (P) then Error_Msg_N ("limited withed package cannot appear in use clause", N); end if; -- Find enclosing instance, if any if In_Instance then Current_Instance := Current_Scope; while not Is_Generic_Instance (Current_Instance) loop Current_Instance := Scope (Current_Instance); end loop; if No (Hidden_By_Use_Clause (N)) then Set_Hidden_By_Use_Clause (N, New_Elmt_List); end if; end if; -- If unit is a package renaming, indicate that the renamed package is -- also in use (the flags on both entities must remain consistent, and a -- subsequent use of either of them should be recognized as redundant). if Present (Renamed_Object (P)) then Set_In_Use (Renamed_Object (P)); Set_Current_Use_Clause (Renamed_Object (P), N); Real_P := Renamed_Object (P); else Real_P := P; end if; -- Ada 2005 (AI-262): Check the use_clause of a private withed package -- found in the private part of a package specification if In_Private_Part (Current_Scope) and then Has_Private_With (P) and then Is_Child_Unit (Current_Scope) and then Is_Child_Unit (P) and then Is_Ancestor_Package (Scope (Current_Scope), P) then Private_With_OK := True; end if; -- Loop through entities in one package making them potentially -- use-visible. Id := First_Entity (P); while Present (Id) and then (Id /= First_Private_Entity (P) or else Private_With_OK) -- Ada 2005 (AI-262) loop Prev := Current_Entity (Id); while Present (Prev) loop if Is_Immediately_Visible (Prev) and then (not Is_Overloadable (Prev) or else not Is_Overloadable (Id) or else (Type_Conformant (Id, Prev))) then if No (Current_Instance) then -- Potentially use-visible entity remains hidden goto Next_Usable_Entity; -- A use clause within an instance hides outer global entities, -- which are not used to resolve local entities in the -- instance. Note that the predefined entities in Standard -- could not have been hidden in the generic by a use clause, -- and therefore remain visible. Other compilation units whose -- entities appear in Standard must be hidden in an instance. -- To determine whether an entity is external to the instance -- we compare the scope depth of its scope with that of the -- current instance. However, a generic actual of a subprogram -- instance is declared in the wrapper package but will not be -- hidden by a use-visible entity. similarly, an entity that is -- declared in an enclosing instance will not be hidden by an -- an entity declared in a generic actual, which can only have -- been use-visible in the generic and will not have hidden the -- entity in the generic parent. -- If Id is called Standard, the predefined package with the -- same name is in the homonym chain. It has to be ignored -- because it has no defined scope (being the only entity in -- the system with this mandated behavior). elsif not Is_Hidden (Id) and then Present (Scope (Prev)) and then not Is_Wrapper_Package (Scope (Prev)) and then Scope_Depth (Scope (Prev)) < Scope_Depth (Current_Instance) and then (Scope (Prev) /= Standard_Standard or else Sloc (Prev) > Standard_Location) then if In_Open_Scopes (Scope (Prev)) and then Is_Generic_Instance (Scope (Prev)) and then Present (Associated_Formal_Package (P)) then null; else Set_Is_Potentially_Use_Visible (Id); Set_Is_Immediately_Visible (Prev, False); Append_Elmt (Prev, Hidden_By_Use_Clause (N)); end if; end if; -- A user-defined operator is not use-visible if the predefined -- operator for the type is immediately visible, which is the case -- if the type of the operand is in an open scope. This does not -- apply to user-defined operators that have operands of different -- types, because the predefined mixed mode operations (multiply -- and divide) apply to universal types and do not hide anything. elsif Ekind (Prev) = E_Operator and then Operator_Matches_Spec (Prev, Id) and then In_Open_Scopes (Scope (Base_Type (Etype (First_Formal (Id))))) and then (No (Next_Formal (First_Formal (Id))) or else Etype (First_Formal (Id)) = Etype (Next_Formal (First_Formal (Id))) or else Chars (Prev) = Name_Op_Expon) then goto Next_Usable_Entity; -- In an instance, two homonyms may become use_visible through the -- actuals of distinct formal packages. In the generic, only the -- current one would have been visible, so make the other one -- not use_visible. -- In certain pathological cases it is possible that unrelated -- homonyms from distinct formal packages may exist in an -- uninstalled scope. We must test for that here. elsif Present (Current_Instance) and then Is_Potentially_Use_Visible (Prev) and then not Is_Overloadable (Prev) and then Scope (Id) /= Scope (Prev) and then Used_As_Generic_Actual (Scope (Prev)) and then Used_As_Generic_Actual (Scope (Id)) and then Is_List_Member (Scope (Prev)) and then not In_Same_List (Current_Use_Clause (Scope (Prev)), Current_Use_Clause (Scope (Id))) then Set_Is_Potentially_Use_Visible (Prev, False); Append_Elmt (Prev, Hidden_By_Use_Clause (N)); end if; Prev := Homonym (Prev); end loop; -- On exit, we know entity is not hidden, unless it is private if not Is_Hidden (Id) and then ((not Is_Child_Unit (Id)) or else Is_Visible_Lib_Unit (Id)) then Set_Is_Potentially_Use_Visible (Id); if Is_Private_Type (Id) and then Present (Full_View (Id)) then Set_Is_Potentially_Use_Visible (Full_View (Id)); end if; end if; <<Next_Usable_Entity>> Next_Entity (Id); end loop; -- Child units are also made use-visible by a use clause, but they may -- appear after all visible declarations in the parent entity list. while Present (Id) loop if Is_Child_Unit (Id) and then Is_Visible_Lib_Unit (Id) then Set_Is_Potentially_Use_Visible (Id); end if; Next_Entity (Id); end loop; if Chars (Real_P) = Name_System and then Scope (Real_P) = Standard_Standard and then Present_System_Aux (N) then Use_One_Package (N); end if; end Use_One_Package; ------------------ -- Use_One_Type -- ------------------ procedure Use_One_Type (Id : Node_Id; Installed : Boolean := False; Force : Boolean := False) is function Spec_Reloaded_For_Body return Boolean; -- Determine whether the compilation unit is a package body and the use -- type clause is in the spec of the same package. Even though the spec -- was analyzed first, its context is reloaded when analysing the body. procedure Use_Class_Wide_Operations (Typ : Entity_Id); -- AI05-150: if the use_type_clause carries the "all" qualifier, -- class-wide operations of ancestor types are use-visible if the -- ancestor type is visible. ---------------------------- -- Spec_Reloaded_For_Body -- ---------------------------- function Spec_Reloaded_For_Body return Boolean is begin if Nkind (Unit (Cunit (Current_Sem_Unit))) = N_Package_Body then declare Spec : constant Node_Id := Parent (List_Containing (Parent (Id))); begin -- Check whether type is declared in a package specification, -- and current unit is the corresponding package body. The -- use clauses themselves may be within a nested package. return Nkind (Spec) = N_Package_Specification and then In_Same_Source_Unit (Corresponding_Body (Parent (Spec)), Cunit_Entity (Current_Sem_Unit)); end; end if; return False; end Spec_Reloaded_For_Body; ------------------------------- -- Use_Class_Wide_Operations -- ------------------------------- procedure Use_Class_Wide_Operations (Typ : Entity_Id) is function Is_Class_Wide_Operation_Of (Op : Entity_Id; T : Entity_Id) return Boolean; -- Determine whether a subprogram has a class-wide parameter or -- result that is T'Class. --------------------------------- -- Is_Class_Wide_Operation_Of -- --------------------------------- function Is_Class_Wide_Operation_Of (Op : Entity_Id; T : Entity_Id) return Boolean is Formal : Entity_Id; begin Formal := First_Formal (Op); while Present (Formal) loop if Etype (Formal) = Class_Wide_Type (T) then return True; end if; Next_Formal (Formal); end loop; if Etype (Op) = Class_Wide_Type (T) then return True; end if; return False; end Is_Class_Wide_Operation_Of; -- Local variables Ent : Entity_Id; Scop : Entity_Id; -- Start of processing for Use_Class_Wide_Operations begin Scop := Scope (Typ); if not Is_Hidden (Scop) then Ent := First_Entity (Scop); while Present (Ent) loop if Is_Overloadable (Ent) and then Is_Class_Wide_Operation_Of (Ent, Typ) and then not Is_Potentially_Use_Visible (Ent) then Set_Is_Potentially_Use_Visible (Ent); Append_Elmt (Ent, Used_Operations (Parent (Id))); end if; Next_Entity (Ent); end loop; end if; if Is_Derived_Type (Typ) then Use_Class_Wide_Operations (Etype (Base_Type (Typ))); end if; end Use_Class_Wide_Operations; -- Local variables Elmt : Elmt_Id; Is_Known_Used : Boolean; Op_List : Elist_Id; T : Entity_Id; -- Start of processing for Use_One_Type begin if Entity (Id) = Any_Type then return; end if; -- It is the type determined by the subtype mark (8.4(8)) whose -- operations become potentially use-visible. T := Base_Type (Entity (Id)); -- Either the type itself is used, the package where it is declared is -- in use or the entity is declared in the current package, thus -- use-visible. Is_Known_Used := (In_Use (T) and then ((Present (Current_Use_Clause (T)) and then All_Present (Current_Use_Clause (T))) or else not All_Present (Parent (Id)))) or else In_Use (Scope (T)) or else Scope (T) = Current_Scope; Set_Redundant_Use (Id, Is_Known_Used or else Is_Potentially_Use_Visible (T)); if Ekind (T) = E_Incomplete_Type then Error_Msg_N ("premature usage of incomplete type", Id); elsif In_Open_Scopes (Scope (T)) then null; -- A limited view cannot appear in a use_type_clause. However, an access -- type whose designated type is limited has the flag but is not itself -- a limited view unless we only have a limited view of its enclosing -- package. elsif From_Limited_With (T) and then From_Limited_With (Scope (T)) then Error_Msg_N ("incomplete type from limited view cannot appear in use clause", Id); -- If the use clause is redundant, Used_Operations will usually be -- empty, but we need to set it to empty here in one case: If we are -- instantiating a generic library unit, then we install the ancestors -- of that unit in the scope stack, which involves reprocessing use -- clauses in those ancestors. Such a use clause will typically have a -- nonempty Used_Operations unless it was redundant in the generic unit, -- even if it is redundant at the place of the instantiation. elsif Redundant_Use (Id) then -- We must avoid incorrectly setting the Current_Use_Clause when we -- are working with a redundant clause that has already been linked -- in the Prev_Use_Clause chain, otherwise the chain will break. if Present (Current_Use_Clause (T)) and then Present (Prev_Use_Clause (Current_Use_Clause (T))) and then Parent (Id) = Prev_Use_Clause (Current_Use_Clause (T)) then null; else Set_Current_Use_Clause (T, Parent (Id)); end if; Set_Used_Operations (Parent (Id), New_Elmt_List); -- If the subtype mark designates a subtype in a different package, -- we have to check that the parent type is visible, otherwise the -- use_type_clause is a no-op. Not clear how to do that??? else Set_Current_Use_Clause (T, Parent (Id)); Set_In_Use (T); -- If T is tagged, primitive operators on class-wide operands are -- also deemed available. Note that this is really necessary only -- in semantics-only mode, because the primitive operators are not -- fully constructed in this mode, but we do it in all modes for the -- sake of uniformity, as this should not matter in practice. if Is_Tagged_Type (T) then Set_In_Use (Class_Wide_Type (T)); end if; -- Iterate over primitive operations of the type. If an operation is -- already use_visible, it is the result of a previous use_clause, -- and already appears on the corresponding entity chain. If the -- clause is being reinstalled, operations are already use-visible. if Installed then null; else Op_List := Collect_Primitive_Operations (T); Elmt := First_Elmt (Op_List); while Present (Elmt) loop if (Nkind (Node (Elmt)) = N_Defining_Operator_Symbol or else Chars (Node (Elmt)) in Any_Operator_Name) and then not Is_Hidden (Node (Elmt)) and then not Is_Potentially_Use_Visible (Node (Elmt)) then Set_Is_Potentially_Use_Visible (Node (Elmt)); Append_Elmt (Node (Elmt), Used_Operations (Parent (Id))); elsif Ada_Version >= Ada_2012 and then All_Present (Parent (Id)) and then not Is_Hidden (Node (Elmt)) and then not Is_Potentially_Use_Visible (Node (Elmt)) then Set_Is_Potentially_Use_Visible (Node (Elmt)); Append_Elmt (Node (Elmt), Used_Operations (Parent (Id))); end if; Next_Elmt (Elmt); end loop; end if; if Ada_Version >= Ada_2012 and then All_Present (Parent (Id)) and then Is_Tagged_Type (T) then Use_Class_Wide_Operations (T); end if; end if; -- If warning on redundant constructs, check for unnecessary WITH if not Force and then Warn_On_Redundant_Constructs and then Is_Known_Used -- with P; with P; use P; -- package P is package X is package body X is -- type T ... use P.T; -- The compilation unit is the body of X. GNAT first compiles the -- spec of X, then proceeds to the body. At that point P is marked -- as use visible. The analysis then reinstalls the spec along with -- its context. The use clause P.T is now recognized as redundant, -- but in the wrong context. Do not emit a warning in such cases. -- Do not emit a warning either if we are in an instance, there is -- no redundancy between an outer use_clause and one that appears -- within the generic. and then not Spec_Reloaded_For_Body and then not In_Instance and then not In_Inlined_Body then -- The type already has a use clause if In_Use (T) then -- Case where we know the current use clause for the type if Present (Current_Use_Clause (T)) then Use_Clause_Known : declare Clause1 : constant Node_Id := Find_Most_Prev (Current_Use_Clause (T)); Clause2 : constant Node_Id := Parent (Id); Ent1 : Entity_Id; Ent2 : Entity_Id; Err_No : Node_Id; Unit1 : Node_Id; Unit2 : Node_Id; -- Start of processing for Use_Clause_Known begin -- If both current use_type_clause and the use_type_clause -- for the type are at the compilation unit level, one of -- the units must be an ancestor of the other, and the -- warning belongs on the descendant. if Nkind (Parent (Clause1)) = N_Compilation_Unit and then Nkind (Parent (Clause2)) = N_Compilation_Unit then -- If the unit is a subprogram body that acts as spec, -- the context clause is shared with the constructed -- subprogram spec. Clearly there is no redundancy. if Clause1 = Clause2 then return; end if; Unit1 := Unit (Parent (Clause1)); Unit2 := Unit (Parent (Clause2)); -- If both clauses are on same unit, or one is the body -- of the other, or one of them is in a subunit, report -- redundancy on the later one. if Unit1 = Unit2 or else Nkind (Unit1) = N_Subunit then Error_Msg_Sloc := Sloc (Current_Use_Clause (T)); Error_Msg_NE -- CODEFIX ("& is already use-visible through previous " & "use_type_clause #??", Clause1, T); return; elsif Nkind (Unit2) in N_Package_Body | N_Subprogram_Body and then Nkind (Unit1) /= Nkind (Unit2) and then Nkind (Unit1) /= N_Subunit then Error_Msg_Sloc := Sloc (Clause1); Error_Msg_NE -- CODEFIX ("& is already use-visible through previous " & "use_type_clause #??", Current_Use_Clause (T), T); return; end if; -- There is a redundant use_type_clause in a child unit. -- Determine which of the units is more deeply nested. -- If a unit is a package instance, retrieve the entity -- and its scope from the instance spec. Ent1 := Entity_Of_Unit (Unit1); Ent2 := Entity_Of_Unit (Unit2); if Scope (Ent2) = Standard_Standard then Error_Msg_Sloc := Sloc (Current_Use_Clause (T)); Err_No := Clause1; elsif Scope (Ent1) = Standard_Standard then Error_Msg_Sloc := Sloc (Id); Err_No := Clause2; -- If both units are child units, we determine which one -- is the descendant by the scope distance to the -- ultimate parent unit. else declare S1 : Entity_Id; S2 : Entity_Id; begin S1 := Scope (Ent1); S2 := Scope (Ent2); while Present (S1) and then Present (S2) and then S1 /= Standard_Standard and then S2 /= Standard_Standard loop S1 := Scope (S1); S2 := Scope (S2); end loop; if S1 = Standard_Standard then Error_Msg_Sloc := Sloc (Id); Err_No := Clause2; else Error_Msg_Sloc := Sloc (Current_Use_Clause (T)); Err_No := Clause1; end if; end; end if; if Parent (Id) /= Err_No then if Most_Descendant_Use_Clause (Err_No, Parent (Id)) = Parent (Id) then Error_Msg_Sloc := Sloc (Err_No); Err_No := Parent (Id); end if; Error_Msg_NE -- CODEFIX ("& is already use-visible through previous " & "use_type_clause #??", Err_No, Id); end if; -- Case where current use_type_clause and use_type_clause -- for the type are not both at the compilation unit level. -- In this case we don't have location information. else Error_Msg_NE -- CODEFIX ("& is already use-visible through previous " & "use_type_clause??", Id, T); end if; end Use_Clause_Known; -- Here if Current_Use_Clause is not set for T, another case where -- we do not have the location information available. else Error_Msg_NE -- CODEFIX ("& is already use-visible through previous " & "use_type_clause??", Id, T); end if; -- The package where T is declared is already used elsif In_Use (Scope (T)) then -- Due to expansion of contracts we could be attempting to issue -- a spurious warning - so verify there is a previous use clause. if Current_Use_Clause (Scope (T)) /= Find_Most_Prev (Current_Use_Clause (Scope (T))) then Error_Msg_Sloc := Sloc (Find_Most_Prev (Current_Use_Clause (Scope (T)))); Error_Msg_NE -- CODEFIX ("& is already use-visible through package use clause #??", Id, T); end if; -- The current scope is the package where T is declared else Error_Msg_Node_2 := Scope (T); Error_Msg_NE -- CODEFIX ("& is already use-visible inside package &??", Id, T); end if; end if; end Use_One_Type; ---------------- -- Write_Info -- ---------------- procedure Write_Info is Id : Entity_Id := First_Entity (Current_Scope); begin -- No point in dumping standard entities if Current_Scope = Standard_Standard then return; end if; Write_Str ("========================================================"); Write_Eol; Write_Str (" Defined Entities in "); Write_Name (Chars (Current_Scope)); Write_Eol; Write_Str ("========================================================"); Write_Eol; if No (Id) then Write_Str ("-- none --"); Write_Eol; else while Present (Id) loop Write_Entity_Info (Id, " "); Next_Entity (Id); end loop; end if; if Scope (Current_Scope) = Standard_Standard then -- Print information on the current unit itself Write_Entity_Info (Current_Scope, " "); end if; Write_Eol; end Write_Info; -------- -- ws -- -------- procedure ws is S : Entity_Id; begin for J in reverse 1 .. Scope_Stack.Last loop S := Scope_Stack.Table (J).Entity; Write_Int (Int (S)); Write_Str (" === "); Write_Name (Chars (S)); Write_Eol; end loop; end ws; -------- -- we -- -------- procedure we (S : Entity_Id) is E : Entity_Id; begin E := First_Entity (S); while Present (E) loop Write_Int (Int (E)); Write_Str (" === "); Write_Name (Chars (E)); Write_Eol; Next_Entity (E); end loop; end we; end Sem_Ch8;

36.663776

79

0.550631

58c40a8d93ec9238197043d350f64f548559aa15

5,140

ads

Ada

source/amf/mofext/amf-internals-mof_elements.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/mofext/amf-internals-mof_elements.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/mofext/amf-internals-mof_elements.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$ ------------------------------------------------------------------------------ with AMF.CMOF.Classes; with AMF.CMOF.Properties; with AMF.Extents; with AMF.Internals.Elements; with League.Holders; package AMF.Internals.MOF_Elements is type MOF_Element_Proxy is abstract limited new AMF.Internals.Elements.Element_Base with null record; overriding function Get (Self : not null access constant MOF_Element_Proxy; Property : not null AMF.CMOF.Properties.CMOF_Property_Access) return League.Holders.Holder; overriding function Get_Meta_Class (Self : not null access constant MOF_Element_Proxy) return AMF.CMOF.Classes.CMOF_Class_Access; -- overriding function Get_Owned_Comment -- (Self : not null access constant CMOF_Element_Proxy) -- return AMF.CMOF.Comments.Collections.Set_Of_CMOF_Comment; -- -- overriding function Get_Owned_Element -- (Self : not null access constant CMOF_Element_Proxy) -- return AMF.CMOF.Elements.Collections.Set_Of_CMOF_Element; -- -- overriding function Get_Owner -- (Self : not null access constant CMOF_Element_Proxy) -- return AMF.CMOF.Elements.CMOF_Element_Access; overriding procedure Set (Self : not null access MOF_Element_Proxy; Property : not null AMF.CMOF.Properties.CMOF_Property_Access; Value : League.Holders.Holder); overriding function Extent (Self : not null access constant MOF_Element_Proxy) return AMF.Extents.Extent_Access; -- overriding function Must_Be_Owned -- (Self : not null access constant MOF_Element_Proxy) return Boolean; -- -- Operation Element::mustBeOwned. -- -- -- -- The query mustBeOwned() indicates whether elements of this type must -- -- have an owner. Subclasses of Element that do not require an owner must -- -- override this operation. end AMF.Internals.MOF_Elements;

54.680851

79

0.511673

593e47cb36ff56ba546c85144803aefee4958028

14,621

ads

Ada

source/xml/sax/xml-sax-content_handlers.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/xml/sax/xml-sax-content_handlers.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/xml/sax/xml-sax-content_handlers.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- XML Processor -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2010, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ with League.Strings; with XML.SAX.Attributes; with XML.SAX.Locators; package XML.SAX.Content_Handlers is pragma Preelaborate; type SAX_Content_Handler is limited interface; not overriding procedure Characters (Self : in out SAX_Content_Handler; Text : League.Strings.Universal_String; Success : in out Boolean) is null; -- The reader calls this subprogram when it has parsed a chunk of character -- data (either normal character data or character data inside a CDATA -- section; if you need to distinguish between those two types you must use -- SAX_Lexical_Handler.Start_CDATA and SAX_Lexical_Handler.End_CDATA -- subprograms). The character data is reported in Text. -- -- Some readers report whitespace in element content using the -- Ignorable_Whitespace subprogram rather than using this one. -- -- A reader may return all contiguous character data in a single chunk, or -- may split it into several chunks; however, all of the characters in any -- single event must come from the same external entity so that the Locator -- provides useful information. -- -- If this subprogram sets Success to False the reader stops parsing and -- reports an error. The reader uses the function Error_String to get the -- error message. not overriding procedure End_Document (Self : in out SAX_Content_Handler; Success : in out Boolean) is null; -- The reader calls this subprogram after it has finished parsing. It is -- called just once, and is the last subprogram called. It is called after -- the reader has read all input or has abandoned parsing because of fatal -- error. -- -- If this subprogram sets Success to False the reader stops parsing and -- reports an error. The reader uses the function Error_String to get the -- error message. not overriding procedure End_Element (Self : in out SAX_Content_Handler; Namespace_URI : League.Strings.Universal_String; Local_Name : League.Strings.Universal_String; Qualified_Name : League.Strings.Universal_String; Success : in out Boolean) is null; -- The reader calls this function when it has parsed an end element tag -- with the qualified name Qualified_Name, the local name Local_Name and -- the namespace URI Namespace_URI. It is called even when element is -- empty. -- -- Namespace_URI and Local_Name is provided only when namespace handling -- is enabled, otherwise they are an empty strings. -- -- If this subprogram sets Success to False the reader stops parsing and -- reports an error. The reader uses the function Error_String to get the -- error message. not overriding procedure End_Prefix_Mapping (Self : in out SAX_Content_Handler; Prefix : League.Strings.Universal_String; Success : in out Boolean) is null; -- The reader calls this subprogram to signal the end of a prefix mapping -- for the prefix Prefix. -- -- These events always occur immediately after the corresponding -- End_Element event, but the order of End_Prefix_Mapping events is not -- otherwise guaranteed. -- -- If this subprogram sets Success to False the reader stops parsing and -- reports an error. The reader uses the function Error_String to get the -- error message. not overriding function Error_String (Self : SAX_Content_Handler) return League.Strings.Universal_String is abstract; -- The reader calls this function to get an error string, e.g. if any of -- the handler subprograms sets Success to False. not overriding procedure Ignorable_Whitespace (Self : in out SAX_Content_Handler; Text : League.Strings.Universal_String; Success : in out Boolean) is null; -- Validating readers must use this subprogram to report each chunk of -- whitespace in element content, non-validating readers may also use this -- subprogram if they are capable of parsing and using content model, The -- whitespace is reported in Text. -- -- SAX readers may return all contiguous whitespace in a single chunk, or -- they may split it into several chunks; however, all of the characters in -- any single event must come from the same external entity, so that the -- Locator provides useful information. -- -- If this subprogram sets Success to False the reader stops parsing and -- reports an error. The reader uses the function Error_String to get the -- error message. not overriding procedure Processing_Instruction (Self : in out SAX_Content_Handler; Target : League.Strings.Universal_String; Data : League.Strings.Universal_String; Success : in out Boolean) is null; -- The reader calls this subprogram when it has parsed a processing -- instruction. Target is the name of the processing instruction and Data -- is the data in the processing instruction. -- -- The reader must never report an XML declaration or a text declaration -- using this subprogram. -- -- If this subprogram sets Success to False the reader stops parsing and -- reports an error. The reader uses the function Error_String to get the -- error message. not overriding procedure Set_Document_Locator (Self : in out SAX_Content_Handler; Locator : XML.SAX.Locators.SAX_Locator) is null; -- The reader calls this subprogram before is starts parsing the document. -- Argument Locator is object which allows the application to get the -- parsing position within the document. -- -- The locator allows the application to determine the end position of any -- document-related event, even if the parser is not reporting an error. -- Typically, the application will use this information for reporting its -- own errors (such as character content that does not match an -- application's business rules). The information returned by the locator -- is probably not sufficient for use with a search engine. -- -- Note that the locator will return correct information only during the -- invocation SAX event callbacks after Start_Document returns and before -- End_Document is called. The application should not attempt to use it at -- any other time. not overriding procedure Skipped_Entity (Self : in out SAX_Content_Handler; Name : League.Strings.Universal_String; Success : in out Boolean) is null; -- Some readers may skip entities if they have not seen the declaration. -- If they do so they report that they skipped the entity called Name by -- calling this subprogram. -- -- This is not called for entity references within markup constructs such -- as element start tags or markup declarations. (The XML recommendation -- requires reporting skipped external entities. SAX also reports internal -- entity expansion/non-expansion, except within markup constructs.) -- -- Non-validating processors may skip entities if they have not seen the -- declarations (because, for example, the entity was declared in an -- external DTD subset). All processors may skip external entities, -- depending on the values of the -- http://xml.org/sax/features/external-general-entities and the -- http://xml.org/sax/features/external-parameter-entities properties. -- -- If this subprogram sets Success to False the reader stops parsing and -- reports an error. The reader uses the function Error_String to get the -- error message. not overriding procedure Start_Document (Self : in out SAX_Content_Handler; Success : in out Boolean) is null; -- The reader calls this subprogram when it starts parsing the document. -- The reader calls this subprogram just once, after the call to -- Set_Document_Locator, and before and other subprogram in this -- interface or in the SAX_DTD_Handler interface are called. -- -- If this subprogram sets Success to False the reader stops parsing and -- reports an error. The reader uses the function Error_String to get the -- error message. not overriding procedure Start_Element (Self : in out SAX_Content_Handler; Namespace_URI : League.Strings.Universal_String; Local_Name : League.Strings.Universal_String; Qualified_Name : League.Strings.Universal_String; Attributes : XML.SAX.Attributes.SAX_Attributes; Success : in out Boolean) is null; -- The reader calls this subprogram when it has parsed a start element tag. -- -- There is a corresponding End_Element call when the corresponding and -- element tag is read. The Start_Element and End_Element calls are always -- nested correctly. Empty element tags (e.g. <x/>) cause a Start_Element -- call to be immediately followed by and End_Element call. -- -- The attribute list provided only contains attributes with explicit -- values (specified or defaulted): #IMPLIED attributes will be omitted. -- The attribute list contains attributes used for namespace -- declaration (i.e. attributes starting with xmlns) only if the -- http://xml.org/sax/features/namespace-prefixes property of the reader is -- true. -- -- The argument Namespace_URI is the namespace URI, or an empty string if -- the element has no namespace URI or if no namespace processing is done. -- Local_Name is the local name (without prefix), or an empty string if no -- namespace processing is done, Qualified_Name is the qualified name (with -- prefix) and Attributes are the attributes attached to the element. If -- there are no attributes, Attributes is an empty attributes object. -- -- If this subprogram sets Success to False the reader stops parsing and -- reports an error. The reader uses the function Error_String to get the -- error message. not overriding procedure Start_Prefix_Mapping (Self : in out SAX_Content_Handler; Prefix : League.Strings.Universal_String; Namespace_URI : League.Strings.Universal_String; Success : in out Boolean) is null; -- The reader calls this subprogram to signal the begin of a prefix-URI -- namespace mapping scope. This information is not necessary for normal -- namespace processing since the reader automatically replaces prefixes -- for element and attribute names. -- -- Note that Start_Prefix_Mapping and End_Prefix_Mapping calls are not -- guaranteed to be properly nested relative to each other: all -- Start_Prefix_Mapping events occur before the corresponding Start_Element -- event, and all End_Prefix_Mapping events occur after the corresponding -- End_Element event, but their order is not otherwise guaranteed. -- -- The argument Prefix is the namespace prefix being declared and the -- argument Namespace_URI is the namespace URI the prefix is mapped to. -- -- If this subprogram sets Success to False the reader stops parsing and -- reports an error. The reader uses the function Error_String to get the -- error message. end XML.SAX.Content_Handlers;

53.556777

79

0.645031

4a13c59812993dab7afca8db10432a7cfee054a6

5,281

adb

Ada

source/league/league-holders-generic_iterable_holders.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/league/league-holders-generic_iterable_holders.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/league/league-holders-generic_iterable_holders.adb

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 © 2016, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ package body League.Holders.Generic_Iterable_Holders is ----------------- -- Constructor -- ----------------- overriding function Constructor (Is_Empty : not null access Boolean) return Element_Container is pragma Assert (Is_Empty.all); begin return (Counter => <>, Is_Empty => Is_Empty.all, Value => <>); end Constructor; ------------- -- Element -- ------------- function Element (Self : Holder) return Element_Type is begin if Self.Data.all not in Element_Container then raise Constraint_Error with "invalid type of value"; end if; if Self.Data.Is_Empty then raise Constraint_Error with "value is empty"; end if; return Element_Container'Class (Self.Data.all).Value; end Element; ----------- -- First -- ----------- overriding function First (Self : not null access Element_Container) return Iterable_Holder_Cursors.Cursor'Class is begin return First (Self.Value); end First; --------------------- -- Replace_Element -- --------------------- procedure Replace_Element (Self : in out Holder; To : Element_Type) is begin if Self.Data.all not in Element_Container then raise Constraint_Error with "invalid type of value"; end if; -- XXX This subprogram can be improved to reuse shared segment when -- possible. Dereference (Self.Data); Self.Data := new Element_Container'(Counter => <>, Is_Empty => False, Value => To); end Replace_Element; --------------- -- To_Holder -- --------------- function To_Holder (Item : Element_Type) return Holder is begin return (Ada.Finalization.Controlled with new Element_Container' (Counter => <>, Is_Empty => False, Value => Item)); end To_Holder; end League.Holders.Generic_Iterable_Holders;

43.286885

79

0.465821

3d130dbb3789cd0b3d6f774a885a8184ad21a847

3,690

adb

Ada

perf/tsm.adb

yannickmoy/SPARKNaCl

c27fa811bf38b3706c1dc242f30e82967ad8f1c6

[ "BSD-2-Clause" ]

76

2020-02-24T20:30:15.000Z

2022-02-16T15:10:56.000Z

perf/tsm.adb

yannickmoy/SPARKNaCl

c27fa811bf38b3706c1dc242f30e82967ad8f1c6

[ "BSD-2-Clause" ]

10

2020-04-15T10:02:49.000Z

2022-02-24T20:10:46.000Z

perf/tsm.adb

yannickmoy/SPARKNaCl

c27fa811bf38b3706c1dc242f30e82967ad8f1c6

[ "BSD-2-Clause" ]

4

2020-03-10T15:19:45.000Z

2022-02-17T09:46:20.000Z

with HAL; use HAL; with HiFive1.LEDs; use HiFive1.LEDs; with FE310; with FE310.CLINT; with FE310.Time; use FE310.Time; with Interfaces; use Interfaces; with IO; with SPARKNaCl; use SPARKNaCl; with SPARKNaCl.Scalar; with TweetNaCl_API; with RISCV.CSR; use RISCV.CSR; with FE310.Performance_Monitor; use FE310.Performance_Monitor; procedure TSM is subtype U64 is Unsigned_64; N : constant Bytes_32 := (0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7); P : constant Bytes_32 := (10, 11, 12, 13, 14, 15, 16, 17, 10, 11, 12, 13, 14, 15, 16, 17, 10, 11, 12, 13, 14, 15, 16, 17, 10, 11, 12, 13, 14, 15, 16, 17); Q : Bytes_32; Q2 : Bytes_32; T1, T2 : UInt64; Total_Time : Unsigned_64; CPU_Hz1, CPU_Hz2 : UInt32; procedure Report; procedure Tweet_Mult (Q : out Bytes_32; N : in Bytes_32; P : in Bytes_32); procedure Tweet_Mult (Q : out Bytes_32; N : in Bytes_32; P : in Bytes_32) is begin TweetNaCl_API.Crypto_Scalarmult (Q, N, P); end Tweet_Mult; procedure Report is begin IO.Put_Line ("Total time: ", Total_Time); end Report; begin CPU_Hz1 := FE310.CPU_Frequency; -- The SPI flash clock divider should be as small as possible to increase -- the execution speed of instructions that are not yet in the instruction -- cache. FE310.Set_SPI_Flash_Clock_Divider (2); -- Load the internal oscillator factory calibration to be sure it -- oscillates at a known frequency. FE310.Load_Internal_Oscilator_Calibration; -- Use the HiFive1 16 MHz crystal oscillator which is more acurate than the -- internal oscillator. FE310.Use_Crystal_Oscillator; HiFive1.LEDs.Initialize; CPU_Hz2 := FE310.CPU_Frequency; IO.Put_Line ("CPU Frequency reset was: ", U64 (CPU_Hz1)); IO.Put_Line ("CPU Frequency now is: ", U64 (CPU_Hz2)); FE310.Performance_Monitor.Set_Commit_Events (3, No_Commit_Events); FE310.Performance_Monitor.Set_Commit_Events (4, No_Commit_Events); Turn_On (Red_LED); T1 := FE310.CLINT.Machine_Time; T2 := FE310.CLINT.Machine_Time; IO.Put_Line ("Null timing test:", U64 (T2 - T1)); T1 := Mcycle.Read; Delay_S (1); T2 := Mcycle.Read; IO.Put_Line ("One second test (CYCLE): ", U64 (T2 - T1)); T1 := Minstret.Read; Delay_S (1); T2 := Minstret.Read; IO.Put_Line ("One second test (INSTRET):", U64 (T2 - T1)); T1 := FE310.CLINT.Machine_Time; Delay_S (1); T2 := FE310.CLINT.Machine_Time; IO.Put_Line ("One second test (CLINT): ", U64 (T2 - T1)); IO.Put_Line ("SPARKNaCl.Scalar.Mult test"); T1 := Mcycle.Read; Q := SPARKNaCl.Scalar.Mult (N, P); T2 := Mcycle.Read; Total_Time := Unsigned_64 (T2 - T1); Report; Turn_Off (Red_LED); Turn_On (Green_LED); IO.New_Line; IO.Put_Line ("TweetNaCl.Scalar.Mult test"); T1 := Mcycle.Read; Tweet_Mult (Q2, N, P); T2 := Mcycle.Read; Total_Time := Unsigned_64 (T2 - T1); Report; if Q = Q2 then IO.Put ("Pass"); else IO.Put ("Fail"); end if; IO.New_Line; Turn_Off (Green_LED); -- Blinky! loop Turn_On (Red_LED); Delay_S (1); Turn_Off (Red_LED); Turn_On (Green_LED); Delay_S (1); Turn_Off (Green_LED); Turn_On (Blue_LED); Delay_S (1); Turn_Off (Blue_LED); end loop; end TSM;

23.961039

79

0.586179

58612fcc0eeb97092b99a449a957f431e8e1565f

180,606

adb

Ada

eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2/myproject_prj/solution1/.autopilot/db/Loop_2_proc.sched.adb

anmeza/platform_ml_models

ba8011a289a96013dd6f7a5b58eb1072f04d6bf0

[ "RSA-MD" ]

1

2021-12-21T18:19:27.000Z

eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2/myproject_prj/solution1/.autopilot/db/Loop_2_proc.sched.adb

anmeza/platform_ml_models

ba8011a289a96013dd6f7a5b58eb1072f04d6bf0

[ "RSA-MD" ]

null

eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2/myproject_prj/solution1/.autopilot/db/Loop_2_proc.sched.adb

anmeza/platform_ml_models

ba8011a289a96013dd6f7a5b58eb1072f04d6bf0

[ "RSA-MD" ]

null

<?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="15"> <syndb class_id="0" tracking_level="0" version="0"> <userIPLatency>-1</userIPLatency> <userIPName></userIPName> <cdfg class_id="1" tracking_level="1" version="0" object_id="_0"> <name>Loop_2_proc</name> <ret_bitwidth>0</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>13</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>out_data</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo class_id="6" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <direction>1</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs class_id="7" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_2"> <Value> <Obj> <type>1</type> <id>2</id> <name>out_last_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <direction>1</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_3"> <Value> <Obj> <type>1</type> <id>3</id> <name>p_read</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_4"> <Value> <Obj> <type>1</type> <id>4</id> <name>tmp_data_V_0</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_5"> <Value> <Obj> <type>1</type> <id>5</id> <name>tmp_data_V_1</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_6"> <Value> <Obj> <type>1</type> <id>6</id> <name>tmp_data_V_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>8</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_7"> <Value> <Obj> <type>1</type> <id>7</id> <name>tmp_data_V_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>8</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_8"> <Value> <Obj> <type>1</type> <id>8</id> <name>tmp_data_V_4</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>8</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="_9"> <Value> <Obj> <type>1</type> <id>9</id> <name>tmp_data_V_5</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>8</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="_10"> <Value> <Obj> <type>1</type> <id>10</id> <name>tmp_data_V_6</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>8</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="_11"> <Value> <Obj> <type>1</type> <id>11</id> <name>tmp_data_V_7</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>8</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="_12"> <Value> <Obj> <type>1</type> <id>12</id> <name>tmp_data_V_8</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>8</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="_13"> <Value> <Obj> <type>1</type> <id>13</id> <name>tmp_data_V_9</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>8</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>72</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_14"> <Value> <Obj> <type>0</type> <id>15</id> <name>p_read_1</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>93</item> <item>94</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>1</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_15"> <Value> <Obj> <type>0</type> <id>16</id> <name>_ln0</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>95</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.76</m_delay> <m_topoIndex>2</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_16"> <Value> <Obj> <type>0</type> <id>18</id> <name>j3_0_i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>j</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>97</item> <item>98</item> <item>99</item> <item>100</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>3</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_17"> <Value> <Obj> <type>0</type> <id>19</id> <name>icmp_ln37</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>37</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="11" tracking_level="0" version="0"> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</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>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>37</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>101</item> <item>103</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.30</m_delay> <m_topoIndex>4</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_18"> <Value> <Obj> <type>0</type> <id>21</id> <name>j</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>37</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>37</second> </item> </second> </item> </inlineStackInfo> <originalName>j</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>104</item> <item>106</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.73</m_delay> <m_topoIndex>5</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_19"> <Value> <Obj> <type>0</type> <id>22</id> <name>_ln37</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>37</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>37</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>107</item> <item>108</item> <item>109</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>6</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_20"> <Value> <Obj> <type>0</type> <id>24</id> <name>icmp_ln38</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>38</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>38</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>110</item> <item>112</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.30</m_delay> <m_topoIndex>7</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_21"> <Value> <Obj> <type>0</type> <id>25</id> <name>last</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>38</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>38</second> </item> </second> </item> </inlineStackInfo> <originalName>last</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>113</item> <item>114</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.97</m_delay> <m_topoIndex>8</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_22"> <Value> <Obj> <type>0</type> <id>26</id> <name>tmp_data_V_0_read</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>116</item> <item>117</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>9</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_23"> <Value> <Obj> <type>0</type> <id>27</id> <name>tmp_data_V_1_read</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>118</item> <item>119</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>10</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_24"> <Value> <Obj> <type>0</type> <id>28</id> <name>tmp_data_V_2_read</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>120</item> <item>121</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>11</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_25"> <Value> <Obj> <type>0</type> <id>29</id> <name>tmp_data_V_3_read</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>122</item> <item>123</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>12</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_26"> <Value> <Obj> <type>0</type> <id>30</id> <name>tmp_data_V_4_read</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>124</item> <item>125</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>13</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_27"> <Value> <Obj> <type>0</type> <id>31</id> <name>tmp_data_V_5_read</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>126</item> <item>127</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>14</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_28"> <Value> <Obj> <type>0</type> <id>32</id> <name>tmp_data_V_6_read</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>128</item> <item>129</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>15</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_29"> <Value> <Obj> <type>0</type> <id>33</id> <name>tmp_data_V_7_read</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>130</item> <item>131</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>16</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_30"> <Value> <Obj> <type>0</type> <id>34</id> <name>tmp_data_V_8_read</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>132</item> <item>133</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>17</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_31"> <Value> <Obj> <type>0</type> <id>35</id> <name>tmp_data_V_9_read</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>134</item> <item>135</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>18</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_32"> <Value> <Obj> <type>0</type> <id>36</id> <name>tmp_V_3</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>12</count> <item_version>0</item_version> <item>137</item> <item>138</item> <item>139</item> <item>140</item> <item>141</item> <item>142</item> <item>143</item> <item>144</item> <item>145</item> <item>146</item> <item>147</item> <item>148</item> </oprand_edges> <opcode>mux</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>2.63</m_delay> <m_topoIndex>19</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_33"> <Value> <Obj> <type>0</type> <id>37</id> <name>icmp_ln935</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>149</item> <item>151</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.55</m_delay> <m_topoIndex>22</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_34"> <Value> <Obj> <type>0</type> <id>38</id> <name>p_Result_6</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>153</item> <item>154</item> <item>156</item> </oprand_edges> <opcode>bitselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>20</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_35"> <Value> <Obj> <type>0</type> <id>39</id> <name>tmp_V</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>157</item> <item>158</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.91</m_delay> <m_topoIndex>23</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_36"> <Value> <Obj> <type>0</type> <id>40</id> <name>tmp_V_4</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>159</item> <item>160</item> <item>161</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.24</m_delay> <m_topoIndex>24</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_37"> <Value> <Obj> <type>0</type> <id>41</id> <name>p_Result_s</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>163</item> <item>164</item> <item>165</item> <item>167</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>25</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_38"> <Value> <Obj> <type>0</type> <id>42</id> <name>p_Result_7</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>169</item> <item>171</item> <item>172</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>26</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_39"> <Value> <Obj> <type>0</type> <id>43</id> <name>l</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName>l</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>174</item> <item>175</item> <item>177</item> </oprand_edges> <opcode>cttz</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>3.39</m_delay> <m_topoIndex>27</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_40"> <Value> <Obj> <type>0</type> <id>44</id> <name>sub_ln944</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>179</item> <item>180</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>2.55</m_delay> <m_topoIndex>29</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_41"> <Value> <Obj> <type>0</type> <id>45</id> <name>trunc_ln944</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>181</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>30</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_42"> <Value> <Obj> <type>0</type> <id>46</id> <name>lsb_index</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName>lsb_index</originalName> <rtlName></rtlName> <coreName></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>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>2.55</m_delay> <m_topoIndex>31</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_43"> <Value> <Obj> <type>0</type> <id>47</id> <name>tmp</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>31</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>186</item> <item>187</item> <item>189</item> <item>191</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>32</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_44"> <Value> <Obj> <type>0</type> <id>48</id> <name>icmp_ln947</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>192</item> <item>194</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>2.47</m_delay> <m_topoIndex>33</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_45"> <Value> <Obj> <type>0</type> <id>49</id> <name>trunc_ln947</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>195</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>34</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_46"> <Value> <Obj> <type>0</type> <id>50</id> <name>sub_ln947</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>196</item> <item>197</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.73</m_delay> <m_topoIndex>35</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_47"> <Value> <Obj> <type>0</type> <id>51</id> <name>zext_ln947</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>198</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>36</m_topoIndex> <m_clusterGroupNumber>1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_48"> <Value> <Obj> <type>0</type> <id>52</id> <name>lshr_ln947</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>200</item> <item>201</item> </oprand_edges> <opcode>lshr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>37</m_topoIndex> <m_clusterGroupNumber>1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_49"> <Value> <Obj> <type>0</type> <id>53</id> <name>p_Result_4</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>202</item> <item>203</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>38</m_topoIndex> <m_clusterGroupNumber>1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_50"> <Value> <Obj> <type>0</type> <id>54</id> <name>icmp_ln947_1</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>204</item> <item>205</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>2.39</m_delay> <m_topoIndex>39</m_topoIndex> <m_clusterGroupNumber>1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_51"> <Value> <Obj> <type>0</type> <id>55</id> <name>a</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName>a</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>206</item> <item>207</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>40</m_topoIndex> <m_clusterGroupNumber>2</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_52"> <Value> <Obj> <type>0</type> <id>56</id> <name>tmp_102</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>209</item> <item>210</item> <item>211</item> </oprand_edges> <opcode>bitselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>41</m_topoIndex> <m_clusterGroupNumber>2</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_53"> <Value> <Obj> <type>0</type> <id>57</id> <name>xor_ln949</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>212</item> <item>213</item> </oprand_edges> <opcode>xor</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>42</m_topoIndex> <m_clusterGroupNumber>2</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_54"> <Value> <Obj> <type>0</type> <id>58</id> <name>add_ln949</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>215</item> <item>216</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.91</m_delay> <m_topoIndex>43</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_55"> <Value> <Obj> <type>0</type> <id>59</id> <name>p_Result_3</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>218</item> <item>219</item> <item>220</item> </oprand_edges> <opcode>bitselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>44</m_topoIndex> <m_clusterGroupNumber>2</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_56"> <Value> <Obj> <type>0</type> <id>60</id> <name>and_ln949</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>221</item> <item>222</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>45</m_topoIndex> <m_clusterGroupNumber>2</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_57"> <Value> <Obj> <type>0</type> <id>61</id> <name>or_ln949</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>223</item> <item>224</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>46</m_topoIndex> <m_clusterGroupNumber>2</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_58"> <Value> <Obj> <type>0</type> <id>62</id> <name>or_ln_i</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>226</item> <item>227</item> <item>228</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.97</m_delay> <m_topoIndex>47</m_topoIndex> <m_clusterGroupNumber>2</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_59"> <Value> <Obj> <type>0</type> <id>63</id> <name>m</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName>m</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>229</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>49</m_topoIndex> <m_clusterGroupNumber>3</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_60"> <Value> <Obj> <type>0</type> <id>64</id> <name>zext_ln957_1</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>230</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>50</m_topoIndex> <m_clusterGroupNumber>3</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_61"> <Value> <Obj> <type>0</type> <id>65</id> <name>icmp_ln958</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>231</item> <item>232</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>2.47</m_delay> <m_topoIndex>48</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_62"> <Value> <Obj> <type>0</type> <id>66</id> <name>add_ln958</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>234</item> <item>235</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>2.55</m_delay> <m_topoIndex>51</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_63"> <Value> <Obj> <type>0</type> <id>67</id> <name>lshr_ln958</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>236</item> <item>237</item> </oprand_edges> <opcode>lshr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>52</m_topoIndex> <m_clusterGroupNumber>3</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_64"> <Value> <Obj> <type>0</type> <id>68</id> <name>zext_ln958</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>238</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>53</m_topoIndex> <m_clusterGroupNumber>3</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_65"> <Value> <Obj> <type>0</type> <id>69</id> <name>sub_ln958</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>240</item> <item>241</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>2.55</m_delay> <m_topoIndex>54</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_66"> <Value> <Obj> <type>0</type> <id>70</id> <name>zext_ln958_1</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>242</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>55</m_topoIndex> <m_clusterGroupNumber>3</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_67"> <Value> <Obj> <type>0</type> <id>71</id> <name>shl_ln958</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</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>243</item> <item>244</item> </oprand_edges> <opcode>shl</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>56</m_topoIndex> <m_clusterGroupNumber>3</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_68"> <Value> <Obj> <type>0</type> <id>72</id> <name>m_1</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName>m</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>245</item> <item>246</item> <item>247</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>57</m_topoIndex> <m_clusterGroupNumber>3</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_69"> <Value> <Obj> <type>0</type> <id>73</id> <name>zext_ln961</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>248</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>58</m_topoIndex> <m_clusterGroupNumber>3</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_70"> <Value> <Obj> <type>0</type> <id>74</id> <name>m_2</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName>m</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>249</item> <item>250</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>4.42</m_delay> <m_topoIndex>59</m_topoIndex> <m_clusterGroupNumber>3</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_71"> <Value> <Obj> <type>0</type> <id>75</id> <name>m_5</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>63</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>252</item> <item>253</item> <item>254</item> <item>256</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>60</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_72"> <Value> <Obj> <type>0</type> <id>76</id> <name>m_6</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName>m</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>257</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>62</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_73"> <Value> <Obj> <type>0</type> <id>77</id> <name>tmp_103</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>259</item> <item>260</item> <item>261</item> </oprand_edges> <opcode>bitselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>61</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_74"> <Value> <Obj> <type>0</type> <id>78</id> <name>select_ln964</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>262</item> <item>264</item> <item>266</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.24</m_delay> <m_topoIndex>63</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_75"> <Value> <Obj> <type>0</type> <id>79</id> <name>trunc_ln943</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>267</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>28</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_76"> <Value> <Obj> <type>0</type> <id>80</id> <name>sub_ln964</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>269</item> <item>270</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>64</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_77"> <Value> <Obj> <type>0</type> <id>81</id> <name>add_ln964</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>271</item> <item>272</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>3.66</m_delay> <m_topoIndex>65</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_78"> <Value> <Obj> <type>0</type> <id>82</id> <name>tmp_429_i</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>9</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>274</item> <item>275</item> <item>276</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>66</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_79"> <Value> <Obj> <type>0</type> <id>83</id> <name>p_Result_8</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>5</count> <item_version>0</item_version> <item>278</item> <item>279</item> <item>280</item> <item>282</item> <item>283</item> </oprand_edges> <opcode>partset</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>67</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_80"> <Value> <Obj> <type>0</type> <id>84</id> <name>trunc_ln738</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>284</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>68</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_81"> <Value> <Obj> <type>0</type> <id>85</id> <name>bitcast_ln739</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>285</item> </oprand_edges> <opcode>bitcast</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>69</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_82"> <Value> <Obj> <type>0</type> <id>86</id> <name>select_ln935</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>39</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>286</item> <item>288</item> <item>289</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.69</m_delay> <m_topoIndex>70</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_83"> <Value> <Obj> <type>0</type> <id>87</id> <name>out_last_V_write_ln23</name> <fileName>firmware/myproject_axi.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>23</lineNumber> <contextFuncName>operator=</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>39</second> </item> <item> <first> <first>firmware/myproject_axi.h</first> <second>operator=</second> </first> <second>23</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>5</count> <item_version>0</item_version> <item>291</item> <item>292</item> <item>293</item> <item>294</item> <item>295</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>71</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_84"> <Value> <Obj> <type>0</type> <id>88</id> <name>_ln37</name> <fileName>firmware/myproject_axi.cpp</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>37</lineNumber> <contextFuncName>myproject_axi</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/myproject_axi.cpp</first> <second>myproject_axi</second> </first> <second>37</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>296</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>72</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_85"> <Value> <Obj> <type>0</type> <id>90</id> <name>_ln0</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>0</count> <item_version>0</item_version> </oprand_edges> <opcode>ret</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>21</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> </nodes> <consts class_id="15" tracking_level="0" version="0"> <count>24</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_86"> <Value> <Obj> <type>2</type> <id>96</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_87"> <Value> <Obj> <type>2</type> <id>102</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <const_type>0</const_type> <content>10</content> </item> <item class_id_reference="16" object_id="_88"> <Value> <Obj> <type>2</type> <id>105</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_89"> <Value> <Obj> <type>2</type> <id>111</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <const_type>0</const_type> <content>9</content> </item> <item class_id_reference="16" object_id="_90"> <Value> <Obj> <type>2</type> <id>150</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_91"> <Value> <Obj> <type>2</type> <id>155</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>7</content> </item> <item class_id_reference="16" object_id="_92"> <Value> <Obj> <type>2</type> <id>166</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_93"> <Value> <Obj> <type>2</type> <id>170</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>24</bitwidth> </Value> <const_type>0</const_type> <content>16777215</content> </item> <item class_id_reference="16" object_id="_94"> <Value> <Obj> <type>2</type> <id>176</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_95"> <Value> <Obj> <type>2</type> <id>178</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>8</content> </item> <item class_id_reference="16" object_id="_96"> <Value> <Obj> <type>2</type> <id>182</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>4294967272</content> </item> <item class_id_reference="16" object_id="_97"> <Value> <Obj> <type>2</type> <id>188</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_98"> <Value> <Obj> <type>2</type> <id>190</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>31</content> </item> <item class_id_reference="16" object_id="_99"> <Value> <Obj> <type>2</type> <id>193</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>31</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_100"> <Value> <Obj> <type>2</type> <id>199</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <const_type>0</const_type> <content>255</content> </item> <item class_id_reference="16" object_id="_101"> <Value> <Obj> <type>2</type> <id>214</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <const_type>0</const_type> <content>232</content> </item> <item class_id_reference="16" object_id="_102"> <Value> <Obj> <type>2</type> <id>233</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>4294967271</content> </item> <item class_id_reference="16" object_id="_103"> <Value> <Obj> <type>2</type> <id>239</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>25</content> </item> <item class_id_reference="16" object_id="_104"> <Value> <Obj> <type>2</type> <id>255</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>63</content> </item> <item class_id_reference="16" object_id="_105"> <Value> <Obj> <type>2</type> <id>263</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <const_type>0</const_type> <content>127</content> </item> <item class_id_reference="16" object_id="_106"> <Value> <Obj> <type>2</type> <id>265</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <const_type>0</const_type> <content>126</content> </item> <item class_id_reference="16" object_id="_107"> <Value> <Obj> <type>2</type> <id>268</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <const_type>0</const_type> <content>6</content> </item> <item class_id_reference="16" object_id="_108"> <Value> <Obj> <type>2</type> <id>281</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>23</content> </item> <item class_id_reference="16" object_id="_109"> <Value> <Obj> <type>2</type> <id>287</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>1</const_type> <content>0</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="_110"> <Obj> <type>3</type> <id>17</id> <name>entry</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>15</item> <item>16</item> </node_objs> </item> <item class_id_reference="18" object_id="_111"> <Obj> <type>3</type> <id>23</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>4</count> <item_version>0</item_version> <item>18</item> <item>19</item> <item>21</item> <item>22</item> </node_objs> </item> <item class_id_reference="18" object_id="_112"> <Obj> <type>3</type> <id>89</id> <name>._crit_edge.i_ifconv</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>65</count> <item_version>0</item_version> <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> <item>49</item> <item>50</item> <item>51</item> <item>52</item> <item>53</item> <item>54</item> <item>55</item> <item>56</item> <item>57</item> <item>58</item> <item>59</item> <item>60</item> <item>61</item> <item>62</item> <item>63</item> <item>64</item> <item>65</item> <item>66</item> <item>67</item> <item>68</item> <item>69</item> <item>70</item> <item>71</item> <item>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> </node_objs> </item> <item class_id_reference="18" object_id="_113"> <Obj> <type>3</type> <id>91</id> <name>Loop_2_proc.exit</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>90</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>144</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_114"> <id>94</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>15</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_115"> <id>95</id> <edge_type>2</edge_type> <source_obj>23</source_obj> <sink_obj>16</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_116"> <id>97</id> <edge_type>1</edge_type> <source_obj>96</source_obj> <sink_obj>18</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_117"> <id>98</id> <edge_type>2</edge_type> <source_obj>17</source_obj> <sink_obj>18</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_118"> <id>99</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>18</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_119"> <id>100</id> <edge_type>2</edge_type> <source_obj>89</source_obj> <sink_obj>18</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_120"> <id>101</id> <edge_type>1</edge_type> <source_obj>18</source_obj> <sink_obj>19</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_121"> <id>103</id> <edge_type>1</edge_type> <source_obj>102</source_obj> <sink_obj>19</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_122"> <id>104</id> <edge_type>1</edge_type> <source_obj>18</source_obj> <sink_obj>21</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_123"> <id>106</id> <edge_type>1</edge_type> <source_obj>105</source_obj> <sink_obj>21</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_124"> <id>107</id> <edge_type>1</edge_type> <source_obj>19</source_obj> <sink_obj>22</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_125"> <id>108</id> <edge_type>2</edge_type> <source_obj>89</source_obj> <sink_obj>22</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_126"> <id>109</id> <edge_type>2</edge_type> <source_obj>91</source_obj> <sink_obj>22</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_127"> <id>110</id> <edge_type>1</edge_type> <source_obj>18</source_obj> <sink_obj>24</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_128"> <id>112</id> <edge_type>1</edge_type> <source_obj>111</source_obj> <sink_obj>24</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_129"> <id>113</id> <edge_type>1</edge_type> <source_obj>24</source_obj> <sink_obj>25</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_130"> <id>114</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>25</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_131"> <id>117</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>26</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_132"> <id>119</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>27</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_133"> <id>121</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>28</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_134"> <id>123</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>29</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_135"> <id>125</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>30</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_136"> <id>127</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>31</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_137"> <id>129</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>32</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_138"> <id>131</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>33</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_139"> <id>133</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>34</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_140"> <id>135</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>35</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_141"> <id>138</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_142"> <id>139</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_143"> <id>140</id> <edge_type>1</edge_type> <source_obj>28</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_144"> <id>141</id> <edge_type>1</edge_type> <source_obj>29</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_145"> <id>142</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_146"> <id>143</id> <edge_type>1</edge_type> <source_obj>31</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_147"> <id>144</id> <edge_type>1</edge_type> <source_obj>32</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_148"> <id>145</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_149"> <id>146</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_150"> <id>147</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_151"> <id>148</id> <edge_type>1</edge_type> <source_obj>18</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_152"> <id>149</id> <edge_type>1</edge_type> <source_obj>36</source_obj> <sink_obj>37</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_153"> <id>151</id> <edge_type>1</edge_type> <source_obj>150</source_obj> <sink_obj>37</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_154"> <id>154</id> <edge_type>1</edge_type> <source_obj>36</source_obj> <sink_obj>38</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_155"> <id>156</id> <edge_type>1</edge_type> <source_obj>155</source_obj> <sink_obj>38</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_156"> <id>157</id> <edge_type>1</edge_type> <source_obj>150</source_obj> <sink_obj>39</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_157"> <id>158</id> <edge_type>1</edge_type> <source_obj>36</source_obj> <sink_obj>39</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_158"> <id>159</id> <edge_type>1</edge_type> <source_obj>38</source_obj> <sink_obj>40</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_159"> <id>160</id> <edge_type>1</edge_type> <source_obj>39</source_obj> <sink_obj>40</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_160"> <id>161</id> <edge_type>1</edge_type> <source_obj>36</source_obj> <sink_obj>40</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_161"> <id>164</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>41</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_162"> <id>165</id> <edge_type>1</edge_type> <source_obj>155</source_obj> <sink_obj>41</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_163"> <id>167</id> <edge_type>1</edge_type> <source_obj>166</source_obj> <sink_obj>41</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_164"> <id>171</id> <edge_type>1</edge_type> <source_obj>170</source_obj> <sink_obj>42</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_165"> <id>172</id> <edge_type>1</edge_type> <source_obj>41</source_obj> <sink_obj>42</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_166"> <id>175</id> <edge_type>1</edge_type> <source_obj>42</source_obj> <sink_obj>43</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_167"> <id>177</id> <edge_type>1</edge_type> <source_obj>176</source_obj> <sink_obj>43</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_168"> <id>179</id> <edge_type>1</edge_type> <source_obj>178</source_obj> <sink_obj>44</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_169"> <id>180</id> <edge_type>1</edge_type> <source_obj>43</source_obj> <sink_obj>44</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_170"> <id>181</id> <edge_type>1</edge_type> <source_obj>44</source_obj> <sink_obj>45</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_171"> <id>183</id> <edge_type>1</edge_type> <source_obj>182</source_obj> <sink_obj>46</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_172"> <id>184</id> <edge_type>1</edge_type> <source_obj>44</source_obj> <sink_obj>46</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_173"> <id>187</id> <edge_type>1</edge_type> <source_obj>46</source_obj> <sink_obj>47</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_174"> <id>189</id> <edge_type>1</edge_type> <source_obj>188</source_obj> <sink_obj>47</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_175"> <id>191</id> <edge_type>1</edge_type> <source_obj>190</source_obj> <sink_obj>47</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_176"> <id>192</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>48</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_177"> <id>194</id> <edge_type>1</edge_type> <source_obj>193</source_obj> <sink_obj>48</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_178"> <id>195</id> <edge_type>1</edge_type> <source_obj>44</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_179"> <id>196</id> <edge_type>1</edge_type> <source_obj>105</source_obj> <sink_obj>50</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_180"> <id>197</id> <edge_type>1</edge_type> <source_obj>49</source_obj> <sink_obj>50</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_181"> <id>198</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>51</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_182"> <id>200</id> <edge_type>1</edge_type> <source_obj>199</source_obj> <sink_obj>52</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_183"> <id>201</id> <edge_type>1</edge_type> <source_obj>51</source_obj> <sink_obj>52</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_184"> <id>202</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>53</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_185"> <id>203</id> <edge_type>1</edge_type> <source_obj>52</source_obj> <sink_obj>53</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_186"> <id>204</id> <edge_type>1</edge_type> <source_obj>53</source_obj> <sink_obj>54</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_187"> <id>205</id> <edge_type>1</edge_type> <source_obj>150</source_obj> <sink_obj>54</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_188"> <id>206</id> <edge_type>1</edge_type> <source_obj>48</source_obj> <sink_obj>55</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_189"> <id>207</id> <edge_type>1</edge_type> <source_obj>54</source_obj> <sink_obj>55</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_190"> <id>210</id> <edge_type>1</edge_type> <source_obj>46</source_obj> <sink_obj>56</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_191"> <id>211</id> <edge_type>1</edge_type> <source_obj>190</source_obj> <sink_obj>56</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_192"> <id>212</id> <edge_type>1</edge_type> <source_obj>56</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_193"> <id>213</id> <edge_type>1</edge_type> <source_obj>176</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_194"> <id>215</id> <edge_type>1</edge_type> <source_obj>214</source_obj> <sink_obj>58</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_195"> <id>216</id> <edge_type>1</edge_type> <source_obj>45</source_obj> <sink_obj>58</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_196"> <id>219</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>59</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_197"> <id>220</id> <edge_type>1</edge_type> <source_obj>58</source_obj> <sink_obj>59</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_198"> <id>221</id> <edge_type>1</edge_type> <source_obj>59</source_obj> <sink_obj>60</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_199"> <id>222</id> <edge_type>1</edge_type> <source_obj>57</source_obj> <sink_obj>60</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_200"> <id>223</id> <edge_type>1</edge_type> <source_obj>60</source_obj> <sink_obj>61</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_201"> <id>224</id> <edge_type>1</edge_type> <source_obj>55</source_obj> <sink_obj>61</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_202"> <id>227</id> <edge_type>1</edge_type> <source_obj>193</source_obj> <sink_obj>62</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_203"> <id>228</id> <edge_type>1</edge_type> <source_obj>61</source_obj> <sink_obj>62</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_204"> <id>229</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>63</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_205"> <id>230</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>64</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_206"> <id>231</id> <edge_type>1</edge_type> <source_obj>46</source_obj> <sink_obj>65</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_207"> <id>232</id> <edge_type>1</edge_type> <source_obj>166</source_obj> <sink_obj>65</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_208"> <id>234</id> <edge_type>1</edge_type> <source_obj>233</source_obj> <sink_obj>66</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_209"> <id>235</id> <edge_type>1</edge_type> <source_obj>44</source_obj> <sink_obj>66</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_210"> <id>236</id> <edge_type>1</edge_type> <source_obj>64</source_obj> <sink_obj>67</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_211"> <id>237</id> <edge_type>1</edge_type> <source_obj>66</source_obj> <sink_obj>67</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_212"> <id>238</id> <edge_type>1</edge_type> <source_obj>67</source_obj> <sink_obj>68</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_213"> <id>240</id> <edge_type>1</edge_type> <source_obj>239</source_obj> <sink_obj>69</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_214"> <id>241</id> <edge_type>1</edge_type> <source_obj>44</source_obj> <sink_obj>69</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_215"> <id>242</id> <edge_type>1</edge_type> <source_obj>69</source_obj> <sink_obj>70</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_216"> <id>243</id> <edge_type>1</edge_type> <source_obj>63</source_obj> <sink_obj>71</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_217"> <id>244</id> <edge_type>1</edge_type> <source_obj>70</source_obj> <sink_obj>71</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_218"> <id>245</id> <edge_type>1</edge_type> <source_obj>65</source_obj> <sink_obj>72</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_219"> <id>246</id> <edge_type>1</edge_type> <source_obj>68</source_obj> <sink_obj>72</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_220"> <id>247</id> <edge_type>1</edge_type> <source_obj>71</source_obj> <sink_obj>72</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_221"> <id>248</id> <edge_type>1</edge_type> <source_obj>62</source_obj> <sink_obj>73</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_222"> <id>249</id> <edge_type>1</edge_type> <source_obj>73</source_obj> <sink_obj>74</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_223"> <id>250</id> <edge_type>1</edge_type> <source_obj>72</source_obj> <sink_obj>74</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_224"> <id>253</id> <edge_type>1</edge_type> <source_obj>74</source_obj> <sink_obj>75</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_225"> <id>254</id> <edge_type>1</edge_type> <source_obj>188</source_obj> <sink_obj>75</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_226"> <id>256</id> <edge_type>1</edge_type> <source_obj>255</source_obj> <sink_obj>75</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_227"> <id>257</id> <edge_type>1</edge_type> <source_obj>75</source_obj> <sink_obj>76</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_228"> <id>260</id> <edge_type>1</edge_type> <source_obj>74</source_obj> <sink_obj>77</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_229"> <id>261</id> <edge_type>1</edge_type> <source_obj>239</source_obj> <sink_obj>77</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_230"> <id>262</id> <edge_type>1</edge_type> <source_obj>77</source_obj> <sink_obj>78</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_231"> <id>264</id> <edge_type>1</edge_type> <source_obj>263</source_obj> <sink_obj>78</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_232"> <id>266</id> <edge_type>1</edge_type> <source_obj>265</source_obj> <sink_obj>78</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_233"> <id>267</id> <edge_type>1</edge_type> <source_obj>43</source_obj> <sink_obj>79</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_234"> <id>269</id> <edge_type>1</edge_type> <source_obj>268</source_obj> <sink_obj>80</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_235"> <id>270</id> <edge_type>1</edge_type> <source_obj>79</source_obj> <sink_obj>80</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_236"> <id>271</id> <edge_type>1</edge_type> <source_obj>80</source_obj> <sink_obj>81</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_237"> <id>272</id> <edge_type>1</edge_type> <source_obj>78</source_obj> <sink_obj>81</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_238"> <id>275</id> <edge_type>1</edge_type> <source_obj>38</source_obj> <sink_obj>82</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_239"> <id>276</id> <edge_type>1</edge_type> <source_obj>81</source_obj> <sink_obj>82</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_240"> <id>279</id> <edge_type>1</edge_type> <source_obj>76</source_obj> <sink_obj>83</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_241"> <id>280</id> <edge_type>1</edge_type> <source_obj>82</source_obj> <sink_obj>83</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_242"> <id>282</id> <edge_type>1</edge_type> <source_obj>281</source_obj> <sink_obj>83</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_243"> <id>283</id> <edge_type>1</edge_type> <source_obj>190</source_obj> <sink_obj>83</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_244"> <id>284</id> <edge_type>1</edge_type> <source_obj>83</source_obj> <sink_obj>84</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_245"> <id>285</id> <edge_type>1</edge_type> <source_obj>84</source_obj> <sink_obj>85</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_246"> <id>286</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>86</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_247"> <id>288</id> <edge_type>1</edge_type> <source_obj>287</source_obj> <sink_obj>86</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_248"> <id>289</id> <edge_type>1</edge_type> <source_obj>85</source_obj> <sink_obj>86</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_249"> <id>292</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>87</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_250"> <id>293</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>87</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_251"> <id>294</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>87</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_252"> <id>295</id> <edge_type>1</edge_type> <source_obj>86</source_obj> <sink_obj>87</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_253"> <id>296</id> <edge_type>2</edge_type> <source_obj>23</source_obj> <sink_obj>88</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_254"> <id>328</id> <edge_type>2</edge_type> <source_obj>17</source_obj> <sink_obj>23</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_255"> <id>329</id> <edge_type>2</edge_type> <source_obj>23</source_obj> <sink_obj>91</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_256"> <id>330</id> <edge_type>2</edge_type> <source_obj>23</source_obj> <sink_obj>89</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_257"> <id>331</id> <edge_type>2</edge_type> <source_obj>89</source_obj> <sink_obj>23</sink_obj> <is_back_edge>1</is_back_edge> </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="_258"> <mId>1</mId> <mTag>Loop_2_proc</mTag> <mType>0</mType> <sub_regions> <count>3</count> <item_version>0</item_version> <item>2</item> <item>3</item> <item>4</item> </sub_regions> <basic_blocks> <count>0</count> <item_version>0</item_version> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>61</mMinLatency> <mMaxLatency>61</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_259"> <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>17</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>0</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_260"> <mId>3</mId> <mTag>Loop 1</mTag> <mType>1</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>23</item> <item>89</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>10</mMinTripCount> <mMaxTripCount>10</mMaxTripCount> <mMinLatency>60</mMinLatency> <mMaxLatency>60</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_261"> <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>91</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>0</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> </cdfg_regions> <fsm class_id="-1"></fsm> <res class_id="-1"></res> <node_label_latency class_id="26" tracking_level="0" version="0"> <count>72</count> <item_version>0</item_version> <item class_id="27" tracking_level="0" version="0"> <first>15</first> <second class_id="28" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>16</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>18</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>19</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>21</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>22</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>24</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>25</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>26</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>27</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>28</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>29</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>30</first> <second> <first>1</first> <second>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> <item> <first>36</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>37</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>38</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>39</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>40</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>41</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>42</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>43</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>44</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>45</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>46</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>47</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>48</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>49</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>50</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>51</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>52</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>53</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>54</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>55</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>56</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>57</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>58</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>59</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>60</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>61</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>62</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>63</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>64</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>65</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>66</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>67</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>68</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>69</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>70</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>71</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>72</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>73</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>74</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>75</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>76</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>77</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>78</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>79</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>80</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>81</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>82</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>83</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>84</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>85</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>86</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>87</first> <second> <first>5</first> <second>1</second> </second> </item> <item> <first>88</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>90</first> <second> <first>1</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="29" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="30" tracking_level="0" version="0"> <first>17</first> <second class_id="31" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>23</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>89</first> <second> <first>1</first> <second>6</second> </second> </item> <item> <first>91</first> <second> <first>1</first> <second>1</second> </second> </item> </bblk_ent_exit> <regions class_id="32" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </regions> <dp_fu_nodes class_id="33" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_fu_nodes> <dp_fu_nodes_expression class_id="34" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_fu_nodes_expression> <dp_fu_nodes_module> <count>0</count> <item_version>0</item_version> </dp_fu_nodes_module> <dp_fu_nodes_io> <count>0</count> <item_version>0</item_version> </dp_fu_nodes_io> <return_ports> <count>0</count> <item_version>0</item_version> </return_ports> <dp_mem_port_nodes class_id="35" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_mem_port_nodes> <dp_reg_nodes> <count>0</count> <item_version>0</item_version> </dp_reg_nodes> <dp_regname_nodes> <count>0</count> <item_version>0</item_version> </dp_regname_nodes> <dp_reg_phi> <count>0</count> <item_version>0</item_version> </dp_reg_phi> <dp_regname_phi> <count>0</count> <item_version>0</item_version> </dp_regname_phi> <dp_port_io_nodes class_id="36" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_port_io_nodes> <port2core class_id="37" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </port2core> <node2core> <count>0</count> <item_version>0</item_version> </node2core> </syndb> </boost_serialization>

28.617652

124

0.616137

41d53114c46fb18bbcb4969f1636340596c78898

4,084

ads

Ada

llvm-gcc-4.2-2.9/gcc/ada/fmap.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

llvm-gcc-4.2-2.9/gcc/ada/fmap.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

llvm-gcc-4.2-2.9/gcc/ada/fmap.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- F M A P -- -- -- -- S p e c -- -- -- -- Copyright (C) 2001-2003, 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 keeps two mappings: from unit names to file names, -- and from file names to path names. with Types; use Types; package Fmap is procedure Initialize (File_Name : String); -- Initialize the mappings from the mapping file File_Name. -- If the mapping file is incorrect (non existent file, truncated file, -- duplicate entries), output a warning and do not initialize the mappings. -- Record the state of the mapping tables in case Update is called -- later on. function Mapped_Path_Name (File : File_Name_Type) return File_Name_Type; -- Return the path name mapped to the file name File. -- Return No_File if File is not mapped. function Mapped_File_Name (Unit : Unit_Name_Type) return File_Name_Type; -- Return the file name mapped to the unit name Unit. -- Return No_File if Unit is not mapped. -- Return Error_Name if it is forbidden. procedure Add_To_File_Map (Unit_Name : Unit_Name_Type; File_Name : File_Name_Type; Path_Name : File_Name_Type); -- Add mapping of Unit_Name to File_Name and of File_Name to Path_Name procedure Update_Mapping_File (File_Name : String); -- If Add_To_File_Map has been called (after Initialize or any time -- if Initialize has not been called), append the new entries to the -- mapping file whose file name is File_Name. procedure Reset_Tables; -- Initialize all the internal data structures. This procedure is used -- when several compilations are performed by the same process (by GNSA -- for ASIS, for example) to remove any existing mappings from a previous -- compilation. procedure Add_Forbidden_File_Name (Name : Name_Id); -- Indicate that a source file name is forbidden. -- This is used by gnatmake when there are Locally_Removed_Files in -- extending projects. procedure Remove_Forbidden_File_Name (Name : Name_Id); -- Indicate that a source file name that was forbidden is no longer -- forbidden. Used by gnatmake when a locally removed file is redefined -- in another extending project. end Fmap;

52.358974

79

0.550686

a1fd81f123e5b77b572fa2f2666d5e3380104182

361

adb

Ada

tests/nonsmoke/functional/CompileTests/experimental_ada_tests/tests/discriminated_record.adb

LaudateCorpus1/rose-1

5fe906d2a01253130c5de465aded6a917a8476a0

[ "BSD-3-Clause" ]

488

2015-01-09T08:54:48.000Z

2022-03-30T07:15:46.000Z

tests/nonsmoke/functional/CompileTests/experimental_ada_tests/tests/discriminated_record.adb

LaudateCorpus1/rose-1

5fe906d2a01253130c5de465aded6a917a8476a0

[ "BSD-3-Clause" ]

174

2015-01-28T18:41:32.000Z

2022-03-31T16:51:05.000Z

tests/nonsmoke/functional/CompileTests/experimental_ada_tests/tests/discriminated_record.adb

LaudateCorpus1/rose-1

5fe906d2a01253130c5de465aded6a917a8476a0

[ "BSD-3-Clause" ]

146

2015-04-27T02:48:34.000Z

2022-03-04T07:32:53.000Z

procedure Discriminated_Record is TYPE REC2 (I : INTEGER) IS RECORD CASE I IS WHEN 1 => null; WHEN OTHERS => A2 : integer; A3 : long_integer; END CASE; END RECORD; R2 : REC2(2); begin null; end Discriminated_Record;

22.5625

40

0.440443

5835a61a5727fac02fffaf501f484f6072140daa

1,298

ada

Ada

Task/Caesar-cipher/Ada/caesar-cipher.ada

mullikine/RosettaCodeData

4f0027c6ce83daa36118ee8b67915a13cd23ab67

[ "Info-ZIP" ]

1

2018-11-09T22:08:38.000Z

Task/Caesar-cipher/Ada/caesar-cipher.ada

mullikine/RosettaCodeData

4f0027c6ce83daa36118ee8b67915a13cd23ab67

[ "Info-ZIP" ]

null

Task/Caesar-cipher/Ada/caesar-cipher.ada

mullikine/RosettaCodeData

4f0027c6ce83daa36118ee8b67915a13cd23ab67

[ "Info-ZIP" ]

1

2018-11-09T22:08:40.000Z

with Ada.Text_IO; procedure Caesar is type M26 is mod 26; function To_M26(C: Character; Offset: Character) return M26 is begin return M26(Character'Pos(C)-Character'Pos(Offset)); end To_M26; function To_Character(Value: in M26; Offset: Character) return Character is begin return Character'Val(Integer(Value)+Character'Pos(Offset)); end To_Character; function Encrypt (Plain: String; Key: M26) return String is Ciph: String(Plain'Range); begin for I in Plain'Range loop case Plain(I) is when 'A' .. 'Z' => Ciph(I) := To_Character(To_M26(Plain(I), 'A')+Key, 'A'); when 'a' .. 'z' => Ciph(I) := To_Character(To_M26(Plain(I), 'a')+Key, 'a'); when others => Ciph(I) := Plain(I); end case; end loop; return Ciph; end Encrypt; Text: String := Ada.Text_IO.Get_Line; Key: M26 := 3; -- Default key from "Commentarii de Bello Gallico" begin -- Caesar main program Ada.Text_IO.Put_Line("Plaintext ------------>" & Text); Text := Encrypt(Text, Key); Ada.Text_IO.Put_Line("Ciphertext ----------->" & Text); Ada.Text_IO.Put_Line("Decrypted Ciphertext ->" & Encrypt(Text, -Key)); end Caesar;

28.217391

73

0.580894

3de2f1407026d08ee33ce5b7b59f6203b47c504d

2,903

ads

Ada

source/oasis/program-elements-protected_body_declarations.ads

optikos/oasis

9f64d46d26d964790d69f9db681c874cfb3bf96d

[ "MIT" ]

null

source/oasis/program-elements-protected_body_declarations.ads

optikos/oasis

9f64d46d26d964790d69f9db681c874cfb3bf96d

[ "MIT" ]

null

source/oasis/program-elements-protected_body_declarations.ads

optikos/oasis

9f64d46d26d964790d69f9db681c874cfb3bf96d

[ "MIT" ]

2

2019-09-14T23:18:50.000Z

2019-10-02T10:11:40.000Z

-- Copyright (c) 2019 Maxim Reznik <[email protected]> -- -- SPDX-License-Identifier: MIT -- License-Filename: LICENSE ------------------------------------------------------------- with Program.Elements.Declarations; with Program.Lexical_Elements; with Program.Elements.Defining_Identifiers; with Program.Elements.Aspect_Specifications; with Program.Element_Vectors; with Program.Elements.Identifiers; package Program.Elements.Protected_Body_Declarations is pragma Pure (Program.Elements.Protected_Body_Declarations); type Protected_Body_Declaration is limited interface and Program.Elements.Declarations.Declaration; type Protected_Body_Declaration_Access is access all Protected_Body_Declaration'Class with Storage_Size => 0; not overriding function Name (Self : Protected_Body_Declaration) return not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access is abstract; not overriding function Aspects (Self : Protected_Body_Declaration) return Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access is abstract; not overriding function Protected_Operations (Self : Protected_Body_Declaration) return not null Program.Element_Vectors.Element_Vector_Access is abstract; not overriding function End_Name (Self : Protected_Body_Declaration) return Program.Elements.Identifiers.Identifier_Access is abstract; type Protected_Body_Declaration_Text is limited interface; type Protected_Body_Declaration_Text_Access is access all Protected_Body_Declaration_Text'Class with Storage_Size => 0; not overriding function To_Protected_Body_Declaration_Text (Self : aliased in out Protected_Body_Declaration) return Protected_Body_Declaration_Text_Access is abstract; not overriding function Protected_Token (Self : Protected_Body_Declaration_Text) return not null Program.Lexical_Elements.Lexical_Element_Access is abstract; not overriding function Body_Token (Self : Protected_Body_Declaration_Text) return not null Program.Lexical_Elements.Lexical_Element_Access is abstract; not overriding function With_Token (Self : Protected_Body_Declaration_Text) return Program.Lexical_Elements.Lexical_Element_Access is abstract; not overriding function Is_Token (Self : Protected_Body_Declaration_Text) return not null Program.Lexical_Elements.Lexical_Element_Access is abstract; not overriding function End_Token (Self : Protected_Body_Declaration_Text) return not null Program.Lexical_Elements.Lexical_Element_Access is abstract; not overriding function Semicolon_Token (Self : Protected_Body_Declaration_Text) return not null Program.Lexical_Elements.Lexical_Element_Access is abstract; end Program.Elements.Protected_Body_Declarations;

35.402439

77

0.780227

2273dd572601195c5674eabdfd2a0afb77dfb5d7

11,925

ads

Ada

arch/ARM/STM32/svd/stm32f7x/stm32_svd-dcmi.ads

shakram02/Ada_Drivers_Library

a407ca7ddbc2d9756647016c2f8fd8ef24a239ff

[ "BSD-3-Clause" ]

192

2016-06-01T18:32:04.000Z

2022-03-26T22:52:31.000Z

arch/ARM/STM32/svd/stm32f7x/stm32_svd-dcmi.ads

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

239

2016-05-26T20:02:01.000Z

2022-03-31T09:46:56.000Z

arch/ARM/STM32/svd/stm32f7x/stm32_svd-dcmi.ads

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

142

2016-06-05T08:12:20.000Z

2022-03-24T17:37:17.000Z

-- This spec has been automatically generated from STM32F7x.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with HAL; with System; package STM32_SVD.DCMI is pragma Preelaborate; --------------- -- Registers -- --------------- subtype CR_FCRC_Field is HAL.UInt2; subtype CR_EDM_Field is HAL.UInt2; -- control register 1 type CR_Register is record -- Capture enable CAPTURE : Boolean := False; -- Capture mode CM : Boolean := False; -- Crop feature CROP : Boolean := False; -- JPEG format JPEG : Boolean := False; -- Embedded synchronization select ESS : Boolean := False; -- Pixel clock polarity PCKPOL : Boolean := False; -- Horizontal synchronization polarity HSPOL : Boolean := False; -- Vertical synchronization polarity VSPOL : Boolean := False; -- Frame capture rate control FCRC : CR_FCRC_Field := 16#0#; -- Extended data mode EDM : CR_EDM_Field := 16#0#; -- unspecified Reserved_12_13 : HAL.UInt2 := 16#0#; -- DCMI enable ENABLE : Boolean := False; -- unspecified Reserved_15_31 : HAL.UInt17 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR_Register use record CAPTURE at 0 range 0 .. 0; CM at 0 range 1 .. 1; CROP at 0 range 2 .. 2; JPEG at 0 range 3 .. 3; ESS at 0 range 4 .. 4; PCKPOL at 0 range 5 .. 5; HSPOL at 0 range 6 .. 6; VSPOL at 0 range 7 .. 7; FCRC at 0 range 8 .. 9; EDM at 0 range 10 .. 11; Reserved_12_13 at 0 range 12 .. 13; ENABLE at 0 range 14 .. 14; Reserved_15_31 at 0 range 15 .. 31; end record; -- status register type SR_Register is record -- Read-only. HSYNC HSYNC : Boolean; -- Read-only. VSYNC VSYNC : Boolean; -- Read-only. FIFO not empty FNE : Boolean; -- unspecified Reserved_3_31 : HAL.UInt29; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for SR_Register use record HSYNC at 0 range 0 .. 0; VSYNC at 0 range 1 .. 1; FNE at 0 range 2 .. 2; Reserved_3_31 at 0 range 3 .. 31; end record; -- raw interrupt status register type RIS_Register is record -- Read-only. Capture complete raw interrupt status FRAME_RIS : Boolean; -- Read-only. Overrun raw interrupt status OVR_RIS : Boolean; -- Read-only. Synchronization error raw interrupt status ERR_RIS : Boolean; -- Read-only. VSYNC raw interrupt status VSYNC_RIS : Boolean; -- Read-only. Line raw interrupt status LINE_RIS : Boolean; -- unspecified Reserved_5_31 : HAL.UInt27; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for RIS_Register use record FRAME_RIS at 0 range 0 .. 0; OVR_RIS at 0 range 1 .. 1; ERR_RIS at 0 range 2 .. 2; VSYNC_RIS at 0 range 3 .. 3; LINE_RIS at 0 range 4 .. 4; Reserved_5_31 at 0 range 5 .. 31; end record; -- interrupt enable register type IER_Register is record -- Capture complete interrupt enable FRAME_IE : Boolean := False; -- Overrun interrupt enable OVR_IE : Boolean := False; -- Synchronization error interrupt enable ERR_IE : Boolean := False; -- VSYNC interrupt enable VSYNC_IE : Boolean := False; -- Line interrupt enable LINE_IE : Boolean := False; -- unspecified Reserved_5_31 : HAL.UInt27 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for IER_Register use record FRAME_IE at 0 range 0 .. 0; OVR_IE at 0 range 1 .. 1; ERR_IE at 0 range 2 .. 2; VSYNC_IE at 0 range 3 .. 3; LINE_IE at 0 range 4 .. 4; Reserved_5_31 at 0 range 5 .. 31; end record; -- masked interrupt status register type MIS_Register is record -- Read-only. Capture complete masked interrupt status FRAME_MIS : Boolean; -- Read-only. Overrun masked interrupt status OVR_MIS : Boolean; -- Read-only. Synchronization error masked interrupt status ERR_MIS : Boolean; -- Read-only. VSYNC masked interrupt status VSYNC_MIS : Boolean; -- Read-only. Line masked interrupt status LINE_MIS : Boolean; -- unspecified Reserved_5_31 : HAL.UInt27; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for MIS_Register use record FRAME_MIS at 0 range 0 .. 0; OVR_MIS at 0 range 1 .. 1; ERR_MIS at 0 range 2 .. 2; VSYNC_MIS at 0 range 3 .. 3; LINE_MIS at 0 range 4 .. 4; Reserved_5_31 at 0 range 5 .. 31; end record; -- interrupt clear register type ICR_Register is record -- Write-only. Capture complete interrupt status clear FRAME_ISC : Boolean := False; -- Write-only. Overrun interrupt status clear OVR_ISC : Boolean := False; -- Write-only. Synchronization error interrupt status clear ERR_ISC : Boolean := False; -- Write-only. Vertical synch interrupt status clear VSYNC_ISC : Boolean := False; -- Write-only. line interrupt status clear LINE_ISC : Boolean := False; -- unspecified Reserved_5_31 : HAL.UInt27 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for ICR_Register use record FRAME_ISC at 0 range 0 .. 0; OVR_ISC at 0 range 1 .. 1; ERR_ISC at 0 range 2 .. 2; VSYNC_ISC at 0 range 3 .. 3; LINE_ISC at 0 range 4 .. 4; Reserved_5_31 at 0 range 5 .. 31; end record; subtype ESCR_FSC_Field is HAL.UInt8; subtype ESCR_LSC_Field is HAL.UInt8; subtype ESCR_LEC_Field is HAL.UInt8; subtype ESCR_FEC_Field is HAL.UInt8; -- embedded synchronization code register type ESCR_Register is record -- Frame start delimiter code FSC : ESCR_FSC_Field := 16#0#; -- Line start delimiter code LSC : ESCR_LSC_Field := 16#0#; -- Line end delimiter code LEC : ESCR_LEC_Field := 16#0#; -- Frame end delimiter code FEC : ESCR_FEC_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for ESCR_Register use record FSC at 0 range 0 .. 7; LSC at 0 range 8 .. 15; LEC at 0 range 16 .. 23; FEC at 0 range 24 .. 31; end record; subtype ESUR_FSU_Field is HAL.UInt8; subtype ESUR_LSU_Field is HAL.UInt8; subtype ESUR_LEU_Field is HAL.UInt8; subtype ESUR_FEU_Field is HAL.UInt8; -- embedded synchronization unmask register type ESUR_Register is record -- Frame start delimiter unmask FSU : ESUR_FSU_Field := 16#0#; -- Line start delimiter unmask LSU : ESUR_LSU_Field := 16#0#; -- Line end delimiter unmask LEU : ESUR_LEU_Field := 16#0#; -- Frame end delimiter unmask FEU : ESUR_FEU_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for ESUR_Register use record FSU at 0 range 0 .. 7; LSU at 0 range 8 .. 15; LEU at 0 range 16 .. 23; FEU at 0 range 24 .. 31; end record; subtype CWSTRT_HOFFCNT_Field is HAL.UInt14; subtype CWSTRT_VST_Field is HAL.UInt13; -- crop window start type CWSTRT_Register is record -- Horizontal offset count HOFFCNT : CWSTRT_HOFFCNT_Field := 16#0#; -- unspecified Reserved_14_15 : HAL.UInt2 := 16#0#; -- Vertical start line count VST : CWSTRT_VST_Field := 16#0#; -- unspecified Reserved_29_31 : HAL.UInt3 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CWSTRT_Register use record HOFFCNT at 0 range 0 .. 13; Reserved_14_15 at 0 range 14 .. 15; VST at 0 range 16 .. 28; Reserved_29_31 at 0 range 29 .. 31; end record; subtype CWSIZE_CAPCNT_Field is HAL.UInt14; subtype CWSIZE_VLINE_Field is HAL.UInt14; -- crop window size type CWSIZE_Register is record -- Capture count CAPCNT : CWSIZE_CAPCNT_Field := 16#0#; -- unspecified Reserved_14_15 : HAL.UInt2 := 16#0#; -- Vertical line count VLINE : CWSIZE_VLINE_Field := 16#0#; -- unspecified Reserved_30_31 : HAL.UInt2 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CWSIZE_Register use record CAPCNT at 0 range 0 .. 13; Reserved_14_15 at 0 range 14 .. 15; VLINE at 0 range 16 .. 29; Reserved_30_31 at 0 range 30 .. 31; end record; -- DR_Byte array element subtype DR_Byte_Element is HAL.UInt8; -- DR_Byte array type DR_Byte_Field_Array is array (0 .. 3) of DR_Byte_Element with Component_Size => 8, Size => 32; -- data register type DR_Register (As_Array : Boolean := False) is record case As_Array is when False => -- Byte as a value Val : HAL.UInt32; when True => -- Byte as an array Arr : DR_Byte_Field_Array; end case; end record with Unchecked_Union, Size => 32, Volatile_Full_Access, Bit_Order => System.Low_Order_First; for DR_Register use record Val at 0 range 0 .. 31; Arr at 0 range 0 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Digital camera interface type DCMI_Peripheral is record -- control register 1 CR : aliased CR_Register; -- status register SR : aliased SR_Register; -- raw interrupt status register RIS : aliased RIS_Register; -- interrupt enable register IER : aliased IER_Register; -- masked interrupt status register MIS : aliased MIS_Register; -- interrupt clear register ICR : aliased ICR_Register; -- embedded synchronization code register ESCR : aliased ESCR_Register; -- embedded synchronization unmask register ESUR : aliased ESUR_Register; -- crop window start CWSTRT : aliased CWSTRT_Register; -- crop window size CWSIZE : aliased CWSIZE_Register; -- data register DR : aliased DR_Register; end record with Volatile; for DCMI_Peripheral use record CR at 16#0# range 0 .. 31; SR at 16#4# range 0 .. 31; RIS at 16#8# range 0 .. 31; IER at 16#C# range 0 .. 31; MIS at 16#10# range 0 .. 31; ICR at 16#14# range 0 .. 31; ESCR at 16#18# range 0 .. 31; ESUR at 16#1C# range 0 .. 31; CWSTRT at 16#20# range 0 .. 31; CWSIZE at 16#24# range 0 .. 31; DR at 16#28# range 0 .. 31; end record; -- Digital camera interface DCMI_Periph : aliased DCMI_Peripheral with Import, Address => System'To_Address (16#50050000#); end STM32_SVD.DCMI;

31.8

66

0.582055

22f185793a9cd2d67ac31eff4c4a97462d523bfb

59,555

adb

Ada

bnn/src/network/output/hls-syn/lfcW1A1-pynqZ1-Z2/sol1/.autopilot/db/Stream2Mem.bind.adb

IceyFong/Lutification

3e42d34d6840d5deb84407aad5c58216527a4b0a

[ "BSD-3-Clause" ]

null

bnn/src/network/output/hls-syn/lfcW1A1-pynqZ1-Z2/sol1/.autopilot/db/Stream2Mem.bind.adb

IceyFong/Lutification

3e42d34d6840d5deb84407aad5c58216527a4b0a

[ "BSD-3-Clause" ]

null

bnn/src/network/output/hls-syn/lfcW1A1-pynqZ1-Z2/sol1/.autopilot/db/Stream2Mem.bind.adb

IceyFong/Lutification

3e42d34d6840d5deb84407aad5c58216527a4b0a

[ "BSD-3-Clause" ]

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>Stream2Mem</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>in_V_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo class_id="6" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>in.V.V</originalName> <rtlName></rtlName> <coreName>FSL</coreName> </Obj> <bitwidth>64</bitwidth> </Value> <direction>0</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs class_id="7" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_2"> <Value> <Obj> <type>1</type> <id>2</id> <name>out_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>out.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <direction>1</direction> <if_type>4</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>out_V3</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>61</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>tmp_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>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>18</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>tmp_2_read</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>34</item> <item>35</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>out_V3_read</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>61</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>37</item> <item>38</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>9</id> <name>tmp_5_cast</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>62</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>39</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_8"> <Value> <Obj> <type>0</type> <id>10</id> <name>out_V3_cast8</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>62</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>40</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_9"> <Value> <Obj> <type>0</type> <id>11</id> <name>sum1</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>62</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>41</item> <item>42</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_10"> <Value> <Obj> <type>0</type> <id>12</id> <name>sum1_cast</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>1</count> <item_version>0</item_version> <item>43</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_11"> <Value> <Obj> <type>0</type> <id>13</id> <name>out_V_addr</name> <fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</fileName> <fileDirectory>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</fileDirectory> <lineNumber>156</lineNumber> <contextFuncName>Stream2Mem&lt;64, 128&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="11" tracking_level="0" version="0"> <first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</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>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</first> <second>Stream2Mem&lt;64, 128&gt;</second> </first> <second>156</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>44</item> <item>45</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_12"> <Value> <Obj> <type>0</type> <id>14</id> <name>out_V_addr_wr_req</name> <fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</fileName> <fileDirectory>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</fileDirectory> <lineNumber>156</lineNumber> <contextFuncName>Stream2Mem&lt;64, 128&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</first> <second>Stream2Mem&lt;64, 128&gt;</second> </first> <second>156</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>47</item> <item>48</item> <item>50</item> </oprand_edges> <opcode>writereq</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_13"> <Value> <Obj> <type>0</type> <id>15</id> <name></name> <fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</fileName> <fileDirectory>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</fileDirectory> <lineNumber>153</lineNumber> <contextFuncName>Stream2Mem&lt;64, 128&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</first> <second>Stream2Mem&lt;64, 128&gt;</second> </first> <second>153</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>51</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_14"> <Value> <Obj> <type>0</type> <id>17</id> <name>i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>i</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>53</item> <item>54</item> <item>55</item> <item>56</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_15"> <Value> <Obj> <type>0</type> <id>18</id> <name>tmp</name> <fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</fileName> <fileDirectory>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</fileDirectory> <lineNumber>153</lineNumber> <contextFuncName>Stream2Mem&lt;64, 128&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</first> <second>Stream2Mem&lt;64, 128&gt;</second> </first> <second>153</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>57</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>19</id> <name>i_1</name> <fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</fileName> <fileDirectory>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</fileDirectory> <lineNumber>153</lineNumber> <contextFuncName>Stream2Mem&lt;64, 128&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</first> <second>Stream2Mem&lt;64, 128&gt;</second> </first> <second>153</second> </item> </second> </item> </inlineStackInfo> <originalName>i</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>60</item> <item>62</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_17"> <Value> <Obj> <type>0</type> <id>20</id> <name></name> <fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</fileName> <fileDirectory>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</fileDirectory> <lineNumber>153</lineNumber> <contextFuncName>Stream2Mem&lt;64, 128&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</first> <second>Stream2Mem&lt;64, 128&gt;</second> </first> <second>153</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>63</item> <item>64</item> <item>65</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_18"> <Value> <Obj> <type>0</type> <id>25</id> <name>tmp_V</name> <fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</fileName> <fileDirectory>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</fileDirectory> <lineNumber>155</lineNumber> <contextFuncName>Stream2Mem&lt;64, 128&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</first> <second>Stream2Mem&lt;64, 128&gt;</second> </first> <second>155</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>67</item> <item>68</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_19"> <Value> <Obj> <type>0</type> <id>26</id> <name></name> <fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</fileName> <fileDirectory>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</fileDirectory> <lineNumber>156</lineNumber> <contextFuncName>Stream2Mem&lt;64, 128&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</first> <second>Stream2Mem&lt;64, 128&gt;</second> </first> <second>156</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>5</count> <item_version>0</item_version> <item>70</item> <item>71</item> <item>72</item> <item>74</item> <item>149</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_20"> <Value> <Obj> <type>0</type> <id>28</id> <name></name> <fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</fileName> <fileDirectory>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</fileDirectory> <lineNumber>153</lineNumber> <contextFuncName>Stream2Mem&lt;64, 128&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</first> <second>Stream2Mem&lt;64, 128&gt;</second> </first> <second>153</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>75</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_21"> <Value> <Obj> <type>0</type> <id>30</id> <name>out_V_addr_wr_resp</name> <fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</fileName> <fileDirectory>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</fileDirectory> <lineNumber>156</lineNumber> <contextFuncName>Stream2Mem&lt;64, 128&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</first> <second>Stream2Mem&lt;64, 128&gt;</second> </first> <second>156</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>77</item> <item>78</item> </oprand_edges> <opcode>writeresp</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_22"> <Value> <Obj> <type>0</type> <id>31</id> <name></name> <fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</fileName> <fileDirectory>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>Stream2Mem&lt;64, 128&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</first> <second>Stream2Mem&lt;64, 128&gt;</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>0</count> <item_version>0</item_version> </oprand_edges> <opcode>ret</opcode> <m_Display>0</m_Display> </item> </nodes> <consts class_id="15" tracking_level="0" version="0"> <count>5</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_23"> <Value> <Obj> <type>2</type> <id>49</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>16</content> </item> <item class_id_reference="16" object_id="_24"> <Value> <Obj> <type>2</type> <id>52</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_25"> <Value> <Obj> <type>2</type> <id>58</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <const_type>0</const_type> <content>16</content> </item> <item class_id_reference="16" object_id="_26"> <Value> <Obj> <type>2</type> <id>61</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_27"> <Value> <Obj> <type>2</type> <id>73</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <const_type>0</const_type> <content>255</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="_28"> <Obj> <type>3</type> <id>16</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>9</count> <item_version>0</item_version> <item>5</item> <item>6</item> <item>9</item> <item>10</item> <item>11</item> <item>12</item> <item>13</item> <item>14</item> <item>15</item> </node_objs> </item> <item class_id_reference="18" object_id="_29"> <Obj> <type>3</type> <id>21</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>4</count> <item_version>0</item_version> <item>17</item> <item>18</item> <item>19</item> <item>20</item> </node_objs> </item> <item class_id_reference="18" object_id="_30"> <Obj> <type>3</type> <id>29</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>25</item> <item>26</item> <item>28</item> </node_objs> </item> <item class_id_reference="18" object_id="_31"> <Obj> <type>3</type> <id>32</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>30</item> <item>31</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>34</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_32"> <id>35</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>5</sink_obj> </item> <item class_id_reference="20" object_id="_33"> <id>38</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>6</sink_obj> </item> <item class_id_reference="20" object_id="_34"> <id>39</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>9</sink_obj> </item> <item class_id_reference="20" object_id="_35"> <id>40</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>10</sink_obj> </item> <item class_id_reference="20" object_id="_36"> <id>41</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>11</sink_obj> </item> <item class_id_reference="20" object_id="_37"> <id>42</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>11</sink_obj> </item> <item class_id_reference="20" object_id="_38"> <id>43</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>12</sink_obj> </item> <item class_id_reference="20" object_id="_39"> <id>44</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>13</sink_obj> </item> <item class_id_reference="20" object_id="_40"> <id>45</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>13</sink_obj> </item> <item class_id_reference="20" object_id="_41"> <id>48</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>14</sink_obj> </item> <item class_id_reference="20" object_id="_42"> <id>50</id> <edge_type>1</edge_type> <source_obj>49</source_obj> <sink_obj>14</sink_obj> </item> <item class_id_reference="20" object_id="_43"> <id>51</id> <edge_type>2</edge_type> <source_obj>21</source_obj> <sink_obj>15</sink_obj> </item> <item class_id_reference="20" object_id="_44"> <id>53</id> <edge_type>1</edge_type> <source_obj>52</source_obj> <sink_obj>17</sink_obj> </item> <item class_id_reference="20" object_id="_45"> <id>54</id> <edge_type>2</edge_type> <source_obj>16</source_obj> <sink_obj>17</sink_obj> </item> <item class_id_reference="20" object_id="_46"> <id>55</id> <edge_type>1</edge_type> <source_obj>19</source_obj> <sink_obj>17</sink_obj> </item> <item class_id_reference="20" object_id="_47"> <id>56</id> <edge_type>2</edge_type> <source_obj>29</source_obj> <sink_obj>17</sink_obj> </item> <item class_id_reference="20" object_id="_48"> <id>57</id> <edge_type>1</edge_type> <source_obj>17</source_obj> <sink_obj>18</sink_obj> </item> <item class_id_reference="20" object_id="_49"> <id>59</id> <edge_type>1</edge_type> <source_obj>58</source_obj> <sink_obj>18</sink_obj> </item> <item class_id_reference="20" object_id="_50"> <id>60</id> <edge_type>1</edge_type> <source_obj>17</source_obj> <sink_obj>19</sink_obj> </item> <item class_id_reference="20" object_id="_51"> <id>62</id> <edge_type>1</edge_type> <source_obj>61</source_obj> <sink_obj>19</sink_obj> </item> <item class_id_reference="20" object_id="_52"> <id>63</id> <edge_type>1</edge_type> <source_obj>18</source_obj> <sink_obj>20</sink_obj> </item> <item class_id_reference="20" object_id="_53"> <id>64</id> <edge_type>2</edge_type> <source_obj>29</source_obj> <sink_obj>20</sink_obj> </item> <item class_id_reference="20" object_id="_54"> <id>65</id> <edge_type>2</edge_type> <source_obj>32</source_obj> <sink_obj>20</sink_obj> </item> <item class_id_reference="20" object_id="_55"> <id>68</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_56"> <id>71</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>26</sink_obj> </item> <item class_id_reference="20" object_id="_57"> <id>72</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>26</sink_obj> </item> <item class_id_reference="20" object_id="_58"> <id>74</id> <edge_type>1</edge_type> <source_obj>73</source_obj> <sink_obj>26</sink_obj> </item> <item class_id_reference="20" object_id="_59"> <id>75</id> <edge_type>2</edge_type> <source_obj>21</source_obj> <sink_obj>28</sink_obj> </item> <item class_id_reference="20" object_id="_60"> <id>78</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>30</sink_obj> </item> <item class_id_reference="20" object_id="_61"> <id>145</id> <edge_type>2</edge_type> <source_obj>16</source_obj> <sink_obj>21</sink_obj> </item> <item class_id_reference="20" object_id="_62"> <id>146</id> <edge_type>2</edge_type> <source_obj>21</source_obj> <sink_obj>32</sink_obj> </item> <item class_id_reference="20" object_id="_63"> <id>147</id> <edge_type>2</edge_type> <source_obj>21</source_obj> <sink_obj>29</sink_obj> </item> <item class_id_reference="20" object_id="_64"> <id>148</id> <edge_type>2</edge_type> <source_obj>29</source_obj> <sink_obj>21</sink_obj> </item> <item class_id_reference="20" object_id="_65"> <id>149</id> <edge_type>4</edge_type> <source_obj>14</source_obj> <sink_obj>26</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="_66"> <mId>1</mId> <mTag>Stream2Mem</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>24</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_67"> <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>16</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>1</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_68"> <mId>3</mId> <mTag>Loop 1</mTag> <mType>1</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>21</item> <item>29</item> </basic_blocks> <mII>1</mII> <mDepth>3</mDepth> <mMinTripCount>16</mMinTripCount> <mMaxTripCount>16</mMaxTripCount> <mMinLatency>17</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_69"> <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>32</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="24" tracking_level="1" version="0" object_id="_70"> <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="_71"> <id>1</id> <operations class_id="27" tracking_level="0" version="0"> <count>5</count> <item_version>0</item_version> <item class_id="28" tracking_level="1" version="0" object_id="_72"> <id>5</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_73"> <id>6</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_74"> <id>9</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_75"> <id>10</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_76"> <id>11</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_77"> <id>2</id> <operations> <count>6</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_78"> <id>7</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_79"> <id>8</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_80"> <id>12</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_81"> <id>13</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_82"> <id>14</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_83"> <id>15</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_84"> <id>3</id> <operations> <count>4</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_85"> <id>17</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_86"> <id>18</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_87"> <id>19</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_88"> <id>20</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_89"> <id>4</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_90"> <id>25</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_91"> <id>5</id> <operations> <count>6</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_92"> <id>22</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_93"> <id>23</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_94"> <id>24</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_95"> <id>26</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_96"> <id>27</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_97"> <id>28</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_98"> <id>6</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_99"> <id>30</id> <stage>5</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_100"> <id>7</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_101"> <id>30</id> <stage>4</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_102"> <id>8</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_103"> <id>30</id> <stage>3</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_104"> <id>9</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_105"> <id>30</id> <stage>2</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_106"> <id>10</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_107"> <id>30</id> <stage>1</stage> <latency>5</latency> </item> <item class_id_reference="28" object_id="_108"> <id>31</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="_109"> <inState>1</inState> <outState>2</outState> <condition class_id="31" tracking_level="0" version="0"> <id>16</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="_110"> <inState>2</inState> <outState>3</outState> <condition> <id>18</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="_111"> <inState>6</inState> <outState>7</outState> <condition> <id>25</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="_112"> <inState>7</inState> <outState>8</outState> <condition> <id>26</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="_113"> <inState>8</inState> <outState>9</outState> <condition> <id>27</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="_114"> <inState>9</inState> <outState>10</outState> <condition> <id>28</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="_115"> <inState>4</inState> <outState>5</outState> <condition> <id>30</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="_116"> <inState>5</inState> <outState>3</outState> <condition> <id>31</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="_117"> <inState>3</inState> <outState>6</outState> <condition> <id>29</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>18</first> <second>0</second> </first> <second>0</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_118"> <inState>3</inState> <outState>4</outState> <condition> <id>32</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>18</first> <second>0</second> </first> <second>1</second> </item> </item> </sop> </condition> </item> </transitions> </fsm> <res class_id="-1"></res> <node_label_latency class_id="37" tracking_level="0" version="0"> <count>18</count> <item_version>0</item_version> <item class_id="38" tracking_level="0" version="0"> <first>5</first> <second class_id="39" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>6</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>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>1</first> <second>0</second> </second> </item> <item> <first>13</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>14</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>15</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>17</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>18</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>19</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>20</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>25</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>26</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>28</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>30</first> <second> <first>3</first> <second>4</second> </second> </item> <item> <first>31</first> <second> <first>7</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="40" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="41" tracking_level="0" version="0"> <first>16</first> <second class_id="42" tracking_level="0" version="0"> <first>0</first> <second>1</second> </second> </item> <item> <first>21</first> <second> <first>2</first> <second>2</second> </second> </item> <item> <first>29</first> <second> <first>3</first> <second>4</second> </second> </item> <item> <first>32</first> <second> <first>3</first> <second>7</second> </second> </item> </bblk_ent_exit> <regions class_id="43" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="44" tracking_level="1" version="0" object_id="_119"> <region_name>Loop 1</region_name> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>21</item> <item>29</item> </basic_blocks> <nodes> <count>0</count> <item_version>0</item_version> </nodes> <anchor_node>-1</anchor_node> <region_type>8</region_type> <interval>1</interval> <pipe_depth>3</pipe_depth> </item> </regions> <dp_fu_nodes class_id="45" tracking_level="0" version="0"> <count>12</count> <item_version>0</item_version> <item class_id="46" tracking_level="0" version="0"> <first>64</first> <second> <count>1</count> <item_version>0</item_version> <item>5</item> </second> </item> <item> <first>70</first> <second> <count>1</count> <item_version>0</item_version> <item>6</item> </second> </item> <item> <first>76</first> <second> <count>7</count> <item_version>0</item_version> <item>14</item> <item>26</item> <item>30</item> <item>30</item> <item>30</item> <item>30</item> <item>30</item> </second> </item> <item> <first>83</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>97</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> <item> <first>104</first> <second> <count>1</count> <item_version>0</item_version> <item>9</item> </second> </item> <item> <first>108</first> <second> <count>1</count> <item_version>0</item_version> <item>10</item> </second> </item> <item> <first>112</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>118</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>121</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>128</first> <second> <count>1</count> <item_version>0</item_version> <item>18</item> </second> </item> <item> <first>134</first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> </dp_fu_nodes> <dp_fu_nodes_expression class_id="48" tracking_level="0" version="0"> <count>8</count> <item_version>0</item_version> <item class_id="49" tracking_level="0" version="0"> <first>i_1_fu_134</first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> <item> <first>i_phi_fu_97</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> <item> <first>out_V3_cast8_fu_108</first> <second> <count>1</count> <item_version>0</item_version> <item>10</item> </second> </item> <item> <first>out_V_addr_fu_121</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>sum1_cast_fu_118</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>sum1_fu_112</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>tmp_5_cast_fu_104</first> <second> <count>1</count> <item_version>0</item_version> <item>9</item> </second> </item> <item> <first>tmp_fu_128</first> <second> <count>1</count> <item_version>0</item_version> <item>18</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>grp_writeresp_fu_76</first> <second> <count>7</count> <item_version>0</item_version> <item>14</item> <item>26</item> <item>30</item> <item>30</item> <item>30</item> <item>30</item> <item>30</item> </second> </item> <item> <first>out_V3_read_read_fu_70</first> <second> <count>1</count> <item_version>0</item_version> <item>6</item> </second> </item> <item> <first>tmp_2_read_read_fu_64</first> <second> <count>1</count> <item_version>0</item_version> <item>5</item> </second> </item> <item> <first>tmp_V_read_fu_83</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> </dp_fu_nodes_io> <return_ports> <count>0</count> <item_version>0</item_version> </return_ports> <dp_mem_port_nodes class_id="50" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_mem_port_nodes> <dp_reg_nodes> <count>6</count> <item_version>0</item_version> <item> <first>93</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> <item> <first>140</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>145</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>150</first> <second> <count>1</count> <item_version>0</item_version> <item>18</item> </second> </item> <item> <first>154</first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> <item> <first>159</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> </dp_reg_nodes> <dp_regname_nodes> <count>6</count> <item_version>0</item_version> <item> <first>i_1_reg_154</first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> <item> <first>i_reg_93</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> <item> <first>out_V_addr_reg_145</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>sum1_reg_140</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>tmp_V_reg_159</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>tmp_reg_150</first> <second> <count>1</count> <item_version>0</item_version> <item>18</item> </second> </item> </dp_regname_nodes> <dp_reg_phi> <count>1</count> <item_version>0</item_version> <item> <first>93</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> </dp_reg_phi> <dp_regname_phi> <count>1</count> <item_version>0</item_version> <item> <first>i_reg_93</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> </dp_regname_phi> <dp_port_io_nodes class_id="51" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="52" tracking_level="0" version="0"> <first>in_V_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> </second> </item> <item> <first>out_V</first> <second> <count>0</count> <item_version>0</item_version> </second> </item> <item> <first>out_V3</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>tmp_2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>5</item> </second> </item> </second> </item> </dp_port_io_nodes> <port2core class_id="53" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="54" tracking_level="0" version="0"> <first>1</first> <second>FSL</second> </item> </port2core> <node2core> <count>0</count> <item_version>0</item_version> </node2core> </syndb> </boost_serialization>

25.516281

89

0.58927

5740cebb5fc155e156b0df89cf8b2b97fee0d2ba

1,078

adb

Ada

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- { dg-do run } -- { dg-options "-gnatws" } procedure entry_queues is F1_Poe : Integer := 18; function F1 return Integer is begin F1_Poe := F1_Poe - 1; return F1_Poe; end F1; generic type T is limited private; with function Is_Ok (X : T) return Boolean; procedure Check; procedure Check is begin declare type Poe is new T; X : Poe; Y : Poe; begin null; end; declare type Poe is new T; type Arr is array (1 .. 2) of Poe; X : Arr; B : Boolean := Is_Ok (T (X (1))); begin null; end; end; protected type Poe (D3 : Integer := F1) is entry E (D3 .. F1); -- F1 evaluated function Is_Ok return Boolean; end Poe; protected body Poe is Entry E (for I in D3 .. F1) when True is begin null; end E; function Is_Ok return Boolean is begin return False; end Is_Ok; end Poe; function Is_Ok (C : Poe) return Boolean is begin return C.Is_Ok; end Is_Ok; procedure Chk is new Check (Poe, Is_Ok); begin Chk; end;

19.6

47

0.580705

5774510cee28033339df2cff29431b174f727c21

1,263

ads

Ada

source/asis/spec/ada-storage_io.ads

faelys/gela-asis

48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253

[ "BSD-3-Clause" ]

4

2016-02-05T15:51:56.000Z

2022-03-25T20:38:32.000Z

source/asis/spec/ada-storage_io.ads

faelys/gela-asis

48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253

[ "BSD-3-Clause" ]

null

source/asis/spec/ada-storage_io.ads

faelys/gela-asis

48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- A d a r u n - t i m e s p e c i f i c a t i o n -- -- ASIS implementation for Gela project, a portable Ada compiler -- -- http://gela.ada-ru.org -- -- - - - - - - - - - - - - - - - -- -- Read copyright and license at the end of ada.ads file -- ------------------------------------------------------------------------------ -- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $ with Ada.IO_Exceptions; with System.Storage_Elements; generic type Element_Type is private; package Ada.Storage_IO is pragma Preelaborate (Storage_IO); Buffer_Size : constant System.Storage_Elements.Storage_Count := implementation-defined; subtype Buffer_Type is System.Storage_Elements.Storage_Array (1 .. Buffer_Size); -- Input and output operations procedure Read (Buffer : in Buffer_Type; Item : out Element_Type); procedure Write (Buffer : out Buffer_Type; Item : in Element_Type); -- Exceptions Data_Error : exception renames IO_Exceptions.Data_Error; end Ada.Storage_IO;

33.236842

78

0.515439

2250e09f562ffd920afbffc0bcbd661616e47954

3,253

ads

Ada

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-conca2.ads

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

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

null

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-conca2.ads

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

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

null

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-conca2.ads

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

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

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- S Y S T E M . C O N C A T _ 2 -- -- -- -- S p e c -- -- -- -- Copyright (C) 2008-2019, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package contains a procedure for runtime concatenation of two string -- operands. It is used when we want to save space in the generated code. pragma Compiler_Unit_Warning; package System.Concat_2 is procedure Str_Concat_2 (R : out String; S1, S2 : String); -- Performs the operation R := S1 & S2. The bounds of R are known to be -- correct (usually set by a call to the Str_Concat_Bounds_2 procedure -- below), so no bounds checks are required, and it is known that none of -- the input operands overlaps R. No assumptions can be made about the -- lower bounds of any of the operands. procedure Str_Concat_Bounds_2 (Lo, Hi : out Natural; S1, S2 : String); -- Assigns to Lo..Hi the bounds of the result of concatenating the two -- given strings, following the rules in the RM regarding null operands. end System.Concat_2;

61.377358

78

0.464187

4128a9a60ab56d3e0b1939aba71386a5b1b28f9a

1,939

adb

Ada

source/command_line.adb

jquorning/iDoNu

1618b679f7d0895729dded62f22b0826e7da7cb1

[ "blessing" ]

1

2016-08-09T20:47:23.000Z

source/command_line.adb

jquorning/iDoNu

1618b679f7d0895729dded62f22b0826e7da7cb1

[ "blessing" ]

null

source/command_line.adb

jquorning/iDoNu

1618b679f7d0895729dded62f22b0826e7da7cb1

[ "blessing" ]

null

-- -- The author disclaims copyright to this source code. In place of -- a legal notice, here is a blessing: -- -- May you do good and not evil. -- May you find forgiveness for yourself and forgive others. -- May you share freely, not taking more than you give. -- with Ada.Text_IO; package body Command_Line is procedure Parse (Config : in out Setup.Configuration) is pragma Unreferenced (Config); use Ada.Command_Line; begin if Argument_Count = 1 then if Argument (1) = "--version" then Put_Version; raise Terminate_Program; elsif Argument (1) = "--help" then Put_Usage; raise Terminate_Program; else Put_Usage; raise Terminate_Program; end if; else null; -- Normal program run end if; end Parse; procedure Put_Usage is use Ada.Text_IO; Program_Name : constant String := Setup.Program_Name; begin Put_Line ("The program " & Program_Name & " manages your " & "projects and activities via web page."); New_Line; Put_Line ("$ " & Program_Name & " [--port=PORT] [--dir=DIR]"); Put_Line ("$ " & Program_Name & " --version"); Put_Line ("$ " & Program_Name & " --help"); New_Line; Put_Line ("--help - Show this usage text and exit"); Put_Line ("--version - Show program version and exit"); Put_Line ("--port=PORT - Web server port (Default 8080)"); Put_Line ("--dir=DIR - Colletion directory (Default current dir)"); New_Line; Put_Line ("safari http://localhost:8080 - Web server port"); New_Line; end Put_Usage; procedure Put_Version is use Setup, Ada.Text_IO; begin Put (Program_Name & " (" & Program_Version & ")"); Put ("Build (" & Build_ISO8601_UTC & ")"); end Put_Version; end Command_Line;

28.514706

75

0.591542

58fa78d5d06d398ee72594f0eb9e42e7ef5f7aa0

102,795

adb

Ada

cordic_pp4fpga/cordic_hls/baseline/.autopilot/db/cordic.bind.adb

schuang23/MSOC

cef110c1efe0ad8c1892d33505f7648de1fa2416

[ "Unlicense" ]

null

cordic_pp4fpga/cordic_hls/baseline/.autopilot/db/cordic.bind.adb

schuang23/MSOC

cef110c1efe0ad8c1892d33505f7648de1fa2416

[ "Unlicense" ]

null

cordic_pp4fpga/cordic_hls/baseline/.autopilot/db/cordic.bind.adb

schuang23/MSOC

cef110c1efe0ad8c1892d33505f7648de1fa2416

[ "Unlicense" ]

null

<?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="15"> <syndb class_id="0" tracking_level="0" version="0"> <userIPLatency>-1</userIPLatency> <userIPName></userIPName> <cdfg class_id="1" tracking_level="1" version="0" object_id="_0"> <name>cordic</name> <ret_bitwidth>0</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>3</count> <item_version>0</item_version> <item class_id="3" tracking_level="1" version="0" object_id="_1"> <Value class_id="4" tracking_level="0" version="0"> <Obj class_id="5" tracking_level="0" version="0"> <type>1</type> <id>1</id> <name>theta_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo class_id="6" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>12</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>s_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>s.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>12</bitwidth> </Value> <direction>1</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_3"> <Value> <Obj> <type>1</type> <id>3</id> <name>c_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>c.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>12</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>31</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_4"> <Value> <Obj> <type>0</type> <id>8</id> <name>theta_V_read</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>8</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="10" tracking_level="0" version="0"> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second class_id="11" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="12" tracking_level="0" version="0"> <first class_id="13" tracking_level="0" version="0"> <first>cordic.cpp</first> <second>cordic</second> </first> <second>8</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>12</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>46</item> <item>47</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>1</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_5"> <Value> <Obj> <type>0</type> <id>9</id> <name>tmp</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>20</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>20</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>49</item> <item>50</item> <item>52</item> </oprand_edges> <opcode>bitselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>2</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_6"> <Value> <Obj> <type>0</type> <id>10</id> <name>_ln18</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>18</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>18</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>53</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.76</m_delay> <m_topoIndex>3</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_7"> <Value> <Obj> <type>0</type> <id>12</id> <name>factor_0</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>r.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>12</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>55</item> <item>56</item> <item>57</item> <item>58</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>4</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_8"> <Value> <Obj> <type>0</type> <id>13</id> <name>p_Val2_4</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>current_sin.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>12</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>60</item> <item>61</item> <item>62</item> <item>63</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>5</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_9"> <Value> <Obj> <type>0</type> <id>14</id> <name>p_Val2_2</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>current_cos.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>12</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>65</item> <item>66</item> <item>67</item> <item>68</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>6</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_10"> <Value> <Obj> <type>0</type> <id>15</id> <name>j_0</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>j</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>6</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>70</item> <item>71</item> <item>72</item> <item>73</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>7</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_11"> <Value> <Obj> <type>0</type> <id>16</id> <name>icmp_ln18</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>18</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>18</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>74</item> <item>76</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.42</m_delay> <m_topoIndex>8</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_12"> <Value> <Obj> <type>0</type> <id>18</id> <name>j</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>18</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>18</second> </item> </second> </item> </inlineStackInfo> <originalName>j</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>6</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>77</item> <item>79</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.82</m_delay> <m_topoIndex>9</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_13"> <Value> <Obj> <type>0</type> <id>19</id> <name>_ln18</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>18</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>18</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>80</item> <item>81</item> <item>82</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>10</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_14"> <Value> <Obj> <type>0</type> <id>22</id> <name>sext_ln1116</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>23</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>23</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>83</item> </oprand_edges> <opcode>sext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>11</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_15"> <Value> <Obj> <type>0</type> <id>23</id> <name>sub_ln1118</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>23</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>23</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>85</item> <item>86</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.54</m_delay> <m_topoIndex>12</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_16"> <Value> <Obj> <type>0</type> <id>24</id> <name>r_V</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>23</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>23</second> </item> </second> </item> </inlineStackInfo> <originalName>r.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>87</item> <item>88</item> <item>89</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.69</m_delay> <m_topoIndex>13</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_17"> <Value> <Obj> <type>0</type> <id>25</id> <name>sext_ln1116_1</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>23</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>23</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>22</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>90</item> </oprand_edges> <opcode>sext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>14</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_18"> <Value> <Obj> <type>0</type> <id>26</id> <name>sext_ln1118</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>23</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>23</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>22</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>91</item> </oprand_edges> <opcode>sext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>15</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_19"> <Value> <Obj> <type>0</type> <id>27</id> <name>r_V_5</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>23</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>23</second> </item> </second> </item> </inlineStackInfo> <originalName>r.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>22</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>92</item> <item>93</item> </oprand_edges> <opcode>mul</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>6.38</m_delay> <m_topoIndex>16</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_20"> <Value> <Obj> <type>0</type> <id>28</id> <name>cos_shift_V</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>23</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>23</second> </item> </second> </item> </inlineStackInfo> <originalName>cos_shift.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>12</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>95</item> <item>96</item> <item>98</item> <item>100</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>17</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_21"> <Value> <Obj> <type>0</type> <id>29</id> <name>sext_ln1116_2</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>24</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>24</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>101</item> </oprand_edges> <opcode>sext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>18</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_22"> <Value> <Obj> <type>0</type> <id>30</id> <name>sub_ln1118_1</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>24</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>24</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>102</item> <item>103</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.54</m_delay> <m_topoIndex>19</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_23"> <Value> <Obj> <type>0</type> <id>31</id> <name>r_V_2</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>24</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>24</second> </item> </second> </item> </inlineStackInfo> <originalName>r.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>104</item> <item>105</item> <item>106</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.69</m_delay> <m_topoIndex>20</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_24"> <Value> <Obj> <type>0</type> <id>32</id> <name>sext_ln1116_3</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>24</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>24</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>22</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>107</item> </oprand_edges> <opcode>sext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>21</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_25"> <Value> <Obj> <type>0</type> <id>33</id> <name>r_V_6</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>24</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>24</second> </item> </second> </item> </inlineStackInfo> <originalName>r.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>22</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>108</item> <item>109</item> </oprand_edges> <opcode>mul</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>6.38</m_delay> <m_topoIndex>22</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_26"> <Value> <Obj> <type>0</type> <id>34</id> <name>sin_shift_V</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>24</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>24</second> </item> </second> </item> </inlineStackInfo> <originalName>sin_shift.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>12</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>110</item> <item>111</item> <item>112</item> <item>113</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>23</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_27"> <Value> <Obj> <type>0</type> <id>35</id> <name>current_cos_V</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>42</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>42</second> </item> </second> </item> </inlineStackInfo> <originalName>current_cos.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>12</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>114</item> <item>115</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.54</m_delay> <m_topoIndex>29</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_28"> <Value> <Obj> <type>0</type> <id>36</id> <name>current_sin_V</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>43</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>43</second> </item> </second> </item> </inlineStackInfo> <originalName>current_sin.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>12</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>116</item> <item>117</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.54</m_delay> <m_topoIndex>30</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_29"> <Value> <Obj> <type>0</type> <id>37</id> <name>trunc_ln</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>48</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>48</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>119</item> <item>120</item> <item>122</item> <item>123</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>24</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_30"> <Value> <Obj> <type>0</type> <id>38</id> <name>r_V_7</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>48</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>48</second> </item> </second> </item> </inlineStackInfo> <originalName>r.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>12</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>124</item> </oprand_edges> <opcode>sext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>25</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_31"> <Value> <Obj> <type>0</type> <id>39</id> <name>_ln18</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>18</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>18</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>125</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>31</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_32"> <Value> <Obj> <type>0</type> <id>41</id> <name>s_V_write_ln52</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>52</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>52</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>127</item> <item>128</item> <item>129</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>26</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_33"> <Value> <Obj> <type>0</type> <id>42</id> <name>c_V_write_ln52</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>52</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>52</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>130</item> <item>131</item> <item>132</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>27</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_34"> <Value> <Obj> <type>0</type> <id>43</id> <name>_ln53</name> <fileName>cordic.cpp</fileName> <fileDirectory>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</fileDirectory> <lineNumber>53</lineNumber> <contextFuncName>cordic</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:\Users\user-pc\Desktop\msoc\self_paced\cordic_pp4fpga</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>cordic.cpp</first> <second>cordic</second> </first> <second>53</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>0</count> <item_version>0</item_version> </oprand_edges> <opcode>ret</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>28</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> </nodes> <consts class_id="15" tracking_level="0" version="0"> <count>11</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_35"> <Value> <Obj> <type>2</type> <id>51</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>11</content> </item> <item class_id_reference="16" object_id="_36"> <Value> <Obj> <type>2</type> <id>54</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>12</bitwidth> </Value> <const_type>0</const_type> <content>1024</content> </item> <item class_id_reference="16" object_id="_37"> <Value> <Obj> <type>2</type> <id>59</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>12</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_38"> <Value> <Obj> <type>2</type> <id>64</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>12</bitwidth> </Value> <const_type>0</const_type> <content>621</content> </item> <item class_id_reference="16" object_id="_39"> <Value> <Obj> <type>2</type> <id>69</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>6</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_40"> <Value> <Obj> <type>2</type> <id>75</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>6</bitwidth> </Value> <const_type>0</const_type> <content>32</content> </item> <item class_id_reference="16" object_id="_41"> <Value> <Obj> <type>2</type> <id>78</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>6</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>84</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>13</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_43"> <Value> <Obj> <type>2</type> <id>97</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>10</content> </item> <item class_id_reference="16" object_id="_44"> <Value> <Obj> <type>2</type> <id>99</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>21</content> </item> <item class_id_reference="16" object_id="_45"> <Value> <Obj> <type>2</type> <id>121</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> </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="_46"> <Obj> <type>3</type> <id>11</id> <name>ap_fixed_base.exit404</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>8</item> <item>9</item> <item>10</item> </node_objs> </item> <item class_id_reference="18" object_id="_47"> <Obj> <type>3</type> <id>20</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>7</count> <item_version>0</item_version> <item>12</item> <item>13</item> <item>14</item> <item>15</item> <item>16</item> <item>18</item> <item>19</item> </node_objs> </item> <item class_id_reference="18" object_id="_48"> <Obj> <type>3</type> <id>40</id> <name>_ZltILi12ELi2ELb1EL9ap_q_mode5EL9ap_o_mode3ELi0EEbRK13ap_fixed_baseIXT_EXT0_EXT1_EXT2_EXT3_EXT4_EEi.exit</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>18</count> <item_version>0</item_version> <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> </node_objs> </item> <item class_id_reference="18" object_id="_49"> <Obj> <type>3</type> <id>44</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>41</item> <item>42</item> <item>43</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>69</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_50"> <id>47</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>8</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_51"> <id>50</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>9</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_52"> <id>52</id> <edge_type>1</edge_type> <source_obj>51</source_obj> <sink_obj>9</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_53"> <id>53</id> <edge_type>2</edge_type> <source_obj>20</source_obj> <sink_obj>10</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_54"> <id>55</id> <edge_type>1</edge_type> <source_obj>54</source_obj> <sink_obj>12</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_55"> <id>56</id> <edge_type>2</edge_type> <source_obj>11</source_obj> <sink_obj>12</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_56"> <id>57</id> <edge_type>1</edge_type> <source_obj>38</source_obj> <sink_obj>12</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_57"> <id>58</id> <edge_type>2</edge_type> <source_obj>40</source_obj> <sink_obj>12</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_58"> <id>60</id> <edge_type>1</edge_type> <source_obj>59</source_obj> <sink_obj>13</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_59"> <id>61</id> <edge_type>2</edge_type> <source_obj>11</source_obj> <sink_obj>13</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_60"> <id>62</id> <edge_type>1</edge_type> <source_obj>36</source_obj> <sink_obj>13</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_61"> <id>63</id> <edge_type>2</edge_type> <source_obj>40</source_obj> <sink_obj>13</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_62"> <id>65</id> <edge_type>1</edge_type> <source_obj>64</source_obj> <sink_obj>14</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_63"> <id>66</id> <edge_type>2</edge_type> <source_obj>11</source_obj> <sink_obj>14</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_64"> <id>67</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>14</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_65"> <id>68</id> <edge_type>2</edge_type> <source_obj>40</source_obj> <sink_obj>14</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_66"> <id>70</id> <edge_type>1</edge_type> <source_obj>69</source_obj> <sink_obj>15</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_67"> <id>71</id> <edge_type>2</edge_type> <source_obj>11</source_obj> <sink_obj>15</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_68"> <id>72</id> <edge_type>1</edge_type> <source_obj>18</source_obj> <sink_obj>15</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_69"> <id>73</id> <edge_type>2</edge_type> <source_obj>40</source_obj> <sink_obj>15</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_70"> <id>74</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>16</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_71"> <id>76</id> <edge_type>1</edge_type> <source_obj>75</source_obj> <sink_obj>16</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_72"> <id>77</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>18</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_73"> <id>79</id> <edge_type>1</edge_type> <source_obj>78</source_obj> <sink_obj>18</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_74"> <id>80</id> <edge_type>1</edge_type> <source_obj>16</source_obj> <sink_obj>19</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_75"> <id>81</id> <edge_type>2</edge_type> <source_obj>40</source_obj> <sink_obj>19</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_76"> <id>82</id> <edge_type>2</edge_type> <source_obj>44</source_obj> <sink_obj>19</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_77"> <id>83</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>22</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_78"> <id>85</id> <edge_type>1</edge_type> <source_obj>84</source_obj> <sink_obj>23</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_79"> <id>86</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>23</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_80"> <id>87</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>24</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_81"> <id>88</id> <edge_type>1</edge_type> <source_obj>23</source_obj> <sink_obj>24</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_82"> <id>89</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>24</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_83"> <id>90</id> <edge_type>1</edge_type> <source_obj>24</source_obj> <sink_obj>25</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_84"> <id>91</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>26</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_85"> <id>92</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>27</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_86"> <id>93</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>27</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_87"> <id>96</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>28</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_88"> <id>98</id> <edge_type>1</edge_type> <source_obj>97</source_obj> <sink_obj>28</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_89"> <id>100</id> <edge_type>1</edge_type> <source_obj>99</source_obj> <sink_obj>28</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_90"> <id>101</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>29</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_91"> <id>102</id> <edge_type>1</edge_type> <source_obj>84</source_obj> <sink_obj>30</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_92"> <id>103</id> <edge_type>1</edge_type> <source_obj>29</source_obj> <sink_obj>30</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_93"> <id>104</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>31</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_94"> <id>105</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>31</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_95"> <id>106</id> <edge_type>1</edge_type> <source_obj>29</source_obj> <sink_obj>31</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_96"> <id>107</id> <edge_type>1</edge_type> <source_obj>31</source_obj> <sink_obj>32</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_97"> <id>108</id> <edge_type>1</edge_type> <source_obj>32</source_obj> <sink_obj>33</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_98"> <id>109</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>33</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_99"> <id>111</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>34</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_100"> <id>112</id> <edge_type>1</edge_type> <source_obj>97</source_obj> <sink_obj>34</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_101"> <id>113</id> <edge_type>1</edge_type> <source_obj>99</source_obj> <sink_obj>34</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_102"> <id>114</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>35</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_103"> <id>115</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>35</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_104"> <id>116</id> <edge_type>1</edge_type> <source_obj>28</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_105"> <id>117</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_106"> <id>120</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>37</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_107"> <id>122</id> <edge_type>1</edge_type> <source_obj>121</source_obj> <sink_obj>37</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_108"> <id>123</id> <edge_type>1</edge_type> <source_obj>51</source_obj> <sink_obj>37</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_109"> <id>124</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>38</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_110"> <id>125</id> <edge_type>2</edge_type> <source_obj>20</source_obj> <sink_obj>39</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_111"> <id>128</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>41</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_112"> <id>129</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>41</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_113"> <id>131</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>42</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_114"> <id>132</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>42</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_115"> <id>156</id> <edge_type>2</edge_type> <source_obj>11</source_obj> <sink_obj>20</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_116"> <id>157</id> <edge_type>2</edge_type> <source_obj>20</source_obj> <sink_obj>44</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_117"> <id>158</id> <edge_type>2</edge_type> <source_obj>20</source_obj> <sink_obj>40</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_118"> <id>159</id> <edge_type>2</edge_type> <source_obj>40</source_obj> <sink_obj>20</sink_obj> <is_back_edge>1</is_back_edge> </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="_119"> <mId>1</mId> <mTag>cordic</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>65</mMinLatency> <mMaxLatency>65</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_120"> <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>11</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>0</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_121"> <mId>3</mId> <mTag>L1</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>20</item> <item>40</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>32</mMinTripCount> <mMaxTripCount>32</mMaxTripCount> <mMinLatency>64</mMinLatency> <mMaxLatency>64</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_122"> <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>44</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>0</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> </cdfg_regions> <fsm class_id="24" tracking_level="1" version="0" object_id="_123"> <states class_id="25" tracking_level="0" version="0"> <count>3</count> <item_version>0</item_version> <item class_id="26" tracking_level="1" version="0" object_id="_124"> <id>1</id> <operations class_id="27" tracking_level="0" version="0"> <count>7</count> <item_version>0</item_version> <item class_id="28" tracking_level="1" version="0" object_id="_125"> <id>4</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_126"> <id>5</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_127"> <id>6</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_128"> <id>7</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_129"> <id>8</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_130"> <id>9</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_131"> <id>10</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_132"> <id>2</id> <operations> <count>26</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_133"> <id>12</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_134"> <id>13</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_135"> <id>14</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_136"> <id>15</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_137"> <id>16</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_138"> <id>17</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_139"> <id>18</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_140"> <id>19</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_141"> <id>22</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_142"> <id>23</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_143"> <id>24</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_144"> <id>25</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_145"> <id>26</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_146"> <id>27</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_147"> <id>28</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_148"> <id>29</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_149"> <id>30</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_150"> <id>31</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_151"> <id>32</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_152"> <id>33</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_153"> <id>34</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_154"> <id>37</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_155"> <id>38</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_156"> <id>41</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_157"> <id>42</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_158"> <id>43</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_159"> <id>3</id> <operations> <count>4</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_160"> <id>21</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_161"> <id>35</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_162"> <id>36</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_163"> <id>39</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> </states> <transitions class_id="29" tracking_level="0" version="0"> <count>3</count> <item_version>0</item_version> <item class_id="30" tracking_level="1" version="0" object_id="_164"> <inState>1</inState> <outState>2</outState> <condition class_id="31" tracking_level="0" version="0"> <id>-1</id> <sop class_id="32" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="33" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_165"> <inState>2</inState> <outState>3</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item class_id="34" tracking_level="0" version="0"> <first class_id="35" tracking_level="0" version="0"> <first>16</first> <second>0</second> </first> <second>1</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_166"> <inState>3</inState> <outState>2</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> </transitions> </fsm> <res class_id="-1"></res> <node_label_latency class_id="37" tracking_level="0" version="0"> <count>31</count> <item_version>0</item_version> <item class_id="38" tracking_level="0" version="0"> <first>8</first> <second class_id="39" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>9</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>10</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>12</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>13</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>14</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>15</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>16</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>18</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>19</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>22</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>23</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>24</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>25</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>26</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>27</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>28</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>29</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>30</first> <second> <first>1</first> <second>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>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>1</first> <second>0</second> </second> </item> <item> <first>38</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>39</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>41</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>42</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>43</first> <second> <first>1</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="40" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="41" tracking_level="0" version="0"> <first>11</first> <second class_id="42" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>20</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>40</first> <second> <first>1</first> <second>2</second> </second> </item> <item> <first>44</first> <second> <first>1</first> <second>1</second> </second> </item> </bblk_ent_exit> <regions class_id="43" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </regions> <dp_fu_nodes class_id="44" tracking_level="0" version="0"> <count>27</count> <item_version>0</item_version> <item class_id="45" tracking_level="0" version="0"> <first>52</first> <second> <count>1</count> <item_version>0</item_version> <item>8</item> </second> </item> <item> <first>58</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>65</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>76</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>87</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>100</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> <item> <first>113</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>120</first> <second> <count>1</count> <item_version>0</item_version> <item>9</item> </second> </item> <item> <first>128</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>134</first> <second> <count>1</count> <item_version>0</item_version> <item>18</item> </second> </item> <item> <first>140</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>144</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>150</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>157</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>161</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>165</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>174</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>178</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>184</first> <second> <count>1</count> <item_version>0</item_version> <item>31</item> </second> </item> <item> <first>191</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>195</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>204</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>214</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>218</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>223</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>228</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> <item> <first>235</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> </dp_fu_nodes> <dp_fu_nodes_expression class_id="47" tracking_level="0" version="0"> <count>24</count> <item_version>0</item_version> <item class_id="48" tracking_level="0" version="0"> <first>cos_shift_V_fu_165</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>current_cos_V_fu_218</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>current_sin_V_fu_223</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>factor_0_phi_fu_76</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>icmp_ln18_fu_128</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>j_0_phi_fu_113</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>j_fu_134</first> <second> <count>1</count> <item_version>0</item_version> <item>18</item> </second> </item> <item> <first>p_Val2_2_phi_fu_100</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> <item> <first>p_Val2_4_phi_fu_87</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>r_V_2_fu_184</first> <second> <count>1</count> <item_version>0</item_version> <item>31</item> </second> </item> <item> <first>r_V_5_fu_228</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> <item> <first>r_V_6_fu_235</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>r_V_7_fu_214</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>r_V_fu_150</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>sext_ln1116_1_fu_157</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>sext_ln1116_2_fu_174</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>sext_ln1116_3_fu_191</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>sext_ln1116_fu_140</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>sext_ln1118_fu_161</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>sin_shift_V_fu_195</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>sub_ln1118_1_fu_178</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>sub_ln1118_fu_144</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>tmp_fu_120</first> <second> <count>1</count> <item_version>0</item_version> <item>9</item> </second> </item> <item> <first>trunc_ln_fu_204</first> <second> <count>1</count> <item_version>0</item_version> <item>37</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>3</count> <item_version>0</item_version> <item> <first>theta_V_read_read_fu_52</first> <second> <count>1</count> <item_version>0</item_version> <item>8</item> </second> </item> <item> <first>write_ln52_write_fu_58</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>write_ln52_write_fu_65</first> <second> <count>1</count> <item_version>0</item_version> <item>42</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="49" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_mem_port_nodes> <dp_reg_nodes> <count>11</count> <item_version>0</item_version> <item> <first>72</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>83</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>96</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> <item> <first>109</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>242</first> <second> <count>1</count> <item_version>0</item_version> <item>9</item> </second> </item> <item> <first>251</first> <second> <count>1</count> <item_version>0</item_version> <item>18</item> </second> </item> <item> <first>256</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>261</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>266</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>271</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>276</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> </dp_reg_nodes> <dp_regname_nodes> <count>11</count> <item_version>0</item_version> <item> <first>cos_shift_V_reg_256</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>current_cos_V_reg_271</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>current_sin_V_reg_276</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>factor_0_reg_72</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>j_0_reg_109</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>j_reg_251</first> <second> <count>1</count> <item_version>0</item_version> <item>18</item> </second> </item> <item> <first>p_Val2_2_reg_96</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> <item> <first>p_Val2_4_reg_83</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>r_V_7_reg_266</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>sin_shift_V_reg_261</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>tmp_reg_242</first> <second> <count>1</count> <item_version>0</item_version> <item>9</item> </second> </item> </dp_regname_nodes> <dp_reg_phi> <count>4</count> <item_version>0</item_version> <item> <first>72</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>83</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>96</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> <item> <first>109</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> </dp_reg_phi> <dp_regname_phi> <count>4</count> <item_version>0</item_version> <item> <first>factor_0_reg_72</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>j_0_reg_109</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>p_Val2_2_reg_96</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> <item> <first>p_Val2_4_reg_83</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> </dp_regname_phi> <dp_port_io_nodes class_id="50" tracking_level="0" version="0"> <count>3</count> <item_version>0</item_version> <item class_id="51" tracking_level="0" version="0"> <first>c_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> </second> </item> <item> <first>s_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> </second> </item> <item> <first>theta_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>8</item> </second> </item> </second> </item> </dp_port_io_nodes> <port2core class_id="52" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </port2core> <node2core> <count>0</count> <item_version>0</item_version> </node2core> </syndb> </boost_serialization>

26.797445

123

0.576798

3dad6ad8d829dd92b37e038a2adb5b034aa1ce95

912

adb

Ada

Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/fixed_cmp/fixed.adb

samyvic/OS-Project

1622bc1641876584964effd91d65ef02e92728e1

[ "Apache-2.0" ]

null

Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/fixed_cmp/fixed.adb

samyvic/OS-Project

1622bc1641876584964effd91d65ef02e92728e1

[ "Apache-2.0" ]

null

Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/fixed_cmp/fixed.adb

samyvic/OS-Project

1622bc1641876584964effd91d65ef02e92728e1

[ "Apache-2.0" ]

null

-- Copyright 2007-2017 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- This program is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. with Pck; use Pck; procedure Fixed is type Fixed_Point_Type is delta 0.001 range 0.0 .. 1000.0; My_Var : Fixed_Point_Type := 14.0; begin Do_Nothing (My_Var'Address); -- STOP end Fixed;

36.48

73

0.729167

59b9400fe41c1304cb2e2925a9224f0293d5ac98

8,180

ads

Ada

bb-runtimes/src/system/system-xi-ppc-minimal.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/src/system/system-xi-ppc-minimal.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/src/system/system-xi-ppc-minimal.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M -- -- -- -- S p e c -- -- (PPC ELF Version) -- -- -- -- Copyright (C) 1992-2020, Free Software Foundation, Inc. -- -- -- -- This specification is derived from the Ada Reference Manual for use with -- -- GNAT. The copyright notice above, and the license provisions that follow -- -- apply solely to the contents of the part following the private keyword. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ pragma Restrictions (No_Exception_Propagation); -- Only local exception handling is supported in this profile pragma Restrictions (No_Exception_Registration); -- Disable exception name registration. This capability is not used because -- it is only required by exception stream attributes which are not supported -- in this run time. pragma Restrictions (No_Implicit_Dynamic_Code); -- Pointers to nested subprograms are not allowed in this run time, in order -- to prevent the compiler from building "trampolines". pragma Restrictions (No_Finalization); -- Controlled types are not supported in this run time pragma Profile (Ravenscar); -- This is a Ravenscar run time package System is pragma Pure; -- Note that we take advantage of the implementation permission to make -- this unit Pure instead of Preelaborable; see RM 13.7.1(15). In Ada -- 2005, this is Pure in any case (AI-362). pragma No_Elaboration_Code_All; -- Allow the use of that restriction in units that WITH this unit type Name is (SYSTEM_NAME_GNAT); System_Name : constant Name := SYSTEM_NAME_GNAT; -- System-Dependent Named Numbers Min_Int : constant := -2 ** (Standard'Max_Integer_Size - 1); Max_Int : constant := 2 ** (Standard'Max_Integer_Size - 1) - 1; Max_Binary_Modulus : constant := 2 ** Standard'Max_Integer_Size; Max_Nonbinary_Modulus : constant := 2 ** Integer'Size - 1; Max_Base_Digits : constant := Long_Long_Float'Digits; Max_Digits : constant := Long_Long_Float'Digits; Max_Mantissa : constant := Standard'Max_Integer_Size - 1; Fine_Delta : constant := 2.0 ** (-Max_Mantissa); Tick : constant := 0.000_001; -- Storage-related Declarations type Address is private; pragma Preelaborable_Initialization (Address); Null_Address : constant Address; Storage_Unit : constant := 8; Word_Size : constant := 32; Memory_Size : constant := 2 ** 32; -- Address comparison function "<" (Left, Right : Address) return Boolean; function "<=" (Left, Right : Address) return Boolean; function ">" (Left, Right : Address) return Boolean; function ">=" (Left, Right : Address) return Boolean; function "=" (Left, Right : Address) return Boolean; pragma Import (Intrinsic, "<"); pragma Import (Intrinsic, "<="); pragma Import (Intrinsic, ">"); pragma Import (Intrinsic, ">="); pragma Import (Intrinsic, "="); -- Other System-Dependent Declarations type Bit_Order is (High_Order_First, Low_Order_First); Default_Bit_Order : constant Bit_Order := High_Order_First; pragma Warnings (Off, Default_Bit_Order); -- kill constant condition warning -- Priority-related Declarations (RM D.1) Nbr_Interrupt_Priorities : constant Positive := 8; Max_Interrupt_Priority : constant Positive := 255; Max_Priority : constant Positive := Max_Interrupt_Priority - Nbr_Interrupt_Priorities; subtype Any_Priority is Integer range 0 .. Max_Interrupt_Priority; subtype Priority is Any_Priority range 0 .. Max_Priority; subtype Interrupt_Priority is Any_Priority range Priority'Last + 1 .. Any_Priority'Last; Default_Priority : constant Priority := (Priority'Last - Priority'First) / 2; private type Address is mod Memory_Size; Null_Address : constant Address := 0; -------------------------------------- -- System Implementation Parameters -- -------------------------------------- -- These parameters provide information about the target that is used -- by the compiler. They are in the private part of System, where they -- can be accessed using the special circuitry in the Targparm unit -- whose source should be consulted for more detailed descriptions -- of the individual switch values. Atomic_Sync_Default : constant Boolean := False; Backend_Divide_Checks : constant Boolean := False; Backend_Overflow_Checks : constant Boolean := True; Command_Line_Args : constant Boolean := False; Configurable_Run_Time : constant Boolean := True; Denorm : constant Boolean := True; Duration_32_Bits : constant Boolean := False; Exit_Status_Supported : constant Boolean := False; Fractional_Fixed_Ops : constant Boolean := False; Frontend_Layout : constant Boolean := False; Machine_Overflows : constant Boolean := False; Machine_Rounds : constant Boolean := True; Preallocated_Stacks : constant Boolean := True; Signed_Zeros : constant Boolean := True; Stack_Check_Default : constant Boolean := False; Stack_Check_Probes : constant Boolean := False; Stack_Check_Limits : constant Boolean := False; Support_Aggregates : constant Boolean := True; Support_Composite_Assign : constant Boolean := True; Support_Composite_Compare : constant Boolean := True; Support_Long_Shifts : constant Boolean := True; Always_Compatible_Rep : constant Boolean := True; Suppress_Standard_Library : constant Boolean := True; Use_Ada_Main_Program_Name : constant Boolean := False; Frontend_Exceptions : constant Boolean := False; ZCX_By_Default : constant Boolean := True; end System;

47.283237

79

0.576039

1cecd04e7785e6c8d02826b132fc2ed5fff95e48

1,760

ads

Ada

awa/plugins/awa-workspaces/regtests/awa-workspaces-tests.ads

fuzzysloth/ada-awa

f9b921eeea29841667a028f2fc4528e4385d247a

[ "Apache-2.0" ]

null

awa/plugins/awa-workspaces/regtests/awa-workspaces-tests.ads

fuzzysloth/ada-awa

f9b921eeea29841667a028f2fc4528e4385d247a

[ "Apache-2.0" ]

null

awa/plugins/awa-workspaces/regtests/awa-workspaces-tests.ads

fuzzysloth/ada-awa

f9b921eeea29841667a028f2fc4528e4385d247a

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- awa-workspaces-tests -- Unit tests for workspaces and invitations -- 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.Strings.Unbounded; with Util.Tests; with ADO; with AWA.Tests; package AWA.Workspaces.Tests is procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite); type Test is new AWA.Tests.Test with record Member_Id : ADO.Identifier; Key : Ada.Strings.Unbounded.Unbounded_String; end record; -- Verify the anonymous access for the invitation page. procedure Verify_Anonymous (T : in out Test; Key : in String); -- Test sending an invitation. procedure Test_Invite_User (T : in out Test); -- Test deleting the member. procedure Test_Delete_Member (T : in out Test); -- Test accepting the invitation. procedure Test_Accept_Invitation (T : in out Test); -- Test listing the members of the workspace. procedure Test_List_Members (T : in out Test); end AWA.Workspaces.Tests;

35.2

76

0.650568

299958f2af83ec8e820d9b555cb3b6b9aecc3f00

919

ads

Ada

src/libtcod-maps-lines.ads

csb6/libtcod-ada

89c2a75eb357a8468ccb0a6476391a6b388f00b4

[ "BSD-3-Clause" ]

null

src/libtcod-maps-lines.ads

csb6/libtcod-ada

89c2a75eb357a8468ccb0a6476391a6b388f00b4

[ "BSD-3-Clause" ]

null

src/libtcod-maps-lines.ads

csb6/libtcod-ada

89c2a75eb357a8468ccb0a6476391a6b388f00b4

[ "BSD-3-Clause" ]

null

private with bresenham_h; package Libtcod.Maps.Lines is -- Represent line in a data structure type Line is limited private; function make_line(start_x : X_Pos; start_y : Y_Pos; end_x : X_Pos; end_y : Y_Pos) return Line; procedure copy_line(a : Line; b : out Line); function step(l : aliased in out Line; x : aliased in out X_Pos; y : aliased in out Y_Pos) return Boolean with Inline; -- Iterate over a line without an explicit data structure type Line_Callback is access function(x : X_Pos; y : Y_Pos) return Boolean with Convention => C; function visit_line(start_x : X_Pos; start_y : Y_Pos; end_x : X_Pos; end_y : Y_Pos; cb : Line_Callback) return Boolean with Inline; private type Line is limited record data : aliased bresenham_h.TCOD_bresenham_data_t; end record; end Libtcod.Maps.Lines;

26.257143

87

0.663765

3d2c216030913de4d43ccb07c446b015528d040d

20,802

ads

Ada

arch/ARM/Nordic/svd/nrf52/nrf_svd-lpcomp.ads

shakram02/Ada_Drivers_Library

a407ca7ddbc2d9756647016c2f8fd8ef24a239ff

[ "BSD-3-Clause" ]

192

2016-06-01T18:32:04.000Z

2022-03-26T22:52:31.000Z

arch/ARM/Nordic/svd/nrf52/nrf_svd-lpcomp.ads

shakram02/Ada_Drivers_Library

a407ca7ddbc2d9756647016c2f8fd8ef24a239ff

[ "BSD-3-Clause" ]

239

2016-05-26T20:02:01.000Z

2022-03-31T09:46:56.000Z

arch/ARM/Nordic/svd/nrf52/nrf_svd-lpcomp.ads

shakram02/Ada_Drivers_Library

a407ca7ddbc2d9756647016c2f8fd8ef24a239ff

[ "BSD-3-Clause" ]

142

2016-06-05T08:12:20.000Z

2022-03-24T17:37:17.000Z

-- Copyright (c) 2010 - 2018, Nordic Semiconductor ASA -- -- All rights reserved. -- -- Redistribution and use in source and binary forms, with or without modification, -- are permitted provided that the following conditions are met: -- -- 1. Redistributions of source code must retain the above copyright notice, this -- list of conditions and the following disclaimer. -- -- 2. Redistributions in binary form, except as embedded into a Nordic -- Semiconductor ASA integrated circuit in a product or a software update for -- such product, 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 Nordic Semiconductor ASA nor the names of its -- contributors may be used to endorse or promote products derived from this -- software without specific prior written permission. -- -- 4. This software, with or without modification, must only be used with a -- Nordic Semiconductor ASA integrated circuit. -- -- 5. Any software provided in binary form under this license must not be reverse -- engineered, decompiled, modified and/or disassembled. -- -- THIS SOFTWARE IS PROVIDED BY NORDIC SEMICONDUCTOR ASA "AS IS" AND ANY EXPRESS -- OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES -- OF MERCHANTABILITY, NONINFRINGEMENT, AND FITNESS FOR A PARTICULAR PURPOSE ARE -- DISCLAIMED. IN NO EVENT SHALL NORDIC SEMICONDUCTOR ASA 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 spec has been automatically generated from nrf52.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with HAL; with System; package NRF_SVD.LPCOMP is pragma Preelaborate; --------------- -- Registers -- --------------- -- Shortcut between READY event and SAMPLE task type SHORTS_READY_SAMPLE_Field is (-- Disable shortcut Disabled, -- Enable shortcut Enabled) with Size => 1; for SHORTS_READY_SAMPLE_Field use (Disabled => 0, Enabled => 1); -- Shortcut between READY event and STOP task type SHORTS_READY_STOP_Field is (-- Disable shortcut Disabled, -- Enable shortcut Enabled) with Size => 1; for SHORTS_READY_STOP_Field use (Disabled => 0, Enabled => 1); -- Shortcut between DOWN event and STOP task type SHORTS_DOWN_STOP_Field is (-- Disable shortcut Disabled, -- Enable shortcut Enabled) with Size => 1; for SHORTS_DOWN_STOP_Field use (Disabled => 0, Enabled => 1); -- Shortcut between UP event and STOP task type SHORTS_UP_STOP_Field is (-- Disable shortcut Disabled, -- Enable shortcut Enabled) with Size => 1; for SHORTS_UP_STOP_Field use (Disabled => 0, Enabled => 1); -- Shortcut between CROSS event and STOP task type SHORTS_CROSS_STOP_Field is (-- Disable shortcut Disabled, -- Enable shortcut Enabled) with Size => 1; for SHORTS_CROSS_STOP_Field use (Disabled => 0, Enabled => 1); -- Shortcut register type SHORTS_Register is record -- Shortcut between READY event and SAMPLE task READY_SAMPLE : SHORTS_READY_SAMPLE_Field := NRF_SVD.LPCOMP.Disabled; -- Shortcut between READY event and STOP task READY_STOP : SHORTS_READY_STOP_Field := NRF_SVD.LPCOMP.Disabled; -- Shortcut between DOWN event and STOP task DOWN_STOP : SHORTS_DOWN_STOP_Field := NRF_SVD.LPCOMP.Disabled; -- Shortcut between UP event and STOP task UP_STOP : SHORTS_UP_STOP_Field := NRF_SVD.LPCOMP.Disabled; -- Shortcut between CROSS event and STOP task CROSS_STOP : SHORTS_CROSS_STOP_Field := NRF_SVD.LPCOMP.Disabled; -- unspecified Reserved_5_31 : HAL.UInt27 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for SHORTS_Register use record READY_SAMPLE at 0 range 0 .. 0; READY_STOP at 0 range 1 .. 1; DOWN_STOP at 0 range 2 .. 2; UP_STOP at 0 range 3 .. 3; CROSS_STOP at 0 range 4 .. 4; Reserved_5_31 at 0 range 5 .. 31; end record; -- Write '1' to Enable interrupt for READY event type INTENSET_READY_Field is (-- Read: Disabled Disabled, -- Read: Enabled Enabled) with Size => 1; for INTENSET_READY_Field use (Disabled => 0, Enabled => 1); -- Write '1' to Enable interrupt for READY event type INTENSET_READY_Field_1 is (-- Reset value for the field Intenset_Ready_Field_Reset, -- Enable Set) with Size => 1; for INTENSET_READY_Field_1 use (Intenset_Ready_Field_Reset => 0, Set => 1); -- Write '1' to Enable interrupt for DOWN event type INTENSET_DOWN_Field is (-- Read: Disabled Disabled, -- Read: Enabled Enabled) with Size => 1; for INTENSET_DOWN_Field use (Disabled => 0, Enabled => 1); -- Write '1' to Enable interrupt for DOWN event type INTENSET_DOWN_Field_1 is (-- Reset value for the field Intenset_Down_Field_Reset, -- Enable Set) with Size => 1; for INTENSET_DOWN_Field_1 use (Intenset_Down_Field_Reset => 0, Set => 1); -- Write '1' to Enable interrupt for UP event type INTENSET_UP_Field is (-- Read: Disabled Disabled, -- Read: Enabled Enabled) with Size => 1; for INTENSET_UP_Field use (Disabled => 0, Enabled => 1); -- Write '1' to Enable interrupt for UP event type INTENSET_UP_Field_1 is (-- Reset value for the field Intenset_Up_Field_Reset, -- Enable Set) with Size => 1; for INTENSET_UP_Field_1 use (Intenset_Up_Field_Reset => 0, Set => 1); -- Write '1' to Enable interrupt for CROSS event type INTENSET_CROSS_Field is (-- Read: Disabled Disabled, -- Read: Enabled Enabled) with Size => 1; for INTENSET_CROSS_Field use (Disabled => 0, Enabled => 1); -- Write '1' to Enable interrupt for CROSS event type INTENSET_CROSS_Field_1 is (-- Reset value for the field Intenset_Cross_Field_Reset, -- Enable Set) with Size => 1; for INTENSET_CROSS_Field_1 use (Intenset_Cross_Field_Reset => 0, Set => 1); -- Enable interrupt type INTENSET_Register is record -- Write '1' to Enable interrupt for READY event READY : INTENSET_READY_Field_1 := Intenset_Ready_Field_Reset; -- Write '1' to Enable interrupt for DOWN event DOWN : INTENSET_DOWN_Field_1 := Intenset_Down_Field_Reset; -- Write '1' to Enable interrupt for UP event UP : INTENSET_UP_Field_1 := Intenset_Up_Field_Reset; -- Write '1' to Enable interrupt for CROSS event CROSS : INTENSET_CROSS_Field_1 := Intenset_Cross_Field_Reset; -- unspecified Reserved_4_31 : HAL.UInt28 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for INTENSET_Register use record READY at 0 range 0 .. 0; DOWN at 0 range 1 .. 1; UP at 0 range 2 .. 2; CROSS at 0 range 3 .. 3; Reserved_4_31 at 0 range 4 .. 31; end record; -- Write '1' to Disable interrupt for READY event type INTENCLR_READY_Field is (-- Read: Disabled Disabled, -- Read: Enabled Enabled) with Size => 1; for INTENCLR_READY_Field use (Disabled => 0, Enabled => 1); -- Write '1' to Disable interrupt for READY event type INTENCLR_READY_Field_1 is (-- Reset value for the field Intenclr_Ready_Field_Reset, -- Disable Clear) with Size => 1; for INTENCLR_READY_Field_1 use (Intenclr_Ready_Field_Reset => 0, Clear => 1); -- Write '1' to Disable interrupt for DOWN event type INTENCLR_DOWN_Field is (-- Read: Disabled Disabled, -- Read: Enabled Enabled) with Size => 1; for INTENCLR_DOWN_Field use (Disabled => 0, Enabled => 1); -- Write '1' to Disable interrupt for DOWN event type INTENCLR_DOWN_Field_1 is (-- Reset value for the field Intenclr_Down_Field_Reset, -- Disable Clear) with Size => 1; for INTENCLR_DOWN_Field_1 use (Intenclr_Down_Field_Reset => 0, Clear => 1); -- Write '1' to Disable interrupt for UP event type INTENCLR_UP_Field is (-- Read: Disabled Disabled, -- Read: Enabled Enabled) with Size => 1; for INTENCLR_UP_Field use (Disabled => 0, Enabled => 1); -- Write '1' to Disable interrupt for UP event type INTENCLR_UP_Field_1 is (-- Reset value for the field Intenclr_Up_Field_Reset, -- Disable Clear) with Size => 1; for INTENCLR_UP_Field_1 use (Intenclr_Up_Field_Reset => 0, Clear => 1); -- Write '1' to Disable interrupt for CROSS event type INTENCLR_CROSS_Field is (-- Read: Disabled Disabled, -- Read: Enabled Enabled) with Size => 1; for INTENCLR_CROSS_Field use (Disabled => 0, Enabled => 1); -- Write '1' to Disable interrupt for CROSS event type INTENCLR_CROSS_Field_1 is (-- Reset value for the field Intenclr_Cross_Field_Reset, -- Disable Clear) with Size => 1; for INTENCLR_CROSS_Field_1 use (Intenclr_Cross_Field_Reset => 0, Clear => 1); -- Disable interrupt type INTENCLR_Register is record -- Write '1' to Disable interrupt for READY event READY : INTENCLR_READY_Field_1 := Intenclr_Ready_Field_Reset; -- Write '1' to Disable interrupt for DOWN event DOWN : INTENCLR_DOWN_Field_1 := Intenclr_Down_Field_Reset; -- Write '1' to Disable interrupt for UP event UP : INTENCLR_UP_Field_1 := Intenclr_Up_Field_Reset; -- Write '1' to Disable interrupt for CROSS event CROSS : INTENCLR_CROSS_Field_1 := Intenclr_Cross_Field_Reset; -- unspecified Reserved_4_31 : HAL.UInt28 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for INTENCLR_Register use record READY at 0 range 0 .. 0; DOWN at 0 range 1 .. 1; UP at 0 range 2 .. 2; CROSS at 0 range 3 .. 3; Reserved_4_31 at 0 range 4 .. 31; end record; -- Result of last compare. Decision point SAMPLE task. type RESULT_RESULT_Field is (-- Input voltage is below the reference threshold (VIN+ < VIN-). Below, -- Input voltage is above the reference threshold (VIN+ > VIN-). Above) with Size => 1; for RESULT_RESULT_Field use (Below => 0, Above => 1); -- Compare result type RESULT_Register is record -- Read-only. Result of last compare. Decision point SAMPLE task. RESULT : RESULT_RESULT_Field; -- unspecified Reserved_1_31 : HAL.UInt31; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for RESULT_Register use record RESULT at 0 range 0 .. 0; Reserved_1_31 at 0 range 1 .. 31; end record; -- Enable or disable LPCOMP type ENABLE_ENABLE_Field is (-- Disable Disabled, -- Enable Enabled) with Size => 2; for ENABLE_ENABLE_Field use (Disabled => 0, Enabled => 1); -- Enable LPCOMP type ENABLE_Register is record -- Enable or disable LPCOMP ENABLE : ENABLE_ENABLE_Field := NRF_SVD.LPCOMP.Disabled; -- unspecified Reserved_2_31 : HAL.UInt30 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for ENABLE_Register use record ENABLE at 0 range 0 .. 1; Reserved_2_31 at 0 range 2 .. 31; end record; -- Analog pin select type PSEL_PSEL_Field is (-- AIN0 selected as analog input Analoginput0, -- AIN1 selected as analog input Analoginput1, -- AIN2 selected as analog input Analoginput2, -- AIN3 selected as analog input Analoginput3, -- AIN4 selected as analog input Analoginput4, -- AIN5 selected as analog input Analoginput5, -- AIN6 selected as analog input Analoginput6, -- AIN7 selected as analog input Analoginput7) with Size => 3; for PSEL_PSEL_Field use (Analoginput0 => 0, Analoginput1 => 1, Analoginput2 => 2, Analoginput3 => 3, Analoginput4 => 4, Analoginput5 => 5, Analoginput6 => 6, Analoginput7 => 7); -- Input pin select type PSEL_Register is record -- Analog pin select PSEL : PSEL_PSEL_Field := NRF_SVD.LPCOMP.Analoginput0; -- unspecified Reserved_3_31 : HAL.UInt29 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for PSEL_Register use record PSEL at 0 range 0 .. 2; Reserved_3_31 at 0 range 3 .. 31; end record; -- Reference select type REFSEL_REFSEL_Field is (-- VDD * 1/8 selected as reference Ref1_8Vdd, -- VDD * 2/8 selected as reference Ref2_8Vdd, -- VDD * 3/8 selected as reference Ref3_8Vdd, -- VDD * 4/8 selected as reference Ref4_8Vdd, -- VDD * 5/8 selected as reference Ref5_8Vdd, -- VDD * 6/8 selected as reference Ref6_8Vdd, -- VDD * 7/8 selected as reference Ref7_8Vdd, -- External analog reference selected Aref, -- VDD * 1/16 selected as reference Ref1_16Vdd, -- VDD * 3/16 selected as reference Ref3_16Vdd, -- VDD * 5/16 selected as reference Ref5_16Vdd, -- VDD * 7/16 selected as reference Ref7_16Vdd, -- VDD * 9/16 selected as reference Ref9_16Vdd, -- VDD * 11/16 selected as reference Ref11_16Vdd, -- VDD * 13/16 selected as reference Ref13_16Vdd, -- VDD * 15/16 selected as reference Ref15_16Vdd) with Size => 4; for REFSEL_REFSEL_Field use (Ref1_8Vdd => 0, Ref2_8Vdd => 1, Ref3_8Vdd => 2, Ref4_8Vdd => 3, Ref5_8Vdd => 4, Ref6_8Vdd => 5, Ref7_8Vdd => 6, Aref => 7, Ref1_16Vdd => 8, Ref3_16Vdd => 9, Ref5_16Vdd => 10, Ref7_16Vdd => 11, Ref9_16Vdd => 12, Ref11_16Vdd => 13, Ref13_16Vdd => 14, Ref15_16Vdd => 15); -- Reference select type REFSEL_Register is record -- Reference select REFSEL : REFSEL_REFSEL_Field := NRF_SVD.LPCOMP.Ref5_8Vdd; -- unspecified Reserved_4_31 : HAL.UInt28 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for REFSEL_Register use record REFSEL at 0 range 0 .. 3; Reserved_4_31 at 0 range 4 .. 31; end record; -- External analog reference select type EXTREFSEL_EXTREFSEL_Field is (-- Use AIN0 as external analog reference Analogreference0, -- Use AIN1 as external analog reference Analogreference1) with Size => 1; for EXTREFSEL_EXTREFSEL_Field use (Analogreference0 => 0, Analogreference1 => 1); -- External reference select type EXTREFSEL_Register is record -- External analog reference select EXTREFSEL : EXTREFSEL_EXTREFSEL_Field := NRF_SVD.LPCOMP.Analogreference0; -- unspecified Reserved_1_31 : HAL.UInt31 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for EXTREFSEL_Register use record EXTREFSEL at 0 range 0 .. 0; Reserved_1_31 at 0 range 1 .. 31; end record; -- Analog detect configuration type ANADETECT_ANADETECT_Field is (-- Generate ANADETECT on crossing, both upward crossing and downward crossing Cross, -- Generate ANADETECT on upward crossing only Up, -- Generate ANADETECT on downward crossing only Down) with Size => 2; for ANADETECT_ANADETECT_Field use (Cross => 0, Up => 1, Down => 2); -- Analog detect configuration type ANADETECT_Register is record -- Analog detect configuration ANADETECT : ANADETECT_ANADETECT_Field := NRF_SVD.LPCOMP.Cross; -- unspecified Reserved_2_31 : HAL.UInt30 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for ANADETECT_Register use record ANADETECT at 0 range 0 .. 1; Reserved_2_31 at 0 range 2 .. 31; end record; -- Comparator hysteresis enable type HYST_HYST_Field is (-- Comparator hysteresis disabled Nohyst, -- Comparator hysteresis disabled (typ. 50 mV) Hyst50MV) with Size => 1; for HYST_HYST_Field use (Nohyst => 0, Hyst50MV => 1); -- Comparator hysteresis enable type HYST_Register is record -- Comparator hysteresis enable HYST : HYST_HYST_Field := NRF_SVD.LPCOMP.Nohyst; -- unspecified Reserved_1_31 : HAL.UInt31 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for HYST_Register use record HYST at 0 range 0 .. 0; Reserved_1_31 at 0 range 1 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Low Power Comparator type LPCOMP_Peripheral is record -- Start comparator TASKS_START : aliased HAL.UInt32; -- Stop comparator TASKS_STOP : aliased HAL.UInt32; -- Sample comparator value TASKS_SAMPLE : aliased HAL.UInt32; -- LPCOMP is ready and output is valid EVENTS_READY : aliased HAL.UInt32; -- Downward crossing EVENTS_DOWN : aliased HAL.UInt32; -- Upward crossing EVENTS_UP : aliased HAL.UInt32; -- Downward or upward crossing EVENTS_CROSS : aliased HAL.UInt32; -- Shortcut register SHORTS : aliased SHORTS_Register; -- Enable interrupt INTENSET : aliased INTENSET_Register; -- Disable interrupt INTENCLR : aliased INTENCLR_Register; -- Compare result RESULT : aliased RESULT_Register; -- Enable LPCOMP ENABLE : aliased ENABLE_Register; -- Input pin select PSEL : aliased PSEL_Register; -- Reference select REFSEL : aliased REFSEL_Register; -- External reference select EXTREFSEL : aliased EXTREFSEL_Register; -- Analog detect configuration ANADETECT : aliased ANADETECT_Register; -- Comparator hysteresis enable HYST : aliased HYST_Register; end record with Volatile; for LPCOMP_Peripheral use record TASKS_START at 16#0# range 0 .. 31; TASKS_STOP at 16#4# range 0 .. 31; TASKS_SAMPLE at 16#8# range 0 .. 31; EVENTS_READY at 16#100# range 0 .. 31; EVENTS_DOWN at 16#104# range 0 .. 31; EVENTS_UP at 16#108# range 0 .. 31; EVENTS_CROSS at 16#10C# range 0 .. 31; SHORTS at 16#200# range 0 .. 31; INTENSET at 16#304# range 0 .. 31; INTENCLR at 16#308# range 0 .. 31; RESULT at 16#400# range 0 .. 31; ENABLE at 16#500# range 0 .. 31; PSEL at 16#504# range 0 .. 31; REFSEL at 16#508# range 0 .. 31; EXTREFSEL at 16#50C# range 0 .. 31; ANADETECT at 16#520# range 0 .. 31; HYST at 16#538# range 0 .. 31; end record; -- Low Power Comparator LPCOMP_Periph : aliased LPCOMP_Peripheral with Import, Address => LPCOMP_Base; end NRF_SVD.LPCOMP;

30.817778

84

0.625757

58e98eddc0e6700266c92fb9197eb7a4f83317d4

5,158

ads

Ada

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

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

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

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

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

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . A T O M I C _ C O U N T E R S -- -- -- -- S p e c -- -- -- -- Copyright (C) 2011-2021, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- -- -- -- -- -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package provides atomic counter on platforms where it is supported: -- - all Alpha platforms -- - all ia64 platforms -- - all PowerPC platforms -- - all SPARC V9 platforms -- - all x86 platforms -- - all x86_64 platforms package System.Atomic_Counters is pragma Pure; pragma Preelaborate; type Atomic_Counter is limited private; -- Type for atomic counter objects. Note, initial value of the counter is -- one. This allows using an atomic counter as member of record types when -- object of these types are created at library level in preelaborable -- compilation units. -- -- Atomic_Counter is declared as private limited type to provide highest -- level of protection from unexpected use. All available operations are -- declared below, and this set should be as small as possible. -- Increment/Decrement operations for this type raise Program_Error on -- platforms not supporting the atomic primitives. procedure Increment (Item : in out Atomic_Counter); pragma Inline_Always (Increment); -- Increments value of atomic counter. function Decrement (Item : in out Atomic_Counter) return Boolean; pragma Inline_Always (Decrement); -- Decrements value of atomic counter, returns True when value reach zero function Is_One (Item : Atomic_Counter) return Boolean; pragma Inline_Always (Is_One); -- Returns True when value of the atomic counter is one procedure Initialize (Item : out Atomic_Counter); pragma Inline_Always (Initialize); -- Initialize counter by setting its value to one. This subprogram is -- intended to be used in special cases when the counter object cannot be -- initialized in standard way. type Atomic_Unsigned is mod 2 ** 32 with Default_Value => 0, Atomic; -- Modular compatible atomic unsigned type. -- Increment/Decrement operations for this type are atomic only on -- supported platforms. See top of the file. procedure Increment (Item : aliased in out Atomic_Unsigned) with Inline_Always; -- Increments value of atomic counter function Decrement (Item : aliased in out Atomic_Unsigned) return Boolean with Inline_Always; procedure Decrement (Item : aliased in out Atomic_Unsigned) with Inline_Always; -- Decrements value of atomic counter -- The "+" and "-" abstract routine provided below to disable BT := BT + 1 -- constructions. function "+" (Left, Right : Atomic_Unsigned) return Atomic_Unsigned is abstract; function "-" (Left, Right : Atomic_Unsigned) return Atomic_Unsigned is abstract; private type Atomic_Counter is record Value : aliased Atomic_Unsigned := 1; pragma Atomic (Value); end record; end System.Atomic_Counters;

47.759259

79

0.526755

1d4df3a9de92e9791eb034ab6bf608aa10609fda

437

ads

Ada

specs/ada/common/tkmrpc-request-ike-dh_get_shared_secret-convert.ads

DrenfongWong/tkm-rpc

075d22871cf81d497aac656c7f03a513278b641c

[ "BSD-3-Clause" ]

null

specs/ada/common/tkmrpc-request-ike-dh_get_shared_secret-convert.ads

DrenfongWong/tkm-rpc

075d22871cf81d497aac656c7f03a513278b641c

[ "BSD-3-Clause" ]

null

specs/ada/common/tkmrpc-request-ike-dh_get_shared_secret-convert.ads

DrenfongWong/tkm-rpc

075d22871cf81d497aac656c7f03a513278b641c

[ "BSD-3-Clause" ]

null

with Ada.Unchecked_Conversion; package Tkmrpc.Request.Ike.Dh_Get_Shared_Secret.Convert is function To_Request is new Ada.Unchecked_Conversion ( Source => Dh_Get_Shared_Secret.Request_Type, Target => Request.Data_Type); function From_Request is new Ada.Unchecked_Conversion ( Source => Request.Data_Type, Target => Dh_Get_Shared_Secret.Request_Type); end Tkmrpc.Request.Ike.Dh_Get_Shared_Secret.Convert;

31.214286

58

0.775744

3dc6fbbfd6a90c98fa6461ef3e2505530e8ef7f7

1,957

adb

Ada

awa/regtests/awa-mail-modules-tests.adb

Letractively/ada-awa

3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe

[ "Apache-2.0" ]

null

awa/regtests/awa-mail-modules-tests.adb

Letractively/ada-awa

3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe

[ "Apache-2.0" ]

null

awa/regtests/awa-mail-modules-tests.adb

Letractively/ada-awa

3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- awa-mail-module-tests -- Unit tests for Mail module -- Copyright (C) 2012 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Util.Test_Caller; with AWA.Events; package body AWA.Mail.Modules.Tests is package Caller is new Util.Test_Caller (Test, "Mail.Clients"); procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite) is begin Caller.Add_Test (Suite, "Test AWA.Mail.Module.Create_Message", Test_Create_Message'Access); end Add_Tests; -- Create an email message and verify its content. procedure Test_Create_Message (T : in out Test) is use Util.Beans.Objects; Mail : constant AWA.Mail.Modules.Mail_Module_Access := AWA.Mail.Modules.Get_Mail_Module; Event : AWA.Events.Module_Event; Props : Util.Beans.Objects.Maps.Map; begin T.Assert (Mail /= null, "There is no current mail module"); Props.Insert ("name", To_Object (String '("joe"))); Props.Insert ("email", To_Object (String '("[email protected]"))); Mail.Send_Mail (Template => "mail-info.html", Props => Props, Content => Event); end Test_Create_Message; end AWA.Mail.Modules.Tests;

37.634615

95

0.634134

c7388bcc06411f9eb8bae73f9213b1c44f69266c

6,672

ads

Ada

source/nodes/program-nodes-exception_renaming_declarations.ads

optikos/oasis

9f64d46d26d964790d69f9db681c874cfb3bf96d

[ "MIT" ]

null

source/nodes/program-nodes-exception_renaming_declarations.ads

optikos/oasis

9f64d46d26d964790d69f9db681c874cfb3bf96d

[ "MIT" ]

null

source/nodes/program-nodes-exception_renaming_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.Expressions; with Program.Elements.Aspect_Specifications; with Program.Elements.Exception_Renaming_Declarations; with Program.Element_Visitors; package Program.Nodes.Exception_Renaming_Declarations is pragma Preelaborate; type Exception_Renaming_Declaration is new Program.Nodes.Node and Program.Elements.Exception_Renaming_Declarations .Exception_Renaming_Declaration and Program.Elements.Exception_Renaming_Declarations .Exception_Renaming_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; Exception_Token : not null Program.Lexical_Elements .Lexical_Element_Access; Renames_Token : not null Program.Lexical_Elements .Lexical_Element_Access; Renamed_Exception : not null 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 Exception_Renaming_Declaration; type Implicit_Exception_Renaming_Declaration is new Program.Nodes.Node and Program.Elements.Exception_Renaming_Declarations .Exception_Renaming_Declaration with private; function Create (Names : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Vector_Access; Renamed_Exception : not null 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) return Implicit_Exception_Renaming_Declaration with Pre => Is_Part_Of_Implicit or Is_Part_Of_Inherited or Is_Part_Of_Instance; private type Base_Exception_Renaming_Declaration is abstract new Program.Nodes.Node and Program.Elements.Exception_Renaming_Declarations .Exception_Renaming_Declaration with record Names : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Vector_Access; Renamed_Exception : not null Program.Elements.Expressions .Expression_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; end record; procedure Initialize (Self : aliased in out Base_Exception_Renaming_Declaration'Class); overriding procedure Visit (Self : not null access Base_Exception_Renaming_Declaration; Visitor : in out Program.Element_Visitors.Element_Visitor'Class); overriding function Names (Self : Base_Exception_Renaming_Declaration) return not null Program.Elements.Defining_Identifiers .Defining_Identifier_Vector_Access; overriding function Renamed_Exception (Self : Base_Exception_Renaming_Declaration) return not null Program.Elements.Expressions.Expression_Access; overriding function Aspects (Self : Base_Exception_Renaming_Declaration) return Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; overriding function Is_Exception_Renaming_Declaration_Element (Self : Base_Exception_Renaming_Declaration) return Boolean; overriding function Is_Declaration_Element (Self : Base_Exception_Renaming_Declaration) return Boolean; type Exception_Renaming_Declaration is new Base_Exception_Renaming_Declaration and Program.Elements.Exception_Renaming_Declarations .Exception_Renaming_Declaration_Text with record Colon_Token : not null Program.Lexical_Elements .Lexical_Element_Access; Exception_Token : not null Program.Lexical_Elements .Lexical_Element_Access; Renames_Token : not null 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_Exception_Renaming_Declaration_Text (Self : aliased in out Exception_Renaming_Declaration) return Program.Elements.Exception_Renaming_Declarations .Exception_Renaming_Declaration_Text_Access; overriding function Colon_Token (Self : Exception_Renaming_Declaration) return not null Program.Lexical_Elements.Lexical_Element_Access; overriding function Exception_Token (Self : Exception_Renaming_Declaration) return not null Program.Lexical_Elements.Lexical_Element_Access; overriding function Renames_Token (Self : Exception_Renaming_Declaration) return not null Program.Lexical_Elements.Lexical_Element_Access; overriding function With_Token (Self : Exception_Renaming_Declaration) return Program.Lexical_Elements.Lexical_Element_Access; overriding function Semicolon_Token (Self : Exception_Renaming_Declaration) return not null Program.Lexical_Elements.Lexical_Element_Access; type Implicit_Exception_Renaming_Declaration is new Base_Exception_Renaming_Declaration with record Is_Part_Of_Implicit : Boolean; Is_Part_Of_Inherited : Boolean; Is_Part_Of_Instance : Boolean; end record; overriding function To_Exception_Renaming_Declaration_Text (Self : aliased in out Implicit_Exception_Renaming_Declaration) return Program.Elements.Exception_Renaming_Declarations .Exception_Renaming_Declaration_Text_Access; overriding function Is_Part_Of_Implicit (Self : Implicit_Exception_Renaming_Declaration) return Boolean; overriding function Is_Part_Of_Inherited (Self : Implicit_Exception_Renaming_Declaration) return Boolean; overriding function Is_Part_Of_Instance (Self : Implicit_Exception_Renaming_Declaration) return Boolean; end Program.Nodes.Exception_Renaming_Declarations;

38.344828

74

0.752098

22b6b3ccd217c863ba1894c0863dd608bca69bb6

2,903

adb

Ada

src/main.adb

kqr/qweyboard

d4e8b8cac8450d5dbb0ed69e78d8d71dcaec91da

[ "0BSD" ]

33

2017-02-25T22:20:45.000Z

2022-02-18T01:21:58.000Z

src/main.adb

kqr/qweyboard

d4e8b8cac8450d5dbb0ed69e78d8d71dcaec91da

[ "0BSD" ]

1

2017-03-09T08:05:57.000Z

src/main.adb

kqr/qweyboard

d4e8b8cac8450d5dbb0ed69e78d8d71dcaec91da

[ "0BSD" ]

2

2017-03-08T21:32:37.000Z

2020-01-09T21:15:30.000Z

with Unicode_Strings; use Unicode_Strings; with Ada.Command_Line; with Ada.Task_Termination; with Ada.Task_Identification; with Configuration; with Logging; with Qweyboard.Emulation; with Input_Backend; with Output_Backend; procedure Main is use Logging; Settings : Configuration.Settings; begin Ada.Task_Termination.Set_Specific_Handler (Ada.Task_Identification.Current_Task, Logging.Logging_Termination_Handler.Log_Termination_Cause'Access); Ada.Task_Termination.Set_Dependents_Fallback_Handler (Logging.Logging_Termination_Handler.Log_Termination_Cause'Access); Configuration.Get_Settings (Settings); Log.Set_Verbosity (Settings.Log_Level); Log.Chat ("[Main] Got settings and set log verbosity"); Log.Chat ("[Main] Loading language"); Configuration.Load_Language (Settings); -- Then kick off the emulation! --Qweyboard.Emulation.Process.Ready_Wait; Log.Chat ("[Main] Emulation started"); -- Configure softboard --Qweyboard.Emulation.Process.Configure (Settings); Log.Chat ("[Main] Emulation configured"); -- First wait for the output backend to be ready Output_Backend.Output.Ready_Wait; Log.Chat ("[Main] Output backend ready"); -- Then wait for input backend to be ready Input_Backend.Input.Ready_Wait; Log.Chat ("[Main] Input backend ready"); exception when Configuration.ARGUMENTS_ERROR => Log.Error ("Usage: " & W (Ada.Command_Line.Command_Name) & " [OPTION]"); Log.Error (" "); Log.Error ("[OPTION] is any combination of the following options: "); Log.Error (" "); Log.Error (" -l <language file> : Modifies the standard layout with the "); Log.Error (" key mappings indicated in the specified "); Log.Error (" language file. "); Log.Error (" "); Log.Error (" -t <milliseconds> : Set the timeout for what counts as one "); Log.Error (" stroke. If you want 0, NKRO is strongly "); Log.Error (" recommended. Default value is 500, which "); Log.Error (" is probably way too high. "); Log.Error (" "); Log.Error (" -v,-vv,-vvv : Sets the log level of the software. If you "); Log.Error (" want to know what goes on inside, this is "); Log.Error (" where to poke... "); Ada.Command_Line.Set_Exit_Status (1); end Main;

45.359375

91

0.55391

41488aca8e49c3be51c3c3740b2636221ba61259

1,410

ads

Ada

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

charlie5/cBound

741be08197a61ad9c72553e3302f3b669902216d

[ "0BSD" ]

2

2015-11-12T11:16:20.000Z

2021-08-24T22:32:04.000Z

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

charlie5/cBound

741be08197a61ad9c72553e3302f3b669902216d

[ "0BSD" ]

1

2018-06-05T05:19:35.000Z

2021-11-20T01:13:23.000Z

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

charlie5/cBound

741be08197a61ad9c72553e3302f3b669902216d

[ "0BSD" ]

null

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

26.603774

78

0.671631

41f8268f413d6fdc69a6aac590d3ec040d59a387

4,916

ads

Ada

src/natools-s_expressions-lockable.ads

faelys/natools

947c004e6f69ca144942c6af40e102d089223cf8

[ "0BSD" ]

null

src/natools-s_expressions-lockable.ads

faelys/natools

947c004e6f69ca144942c6af40e102d089223cf8

[ "0BSD" ]

null

src/natools-s_expressions-lockable.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.S_Expressions.Lockable provides an interface for Descriptor that -- -- can be locked in the current nesting level, returning End_Of_Input -- -- instead of Close_List of that level. That way the descriptor can -- -- be safely handed to other code fragments without risking scope change. -- -- -- -- A Wrapper type is also provided to add a lockable layer on top of a -- -- basic Descriptor interface, however with the extra overhead of one more -- -- call. -- ------------------------------------------------------------------------------ package Natools.S_Expressions.Lockable is pragma Pure (Lockable); type Lock_Stack is private; pragma Preelaborable_Initialization (Lock_Stack); type Lock_State is private; pragma Preelaborable_Initialization (Lock_State); procedure Push_Level (Stack : in out Lock_Stack; Level : in Natural; State : out Lock_State); -- Insert Level on top of Stack and return current State procedure Pop_Level (Stack : in out Lock_Stack; State : in Lock_State; Allow_Gap : in Boolean := False); -- Remove upper part of Stack, up to and including the entry pointed -- by State. Constraint_Error is raised if State does not point to a -- valid level in the stack, and if Allow_Gap is True and more than -- one item would be removed. function Current_Level (Stack : Lock_Stack) return Natural; -- Return the value on top of the stack function Null_State return Lock_State; -- Return an invalid Lock_State type Descriptor is limited interface and S_Expressions.Descriptor; procedure Lock (Object : in out Descriptor; State : out Lock_State) is abstract; -- Turn Object into a state where it cannot reach below or beyond -- current nesting level at Lock call. procedure Unlock (Object : in out Descriptor; State : in out Lock_State; Finish : in Boolean := True) is abstract; -- Undo the effects of previous Lock call, and unwind Object until the -- end of locked level (unless Finish is False). type Wrapper (Backend : access S_Expressions.Descriptor'Class) is new Descriptor with private; pragma Preelaborable_Initialization (Wrapper); -- Wrapper layer on top of a non-lockable object, albeit with the -- performance penalty of an extra layer. function Current_Event (Object : in Wrapper) return Events.Event; function Current_Atom (Object : in Wrapper) return Atom; function Current_Level (Object : in Wrapper) return Natural; procedure Query_Atom (Object : in Wrapper; Process : not null access procedure (Data : in Atom)); procedure Read_Atom (Object : in Wrapper; Data : out Atom; Length : out Count); procedure Next (Object : in out Wrapper; Event : out Events.Event); procedure Lock (Object : in out Wrapper; State : out Lock_State); procedure Unlock (Object : in out Wrapper; State : in out Lock_State; Finish : in Boolean := True); private type Lock_State is record Level, Depth : Natural := 0; end record; type Lock_Stack is record Level : Natural := 0; Depth : Positive := 1; end record; type Wrapper (Backend : access S_Expressions.Descriptor'Class) is new Descriptor with record Stack : Lock_Stack; Finished : Boolean := False; end record; end Natools.S_Expressions.Lockable;

40.295082

78

0.59581

3de95e941d2fdde506acd7e4bf5393bfb277c6f9

1,311

adb

Ada

courses/fundamentals_of_ada/labs/solar_system/160_genericity_text/answers/main.adb

AdaCore/training_material

6651eb2c53f8c39649b8e0b3c757bc8ff963025a

[ "CC-BY-4.0" ]

15

2020-10-07T08:56:45.000Z

2022-02-08T23:13:22.000Z

courses/fundamentals_of_ada/labs/solar_system/160_genericity_text/answers/main.adb

AdaCore/training_material

6651eb2c53f8c39649b8e0b3c757bc8ff963025a

[ "CC-BY-4.0" ]

20

2020-11-05T14:35:20.000Z

2022-01-13T15:59:33.000Z

courses/fundamentals_of_ada/labs/solar_system/160_genericity_text/answers/main.adb

AdaCore/training_material

6651eb2c53f8c39649b8e0b3c757bc8ff963025a

[ "CC-BY-4.0" ]

6

2020-10-08T15:57:06.000Z

2021-08-31T12:03:08.000Z

with Swaps; use Swaps; with Ada.Text_IO; with Swap_Generics; with Sort_Generics; procedure Main is V1 : Integer := 42; V2 : Integer := 43; F1 : Float := 42.0; F2 : Float := 43.0; procedure Swap_Integer is new Swap_Generics.Swap_Generic (Integer); procedure Swap_Float is new Swap_Generics.Swap_Generic (Float); function To_String(I : Integer) return String is (Integer'Image(I)); type Integer_List is array (Integer range <>) of Integer; T : Integer_List := (2, 7, 1, 9, 40, -1); package Sort_Integers is new Sort_Generics (Element_Type => Integer, List_Type => Integer_List, Compare => Standard."<", To_String => To_String); use Sort_Integers; begin Display_List (T); Sort_Generic (T); Display_List (T); Ada.Text_IO.Put_Line ("V1 :=" & Integer'Image (V1) & " V2 :=" & Integer'Image (V2)); Swap (V1, V2); Swap_Integer (V1, V2); Ada.Text_IO.Put_Line ("V1 :=" & Integer'Image (V1) & " V2 :=" & Integer'Image (V2)); Ada.Text_IO.Put_Line ("F1 :=" & Float'Image (F1) & " F2 :=" & Float'Image (F2)); Swap_Float (F1, F2); Ada.Text_IO.Put_Line ("F1 :=" & Float'Image (F1) & " F2 :=" & Float'Image (F2)); end Main;

27.3125

71

0.578185

3d0ef18c12e6c2224cc595abce162c3b008711a9

11,854

ads

Ada

tools/css-analysis-rules.ads

stcarrez/ada-css

f7c337306094993186c507540701d04a4753b724

[ "Apache-2.0" ]

3

2017-01-03T22:18:22.000Z

2017-01-10T07:58:17.000Z

tools/css-analysis-rules.ads

stcarrez/ada-css

f7c337306094993186c507540701d04a4753b724

[ "Apache-2.0" ]

null

tools/css-analysis-rules.ads

stcarrez/ada-css

f7c337306094993186c507540701d04a4753b724

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- css-analysis-rules -- CSS Analysis Rules -- Copyright (C) 2017, 2018 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Ada.Finalization; with Ada.Containers.Vectors; private with Ada.Containers.Indefinite_Ordered_Maps; with CSS.Core.Errors; with CSS.Core.Values; with CSS.Core.Properties; with CSS.Printer; with CSS.Core.Sheets; -- == Analysis of CSS Rules == -- The <tt>CSS.Analysis.Rules</tt> package defines the rules for the verification of -- value properties. The list of definition is stored in the rule repository. -- Each rule is associated with a name. The rule is represented as a tree whose nodes -- define what is valid for a given property value. package CSS.Analysis.Rules is subtype Location is CSS.Core.Location; type Match_Result; type Rule_Type is limited new Ada.Finalization.Limited_Controlled with private; type Rule_Type_Access is access all Rule_Type'Class; -- Get the source location of the rule definition. function Get_Location (Rule : in Rule_Type) return Location; -- Set the min and max repeat for this rule. procedure Set_Repeat (Rule : in out Rule_Type; Min : in Natural; Max : in Natural; Sep : in Boolean := False); -- Append the <tt>New_Rule</tt> at end of the rule's list. procedure Append (Rule : in out Rule_Type; New_Rule : in Rule_Type_Access); -- Print the rule definition to the print stream. procedure Print (Rule : in Rule_Type; Stream : in out CSS.Printer.File_Type'Class); -- Check if the value matches the rule. function Match (Rule : in Rule_Type; Value : in CSS.Core.Values.Value_Type) return Boolean; -- Check if the value matches the identifier defined by the rule. function Match (Rule : access Rule_Type; Value : in CSS.Core.Values.Value_List; Result : access Match_Result; Pos : in Positive := 1) return Natural; type Match_Info_Type is record First : Natural := 0; Last : Natural := 0; Rule : access Rule_Type'Class; end record; package Match_Info_Vectors is new Ada.Containers.Vectors (Index_Type => Positive, Element_Type => Match_Info_Type); type Match_Result is record List : Match_Info_Vectors.Vector; end record; -- Returns True if the two rules refer to the same rule definition. function Is_Rule (Rule1, Rule2 : access Rule_Type'Class) return Boolean; -- Rule that describes an identifier such as 'left' or 'right'. type Ident_Rule_Type (Len : Natural) is new Rule_Type with private; -- Print the rule definition to the print stream. overriding procedure Print (Rule : in Ident_Rule_Type; Stream : in out CSS.Printer.File_Type'Class); -- Check if the value matches the identifier defined by the rule. overriding function Match (Rule : in Ident_Rule_Type; Value : in CSS.Core.Values.Value_Type) return Boolean; type Repository_Type is limited new Ada.Finalization.Limited_Controlled with private; -- Find a rule that describes a property. -- Returns the rule or null if there is no rule for the property. function Find_Property (Repository : in Repository_Type; Name : in String) return Rule_Type_Access; -- Create a property rule and add it to the repository under the given name. -- The rule is empty and is ready to be defined. procedure Create_Property (Repository : in out Repository_Type; Name : in String; Rule : in Rule_Type_Access); -- Create a rule definition and add it to the repository under the given name. -- The rule definition is used by other rules to represent complex rules. -- The rule is empty and is ready to be defined. procedure Create_Definition (Repository : in out Repository_Type; Name : in String; Rule : in Rule_Type_Access); -- Create a rule that describes an identifier; function Create_Identifier (Name : in String; Loc : in Location) return Rule_Type_Access; -- Create a rule that describes either a definition or a pre-defined type. function Create_Definition (Repository : in out Repository_Type; Name : in String; Loc : in Location) return Rule_Type_Access; type Group_Type is (GROUP_ONLY_ONE, GROUP_DBAR, GROUP_AND, GROUP_SEQ, GROUP_PARAMS); -- Create a rule that describes a group of rules whose head is passed in <tt>Rules</tt>. procedure Append_Group (Into : out Rule_Type_Access; First : in Rule_Type_Access; Second : in Rule_Type_Access; Kind : in Group_Type); -- Create a rule that describes a function call with parameters. function Create_Function (Name : in String; Params : in Rule_Type_Access; Loc : in Location) return Rule_Type_Access; procedure Analyze (Repository : in out Repository_Type; Sheet : in CSS.Core.Sheets.CSSStylesheet; Report : in out CSS.Core.Errors.Error_Handler'Class); -- Search for properties that use the given rule and call the Process procedure -- for each property that uses the rule definition. procedure Search (Repository : in out Repository_Type; Sheet : in CSS.Core.Sheets.CSSStylesheet; Rule : access Rule_Type'Class; Process : access procedure (Prop : in CSS.Core.Properties.CSSProperty; Match : in Match_Result)); -- Print the repository rule definitions to the print stream. procedure Print (Stream : in out CSS.Printer.File_Type'Class; Repository : in Repository_Type); private type Rule_Type_Access_Array is array (Positive range <>) of Rule_Type_Access; type Rule_Type is limited new Ada.Finalization.Limited_Controlled with record Used : Natural := 0; Loc : Location; Next : Rule_Type_Access; Min_Repeat : Natural := 0; Max_Repeat : Natural := 0; Comma_Sep : Boolean := False; end record; overriding procedure Finalize (Rule : in out Rule_Type); type Type_Rule_Type (Len : Natural) is new Rule_Type with record Rule : Rule_Type_Access; end record; -- Check if the value matches the type. overriding function Match (Rule : in Type_Rule_Type; Value : in CSS.Core.Values.Value_Type) return Boolean; type Ident_Rule_Type (Len : Natural) is new Rule_Type with record Ident : String (1 .. Len); end record; type Definition_Rule_Type (Len : Natural) is new Rule_Type with record Ident : String (1 .. Len); Rule : Rule_Type_Access; end record; type Definition_Rule_Type_Access is access all Definition_Rule_Type'Class; -- Print the rule definition to the print stream. overriding procedure Print (Rule : in Definition_Rule_Type; Stream : in out CSS.Printer.File_Type'Class); -- Check if the value matches the rule. overriding function Match (Rule : in Definition_Rule_Type; Value : in CSS.Core.Values.Value_Type) return Boolean; -- Check if the value matches the identifier defined by the rule. overriding function Match (Rule : access Definition_Rule_Type; Value : in CSS.Core.Values.Value_List; Result : access Match_Result; Pos : in Positive := 1) return Natural; type Group_Rule_Type is new Rule_Type with record List : Rule_Type_Access; Count : Natural := 0; Kind : Group_Type; end record; -- Print the rule definition to the print stream. overriding procedure Print (Rule : in Group_Rule_Type; Stream : in out CSS.Printer.File_Type'Class); -- Check if the value matches the rule. overriding function Match (Rule : in Group_Rule_Type; Value : in CSS.Core.Values.Value_Type) return Boolean; -- Check if the value matches the identifier defined by the rule. overriding function Match (Group : access Group_Rule_Type; Value : in CSS.Core.Values.Value_List; Result : access Match_Result; Pos : in Positive := 1) return Natural; overriding procedure Finalize (Rule : in out Group_Rule_Type); type Function_Rule_Type (Len : Natural) is new Group_Rule_Type with record Ident : String (1 .. Len); end record; -- Print the rule definition to the print stream. overriding procedure Print (Rule : in Function_Rule_Type; Stream : in out CSS.Printer.File_Type'Class); -- Check if the value matches the function with its parameters. overriding function Match (Rule : access Function_Rule_Type; Value : in CSS.Core.Values.Value_List; Result : access Match_Result; Pos : in Positive := 1) return Natural; package Rule_Maps is new Ada.Containers.Indefinite_Ordered_Maps (Key_Type => String, Element_Type => Rule_Type_Access, "=" => "=", "<" => "<"); package Rule_Vectors is new Ada.Containers.Vectors (Index_Type => Positive, Element_Type => Definition_Rule_Type_Access); type Repository_Type is limited new Ada.Finalization.Limited_Controlled with record -- The rule names with their definitions. These rules are noted with: <name>. Rules : Rule_Maps.Map; -- The property names which are valid and their associated rule. Properties : Rule_Maps.Map; -- The pre-defined and built-in rules used to represent the basic types (ex: <color>). Types : Rule_Maps.Map; -- The list of definition rules that have not been found and must be -- resolved before doing the analysis. Deferred : Rule_Vectors.Vector; end record; procedure Resolve (Repository : in out Repository_Type); overriding procedure Initialize (Repository : in out Repository_Type); -- Release the rules allocated dynamically. overriding procedure Finalize (Repository : in out Repository_Type); -- Erase all the rules that have been loaded in the repository. procedure Clear (Repository : in out Repository_Type); procedure Clear (Rules : in out Rule_Maps.Map); end CSS.Analysis.Rules;

41.159722

95

0.627214

589877e0ebe3bfb458c9a915d29e26c380bbd3ae

3,197

adb

Ada

src/libraries/Rewriters_Lib/src/placeholder_relations.adb

selroc/Renaissance-Ada

39230b34aced4a9d83831be346ca103136c53715

[ "BSD-3-Clause" ]

1

2022-03-08T13:00:47.000Z

src/libraries/Rewriters_Lib/src/placeholder_relations.adb

selroc/Renaissance-Ada

39230b34aced4a9d83831be346ca103136c53715

[ "BSD-3-Clause" ]

null

src/libraries/Rewriters_Lib/src/placeholder_relations.adb

selroc/Renaissance-Ada

39230b34aced4a9d83831be346ca103136c53715

[ "BSD-3-Clause" ]

null

with Ada.Text_IO; use Ada.Text_IO; with Libadalang.Analysis; use Libadalang.Analysis; with Libadalang.Common; use Libadalang.Common; with Rejuvenation; use Rejuvenation; with Rejuvenation.Finder; use Rejuvenation.Finder; with Rejuvenation.Utils; use Rejuvenation.Utils; package body Placeholder_Relations is function Is_Referenced_In (D_N : Defining_Name; Node : Ada_Node) return Boolean; function Is_Referenced_In (D_N : Defining_Name; Node : Ada_Node) return Boolean is Identifiers : constant Node_List.Vector := Find (Node, Ada_Identifier); begin return (for some Identifier of Identifiers => Identifier.As_Identifier.P_Referenced_Defining_Name = D_N); end Is_Referenced_In; function Is_Referenced_In (Match : Match_Pattern; Definition, Context : String) return Boolean is D_N : constant Defining_Name := Match.Get_Single_As_Node (Definition).As_Defining_Name; Context_Nodes : constant Node_List.Vector := Match.Get_Placeholder_As_Nodes (Context); begin return (for some Context_Node of Context_Nodes => Is_Referenced_In (D_N, Context_Node)); end Is_Referenced_In; function Is_Constant_Expression (E : Expr) return Boolean; function Is_Constant_Expression (E : Expr) return Boolean is begin case E.Kind is when Ada_String_Literal | Ada_Int_Literal | Ada_Real_Literal => return True; when Ada_Identifier => return False; when Ada_Bin_Op => declare B_O : constant Bin_Op := E.As_Bin_Op; begin return Is_Constant_Expression (B_O.F_Left) and then Is_Constant_Expression (B_O.F_Right); end; when Ada_Relation_Op => declare R_O : constant Relation_Op := E.As_Relation_Op; begin return Is_Constant_Expression (R_O.F_Left) and then Is_Constant_Expression (R_O.F_Right); end; when Ada_Paren_Expr => return Is_Constant_Expression (E.As_Paren_Expr.F_Expr); when others => Put_Line ("Is_Constant_Expression: Unhandled kind - " & E.Kind'Image); return False; end case; end Is_Constant_Expression; function Is_Constant_Expression (Match : Match_Pattern; Expression : String) return Boolean is E : constant Expr := Match.Get_Single_As_Node (Expression).As_Expr; begin return Is_Constant_Expression (E); end Is_Constant_Expression; function Is_Within_Base_Subp_Body (Match : Match_Pattern; Subp_Name : String) return Boolean is Nodes : constant Node_List.Vector := Get_Nodes (Match); begin -- Since Nodes are part of a sublist - checking a single node is enough return (for some Parent of Nodes.First_Element.Parents => Parent.Kind in Ada_Base_Subp_Body and then Subp_Name = Raw_Signature (Parent.As_Base_Subp_Body.F_Subp_Spec.F_Subp_Name)); end Is_Within_Base_Subp_Body; end Placeholder_Relations;

35.522222

79

0.659368

3d446e263ed1f82ff7dd1303f866a60e61e645c4

228,604

adb

Ada

vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls/prj/sol/.autopilot/db/cceip_kernel.adb

Wolf-Tungsten/Project-Zipline-FPGA

514e547622d0618fd02c1c7894218204a37d4acd

[ "MIT" ]

null

vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls/prj/sol/.autopilot/db/cceip_kernel.adb

Wolf-Tungsten/Project-Zipline-FPGA

514e547622d0618fd02c1c7894218204a37d4acd

[ "MIT" ]

1

2022-02-07T11:14:38.000Z

2022-02-07T12:01:44.000Z

vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls/prj/sol/.autopilot/db/cceip_kernel.adb

Wolf-Tungsten/Project-Zipline-Alveo-U280

df845d1f6ec5a1e7dcfaabc8b78803a9a4b3a7ed

[ "MIT" ]

null

<?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="15"> <syndb class_id="0" tracking_level="0" version="0"> <userIPLatency>-1</userIPLatency> <userIPName/> <cdfg class_id="1" tracking_level="1" version="0" object_id="_0"> <name>cceip_kernel</name> <ret_bitwidth>0</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>5</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>m00_axi</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/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <direction>2</direction> <if_type>4</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>input_size</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>input_size</originalName> <rtlName/> <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> <item class_id_reference="3" object_id="_3"> <Value> <Obj> <type>1</type> <id>3</id> <name>input_addr</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>input_addr</originalName> <rtlName/> <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> <item class_id_reference="3" object_id="_4"> <Value> <Obj> <type>1</type> <id>4</id> <name>output_size_addr</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>output_size_addr</originalName> <rtlName/> <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> <item class_id_reference="3" object_id="_5"> <Value> <Obj> <type>1</type> <id>5</id> <name>output_addr</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>output_addr</originalName> <rtlName/> <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>42</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_6"> <Value> <Obj> <type>0</type> <id>6</id> <name>input_addr_read</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>input_addr</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>81</item> <item>82</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.00</m_delay> <m_topoIndex>1</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_7"> <Value> <Obj> <type>0</type> <id>7</id> <name>input_addr1</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName>input_addr1_fu_206_p4</rtlName> <coreName/> </Obj> <bitwidth>62</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>84</item> <item>85</item> <item>87</item> <item>89</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>2</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_8"> <Value> <Obj> <type>0</type> <id>8</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName>empty_fu_216_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>90</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>3</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_9"> <Value> <Obj> <type>0</type> <id>9</id> <name>m00_axi_addr</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> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>91</item> <item>92</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>4</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_10"> <Value> <Obj> <type>0</type> <id>13</id> <name>m00_axi_input_buffer</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>46</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="11" tracking_level="0" version="0"> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</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>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>46</second> </item> </second> </item> </inlineStackInfo> <originalName>m00_axi_input_buffer</originalName> <rtlName>m00_axi_input_buffer_U</rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>94</item> </oprand_edges> <opcode>alloca</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>5</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_11"> <Value> <Obj> <type>0</type> <id>14</id> <name>m00_axi_output_buffer</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>47</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>47</second> </item> </second> </item> </inlineStackInfo> <originalName>m00_axi_output_buffer</originalName> <rtlName>m00_axi_output_buffer_U</rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>95</item> </oprand_edges> <opcode>alloca</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>6</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_12"> <Value> <Obj> <type>0</type> <id>22</id> <name>m00_axi_addr_rd_req</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>55</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>55</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>97</item> <item>98</item> <item>100</item> </oprand_edges> <opcode>readreq</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>8.75</m_delay> <m_topoIndex>7</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_13"> <Value> <Obj> <type>0</type> <id>23</id> <name>_ln55</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>55</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>55</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>101</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.60</m_delay> <m_topoIndex>8</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_14"> <Value> <Obj> <type>0</type> <id>25</id> <name>phi_ln55</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>55</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>55</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>103</item> <item>104</item> <item>105</item> <item>106</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>9</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_15"> <Value> <Obj> <type>0</type> <id>26</id> <name>icmp_ln55</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>55</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>55</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>icmp_ln55_fu_226_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>107</item> <item>109</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.64</m_delay> <m_topoIndex>10</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_16"> <Value> <Obj> <type>0</type> <id>28</id> <name>add_ln55</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>55</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>55</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>add_ln55_fu_232_p2</rtlName> <coreName/> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>110</item> <item>112</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.75</m_delay> <m_topoIndex>11</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_17"> <Value> <Obj> <type>0</type> <id>29</id> <name>_ln55</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>55</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>55</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>113</item> <item>114</item> <item>115</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>12</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_18"> <Value> <Obj> <type>0</type> <id>34</id> <name>zext_ln55</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>55</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>55</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>zext_ln55_fu_238_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>117</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>14</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_19"> <Value> <Obj> <type>0</type> <id>35</id> <name>m00_axi_addr_read</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>55</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>55</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>119</item> <item>120</item> <item>404</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>8.75</m_delay> <m_topoIndex>13</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_20"> <Value> <Obj> <type>0</type> <id>36</id> <name>m00_axi_input_buffer_addr</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>55</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>55</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>121</item> <item>123</item> <item>124</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>15</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_21"> <Value> <Obj> <type>0</type> <id>37</id> <name>m00_axi_input_buffer_addr_write_ln55</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>55</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>55</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>125</item> <item>126</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.15</m_delay> <m_topoIndex>16</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_22"> <Value> <Obj> <type>0</type> <id>39</id> <name>_ln55</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>55</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>55</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>127</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>17</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_23"> <Value> <Obj> <type>0</type> <id>41</id> <name>_ln0</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>116</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.60</m_delay> <m_topoIndex>18</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_24"> <Value> <Obj> <type>0</type> <id>43</id> <name>i_0</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>i</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>128</item> <item>129</item> <item>130</item> <item>131</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>19</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_25"> <Value> <Obj> <type>0</type> <id>45</id> <name>icmp_ln58</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>58</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>icmp_ln58_fu_243_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>132</item> <item>133</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.64</m_delay> <m_topoIndex>20</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_26"> <Value> <Obj> <type>0</type> <id>47</id> <name>i</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>58</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName>i</originalName> <rtlName>i_fu_249_p2</rtlName> <coreName/> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>134</item> <item>135</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.75</m_delay> <m_topoIndex>21</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_27"> <Value> <Obj> <type>0</type> <id>48</id> <name>_ln58</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>58</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>58</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> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>22</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_28"> <Value> <Obj> <type>0</type> <id>50</id> <name>zext_ln59</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>zext_ln59_fu_255_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>144</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>23</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_29"> <Value> <Obj> <type>0</type> <id>51</id> <name>m00_axi_input_buffer_addr_1</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>145</item> <item>146</item> <item>147</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>24</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_30"> <Value> <Obj> <type>0</type> <id>52</id> <name>m00_axi_input_buffer_load</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</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>148</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.15</m_delay> <m_topoIndex>25</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_31"> <Value> <Obj> <type>0</type> <id>53</id> <name>add_ln59</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>m00_axi_output_buffer_d0</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>149</item> <item>151</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.88</m_delay> <m_topoIndex>26</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_32"> <Value> <Obj> <type>0</type> <id>54</id> <name>m00_axi_output_buffer_addr</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>13</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> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>27</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_33"> <Value> <Obj> <type>0</type> <id>55</id> <name>m00_axi_output_buffer_addr_write_ln59</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>155</item> <item>156</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.15</m_delay> <m_topoIndex>28</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_34"> <Value> <Obj> <type>0</type> <id>56</id> <name>_ln58</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>58</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>157</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>29</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_35"> <Value> <Obj> <type>0</type> <id>58</id> <name>m00_axi_addr_wr_req</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>140</item> <item>141</item> <item>142</item> <item>405</item> </oprand_edges> <opcode>writereq</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>8.75</m_delay> <m_topoIndex>30</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_36"> <Value> <Obj> <type>0</type> <id>59</id> <name>_ln63</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>143</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.60</m_delay> <m_topoIndex>31</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_37"> <Value> <Obj> <type>0</type> <id>61</id> <name>phi_ln63</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>158</item> <item>159</item> <item>160</item> <item>161</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>32</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_38"> <Value> <Obj> <type>0</type> <id>62</id> <name>icmp_ln63</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>icmp_ln63_fu_267_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>162</item> <item>163</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.64</m_delay> <m_topoIndex>33</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_39"> <Value> <Obj> <type>0</type> <id>64</id> <name>add_ln63</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>add_ln63_fu_273_p2</rtlName> <coreName/> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>164</item> <item>165</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.75</m_delay> <m_topoIndex>34</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_40"> <Value> <Obj> <type>0</type> <id>65</id> <name>_ln63</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>166</item> <item>167</item> <item>168</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>35</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_41"> <Value> <Obj> <type>0</type> <id>70</id> <name>zext_ln63</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>zext_ln63_fu_279_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>169</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>36</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_42"> <Value> <Obj> <type>0</type> <id>71</id> <name>m00_axi_output_buffer_addr_1</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>170</item> <item>171</item> <item>172</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>37</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_43"> <Value> <Obj> <type>0</type> <id>72</id> <name>m00_axi_output_buffer_load</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>63</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>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.15</m_delay> <m_topoIndex>38</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_44"> <Value> <Obj> <type>0</type> <id>73</id> <name>m00_axi_addr_write_ln63</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>6</count> <item_version>0</item_version> <item>175</item> <item>176</item> <item>177</item> <item>179</item> <item>407</item> <item>408</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>8.75</m_delay> <m_topoIndex>39</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_45"> <Value> <Obj> <type>0</type> <id>75</id> <name>_ln63</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>180</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>40</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_46"> <Value> <Obj> <type>0</type> <id>77</id> <name>m00_axi_addr_wr_resp</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>182</item> <item>183</item> <item>406</item> </oprand_edges> <opcode>writeresp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>8.75</m_delay> <m_topoIndex>41</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_47"> <Value> <Obj> <type>0</type> <id>78</id> <name>_ln66</name> <fileName>../cceip_kernel_cmodel.cpp</fileName> <fileDirectory>..</fileDirectory> <lineNumber>66</lineNumber> <contextFuncName>cceip_kernel</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/nvme0n1/gaoruihao/zipline/Project-Zipline-FPGA/vitis-wrapper/cceip_wrapper/vivado_rtl_kernel/cceip_kernel_ex/imports/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../cceip_kernel_cmodel.cpp</first> <second>cceip_kernel</second> </first> <second>66</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> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>42</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> </nodes> <consts class_id="15" tracking_level="0" version="0"> <count>10</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_48"> <Value> <Obj> <type>2</type> <id>86</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>2</content> </item> <item class_id_reference="16" object_id="_49"> <Value> <Obj> <type>2</type> <id>88</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>63</content> </item> <item class_id_reference="16" object_id="_50"> <Value> <Obj> <type>2</type> <id>93</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_51"> <Value> <Obj> <type>2</type> <id>99</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>4096</content> </item> <item class_id_reference="16" object_id="_52"> <Value> <Obj> <type>2</type> <id>102</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>13</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_53"> <Value> <Obj> <type>2</type> <id>108</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>13</bitwidth> </Value> <const_type>0</const_type> <content>4096</content> </item> <item class_id_reference="16" object_id="_54"> <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>13</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_55"> <Value> <Obj> <type>2</type> <id>122</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="_56"> <Value> <Obj> <type>2</type> <id>150</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="_57"> <Value> <Obj> <type>2</type> <id>178</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> </consts> <blocks class_id="17" tracking_level="0" version="0"> <count>10</count> <item_version>0</item_version> <item class_id="18" tracking_level="1" version="0" object_id="_58"> <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>8</count> <item_version>0</item_version> <item>6</item> <item>7</item> <item>8</item> <item>9</item> <item>13</item> <item>14</item> <item>22</item> <item>23</item> </node_objs> </item> <item class_id_reference="18" object_id="_59"> <Obj> <type>3</type> <id>30</id> <name>burst.rd.header</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>25</item> <item>26</item> <item>28</item> <item>29</item> </node_objs> </item> <item class_id_reference="18" object_id="_60"> <Obj> <type>3</type> <id>40</id> <name>burstread.region</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>5</count> <item_version>0</item_version> <item>34</item> <item>35</item> <item>36</item> <item>37</item> <item>39</item> </node_objs> </item> <item class_id_reference="18" object_id="_61"> <Obj> <type>3</type> <id>42</id> <name>burst.rd.end.preheader</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>41</item> </node_objs> </item> <item class_id_reference="18" object_id="_62"> <Obj> <type>3</type> <id>49</id> <name>burst.rd.end</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>43</item> <item>45</item> <item>47</item> <item>48</item> </node_objs> </item> <item class_id_reference="18" object_id="_63"> <Obj> <type>3</type> <id>57</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>7</count> <item_version>0</item_version> <item>50</item> <item>51</item> <item>52</item> <item>53</item> <item>54</item> <item>55</item> <item>56</item> </node_objs> </item> <item class_id_reference="18" object_id="_64"> <Obj> <type>3</type> <id>60</id> <name>burst.wr.header.preheader</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>58</item> <item>59</item> </node_objs> </item> <item class_id_reference="18" object_id="_65"> <Obj> <type>3</type> <id>66</id> <name>burst.wr.header</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>61</item> <item>62</item> <item>64</item> <item>65</item> </node_objs> </item> <item class_id_reference="18" object_id="_66"> <Obj> <type>3</type> <id>76</id> <name>burstwrite.region</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>5</count> <item_version>0</item_version> <item>70</item> <item>71</item> <item>72</item> <item>73</item> <item>75</item> </node_objs> </item> <item class_id_reference="18" object_id="_67"> <Obj> <type>3</type> <id>79</id> <name>memcpy.tail</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>77</item> <item>78</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>97</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_68"> <id>82</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>6</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_69"> <id>85</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>7</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_70"> <id>87</id> <edge_type>1</edge_type> <source_obj>86</source_obj> <sink_obj>7</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_71"> <id>89</id> <edge_type>1</edge_type> <source_obj>88</source_obj> <sink_obj>7</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_72"> <id>90</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>8</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_73"> <id>91</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>9</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_74"> <id>92</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>9</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_75"> <id>94</id> <edge_type>1</edge_type> <source_obj>93</source_obj> <sink_obj>13</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_76"> <id>95</id> <edge_type>1</edge_type> <source_obj>93</source_obj> <sink_obj>14</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_77"> <id>98</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>22</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_78"> <id>100</id> <edge_type>1</edge_type> <source_obj>99</source_obj> <sink_obj>22</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_79"> <id>101</id> <edge_type>2</edge_type> <source_obj>30</source_obj> <sink_obj>23</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_80"> <id>103</id> <edge_type>1</edge_type> <source_obj>102</source_obj> <sink_obj>25</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_81"> <id>104</id> <edge_type>2</edge_type> <source_obj>24</source_obj> <sink_obj>25</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_82"> <id>105</id> <edge_type>1</edge_type> <source_obj>28</source_obj> <sink_obj>25</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_83"> <id>106</id> <edge_type>2</edge_type> <source_obj>40</source_obj> <sink_obj>25</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_84"> <id>107</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>26</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_85"> <id>109</id> <edge_type>1</edge_type> <source_obj>108</source_obj> <sink_obj>26</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_86"> <id>110</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>28</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_87"> <id>112</id> <edge_type>1</edge_type> <source_obj>111</source_obj> <sink_obj>28</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_88"> <id>113</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>29</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_89"> <id>114</id> <edge_type>2</edge_type> <source_obj>40</source_obj> <sink_obj>29</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_90"> <id>115</id> <edge_type>2</edge_type> <source_obj>42</source_obj> <sink_obj>29</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_91"> <id>116</id> <edge_type>2</edge_type> <source_obj>49</source_obj> <sink_obj>41</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_92"> <id>117</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>34</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_93"> <id>120</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>35</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_94"> <id>121</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_95"> <id>123</id> <edge_type>1</edge_type> <source_obj>122</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_96"> <id>124</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_97"> <id>125</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>37</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_98"> <id>126</id> <edge_type>1</edge_type> <source_obj>36</source_obj> <sink_obj>37</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_99"> <id>127</id> <edge_type>2</edge_type> <source_obj>30</source_obj> <sink_obj>39</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_100"> <id>128</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>43</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_101"> <id>129</id> <edge_type>2</edge_type> <source_obj>57</source_obj> <sink_obj>43</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_102"> <id>130</id> <edge_type>1</edge_type> <source_obj>102</source_obj> <sink_obj>43</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_103"> <id>131</id> <edge_type>2</edge_type> <source_obj>42</source_obj> <sink_obj>43</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_104"> <id>132</id> <edge_type>1</edge_type> <source_obj>43</source_obj> <sink_obj>45</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_105"> <id>133</id> <edge_type>1</edge_type> <source_obj>108</source_obj> <sink_obj>45</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_106"> <id>134</id> <edge_type>1</edge_type> <source_obj>43</source_obj> <sink_obj>47</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_107"> <id>135</id> <edge_type>1</edge_type> <source_obj>111</source_obj> <sink_obj>47</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_108"> <id>136</id> <edge_type>1</edge_type> <source_obj>45</source_obj> <sink_obj>48</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_109"> <id>137</id> <edge_type>2</edge_type> <source_obj>57</source_obj> <sink_obj>48</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_110"> <id>138</id> <edge_type>2</edge_type> <source_obj>60</source_obj> <sink_obj>48</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_111"> <id>141</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>58</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_112"> <id>142</id> <edge_type>1</edge_type> <source_obj>99</source_obj> <sink_obj>58</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_113"> <id>143</id> <edge_type>2</edge_type> <source_obj>66</source_obj> <sink_obj>59</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_114"> <id>144</id> <edge_type>1</edge_type> <source_obj>43</source_obj> <sink_obj>50</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_115"> <id>145</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>51</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_116"> <id>146</id> <edge_type>1</edge_type> <source_obj>122</source_obj> <sink_obj>51</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_117"> <id>147</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>51</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_118"> <id>148</id> <edge_type>1</edge_type> <source_obj>51</source_obj> <sink_obj>52</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_119"> <id>149</id> <edge_type>1</edge_type> <source_obj>52</source_obj> <sink_obj>53</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_120"> <id>151</id> <edge_type>1</edge_type> <source_obj>150</source_obj> <sink_obj>53</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_121"> <id>152</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>54</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_122"> <id>153</id> <edge_type>1</edge_type> <source_obj>122</source_obj> <sink_obj>54</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_123"> <id>154</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>54</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_124"> <id>155</id> <edge_type>1</edge_type> <source_obj>53</source_obj> <sink_obj>55</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_125"> <id>156</id> <edge_type>1</edge_type> <source_obj>54</source_obj> <sink_obj>55</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_126"> <id>157</id> <edge_type>2</edge_type> <source_obj>49</source_obj> <sink_obj>56</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_127"> <id>158</id> <edge_type>1</edge_type> <source_obj>64</source_obj> <sink_obj>61</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_128"> <id>159</id> <edge_type>2</edge_type> <source_obj>76</source_obj> <sink_obj>61</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_129"> <id>160</id> <edge_type>1</edge_type> <source_obj>102</source_obj> <sink_obj>61</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_130"> <id>161</id> <edge_type>2</edge_type> <source_obj>60</source_obj> <sink_obj>61</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_131"> <id>162</id> <edge_type>1</edge_type> <source_obj>61</source_obj> <sink_obj>62</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_132"> <id>163</id> <edge_type>1</edge_type> <source_obj>108</source_obj> <sink_obj>62</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_133"> <id>164</id> <edge_type>1</edge_type> <source_obj>61</source_obj> <sink_obj>64</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_134"> <id>165</id> <edge_type>1</edge_type> <source_obj>111</source_obj> <sink_obj>64</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_135"> <id>166</id> <edge_type>1</edge_type> <source_obj>62</source_obj> <sink_obj>65</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_136"> <id>167</id> <edge_type>2</edge_type> <source_obj>76</source_obj> <sink_obj>65</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_137"> <id>168</id> <edge_type>2</edge_type> <source_obj>79</source_obj> <sink_obj>65</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_138"> <id>169</id> <edge_type>1</edge_type> <source_obj>61</source_obj> <sink_obj>70</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_139"> <id>170</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>71</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_140"> <id>171</id> <edge_type>1</edge_type> <source_obj>122</source_obj> <sink_obj>71</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_141"> <id>172</id> <edge_type>1</edge_type> <source_obj>70</source_obj> <sink_obj>71</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_142"> <id>173</id> <edge_type>1</edge_type> <source_obj>71</source_obj> <sink_obj>72</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_143"> <id>176</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>73</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_144"> <id>177</id> <edge_type>1</edge_type> <source_obj>72</source_obj> <sink_obj>73</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_145"> <id>179</id> <edge_type>1</edge_type> <source_obj>178</source_obj> <sink_obj>73</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_146"> <id>180</id> <edge_type>2</edge_type> <source_obj>66</source_obj> <sink_obj>75</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_147"> <id>183</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>77</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_148"> <id>392</id> <edge_type>2</edge_type> <source_obj>24</source_obj> <sink_obj>30</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_149"> <id>393</id> <edge_type>2</edge_type> <source_obj>30</source_obj> <sink_obj>42</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_150"> <id>394</id> <edge_type>2</edge_type> <source_obj>30</source_obj> <sink_obj>40</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_151"> <id>395</id> <edge_type>2</edge_type> <source_obj>40</source_obj> <sink_obj>30</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_152"> <id>396</id> <edge_type>2</edge_type> <source_obj>42</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_153"> <id>397</id> <edge_type>2</edge_type> <source_obj>49</source_obj> <sink_obj>60</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_154"> <id>398</id> <edge_type>2</edge_type> <source_obj>49</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_155"> <id>399</id> <edge_type>2</edge_type> <source_obj>57</source_obj> <sink_obj>49</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_156"> <id>400</id> <edge_type>2</edge_type> <source_obj>60</source_obj> <sink_obj>66</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_157"> <id>401</id> <edge_type>2</edge_type> <source_obj>66</source_obj> <sink_obj>79</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_158"> <id>402</id> <edge_type>2</edge_type> <source_obj>66</source_obj> <sink_obj>76</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_159"> <id>403</id> <edge_type>2</edge_type> <source_obj>76</source_obj> <sink_obj>66</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_160"> <id>404</id> <edge_type>4</edge_type> <source_obj>22</source_obj> <sink_obj>35</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_161"> <id>405</id> <edge_type>4</edge_type> <source_obj>22</source_obj> <sink_obj>58</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_162"> <id>406</id> <edge_type>4</edge_type> <source_obj>22</source_obj> <sink_obj>77</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_163"> <id>407</id> <edge_type>4</edge_type> <source_obj>22</source_obj> <sink_obj>73</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_164"> <id>408</id> <edge_type>4</edge_type> <source_obj>58</source_obj> <sink_obj>73</sink_obj> <is_back_edge>0</is_back_edge> </item> </edges> </cdfg> <cdfg_regions class_id="21" tracking_level="0" version="0"> <count>8</count> <item_version>0</item_version> <item class_id="22" tracking_level="1" version="0" object_id="_165"> <mId>1</mId> <mTag>cceip_kernel</mTag> <mType>0</mType> <sub_regions> <count>7</count> <item_version>0</item_version> <item>2</item> <item>3</item> <item>4</item> <item>5</item> <item>6</item> <item>7</item> <item>8</item> </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>12307</mMinLatency> <mMaxLatency>12307</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> <item class_id_reference="22" object_id="_166"> <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>24</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>7</mMinLatency> <mMaxLatency>7</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> <item class_id_reference="22" object_id="_167"> <mId>3</mId> <mTag>memcpy.m00_axi_input_buffer.input_addr</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>30</item> <item>40</item> </basic_blocks> <mII>1</mII> <mDepth>3</mDepth> <mMinTripCount>4096</mMinTripCount> <mMaxTripCount>4096</mMaxTripCount> <mMinLatency>4097</mMinLatency> <mMaxLatency>4097</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> <item class_id_reference="22" object_id="_168"> <mId>4</mId> <mTag>Region 1</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>1</count> <item_version>0</item_version> <item>42</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>0</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> <item class_id_reference="22" object_id="_169"> <mId>5</mId> <mTag>Loop 2</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>49</item> <item>57</item> </basic_blocks> <mII>1</mII> <mDepth>2</mDepth> <mMinTripCount>4096</mMinTripCount> <mMaxTripCount>4096</mMaxTripCount> <mMinLatency>4096</mMinLatency> <mMaxLatency>4096</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> <item class_id_reference="22" object_id="_170"> <mId>6</mId> <mTag>Region 2</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>1</count> <item_version>0</item_version> <item>60</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>0</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> <item class_id_reference="22" object_id="_171"> <mId>7</mId> <mTag>memcpy.input_addr.m00_axi_output_buffer.gep</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>66</item> <item>76</item> </basic_blocks> <mII>1</mII> <mDepth>3</mDepth> <mMinTripCount>4096</mMinTripCount> <mMaxTripCount>4096</mMaxTripCount> <mMinLatency>4097</mMinLatency> <mMaxLatency>4097</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> <item class_id_reference="22" object_id="_172"> <mId>8</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>79</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>4</mMinLatency> <mMaxLatency>4</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> </cdfg_regions> <fsm class_id="24" tracking_level="1" version="0" object_id="_173"> <states class_id="25" tracking_level="0" version="0"> <count>23</count> <item_version>0</item_version> <item class_id="26" tracking_level="1" version="0" object_id="_174"> <id>1</id> <operations class_id="27" tracking_level="0" version="0"> <count>6</count> <item_version>0</item_version> <item class_id="28" tracking_level="1" version="0" object_id="_175"> <id>6</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_176"> <id>7</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_177"> <id>8</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_178"> <id>9</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_179"> <id>13</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_180"> <id>14</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_181"> <id>2</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_182"> <id>22</id> <stage>7</stage> <latency>7</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_183"> <id>3</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_184"> <id>22</id> <stage>6</stage> <latency>7</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_185"> <id>4</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_186"> <id>22</id> <stage>5</stage> <latency>7</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_187"> <id>5</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_188"> <id>22</id> <stage>4</stage> <latency>7</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_189"> <id>6</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_190"> <id>22</id> <stage>3</stage> <latency>7</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_191"> <id>7</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_192"> <id>22</id> <stage>2</stage> <latency>7</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_193"> <id>8</id> <operations> <count>12</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_194"> <id>10</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_195"> <id>11</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_196"> <id>12</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_197"> <id>15</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_198"> <id>16</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_199"> <id>17</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_200"> <id>18</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_201"> <id>19</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_202"> <id>20</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_203"> <id>21</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_204"> <id>22</id> <stage>1</stage> <latency>7</latency> </item> <item class_id_reference="28" object_id="_205"> <id>23</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_206"> <id>9</id> <operations> <count>5</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_207"> <id>25</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_208"> <id>26</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_209"> <id>27</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_210"> <id>28</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_211"> <id>29</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_212"> <id>10</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_213"> <id>35</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_214"> <id>11</id> <operations> <count>8</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_215"> <id>31</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_216"> <id>32</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_217"> <id>33</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_218"> <id>34</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_219"> <id>36</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_220"> <id>37</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_221"> <id>38</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_222"> <id>39</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_223"> <id>12</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_224"> <id>41</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_225"> <id>13</id> <operations> <count>9</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_226"> <id>43</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_227"> <id>44</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_228"> <id>45</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_229"> <id>46</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_230"> <id>47</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_231"> <id>48</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_232"> <id>50</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_233"> <id>51</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_234"> <id>52</id> <stage>2</stage> <latency>2</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_235"> <id>14</id> <operations> <count>5</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_236"> <id>52</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_237"> <id>53</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_238"> <id>54</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_239"> <id>55</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_240"> <id>56</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_241"> <id>15</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_242"> <id>58</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_243"> <id>59</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_244"> <id>16</id> <operations> <count>8</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_245"> <id>61</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_246"> <id>62</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_247"> <id>63</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_248"> <id>64</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_249"> <id>65</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_250"> <id>70</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_251"> <id>71</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_252"> <id>72</id> <stage>2</stage> <latency>2</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_253"> <id>17</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_254"> <id>72</id> <stage>1</stage> <latency>2</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_255"> <id>18</id> <operations> <count>6</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_256"> <id>67</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_257"> <id>68</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_258"> <id>69</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_259"> <id>73</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_260"> <id>74</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_261"> <id>75</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_262"> <id>19</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_263"> <id>77</id> <stage>5</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_264"> <id>20</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_265"> <id>77</id> <stage>4</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_266"> <id>21</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_267"> <id>77</id> <stage>3</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_268"> <id>22</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_269"> <id>77</id> <stage>2</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_270"> <id>23</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_271"> <id>77</id> <stage>1</stage> <latency>5</latency> </item> <item class_id_reference="28" object_id="_272"> <id>78</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> </states> <transitions class_id="29" tracking_level="0" version="0"> <count>25</count> <item_version>0</item_version> <item class_id="30" tracking_level="1" version="0" object_id="_273"> <inState>1</inState> <outState>2</outState> <condition class_id="31" tracking_level="0" version="0"> <id>-1</id> <sop class_id="32" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="33" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_274"> <inState>2</inState> <outState>3</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_275"> <inState>3</inState> <outState>4</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_276"> <inState>4</inState> <outState>5</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_277"> <inState>5</inState> <outState>6</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_278"> <inState>6</inState> <outState>7</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_279"> <inState>7</inState> <outState>8</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_280"> <inState>8</inState> <outState>9</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_281"> <inState>12</inState> <outState>13</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_282"> <inState>15</inState> <outState>16</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_283"> <inState>19</inState> <outState>20</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_284"> <inState>20</inState> <outState>21</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_285"> <inState>21</inState> <outState>22</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_286"> <inState>22</inState> <outState>23</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_287"> <inState>10</inState> <outState>11</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_288"> <inState>11</inState> <outState>9</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_289"> <inState>9</inState> <outState>12</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item class_id="34" tracking_level="0" version="0"> <first class_id="35" tracking_level="0" version="0"> <first>26</first> <second>0</second> </first> <second>0</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_290"> <inState>9</inState> <outState>10</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>26</first> <second>0</second> </first> <second>1</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_291"> <inState>14</inState> <outState>13</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_292"> <inState>13</inState> <outState>15</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>45</first> <second>0</second> </first> <second>0</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_293"> <inState>13</inState> <outState>14</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>45</first> <second>0</second> </first> <second>1</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_294"> <inState>17</inState> <outState>18</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_295"> <inState>18</inState> <outState>16</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_296"> <inState>16</inState> <outState>19</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>62</first> <second>0</second> </first> <second>0</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_297"> <inState>16</inState> <outState>17</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>62</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="_298"> <dp_component_resource class_id="37" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="38" tracking_level="0" version="0"> <first>cceip_kernel_control_s_axi_U (cceip_kernel_control_s_axi)</first> <second class_id="39" tracking_level="0" version="0"> <count>3</count> <item_version>0</item_version> <item class_id="40" tracking_level="0" version="0"> <first>BRAM</first> <second>0</second> </item> <item> <first>FF</first> <second>316</second> </item> <item> <first>LUT</first> <second>552</second> </item> </second> </item> <item> <first>cceip_kernel_m00_axi_m_axi_U (cceip_kernel_m00_axi_m_axi)</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>BRAM</first> <second>2</second> </item> <item> <first>FF</first> <second>512</second> </item> <item> <first>LUT</first> <second>580</second> </item> </second> </item> </dp_component_resource> <dp_expression_resource> <count>17</count> <item_version>0</item_version> <item> <first>add_ln55_fu_232_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>13</second> </item> <item> <first>(1P1)</first> <second>1</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>20</second> </item> </second> </item> <item> <first>add_ln63_fu_273_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>13</second> </item> <item> <first>(1P1)</first> <second>1</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>20</second> </item> </second> </item> <item> <first>ap_block_pp0_stage0_11001 ( 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>2</second> </item> </second> </item> <item> <first>ap_block_pp2_stage0_11001 ( 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>2</second> </item> </second> </item> <item> <first>ap_block_state10_pp0_stage0_iter1 ( 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>2</second> </item> </second> </item> <item> <first>ap_block_state18_io ( 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>2</second> </item> </second> </item> <item> <first>ap_enable_pp0 ( 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>ap_enable_pp1 ( 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>ap_enable_pp2 ( 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>ap_enable_reg_pp0_iter1 ( xor ) </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>2</second> </item> </second> </item> <item> <first>ap_enable_reg_pp1_iter1 ( xor ) </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>2</second> </item> </second> </item> <item> <first>ap_enable_reg_pp2_iter1 ( xor ) </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>2</second> </item> </second> </item> <item> <first>i_fu_249_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>13</second> </item> <item> <first>(1P1)</first> <second>1</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>20</second> </item> </second> </item> <item> <first>icmp_ln55_fu_226_p2 ( icmp ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>13</second> </item> <item> <first>(1P1)</first> <second>14</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>13</second> </item> </second> </item> <item> <first>icmp_ln58_fu_243_p2 ( icmp ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>13</second> </item> <item> <first>(1P1)</first> <second>14</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>13</second> </item> </second> </item> <item> <first>icmp_ln63_fu_267_p2 ( icmp ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>13</second> </item> <item> <first>(1P1)</first> <second>14</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>13</second> </item> </second> </item> <item> <first>m00_axi_output_buffer_d0 ( + ) </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>39</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>m00_axi_input_buffer_U</first> <second> <count>8</count> <item_version>0</item_version> <item> <first>(0Words)</first> <second>8192</second> </item> <item> <first>(1Bits)</first> <second>32</second> </item> <item> <first>(2Banks)</first> <second>1</second> </item> <item> <first>(3W*Bits*Banks)</first> <second>262144</second> </item> <item> <first>BRAM</first> <second>15</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>0</second> </item> <item> <first>URAM</first> <second>0</second> </item> </second> </item> <item> <first>m00_axi_output_buffer_U</first> <second> <count>8</count> <item_version>0</item_version> <item> <first>(0Words)</first> <second>8192</second> </item> <item> <first>(1Bits)</first> <second>32</second> </item> <item> <first>(2Banks)</first> <second>1</second> </item> <item> <first>(3W*Bits*Banks)</first> <second>262144</second> </item> <item> <first>BRAM</first> <second>15</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>0</second> </item> <item> <first>URAM</first> <second>0</second> </item> </second> </item> </dp_memory_resource> <dp_multiplexer_resource> <count>17</count> <item_version>0</item_version> <item> <first>ap_NS_fsm</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>19</second> </item> <item> <first>(1Bits)</first> <second>1</second> </item> <item> <first>(2Count)</first> <second>19</second> </item> <item> <first>LUT</first> <second>93</second> </item> </second> </item> <item> <first>ap_enable_reg_pp0_iter1</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>1</second> </item> <item> <first>(2Count)</first> <second>2</second> </item> <item> <first>LUT</first> <second>9</second> </item> </second> </item> <item> <first>ap_enable_reg_pp0_iter2</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>1</second> </item> <item> <first>(2Count)</first> <second>2</second> </item> <item> <first>LUT</first> <second>9</second> </item> </second> </item> <item> <first>ap_enable_reg_pp1_iter1</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>15</second> </item> </second> </item> <item> <first>ap_enable_reg_pp2_iter1</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>1</second> </item> <item> <first>(2Count)</first> <second>2</second> </item> <item> <first>LUT</first> <second>9</second> </item> </second> </item> <item> <first>ap_enable_reg_pp2_iter2</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>1</second> </item> <item> <first>(2Count)</first> <second>2</second> </item> <item> <first>LUT</first> <second>9</second> </item> </second> </item> <item> <first>ap_phi_mux_phi_ln55_phi_fu_176_p4</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>13</second> </item> <item> <first>(2Count)</first> <second>26</second> </item> <item> <first>LUT</first> <second>9</second> </item> </second> </item> <item> <first>i_0_reg_184</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>13</second> </item> <item> <first>(2Count)</first> <second>26</second> </item> <item> <first>LUT</first> <second>9</second> </item> </second> </item> <item> <first>m00_axi_blk_n_AR</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>1</second> </item> <item> <first>(2Count)</first> <second>2</second> </item> <item> <first>LUT</first> <second>9</second> </item> </second> </item> <item> <first>m00_axi_blk_n_AW</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>1</second> </item> <item> <first>(2Count)</first> <second>2</second> </item> <item> <first>LUT</first> <second>9</second> </item> </second> </item> <item> <first>m00_axi_blk_n_B</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>1</second> </item> <item> <first>(2Count)</first> <second>2</second> </item> <item> <first>LUT</first> <second>9</second> </item> </second> </item> <item> <first>m00_axi_blk_n_R</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>1</second> </item> <item> <first>(2Count)</first> <second>2</second> </item> <item> <first>LUT</first> <second>9</second> </item> </second> </item> <item> <first>m00_axi_blk_n_W</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>1</second> </item> <item> <first>(2Count)</first> <second>2</second> </item> <item> <first>LUT</first> <second>9</second> </item> </second> </item> <item> <first>m00_axi_input_buffer_address0</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>13</second> </item> <item> <first>(2Count)</first> <second>39</second> </item> <item> <first>LUT</first> <second>15</second> </item> </second> </item> <item> <first>m00_axi_output_buffer_address0</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>3</second> </item> <item> <first>(1Bits)</first> <second>13</second> </item> <item> <first>(2Count)</first> <second>39</second> </item> <item> <first>LUT</first> <second>15</second> </item> </second> </item> <item> <first>phi_ln55_reg_172</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>13</second> </item> <item> <first>(2Count)</first> <second>26</second> </item> <item> <first>LUT</first> <second>9</second> </item> </second> </item> <item> <first>phi_ln63_reg_195</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>13</second> </item> <item> <first>(2Count)</first> <second>26</second> </item> <item> <first>LUT</first> <second>9</second> </item> </second> </item> </dp_multiplexer_resource> <dp_register_resource> <count>26</count> <item_version>0</item_version> <item> <first>add_ln55_reg_295</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>13</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>13</second> </item> </second> </item> <item> <first>ap_CS_fsm</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>ap_enable_reg_pp0_iter0</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_enable_reg_pp0_iter1</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_enable_reg_pp0_iter2</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_enable_reg_pp1_iter0</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_enable_reg_pp1_iter1</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_enable_reg_pp2_iter0</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_enable_reg_pp2_iter1</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_enable_reg_pp2_iter2</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_rst_n_inv</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_rst_reg_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>ap_rst_reg_2</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>1</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>1</second> </item> </second> </item> <item> <first>i_0_reg_184</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>13</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>13</second> </item> </second> </item> <item> <first>icmp_ln55_reg_291</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>icmp_ln55_reg_291_pp0_iter1_reg</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>icmp_ln58_reg_305</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>icmp_ln63_reg_324</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>icmp_ln63_reg_324_pp2_iter1_reg</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>m00_axi_addr_read_reg_300</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>m00_axi_addr_reg_284</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>64</second> </item> <item> <first>(Consts)</first> <second>2</second> </item> <item> <first>FF</first> <second>62</second> </item> </second> </item> <item> <first>m00_axi_output_buffer_load_reg_338</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>phi_ln55_reg_172</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>13</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>13</second> </item> </second> </item> <item> <first>phi_ln55_reg_172_pp0_iter1_reg</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>13</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>13</second> </item> </second> </item> <item> <first>phi_ln63_reg_195</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>13</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>13</second> </item> </second> </item> <item> <first>zext_ln59_reg_314</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>64</second> </item> <item> <first>(Consts)</first> <second>51</second> </item> <item> <first>FF</first> <second>13</second> </item> </second> </item> </dp_register_resource> <dp_dsp_resource> <count>2</count> <item_version>0</item_version> <item> <first>cceip_kernel_control_s_axi_U</first> <second> <count>0</count> <item_version>0</item_version> </second> </item> <item> <first>cceip_kernel_m00_axi_m_axi_U</first> <second> <count>0</count> <item_version>0</item_version> </second> </item> </dp_dsp_resource> <dp_component_map class_id="41" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_component_map> <dp_expression_map> <count>7</count> <item_version>0</item_version> <item class_id="42" tracking_level="0" version="0"> <first>add_ln55_fu_232_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>add_ln63_fu_273_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> <item> <first>i_fu_249_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>icmp_ln55_fu_226_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>icmp_ln58_fu_243_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>icmp_ln63_fu_267_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>m00_axi_output_buffer_d0 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>53</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>m00_axi_input_buffer_U</first> <second> <count>1</count> <item_version>0</item_version> <item>399</item> </second> </item> <item> <first>m00_axi_output_buffer_U</first> <second> <count>1</count> <item_version>0</item_version> <item>408</item> </second> </item> </dp_memory_map> </res> <node_label_latency class_id="43" tracking_level="0" version="0"> <count>42</count> <item_version>0</item_version> <item class_id="44" tracking_level="0" version="0"> <first>6</first> <second class_id="45" tracking_level="0" version="0"> <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>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>22</first> <second> <first>1</first> <second>6</second> </second> </item> <item> <first>23</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>25</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>26</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>28</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>29</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>34</first> <second> <first>10</first> <second>0</second> </second> </item> <item> <first>35</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>36</first> <second> <first>10</first> <second>0</second> </second> </item> <item> <first>37</first> <second> <first>10</first> <second>0</second> </second> </item> <item> <first>39</first> <second> <first>10</first> <second>0</second> </second> </item> <item> <first>41</first> <second> <first>11</first> <second>0</second> </second> </item> <item> <first>43</first> <second> <first>12</first> <second>0</second> </second> </item> <item> <first>45</first> <second> <first>12</first> <second>0</second> </second> </item> <item> <first>47</first> <second> <first>12</first> <second>0</second> </second> </item> <item> <first>48</first> <second> <first>12</first> <second>0</second> </second> </item> <item> <first>50</first> <second> <first>12</first> <second>0</second> </second> </item> <item> <first>51</first> <second> <first>12</first> <second>0</second> </second> </item> <item> <first>52</first> <second> <first>12</first> <second>1</second> </second> </item> <item> <first>53</first> <second> <first>13</first> <second>0</second> </second> </item> <item> <first>54</first> <second> <first>13</first> <second>0</second> </second> </item> <item> <first>55</first> <second> <first>13</first> <second>0</second> </second> </item> <item> <first>56</first> <second> <first>13</first> <second>0</second> </second> </item> <item> <first>58</first> <second> <first>14</first> <second>0</second> </second> </item> <item> <first>59</first> <second> <first>14</first> <second>0</second> </second> </item> <item> <first>61</first> <second> <first>15</first> <second>0</second> </second> </item> <item> <first>62</first> <second> <first>15</first> <second>0</second> </second> </item> <item> <first>64</first> <second> <first>15</first> <second>0</second> </second> </item> <item> <first>65</first> <second> <first>15</first> <second>0</second> </second> </item> <item> <first>70</first> <second> <first>15</first> <second>0</second> </second> </item> <item> <first>71</first> <second> <first>15</first> <second>0</second> </second> </item> <item> <first>72</first> <second> <first>15</first> <second>1</second> </second> </item> <item> <first>73</first> <second> <first>17</first> <second>0</second> </second> </item> <item> <first>75</first> <second> <first>17</first> <second>0</second> </second> </item> <item> <first>77</first> <second> <first>18</first> <second>4</second> </second> </item> <item> <first>78</first> <second> <first>22</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="46" tracking_level="0" version="0"> <count>10</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>7</second> </second> </item> <item> <first>30</first> <second> <first>8</first> <second>8</second> </second> </item> <item> <first>40</first> <second> <first>9</first> <second>10</second> </second> </item> <item> <first>42</first> <second> <first>9</first> <second>9</second> </second> </item> <item> <first>49</first> <second> <first>10</first> <second>10</second> </second> </item> <item> <first>57</first> <second> <first>10</first> <second>11</second> </second> </item> <item> <first>60</first> <second> <first>11</first> <second>11</second> </second> </item> <item> <first>66</first> <second> <first>12</first> <second>12</second> </second> </item> <item> <first>76</first> <second> <first>12</first> <second>14</second> </second> </item> <item> <first>79</first> <second> <first>13</first> <second>17</second> </second> </item> </bblk_ent_exit> <regions class_id="49" tracking_level="0" version="0"> <count>3</count> <item_version>0</item_version> <item class_id="50" tracking_level="1" version="0" object_id="_299"> <region_name>memcpy.m00_axi_input_buffer.input_addr</region_name> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>30</item> <item>40</item> </basic_blocks> <nodes> <count>0</count> <item_version>0</item_version> </nodes> <anchor_node>-1</anchor_node> <region_type>8</region_type> <interval>1</interval> <pipe_depth>3</pipe_depth> </item> <item class_id_reference="50" object_id="_300"> <region_name>Loop 2</region_name> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>49</item> <item>57</item> </basic_blocks> <nodes> <count>0</count> <item_version>0</item_version> </nodes> <anchor_node>-1</anchor_node> <region_type>8</region_type> <interval>1</interval> <pipe_depth>2</pipe_depth> </item> <item class_id_reference="50" object_id="_301"> <region_name>memcpy.input_addr.m00_axi_output_buffer.gep</region_name> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>66</item> <item>76</item> </basic_blocks> <nodes> <count>0</count> <item_version>0</item_version> </nodes> <anchor_node>-1</anchor_node> <region_type>8</region_type> <interval>1</interval> <pipe_depth>3</pipe_depth> </item> </regions> <dp_fu_nodes class_id="51" tracking_level="0" version="0"> <count>28</count> <item_version>0</item_version> <item class_id="52" tracking_level="0" version="0"> <first>98</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>102</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> <item> <first>106</first> <second> <count>1</count> <item_version>0</item_version> <item>6</item> </second> </item> <item> <first>112</first> <second> <count>13</count> <item_version>0</item_version> <item>22</item> <item>22</item> <item>22</item> <item>22</item> <item>22</item> <item>22</item> <item>22</item> <item>58</item> <item>77</item> <item>77</item> <item>77</item> <item>77</item> <item>77</item> </second> </item> <item> <first>119</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>125</first> <second> <count>1</count> <item_version>0</item_version> <item>73</item> </second> </item> <item> <first>134</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>140</first> <second> <count>3</count> <item_version>0</item_version> <item>37</item> <item>52</item> <item>52</item> </second> </item> <item> <first>146</first> <second> <count>1</count> <item_version>0</item_version> <item>51</item> </second> </item> <item> <first>153</first> <second> <count>1</count> <item_version>0</item_version> <item>54</item> </second> </item> <item> <first>159</first> <second> <count>3</count> <item_version>0</item_version> <item>55</item> <item>72</item> <item>72</item> </second> </item> <item> <first>165</first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>176</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>188</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>199</first> <second> <count>1</count> <item_version>0</item_version> <item>61</item> </second> </item> <item> <first>206</first> <second> <count>1</count> <item_version>0</item_version> <item>7</item> </second> </item> <item> <first>216</first> <second> <count>1</count> <item_version>0</item_version> <item>8</item> </second> </item> <item> <first>220</first> <second> <count>1</count> <item_version>0</item_version> <item>9</item> </second> </item> <item> <first>226</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>232</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>238</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>243</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>249</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>255</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>260</first> <second> <count>1</count> <item_version>0</item_version> <item>53</item> </second> </item> <item> <first>267</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>273</first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> <item> <first>279</first> <second> <count>1</count> <item_version>0</item_version> <item>70</item> </second> </item> </dp_fu_nodes> <dp_fu_nodes_expression class_id="54" tracking_level="0" version="0"> <count>22</count> <item_version>0</item_version> <item class_id="55" tracking_level="0" version="0"> <first>add_ln55_fu_232</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>add_ln59_fu_260</first> <second> <count>1</count> <item_version>0</item_version> <item>53</item> </second> </item> <item> <first>add_ln63_fu_273</first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> <item> <first>empty_fu_216</first> <second> <count>1</count> <item_version>0</item_version> <item>8</item> </second> </item> <item> <first>i_0_phi_fu_188</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>i_fu_249</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>icmp_ln55_fu_226</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>icmp_ln58_fu_243</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>icmp_ln63_fu_267</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>input_addr1_fu_206</first> <second> <count>1</count> <item_version>0</item_version> <item>7</item> </second> </item> <item> <first>m00_axi_addr_fu_220</first> <second> <count>1</count> <item_version>0</item_version> <item>9</item> </second> </item> <item> <first>m00_axi_input_buffer_addr_1_gep_fu_146</first> <second> <count>1</count> <item_version>0</item_version> <item>51</item> </second> </item> <item> <first>m00_axi_input_buffer_addr_gep_fu_134</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>m00_axi_input_buffer_alloca_fu_98</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>m00_axi_output_buffer_addr_1_gep_fu_165</first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>m00_axi_output_buffer_addr_gep_fu_153</first> <second> <count>1</count> <item_version>0</item_version> <item>54</item> </second> </item> <item> <first>m00_axi_output_buffer_alloca_fu_102</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> <item> <first>phi_ln55_phi_fu_176</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>phi_ln63_phi_fu_199</first> <second> <count>1</count> <item_version>0</item_version> <item>61</item> </second> </item> <item> <first>zext_ln55_fu_238</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>zext_ln59_fu_255</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>zext_ln63_fu_279</first> <second> <count>1</count> <item_version>0</item_version> <item>70</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>grp_writeresp_fu_112</first> <second> <count>13</count> <item_version>0</item_version> <item>22</item> <item>22</item> <item>22</item> <item>22</item> <item>22</item> <item>22</item> <item>22</item> <item>58</item> <item>77</item> <item>77</item> <item>77</item> <item>77</item> <item>77</item> </second> </item> <item> <first>input_addr_read_read_fu_106</first> <second> <count>1</count> <item_version>0</item_version> <item>6</item> </second> </item> <item> <first>m00_axi_addr_read_read_fu_119</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>write_ln63_write_fu_125</first> <second> <count>1</count> <item_version>0</item_version> <item>73</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>2</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>m00_axi_input_buffer</first> <second>0</second> </first> <second> <count>3</count> <item_version>0</item_version> <item>37</item> <item>52</item> <item>52</item> </second> </item> <item> <first> <first>m00_axi_output_buffer</first> <second>0</second> </first> <second> <count>3</count> <item_version>0</item_version> <item>55</item> <item>72</item> <item>72</item> </second> </item> </dp_mem_port_nodes> <dp_reg_nodes> <count>15</count> <item_version>0</item_version> <item> <first>172</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>184</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>195</first> <second> <count>1</count> <item_version>0</item_version> <item>61</item> </second> </item> <item> <first>284</first> <second> <count>1</count> <item_version>0</item_version> <item>9</item> </second> </item> <item> <first>291</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>295</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>300</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>305</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>309</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>314</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>319</first> <second> <count>1</count> <item_version>0</item_version> <item>51</item> </second> </item> <item> <first>324</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>328</first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> <item> <first>333</first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>338</first> <second> <count>1</count> <item_version>0</item_version> <item>72</item> </second> </item> </dp_reg_nodes> <dp_regname_nodes> <count>15</count> <item_version>0</item_version> <item> <first>add_ln55_reg_295</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>add_ln63_reg_328</first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> <item> <first>i_0_reg_184</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>i_reg_309</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>icmp_ln55_reg_291</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>icmp_ln58_reg_305</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>icmp_ln63_reg_324</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>m00_axi_addr_read_reg_300</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>m00_axi_addr_reg_284</first> <second> <count>1</count> <item_version>0</item_version> <item>9</item> </second> </item> <item> <first>m00_axi_input_buffer_addr_1_reg_319</first> <second> <count>1</count> <item_version>0</item_version> <item>51</item> </second> </item> <item> <first>m00_axi_output_buffer_addr_1_reg_333</first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>m00_axi_output_buffer_load_reg_338</first> <second> <count>1</count> <item_version>0</item_version> <item>72</item> </second> </item> <item> <first>phi_ln55_reg_172</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>phi_ln63_reg_195</first> <second> <count>1</count> <item_version>0</item_version> <item>61</item> </second> </item> <item> <first>zext_ln59_reg_314</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> </dp_regname_nodes> <dp_reg_phi> <count>3</count> <item_version>0</item_version> <item> <first>172</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>184</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>195</first> <second> <count>1</count> <item_version>0</item_version> <item>61</item> </second> </item> </dp_reg_phi> <dp_regname_phi> <count>3</count> <item_version>0</item_version> <item> <first>i_0_reg_184</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>phi_ln55_reg_172</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>phi_ln63_reg_195</first> <second> <count>1</count> <item_version>0</item_version> <item>61</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>input_addr</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>input_size</first> <second> <count>0</count> <item_version>0</item_version> </second> </item> <item> <first>m00_axi</first> <second> <count>0</count> <item_version>0</item_version> </second> </item> <item> <first>output_addr</first> <second> <count>0</count> <item_version>0</item_version> </second> </item> <item> <first>output_size_addr</first> <second> <count>0</count> <item_version>0</item_version> </second> </item> </dp_port_io_nodes> <port2core class_id="61" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </port2core> <node2core> <count>2</count> <item_version>0</item_version> <item class_id="62" tracking_level="0" version="0"> <first>13</first> <second>RAM</second> </item> <item> <first>14</first> <second>RAM</second> </item> </node2core> </syndb> </boost_serialization>

31.2685

154

0.456737

c7913cdc9bca90b31d2f32e9a8b9bbac09d61742

431

adb

Ada

example/src/microwaveoven_defineoven.adb

cortlandstarrett/mcada

d1a7a818f91459d53bd5b9354bc7d78e2c5d4518

[ "Apache-2.0" ]

null

example/src/microwaveoven_defineoven.adb

cortlandstarrett/mcada

d1a7a818f91459d53bd5b9354bc7d78e2c5d4518

[ "Apache-2.0" ]

null

example/src/microwaveoven_defineoven.adb

cortlandstarrett/mcada

d1a7a818f91459d53bd5b9354bc7d78e2c5d4518

[ "Apache-2.0" ]

1

2021-06-08T19:44:04.000Z

with Ada.Text_IO; -- List of objects used with Root_Object.MicrowaveOven.MO_O; with Root_Object; -- package body MicrowaveOven_defineoven_service is procedure MicrowaveOven_defineoven is a : Integer; begin -- a := Root_Object.MicrowaveOven.MO_O.remaining_cooking_time; a := 1; Ada.Text_IO.Put_Line("Defining oven..."); end MicrowaveOven_defineoven; -- end MicrowaveOven_defineoven_service;

19.590909

68

0.733179

2269d8a60def137acb2b15126c9ca7c2f61e7854

7,155

ads

Ada

test/table-test/protypo-api-engine_values-table_wrappers.ads

fintatarta/protypo

c0c2bca17bc766ab95acc99b7422485388a10cb4

[ "MIT" ]

null

test/table-test/protypo-api-engine_values-table_wrappers.ads

fintatarta/protypo

c0c2bca17bc766ab95acc99b7422485388a10cb4

[ "MIT" ]

4

2019-10-09T11:16:38.000Z

2019-10-09T11:20:38.000Z

test/table-test/protypo-api-engine_values-table_wrappers.ads

fintatarta/protypo

c0c2bca17bc766ab95acc99b7422485388a10cb4

[ "MIT" ]

null

with Protypo.Api.Engine_Values.Handlers; with Protypo.Api.Engine_Values.Engine_Value_Holders; with Protypo.Api.Engine_Values.Engine_Value_Vectors; with Protypo.Api.Engine_Values.Array_Wrappers; with Ada.Containers.Indefinite_Ordered_Maps; package Protypo.Api.Engine_Values.Table_Wrappers is use type Ada.Containers.Count_Type; type Table_Wrapper (<>) is new Handlers.Ambivalent_Interface with private; type Table_Wrapper_Access is access Table_Wrapper; type Title_Array is array (Positive range <>) of Unbounded_String; type Label_Array is array (Positive range <>) of Unbounded_ID; function Make_Table (N_Columns : Positive) return Table_Wrapper_Access with Post => Make_Table'Result.N_Columns = N_Columns and Make_Table'Result.N_Rows = 0; function Make_Table (Column_Names : Title_Array) return Table_Wrapper_Access with Post => Make_Table'Result.N_Columns = Column_Names'Length and Make_Table'Result.N_Rows = 0; function Make_Table (Labels : Label_Array) return Table_Wrapper_Access with Post => Make_Table'Result.N_Columns = Labels'Length and Make_Table'Result.N_Rows = 0; function Make_Table (Column_Names : Title_Array; Labels : Label_Array) return Table_Wrapper_Access with Pre => Column_Names'Length = Labels'Length, Post => Make_Table'Result.N_Columns = Column_Names'Length and Make_Table'Result.N_Rows = 0; function N_Columns (Item : Table_Wrapper) return Positive; function N_Rows (Item : Table_Wrapper) return Natural; procedure Append (Table : in out Table_Wrapper; Row : Engine_Value_Vectors.Vector) with Pre => Natural(Row.Length) = Table.N_Columns, Post => Table.N_Rows = Table.N_Rows'Old + 1; function Get (X : Table_Wrapper; Index : Engine_Value_Vectors.Vector) return Handler_Value with Pre => Index.Length = 1 and then Index.First_Element.Class = Int and then Get_Integer (Index.First_Element) > 0 and then Get_Integer (Index.First_Element) <= X.N_Rows, Post => Get'Result.Class = Ambivalent_Handler; function Get (X : Table_Wrapper; Field : ID) return Handler_Value; function Is_Field (X : Table_Wrapper; Field : Id) return Boolean; generic type Field_Type is (<>); package Enumerated_Rows is type Aggregate_Type is array (Field_Type) of Engine_Value_Holders.Holder; type Enumerated_Title_Array is array (Field_Type) of Unbounded_String; N_Fields : constant Integer := Field_Type'Pos (Field_Type'Last)-Field_Type'Pos (Field_Type'First)+1; function Make_Table return Table_Wrapper_Access with Post => Make_Table'Result.N_Columns = N_Fields; function Make_Table (Titles : Enumerated_Title_Array) return Table_Wrapper_Access with Post => Make_Table'Result.N_Columns = N_Fields; procedure Append (Table : in out Table_Wrapper; Item : Aggregate_Type); generic type Ada_Aggregate is limited private; type Aggregate_Index is (<>); type Generic_Aggregate_Array is array (Aggregate_Index range <>) of Ada_Aggregate; with function Convert (X : Ada_Aggregate) return Aggregate_Type; procedure Append_Array (Table : in out Table_Wrapper; Item : Generic_Aggregate_Array); private function Default_Titles return Enumerated_Title_Array; function Make_Table return Table_Wrapper_Access is (Make_Table (Default_Titles)); end Enumerated_Rows; private package Label_Maps is new Ada.Containers.Indefinite_Ordered_Maps (Key_Type => ID, Element_Type => Positive); type Row_Wrapper is new Array_Wrappers.Array_Wrapper with record Label_To_Column : Label_Maps.Map; end record; type Row_Wrapper_Access is access Row_Wrapper; function Make_Row (Data : Engine_Value_Vectors.Vector; Labels : Label_Maps.Map) return Row_Wrapper_Access; function Make_Map (Labels : Label_Array) return Label_Maps.Map with Pre => (for all I in Labels'Range => (for all J in I + 1 .. Labels'Last => Labels (I) /= Labels (J))), Post => Integer (Make_Map'Result.Length) = Labels'Length; overriding function Get (X : Row_Wrapper; Field : ID) return Handler_Value; overriding function Get (X : Row_Wrapper; Index : Engine_Value_Vectors.Vector) return Handler_Value; overriding function Is_Field (X : Row_Wrapper; Field : Id) return Boolean; type Table_Wrapper (N_Columns : Positive) is new Ambivalent_Interface with record Titles : Engine_Value_Vectors.Vector_Handler_Access; Labels : Label_Array (1 .. N_Columns); Rows : Engine_Value_Vectors.Vector_Handler_Access; end record; function Default_Titles (N_Columns : Positive) return Title_Array with Post => Default_Titles'Result'Length = N_Columns; function Default_Titles (Labels : Label_Array) return Title_Array with Post => Default_Titles'Result'Length = Labels'Length; function Default_Labels (N_Columns : Positive) return Label_Array with Post => Default_Labels'Result'Length = N_Columns; function Create (Titles : Title_Array) return Engine_Value_Vectors.Vector_Handler_Access; -- function Make_Table (Column_Names : Title_Array; -- Labels : Label_Array) return Table_Wrapper_Access -- is (new Table_Wrapper'(Titles => Create (Column_Names), -- Rows => new Row_Wrapper'(Engine_Value_Vectors.Vector_Handler with -- Label_To_Column => Make_Map (Labels)))); function Make_Table (Column_Names : Title_Array; Labels : Label_Array) return Table_Wrapper_Access is (new Table_Wrapper'(N_Columns => Column_Names'Length, Titles => Create (Column_Names), Labels => Labels, Rows => new Engine_Value_Vectors.Vector_Handler)); function Make_Table (N_Columns : Positive) return Table_Wrapper_Access is (Make_Table (Default_Titles (N_Columns), Default_Labels (N_Columns))); function Make_Table (Column_Names : Title_Array) return Table_Wrapper_Access is (Make_Table (Column_Names, Default_Labels (Column_Names'Length))); function Make_Table (Labels : Label_Array) return Table_Wrapper_Access is (Make_Table (Default_Titles (Labels), Labels)); function N_Columns (Item : Table_Wrapper) return Positive is (Integer (Item.Titles.Vector.Length)); function N_Rows (Item : Table_Wrapper) return Natural is (Natural (Item.Rows.Vector.Length)); end Protypo.Api.Engine_Values.Table_Wrappers;

38.675676

99

0.666247

1db2b90e477b95fecca5f2747ce034e5a8bc6267

2,963

ads

Ada

stm32l0/stm32gd-exti.ads

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

1

2021-04-06T07:57:56.000Z

stm32l0/stm32gd-exti.ads

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

null

stm32l0/stm32gd-exti.ads

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

2

2018-05-29T13:59:31.000Z

2019-02-03T19:48:08.000Z

with Ada.Interrupts.Names; use Ada.Interrupts.Names; with STM32_SVD.EXTI; package STM32GD.EXTI is type External_Line_Number is (EXTI_Line_0, EXTI_Line_1, EXTI_Line_2, EXTI_Line_3, EXTI_Line_4, EXTI_Line_5, EXTI_Line_6, EXTI_Line_7, EXTI_Line_8, EXTI_Line_9, EXTI_Line_10, EXTI_Line_11, EXTI_Line_12, EXTI_Line_13, EXTI_Line_14, EXTI_Line_15, EXTI_Line_16, EXTI_Line_17, EXTI_Line_18, EXTI_Line_19, EXTI_Line_20, EXTI_Line_21, EXTI_Line_22); for External_Line_Number use (EXTI_Line_0 => 0, EXTI_Line_1 => 1, EXTI_Line_2 => 2, EXTI_Line_3 => 3, EXTI_Line_4 => 4, EXTI_Line_5 => 5, EXTI_Line_6 => 6, EXTI_Line_7 => 7, EXTI_Line_8 => 8, EXTI_Line_9 => 9, EXTI_Line_10 => 10, EXTI_Line_11 => 11, EXTI_Line_12 => 12, EXTI_Line_13 => 13, EXTI_Line_14 => 14, EXTI_Line_15 => 15, EXTI_Line_16 => 16, EXTI_Line_17 => 17, EXTI_Line_18 => 18, EXTI_Line_19 => 19, EXTI_Line_20 => 20, EXTI_Line_21 => 21, EXTI_Line_22 => 22); subtype EXTI_Line_Type is Integer range 0 .. 22; type External_Triggers is (Interrupt_Rising_Edge, Interrupt_Falling_Edge, Interrupt_Rising_Falling_Edge, Event_Rising_Edge, Event_Falling_Edge, Event_Rising_Falling_Edge); type EXTI_IRQ_Status is array (0 .. 22) of Boolean; subtype Interrupt_Triggers is External_Triggers range Interrupt_Rising_Edge .. Interrupt_Rising_Falling_Edge; subtype Event_Triggers is External_Triggers range Event_Rising_Edge .. Event_Rising_Falling_Edge; procedure Enable_External_Interrupt (Line : External_Line_Number; Trigger : Interrupt_Triggers) with Inline; procedure Disable_External_Interrupt (Line : External_Line_Number) with Inline; procedure Enable_External_Event (Line : External_Line_Number; Trigger : Event_Triggers) with Inline; procedure Disable_External_Event (Line : External_Line_Number) with Inline; procedure Generate_SWI (Line : External_Line_Number) with Inline; function External_Interrupt_Pending (Line : External_Line_Number) return Boolean with Inline; procedure Clear_External_Interrupt (Line : External_Line_Number) with Inline; protected IRQ_Handler is entry Wait; procedure Cancel; function Status (Line : External_Line_Number) return Boolean; procedure Reset_Status (Line : External_Line_Number); procedure Handler; pragma Attach_Handler (Handler, EXTI0_1); pragma Attach_Handler (Handler, EXTI2_3); pragma Attach_Handler (Handler, EXTI4_15); private EXTI_Status : STM32_SVD.EXTI.PR_Field; Cancelled : Boolean; Triggered : Boolean; end IRQ_Handler; end STM32GD.EXTI;

25.110169

69

0.672292

c73b66b33db3e45e0df0df9657fc2c4a61b43c37

3,524

adb

Ada

software/hal/boards/stm32f469_discovery/stm32-board.adb

TUM-EI-RCS/StratoX

5fdd04e01a25efef6052376f43ce85b5bc973392

[ "BSD-3-Clause" ]

12

2017-06-08T14:19:57.000Z

2022-03-09T02:48:59.000Z

software/hal/boards/stm32f469_discovery/stm32-board.adb

TUM-EI-RCS/StratoX

5fdd04e01a25efef6052376f43ce85b5bc973392

[ "BSD-3-Clause" ]

6

2017-06-08T13:13:50.000Z

2020-05-15T09:32:43.000Z

software/hal/boards/stm32f469_discovery/stm32-board.adb

TUM-EI-RCS/StratoX

5fdd04e01a25efef6052376f43ce85b5bc973392

[ "BSD-3-Clause" ]

3

2017-06-30T14:05:06.000Z

2022-02-17T12:20:45.000Z

------------------------------------------------------------------------------ -- -- -- 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. -- -- -- ------------------------------------------------------------------------------ package body STM32.Board is ------------------ -- All_LEDs_Off -- ------------------ procedure All_LEDs_Off is begin Set (All_LEDs); end All_LEDs_Off; ----------------- -- All_LEDs_On -- ----------------- procedure All_LEDs_On is begin Clear (All_LEDs); end All_LEDs_On; --------------------- -- Initialize_LEDs -- --------------------- procedure Initialize_LEDs is Conf : GPIO_Port_Configuration; begin Enable_Clock (All_LEDs); Conf.Mode := Mode_Out; Conf.Output_Type := Push_Pull; Conf.Speed := Speed_100MHz; Conf.Resistors := Floating; Configure_IO (All_LEDs, Conf); All_LEDs_Off; end Initialize_LEDs; -------------------------------- -- Configure_User_Button_GPIO -- -------------------------------- procedure Configure_User_Button_GPIO is Config : GPIO_Port_Configuration; begin Enable_Clock (User_Button_Point); Config.Mode := Mode_In; Config.Resistors := Floating; Configure_IO (User_Button_Point, Config); end Configure_User_Button_GPIO; end STM32.Board;

40.976744

78

0.515607

31a975554b29f2a4ba7832be7ab8aec67cbf147a

18,046

adb

Ada

llvm-gcc-4.2-2.9/gcc/ada/par-load.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

llvm-gcc-4.2-2.9/gcc/ada/par-load.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

llvm-gcc-4.2-2.9/gcc/ada/par-load.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- P A R . L O A D -- -- -- -- B o d y -- -- -- -- 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. -- -- -- ------------------------------------------------------------------------------ -- The Par.Load procedure loads all units that are definitely required before -- it makes any sense at all to proceed with semantic analysis, including -- with'ed units, corresponding specs for bodies, parents of child specs, -- and parents of subunits. All these units are loaded and pointers installed -- in the tree as described in the spec of package Lib. with Fname.UF; use Fname.UF; with Lib.Load; use Lib.Load; with Uname; use Uname; with Osint; use Osint; with Sinput.L; use Sinput.L; with Stylesw; use Stylesw; with Validsw; use Validsw; with GNAT.Spelling_Checker; use GNAT.Spelling_Checker; separate (Par) procedure Load is File_Name : File_Name_Type; -- Name of file for current unit, derived from unit name Cur_Unum : constant Unit_Number_Type := Current_Source_Unit; -- Unit number of unit that we just finished parsing. Note that we need -- to capture this, because Source_Unit will change as we parse new -- source files in the multiple main source file case. Curunit : constant Node_Id := Cunit (Cur_Unum); -- Compilation unit node for current compilation unit Loc : Source_Ptr := Sloc (Curunit); -- Source location for compilation unit node Save_Style_Check : Boolean; Save_Style_Checks : Style_Check_Options; -- Save style check so it can be restored later Save_Validity_Check : Boolean; Save_Validity_Checks : Validity_Check_Options; -- Save validity check so it can be restored later With_Cunit : Node_Id; -- Compilation unit node for withed unit Context_Node : Node_Id; -- Next node in context items list With_Node : Node_Id; -- N_With_Clause node Spec_Name : Unit_Name_Type; -- Unit name of required spec Body_Name : Unit_Name_Type; -- Unit name of corresponding body Unum : Unit_Number_Type; -- Unit number of loaded unit Limited_With_Found : Boolean := False; -- Set True if a limited WITH is found, used to ??? function Same_File_Name_Except_For_Case (Expected_File_Name : File_Name_Type; Actual_File_Name : File_Name_Type) return Boolean; -- Given an actual file name and an expected file name (the latter being -- derived from the unit name), determine if they are the same except for -- possibly different casing of letters. ------------------------------------ -- Same_File_Name_Except_For_Case -- ------------------------------------ function Same_File_Name_Except_For_Case (Expected_File_Name : File_Name_Type; Actual_File_Name : File_Name_Type) return Boolean is begin Get_Name_String (Actual_File_Name); Canonical_Case_File_Name (Name_Buffer (1 .. Name_Len)); declare Lower_Case_Actual_File_Name : String (1 .. Name_Len); begin Lower_Case_Actual_File_Name := Name_Buffer (1 .. Name_Len); Get_Name_String (Expected_File_Name); Canonical_Case_File_Name (Name_Buffer (1 .. Name_Len)); return Lower_Case_Actual_File_Name = Name_Buffer (1 .. Name_Len); end; end Same_File_Name_Except_For_Case; -- Start of processing for Load begin -- Don't do any loads if we already had a fatal error if Fatal_Error (Cur_Unum) then return; end if; Save_Style_Check_Options (Save_Style_Checks); Save_Style_Check := Opt.Style_Check; Save_Validity_Check_Options (Save_Validity_Checks); Save_Validity_Check := Opt.Validity_Checks_On; -- If main unit, set Main_Unit_Entity (this will get overwritten if -- the main unit has a separate spec, that happens later on in Load) if Cur_Unum = Main_Unit then Main_Unit_Entity := Cunit_Entity (Main_Unit); end if; -- If we have no unit name, things are seriously messed up by previous -- errors, and we should not try to continue compilation. if Unit_Name (Cur_Unum) = No_Name then raise Unrecoverable_Error; end if; -- Next step, make sure that the unit name matches the file name -- and issue a warning message if not. We only output this for the -- main unit, since for other units it is more serious and is -- caught in a separate test below. We also inhibit the message in -- multiple unit per file mode, because in this case the relation -- between file name and unit name is broken. File_Name := Get_File_Name (Unit_Name (Cur_Unum), Subunit => Nkind (Unit (Cunit (Cur_Unum))) = N_Subunit); if Cur_Unum = Main_Unit and then Multiple_Unit_Index = 0 and then File_Name /= Unit_File_Name (Cur_Unum) and then (File_Names_Case_Sensitive or not Same_File_Name_Except_For_Case (File_Name, Unit_File_Name (Cur_Unum))) then Error_Msg_Name_1 := File_Name; Error_Msg ("?file name does not match unit name, should be{", Sloc (Curunit)); end if; -- For units other than the main unit, the expected unit name is set and -- must be the same as the actual unit name, or we are in big trouble, and -- abandon the compilation since there are situations where this really -- gets us into bad trouble (e.g. some subunit situations). if Cur_Unum /= Main_Unit and then Expected_Unit (Cur_Unum) /= Unit_Name (Cur_Unum) then Loc := Error_Location (Cur_Unum); Error_Msg_Name_1 := Unit_File_Name (Cur_Unum); Get_Name_String (Error_Msg_Name_1); -- Check for predefined file case if Name_Len > 1 and then Name_Buffer (2) = '-' and then (Name_Buffer (1) = 'a' or else Name_Buffer (1) = 's' or else Name_Buffer (1) = 'i' or else Name_Buffer (1) = 'g') then declare Expect_Name : constant Name_Id := Expected_Unit (Cur_Unum); Actual_Name : constant Name_Id := Unit_Name (Cur_Unum); begin Error_Msg_Name_1 := Expect_Name; Error_Msg ("% is not a predefined library unit!", Loc); -- In the predefined file case, we know the user did not -- construct their own package, but we got the wrong one. -- This means that the name supplied by the user crunched -- to something we recognized, but then the file did not -- contain the unit expected. Most likely this is due to -- a misspelling, e.g. -- with Ada.Calender; -- This crunches to a-calend, which indeed contains the unit -- Ada.Calendar, and we can diagnose the misspelling. This -- is a simple heuristic, but it catches many common cases -- of misspelling of predefined unit names without needing -- a full list of them. -- Before actually issinying the message, we will check that the -- unit name is indeed a plausible misspelling of the one we got. if Is_Bad_Spelling_Of (Found => Get_Name_String (Expect_Name), Expect => Get_Name_String (Actual_Name)) then Error_Msg_Name_1 := Actual_Name; Error_Msg ("possible misspelling of %!", Loc); end if; end; -- Non-predefined file name case. In this case we generate a message -- and then we quit, because we are in big trouble, and if we try -- to continue compilation, we get into some nasty situations -- (for example in some subunit cases). else Error_Msg ("file { does not contain expected unit!", Loc); Error_Msg_Unit_1 := Expected_Unit (Cur_Unum); Error_Msg ("expected unit $!", Loc); Error_Msg_Unit_1 := Unit_Name (Cur_Unum); Error_Msg ("found unit $!", Loc); end if; -- In both cases, remove the unit if it is the last unit (which it -- normally (always?) will be) so that it is out of the way later. Remove_Unit (Cur_Unum); end if; -- If current unit is a body, load its corresponding spec if Nkind (Unit (Curunit)) = N_Package_Body or else Nkind (Unit (Curunit)) = N_Subprogram_Body then Spec_Name := Get_Spec_Name (Unit_Name (Cur_Unum)); Unum := Load_Unit (Load_Name => Spec_Name, Required => False, Subunit => False, Error_Node => Curunit, Corr_Body => Cur_Unum); -- If we successfully load the unit, then set the spec pointer. Once -- again note that if the loaded unit has a fatal error, Load will -- have set our Fatal_Error flag to propagate this condition. if Unum /= No_Unit then Set_Library_Unit (Curunit, Cunit (Unum)); -- If this is a separate spec for the main unit, then we reset -- Main_Unit_Entity to point to the entity for this separate spec if Cur_Unum = Main_Unit then Main_Unit_Entity := Cunit_Entity (Unum); end if; -- If we don't find the spec, then if we have a subprogram body, we -- are still OK, we just have a case of a body acting as its own spec elsif Nkind (Unit (Curunit)) = N_Subprogram_Body then Set_Acts_As_Spec (Curunit, True); Set_Library_Unit (Curunit, Curunit); -- Otherwise we do have an error, repeat the load request for the spec -- with Required set True to generate an appropriate error message. else Unum := Load_Unit (Load_Name => Spec_Name, Required => True, Subunit => False, Error_Node => Curunit); return; end if; -- If current unit is a child unit spec, load its parent. If the child unit -- is loaded through a limited with, the parent must be as well. elsif Nkind (Unit (Curunit)) = N_Package_Declaration or else Nkind (Unit (Curunit)) = N_Subprogram_Declaration or else Nkind (Unit (Curunit)) in N_Generic_Declaration or else Nkind (Unit (Curunit)) in N_Generic_Instantiation or else Nkind (Unit (Curunit)) in N_Renaming_Declaration then -- Turn style and validity checks off for parent unit if not GNAT_Mode then Reset_Style_Check_Options; Reset_Validity_Check_Options; end if; Spec_Name := Get_Parent_Spec_Name (Unit_Name (Cur_Unum)); if Spec_Name /= No_Name then Unum := Load_Unit (Load_Name => Spec_Name, Required => True, Subunit => False, Error_Node => Curunit, From_Limited_With => From_Limited_With); if Unum /= No_Unit then Set_Parent_Spec (Unit (Curunit), Cunit (Unum)); end if; end if; -- If current unit is a subunit, then load its parent body elsif Nkind (Unit (Curunit)) = N_Subunit then Body_Name := Get_Parent_Body_Name (Unit_Name (Cur_Unum)); Unum := Load_Unit (Load_Name => Body_Name, Required => True, Subunit => True, Error_Node => Name (Unit (Curunit))); if Unum /= No_Unit then Set_Library_Unit (Curunit, Cunit (Unum)); end if; end if; -- Now we load with'ed units, with style/validity checks turned off if not GNAT_Mode then Reset_Style_Check_Options; Reset_Validity_Check_Options; end if; -- Load the context items in two rounds: the first round handles normal -- withed units and the second round handles Ada 2005 limited-withed units. -- This is required to allow the low-level circuitry that detects circular -- dependencies of units the correct notification of the following error: -- limited with D; -- with D; with C; -- package C is ... package D is ... for Round in 1 .. 2 loop Context_Node := First (Context_Items (Curunit)); while Present (Context_Node) loop -- During the first round we check if there is some limited-with -- context clause; otherwise the second round will be skipped if Nkind (Context_Node) = N_With_Clause and then Round = 1 and then Limited_Present (Context_Node) then Limited_With_Found := True; end if; if Nkind (Context_Node) = N_With_Clause and then ((Round = 1 and then not Limited_Present (Context_Node)) or else (Round = 2 and then Limited_Present (Context_Node))) then With_Node := Context_Node; Spec_Name := Get_Unit_Name (With_Node); Unum := Load_Unit (Load_Name => Spec_Name, Required => False, Subunit => False, Error_Node => With_Node, Renamings => True, From_Limited_With => From_Limited_With or else Limited_Present (Context_Node)); -- If we find the unit, then set spec pointer in the N_With_Clause -- to point to the compilation unit for the spec. Remember that -- the Load routine itself sets our Fatal_Error flag if the loaded -- unit gets a fatal error, so we don't need to worry about that. if Unum /= No_Unit then Set_Library_Unit (With_Node, Cunit (Unum)); -- If the spec isn't found, then try finding the corresponding -- body, since it is possible that we have a subprogram body -- that is acting as a spec (since no spec is present). else Body_Name := Get_Body_Name (Spec_Name); Unum := Load_Unit (Load_Name => Body_Name, Required => False, Subunit => False, Error_Node => With_Node, Renamings => True); -- If we got a subprogram body, then mark that we are using -- the body as a spec in the file table, and set the spec -- pointer in the N_With_Clause to point to the body entity. if Unum /= No_Unit and then Nkind (Unit (Cunit (Unum))) = N_Subprogram_Body then With_Cunit := Cunit (Unum); Set_Library_Unit (With_Node, With_Cunit); Set_Acts_As_Spec (With_Cunit, True); Set_Library_Unit (With_Cunit, With_Cunit); -- If we couldn't find the body, or if it wasn't a body spec -- then we are in trouble. We make one more call to Load to -- require the spec. We know it will fail of course, the -- purpose is to generate the required error message (we prefer -- that this message refer to the missing spec, not the body) else Unum := Load_Unit (Load_Name => Spec_Name, Required => True, Subunit => False, Error_Node => With_Node, Renamings => True); -- Here we create a dummy package unit for the missing unit Unum := Create_Dummy_Package_Unit (With_Node, Spec_Name); Set_Library_Unit (With_Node, Cunit (Unum)); end if; end if; end if; Next (Context_Node); end loop; exit when not Limited_With_Found; end loop; -- Restore style/validity check mode for main unit Set_Style_Check_Options (Save_Style_Checks); Opt.Style_Check := Save_Style_Check; Set_Validity_Check_Options (Save_Validity_Checks); Opt.Validity_Checks_On := Save_Validity_Check; end Load;

38.725322

79

0.580239

3d677842941e87301bd9b8f145030a6844ed0401

945

adb

Ada

contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/fun_renaming/pack.adb

TheSledgeHammer/2.11BSD

fe61f0b9aaa273783cd027c7b5ec77e95ead2153

[ "BSD-3-Clause" ]

3

2021-05-04T17:09:06.000Z

2021-10-04T07:19:26.000Z

contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/fun_renaming/pack.adb

TheSledgeHammer/2.11BSD

fe61f0b9aaa273783cd027c7b5ec77e95ead2153

[ "BSD-3-Clause" ]

null

contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/fun_renaming/pack.adb

TheSledgeHammer/2.11BSD

fe61f0b9aaa273783cd027c7b5ec77e95ead2153

[ "BSD-3-Clause" ]

null

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

35

73

0.72381

59460fe7fc9057d5a1b6864cac4d73afab0ee1a9

2,496

adb

Ada

examples/src/examples-factory.adb

TNO/Rejuvenation-Ada

8113ec28da3923ccde40d76cbab70e0e614f4b75

[ "BSD-3-Clause" ]

1

2022-03-08T13:00:47.000Z

src/examples/Rejuvenation_Examples/src/examples-factory.adb

selroc/Renaissance-Ada

39230b34aced4a9d83831be346ca103136c53715

[ "BSD-3-Clause" ]

null

src/examples/Rejuvenation_Examples/src/examples-factory.adb

selroc/Renaissance-Ada

39230b34aced4a9d83831be346ca103136c53715

[ "BSD-3-Clause" ]

null

with Ada.Text_IO; use Ada.Text_IO; with Libadalang.Analysis; use Libadalang.Analysis; with Libadalang.Common; use Libadalang.Common; with Rejuvenation; use Rejuvenation; with Rejuvenation.Factory; use Rejuvenation.Factory; with Rejuvenation.Simple_Factory; use Rejuvenation.Simple_Factory; package body Examples.Factory is procedure Demo_Parse_Full_Text; procedure Demo_Parse_Partial_Text; procedure Demo_Parse_File_Outside_Project_Context (File_Name : String); procedure Demo_Parse_File_Inside_Project_Context (Project_Name : String; File_Name : String); procedure Demo (Project_Name : String; File_Name : String) is begin Put_Line ("=== Examples of Factory ======="); New_Line; Put_Line ("--- Example of parsing full text -------"); New_Line; Demo_Parse_Full_Text; New_Line; Put_Line ("--- Example of parsing partial text -------"); New_Line; Demo_Parse_Partial_Text; New_Line; Put_Line ("--- Example of parsing file outside project context -------"); New_Line; Demo_Parse_File_Outside_Project_Context (File_Name); New_Line; Put_Line ("--- Example of parsing file inside project context -------"); New_Line; Demo_Parse_File_Inside_Project_Context (Project_Name, File_Name); New_Line; end Demo; procedure Demo_Parse_Full_Text is Unit : constant Analysis_Unit := Analyze_Fragment ("procedure Test is begin New_Line; end;"); begin Unit.Print; -- Show the node's internal structure end Demo_Parse_Full_Text; procedure Demo_Parse_Partial_Text is Unit : constant Analysis_Unit := Analyze_Fragment ("x := 4;", Stmt_Rule); begin Unit.Print; -- Show the node's internal structure end Demo_Parse_Partial_Text; procedure Demo_Parse_File_Outside_Project_Context (File_Name : String) is Unit : constant Analysis_Unit := Open_File (File_Name); begin Unit.Print; -- Show the node's internal structure end Demo_Parse_File_Outside_Project_Context; procedure Demo_Parse_File_Inside_Project_Context (Project_Name : String; File_Name : String) is Context : constant Project_Context := Open_Project (Project_Name); Unit : constant Analysis_Unit := Open_File (File_Name, Context); begin Unit.Print; -- Show the node's internal structure end Demo_Parse_File_Inside_Project_Context; end Examples.Factory;

35.15493

79

0.701923

c79f2e778f01bd9e9376abb0c50bf84e2f8865ec

14,494

adb

Ada

.emacs.d/elpa/wisi-3.1.3/run_wisi_common_parse.adb

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

.emacs.d/elpa/wisi-3.1.3/run_wisi_common_parse.adb

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

.emacs.d/elpa/wisi-3.1.3/run_wisi_common_parse.adb

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

-- Abstract : -- -- See spec. -- -- Copyright (C) 2018 - 2020 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 3, or (at -- your option) any later version. This program is distributed in the -- hope that it will be useful, but WITHOUT ANY WARRANTY; without even -- the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR -- PURPOSE. See the GNU General Public License for more details. You -- should have received a copy of the GNU General Public License -- distributed with this program; see file COPYING. If not, write to -- the Free Software Foundation, 51 Franklin Street, Suite 500, Boston, -- MA 02110-1335, USA. pragma License (GPL); with Ada.Command_Line; with Ada.Exceptions; with Ada.IO_Exceptions; with Ada.Real_Time; with Ada.Text_IO; with SAL; with System.Multiprocessors; package body Run_Wisi_Common_Parse is procedure Usage (Parser : in out WisiToken.Parse.LR.Parser.Parser) is use all type WisiToken.Parse.LR.Parse_Table_Ptr; use Ada.Text_IO; begin Put_Line ("usage: parse <parse_action> <file_name> [partial parse params] [options]"); Put_Line (" or: refactor <refactor_action> <file_name> <edit_begin> [options]"); Put_Line ("parse_action: {Navigate | Face | Indent}"); Put_Line ("partial parse params: begin_byte_pos end_byte_pos goal_byte_pos begin_char_pos begin_line" & " end_line begin_indent"); Put_Line ("options:"); Put_Line ("--verbosity n m l: (no 'm' for refactor)"); Put_Line (" n: parser; m: mckenzie; l: action"); Put_Line (" 0 - only report parse errors"); Put_Line (" 1 - shows spawn/terminate parallel parsers, error recovery enter/exit"); Put_Line (" 2 - add each parser cycle, error recovery enqueue/check"); Put_Line (" 3 - parse stack in each cycle, error recovery parse actions"); Put_Line (" 4 - add lexer debug, dump syntax tree"); Put_Line ("--check_limit n : set error recover token check limit" & (if Parser.Table = null then "" else "; default" & Parser.Table.McKenzie_Param.Check_Limit'Image)); Put_Line ("--check_delta n : set error recover delta check limit" & (if Parser.Table = null then "" else "; default" & Parser.Table.McKenzie_Param.Check_Delta_Limit'Image)); Put_Line ("--enqueue_limit n : set error recover token enqueue limit" & (if Parser.Table = null then "" else "; default" & Parser.Table.McKenzie_Param.Enqueue_Limit'Image)); Put_Line ("--max_parallel n : set maximum count of parallel parsers (default" & WisiToken.Parse.LR.Parser.Default_Max_Parallel'Image & ")"); Put_Line ("--task_count n : worker tasks in error recovery"); Put_Line ("--disable_recover : disable error recovery; default enabled"); Put_Line ("--debug_mode : tracebacks from unhandled exceptions; default disabled"); Put_Line ("--lang_params <language-specific params>"); Put_Line ("--repeat_count n : repeat parse count times, for profiling; default 1"); New_Line; end Usage; function Get_CL_Params (Parser : in out WisiToken.Parse.LR.Parser.Parser) return Command_Line_Params is use Ada.Command_Line; use WisiToken; Arg : Integer := 1; Command : Command_Type; begin if Argument_Count < 1 then Usage (Parser); Set_Exit_Status (Failure); raise Finish; elsif Argument (Arg) = "--help" then Usage (Parser); raise Finish; elsif Argument_Count < 2 then Usage (Parser); Set_Exit_Status (Failure); raise Finish; end if; Command := Command_Type'Value (Ada.Command_Line.Argument (1)); return Result : Command_Line_Params (Command) do Result.Source_File_Name := +Ada.Command_Line.Argument (3); case Command is when Parse => Result.Post_Parse_Action := Wisi.Post_Parse_Action_Type'Value (Ada.Command_Line.Argument (2)); if Argument_Count >= 4 and then Argument (4)(1) /= '-' then Result.Begin_Byte_Pos := WisiToken.Buffer_Pos'Value (Argument (4)); Result.End_Byte_Pos := WisiToken.Buffer_Pos'Value (Argument (5)) - 1; -- match emacs region Result.Goal_Byte_Pos := WisiToken.Buffer_Pos'Value (Argument (6)); Result.Begin_Char_Pos := WisiToken.Buffer_Pos'Value (Argument (7)); Result.Begin_Line := WisiToken.Line_Number_Type'Value (Argument (8)); Result.End_Line := WisiToken.Line_Number_Type'Value (Argument (9)); Result.Begin_Indent := Integer'Value (Argument (10)); Arg := 11; else Result.Begin_Byte_Pos := WisiToken.Invalid_Buffer_Pos; Result.End_Byte_Pos := WisiToken.Invalid_Buffer_Pos; Result.Begin_Char_Pos := WisiToken.Buffer_Pos'First; Result.Begin_Line := WisiToken.Line_Number_Type'First; Arg := 4; end if; when Refactor => Result.Refactor_Action := Integer'Value (Argument (2)); Result.Edit_Begin := WisiToken.Buffer_Pos'Value (Argument (4)); Arg := 5; end case; loop exit when Arg > Argument_Count; if Argument (Arg) = "--verbosity" then WisiToken.Trace_Parse := Integer'Value (Argument (Arg + 1)); case Command is when Parse => WisiToken.Trace_McKenzie := Integer'Value (Argument (Arg + 2)); WisiToken.Trace_Action := Integer'Value (Argument (Arg + 3)); Arg := Arg + 4; when Refactor => WisiToken.Trace_Action := Integer'Value (Argument (Arg + 2)); Arg := Arg + 3; end case; WisiToken.Debug_Mode := WisiToken.Trace_Parse > Outline or WisiToken.Trace_McKenzie > Outline; elsif Argument (Arg) = "--check_limit" then Parser.Table.McKenzie_Param.Check_Limit := Token_Index'Value (Argument (Arg + 1)); Arg := Arg + 2; elsif Argument (Arg) = "--check_delta" then Parser.Table.McKenzie_Param.Check_Delta_Limit := Integer'Value (Argument (Arg + 1)); Arg := Arg + 2; elsif Argument (Arg) = "--debug_mode" then WisiToken.Debug_Mode := True; Arg := Arg + 1; elsif Argument (Arg) = "--disable_recover" then Parser.Enable_McKenzie_Recover := False; Arg := Arg + 1; elsif Argument (Arg) = "--enqueue_limit" then Parser.Table.McKenzie_Param.Enqueue_Limit := Integer'Value (Argument (Arg + 1)); Arg := Arg + 2; elsif Argument (Arg) = "--lang_params" then Result.Lang_Params := +Argument (Arg + 1); Arg := Arg + 2; elsif Argument (Arg) = "--max_parallel" then Parser.Max_Parallel := SAL.Base_Peek_Type'Value (Argument (Arg + 1)); Arg := Arg + 2; elsif Argument (Arg) = "--repeat_count" then Result.Repeat_Count := Integer'Value (Argument (Arg + 1)); Arg := Arg + 2; elsif Argument (Arg) = "--task_count" then Parser.Table.McKenzie_Param.Task_Count := System.Multiprocessors.CPU_Range'Value (Argument (Arg + 1)); Arg := Arg + 2; else Ada.Text_IO.Put_Line ("unrecognized option: '" & Argument (Arg) & "'"); Usage (Parser); Set_Exit_Status (Failure); raise SAL.Parameter_Error; end if; end loop; end return; exception when Finish => raise; when E : others => Ada.Text_IO.Put_Line (Ada.Exceptions.Exception_Name (E) & ": " & Ada.Exceptions.Exception_Message (E)); Usage (Parser); Set_Exit_Status (Failure); raise SAL.Parameter_Error; end Get_CL_Params; procedure Parse_File (Parser : in out WisiToken.Parse.LR.Parser.Parser; Parse_Data : in out Wisi.Parse_Data_Type'Class; Descriptor : in WisiToken.Descriptor) is use Ada.Text_IO; use WisiToken; Start : Ada.Real_Time.Time; End_Line : WisiToken.Line_Number_Type; function Image_Augmented (Aug : in Base_Token_Class_Access) return String is begin -- For Syntax_Trees.Print_Tree return Wisi.Image (Aug, Descriptor); end Image_Augmented; begin Parser.Trace.Set_Prefix (";; "); -- so we get the same debug messages as Emacs_Wisi_Common_Parse declare Cl_Params : constant Command_Line_Params := Get_CL_Params (Parser); begin begin case Cl_Params.Command is when Parse => Parser.Lexer.Reset_With_File (-Cl_Params.Source_File_Name, Cl_Params.Begin_Byte_Pos, Cl_Params.End_Byte_Pos, Cl_Params.Begin_Char_Pos, Cl_Params.Begin_Line); when Refactor => Parser.Lexer.Reset_With_File (-Cl_Params.Source_File_Name); end case; exception when Ada.IO_Exceptions.Name_Error => Put_Line (Standard_Error, "'" & (-Cl_Params.Source_File_Name) & "' cannot be opened"); return; end; -- Parser.Line_Begin_Token First, Last set by Lex_All if Cl_Params.Command = Refactor or else Cl_Params.End_Line = Invalid_Line_Number then -- User did not provide; run lexer to get end line. declare Token : Base_Token; Lexer_Error : Boolean; pragma Unreferenced (Lexer_Error); begin loop Lexer_Error := Parser.Lexer.Find_Next (Token); exit when Token.ID = Descriptor.EOI_ID; end loop; End_Line := Token.Line; end; else End_Line := Cl_Params.End_Line; end if; Parse_Data.Initialize (Post_Parse_Action => (case Cl_Params.Command is when Parse => Cl_Params.Post_Parse_Action, when Refactor => Wisi.Navigate), Lexer => Parser.Lexer, Descriptor => Descriptor'Unrestricted_Access, Base_Terminals => Parser.Terminals'Unrestricted_Access, Begin_Line => (case Cl_Params.Command is when Parse => Cl_Params.Begin_Line, when Refactor => WisiToken.Line_Number_Type'First), End_Line => End_Line, Begin_Indent => (case Cl_Params.Command is when Parse => Cl_Params.Begin_Indent, when Refactor => 0), Params => -Cl_Params.Lang_Params); if Cl_Params.Repeat_Count > 1 then Start := Ada.Real_Time.Clock; end if; for I in 1 .. Cl_Params.Repeat_Count loop declare procedure Clean_Up is use all type SAL.Base_Peek_Type; begin Parser.Lexer.Discard_Rest_Of_Input; if Cl_Params.Repeat_Count = 1 and Parser.Parsers.Count > 0 then Parse_Data.Put (Parser.Lexer.Errors, Parser.Parsers.First.State_Ref.Errors, Parser.Parsers.First.State_Ref.Tree); end if; end Clean_Up; begin Parse_Data.Reset; Parser.Lexer.Reset; begin Parser.Parse; exception when WisiToken.Partial_Parse => null; end; Parser.Execute_Actions (Image_Augmented'Unrestricted_Access); case Cl_Params.Command is when Parse => if Cl_Params.Repeat_Count = 1 then Parse_Data.Put (Parser); Parse_Data.Put (Parser.Lexer.Errors, Parser.Parsers.First.State_Ref.Errors, Parser.Parsers.First.State_Ref.Tree); end if; when Refactor => Parse_Data.Refactor (Parser.Parsers.First_State_Ref.Tree, Cl_Params.Refactor_Action, Cl_Params.Edit_Begin); end case; exception when WisiToken.Syntax_Error => Clean_Up; Put_Line ("(parse_error)"); when E : WisiToken.Parse_Error => Clean_Up; Put_Line ("(parse_error """ & Ada.Exceptions.Exception_Name (E) & " " & Ada.Exceptions.Exception_Message (E) & """)"); when E : others => -- includes Fatal_Error Clean_Up; Put_Line ("(error """ & Ada.Exceptions.Exception_Name (E) & " " & Ada.Exceptions.Exception_Message (E) & """)"); end; end loop; if Cl_Params.Repeat_Count > 1 then declare use Ada.Real_Time; Finish : constant Time := Clock; begin Put_Line ("Total time:" & Duration'Image (To_Duration (Finish - Start))); Put_Line ("per iteration:" & Duration'Image (To_Duration ((Finish - Start) / Cl_Params.Repeat_Count))); end; end if; end; exception when SAL.Parameter_Error | Finish => -- From Get_CL_Params; already handled. null; when E : others => Ada.Command_Line.Set_Exit_Status (Ada.Command_Line.Failure); New_Line (2); Put_Line ("(error ""unhandled exception: " & Ada.Exceptions.Exception_Name (E) & ": " & Ada.Exceptions.Exception_Message (E) & """)"); end Parse_File; end Run_Wisi_Common_Parse;

40.59944

118

0.567614

c707395435b9f7b7719f7443d3712c2b0adc5aa5

4,930

adb

Ada

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

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

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

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

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

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- T E M P D I R -- -- -- -- B o d y -- -- -- -- Copyright (C) 2003-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 GNAT.Directory_Operations; use GNAT.Directory_Operations; with Opt; use Opt; with Output; use Output; package body Tempdir is Tmpdir_Needs_To_Be_Displayed : Boolean := True; Tmpdir : constant String := "TMPDIR"; Temp_Dir : String_Access := new String'(""); ---------------------- -- Create_Temp_File -- ---------------------- procedure Create_Temp_File (FD : out File_Descriptor; Name : out Path_Name_Type) is File_Name : String_Access; Current_Dir : constant String := Get_Current_Dir; function Directory return String; -- Returns Temp_Dir.all if not empty, else return current directory --------------- -- Directory -- --------------- function Directory return String is begin if Temp_Dir'Length /= 0 then return Temp_Dir.all; else return Current_Dir; end if; end Directory; -- Start of processing for Create_Temp_File begin if Temp_Dir'Length /= 0 then -- In verbose mode, display once the value of TMPDIR, so that -- if temp files cannot be created, it is easier to understand -- where temp files are supposed to be created. if Verbose_Mode and then Tmpdir_Needs_To_Be_Displayed then Write_Str ("TMPDIR = """); Write_Str (Temp_Dir.all); Write_Line (""""); Tmpdir_Needs_To_Be_Displayed := False; end if; -- Change directory to TMPDIR before creating the temp file, -- then change back immediately to the previous directory. Change_Dir (Temp_Dir.all); Create_Temp_File (FD, File_Name); Change_Dir (Current_Dir); else Create_Temp_File (FD, File_Name); end if; if FD = Invalid_FD then Write_Line ("could not create temporary file in " & Directory); Name := No_Path; else declare Path_Name : constant String := Normalize_Pathname (Directory & Directory_Separator & File_Name.all); begin Name_Len := Path_Name'Length; Name_Buffer (1 .. Name_Len) := Path_Name; Name := Name_Find; Free (File_Name); end; end if; end Create_Temp_File; ------------------ -- Use_Temp_Dir -- ------------------ procedure Use_Temp_Dir (Status : Boolean) is Dir : String_Access; begin if Status then Dir := Getenv (Tmpdir); end if; Free (Temp_Dir); if Dir /= null and then Dir'Length > 0 and then Is_Absolute_Path (Dir.all) and then Is_Directory (Dir.all) then Temp_Dir := new String'(Normalize_Pathname (Dir.all)); else Temp_Dir := new String'(""); end if; Free (Dir); end Use_Temp_Dir; -- Start of elaboration for package Tempdir begin Use_Temp_Dir (Status => True); end Tempdir;

34.71831

78

0.488641

c748c35a874158da0d742a31ec6726d97278d19a

3,670

adb

Ada

src/wiki-filters-autolink.adb

jquorning/ada-wiki

21dcbeb3897499ee4b4a85353f8a782e154c0a43

[ "Apache-2.0" ]

18

2015-10-26T21:32:08.000Z

2021-11-30T10:38:51.000Z

src/wiki-filters-autolink.adb

jquorning/ada-wiki

21dcbeb3897499ee4b4a85353f8a782e154c0a43

[ "Apache-2.0" ]

2

2018-03-18T08:22:06.000Z

2022-02-16T22:15:05.000Z

src/wiki-filters-autolink.adb

jquorning/ada-wiki

21dcbeb3897499ee4b4a85353f8a782e154c0a43

[ "Apache-2.0" ]

2

2019-04-05T17:10:34.000Z

2022-02-13T20:50:56.000Z

----------------------------------------------------------------------- -- wiki-filters-autolink -- Autolink filter to identify links in wiki -- Copyright (C) 2016 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 Wiki.Helpers; package body Wiki.Filters.Autolink is -- ------------------------------ -- Find the position of the end of the link. -- Returns 0 if the content is not a link. -- ------------------------------ function Find_End_Link (Filter : in Autolink_Filter; Content : in Wiki.Strings.WString) return Natural is pragma Unreferenced (Filter); begin if Content'Length < 7 then return 0; elsif not Wiki.Helpers.Is_Url (Content) then return 0; else for Pos in Content'First + 4 .. Content'Last loop if Wiki.Helpers.Is_Space_Or_Newline (Content (Pos)) then return Pos - 1; end if; end loop; return Content'Last; end if; end Find_End_Link; -- ------------------------------ -- Add a text content with the given format to the document. Identify URLs in the text -- and transform them into links. For each link, call the Add_Link operation. The operation -- recognizes http:// https:// ftp:// ftps:// -- ------------------------------ overriding procedure Add_Text (Filter : in out Autolink_Filter; Document : in out Wiki.Documents.Document; Text : in Wiki.Strings.WString; Format : in Wiki.Format_Map) is Pos : Natural := Text'First; Start : Natural := Text'First; Last : Natural; C : Wiki.Strings.WChar; Check : Boolean := True; begin while Pos <= Text'Last loop C := Text (Pos); if Wiki.Helpers.Is_Space (C) then Check := True; Pos := Pos + 1; elsif Check then Last := Autolink_Filter'Class (Filter).Find_End_Link (Text (Pos .. Text'Last)); if Last > 0 then if Start /= Pos then Filter_Type (Filter).Add_Text (Document, Text (Start .. Pos - 1), Format); end if; declare Attr : Wiki.Attributes.Attribute_List; begin Wiki.Attributes.Append (Attr, String '("href"), Text (Pos .. Last)); Autolink_Filter'Class (Filter).Add_Link (Document, Text (Pos .. Last), Attr); end; Start := Last + 1; Pos := Start; else Check := False; Pos := Pos + 1; end if; else Pos := Pos + 1; end if; end loop; if Start <= Text'Last then Filter_Type (Filter).Add_Text (Document, Text (Start .. Text'Last), Format); end if; end Add_Text; end Wiki.Filters.Autolink;

39.042553

97

0.524523

57ceb961dc6281ed29e958f9115904ddde57e9fc

10,062

adb

Ada

src/ncurses-5.5/Ada95/samples/ncurses2-getch_test.adb

erwinchang/minicom

3fe2ba7d8e8475c199b493a2b99cd3c690f6ea4f

[ "MIT" ]

null

src/ncurses-5.5/Ada95/samples/ncurses2-getch_test.adb

erwinchang/minicom

3fe2ba7d8e8475c199b493a2b99cd3c690f6ea4f

[ "MIT" ]

null

src/ncurses-5.5/Ada95/samples/ncurses2-getch_test.adb

erwinchang/minicom

3fe2ba7d8e8475c199b493a2b99cd3c690f6ea4f

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT ncurses Binding Samples -- -- -- -- ncurses -- -- -- -- B O D Y -- -- -- ------------------------------------------------------------------------------ -- Copyright (c) 2000,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: Eugene V. Melaragno <[email protected]> 2000 -- Version Control -- $Revision: 1.5 $ -- $Date: 2004/08/21 21:37:00 $ -- Binding Version 01.00 ------------------------------------------------------------------------------ -- Character input test -- test the keypad feature with ncurses2.util; use ncurses2.util; with Terminal_Interface.Curses; use Terminal_Interface.Curses; with Terminal_Interface.Curses.Mouse; use Terminal_Interface.Curses.Mouse; with Ada.Characters.Handling; with Ada.Strings.Bounded; with ncurses2.genericPuts; procedure ncurses2.getch_test is use Int_IO; function mouse_decode (ep : Mouse_Event) return String; function mouse_decode (ep : Mouse_Event) return String is Y : Line_Position; X : Column_Position; Button : Mouse_Button; State : Button_State; package BS is new Ada.Strings.Bounded.Generic_Bounded_Length (200); use BS; buf : Bounded_String := To_Bounded_String (""); begin -- Note that these bindings do not allow -- two button states, -- The C version can print {click-1, click-3} for example. -- They also don't have the 'id' or z coordinate. Get_Event (ep, Y, X, Button, State); -- TODO Append (buf, "id "); from C version Append (buf, "at ("); Append (buf, Column_Position'Image (X)); Append (buf, ", "); Append (buf, Line_Position'Image (Y)); Append (buf, ") state"); Append (buf, Mouse_Button'Image (Button)); Append (buf, " = "); Append (buf, Button_State'Image (State)); return To_String (buf); end mouse_decode; buf : String (1 .. 1024); -- TODO was BUFSIZE n : Integer; c : Key_Code; blockflag : Timeout_Mode := Blocking; firsttime : Boolean := True; tmp2 : Event_Mask; tmp6 : String (1 .. 6); tmp20 : String (1 .. 20); x : Column_Position; y : Line_Position; tmpx : Integer; incount : Integer := 0; begin Refresh; tmp2 := Start_Mouse (All_Events); Add (Str => "Delay in 10ths of a second (<CR> for blocking input)? "); Set_Echo_Mode (SwitchOn => True); Get (Str => buf); Set_Echo_Mode (SwitchOn => False); Set_NL_Mode (SwitchOn => False); if Ada.Characters.Handling.Is_Digit (buf (1)) then Get (Item => n, From => buf, Last => tmpx); Set_Timeout_Mode (Mode => Delayed, Amount => n * 100); blockflag := Delayed; end if; c := Character'Pos ('?'); Set_Raw_Mode (SwitchOn => True); loop if not firsttime then Add (Str => "Key pressed: "); Put (tmp6, Integer (c), 8); Add (Str => tmp6); Add (Ch => ' '); if c = Key_Mouse then declare event : Mouse_Event; begin event := Get_Mouse; Add (Str => "KEY_MOUSE, "); Add (Str => mouse_decode (event)); Add (Ch => newl); end; elsif c >= Key_Min then Key_Name (c, tmp20); Add (Str => tmp20); -- I used tmp and got bitten by the length problem:-> Add (Ch => newl); elsif c > 16#80# then -- TODO fix, use constant if possible declare c2 : constant Character := Character'Val (c mod 16#80#); begin if Ada.Characters.Handling.Is_Graphic (c2) then Add (Str => "M-"); Add (Ch => c2); else Add (Str => "M-"); Add (Str => Un_Control ((Ch => c2, Color => Color_Pair'First, Attr => Normal_Video))); end if; Add (Str => " (high-half character)"); Add (Ch => newl); end; else declare c2 : constant Character := Character'Val (c mod 16#80#); begin if Ada.Characters.Handling.Is_Graphic (c2) then Add (Ch => c2); Add (Str => " (ASCII printable character)"); Add (Ch => newl); else Add (Str => Un_Control ((Ch => c2, Color => Color_Pair'First, Attr => Normal_Video))); Add (Str => " (ASCII control character)"); Add (Ch => newl); end if; end; end if; -- TODO I am not sure why this was in the C version -- the delay statement scroll anyway. Get_Cursor_Position (Line => y, Column => x); if y >= Lines - 1 then Move_Cursor (Line => 0, Column => 0); end if; Clear_To_End_Of_Line; end if; firsttime := False; if c = Character'Pos ('g') then declare package p is new ncurses2.genericPuts (1024); use p; use p.BS; timedout : Boolean := False; boundedbuf : Bounded_String; begin Add (Str => "getstr test: "); Set_Echo_Mode (SwitchOn => True); -- Note that if delay mode is set -- Get can raise an exception. -- The C version would print the string it had so far -- also TODO get longer length string, like the C version declare begin myGet (Str => boundedbuf); exception when Curses_Exception => Add (Str => "Timed out."); Add (Ch => newl); timedout := True; end; -- note that the Ada Get will stop reading at 1024. if not timedout then Set_Echo_Mode (SwitchOn => False); Add (Str => " I saw '"); myAdd (Str => boundedbuf); Add (Str => "'."); Add (ch => newl); end if; end; elsif c = Character'Pos ('s') then ShellOut (True); elsif c = Character'Pos ('x') or c = Character'Pos ('q') or (c = Key_None and blockflag = Blocking) then exit; elsif c = Character'Pos ('?') then Add (Str => "Type any key to see its keypad value. Also:"); Add (Ch => newl); Add (Str => "g -- triggers a getstr test"); Add (Ch => newl); Add (Str => "s -- shell out"); Add (Ch => newl); Add (Str => "q -- quit"); Add (Ch => newl); Add (Str => "? -- repeats this help message"); Add (Ch => newl); end if; loop c := Getchar; exit when c /= Key_None; if blockflag /= Blocking then Put (tmp6, incount); -- argh string length! Add (Str => tmp6); Add (Str => ": input timed out"); Add (Ch => newl); else Put (tmp6, incount); Add (Str => tmp6); Add (Str => ": input error"); Add (Ch => newl); exit; end if; incount := incount + 1; end loop; end loop; End_Mouse (tmp2); Set_Timeout_Mode (Mode => Blocking, Amount => 0); -- amount is ignored Set_Raw_Mode (SwitchOn => False); Set_NL_Mode (SwitchOn => True); Erase; End_Windows; end ncurses2.getch_test;

39.614173

78

0.474359

c7669920f7ac91bcb45bbd0247c80c47cab90463

2,676

ads

Ada

Util/llvm/bindings/ada/executionengine/llvm_execution_engine.ads

ianloic/unladen-swallow

28148f4ddbb3d519042de1f9fc9f1356fdd31e31

[ "PSF-2.0" ]

5

2020-06-30T05:06:40.000Z

2021-05-24T08:38:33.000Z

Util/llvm/bindings/ada/executionengine/llvm_execution_engine.ads

ianloic/unladen-swallow

28148f4ddbb3d519042de1f9fc9f1356fdd31e31

[ "PSF-2.0" ]

null

Util/llvm/bindings/ada/executionengine/llvm_execution_engine.ads

ianloic/unladen-swallow

28148f4ddbb3d519042de1f9fc9f1356fdd31e31

[ "PSF-2.0" ]

2

2015-10-01T18:28:20.000Z

2020-09-09T16:25:27.000Z

-- This file is generated by SWIG. Do *not* modify by hand. -- with Interfaces.C.Extensions; package LLVM_execution_Engine is -- LLVMOpaqueGenericValue -- type LLVMOpaqueGenericValue is new Interfaces.C.Extensions.opaque_structure_def; type LLVMOpaqueGenericValue_array is array (Interfaces.C.size_t range <>) of aliased LLVM_execution_Engine.LLVMOpaqueGenericValue; type LLVMOpaqueGenericValue_view is access all LLVM_execution_Engine.LLVMOpaqueGenericValue; -- LLVMGenericValueRef -- type LLVMGenericValueRef is access all LLVM_execution_Engine.LLVMOpaqueGenericValue; type LLVMGenericValueRef_array is array (Interfaces.C.size_t range <>) of aliased LLVM_execution_Engine.LLVMGenericValueRef; type LLVMGenericValueRef_view is access all LLVM_execution_Engine.LLVMGenericValueRef; -- LLVMOpaqueExecutionEngine -- type LLVMOpaqueExecutionEngine is new Interfaces.C.Extensions.opaque_structure_def; type LLVMOpaqueExecutionEngine_array is array (Interfaces.C.size_t range <>) of aliased LLVM_execution_Engine.LLVMOpaqueExecutionEngine; type LLVMOpaqueExecutionEngine_view is access all LLVM_execution_Engine.LLVMOpaqueExecutionEngine; -- LLVMExecutionEngineRef -- type LLVMExecutionEngineRef is access all LLVM_execution_Engine.LLVMOpaqueExecutionEngine; type LLVMExecutionEngineRef_array is array (Interfaces.C.size_t range <>) of aliased LLVM_execution_Engine.LLVMExecutionEngineRef; type LLVMExecutionEngineRef_view is access all LLVM_execution_Engine.LLVMExecutionEngineRef; -- LLVMTargetDataRef -- type LLVMTargetDataRef is new Interfaces.C.Extensions.opaque_structure_def; type LLVMTargetDataRef_array is array (Interfaces.C.size_t range <>) of aliased LLVM_execution_Engine.LLVMTargetDataRef; type LLVMTargetDataRef_view is access all LLVM_execution_Engine.LLVMTargetDataRef; -- GenericValue -- type GenericValue is new Interfaces.C.Extensions.opaque_structure_def; type GenericValue_array is array (Interfaces.C.size_t range <>) of aliased LLVM_execution_Engine.GenericValue; type GenericValue_view is access all LLVM_execution_Engine.GenericValue; -- ExecutionEngine -- type ExecutionEngine is new Interfaces.C.Extensions.incomplete_class_def; type ExecutionEngine_array is array (Interfaces.C.size_t range <>) of aliased LLVM_execution_Engine.ExecutionEngine; type ExecutionEngine_view is access all LLVM_execution_Engine.ExecutionEngine; end LLVM_execution_Engine;

29.406593

78

0.766816

29d8441980093521d4124e0a4a1c05529a88c8f0

782

ads

Ada

source/asis/spec/ada-strings-wide_wide_hash.ads

faelys/gela-asis

48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253

[ "BSD-3-Clause" ]

4

2016-02-05T15:51:56.000Z

2022-03-25T20:38:32.000Z

source/asis/spec/ada-strings-wide_wide_hash.ads

faelys/gela-asis

48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253

[ "BSD-3-Clause" ]

null

source/asis/spec/ada-strings-wide_wide_hash.ads

faelys/gela-asis

48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- A d a r u n - t i m e s p e c i f i c a t i o n -- -- ASIS implementation for Gela project, a portable Ada compiler -- -- http://gela.ada-ru.org -- -- - - - - - - - - - - - - - - - -- -- Read copyright and license at the end of ada.ads file -- ------------------------------------------------------------------------------ -- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $ with Ada.Containers; function Ada.Strings.Wide_Wide_Hash (Key : in Wide_Wide_String) return Ada.Containers.Hash_Type; pragma Pure (Wide_Wide_Hash);

52.133333

78

0.38491

a1c72daae876358cfa0f2d95bc2e6827ca2980bf

230

adb

Ada

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- { dg-do compile } procedure pointer_array is type Node; type Node_Ptr is access Node; type Node is array (1..10) of Node_Ptr; procedure Process (N : Node_Ptr) is begin null; end; begin null; end;

13.529412

42

0.634783

50b9bc50fab55d71d07a45cd9ad1389c935b21a3

5,374

ads

Ada

gcc-gcc-7_3_0-release/gcc/ada/a-exetim-default.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/ada/a-exetim-default.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/ada/a-exetim-default.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . E X E C U T I O N _ T I M E -- -- -- -- S p e c -- -- -- -- Copyright (C) 2007-2015, Free Software Foundation, Inc. -- -- -- -- This specification is derived from the Ada Reference Manual for use with -- -- GNAT. The copyright notice above, and the license provisions that follow -- -- apply solely to the contents of the part following the private keyword. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Ada.Task_Identification; with Ada.Real_Time; package Ada.Execution_Time with SPARK_Mode is type CPU_Time is private; CPU_Time_First : constant CPU_Time; CPU_Time_Last : constant CPU_Time; CPU_Time_Unit : constant := Ada.Real_Time.Time_Unit; CPU_Tick : constant Ada.Real_Time.Time_Span; use type Ada.Task_Identification.Task_Id; function Clock (T : Ada.Task_Identification.Task_Id := Ada.Task_Identification.Current_Task) return CPU_Time with Volatile_Function, Global => Ada.Real_Time.Clock_Time, Pre => T /= Ada.Task_Identification.Null_Task_Id; function "+" (Left : CPU_Time; Right : Ada.Real_Time.Time_Span) return CPU_Time with Global => null; function "+" (Left : Ada.Real_Time.Time_Span; Right : CPU_Time) return CPU_Time with Global => null; function "-" (Left : CPU_Time; Right : Ada.Real_Time.Time_Span) return CPU_Time with Global => null; function "-" (Left : CPU_Time; Right : CPU_Time) return Ada.Real_Time.Time_Span with Global => null; function "<" (Left, Right : CPU_Time) return Boolean with Global => null; function "<=" (Left, Right : CPU_Time) return Boolean with Global => null; function ">" (Left, Right : CPU_Time) return Boolean with Global => null; function ">=" (Left, Right : CPU_Time) return Boolean with Global => null; procedure Split (T : CPU_Time; SC : out Ada.Real_Time.Seconds_Count; TS : out Ada.Real_Time.Time_Span) with Global => null; function Time_Of (SC : Ada.Real_Time.Seconds_Count; TS : Ada.Real_Time.Time_Span := Ada.Real_Time.Time_Span_Zero) return CPU_Time with Global => null; Interrupt_Clocks_Supported : constant Boolean := False; Separate_Interrupt_Clocks_Supported : constant Boolean := False; pragma Warnings (Off, "check will fail at run time"); function Clock_For_Interrupts return CPU_Time with Volatile_Function, Global => Ada.Real_Time.Clock_Time, Pre => Interrupt_Clocks_Supported; pragma Warnings (On, "check will fail at run time"); private pragma SPARK_Mode (Off); type CPU_Time is new Ada.Real_Time.Time; CPU_Time_First : constant CPU_Time := CPU_Time (Ada.Real_Time.Time_First); CPU_Time_Last : constant CPU_Time := CPU_Time (Ada.Real_Time.Time_Last); CPU_Tick : constant Ada.Real_Time.Time_Span := Ada.Real_Time.Tick; pragma Import (Intrinsic, "<"); pragma Import (Intrinsic, "<="); pragma Import (Intrinsic, ">"); pragma Import (Intrinsic, ">="); end Ada.Execution_Time;

40.104478

78

0.530517

22a33335656a35a904ab882cb15eec79ad476cb1

3,366

adb

Ada

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

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

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

null

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

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

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

null

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

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

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

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S Y S T E M . V A L _ D E C -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2019, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with System.Val_Real; use System.Val_Real; package body System.Val_Dec is ------------------ -- Scan_Decimal -- ------------------ -- For decimal types where Size < Integer'Size, it is fine to use -- the floating-point circuit, since it certainly has sufficient -- precision for any reasonable hardware, and we just don't support -- things on junk hardware. function Scan_Decimal (Str : String; Ptr : not null access Integer; Max : Integer; Scale : Integer) return Integer is Val : Long_Long_Float; begin Val := Scan_Real (Str, Ptr, Max); return Integer (Val * 10.0 ** Scale); end Scan_Decimal; ------------------- -- Value_Decimal -- ------------------- -- Again, we use the real circuit for this purpose function Value_Decimal (Str : String; Scale : Integer) return Integer is begin return Integer (Value_Real (Str) * 10.0 ** Scale); end Value_Decimal; end System.Val_Dec;

48.782609

78

0.434343

41b8cef4b492245798d707ee3e87cb0007b5622f

6,114

ads

Ada

source/league/ucd/matreshka-internals-unicode-ucd-core_01bc.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/league/ucd/matreshka-internals-unicode-ucd-core_01bc.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/league/ucd/matreshka-internals-unicode-ucd-core_01bc.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Localization, Internationalization, Globalization for Ada -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2012-2015, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ pragma Restrictions (No_Elaboration_Code); -- GNAT: enforce generation of preinitialized data section instead of -- generation of elaboration code. package Matreshka.Internals.Unicode.Ucd.Core_01BC is pragma Preelaborate; Group_01BC : aliased constant Core_Second_Stage := (16#6B# .. 16#6F# => -- 01BC6B .. 01BC6F (Unassigned, Neutral, Other, Other, Other, Unknown, (others => False)), 16#7D# .. 16#7F# => -- 01BC7D .. 01BC7F (Unassigned, Neutral, Other, Other, Other, Unknown, (others => False)), 16#89# .. 16#8F# => -- 01BC89 .. 01BC8F (Unassigned, Neutral, Other, Other, Other, Unknown, (others => False)), 16#9A# .. 16#9B# => -- 01BC9A .. 01BC9B (Unassigned, Neutral, Other, Other, Other, Unknown, (others => False)), 16#9C# => -- 01BC9C (Other_Symbol, Neutral, Other, Other, Other, Alphabetic, (Grapheme_Base => True, others => False)), 16#9D# => -- 01BC9D (Nonspacing_Mark, Neutral, Extend, Extend, Extend, Combining_Mark, (Case_Ignorable | Grapheme_Extend | ID_Continue | XID_Continue => True, others => False)), 16#9E# => -- 01BC9E (Nonspacing_Mark, Neutral, Extend, Extend, Extend, Combining_Mark, (Other_Alphabetic | Alphabetic | Case_Ignorable | Grapheme_Extend | ID_Continue | XID_Continue => True, others => False)), 16#9F# => -- 01BC9F (Other_Punctuation, Neutral, Other, Other, S_Term, Break_After, (STerm | Terminal_Punctuation | Grapheme_Base => True, others => False)), 16#A0# .. 16#A3# => -- 01BCA0 .. 01BCA3 (Format, Neutral, Control, Format, Format, Combining_Mark, (Case_Ignorable | Default_Ignorable_Code_Point | Changes_When_NFKC_Casefolded => True, others => False)), 16#A4# .. 16#FF# => -- 01BCA4 .. 01BCFF (Unassigned, Neutral, Other, Other, Other, Unknown, (others => False)), others => (Other_Letter, Neutral, Other, A_Letter, O_Letter, Alphabetic, (Alphabetic | Grapheme_Base | ID_Continue | ID_Start | XID_Continue | XID_Start => True, others => False))); end Matreshka.Internals.Unicode.Ucd.Core_01BC;

49.707317

78

0.444226

22429a2fe71f1bb3fb6ca3aa693ec98b5d62662e

116

ads

Ada

tests/stories-test_data-tests-finishedstories_container.ads

thindil/steamsky

d5d7fea622f7994c91017c4cd7ba5e188153556c

[ "TCL", "MIT" ]

80

2017-04-08T23:14:07.000Z

2022-02-10T22:30:51.000Z

tests/stories-test_data-tests-finishedstories_container.ads

thindil/steamsky

d5d7fea622f7994c91017c4cd7ba5e188153556c

[ "TCL", "MIT" ]

89

2017-06-24T08:18:26.000Z

2021-11-12T04:37:36.000Z

tests/stories-test_data-tests-finishedstories_container.ads

thindil/steamsky

d5d7fea622f7994c91017c4cd7ba5e188153556c

[ "TCL", "MIT" ]

9

2018-04-14T16:37:25.000Z

2020-03-21T14:33:49.000Z

package Stories.Test_Data.Tests.FinishedStories_Container is end Stories.Test_Data.Tests.FinishedStories_Container;

38.666667

60

0.896552

22b445efe44286fa8861a77ee32c0236e3fce127

5,394

adb

Ada

src/ado-caches-discrete.adb

My-Colaborations/ada-ado

cebf1f9b38c0c259c44935e8bca05a5bff12aace

[ "Apache-2.0" ]

null

src/ado-caches-discrete.adb

My-Colaborations/ada-ado

cebf1f9b38c0c259c44935e8bca05a5bff12aace

[ "Apache-2.0" ]

null

src/ado-caches-discrete.adb

My-Colaborations/ada-ado

cebf1f9b38c0c259c44935e8bca05a5bff12aace

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- ado-cache-discrete -- Simple cache management for discrete types -- Copyright (C) 2017 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- package body ADO.Caches.Discrete is -- ------------------------------ -- Expand the name into a target parameter value to be used in the SQL query. -- The Expander can return a T_NULL when a value is not found or -- it may also raise some exception. -- ------------------------------ overriding function Expand (Instance : in out Cache_Type; Name : in String) return ADO.Parameters.Parameter is Value : Element_Type; begin Value := Instance.Find (Name); return ADO.Parameters.Parameter '(T => ADO.Parameters.T_LONG_INTEGER, Len => 0, Value_Len => 0, Position => 0, Name => "", Long_Num => Element_Type'Pos (Value)); end Expand; -- ------------------------------ -- Find the value associated with the given name. -- Raises the No_Value exception if no such mapping exist. -- ------------------------------ function Find (Cache : in out Cache_Type; Name : in String) return Element_Type is begin return Cache.Controller.Find (Name); end Find; -- ------------------------------ -- Insert the value associated with the given name in the cache. -- When <tt>Override</tt> is set, override existing values otherwise raise an exception. -- ------------------------------ procedure Insert (Cache : in out Cache_Type; Name : in String; Value : in Element_Type; Override : in Boolean := False) is begin Cache.Controller.Insert (Name, Value, Override); end Insert; -- ------------------------------ -- Delete the value associated with the given name in the cache. -- Raise the No_Value exception if the value is not found and <tt>Ignore</tt> is not set. -- ------------------------------ procedure Delete (Cache : in out Cache_Type; Name : in String; Ignore : in Boolean := False) is begin Cache.Controller.Delete (Name, Ignore); end Delete; -- ------------------------------ -- Initialize the entity cache by reading the database entity table. -- ------------------------------ procedure Initialize (Cache : in out Cache_Type; Session : in out ADO.Sessions.Session'Class) is begin null; end Initialize; protected body Cache_Controller is -- ------------------------------ -- Find the value associated with the given name. -- Raises the No_Value exception if no such mapping exist. -- ------------------------------ function Find (Name : in String) return Element_Type is Pos : constant Cache_Map.Cursor := Values.Find (Name); begin if Cache_Map.Has_Element (Pos) then return Cache_Map.Element (Pos); else Log.Info ("Unknown cached value {0}", Name); raise No_Value with "Value '" & Name & "' not found"; end if; end Find; -- ------------------------------ -- Insert the value associated with the given name in the cache. -- When <tt>Override</tt> is set, override existing values otherwise raise an exception. -- ------------------------------ procedure Insert (Name : in String; Value : in Element_Type; Override : in Boolean := False) is Pos : constant Cache_Map.Cursor := Values.Find (Name); begin if Cache_Map.Has_Element (Pos) then if not Override then raise No_Value; end if; Values.Replace_Element (Pos, Value); else Values.Insert (Name, Value); end if; end Insert; -- ------------------------------ -- Delete the value associated with the given name in the cache. -- Raise the No_Value exception if the value is not found and <tt>Ignore</tt> is not set. -- ------------------------------ procedure Delete (Name : in String; Ignore : in Boolean := False) is Pos : Cache_Map.Cursor := Values.Find (Name); begin if Cache_Map.Has_Element (Pos) then Values.Delete (Pos); elsif not Ignore then raise No_Value; end if; end Delete; end Cache_Controller; end ADO.Caches.Discrete;

39.955556

96

0.523545

3ddb9be17f7e6b784449cce25f46e93a11e438ee

5,824

ads

Ada

source/amf/uml/amf-standard_profile_l2-implementation_classes-collections.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/uml/amf-standard_profile_l2-implementation_classes-collections.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/uml/amf-standard_profile_l2-implementation_classes-collections.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

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

63.304348

132

0.58465

59cab33c64671416ace792e3dd00dcb97efa0760

1,410

ads

Ada

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

charlie5/cBound

741be08197a61ad9c72553e3302f3b669902216d

[ "0BSD" ]

2

2015-11-12T11:16:20.000Z

2021-08-24T22:32:04.000Z

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

charlie5/cBound

741be08197a61ad9c72553e3302f3b669902216d

[ "0BSD" ]

1

2018-06-05T05:19:35.000Z

2021-11-20T01:13:23.000Z

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

charlie5/cBound

741be08197a61ad9c72553e3302f3b669902216d

[ "0BSD" ]

null

-- This file is generated by SWIG. Please do not modify by hand. -- with xcb.xcb_glx_generic_error_t; with Interfaces.C; with Interfaces.C.Pointers; package xcb.xcb_glx_bad_render_request_error_t is -- Item -- subtype Item is xcb.xcb_glx_generic_error_t.Item; -- Item_Array -- type Item_Array is array (Interfaces.C .size_t range <>) of aliased xcb.xcb_glx_bad_render_request_error_t .Item; -- Pointer -- package C_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_glx_bad_render_request_error_t.Item, Element_Array => xcb.xcb_glx_bad_render_request_error_t.Item_Array, Default_Terminator => (others => <>)); subtype Pointer is C_Pointers.Pointer; -- Pointer_Array -- type Pointer_Array is array (Interfaces.C .size_t range <>) of aliased xcb.xcb_glx_bad_render_request_error_t .Pointer; -- Pointer_Pointer -- package C_Pointer_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_glx_bad_render_request_error_t.Pointer, Element_Array => xcb.xcb_glx_bad_render_request_error_t.Pointer_Array, Default_Terminator => null); subtype Pointer_Pointer is C_Pointer_Pointers.Pointer; end xcb.xcb_glx_bad_render_request_error_t;

28.2

78

0.687943

5884bf8f9e6fe48f11725a4beaf2696b2f566ad2

865

adb

Ada

contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/same_enum/a.adb

TheSledgeHammer/2.11BSD

fe61f0b9aaa273783cd027c7b5ec77e95ead2153

[ "BSD-3-Clause" ]

3

2021-05-04T17:09:06.000Z

2021-10-04T07:19:26.000Z

contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/same_enum/a.adb

TheSledgeHammer/2.11BSD

fe61f0b9aaa273783cd027c7b5ec77e95ead2153

[ "BSD-3-Clause" ]

null

contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/same_enum/a.adb

TheSledgeHammer/2.11BSD

fe61f0b9aaa273783cd027c7b5ec77e95ead2153

[ "BSD-3-Clause" ]

null

-- Copyright 2011-2020 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- This program is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. with Pck; use Pck; procedure A is FC : Color := Red; SC : Color := Green; begin Do_Nothing (FC'Address); Do_Nothing (SC'Address); end A;

34.6

73

0.719075

125445ddac5cc70869f3324d7a82e4d1d74ddc44

4,127

adb

Ada

bb-runtimes/src/s-textio__sam4s.adb

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/src/s-textio__sam4s.adb

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/src/s-textio__sam4s.adb

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . T E X T _ I O -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2014, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- Minimal version of Text_IO body for use on SAM4S, using UART1 with System.SAM4S; use System.SAM4S; package body System.Text_IO is Baudrate : constant := 115_200; -- Bitrate to use --------- -- Get -- --------- function Get return Character is (Character'Val (UART1.UART_RHR and 16#FF#)); ---------------- -- Initialize -- ---------------- procedure Initialize is PB2 : constant := 2 ** 2; -- RX line PB3 : constant := 2 ** 3; -- TX line Uart_Ports : constant := PB2 + PB3; begin Initialized := True; -- Init uart1 -- Power-up clocks PMC.PMC_PCER0 := 2 ** UART1_ID + 2 ** PIOB_ID; -- Setup IO pins PIOB.PDR := Uart_Ports; PIOB.ODR := Uart_Ports; PIOB.PUER := PB3; PIOB.MDDR := Uart_Ports; PIOB.ABCDSR1 := PIOB.ABCDSR1 and not Uart_Ports; PIOB.ABCDSR2 := PIOB.ABCDSR2 and not Uart_Ports; UART1.UART_BRGR := 120_000_000 / (16 * Baudrate); UART1.UART_MR := UART_MR.CHMODE_NORMAL or UART_MR.PAR_NO; UART1.UART_CR := UART_CR.TXEN or UART_CR.RXEN; end Initialize; ----------------- -- Is_Tx_Ready -- ----------------- function Is_Tx_Ready return Boolean is ((UART1.UART_SR and UART_SR.TXRDY) /= 0); ----------------- -- Is_Rx_Ready -- ----------------- function Is_Rx_Ready return Boolean is ((UART1.UART_SR and UART_SR.RXRDY) /= 0); --------- -- Put -- --------- procedure Put (C : Character) is begin UART1.UART_THR := Character'Pos (C); end Put; ---------------------------- -- Use_Cr_Lf_For_New_Line -- ---------------------------- function Use_Cr_Lf_For_New_Line return Boolean is (True); end System.Text_IO;

37.518182

78

0.438333

58d9914d5dd2eca01d48814836c397685d05581c

9,233

adb

Ada

source/league/league-json-objects.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/league/league-json-objects.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/league/league-json-objects.adb

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 © 2013-2014, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ with League.JSON.Documents.Internals; with League.JSON.Values.Internals; with Matreshka.JSON_Documents; package body League.JSON.Objects is ------------ -- Adjust -- ------------ overriding procedure Adjust (Self : in out JSON_Object) is begin Matreshka.JSON_Types.Reference (Self.Data); end Adjust; -------------- -- Contains -- -------------- function Contains (Self : JSON_Object'Class; Key : League.Strings.Universal_String) return Boolean is begin return Self.Data.Values.Contains (Key); end Contains; -------------- -- Finalize -- -------------- overriding procedure Finalize (Self : in out JSON_Object) is use type Matreshka.JSON_Types.Shared_JSON_Object_Access; begin if Self.Data /= null then Matreshka.JSON_Types.Dereference (Self.Data); end if; end Finalize; ------------ -- Insert -- ------------ procedure Insert (Self : in out JSON_Object'Class; Key : League.Strings.Universal_String; Value : League.JSON.Values.JSON_Value) is New_Value : constant Matreshka.JSON_Types.Shared_JSON_Value_Access := League.JSON.Values.Internals.Internal (Value); Old_Value : Matreshka.JSON_Types.Shared_JSON_Value_Access; Position : Matreshka.JSON_Types.Value_Maps.Cursor; begin Matreshka.JSON_Types.Mutate (Self.Data); Position := Self.Data.Values.Find (Key); Matreshka.JSON_Types.Reference (New_Value); if Matreshka.JSON_Types.Value_Maps.Has_Element (Position) then Old_Value := Matreshka.JSON_Types.Value_Maps.Element (Position); Matreshka.JSON_Types.Dereference (Old_Value); Self.Data.Values.Replace_Element (Position, New_Value); else Self.Data.Values.Insert (Key, New_Value); end if; end Insert; -------------- -- Is_Empty -- -------------- function Is_Empty (Self : JSON_Object'Class) return Boolean is begin return Self.Data.Values.Is_Empty; end Is_Empty; ---------- -- Keys -- ---------- function Keys (Self : JSON_Object'Class) return League.String_Vectors.Universal_String_Vector is Position : Matreshka.JSON_Types.Value_Maps.Cursor := Self.Data.Values.First; Result : League.String_Vectors.Universal_String_Vector; begin while Matreshka.JSON_Types.Value_Maps.Has_Element (Position) loop Result.Append (Matreshka.JSON_Types.Value_Maps.Key (Position)); Matreshka.JSON_Types.Value_Maps.Next (Position); end loop; return Result; end Keys; ------------ -- Length -- ------------ function Length (Self : JSON_Object'Class) return Natural is begin return Natural (Self.Data.Values.Length); end Length; ------------ -- Remove -- ------------ procedure Remove (Self : in out JSON_Object'Class; Key : League.Strings.Universal_String) is Position : Matreshka.JSON_Types.Value_Maps.Cursor; Old_Value : Matreshka.JSON_Types.Shared_JSON_Value_Access; begin Matreshka.JSON_Types.Mutate (Self.Data); Position := Self.Data.Values.Find (Key); if Matreshka.JSON_Types.Value_Maps.Has_Element (Position) then Old_Value := Matreshka.JSON_Types.Value_Maps.Element (Position); Matreshka.JSON_Types.Dereference (Old_Value); Self.Data.Values.Delete (Position); end if; end Remove; ---------- -- Take -- ---------- function Take (Self : in out JSON_Object'Class; Key : League.Strings.Universal_String) return League.JSON.Values.JSON_Value is Position : Matreshka.JSON_Types.Value_Maps.Cursor; Old_Value : Matreshka.JSON_Types.Shared_JSON_Value_Access; begin Matreshka.JSON_Types.Mutate (Self.Data); Position := Self.Data.Values.Find (Key); if Matreshka.JSON_Types.Value_Maps.Has_Element (Position) then Old_Value := Matreshka.JSON_Types.Value_Maps.Element (Position); Self.Data.Values.Delete (Position); return League.JSON.Values.Internals.Wrap (Old_Value); else return League.JSON.Values.Empty_JSON_Value; end if; end Take; ---------------------- -- To_JSON_Document -- ---------------------- function To_JSON_Document (Self : JSON_Object'Class) return League.JSON.Documents.JSON_Document is begin Matreshka.JSON_Types.Reference (Self.Data); return League.JSON.Documents.Internals.Wrap (new Matreshka.JSON_Documents.Shared_JSON_Document' (Counter => <>, Array_Value => null, Object_Value => Self.Data)); end To_JSON_Document; ------------------- -- To_JSON_Value -- ------------------- function To_JSON_Value (Self : JSON_Object'Class) return League.JSON.Values.JSON_Value is begin Matreshka.JSON_Types.Reference (Self.Data); return League.JSON.Values.Internals.Wrap (new Matreshka.JSON_Types.Shared_JSON_Value' (Counter => <>, Value => (Kind => Matreshka.JSON_Types.Object_Value, Object_Value => Self.Data))); end To_JSON_Value; ----------- -- Value -- ----------- function Value (Self : JSON_Object'Class; Key : League.Strings.Universal_String) return League.JSON.Values.JSON_Value is Position : constant Matreshka.JSON_Types.Value_Maps.Cursor := Self.Data.Values.Find (Key); begin if Matreshka.JSON_Types.Value_Maps.Has_Element (Position) then return League.JSON.Values.Internals.Create (Matreshka.JSON_Types.Value_Maps.Element (Position)); else return League.JSON.Values.Empty_JSON_Value; end if; end Value; end League.JSON.Objects;

35.648649

78

0.541861

22222793887d288540efc0a5c092baed405978b7

908

ads

Ada

tier-1/fann/source/thin/fann_c-user_function.ads

charlie5/cBound

741be08197a61ad9c72553e3302f3b669902216d

[ "0BSD" ]

2

2015-11-12T11:16:20.000Z

2021-08-24T22:32:04.000Z

tier-1/fann/source/thin/fann_c-user_function.ads

charlie5/cBound

741be08197a61ad9c72553e3302f3b669902216d

[ "0BSD" ]

1

2018-06-05T05:19:35.000Z

2021-11-20T01:13:23.000Z

tier-1/fann/source/thin/fann_c-user_function.ads

charlie5/cBound

741be08197a61ad9c72553e3302f3b669902216d

[ "0BSD" ]

null

-- This file is generated by SWIG. Please do *not* modify by hand. -- with fann_c.Pointers; with interfaces.c; with interfaces.C; package fann_c.user_function is -- Item -- type Item is access procedure (arg_5_1 : in interfaces.c.unsigned; arg_5_2 : in interfaces.c.unsigned; arg_5_3 : in interfaces.c.unsigned; arg_5_4 : in fann_c.Pointers.fann_type_Pointer; arg_5_5 : in fann_c.Pointers.fann_type_Pointer); pragma convention (C, Item); -- Items -- type Items is array (interfaces.C.Size_t range <>) of aliased fann_c.user_function.Item; -- Pointer -- type Pointer is access all fann_c.user_function.Item; -- Pointers -- type Pointers is array (interfaces.C.Size_t range <>) of aliased fann_c.user_function.Pointer; -- Pointer_Pointer -- type Pointer_Pointer is access all fann_c.user_function.Pointer; end fann_c.user_function;

17.461538

97

0.707048

57c164ff4e1b98050128a872fa57a9c423c9bf8a

1,682

ads

Ada

src/security-auth-oauth-github.ads

jquorning/ada-security

b9aa8e7deffaf71d50d501e284b821b8b0f942c3

[ "Apache-2.0" ]

19

2015-01-18T23:04:59.000Z

2021-11-30T10:39:10.000Z

src/security-auth-oauth-github.ads

jquorning/ada-security

b9aa8e7deffaf71d50d501e284b821b8b0f942c3

[ "Apache-2.0" ]

4

2020-08-06T15:37:51.000Z

2022-02-04T20:19:39.000Z

src/security-auth-oauth-github.ads

jquorning/ada-security

b9aa8e7deffaf71d50d501e284b821b8b0f942c3

[ "Apache-2.0" ]

3

2021-01-04T10:23:22.000Z

2022-01-30T21:45:49.000Z

----------------------------------------------------------------------- -- security-auth-oauth-github -- Github OAuth based authentication -- Copyright (C) 2013, 2014, 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 Security.OAuth.Clients; package Security.Auth.OAuth.Github is -- ------------------------------ -- OAuth Manager -- ------------------------------ -- The <b>Manager</b> provides the core operations for the OAuth authorization process. type Manager is new Security.Auth.OAuth.Manager with null record; -- Verify the OAuth access token and retrieve information about the user. overriding procedure Verify_Access_Token (Realm : in Manager; Assoc : in Association; Request : in Parameters'Class; Token : in Security.OAuth.Clients.Access_Token_Access; Result : in out Authentication); end Security.Auth.OAuth.Github;

45.459459

91

0.588585

58e457ccb67dd71c2a0c8872e6a70711a8c06f7d

7,887

ads

Ada

src/dsp-ring_filters.ads

fintatarta/generic-dsp

cc948cc5c146d2e19b1d0194d21d1e8b7806d735

[ "MIT" ]

null

src/dsp-ring_filters.ads

fintatarta/generic-dsp

cc948cc5c146d2e19b1d0194d21d1e8b7806d735

[ "MIT" ]

null

src/dsp-ring_filters.ads

fintatarta/generic-dsp

cc948cc5c146d2e19b1d0194d21d1e8b7806d735

[ "MIT" ]

null

with Ada.Finalization; use Ada; -- -- This package provides functions that implement "discrete time finite -- memory filters" in a general setup. -- -- According to the model used in this package, the filter processes -- samples of type Sample_Type and it is parameterized by coefficients -- of type Coefficient_Type. The only operations required are the -- product between a coefficient and a sample and the sum/difference of -- two samples. -- -- (For the more mathematically oriented, one can think samples as the -- element of an Abelian group and the coefficients as elements of a group -- acting on the samples) -- -- Usually coefficients and sample will have the same type (e.g., complex or -- real), but this solution is more flexible and has no special drawbacks. -- generic type Sample_Type is private; -- Type of samples type Coefficient_Type is private; -- Type of coefficients One : Sample_Type; Zero : Sample_Type; Zero_Coeff : Coefficient_Type; with function "+" (X, Y : Sample_Type) return Sample_Type is <>; with function "-" (X, Y : Sample_Type) return Sample_Type is <>; with function "*" (X : Coefficient_Type; Y : Sample_Type) return Sample_Type is <>; package Dsp.Ring_Filters is type Coefficient_Array is array (Natural range<>) of Coefficient_Type; type Sample_Array is array (Integer range<>) of Sample_Type; type Signal is access function (N : Integer) return Sample_Type; -- A signal is a function mapping Integers into samples function Delta_Signal (K : Integer) return Sample_Type is ((if K = 0 then One else Zero)); -- Special function very commonly used in DSP... function Apply (F : Signal; From, To : Integer) return Sample_Array with Pre => To >= From, Post => Apply'Result'First = From and Apply'Result'Last = To; -- Return an array containing the values F(n) with From <= n <= To type Ring_Filter_Interface is limited interface; -- It is convenient to introduce an interface that specifies what the -- generic filter can do. In this way we can write procedures that -- expect generic filters. type Filter_Status is (Unready, Ready, Running); -- A filter can be in three different states: -- -- * Unready: if the filter is not ready yet to process data. -- a typical case is when the filter has been created, but the -- impulse response has not been specified yet. -- * Ready: The filter is in its initial state and it can start -- processing data. -- * Running: The filter has already processed at least one sample function Status (Item : Ring_Filter_Interface) return Filter_Status is abstract ; -- Return the current filter status procedure Reset (Item : in out Ring_Filter_Interface) is abstract with Pre'Class => Item.Status /= Unready, Post'Class => Item.Status = Ready; -- Clean the internal state of the filter and bring it back to Ready function Filter (Item : in out Ring_Filter_Interface; Input : Sample_Type) return Sample_Type is abstract with Pre'Class => Item.Status /= Unready, Post'Class => Item.Status = Running; -- Process a single sample function Filter (Item : in out Ring_Filter_Interface'Class; Input : Sample_Array; Keep_Status : Boolean := False) return Sample_Array with Pre => Item.Status /= Unready, Post => Filter'Result'First = Input'First and Filter'Result'Last = Input'Last; -- Process an array of samples. If keep_status is False, Reset is called -- before the processing. type Ring_FIR is new Finalization.Limited_Controlled and Ring_Filter_Interface with private; -- type representing a FIR filter overriding procedure Reset (Item : in out Ring_FIR); overriding function Status (Item : Ring_Fir) return Filter_Status; overriding function Filter (Item : in out Ring_FIR; Input : Sample_Type) return Sample_Type; procedure Set (Filter : in out Ring_FIR; Impulse_Response : Coefficient_Array) with Pre => Filter.Status = Unready, Post => Filter.Status = Ready; -- Specify the impulse response of the filter. type Ring_IIR is new Ada.Finalization.Limited_Controlled and Ring_Filter_Interface with private; -- Specialization of Ring_Filter_Interface representing an IIR filter overriding function Status (Item : Ring_IIR) return Filter_Status; overriding procedure Reset (Item : in out Ring_IIR); overriding function Filter (Item : in out Ring_IIR; Input : Sample_Type) return Sample_Type; type Ring_IIR_Spec (Num_Deg, Den_Deg : Natural) is record Numerator : Coefficient_Array (0 .. Num_Deg); Denominator : Coefficient_Array (1 .. Den_Deg); end record; -- Parametrization of an IIR filter. -- -- *PLEASE NOTE*: we use the Matlab convention, that is, we give -- the coefficients of numerator and denominator of the transfer function -- This means that the values in denominator are the coefficients of -- the autoregressive equations *with changed sign*. The -- coefficient of z^0 at the denominator is not specified -- since it is supposed to be 1). procedure Set (Filter : in out Ring_IIR; Specs : Ring_IIR_Spec) with Pre => Filter.Status = Unready, Post => Filter.Status = Ready; -- Set the transfer function of the IIR filter procedure Set (Filter : in out Ring_IIR; Numerator : Coefficient_Array; Denominator : Coefficient_Array) with Pre => Filter.Status = Unready and Numerator'First >= 0 and Denominator'First >= 0, Post => Filter.Status = Ready; -- Set the transfer function of the IIR filter private type Coefficient_Array_Access is access Coefficient_Array; type Sample_Array_Access is access Sample_Array; type Ring_FIR is new Ada.Finalization.Limited_Controlled and Ring_Filter_Interface with record Current_Status : Filter_Status := Unready; Spec : Coefficient_Array_Access := null; Buffer : Sample_Array_Access := null; end record with Type_Invariant => ((Spec = null) = (Buffer = null)) and then (Spec = null or else (Spec.all'First = 0 and Buffer.all'First = 1 and Buffer.all'Last = Spec.all'Last)); overriding procedure Finalize (Object : in out Ring_FIR); function Status (Item : Ring_Fir) return Filter_Status is (Item.Current_Status); type Ring_IIR is new Ada.Finalization.Limited_Controlled and Ring_Filter_Interface with record Current_Status : Filter_Status := Unready; Num : Coefficient_Array_Access := null; Den : Coefficient_Array_Access := null; Buffer : Sample_Array_Access := null; end record with Type_Invariant => ((Num = null) = (Den = null) and (Num = null) = (Buffer = null)) and then (Num = null or else (Num.all'First = 0 and Den.all'First = 1 and Buffer.all'First = 1 and Buffer.all'Last = Num.all'Last and Buffer.all'Last = Den.all'Last)); overriding procedure Finalize (Object : in out Ring_IIR); function Status (Item : Ring_IIR) return Filter_Status is (Item.Current_Status); end Dsp.Ring_Filters;

34.89823

86

0.642323

583e1f9c6a514eb1e04c9494ee5af5932e91652a

288

ads

Ada

Sources/Model/cube_p.ads

ForYouEyesOnly/Space-Convoy

be4904f6a02695f7c4c5c3c965f4871cd3250003

[ "MIT" ]

1

2019-09-21T09:40:34.000Z

Sources/Model/cube_p.ads

ForYouEyesOnly/Space-Convoy

be4904f6a02695f7c4c5c3c965f4871cd3250003

[ "MIT" ]

null

Sources/Model/cube_p.ads

ForYouEyesOnly/Space-Convoy

be4904f6a02695f7c4c5c3c965f4871cd3250003

[ "MIT" ]

1

2019-09-25T12:29:27.000Z

-- -- Jan & Uwe R. Zimmer, Australia, July 2011 -- with GLOBE_3D; package Cube_P is procedure Create (object : in out GLOBE_3D.p_Object_3D; object_scale : GLOBE_3D.Real; centre : GLOBE_3D.Point_3D); end Cube_P;

20.571429

64

0.545139

58f3b63154e7734b27ea2d17ac16a8e14bf8bf3c

1,386

ads

Ada

src/arch/socs/stm32f429/Ada/soc-dwt-interfaces.ads

wookey-project/ewok-legacy

c973752dac3a0ebe3f7cfca062f50744578f051b

[ "Apache-2.0" ]

null

src/arch/socs/stm32f429/Ada/soc-dwt-interfaces.ads

wookey-project/ewok-legacy

c973752dac3a0ebe3f7cfca062f50744578f051b

[ "Apache-2.0" ]

null

src/arch/socs/stm32f429/Ada/soc-dwt-interfaces.ads

wookey-project/ewok-legacy

c973752dac3a0ebe3f7cfca062f50744578f051b

[ "Apache-2.0" ]

null

-- -- Copyright 2018 The wookey project team <[email protected]> -- - Ryad Benadjila -- - Arnauld Michelizza -- - Mathieu Renard -- - Philippe Thierry -- - Philippe Trebuchet -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. -- -- package soc.dwt.interfaces with spark_mode => on is -- get the DWT timer (without overflow support, keep a 32bit value) function get_cycles_32 return Unsigned_32 with convention => c, export => true, external_name => "soc_dwt_getcycles"; -- get the DWT timer with overflow support. permits linear measurement -- on 64 bits cycles time window (approx. 1270857 days) function get_cycles return Unsigned_64 with convention => c, export => true, external_name => "soc_dwt_getcycles_64"; end soc.dwt.interfaces;

30.8

79

0.673882

59f6f18700d3026ab5b51f7768ff91c928836a19

3,252

ads

Ada

st/src/stm32f4-sysconfig_control.ads

MatrixMike/AdaDemo1

cbf2ad5a05dc06a8ee11d0780c19f5fd74c8990a

[ "MIT" ]

1

2019-06-27T12:58:28.000Z

st/src/stm32f4-sysconfig_control.ads

MatrixMike/AdaDemo1

cbf2ad5a05dc06a8ee11d0780c19f5fd74c8990a

[ "MIT" ]

null

st/src/stm32f4-sysconfig_control.ads

MatrixMike/AdaDemo1

cbf2ad5a05dc06a8ee11d0780c19f5fd74c8990a

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT EXAMPLE -- -- -- -- Copyright (C) 2014, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- -- -- -- -- -- -- -- -- 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 file provides register definitions for the STM32F4 (ARM Cortex M4F) -- microcontrollers from ST Microelectronics. pragma Restrictions (No_Elaboration_Code); package STM32F4.SYSCONFIG_Control is type EXTI_Register is record IMR : Bits_32x1; EMR : Bits_32x1; RTSR : Bits_32x1; FTSR : Bits_32x1; SWIER : Bits_32x1; PR : Bits_32x1; end record; for EXTI_Register use record IMR at 0 range 0 .. 31; EMR at 4 range 0 .. 31; RTSR at 8 range 0 .. 31; FTSR at 12 range 0 .. 31; SWIER at 16 range 0 .. 31; PR at 20 range 0 .. 31; end record; type SYSCFG_Register is record MEMRM : Word; PMC : Word; EXTICR1 : Bits_8x4; EXTICR2 : Bits_8x4; EXTICR3 : Bits_8x4; EXTICR4 : Bits_8x4; CMPCR : Word; end record; for SYSCFG_Register use record MEMRM at 0 range 0 .. 31; PMC at 4 range 0 .. 31; EXTICR1 at 8 range 0 .. 31; EXTICR2 at 12 range 0 .. 31; EXTICR3 at 16 range 0 .. 31; EXTICR4 at 20 range 0 .. 31; CMPCR at 24 range 0 .. 31; end record; end STM32F4.SYSCONFIG_Control;

43.945946

78

0.422509

57752b277c3d7c34457d868a9d79ee4fb4a2ba1e

1,570

ads

Ada

source/oasis/program-elements-delay_statements.ads

optikos/oasis

9f64d46d26d964790d69f9db681c874cfb3bf96d

[ "MIT" ]

null

source/oasis/program-elements-delay_statements.ads

optikos/oasis

9f64d46d26d964790d69f9db681c874cfb3bf96d

[ "MIT" ]

null

source/oasis/program-elements-delay_statements.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.Statements; with Program.Lexical_Elements; with Program.Elements.Expressions; package Program.Elements.Delay_Statements is pragma Pure (Program.Elements.Delay_Statements); type Delay_Statement is limited interface and Program.Elements.Statements.Statement; type Delay_Statement_Access is access all Delay_Statement'Class with Storage_Size => 0; not overriding function Expression (Self : Delay_Statement) return not null Program.Elements.Expressions.Expression_Access is abstract; type Delay_Statement_Text is limited interface; type Delay_Statement_Text_Access is access all Delay_Statement_Text'Class with Storage_Size => 0; not overriding function To_Delay_Statement_Text (Self : aliased in out Delay_Statement) return Delay_Statement_Text_Access is abstract; not overriding function Delay_Token (Self : Delay_Statement_Text) return not null Program.Lexical_Elements.Lexical_Element_Access is abstract; not overriding function Until_Token (Self : Delay_Statement_Text) return not null Program.Lexical_Elements.Lexical_Element_Access is abstract; not overriding function Semicolon_Token (Self : Delay_Statement_Text) return not null Program.Lexical_Elements.Lexical_Element_Access is abstract; end Program.Elements.Delay_Statements;

30.784314

76

0.746497

22c41ecc64894e93f9de92818202071c818048a2

288

adb

Ada

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- { dg-do compile } procedure Derived_Type4 is type Root (D : Positive) is record S : String (1 .. D); end record; subtype Short is Positive range 1 .. 10; type Derived (N : Short := 1) is new Root (D => N); Obj : Derived; begin Obj := (N => 5, S => "Hello"); end;

16.941176

53

0.576389

c76fe2c48cef8f104305b90267b2c6978f4fa2f7

1,331

ads

Ada

resources/scripts/api/arin.ads

marcostolosa/Amass

7a48ddae82eeac76fd6447de908f6b27002eace7

[ "Apache-2.0" ]

7,053

2018-07-13T09:40:12.000Z

2022-03-31T15:26:10.000Z

resources/scripts/api/arin.ads

marcostolosa/Amass

7a48ddae82eeac76fd6447de908f6b27002eace7

[ "Apache-2.0" ]

624

2018-07-17T12:01:23.000Z

2022-03-28T13:59:17.000Z

resources/scripts/api/arin.ads

marcostolosa/Amass

7a48ddae82eeac76fd6447de908f6b27002eace7

[ "Apache-2.0" ]

1,470

2018-07-17T06:01:21.000Z

2022-03-31T18:02:17.000Z

-- Copyright 2021 Jeff Foley. All rights reserved. -- Use of this source code is governed by Apache 2 LICENSE that can be found in the LICENSE file. local json = require("json") name = "ARIN" type = "api" function start() set_rate_limit(1) end function asn(ctx, addr, asn) if addr == "" then return end local resp, err = request(ctx, {url=asn_url(addr)}) if (err ~= nil and err ~= "") then log(ctx, "asn request to service failed: " .. err) return end local j = json.decode(resp) if (j == nil or j.cidr0_cidrs == nil or j.arin_originas0_originautnums == nil or #(j.cidr0_cidrs) == 0 or #(j.arin_originas0_originautnums) == 0) then return end local asn = j.arin_originas0_originautnums[1] if (j.cidr0_cidrs[1]['v4prefix'] == nil or j.cidr0_cidrs[1]['v4prefix'] == "") then return end local cidr = j.cidr0_cidrs[1]['v4prefix'] .. "/" .. tostring(j.cidr0_cidrs[1]['length']) if j.entities[1]['vcardArray'] == nil then return end local desc = j.name .. " - " .. j.entities[1]['vcardArray'][2][2][4] new_asn(ctx, { ['addr']=addr, ['asn']=asn, ['desc']=desc, ['prefix']=cidr, }) end function asn_url(addr) return "https://rdap.arin.net/registry/ip/" .. addr end

25.596154

97

0.592787

a1d29ecb0a33def22e35b1ec626a5c61b536338b

285

ads

Ada

g-trasym.ads

ytomino/gnat4drake

945795d8705ba4024b07a41b7efe0a9513b441c1

[ "MIT" ]

null

g-trasym.ads

ytomino/gnat4drake

945795d8705ba4024b07a41b7efe0a9513b441c1

[ "MIT" ]

null

g-trasym.ads

ytomino/gnat4drake

945795d8705ba4024b07a41b7efe0a9513b441c1

[ "MIT" ]

null

pragma License (Unrestricted); with Ada.Exceptions; package GNAT.Traceback.Symbolic is pragma Preelaborate; function Symbolic_Traceback (E : Ada.Exceptions.Exception_Occurrence) return String renames Ada.Exceptions.Exception_Information; end GNAT.Traceback.Symbolic;

31.666667

72

0.796491

5839bc92c5c771387df83ae1fbf94efa8d36fc36

6,516

adb

Ada

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

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

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

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

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

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . P A C K _ 4 8 -- -- -- -- 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_48 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_48; 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); -- The following declarations are for the case where the address -- passed to GetU_48 or SetU_48 is not guaranteed to be aligned. -- These routines are used when the packed array is itself a -- component of a packed record, and therefore may not be aligned. type ClusterU is new Cluster; for ClusterU'Alignment use 1; type ClusterU_Ref is access ClusterU; function To_Ref is new Unchecked_Conversion (System.Address, ClusterU_Ref); ------------ -- Get_48 -- ------------ function Get_48 (Arr : System.Address; N : Natural) return Bits_48 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_48; ------------- -- GetU_48 -- ------------- function GetU_48 (Arr : System.Address; N : Natural) return Bits_48 is C : constant ClusterU_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 GetU_48; ------------ -- Set_48 -- ------------ procedure Set_48 (Arr : System.Address; N : Natural; E : Bits_48) 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_48; ------------- -- SetU_48 -- ------------- procedure SetU_48 (Arr : System.Address; N : Natural; E : Bits_48) is C : constant ClusterU_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 SetU_48; end System.Pack_48;

39.253012

78

0.494629

c72e36805bcc85446c550e5536061ec38e867875

2,145

ads

Ada

tier-1/xcb/source/thin/xcb-xcb_render_change_picture_value_list_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_change_picture_value_list_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_change_picture_value_list_t.ads

charlie5/cBound

741be08197a61ad9c72553e3302f3b669902216d

[ "0BSD" ]

null

-- This file is generated by SWIG. Please do not modify by hand. -- with Interfaces; with Interfaces.C; with Interfaces.C.Pointers; package xcb.xcb_render_change_picture_value_list_t is -- Item -- type Item is record repeat : aliased Interfaces.Unsigned_32; alphamap : aliased xcb.xcb_render_picture_t; alphaxorigin : aliased Interfaces.Integer_32; alphayorigin : aliased Interfaces.Integer_32; clipxorigin : aliased Interfaces.Integer_32; clipyorigin : aliased Interfaces.Integer_32; clipmask : aliased xcb.xcb_pixmap_t; graphicsexposure : aliased Interfaces.Unsigned_32; subwindowmode : aliased Interfaces.Unsigned_32; polyedge : aliased Interfaces.Unsigned_32; polymode : aliased Interfaces.Unsigned_32; dither : aliased xcb.xcb_atom_t; componentalpha : aliased Interfaces.Unsigned_32; end record; -- Item_Array -- type Item_Array is array (Interfaces.C .size_t range <>) of aliased xcb .xcb_render_change_picture_value_list_t .Item; -- Pointer -- package C_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_render_change_picture_value_list_t.Item, Element_Array => xcb.xcb_render_change_picture_value_list_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_change_picture_value_list_t .Pointer; -- Pointer_Pointer -- package C_Pointer_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_render_change_picture_value_list_t.Pointer, Element_Array => xcb.xcb_render_change_picture_value_list_t.Pointer_Array, Default_Terminator => null); subtype Pointer_Pointer is C_Pointer_Pointers.Pointer; end xcb.xcb_render_change_picture_value_list_t;

31.544118

77

0.675524

59a6a5fe07e399e01ee1b44db61c0a74b298e913

6,707

adb

Ada

gasp/source/gasp-world.adb

charlie5/playAda

1d8577cab0446c5a93e9b1b0c5a15218cd5d6ea8

[ "0BSD" ]

null

gasp/source/gasp-world.adb

charlie5/playAda

1d8577cab0446c5a93e9b1b0c5a15218cd5d6ea8

[ "0BSD" ]

null

gasp/source/gasp-world.adb

charlie5/playAda

1d8577cab0446c5a93e9b1b0c5a15218cd5d6ea8

[ "0BSD" ]

null

with openGL.Model.sphere.textured, openGL.Model.open_gl, openGL.Palette, physics.Forge, mmi.physics_Model, mmi.Forge, float_Math.Geometry.d3.Modeller.Forge, ada.unchecked_Deallocation, ada.Text_IO, ada.Streams.Stream_IO; package body gasp.World is use ada.text_IO; gasp_world_Id : constant := 1; type Geometry_Model_view is access all Geometry_3d.a_Model; --------- -- Forge -- package body Forge is function new_World (Name : in String; Renderer : in openGL.Renderer.lean.view) return View is use openGL, geometry_3d.Modeller.Forge, Math, linear_Algebra_3d; Self : constant View := new Item' (mmi.World.Forge.to_World (Name, gasp_world_Id, standard.physics.Forge.Bullet, Renderer) with others => <>); begin Self.start; Self.Gravity_is ((0.0, 0.0, 0.0)); add_Skysphere: declare starfield_Image : constant openGL.asset_Name := openGL.to_Asset ("assets/starfield-2.jpg"); the_graphics_Model : constant openGL.Model.sphere.textured.view := openGL.Model.sphere.textured.Forge.new_Sphere (Radius => 10_000.0, Image => starfield_Image, is_Skysphere => True); the_physics_Model : constant mmi.physics_Model.view := mmi.physics_Model.Forge.new_physics_Model (shape_Info => (mmi.physics_Model.a_Sphere, 0.5), mass => 0.0); the_Sprite : mmi.Sprite.view; begin the_Sprite := mmi.Sprite.Forge.new_Sprite ("skybox_Sprite", Self, the_graphics_Model, the_physics_Model, owns_graphics => True, owns_physics => True, is_Kinematic => False); Self.add (the_Sprite); end add_Skysphere; add_Asteroid: declare the_math_Model : constant Geometry_Model_view := new Geometry_3d.a_Model' (mesh_Model_from (the_Model => polar_Model_from ("./gaspra.tab"))); the_graphics_Model : constant openGL.Model.open_gl.view := openGL.Model.open_gl.Forge.new_Model ((1.0, 1.0, 1.0), null_Asset, the_math_Model, null_Asset, False); the_physics_Model : constant mmi.physics_Model.view := mmi.physics_Model.Forge.new_physics_Model (shape_Info => (mmi.physics_Model.Mesh, the_math_Model), mass => 0.0); the_Sprite : mmi.Sprite.view; begin the_Sprite := mmi.Sprite.Forge.new_Sprite ("asteroid_Sprite", Self, the_graphics_Model, the_physics_Model, owns_graphics => True, owns_physics => True, is_Kinematic => False); Self.add (the_Sprite); end add_Asteroid; add_Pod: declare the_Sprite : constant mmi.Sprite.view := mmi.Forge.new_ball_Sprite (in_World => Self.all'Access, Mass => 1.0, Radius => 0.2, Color => openGL.Palette.Red); begin the_Sprite.is_Visible (False); the_Sprite.Site_is ((0.0, 0.0, 200.0)); Self.add (the_Sprite); Self.pod_Sprite := the_Sprite; end add_Pod; return Self; end new_World; end Forge; overriding procedure destroy (Self : in out Item) is begin mmi.World.destroy (mmi.World.item (Self)); -- Destroy the base class. end destroy; procedure free (Self : in out View) is procedure deallocate is new ada.unchecked_Deallocation (item'Class, View); begin if Self /= null then destroy (Self.all); end if; deallocate (Self); end free; procedure store (Self : in out Item) is pragma Unreferenced (Self); use ada.Streams.Stream_IO; the_File : ada.Streams.Stream_IO.File_Type; the_Stream : ada.Streams.Stream_IO.Stream_Access; begin create (the_File, out_File, "World.stream"); the_Stream := Stream (the_File); -- To do. close (the_File); end store; procedure restore (Self : in out Item) is use ada.Streams.Stream_IO; the_File : ada.Streams.Stream_IO.File_Type; the_Stream : ada.Streams.Stream_IO.Stream_Access; begin open (the_File, in_File, "World.stream"); the_Stream := Stream (the_File); -- To do. close (the_File); exception when ada.Streams.Stream_IO.Name_Error => put_Line ("No prior World found."); end restore; -------------- -- Attributes -- function Pod (Self : in Item) return mmi.Sprite.view is begin return Self.pod_Sprite; end Pod; -------------- -- Operations -- overriding procedure evolve (Self : in out Item; By : in Duration) is use Math; use type ada.Containers.Count_type; begin Self.Counter := Self.Counter + 1; -- Gravity -- Self.pod_Sprite.apply_Force (-Self.pod_Sprite.Site * 0.00001); -- Dampen pod spin. -- -- Self.ball_Sprite.Gyre_is (Self.ball_Sprite.Gyre * 0.90); mmi.World.evolve (mmi.World.item (Self), By); -- Evolve the base mmi world. end evolve; end gasp.World;

29.416667

115

0.471

22ac5578dd71fd751dd0590e157f5dd10dbebe91

999

adb

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/sso/q11.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/sso/q11.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/sso/q11.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- { dg-do run } with Init11; use Init11; with Text_IO; use Text_IO; with Dump; procedure Q11 is A1 : R1 := My_R1; B1 : R1 := My_R1; A2 : R2 := My_R2; B2 : R2 := My_R2; begin Put ("A1 :"); Dump (A1'Address, R1'Max_Size_In_Storage_Elements); New_Line; -- { dg-output "A1 : 78 56 34 12 12 00 ab 00 34 00 cd 00 56 00 ef 00.*\n" } Put ("B1 :"); Dump (B1'Address, R1'Max_Size_In_Storage_Elements); New_Line; -- { dg-output "B1 : 78 56 34 12 12 00 ab 00 34 00 cd 00 56 00 ef 00.*\n" } Put ("A2 :"); Dump (A2'Address, R2'Max_Size_In_Storage_Elements); New_Line; -- { dg-output "A2 : 12 34 56 78 00 ab 00 12 00 cd 00 34 00 ef 00 56.*\n" } Put ("B2 :"); Dump (B2'Address, R2'Max_Size_In_Storage_Elements); New_Line; -- { dg-output "B2 : 12 34 56 78 00 ab 00 12 00 cd 00 34 00 ef 00 56.*\n"} if A1.I /= B1.I or A1.A(1) /= B1.A(1) then raise Program_Error; end if; if A2.I /= B2.I or A2.A(1) /= B2.A(1) then raise Program_Error; end if; end;

22.2

77

0.5996

58143183c342f11153c9e2650a400c63c38fedf6

4,931

ads

Ada

source/amf/uml/amf-uml-parameters-collections.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/uml/amf-uml-parameters-collections.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/uml/amf-uml-parameters-collections.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

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

53.597826

78

0.50943