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

2266547d26dbccb0c1e813b24cbea1dee1739e22

1,186

adb

Ada

src/sparknacl-pdebug.adb

yannickmoy/SPARKNaCl

c27fa811bf38b3706c1dc242f30e82967ad8f1c6

[ "BSD-2-Clause" ]

76

2020-02-24T20:30:15.000Z

2022-02-16T15:10:56.000Z

src/sparknacl-pdebug.adb

yannickmoy/SPARKNaCl

c27fa811bf38b3706c1dc242f30e82967ad8f1c6

[ "BSD-2-Clause" ]

10

2020-04-15T10:02:49.000Z

2022-02-24T20:10:46.000Z

src/sparknacl-pdebug.adb

yannickmoy/SPARKNaCl

c27fa811bf38b3706c1dc242f30e82967ad8f1c6

[ "BSD-2-Clause" ]

4

2020-03-10T15:19:45.000Z

2022-02-17T09:46:20.000Z

with Ada.Text_IO; use Ada.Text_IO; package body SPARKNaCl.PDebug is On : constant Boolean := True; package I64IO is new Ada.Text_IO.Integer_IO (Integer_64); procedure DH16 (S : in String; D : in Normal_GF) is begin if On then Put_Line (S); for I in D'Range loop I64IO.Put (I64 (D (I)), Width => 0); Put (' '); I64IO.Put (I64 (D (I)), Width => 0, Base => 16); New_Line; end loop; end if; end DH16; procedure DH32 (S : in String; D : in GF32) is begin if On then Put_Line (S); for I in D'Range loop I64IO.Put (I64 (D (I)), Width => 0); Put (' '); I64IO.Put (I64 (D (I)), Width => 0, Base => 16); New_Line; end loop; end if; end DH32; procedure DH64 (S : in String; D : in GF64) is begin if On then Put_Line (S); for I in D'Range loop I64IO.Put (D (I), Width => 0); Put (' '); I64IO.Put (D (I), Width => 0, Base => 16); New_Line; end loop; end if; end DH64; end SPARKNaCl.PDebug;

22.807692

60

0.479764

c767d9e21ed92c7468bf37d4c44aaa65987bf852

2,170

adb

Ada

regtests/keystore-coverage.adb

My-Colaborations/ada-keystore

6ab222c2df81f32309c5a7b4f94a475214ef5ce3

[ "Apache-2.0" ]

25

2019-05-07T20:35:50.000Z

2021-11-30T10:35:47.000Z

regtests/keystore-coverage.adb

My-Colaborations/ada-keystore

6ab222c2df81f32309c5a7b4f94a475214ef5ce3

[ "Apache-2.0" ]

12

2019-12-16T23:30:00.000Z

2021-09-26T18:52:41.000Z

regtests/keystore-coverage.adb

My-Colaborations/ada-keystore

6ab222c2df81f32309c5a7b4f94a475214ef5ce3

[ "Apache-2.0" ]

3

2019-12-18T21:30:04.000Z

2021-01-06T08:30:36.000Z

----------------------------------------------------------------------- -- keystore-io-tests -- Tests for keystore IO -- Copyright (C) 2019 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Util.Test_Caller; with Keystore.IO.Files; with Keystore.Buffers; with Keystore.Passwords.GPG; with Keystore.Repository; with Keystore.IO.Refs; package body Keystore.Coverage is -- A fake type to make sure execute generated compiler code for <T>DF() operation -- (these functions are used for deep finalization). type Deep_Finalization_Coverage is limited record Stream : Keystore.IO.Files.Wallet_Stream; Context : Keystore.Passwords.GPG.Context_Type; Config : Keystore.Wallet_Config; Repo : Keystore.Repository.Wallet_Repository; Ref : Keystore.IO.Refs.Stream_Ref; Block : Keystore.Buffers.Storage_Block; Buf : Keystore.Buffers.Data_Buffer_Type; Storage : Keystore.Buffers.Storage_Buffer; end record; package Caller is new Util.Test_Caller (Test, "Keystore.Coverage"); procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite) is begin Caller.Add_Test (Suite, "Test Keystore.Coverage", Test_Deep_Coverage'Access); end Add_Tests; procedure Test_Deep_Coverage (T : in out Test) is Item : Deep_Finalization_Coverage; begin Item.Config := Keystore.Secure_Config; T.Assert (Item'Size > 0, "Compiler error!!!!"); end Test_Deep_Coverage; end Keystore.Coverage;

38.75

85

0.671429

1ab0e23194da9150da9599b79b7e046ad0efeffb

17,775

adb

Ada

demo/adainclude/a-reatim.adb

e3l6/SSMDev

2929757aab3842aefd84debb2d7c3e8b28c2b340

[ "MIT" ]

null

demo/adainclude/a-reatim.adb

e3l6/SSMDev

2929757aab3842aefd84debb2d7c3e8b28c2b340

[ "MIT" ]

null

demo/adainclude/a-reatim.adb

e3l6/SSMDev

2929757aab3842aefd84debb2d7c3e8b28c2b340

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- A D A . R E A L _ T I M E -- -- -- -- B o d y -- -- -- -- Copyright (C) 2001-2014, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- -- -- -- -- -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNARL was developed by the GNARL team at Florida State University. -- -- Extensive contributions were provided by Ada Core Technologies, Inc. -- -- -- ------------------------------------------------------------------------------ -- This is the Ravenscar version of this package for generic bare board -- targets. Note that the operations here assume that Time is a 64-bit -- unsigned integer and Time_Span is a 64-bit signed integer. with System.Tasking; with System.Task_Primitives.Operations; with Ada.Unchecked_Conversion; package body Ada.Real_Time is pragma Suppress (Overflow_Check); -- This package has careful manual overflow checks, and unsupresses them -- where appropriate. This default enables compilation with checks enabled -- on Ravenscar SFP, where 64-bit multiplication with overflow checking is -- not available. package OSI renames System.OS_Interface; subtype LLI is Long_Long_Integer; ------------------------------------------------------------ -- Handling of Conversions Between Duration and Time_Span -- ------------------------------------------------------------ -- For the To_Duration and To_Time_Span conversion functions, we use the -- intermediate Integer representation of Duration (64-bit) to allow for -- simple Integer operations instead of Float. We take advantage of the -- fact that Duration is represented as an Integer with units of Small. -- Within these conversions we perform the range checks required by -- AI-00432 manually. -- Note that in the past, within To_Duration and To_Time_Span, we were -- first computing the conversion factor between Duration and Time_Span -- (10 ** 9 / Clock_Frecuency) and then we multiplied or divided by it. The -- advantage of this approach was that the operations were simple, and we -- limited a lot the number of occurrences of overflows, but the accuracy -- loss could be significant depending on the clock frequency. For example, -- with a clock frequency of 600 MHz the factor was 1.66, which was rounded -- to 1 (Integer), and hence with a 67% difference. -- We tried also to have a better trade off (Contraint_Error being raised -- when transforming very big values, but limiting a lot the loss of -- accuracy) using Clock_Frequency in MHz instead of Hz. Therefore, we -- multiplied first by 10 ** 3 (or Clock_Frequency / 10 ** 6 which is -- typically smaller than 1000), and hence overflow could occur only with -- really big values). The problem of this approach was that some processor -- frequencies may not be expressed in multiples of MHz (for example, -- 33.3333 MHz). The approach finally followed is to do the operations -- "by hand" on the upper and the lower part of the 64-bit value. This is -- slightly heavier, but we can preserve the best accuracy and the lowest -- occurrence of overflows. ----------------------- -- Local definitions -- ----------------------- type Uint_64 is mod 2 ** 64; -- Type used to represent intermediate results of arithmetic operations Max_Pos_Time_Span : constant := Uint_64 (Time_Span_Last); Max_Neg_Time_Span : constant := Uint_64 (2 ** 63); -- Absolute value of Time_Span_Last and Time_Span_First. Used in overflow -- checks. Note that we avoid using abs on Time_Span_First everywhere. ----------------------- -- Local subprograms -- ----------------------- function To_Duration is new Ada.Unchecked_Conversion (LLI, Duration); function To_Integer is new Ada.Unchecked_Conversion (Duration, LLI); function Mul_Div (V : Uint_64; M : Natural; D : Natural) return Uint_64; -- Compute V * M / D. Constraint_Error is raised in case of overflow, -- results above (2 ** 63) - 1 are considered as overflow. Therefore, -- the result can safely be converted to a signed 64-bit value. --------- -- "*" -- --------- function "*" (Left : Time_Span; Right : Integer) return Time_Span is Is_Negative : constant Boolean := (Left > 0 and then Right < 0) or else (Left < 0 and then Right > 0); -- Sign of the result Max_Value : constant Uint_64 := (if Is_Negative then Max_Neg_Time_Span else Max_Pos_Time_Span); -- Maximum absolute value that can be returned by the multiplication -- taking into account the sign of the operators. Abs_Left : constant Uint_64 := (if Left = Time_Span_First then Max_Neg_Time_Span else Uint_64 (abs (Left))); -- Remove sign of left operator Abs_Right : constant Uint_64 := Uint_64 (abs (LLI (Right))); -- Remove sign of right operator begin -- Overflow check is performed by hand assuming that Time_Span is a -- 64-bit signed integer. Otherwise these checks would need an -- intermediate type with more than 64-bit. The sign of the operators -- is removed to simplify the intermediate computation of the overflow -- check. if Abs_Right /= 0 and then Max_Value / Abs_Right < Abs_Left then raise Constraint_Error; else return Left * Time_Span (Right); end if; end "*"; function "*" (Left : Integer; Right : Time_Span) return Time_Span is begin return Right * Left; end "*"; --------- -- "+" -- --------- function "+" (Left : Time; Right : Time_Span) return Time is begin -- Overflow checks are be performed by hand assuming that Time and -- Time_Span are 64-bit unsigned and signed integers respectively. -- Otherwise these checks would need an intermediate type with more -- than 64 bits. if Right >= 0 and then Uint_64 (Time_Last) - Uint_64 (Left) >= Uint_64 (Right) then return Time (Uint_64 (Left) + Uint_64 (Right)); elsif Right = Time_Span'First and then Left >= Max_Neg_Time_Span then return Time (Uint_64 (Left) - Max_Neg_Time_Span); elsif Right < 0 and then Left >= Time (abs (Right)) then return Time (Uint_64 (Left) - Uint_64 (abs (Right))); else raise Constraint_Error; end if; end "+"; function "+" (Left, Right : Time_Span) return Time_Span is pragma Unsuppress (Overflow_Check); begin return Time_Span (LLI (Left) + LLI (Right)); end "+"; --------- -- "-" -- --------- function "-" (Left : Time; Right : Time_Span) return Time is begin -- Overflow checks must be performed by hand assuming that Time and -- Time_Span are 64-bit unsigned and signed integers respectively. -- Otherwise these checks would need an intermediate type with more -- than 64-bit. if Right >= 0 and then Left >= Time (Right) then return Time (Uint_64 (Left) - Uint_64 (Right)); elsif Right = Time_Span'First and then Uint_64 (Time_Last) - Uint_64 (Left) >= Max_Neg_Time_Span then return Left + Time (Max_Neg_Time_Span); elsif Right < 0 and then Uint_64 (Time_Last) - Uint_64 (Left) >= Uint_64 (abs (Right)) then return Left + Time (abs (Right)); else raise Constraint_Error; end if; end "-"; function "-" (Left, Right : Time) return Time_Span is begin -- Overflow checks must be performed by hand assuming that Time and -- Time_Span are 64-bit unsigned and signed integers respectively. -- Otherwise these checks would need an intermediate type with more -- than 64-bit. if Left >= Right and then Uint_64 (Left) - Uint_64 (Right) <= Uint_64 (Time_Span_Last) then return Time_Span (Uint_64 (Left) - Uint_64 (Right)); elsif Left < Right and then Uint_64 (Right) - Uint_64 (Left) <= Max_Neg_Time_Span then return Time_Span (-(Uint_64 (Right) - Uint_64 (Left))); else raise Constraint_Error; end if; end "-"; function "-" (Left, Right : Time_Span) return Time_Span is pragma Unsuppress (Overflow_Check); begin return Time_Span (LLI (Left) - LLI (Right)); end "-"; function "-" (Right : Time_Span) return Time_Span is pragma Unsuppress (Overflow_Check); begin return Time_Span (-LLI (Right)); end "-"; --------- -- "/" -- --------- function "/" (Left, Right : Time_Span) return Integer is pragma Unsuppress (Overflow_Check); begin return Integer (LLI (Left) / LLI (Right)); end "/"; function "/" (Left : Time_Span; Right : Integer) return Time_Span is pragma Unsuppress (Overflow_Check); begin return Left / Time_Span (Right); end "/"; ----------- -- Clock -- ----------- function Clock return Time is begin return Time (System.Task_Primitives.Operations.Monotonic_Clock); end Clock; ------------------ -- Microseconds -- ------------------ function Microseconds (US : Integer) return Time_Span is begin -- Overflow can't happen (Ticks_Per_Second is Natural) return Time_Span (LLI (US) * LLI (OSI.Ticks_Per_Second)) / Time_Span (10#1#E6); end Microseconds; ------------------ -- Milliseconds -- ------------------ function Milliseconds (MS : Integer) return Time_Span is begin -- Overflow can't happen (Ticks_Per_Second is Natural) return Time_Span (LLI (MS) * LLI (OSI.Ticks_Per_Second)) / Time_Span (10#1#E3); end Milliseconds; ------------- -- Minutes -- ------------- function Minutes (M : Integer) return Time_Span is Min_M : constant LLI := LLI'First / LLI (OSI.Ticks_Per_Second); Max_M : constant LLI := LLI'Last / LLI (OSI.Ticks_Per_Second); -- Bounds for Sec_M. Note that we can't use unsupress overflow checks, -- as this would require the use of arit64 Sec_M : constant LLI := LLI (M) * 60; -- M converted to seconds begin if Sec_M < Min_M or else Sec_M > Max_M then raise Constraint_Error; else return Time_Span (Sec_M * LLI (OSI.Ticks_Per_Second)); end if; end Minutes; ----------------- -- Nanoseconds -- ----------------- function Nanoseconds (NS : Integer) return Time_Span is begin -- Overflow can't happen (Ticks_Per_Second is Natural) return Time_Span (LLI (NS) * LLI (OSI.Ticks_Per_Second)) / Time_Span (10#1#E9); end Nanoseconds; ------------- -- Seconds -- ------------- function Seconds (S : Integer) return Time_Span is begin -- Overflow can't happen (Ticks_Per_Second is Natural) return Time_Span (LLI (S) * LLI (OSI.Ticks_Per_Second)); end Seconds; ----------- -- Split -- ----------- procedure Split (T : Time; SC : out Seconds_Count; TS : out Time_Span) is Res : constant Time := Time (OSI.Ticks_Per_Second); begin SC := Seconds_Count (T / Res); TS := T - Time (SC) * Res; end Split; ------------- -- Time_Of -- ------------- function Time_Of (SC : Seconds_Count; TS : Time_Span) return Time is Res : constant Time := Time (OSI.Ticks_Per_Second); begin if Time_Last / Res < Time (SC) then raise Constraint_Error; else return Time (SC) * Res + TS; end if; end Time_Of; ------------- -- Mul_Div -- ------------- function Mul_Div (V : Uint_64; M : Natural; D : Natural) return Uint_64 is -- Upper case letters represent one word (32-bit words in our case). -- If we can compute, PQ = AB / D, then we can compute ABC / D using -- the following method (pencil and paper algorithm): -- MN := AB / D (first quotient) -- R := AB - MN * D (remainder on one word, as R < D) -- OP := RC / D (second quotient) -- res := MN0 + OP -- We check absence of overflow in the final result by checking that -- M is 0, and that there is no carry when adding N0 and OP. -- Initially, A = 0, BC = V V_Hi : Uint_64 := V / 2 ** 32; -- AB V_Lo : Uint_64 := V rem 2 ** 32; -- C Result_Hi : Uint_64; -- High part of the result Result_Lo : Uint_64; -- Low part of the result Remainder : Uint_64; -- Remainder of the first division (denoted R above) begin -- Multiply V by M V_Hi := V_Hi * Uint_64 (M); V_Lo := V_Lo * Uint_64 (M); V_Hi := V_Hi + V_Lo / 2 ** 32; V_Lo := V_Lo rem 2 ** 32; -- First quotient Result_Hi := V_Hi / Uint_64 (D); if Result_Hi > (2 ** 31 - 1) then -- The final result conversion would overflow: Result_Hi will be -- the high 32 bit part of the result. raise Constraint_Error; end if; Remainder := V_Hi - Result_Hi * Uint_64 (D); Result_Hi := Result_Hi * 2 ** 32; -- Second quotient. To improve rounding, D / 2 is added Result_Lo := (V_Lo + Remainder * 2 ** 32 + Uint_64 (D / 2)) / Uint_64 (D); if Result_Lo > (2 ** 63 - 1) - Result_Hi then -- The final conversion for the result (just below) would overflow raise Constraint_Error; end if; return Result_Hi + Result_Lo; end Mul_Div; ----------------- -- To_Duration -- ----------------- function To_Duration (TS : Time_Span) return Duration is Duration_Units : constant Natural := Natural (1.0 / Duration'Small); -- Number of units of Duration in one second. The result is correct -- (not rounded) as Duration'Small is 10.0**(-9) Result : LLI; -- Contains the temporary result Is_Negative : constant Boolean := TS < 0; -- Remove the sign to simplify the intermediate computations TPS : constant Natural := OSI.Ticks_Per_Second; -- Capture ticks per second value begin -- See comment at the beginning of this file about this implementation -- We need to accurately compute TS * Duration_Units / Ticks_Per_Second -- TS being a 64-bit integer, both Duration_Units and Ticks_Per_Second -- are 32-bit integers. Result := (if TS = Time_Span'First then LLI (Mul_Div (Max_Neg_Time_Span, Duration_Units, TPS)) else LLI (Mul_Div (Uint_64 (abs TS), Duration_Units, TPS))); -- Handle the sign of the result if Is_Negative then Result := -Result; end if; return To_Duration (Result); end To_Duration; ------------------ -- To_Time_Span -- ------------------ function To_Time_Span (D : Duration) return Time_Span is Duration_Units : constant Natural := Natural (1.0 / Duration'Small); -- Number of units of Duration in one second Result : LLI; -- Contains the temporary results Is_Negative : constant Boolean := D < 0.0; -- Remove the sign to simplify the intermediate computations begin -- See comment at the beginning of this file about this implementation Result := LLI (Mul_Div (Uint_64 (abs To_Integer (D)), OSI.Ticks_Per_Second, Duration_Units)); -- Handle the sign of the result if Is_Negative then Result := -Result; end if; return Time_Span (Result); end To_Time_Span; begin -- Ensure that the tasking run time is initialized when using clock and/or -- delay operations. The initialization routine has the required machinery -- to prevent multiple calls to Initialize. System.Tasking.Initialize; end Ada.Real_Time;

34.649123

79

0.568101

1a23ac3b30cfc7be02159a345b568dd9a15e7c6f

103,891

adb

Ada

apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d/conv2d/hls_target/.autopilot/db/call_Loop_LB2D_buf_p.sched.adb

dillonhuff/Halide-HLS

e9f4c3ac7915e5a52f211ce65004ae17890515a0

[ "MIT" ]

1

2020-06-18T16:51:39.000Z

apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d/conv2d/hls_target/.autopilot/db/call_Loop_LB2D_buf_p.sched.adb

dillonhuff/Halide-HLS

e9f4c3ac7915e5a52f211ce65004ae17890515a0

[ "MIT" ]

null

apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d/conv2d/hls_target/.autopilot/db/call_Loop_LB2D_buf_p.sched.adb

dillonhuff/Halide-HLS

e9f4c3ac7915e5a52f211ce65004ae17890515a0

[ "MIT" ]

1

2020-03-18T00:43:22.000Z

<?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="14"> <syndb class_id="0" tracking_level="0" version="0"> <userIPLatency>-1</userIPLatency> <userIPName></userIPName> <cdfg class_id="1" tracking_level="1" version="0" object_id="_0"> <name>call_Loop_LB2D_buf_p</name> <ret_bitwidth>0</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="3" tracking_level="1" version="0" object_id="_1"> <Value class_id="4" tracking_level="0" version="0"> <Obj class_id="5" tracking_level="0" version="0"> <type>1</type> <id>1</id> <name>in_stream_V_value_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo class_id="6" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>stream&lt;PackedStencil&lt;unsigned int, 1, 1, 1, 1&gt; &gt;.V.value.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <direction>0</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs class_id="7" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_2"> <Value> <Obj> <type>1</type> <id>2</id> <name>slice_stream_V_value_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>96</bitwidth> </Value> <direction>1</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> </ports> <nodes class_id="8" tracking_level="0" version="0"> <count>43</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_3"> <Value> <Obj> <type>0</type> <id>7</id> <name>buffer_0_value_V</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>168</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="10" tracking_level="0" version="0"> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second class_id="11" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="12" tracking_level="0" version="0"> <first class_id="13" tracking_level="0" version="0"> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>168</second> </item> </second> </item> </inlineStackInfo> <originalName>buffer[0].value.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>71</item> </oprand_edges> <opcode>alloca</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_4"> <Value> <Obj> <type>0</type> <id>8</id> <name>buffer_1_value_V</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>168</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>168</second> </item> </second> </item> </inlineStackInfo> <originalName>buffer[1].value.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>72</item> </oprand_edges> <opcode>alloca</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_5"> <Value> <Obj> <type>0</type> <id>9</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>73</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_6"> <Value> <Obj> <type>0</type> <id>11</id> <name>write_idx_1</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>write_idx_1</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>75</item> <item>76</item> <item>77</item> <item>78</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_7"> <Value> <Obj> <type>0</type> <id>12</id> <name>row</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>row</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>80</item> <item>81</item> <item>82</item> <item>83</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_8"> <Value> <Obj> <type>0</type> <id>13</id> <name>tmp</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>177</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>177</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>84</item> <item>86</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_9"> <Value> <Obj> <type>0</type> <id>15</id> <name>row_1</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>177</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>177</second> </item> </second> </item> </inlineStackInfo> <originalName>row</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>87</item> <item>89</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_10"> <Value> <Obj> <type>0</type> <id>16</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>177</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>177</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>90</item> <item>91</item> <item>92</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_11"> <Value> <Obj> <type>0</type> <id>20</id> <name>tmp_5</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>187</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>187</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>10</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>113</item> <item>114</item> <item>116</item> <item>118</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_12"> <Value> <Obj> <type>0</type> <id>21</id> <name>icmp</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>187</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>187</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>119</item> <item>121</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_13"> <Value> <Obj> <type>0</type> <id>22</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>179</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>179</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>122</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_14"> <Value> <Obj> <type>0</type> <id>24</id> <name>write_idx_1_1</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>211</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>211</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>96</item> <item>97</item> <item>98</item> <item>99</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_15"> <Value> <Obj> <type>0</type> <id>25</id> <name>col</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>col</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>100</item> <item>101</item> <item>102</item> <item>103</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_16"> <Value> <Obj> <type>0</type> <id>26</id> <name>tmp_1</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>179</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>179</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>104</item> <item>106</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_17"> <Value> <Obj> <type>0</type> <id>27</id> <name>col_1</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>179</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>179</second> </item> </second> </item> </inlineStackInfo> <originalName>col</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>107</item> <item>108</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_18"> <Value> <Obj> <type>0</type> <id>28</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>179</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>179</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>109</item> <item>110</item> <item>111</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_19"> <Value> <Obj> <type>0</type> <id>30</id> <name>col_cast</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>179</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>179</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>131</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_20"> <Value> <Obj> <type>0</type> <id>34</id> <name>tmp_7</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>183</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>183</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>63</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>133</item> <item>134</item> <item>135</item> <item>137</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_21"> <Value> <Obj> <type>0</type> <id>35</id> <name>icmp1</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>183</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>183</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>138</item> <item>140</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_22"> <Value> <Obj> <type>0</type> <id>36</id> <name>write_idx_1_3</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>184</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>184</second> </item> </second> </item> </inlineStackInfo> <originalName>write_idx_1</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>141</item> <item>143</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_23"> <Value> <Obj> <type>0</type> <id>37</id> <name>p_write_idx_1_1</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>183</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>183</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>144</item> <item>145</item> <item>146</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_24"> <Value> <Obj> <type>0</type> <id>38</id> <name>tmp_value_V_2</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>186</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>186</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.value.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>148</item> <item>149</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_25"> <Value> <Obj> <type>0</type> <id>39</id> <name>buffer_0_value_V_ad</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>179</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>179</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>150</item> <item>151</item> <item>152</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_26"> <Value> <Obj> <type>0</type> <id>40</id> <name>buffer_0_value_V_lo</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>198</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>198</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>153</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_27"> <Value> <Obj> <type>0</type> <id>41</id> <name>buffer_1_value_V_ad</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>179</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>179</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>154</item> <item>155</item> <item>156</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_28"> <Value> <Obj> <type>0</type> <id>42</id> <name>buffer_1_value_V_lo</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>198</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>198</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>157</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_29"> <Value> <Obj> <type>0</type> <id>43</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>187</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>187</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>158</item> <item>159</item> <item>160</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_30"> <Value> <Obj> <type>0</type> <id>45</id> <name>tmp_8</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>183</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>183</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>161</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_31"> <Value> <Obj> <type>0</type> <id>46</id> <name>p_Val2_2_0_phi</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>198</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>198</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>162</item> <item>163</item> <item>164</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_32"> <Value> <Obj> <type>0</type> <id>47</id> <name>p_Val2_2_1_phi</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>198</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>198</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>165</item> <item>166</item> <item>167</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_33"> <Value> <Obj> <type>0</type> <id>48</id> <name>p_Result_s</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>206</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>206</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>96</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>169</item> <item>170</item> <item>171</item> <item>172</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_34"> <Value> <Obj> <type>0</type> <id>49</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>207</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>207</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>174</item> <item>175</item> <item>176</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_35"> <Value> <Obj> <type>0</type> <id>50</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>208</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>208</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>177</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_36"> <Value> <Obj> <type>0</type> <id>52</id> <name>tmp_9</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>183</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>183</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>127</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_37"> <Value> <Obj> <type>0</type> <id>53</id> <name></name> <fileName>../../../lib_files/Stencil.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>75</lineNumber> <contextFuncName>operator=</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>209</second> </item> <item> <first> <first>../../../lib_files/Stencil.h</first> <second>operator=</second> </first> <second>75</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>128</item> <item>129</item> <item>130</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_38"> <Value> <Obj> <type>0</type> <id>55</id> <name></name> <fileName>../../../lib_files/Stencil.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>75</lineNumber> <contextFuncName>operator=</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>209</second> </item> <item> <first> <first>../../../lib_files/Stencil.h</first> <second>operator=</second> </first> <second>75</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>124</item> <item>125</item> <item>297</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_39"> <Value> <Obj> <type>0</type> <id>56</id> <name></name> <fileName>../../../lib_files/Stencil.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>75</lineNumber> <contextFuncName>operator=</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>209</second> </item> <item> <first> <first>../../../lib_files/Stencil.h</first> <second>operator=</second> </first> <second>75</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>126</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_40"> <Value> <Obj> <type>0</type> <id>58</id> <name></name> <fileName>../../../lib_files/Stencil.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>75</lineNumber> <contextFuncName>operator=</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>209</second> </item> <item> <first> <first>../../../lib_files/Stencil.h</first> <second>operator=</second> </first> <second>75</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>178</item> <item>179</item> <item>296</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_41"> <Value> <Obj> <type>0</type> <id>59</id> <name></name> <fileName>../../../lib_files/Stencil.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>75</lineNumber> <contextFuncName>operator=</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>209</second> </item> <item> <first> <first>../../../lib_files/Stencil.h</first> <second>operator=</second> </first> <second>75</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>180</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_42"> <Value> <Obj> <type>0</type> <id>62</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>179</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>179</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>123</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_43"> <Value> <Obj> <type>0</type> <id>64</id> <name>write_idx_1_2</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>211</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>211</second> </item> </second> </item> </inlineStackInfo> <originalName>write_idx_1</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>93</item> <item>94</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_44"> <Value> <Obj> <type>0</type> <id>66</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</fileDirectory> <lineNumber>177</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>177</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>95</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_45"> <Value> <Obj> <type>0</type> <id>68</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>0</count> <item_version>0</item_version> </oprand_edges> <opcode>ret</opcode> <m_Display>0</m_Display> </item> </nodes> <consts class_id="15" tracking_level="0" version="0"> <count>12</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_46"> <Value> <Obj> <type>2</type> <id>70</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_47"> <Value> <Obj> <type>2</type> <id>74</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_48"> <Value> <Obj> <type>2</type> <id>79</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_49"> <Value> <Obj> <type>2</type> <id>85</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <const_type>0</const_type> <content>1080</content> </item> <item class_id_reference="16" object_id="_50"> <Value> <Obj> <type>2</type> <id>88</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_51"> <Value> <Obj> <type>2</type> <id>105</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <const_type>0</const_type> <content>1920</content> </item> <item class_id_reference="16" object_id="_52"> <Value> <Obj> <type>2</type> <id>115</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_53"> <Value> <Obj> <type>2</type> <id>117</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>10</content> </item> <item class_id_reference="16" object_id="_54"> <Value> <Obj> <type>2</type> <id>120</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>10</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_55"> <Value> <Obj> <type>2</type> <id>136</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>63</content> </item> <item class_id_reference="16" object_id="_56"> <Value> <Obj> <type>2</type> <id>139</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>63</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_57"> <Value> <Obj> <type>2</type> <id>142</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <const_type>0</const_type> <content>18446744073709551614</content> </item> </consts> <blocks class_id="17" tracking_level="0" version="0"> <count>12</count> <item_version>0</item_version> <item class_id="18" tracking_level="1" version="0" object_id="_58"> <Obj> <type>3</type> <id>10</id> <name>newFuncRoot</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>7</item> <item>8</item> <item>9</item> </node_objs> </item> <item class_id_reference="18" object_id="_59"> <Obj> <type>3</type> <id>17</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>5</count> <item_version>0</item_version> <item>11</item> <item>12</item> <item>13</item> <item>15</item> <item>16</item> </node_objs> </item> <item class_id_reference="18" object_id="_60"> <Obj> <type>3</type> <id>23</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>20</item> <item>21</item> <item>22</item> </node_objs> </item> <item class_id_reference="18" object_id="_61"> <Obj> <type>3</type> <id>29</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>5</count> <item_version>0</item_version> <item>24</item> <item>25</item> <item>26</item> <item>27</item> <item>28</item> </node_objs> </item> <item class_id_reference="18" object_id="_62"> <Obj> <type>3</type> <id>44</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>11</count> <item_version>0</item_version> <item>30</item> <item>34</item> <item>35</item> <item>36</item> <item>37</item> <item>38</item> <item>39</item> <item>40</item> <item>41</item> <item>42</item> <item>43</item> </node_objs> </item> <item class_id_reference="18" object_id="_63"> <Obj> <type>3</type> <id>51</id> <name>.preheader56.preheader.critedge.0</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>6</count> <item_version>0</item_version> <item>45</item> <item>46</item> <item>47</item> <item>48</item> <item>49</item> <item>50</item> </node_objs> </item> <item class_id_reference="18" object_id="_64"> <Obj> <type>3</type> <id>54</id> <name>._crit_edge</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>52</item> <item>53</item> </node_objs> </item> <item class_id_reference="18" object_id="_65"> <Obj> <type>3</type> <id>57</id> <name>branch4</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>55</item> <item>56</item> </node_objs> </item> <item class_id_reference="18" object_id="_66"> <Obj> <type>3</type> <id>60</id> <name>branch5</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>58</item> <item>59</item> </node_objs> </item> <item class_id_reference="18" object_id="_67"> <Obj> <type>3</type> <id>63</id> <name>._crit_edge33</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>62</item> </node_objs> </item> <item class_id_reference="18" object_id="_68"> <Obj> <type>3</type> <id>67</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>64</item> <item>66</item> </node_objs> </item> <item class_id_reference="18" object_id="_69"> <Obj> <type>3</type> <id>69</id> <name>.preheader.exitStub</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>68</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>106</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_70"> <id>71</id> <edge_type>1</edge_type> <source_obj>70</source_obj> <sink_obj>7</sink_obj> </item> <item class_id_reference="20" object_id="_71"> <id>72</id> <edge_type>1</edge_type> <source_obj>70</source_obj> <sink_obj>8</sink_obj> </item> <item class_id_reference="20" object_id="_72"> <id>73</id> <edge_type>2</edge_type> <source_obj>17</source_obj> <sink_obj>9</sink_obj> </item> <item class_id_reference="20" object_id="_73"> <id>75</id> <edge_type>1</edge_type> <source_obj>74</source_obj> <sink_obj>11</sink_obj> </item> <item class_id_reference="20" object_id="_74"> <id>76</id> <edge_type>2</edge_type> <source_obj>10</source_obj> <sink_obj>11</sink_obj> </item> <item class_id_reference="20" object_id="_75"> <id>77</id> <edge_type>1</edge_type> <source_obj>64</source_obj> <sink_obj>11</sink_obj> </item> <item class_id_reference="20" object_id="_76"> <id>78</id> <edge_type>2</edge_type> <source_obj>67</source_obj> <sink_obj>11</sink_obj> </item> <item class_id_reference="20" object_id="_77"> <id>80</id> <edge_type>1</edge_type> <source_obj>79</source_obj> <sink_obj>12</sink_obj> </item> <item class_id_reference="20" object_id="_78"> <id>81</id> <edge_type>2</edge_type> <source_obj>10</source_obj> <sink_obj>12</sink_obj> </item> <item class_id_reference="20" object_id="_79"> <id>82</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>12</sink_obj> </item> <item class_id_reference="20" object_id="_80"> <id>83</id> <edge_type>2</edge_type> <source_obj>67</source_obj> <sink_obj>12</sink_obj> </item> <item class_id_reference="20" object_id="_81"> <id>84</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>13</sink_obj> </item> <item class_id_reference="20" object_id="_82"> <id>86</id> <edge_type>1</edge_type> <source_obj>85</source_obj> <sink_obj>13</sink_obj> </item> <item class_id_reference="20" object_id="_83"> <id>87</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>15</sink_obj> </item> <item class_id_reference="20" object_id="_84"> <id>89</id> <edge_type>1</edge_type> <source_obj>88</source_obj> <sink_obj>15</sink_obj> </item> <item class_id_reference="20" object_id="_85"> <id>90</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>16</sink_obj> </item> <item class_id_reference="20" object_id="_86"> <id>91</id> <edge_type>2</edge_type> <source_obj>23</source_obj> <sink_obj>16</sink_obj> </item> <item class_id_reference="20" object_id="_87"> <id>92</id> <edge_type>2</edge_type> <source_obj>69</source_obj> <sink_obj>16</sink_obj> </item> <item class_id_reference="20" object_id="_88"> <id>93</id> <edge_type>1</edge_type> <source_obj>24</source_obj> <sink_obj>64</sink_obj> </item> <item class_id_reference="20" object_id="_89"> <id>94</id> <edge_type>1</edge_type> <source_obj>70</source_obj> <sink_obj>64</sink_obj> </item> <item class_id_reference="20" object_id="_90"> <id>95</id> <edge_type>2</edge_type> <source_obj>17</source_obj> <sink_obj>66</sink_obj> </item> <item class_id_reference="20" object_id="_91"> <id>96</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>24</sink_obj> </item> <item class_id_reference="20" object_id="_92"> <id>97</id> <edge_type>2</edge_type> <source_obj>23</source_obj> <sink_obj>24</sink_obj> </item> <item class_id_reference="20" object_id="_93"> <id>98</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>24</sink_obj> </item> <item class_id_reference="20" object_id="_94"> <id>99</id> <edge_type>2</edge_type> <source_obj>63</source_obj> <sink_obj>24</sink_obj> </item> <item class_id_reference="20" object_id="_95"> <id>100</id> <edge_type>1</edge_type> <source_obj>79</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_96"> <id>101</id> <edge_type>2</edge_type> <source_obj>23</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_97"> <id>102</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_98"> <id>103</id> <edge_type>2</edge_type> <source_obj>63</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_99"> <id>104</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>26</sink_obj> </item> <item class_id_reference="20" object_id="_100"> <id>106</id> <edge_type>1</edge_type> <source_obj>105</source_obj> <sink_obj>26</sink_obj> </item> <item class_id_reference="20" object_id="_101"> <id>107</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>27</sink_obj> </item> <item class_id_reference="20" object_id="_102"> <id>108</id> <edge_type>1</edge_type> <source_obj>88</source_obj> <sink_obj>27</sink_obj> </item> <item class_id_reference="20" object_id="_103"> <id>109</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>28</sink_obj> </item> <item class_id_reference="20" object_id="_104"> <id>110</id> <edge_type>2</edge_type> <source_obj>44</source_obj> <sink_obj>28</sink_obj> </item> <item class_id_reference="20" object_id="_105"> <id>111</id> <edge_type>2</edge_type> <source_obj>67</source_obj> <sink_obj>28</sink_obj> </item> <item class_id_reference="20" object_id="_106"> <id>114</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>20</sink_obj> </item> <item class_id_reference="20" object_id="_107"> <id>116</id> <edge_type>1</edge_type> <source_obj>115</source_obj> <sink_obj>20</sink_obj> </item> <item class_id_reference="20" object_id="_108"> <id>118</id> <edge_type>1</edge_type> <source_obj>117</source_obj> <sink_obj>20</sink_obj> </item> <item class_id_reference="20" object_id="_109"> <id>119</id> <edge_type>1</edge_type> <source_obj>20</source_obj> <sink_obj>21</sink_obj> </item> <item class_id_reference="20" object_id="_110"> <id>121</id> <edge_type>1</edge_type> <source_obj>120</source_obj> <sink_obj>21</sink_obj> </item> <item class_id_reference="20" object_id="_111"> <id>122</id> <edge_type>2</edge_type> <source_obj>29</source_obj> <sink_obj>22</sink_obj> </item> <item class_id_reference="20" object_id="_112"> <id>123</id> <edge_type>2</edge_type> <source_obj>29</source_obj> <sink_obj>62</sink_obj> </item> <item class_id_reference="20" object_id="_113"> <id>124</id> <edge_type>1</edge_type> <source_obj>38</source_obj> <sink_obj>55</sink_obj> </item> <item class_id_reference="20" object_id="_114"> <id>125</id> <edge_type>1</edge_type> <source_obj>39</source_obj> <sink_obj>55</sink_obj> </item> <item class_id_reference="20" object_id="_115"> <id>126</id> <edge_type>2</edge_type> <source_obj>63</source_obj> <sink_obj>56</sink_obj> </item> <item class_id_reference="20" object_id="_116"> <id>127</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>52</sink_obj> </item> <item class_id_reference="20" object_id="_117"> <id>128</id> <edge_type>1</edge_type> <source_obj>52</source_obj> <sink_obj>53</sink_obj> </item> <item class_id_reference="20" object_id="_118"> <id>129</id> <edge_type>2</edge_type> <source_obj>57</source_obj> <sink_obj>53</sink_obj> </item> <item class_id_reference="20" object_id="_119"> <id>130</id> <edge_type>2</edge_type> <source_obj>60</source_obj> <sink_obj>53</sink_obj> </item> <item class_id_reference="20" object_id="_120"> <id>131</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>30</sink_obj> </item> <item class_id_reference="20" object_id="_121"> <id>134</id> <edge_type>1</edge_type> <source_obj>24</source_obj> <sink_obj>34</sink_obj> </item> <item class_id_reference="20" object_id="_122"> <id>135</id> <edge_type>1</edge_type> <source_obj>115</source_obj> <sink_obj>34</sink_obj> </item> <item class_id_reference="20" object_id="_123"> <id>137</id> <edge_type>1</edge_type> <source_obj>136</source_obj> <sink_obj>34</sink_obj> </item> <item class_id_reference="20" object_id="_124"> <id>138</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>35</sink_obj> </item> <item class_id_reference="20" object_id="_125"> <id>140</id> <edge_type>1</edge_type> <source_obj>139</source_obj> <sink_obj>35</sink_obj> </item> <item class_id_reference="20" object_id="_126"> <id>141</id> <edge_type>1</edge_type> <source_obj>24</source_obj> <sink_obj>36</sink_obj> </item> <item class_id_reference="20" object_id="_127"> <id>143</id> <edge_type>1</edge_type> <source_obj>142</source_obj> <sink_obj>36</sink_obj> </item> <item class_id_reference="20" object_id="_128"> <id>144</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>37</sink_obj> </item> <item class_id_reference="20" object_id="_129"> <id>145</id> <edge_type>1</edge_type> <source_obj>36</source_obj> <sink_obj>37</sink_obj> </item> <item class_id_reference="20" object_id="_130"> <id>146</id> <edge_type>1</edge_type> <source_obj>24</source_obj> <sink_obj>37</sink_obj> </item> <item class_id_reference="20" object_id="_131"> <id>149</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>38</sink_obj> </item> <item class_id_reference="20" object_id="_132"> <id>150</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>39</sink_obj> </item> <item class_id_reference="20" object_id="_133"> <id>151</id> <edge_type>1</edge_type> <source_obj>74</source_obj> <sink_obj>39</sink_obj> </item> <item class_id_reference="20" object_id="_134"> <id>152</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>39</sink_obj> </item> <item class_id_reference="20" object_id="_135"> <id>153</id> <edge_type>1</edge_type> <source_obj>39</source_obj> <sink_obj>40</sink_obj> </item> <item class_id_reference="20" object_id="_136"> <id>154</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>41</sink_obj> </item> <item class_id_reference="20" object_id="_137"> <id>155</id> <edge_type>1</edge_type> <source_obj>74</source_obj> <sink_obj>41</sink_obj> </item> <item class_id_reference="20" object_id="_138"> <id>156</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>41</sink_obj> </item> <item class_id_reference="20" object_id="_139"> <id>157</id> <edge_type>1</edge_type> <source_obj>41</source_obj> <sink_obj>42</sink_obj> </item> <item class_id_reference="20" object_id="_140"> <id>158</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>43</sink_obj> </item> <item class_id_reference="20" object_id="_141"> <id>159</id> <edge_type>2</edge_type> <source_obj>51</source_obj> <sink_obj>43</sink_obj> </item> <item class_id_reference="20" object_id="_142"> <id>160</id> <edge_type>2</edge_type> <source_obj>54</source_obj> <sink_obj>43</sink_obj> </item> <item class_id_reference="20" object_id="_143"> <id>161</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>45</sink_obj> </item> <item class_id_reference="20" object_id="_144"> <id>162</id> <edge_type>1</edge_type> <source_obj>45</source_obj> <sink_obj>46</sink_obj> </item> <item class_id_reference="20" object_id="_145"> <id>163</id> <edge_type>1</edge_type> <source_obj>42</source_obj> <sink_obj>46</sink_obj> </item> <item class_id_reference="20" object_id="_146"> <id>164</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>46</sink_obj> </item> <item class_id_reference="20" object_id="_147"> <id>165</id> <edge_type>1</edge_type> <source_obj>45</source_obj> <sink_obj>47</sink_obj> </item> <item class_id_reference="20" object_id="_148"> <id>166</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>47</sink_obj> </item> <item class_id_reference="20" object_id="_149"> <id>167</id> <edge_type>1</edge_type> <source_obj>42</source_obj> <sink_obj>47</sink_obj> </item> <item class_id_reference="20" object_id="_150"> <id>170</id> <edge_type>1</edge_type> <source_obj>38</source_obj> <sink_obj>48</sink_obj> </item> <item class_id_reference="20" object_id="_151"> <id>171</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>48</sink_obj> </item> <item class_id_reference="20" object_id="_152"> <id>172</id> <edge_type>1</edge_type> <source_obj>46</source_obj> <sink_obj>48</sink_obj> </item> <item class_id_reference="20" object_id="_153"> <id>175</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>49</sink_obj> </item> <item class_id_reference="20" object_id="_154"> <id>176</id> <edge_type>1</edge_type> <source_obj>48</source_obj> <sink_obj>49</sink_obj> </item> <item class_id_reference="20" object_id="_155"> <id>177</id> <edge_type>2</edge_type> <source_obj>54</source_obj> <sink_obj>50</sink_obj> </item> <item class_id_reference="20" object_id="_156"> <id>178</id> <edge_type>1</edge_type> <source_obj>38</source_obj> <sink_obj>58</sink_obj> </item> <item class_id_reference="20" object_id="_157"> <id>179</id> <edge_type>1</edge_type> <source_obj>41</source_obj> <sink_obj>58</sink_obj> </item> <item class_id_reference="20" object_id="_158"> <id>180</id> <edge_type>2</edge_type> <source_obj>63</source_obj> <sink_obj>59</sink_obj> </item> <item class_id_reference="20" object_id="_159"> <id>281</id> <edge_type>2</edge_type> <source_obj>10</source_obj> <sink_obj>17</sink_obj> </item> <item class_id_reference="20" object_id="_160"> <id>282</id> <edge_type>2</edge_type> <source_obj>17</source_obj> <sink_obj>69</sink_obj> </item> <item class_id_reference="20" object_id="_161"> <id>283</id> <edge_type>2</edge_type> <source_obj>17</source_obj> <sink_obj>23</sink_obj> </item> <item class_id_reference="20" object_id="_162"> <id>284</id> <edge_type>2</edge_type> <source_obj>23</source_obj> <sink_obj>29</sink_obj> </item> <item class_id_reference="20" object_id="_163"> <id>285</id> <edge_type>2</edge_type> <source_obj>29</source_obj> <sink_obj>67</sink_obj> </item> <item class_id_reference="20" object_id="_164"> <id>286</id> <edge_type>2</edge_type> <source_obj>29</source_obj> <sink_obj>44</sink_obj> </item> <item class_id_reference="20" object_id="_165"> <id>287</id> <edge_type>2</edge_type> <source_obj>44</source_obj> <sink_obj>54</sink_obj> </item> <item class_id_reference="20" object_id="_166"> <id>288</id> <edge_type>2</edge_type> <source_obj>44</source_obj> <sink_obj>51</sink_obj> </item> <item class_id_reference="20" object_id="_167"> <id>289</id> <edge_type>2</edge_type> <source_obj>51</source_obj> <sink_obj>54</sink_obj> </item> <item class_id_reference="20" object_id="_168"> <id>290</id> <edge_type>2</edge_type> <source_obj>54</source_obj> <sink_obj>60</sink_obj> </item> <item class_id_reference="20" object_id="_169"> <id>291</id> <edge_type>2</edge_type> <source_obj>54</source_obj> <sink_obj>57</sink_obj> </item> <item class_id_reference="20" object_id="_170"> <id>292</id> <edge_type>2</edge_type> <source_obj>57</source_obj> <sink_obj>63</sink_obj> </item> <item class_id_reference="20" object_id="_171"> <id>293</id> <edge_type>2</edge_type> <source_obj>60</source_obj> <sink_obj>63</sink_obj> </item> <item class_id_reference="20" object_id="_172"> <id>294</id> <edge_type>2</edge_type> <source_obj>63</source_obj> <sink_obj>29</sink_obj> </item> <item class_id_reference="20" object_id="_173"> <id>295</id> <edge_type>2</edge_type> <source_obj>67</source_obj> <sink_obj>17</sink_obj> </item> <item class_id_reference="20" object_id="_174"> <id>296</id> <edge_type>4</edge_type> <source_obj>42</source_obj> <sink_obj>58</sink_obj> </item> <item class_id_reference="20" object_id="_175"> <id>297</id> <edge_type>4</edge_type> <source_obj>40</source_obj> <sink_obj>55</sink_obj> </item> </edges> </cdfg> <cdfg_regions class_id="21" tracking_level="0" version="0"> <count>7</count> <item_version>0</item_version> <item class_id="22" tracking_level="1" version="0" object_id="_176"> <mId>1</mId> <mTag>call_Loop_LB2D_buf_p</mTag> <mType>0</mType> <sub_regions> <count>3</count> <item_version>0</item_version> <item>2</item> <item>3</item> <item>7</item> </sub_regions> <basic_blocks> <count>0</count> <item_version>0</item_version> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>2077921</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_177"> <mId>2</mId> <mTag>Entry</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>1</count> <item_version>0</item_version> <item>10</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_178"> <mId>3</mId> <mTag>LB2D_buf</mTag> <mType>1</mType> <sub_regions> <count>3</count> <item_version>0</item_version> <item>4</item> <item>5</item> <item>6</item> </sub_regions> <basic_blocks> <count>0</count> <item_version>0</item_version> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>1080</mMinTripCount> <mMaxTripCount>1080</mMaxTripCount> <mMinLatency>2077920</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_179"> <mId>4</mId> <mTag>Region 1</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>17</item> <item>23</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_180"> <mId>5</mId> <mTag>LB2D_buf.1</mTag> <mType>1</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>7</count> <item_version>0</item_version> <item>29</item> <item>44</item> <item>51</item> <item>54</item> <item>57</item> <item>60</item> <item>63</item> </basic_blocks> <mII>1</mII> <mDepth>3</mDepth> <mMinTripCount>1920</mMinTripCount> <mMaxTripCount>1920</mMaxTripCount> <mMinLatency>1921</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_181"> <mId>6</mId> <mTag>Region 2</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>1</count> <item_version>0</item_version> <item>67</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_182"> <mId>7</mId> <mTag>Return</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>1</count> <item_version>0</item_version> <item>69</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> </cdfg_regions> <fsm class_id="-1"></fsm> <res class_id="-1"></res> <node_label_latency class_id="26" tracking_level="0" version="0"> <count>43</count> <item_version>0</item_version> <item class_id="27" tracking_level="0" version="0"> <first>7</first> <second class_id="28" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>8</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>9</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>11</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>12</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>13</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>15</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>16</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>20</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>21</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>22</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>24</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>25</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>26</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>27</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>28</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>30</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>34</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>35</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>36</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>37</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>38</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>39</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>40</first> <second> <first>2</first> <second>1</second> </second> </item> <item> <first>41</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>42</first> <second> <first>2</first> <second>1</second> </second> </item> <item> <first>43</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>45</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>46</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>47</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>48</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>49</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>50</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>52</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>53</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>55</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>56</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>58</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>59</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>62</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>64</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>66</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>68</first> <second> <first>1</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="29" tracking_level="0" version="0"> <count>12</count> <item_version>0</item_version> <item class_id="30" tracking_level="0" version="0"> <first>10</first> <second class_id="31" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>17</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>23</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>29</first> <second> <first>2</first> <second>2</second> </second> </item> <item> <first>44</first> <second> <first>2</first> <second>4</second> </second> </item> <item> <first>51</first> <second> <first>3</first> <second>4</second> </second> </item> <item> <first>54</first> <second> <first>3</first> <second>3</second> </second> </item> <item> <first>57</first> <second> <first>4</first> <second>4</second> </second> </item> <item> <first>60</first> <second> <first>4</first> <second>4</second> </second> </item> <item> <first>63</first> <second> <first>4</first> <second>4</second> </second> </item> <item> <first>67</first> <second> <first>3</first> <second>3</second> </second> </item> <item> <first>69</first> <second> <first>1</first> <second>1</second> </second> </item> </bblk_ent_exit> <regions class_id="32" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="33" tracking_level="1" version="0" object_id="_183"> <region_name>LB2D_buf.1</region_name> <basic_blocks> <count>7</count> <item_version>0</item_version> <item>29</item> <item>44</item> <item>51</item> <item>54</item> <item>57</item> <item>60</item> <item>63</item> </basic_blocks> <nodes> <count>0</count> <item_version>0</item_version> </nodes> <anchor_node>-1</anchor_node> <region_type>8</region_type> <interval>1</interval> <pipe_depth>3</pipe_depth> </item> </regions> <dp_fu_nodes class_id="34" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_fu_nodes> <dp_fu_nodes_expression class_id="35" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_fu_nodes_expression> <dp_fu_nodes_module> <count>0</count> <item_version>0</item_version> </dp_fu_nodes_module> <dp_fu_nodes_io> <count>0</count> <item_version>0</item_version> </dp_fu_nodes_io> <return_ports> <count>0</count> <item_version>0</item_version> </return_ports> <dp_mem_port_nodes class_id="36" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_mem_port_nodes> <dp_reg_nodes> <count>0</count> <item_version>0</item_version> </dp_reg_nodes> <dp_regname_nodes> <count>0</count> <item_version>0</item_version> </dp_regname_nodes> <dp_reg_phi> <count>0</count> <item_version>0</item_version> </dp_reg_phi> <dp_regname_phi> <count>0</count> <item_version>0</item_version> </dp_regname_phi> <dp_port_io_nodes class_id="37" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_port_io_nodes> <port2core class_id="38" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </port2core> <node2core> <count>0</count> <item_version>0</item_version> </node2core> </syndb> </boost_serialization>

27.520795

136

0.598358

22b64765c7435d69179d2ca7a7208fc49b77da99

4,951

adb

Ada

test/mat/vulkan-math-mat2x3-test.adb

zrmyers/VulkanAda

ed8c46d923bc8936db3a5d55d36afebb928a9ede

[ "MIT" ]

1

2021-01-29T21:10:45.000Z

test/mat/vulkan-math-mat2x3-test.adb

zrmyers/VulkanAda

ed8c46d923bc8936db3a5d55d36afebb928a9ede

[ "MIT" ]

8

2020-04-22T14:55:20.000Z

2021-11-22T03:58:08.000Z

test/mat/vulkan-math-mat2x3-test.adb

zrmyers/VulkanAda

ed8c46d923bc8936db3a5d55d36afebb928a9ede

[ "MIT" ]

1

2021-04-05T13:19:21.000Z

-------------------------------------------------------------------------------- -- MIT License -- -- Copyright (c) 2021 Zane Myers -- -- Permission is hereby granted, free of charge, to any person obtaining a copy -- of this software and associated documentation files (the "Software"), to deal -- in the Software without restriction, including without limitation the rights -- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell -- copies of the Software, and to permit persons to whom the Software is -- furnished to do so, subject to the following conditions: -- -- The above copyright notice and this permission notice shall be included in all -- copies or substantial portions of the Software. -- -- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER -- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, -- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE -- SOFTWARE. -------------------------------------------------------------------------------- with Ada.Text_IO; with Ada.Characters.Latin_1; with Vulkan.Test.Framework; with Vulkan.Math.GenFMatrix; with Vulkan.Math.Mat2x3; with Vulkan.Math.Mat2x2; with Vulkan.Math.GenFType; with Vulkan.Math.Vec2; with Vulkan.Math.Vec3; use Ada.Text_IO; use Ada.Characters.Latin_1; use Vulkan.Math.Mat2x2; use Vulkan.Math.Mat2x3; use Vulkan.Math.GenFType; use Vulkan.Math.Vec2; use Vulkan.Math.Vec3; use Vulkan.Test.Framework; -------------------------------------------------------------------------------- --< @group Vulkan Math Basic Types -------------------------------------------------------------------------------- --< @summary --< This package provides tests for single precision floating point mat2x3. -------------------------------------------------------------------------------- package body Vulkan.Math.Mat2x3.Test is -- Test Mat2x3 procedure Test_Mat2x3 is vec1 : Vkm_Vec2 := Make_Vec2(1.0, 2.0); vec2 : Vkm_Vec3 := Make_Vec3(1.0, 2.0, 3.0); mat1 : Vkm_Mat2x3 := Make_Mat2x3; mat2 : Vkm_Mat2x3 := Make_Mat2x3(0.0, 1.0, 2.0, 3.0, 4.0, 5.0); mat3 : Vkm_Mat2x3 := Make_Mat2x3(vec2, - vec2); mat4 : Vkm_Mat2x3 := Make_Mat2x3(mat2); mat5 : Vkm_Mat2x2 := Make_Mat2x2(5.0); mat6 : Vkm_Mat2x3 := Make_Mat2x3(mat5); mat7 : Vkm_Mat2x2 := Make_Mat2x2( 1.0, -1.0, -1.0, 2.0); begin Put_Line(LF & "Testing Mat2x3 Constructors..."); Put_Line("mat1 " & mat1.Image); Assert_Mat2x3_Equals(mat1, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0); Put_Line("mat2 " & mat2.Image); Assert_Mat2x3_Equals(mat2, 0.0, 1.0, 2.0, 3.0, 4.0, 5.0); Put_Line("mat3 " & mat3.Image); Assert_Mat2x3_Equals(mat3, 1.0, 2.0, 3.0, -1.0, -2.0, -3.0); Put_Line("mat4 " & mat4.Image); Assert_Mat2x3_Equals(mat4, 0.0, 1.0, 2.0, 3.0, 4.0, 5.0); Put_Line("mat6 " & mat6.Image); Assert_Mat2x3_Equals(mat6, 5.0, 0.0, 0.0, 0.0, 5.0, 0.0); Put_Line("Testing '=' operator..."); Put_Line(" mat2 != mat3"); Assert_Vkm_Bool_Equals(mat2 = mat3, False); Put_Line(" mat4 != mat5"); Assert_Vkm_Bool_Equals(mat4 = mat5, False); Put_Line(" mat4 = mat2"); Assert_Vkm_Bool_Equals(mat4 = mat2, True); Put_Line(" Testing unary '+/-' operator"); Put_Line(" + mat4 = " & Image(+ mat4)); Assert_Mat2x3_Equals(+mat4, 0.0, 1.0, 2.0, 3.0, 4.0, 5.0); Put_Line(" - mat4 = " & Image(- mat4)); Assert_Mat2x3_Equals(-mat4, -0.0, -1.0, -2.0, -3.0, -4.0, -5.0); Put_Line("+(- mat4) = " & Image(+(- mat4))); Assert_Mat2x3_Equals(-mat4, -0.0, -1.0, -2.0, -3.0, -4.0, -5.0); Put_Line("Testing 'abs' operator..."); Put_Line(" abs(- mat4) = " & Image(abs(-mat4))); Assert_Mat2x3_Equals(abs(-mat4), 0.0, 1.0, 2.0, 3.0, 4.0, 5.0); Put_Line("Testing '+' operator..."); Put_Line(" mat4 + mat3 = " & Image(mat4 + mat3)); Assert_Mat2x3_Equals(mat4 + mat3, 1.0, 3.0, 5.0, 2.0, 2.0, 2.0); Put_Line("Testing '-' operator..."); Put_Line(" mat4 - mat3 = " & Image(mat4 -mat3)); Assert_Mat2x3_Equals(mat4 - mat3, -1.0, -1.0, -1.0, 4.0, 6.0, 8.0); Put_Line("Testing '*' operator..."); Put_Line(" mat7 * mat4 = " & Image(mat7 * mat4)); Assert_Mat2x3_Equals(mat7 * mat4, -3.0, -3.0, -3.0, 6.0, 7.0, 8.0); Put_Line(" mat4 * vec2 = " & Image(mat4 * vec2)); Assert_Vec2_Equals(mat4 * vec2, 8.0, 26.0); Put_Line(" vec1 * mat4 = " & Image(vec1 * mat4)); Assert_Vec3_Equals(vec1 * mat4, 6.0, 9.0, 12.0); end Test_Mat2x3; end Vulkan.Math.Mat2x3.Test;

33.452703

81

0.574025

3d2eb1d90bcc824a3de4729319154f011cdfb36c

4,384

ads

Ada

source/amf/uml/amf-standard_profile_l2-metaclasses.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-metaclasses.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-metaclasses.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

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

60.054795

78

0.452555

3d6c82c47398b92500de6135b3e441f82adeb5f7

355

ads

Ada

src/tom/library/sl/ada/objectpack.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/objectpack.ads

rewriting/tom

2918e95c78006f08a2a0919ef440413fa5c2342a

[ "BSD-3-Clause" ]

null

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

rewriting/tom

2918e95c78006f08a2a0919ef440413fa5c2342a

[ "BSD-3-Clause" ]

6

2017-11-30T17:07:10.000Z

2022-03-12T14:46:21.000Z

package ObjectPack is type Object is interface; function toString(obj: Object) return String is abstract; type ObjectPtr is access all Object'Class; type ObjectPtrArray is array (Natural range <>) of ObjectPtr; type ObjectPtrArrayPtr is access all ObjectPtrArray; generic type Item is private; function hash(obj: Item) return Integer; end;

25.357143

62

0.774648

2e9b093a6af799eb7ac1d5a027a10974250af2d3

196

ads

Ada

1-base/math/applet/test/suite/math_tests-geometry_2d.ads

charlie5/lace

e9b7dc751d500ff3f559617a6fc3089ace9dc134

[ "0BSD" ]

20

2015-11-04T09:23:59.000Z

2022-01-14T10:21:42.000Z

1-base/math/applet/test/suite/math_tests-geometry_2d.ads

charlie5/lace

e9b7dc751d500ff3f559617a6fc3089ace9dc134

[ "0BSD" ]

2

2015-11-04T17:05:56.000Z

2015-12-08T03:16:13.000Z

1-base/math/applet/test/suite/math_tests-geometry_2d.ads

charlie5/lace

e9b7dc751d500ff3f559617a6fc3089ace9dc134

[ "0BSD" ]

1

2015-12-07T12:53:52.000Z

with Ahven.Framework; package math_Tests.Geometry_2d is type Test is new Ahven.Framework.Test_Case with null record; procedure Initialize (T : in out Test); end math_Tests.Geometry_2d;

16.333333

63

0.770408

41b5ce0b2282271eeff831d968b76845c0b00602

5,336

adb

Ada

source/libgela/gela-classificators-utf_8.adb

faelys/gela-asis

48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253

[ "BSD-3-Clause" ]

4

2016-02-05T15:51:56.000Z

2022-03-25T20:38:32.000Z

source/libgela/gela-classificators-utf_8.adb

faelys/gela-asis

48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253

[ "BSD-3-Clause" ]

null

source/libgela/gela-classificators-utf_8.adb

faelys/gela-asis

48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- G E L A A S I S -- -- ASIS implementation for Gela project, a portable Ada compiler -- -- http://gela.ada-ru.org -- -- - - - - - - - - - - - - - - - -- -- Read copyright and license at the end of this file -- ------------------------------------------------------------------------------ -- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $ with Gela.Classificators.Cache; package body Gela.Classificators.UTF_8 is package Cache is new Classificators.Cache (To_Character_Class); ---------------- -- Initialize -- ---------------- procedure Initialize is begin Cache.Initialize; end Initialize; ---------- -- Read -- ---------- procedure Read (Object : in out Classificator; Input : in out Source_Buffers.Cursor; Buffer : in out Character_Class_Buffers.Character_Class_Buffer) is use Gela.Source_Buffers; use Gela.Character_Class_Buffers; Full : Boolean := False; Code : Code_Unit; Item : Code_Point; Class : Character_Class; Skip : Natural range 0 .. 5; begin loop Code := Element (Input); Item := Code_Unit'Pos (Code); case Item is when 16#00# .. 16#7F# => Skip := 0; when 16#80# .. 2#1101_1111# => Skip := 1; Next (Input); Item := (Item and 2#1_1111#) * 2 ** 6 + (Code_Unit'Pos (Element (Input)) and 2#11_1111#); when 2#1110_0000# .. 2#1110_1111# => Skip := 2; Next (Input); Item := (Item and 2#1111#) * 2 ** 6 + (Code_Unit'Pos (Element (Input)) and 2#11_1111#); Next (Input); Item := Item * 2 ** 6 + (Code_Unit'Pos (Element (Input)) and 2#11_1111#); when 2#1111_0000# .. 2#1111_0111# => Skip := 3; Next (Input); Item := (Item and 2#111#) * 2 ** 6 + (Code_Unit'Pos (Element (Input)) and 2#11_1111#); Next (Input); Item := Item * 2 ** 6 + (Code_Unit'Pos (Element (Input)) and 2#11_1111#); Next (Input); Item := Item * 2 ** 6 + (Code_Unit'Pos (Element (Input)) and 2#11_1111#); when 2#1111_1000# .. 2#1111_1011# => Skip := 4; Item := 16#FFFF#; Next (Input); Next (Input); Next (Input); Next (Input); when others => Skip := 5; Item := 16#FFFF#; Next (Input); Next (Input); Next (Input); Next (Input); Next (Input); end case; Class := Cache.Get_Character_Class (Item); Put (Buffer, Class, Full); if Code = End_Of_File then Put (Buffer, Class, Full); exit; end if; Next (Input); for J in 1 .. Skip loop Put (Buffer, Skip_Code, Full); end loop; if Full then return; end if; end loop; end Read; end Gela.Classificators.UTF_8; ------------------------------------------------------------------------------ -- Copyright (c) 2008, Maxim Reznik -- All rights reserved. -- -- Redistribution and use in source and binary forms, with or without -- modification, are permitted provided that the following conditions are met: -- -- * Redistributions of source code must retain the above copyright notice, -- this list of conditions and the following disclaimer. -- * Redistributions in binary form must reproduce the above copyright -- notice, this list of conditions and the following disclaimer in the -- documentation and/or other materials provided with the distribution. -- * Neither the name of the Maxim Reznik, IE nor the names of its -- contributors may be used to endorse or promote products derived from -- this software without specific prior written permission. -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" -- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE -- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE -- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR -- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF -- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS -- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN -- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) -- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE -- POSSIBILITY OF SUCH DAMAGE. -- ------------------------------------------------------------------------------

36.547945

79

0.501687

57d84a2935d50110ceba0b9a88a26ac3f3c8653c

1,247

ads

Ada

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

package Opt8 is type Value_Number_Kind is (Int_Literal_VN, Selected_Address_VN, Membership_VN, Initial_External_Kappa_VN, Aliased_Kappa_VN, Phi_As_Kappa_VN, Multi_Target_Call_Kappa_VN, Final_Value_Of_Seq_Kappa_VN, Block_Kappa_VN); subtype Kappa_VN is Value_Number_Kind range Initial_External_Kappa_VN .. Block_Kappa_VN; type Value_Number_Id is new Positive; type Kappa_Component_Rec; type Kappa_Component_Ptr is access Kappa_Component_Rec; type Kappa_Component_Rec is record Content_VN : Value_Number_Id; Next : Kappa_Component_Ptr; end record; type Value_Number_Rec(Kind : Value_Number_Kind) is record Id: Value_Number_Id; case Kind is when Int_Literal_VN => Int_Val : Integer; when Kappa_VN => Old_Value : Kappa_Component_Rec; Possible_New_Values : Kappa_Component_Ptr; Use_Default : Boolean; when Others => null; end case; end record; type Value_Number is access all Value_Number_Rec; function VN_Complexity (Val : Value_Number; N : Natural) return Natural; end Opt8;

26.531915

76

0.655172

22d7f68c19a16555d250800f21ecd0ddcf76a766

925

ads

Ada

gdb-7.3/gdb/testsuite/gdb.ada/formatted_ref/defs.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

gdb-7.3/gdb/testsuite/gdb.ada/formatted_ref/defs.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

gdb-7.3/gdb/testsuite/gdb.ada/formatted_ref/defs.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

-- Copyright 2007, 2008, 2009, 2010, 2011 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 Defs is type Struct1 is limited record X : Integer := 13; Y : Integer := 19; end record; function F1 (S : Struct1) return Integer; S1 : Struct1; end Defs;

33.035714

73

0.708108

ad1f66be43367b6e1c28819d3e914ca3b3ca65f2

4,874

adb

Ada

tests/simple_site.adb

faelys/natools-web

f7ba99f2ffb6f5a06d1b1e8becbf5f92fd58c750

[ "0BSD" ]

1

2015-04-23T10:48:58.000Z

tests/simple_site.adb

faelys/natools-web

f7ba99f2ffb6f5a06d1b1e8becbf5f92fd58c750

[ "0BSD" ]

null

tests/simple_site.adb

faelys/natools-web

f7ba99f2ffb6f5a06d1b1e8becbf5f92fd58c750

[ "0BSD" ]

null

------------------------------------------------------------------------------ -- Copyright (c) 2014-2017, Natacha Porté -- -- -- -- Permission to use, copy, modify, and distribute this software for any -- -- purpose with or without fee is hereby granted, provided that the above -- -- copyright notice and this permission notice appear in all copies. -- -- -- -- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES -- -- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF -- -- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR -- -- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES -- -- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN -- -- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF -- -- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. -- ------------------------------------------------------------------------------ with Ada.Command_Line; with Ada.Directories; with Ada.Text_IO; with AWS.Config; with AWS.Server; with Common; with Common.Pages; with Common.Test_Maps; with Natools.Web.ACL.Sx_Backends; with Natools.Web.Backends.Filesystem; with Natools.Web.Comment_Cookies.Base_64; with Natools.Web.Cookie_Setters; with Natools.Web.Escapes.Filters; with Natools.Web.Filters.Pass_Through; with Natools.Web.Filters.Text_Blocks; with Natools.Web.Filters.Text_Replacement; with Natools.Web.Reload_Pages; with Natools.Web.Simple_Pages; with Natools.Web.Simple_Pages.Multipages; with Natools.Web.Simple_Pages.Dynamic_Multipages; with Natools.Web.Tag_Pages; with Syslog.Guess.App_Name; with Syslog.Guess.Hostname; with Syslog.Transport.Send_Task; with Syslog.Transport.UDP; procedure Simple_Site is WS : AWS.Server.HTTP; Debug : constant Boolean := Ada.Command_Line.Argument_Count >= 2; begin pragma Assert (Common.Test_Maps); if Debug then Natools.Web.Log := Common.Text_IO_Log'Access; else Syslog.Guess.App_Name; Syslog.Guess.Hostname; Syslog.Transport.UDP.Connect ("127.0.0.1"); Syslog.Transport.Send_Task.Set_Backend (Syslog.Transport.UDP.Transport); Syslog.Set_Transport (Syslog.Transport.Send_Task.Transport); Syslog.Set_Default_Facility (Syslog.Facilities.Daemon); Natools.Web.Log := Common.Syslog_Log'Access; end if; Natools.Web.ACL.Sx_Backends.Register ('2', Common.SHA256_Digest'Access); Common.Site.Register ("cookie-setter", Natools.Web.Cookie_Setters.Create'Access); Common.Site.Register ("dynamic-multipage", Natools.Web.Simple_Pages.Dynamic_Multipages.Create'Access); Common.Site.Register ("multipage", Natools.Web.Simple_Pages.Multipages.Create'Access); Common.Site.Register ("reload-page", Natools.Web.Reload_Pages.Create'Access); Common.Site.Register ("simple-page", Natools.Web.Simple_Pages.Create'Access); Common.Site.Register ("tag-page", Natools.Web.Tag_Pages.Create'Access); Common.Site.Register ("test-page", Common.Pages.Create'Access); Common.Site.Register ("directory", Natools.Web.Backends.Filesystem.Create'Access); Common.Site.Register ("html-escape", Natools.Web.Escapes.Filters.Create'Access); Common.Site.Register ("pass-through", Natools.Web.Filters.Pass_Through.Create'Access); Common.Site.Register ("text-block", Natools.Web.Filters.Text_Blocks.Create'Access); Common.Site.Register ("text-replacement", Natools.Web.Filters.Text_Replacement.Create'Access); Common.Site.Register ("s-expr", Natools.Web.ACL.Sx_Backends.Create'Access); Common.Site.Register (Natools.Web.Comment_Cookies.Base_64.Key, Natools.Web.Comment_Cookies.Base_64.Decoder'Access); Common.Site.Set_Cookie_Encoder (Natools.Web.Comment_Cookies.Base_64.Encoder'Access, Natools.Web.Comment_Cookies.Positional); if Ada.Command_Line.Argument_Count >= 1 then Common.Site.Load (Ada.Command_Line.Argument (1)); else Common.Site.Load ("site.sx"); end if; AWS.Server.Start (WS, Common.Respond'Access, AWS.Config.Get_Current); if not Debug then AWS.Server.Wait; elsif Ada.Directories.Exists (Ada.Command_Line.Argument (2)) then Ada.Text_IO.Put_Line ("Websever started, waiting for removal of " & Ada.Command_Line.Argument (2)); loop delay 1.0; exit when not Ada.Directories.Exists (Ada.Command_Line.Argument (2)); end loop; else Ada.Text_IO.Put_Line ("Websever started, waiting for Q press"); AWS.Server.Wait (AWS.Server.Q_Key_Pressed); end if; AWS.Server.Shutdown (WS); Common.Site.Purge; end Simple_Site;

40.280992

78

0.679524

c7458f4628e24044303b48e36b9b25558cd66c8d

10,359

ads

Ada

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

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

69

2015-01-02T10:45:56.000Z

2021-09-06T07:52:13.000Z

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S E M _ C H 8 -- -- -- -- S p e c -- -- -- -- $Revision$ -- -- -- Copyright (C) 1992-2001 Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Types; use Types; package Sem_Ch8 is ----------------------------------- -- Handling extensions of System -- ----------------------------------- -- For targets that define a much larger System package than given in -- the RM, we use a child package containing additional declarations, -- which is loaded when needed, and whose entities are conceptually -- within System itself. The presence of this auxiliary package is -- controlled with the pragma Extend_System. The following variable -- holds the entity of the auxiliary package, to simplify the special -- visibility rules that apply to it. System_Aux_Id : Entity_Id := Empty; ----------------- -- Subprograms -- ----------------- procedure Analyze_Exception_Renaming (N : Node_Id); procedure Analyze_Expanded_Name (N : Node_Id); procedure Analyze_Generic_Function_Renaming (N : Node_Id); procedure Analyze_Generic_Package_Renaming (N : Node_Id); procedure Analyze_Generic_Procedure_Renaming (N : Node_Id); procedure Analyze_Object_Renaming (N : Node_Id); procedure Analyze_Package_Renaming (N : Node_Id); procedure Analyze_Subprogram_Renaming (N : Node_Id); procedure Analyze_Use_Package (N : Node_Id); procedure Analyze_Use_Type (N : Node_Id); function Applicable_Use (Pack_Name : Node_Id) return Boolean; -- Common code to Use_One_Package and Set_Use, to determine whether -- use clause must be processed. Pack_Name is an entity name that -- references the package in question. procedure End_Scope; -- Called at end of scope. On exit from blocks and bodies (subprogram, -- package, task, and protected bodies), the name of the current scope -- must be removed from the scope stack, and the local entities must be -- removed from their homonym chains. On exit from record declarations, -- from package specifications, and from tasks and protected type -- specifications, more specialized procedures are invoked. procedure End_Use_Clauses (Clause : Node_Id); -- Invoked on scope exit, to undo the effect of local use clauses. U is -- the first Use clause of a scope being exited. This can be the current -- scope, or some enclosing scopes when building a clean environment to -- compile an instance body for inlining. procedure End_Use_Package (N : Node_Id); procedure End_Use_Type (N : Node_Id); -- Subsidiaries of End_Use_Clauses. Also called directly for use clauses -- appearing in context clauses. procedure Find_Direct_Name (N : Node_Id); -- Given a direct name (Identifier or Operator_Symbol), this routine -- scans the homonym chain for the name searching for corresponding -- visible entities to find the referenced entity (or in the case of -- overloading), entities. On return, the Entity, and Etype fields -- are set. In the non-overloaded case, these are the correct final -- entries. In the overloaded case, Is_Overloaded is set, Etype and -- Entity refer to an arbitrary element of the overloads set, and -- an appropriate list of entries has been made in the overload -- interpretation table (to be disambiguated in the resolve phase). procedure Find_Expanded_Name (N : Node_Id); -- Selected component is known to be expanded name. Verify legality -- of selector given the scope denoted by prefix. procedure Find_Selected_Component (N : Node_Id); -- Resolve various cases of selected components, recognize expanded names procedure Find_Type (N : Node_Id); -- Perform name resolution, and verify that the name found is that of a -- type. On return the Entity and Etype fields of the node N are set -- appropriately. If it is an incomplete type whose full declaration has -- been seen, return the entity in the full declaration. Similarly, if -- the type is private, it has receivd a full declaration, and we are -- in the private part or body of the package, return the full -- declaration as well. Special processing for Class types as well. function Get_Full_View (T_Name : Entity_Id) return Entity_Id; -- If T_Name is an incomplete type and the full declaration has been -- seen, or is the name of a class_wide type whose root is incomplete. -- return the corresponding full declaration. function Has_Implicit_Operator (N : Node_Id) return Boolean; -- N is an expanded name whose selector is an operator name (eg P."+"). -- A 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 artifact of -- our implementation: a more straightforward but more space-consuming -- choice would be to make all inherited operators explicit in the -- symbol table. procedure Initialize; -- Initializes data structures used for visibility analysis. Must be -- called before analyzing each new main source program. procedure Install_Use_Clauses (Clause : Node_Id); -- applies the use clauses appearing in a given declarative part, -- when the corresponding scope has been placed back on the scope -- stack after unstacking to compile a different context (subunit or -- parent of generic body). function In_Open_Scopes (S : Entity_Id) return Boolean; -- S is the entity of a scope. This function determines if this scope -- is currently open (i.e. it appears somewhere in the scope stack). function Is_Appropriate_For_Record (T : Entity_Id) return Boolean; -- Prefix is appropriate for record if it is of a record type, or -- an access to such. function Is_Appropriate_For_Entry_Prefix (T : Entity_Id) return Boolean; -- True if it is of a task type, a protected type, or else an access -- to one of these types. procedure New_Scope (S : Entity_Id); -- Make new scope stack entry, pushing S, the entity for a scope -- onto the top of the scope table. The current setting of the scope -- suppress flags is saved for restoration on exit. procedure Pop_Scope; -- Remove top entry from scope stack, restoring the saved setting -- of the scope suppress flags. function Present_System_Aux (N : Node_Id := Empty) return Boolean; -- Return True if the auxiliary system file has been successfully loaded. -- Otherwise attempt to load it, using the name supplied by a previous -- Extend_System pragma, and report on the success of the load. -- If N is present, it is a selected component whose prefix is System, -- or else a with-clause on system. N is absent when the function is -- called to find the visibility of implicit operators. procedure Restore_Scope_Stack; procedure Save_Scope_Stack; -- These two procedures are called from Semantics, when a unit U1 is -- to be compiled in the course of the compilation of another unit U2. -- This happens whenever Rtsfind is called. U1, the unit retrieved by -- Rtsfind, must be compiled in its own context, and the current scope -- stack containing U2 and local scopes must be made unreachable. On -- return, the contents of the scope stack must be made accessible again. procedure Use_One_Package (P : Entity_Id; N : Node_Id); -- Make visible entities declarated 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; N : Node_Id); -- Id is the subtype mark from a use type clause. This procedure makes -- the primitive operators of the type potentially use-visible. -- N is the Use_Type_Clause that names Id. procedure Set_Use (L : List_Id); -- Find use clauses that are declarative items in a package declaration -- and set the potentially use-visible flags of imported entities before -- analyzing the corresponding package body. end Sem_Ch8;

54.235602

78

0.631818

41b7a60563ab0133b4c8ab79ebfeaea4ac779851

2,200

adb

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/stack_usage1c.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/stack_usage1c.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- { dg-do compile } -- { dg-options "-O2 -fstack-usage" } with Stack_Usage1_Pkg; use Stack_Usage1_Pkg; procedure Stack_Usage1c is A : Integer := Ident_Int (123); begin case A is when 0 => My_Proc (R'(Ident_Int(0), Ident_Int(1), Ident_Int(2), Ident_Int(3), Ident_Int(4), Ident_Int(5), Ident_Int(6), Ident_Int(7), Ident_Int(8), Ident_Int(9))); when 1 => My_Proc (R'(Ident_Int(0), Ident_Int(1), Ident_Int(2), Ident_Int(3), Ident_Int(4), Ident_Int(5), Ident_Int(6), Ident_Int(7), Ident_Int(8), Ident_Int(9))); when 2 => My_Proc (R'(Ident_Int(0), Ident_Int(1), Ident_Int(2), Ident_Int(3), Ident_Int(4), Ident_Int(5), Ident_Int(6), Ident_Int(7), Ident_Int(8), Ident_Int(9))); when 3 => My_Proc (R'(Ident_Int(0), Ident_Int(1), Ident_Int(2), Ident_Int(3), Ident_Int(4), Ident_Int(5), Ident_Int(6), Ident_Int(7), Ident_Int(8), Ident_Int(9))); when 4 => My_Proc (R'(Ident_Int(0), Ident_Int(1), Ident_Int(2), Ident_Int(3), Ident_Int(4), Ident_Int(5), Ident_Int(6), Ident_Int(7), Ident_Int(8), Ident_Int(9))); when 5 => My_Proc (R'(Ident_Int(0), Ident_Int(1), Ident_Int(2), Ident_Int(3), Ident_Int(4), Ident_Int(5), Ident_Int(6), Ident_Int(7), Ident_Int(8), Ident_Int(9))); when 6 => My_Proc (R'(Ident_Int(0), Ident_Int(1), Ident_Int(2), Ident_Int(3), Ident_Int(4), Ident_Int(5), Ident_Int(6), Ident_Int(7), Ident_Int(8), Ident_Int(9))); when 7 => My_Proc (R'(Ident_Int(0), Ident_Int(1), Ident_Int(2), Ident_Int(3), Ident_Int(4), Ident_Int(5), Ident_Int(6), Ident_Int(7), Ident_Int(8), Ident_Int(9))); when 8 => My_Proc (R'(Ident_Int(0), Ident_Int(1), Ident_Int(2), Ident_Int(3), Ident_Int(4), Ident_Int(5), Ident_Int(6), Ident_Int(7), Ident_Int(8), Ident_Int(9))); when 9 => My_Proc (R'(Ident_Int(0), Ident_Int(1), Ident_Int(2), Ident_Int(3), Ident_Int(4), Ident_Int(5), Ident_Int(6), Ident_Int(7), Ident_Int(8), Ident_Int(9))); when others => null; end case; end Stack_Usage1c; -- { dg-final { scan-stack-usage "\t\[0-9\]\[0-9\]\t" { target i?86-*-* x86_64-*-* } } } -- { dg-final { cleanup-stack-usage } }

55

163

0.618636

2ef1592fbe63dbc09a48702b2a0bab8be471f169

2,249

ads

Ada

source/types/adam-record_component.ads

charlie5/aIDE

fab406dbcd9b72a4cb215ffebb05166c788d6365

[ "MIT" ]

3

2017-04-29T14:25:22.000Z

2017-09-29T10:15:28.000Z

source/types/adam-record_component.ads

charlie5/aIDE

fab406dbcd9b72a4cb215ffebb05166c788d6365

[ "MIT" ]

null

source/types/adam-record_component.ads

charlie5/aIDE

fab406dbcd9b72a4cb215ffebb05166c788d6365

[ "MIT" ]

null

with AdaM.Entity, AdaM.a_Type, AdaM.component_Definition, Ada.Containers.Vectors, Ada.Streams; package AdaM.record_Component is type Item is new Entity.item with private; -- View -- type View is access all Item'Class; procedure View_write (Stream : not null access Ada.Streams.Root_Stream_Type'Class; Self : in View); procedure View_read (Stream : not null access Ada.Streams.Root_Stream_Type'Class; Self : out View); for View'write use View_write; for View'read use View_read; -- Vector -- package Vectors is new ada.Containers.Vectors (Positive, View); subtype Vector is Vectors.Vector; -- Forge -- function new_Component (Name : in String) return record_Component.view; procedure free (Self : in out record_Component.view); procedure destruct (Self : in out record_Component.item); -- Attributes -- overriding function Id (Self : access Item) return AdaM.Id; overriding function Name (Self : in Item) return Identifier; procedure Name_is (Self : out Item; Now : in Identifier); function is_Aliased (Self : in Item) return Boolean; -- procedure Definition_is (Self : in out Item; Now : in AdaM.component_Definition.view); function Definition (Self : in Item) return AdaM.component_Definition.view; -- procedure Type_is (Self : in out Item; Now : in AdaM.a_Type.view); -- function my_Type (Self : in Item) return AdaM.a_Type.view; -- function my_Type (Self : access Item) return access AdaM.a_Type.view; procedure Default_is (Self : in out Item; Now : in String); function Default (Self : in Item) return String; overriding function to_Source (Self : in Item) return text_Vectors.Vector; private type Item is new Entity.item with record Name : Text; Definition : component_Definition.view; -- is_Aliased : Boolean := False; -- my_Type : aliased a_Type.view; Initialiser : Text; end record; end AdaM.record_Component;

27.426829

96

0.621165

29d94f48e34f63cfb3a2b6e2e5848b397da6bdca

274

adb

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/test_bounded.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/test_bounded.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/test_bounded.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 Test_Bounded is type Bounded (Length : Natural := 0) is record S : String (1..Length); end record; type Ref is access all Bounded; X : Ref := new Bounded; begin null; end Test_Bounded;

19.571429

42

0.59854

4159173b0228ac677642aeabc1379299df6ef605

2,685

adb

Ada

source/tasking/required/s-tpoben.adb

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

33

2015-04-04T09:19:36.000Z

2021-11-10T05:33:34.000Z

source/tasking/required/s-tpoben.adb

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

8

2017-11-14T13:05:07.000Z

2018-08-09T15:28:49.000Z

source/tasking/required/s-tpoben.adb

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

9

2015-02-03T17:09:53.000Z

2021-11-12T01:16:05.000Z

pragma Check_Policy (Trace => Ignore); package body System.Tasking.Protected_Objects.Entries is procedure Cancel_Call (Call : not null Node_Access); procedure Cancel_Call (Call : not null Node_Access) is begin -- C940016, not Tasking_Error Ada.Exceptions.Save_Exception (Call.X, Program_Error'Identity); Synchronous_Objects.Set (Call.Waiting); end Cancel_Call; procedure Cancel_Call (X : in out Synchronous_Objects.Queue_Node_Access); procedure Cancel_Call (X : in out Synchronous_Objects.Queue_Node_Access) is Call : constant not null Node_Access := Downcast (X); begin Cancel_Call (Call); end Cancel_Call; -- implementation procedure Initialize_Protection_Entries ( Object : not null access Protection_Entries'Class; Ceiling_Priority : Integer; Compiler_Info : Address; Entry_Queue_Maxes : Protected_Entry_Queue_Max_Access; Entry_Bodies : Protected_Entry_Body_Access; Find_Body_Index : Find_Body_Index_Access) is pragma Unreferenced (Ceiling_Priority); pragma Unreferenced (Entry_Queue_Maxes); begin Synchronous_Objects.Initialize (Object.Mutex); Synchronous_Objects.Initialize (Object.Calling, Object.Mutex'Access); Object.Compiler_Info := Compiler_Info; Object.Entry_Bodies := Entry_Bodies; Object.Find_Body_Index := Find_Body_Index; Object.Raised_On_Barrier := False; end Initialize_Protection_Entries; overriding procedure Finalize (Object : in out Protection_Entries) is begin Cancel_Calls (Object); Synchronous_Objects.Finalize (Object.Calling); Synchronous_Objects.Finalize (Object.Mutex); end Finalize; procedure Lock_Entries ( Object : not null access Protection_Entries'Class) is begin pragma Check (Trace, Ada.Debug.Put ("enter")); Synchronous_Objects.Enter (Object.Mutex); pragma Check (Trace, Ada.Debug.Put ("leave")); end Lock_Entries; procedure Unlock_Entries ( Object : not null access Protection_Entries'Class) is begin pragma Check (Trace, Ada.Debug.Put ("enter")); Synchronous_Objects.Leave (Object.Mutex); pragma Check (Trace, Ada.Debug.Put ("leave")); end Unlock_Entries; procedure Cancel_Calls (Object : in out Protection_Entries'Class) is begin Synchronous_Objects.Cancel (Object.Calling, Cancel_Call'Access); end Cancel_Calls; function Get_Ceiling (Object : not null access Protection_Entries'Class) return Any_Priority is begin raise Program_Error; -- unimplemented return Get_Ceiling (Object); end Get_Ceiling; end System.Tasking.Protected_Objects.Entries;

35.328947

78

0.728119

ad1dfa4e347341bba370a88566063710df2a87ca

8,368

adb

Ada

arch/ARM/Nordic/drivers/nrf51-timers.adb

WickedShell/Ada_Drivers_Library

391866ad37a599347df40a4dbb3bf0721bedabea

[ "BSD-3-Clause" ]

6

2017-05-28T04:37:11.000Z

2020-11-22T11:26:19.000Z

arch/ARM/Nordic/drivers/nrf51-timers.adb

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

2

2019-08-30T10:57:40.000Z

2020-02-11T21:34:14.000Z

arch/ARM/Nordic/drivers/nrf51-timers.adb

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

2

2017-02-07T19:42:02.000Z

2020-11-22T11:26:20.000Z

------------------------------------------------------------------------------ -- -- -- Copyright (C) 2017, AdaCore -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions are -- -- met: -- -- 1. Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- 2. Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in -- -- the documentation and/or other materials provided with the -- -- distribution. -- -- 3. Neither the name of the copyright holder nor the names of its -- -- contributors may be used to endorse or promote products derived -- -- from this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT -- -- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, -- -- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY -- -- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -- -- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -- -- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ with NRF51_SVD.TIMER; use NRF51_SVD.TIMER; package body nRF51.Timers is ----------- -- Start -- ----------- procedure Start (This : in out Timer) is begin This.Periph.TASKS_START := 1; end Start; ---------- -- Stop -- ---------- procedure Stop (This : in out Timer) is begin This.Periph.TASKS_STOP := 1; end Stop; ----------- -- Clear -- ----------- procedure Clear (This : in out Timer) is begin This.Periph.TASKS_CLEAR := 1; end Clear; ------------------- -- Set_Prescaler -- ------------------- procedure Set_Prescaler (This : in out Timer; Prescaler : UInt4) is begin This.Periph.PRESCALER.PRESCALER := Prescaler; end Set_Prescaler; -------------- -- Set_Mode -- -------------- procedure Set_Mode (This : in out Timer; Mode : Timer_Mode) is begin This.Periph.MODE.MODE := (case Mode is when Mode_Timer => NRF51_SVD.TIMER.Timer, when Mode_Counter => NRF51_SVD.TIMER.Counter); end Set_Mode; ----------------- -- Set_Bitmode -- ----------------- procedure Set_Bitmode (This : in out Timer; Mode : Timer_Bitmode) is begin This.Periph.BITMODE.BITMODE := (case Mode is when Bitmode_8bit => BITMODE_BITMODE_Field_08Bit, when Bitmode_16bit => BITMODE_BITMODE_Field_16Bit, when Bitmode_24bit => BITMODE_BITMODE_Field_24Bit, when Bitmode_32bit => BITMODE_BITMODE_Field_32Bit); end Set_Bitmode; ------------- -- Bitmode -- ------------- function Bitmode (This : Timer) return Timer_Bitmode is begin return (case This.Periph.BITMODE.BITMODE is when BITMODE_BITMODE_Field_08Bit => Bitmode_8bit, when BITMODE_BITMODE_Field_16Bit => Bitmode_16bit, when BITMODE_BITMODE_Field_24Bit => Bitmode_24bit, when BITMODE_BITMODE_Field_32Bit => Bitmode_32bit); end Bitmode; ----------------------- -- Compare_Interrupt -- ----------------------- procedure Compare_Interrupt (This : in out Timer; Chan : Timer_Channel; Enable : Boolean) is begin if Enable then This.Periph.INTENSET.COMPARE.Arr (Integer (Chan)) := Set; else This.Periph.INTENSET.COMPARE.Arr (Integer (Chan)) := Intenset_Compare0_Field_Reset; end if; end Compare_Interrupt; ---------------------- -- Compare_Shortcut -- ---------------------- procedure Compare_Shortcut (This : in out Timer; Chan : Timer_Channel; Stop : Boolean; Clear : Boolean) is begin case Chan is when 0 => This.Periph.SHORTS.COMPARE0_CLEAR := (if Clear then Enabled else Disabled); This.Periph.SHORTS.COMPARE0_STOP := (if Stop then Enabled else Disabled); when 1 => This.Periph.SHORTS.COMPARE1_CLEAR := (if Clear then Enabled else Disabled); This.Periph.SHORTS.COMPARE1_STOP := (if Stop then Enabled else Disabled); when 2 => This.Periph.SHORTS.COMPARE2_CLEAR := (if Clear then Enabled else Disabled); This.Periph.SHORTS.COMPARE2_STOP := (if Stop then Enabled else Disabled); when 3 => This.Periph.SHORTS.COMPARE3_CLEAR := (if Clear then Enabled else Disabled); This.Periph.SHORTS.COMPARE3_STOP := (if Stop then Enabled else Disabled); end case; end Compare_Shortcut; ----------------- -- Set_Compare -- ----------------- procedure Set_Compare (This : in out Timer; Chan : Timer_Channel; Compare : UInt32) is begin This.Periph.CC (Integer (Chan)) := Compare; end Set_Compare; ------------- -- Capture -- ------------- procedure Capture (This : in out Timer; Chan : Timer_Channel) is begin This.Periph.TASKS_CAPTURE (Integer (Chan)) := 1; end Capture; ------------- -- Capture -- ------------- function Capture (This : in out Timer; Chan : Timer_Channel) return UInt32 is begin This.Capture (Chan); return This.CC_Register (Chan); end Capture; ----------------- -- CC_Register -- ----------------- function CC_Register (This : in out Timer; Chan : Timer_Channel) return UInt32 is begin return This.Periph.CC (Integer (Chan)); end CC_Register; ---------------- -- Start_Task -- ---------------- function Start_Task (This : Timer) return Task_Type is (Task_Type (This.Periph.TASKS_START'Address)); --------------- -- Stop_Task -- --------------- function Stop_Task (This : Timer) return Task_Type is (Task_Type (This.Periph.TASKS_STOP'Address)); ---------------- -- Count_Task -- ---------------- function Count_Task (This : Timer) return Task_Type is (Task_Type (This.Periph.TASKS_COUNT'Address)); ---------------- -- Clear_Task -- ---------------- function Clear_Task (This : Timer) return Task_Type is (Task_Type (This.Periph.TASKS_CLEAR'Address)); ------------------ -- Capture_Task -- ------------------ function Capture_Task (This : Timer; Chan : Timer_Channel) return Task_Type is (Task_Type (This.Periph.TASKS_CAPTURE (Integer (Chan))'Address)); ------------------- -- Compare_Event -- ------------------- function Compare_Event (This : Timer; Chan : Timer_Channel) return Event_Type is (Event_Type (This.Periph.EVENTS_COMPARE (Integer (Chan))'Address)); end nRF51.Timers;

31.69697

92

0.513862

3df2e01a6328c093e8d231b4594a9b05cbb221f8

10,647

adb

Ada

3-mid/opengl/source/lean/text/private/opengl-fontimpl-texture.adb

charlie5/lace

e9b7dc751d500ff3f559617a6fc3089ace9dc134

[ "0BSD" ]

20

2015-11-04T09:23:59.000Z

2022-01-14T10:21:42.000Z

3-mid/opengl/source/lean/text/private/opengl-fontimpl-texture.adb

charlie5/lace

e9b7dc751d500ff3f559617a6fc3089ace9dc134

[ "0BSD" ]

2

2015-11-04T17:05:56.000Z

2015-12-08T03:16:13.000Z

3-mid/opengl/source/lean/text/private/opengl-fontimpl-texture.adb

charlie5/lace

e9b7dc751d500ff3f559617a6fc3089ace9dc134

[ "0BSD" ]

1

2015-12-07T12:53:52.000Z

with openGL.Glyph.texture, openGL.Glyph.Container, openGL.Palette, openGL.Tasks, GL.Binding, GL.lean, GL.Pointers, freetype_c.Binding, ada.unchecked_Conversion; package body openGL.FontImpl.Texture is --------- -- Forge -- function to_FontImpl_texture (ftFont : access Font.item'Class; fontFilePath : in String) return fontImpl.texture.item is use freetype_c.Binding; Success : Boolean; begin return Self : fontImpl.texture.item do define (Self'Access, ftFont, fontFilePath); Self.load_Flags := freetype_c.FT_Int (FT_LOAD_NO_HINTING_flag or FT_LOAD_NO_BITMAP_flag); Self.numGlyphs := Self.Face.GlyphCount; Self.remGlyphs := Self.numGlyphs; Success := Self.FaceSize (20); if not Success then raise Error with "Unable to set font facesize for '" & fontFilePath & "'."; end if; end return; end to_FontImpl_texture; function new_FontImpl_texture (ftFont : access Font.item'Class; fontFilePath : in String) return access fontImpl.texture.item'Class is use freetype_c.Binding; Self : constant fontImpl.texture.view := new fontImpl.texture.item; Success : Boolean; begin define (Self, ftFont, fontFilePath); Self.load_Flags := freetype_c.FT_Int (FT_LOAD_NO_HINTING_flag or FT_LOAD_NO_BITMAP_flag); Self.numGlyphs := Self.Face.GlyphCount; Self.remGlyphs := Self.numGlyphs; Success := Self.FaceSize (20); if not Success then raise Error with "Unable to set font facesize for '" & fontFilePath & "'."; end if; return Self; end new_FontImpl_texture; function to_FontImpl_texture (ftFont : access openGL.Font.item'Class; pBufferBytes : in unsigned_char_Pointer; bufferSizeInBytes : in Natural) return fontImpl.texture.item is use freetype_c.Binding; begin return Self : fontImpl.texture.item do define (Self'Access, ftFont, pBufferBytes, bufferSizeInBytes); Self.load_Flags := freetype_c.FT_Int ( FT_LOAD_NO_HINTING_flag or FT_LOAD_NO_BITMAP_flag); Self.numGlyphs := Self.face.GlyphCount; Self.remGlyphs := Self.numGlyphs; end return; end to_FontImpl_texture; function new_FontImpl_texture (ftFont : access Font.item'Class; pBufferBytes : in unsigned_char_Pointer; bufferSizeInBytes : in Natural) return access fontImpl.texture.item'Class is begin return new fontImpl.texture.item' (to_FontImpl_texture (ftFont, pBufferBytes, bufferSizeInBytes)); end new_FontImpl_texture; procedure free_Textures (Self : in out Item) is use texture_name_Vectors, GL.lean; Cursor : texture_name_Vectors.Cursor := Self.textureIDList.First; the_Name : aliased openGL.Texture.texture_Name; begin Tasks.check; while has_Element (Cursor) loop the_Name := Element (Cursor); glDeleteTextures (1, the_Name'Access); next (Cursor); end loop; end free_Textures; overriding procedure destruct (Self : in out Item) is use type ada.Containers.Count_type; begin destruct (FontImpl.item (Self)); -- Destroy base class. if Self.textureIDList.Length > 0 then Self.free_Textures; end if; end destruct; -------------- -- Attributes -- overriding function FaceSize (Self : access Item; Size : in Natural; x_Res, y_Res : in Natural := 72) return Boolean is type access_FontImpl is access all FontImpl.item; Success : Boolean; begin if not Self.textureIDList.is_empty then Self.free_Textures; Self.textureIDList.clear; Self.numGlyphs := Self.Face.GlyphCount; Self.remGlyphs := Self.numGlyphs; end if; Success := access_FontImpl (Self).FaceSize (Size, x_Res, y_Res); return Success; end FaceSize; function Render (Self : access Item; Text : in String; Length : in Integer; Position : in Vector_3; Spacing : in Vector_3; Mode : in renderMode) return Vector_3 is use GL, GL.Binding; function to_Integer is new ada.unchecked_Conversion (fontImpl.RenderMode, Integer); Tmp : Vector_3; begin Tasks.check; glEnable (GL_BLEND); glBlendFunc (GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA); glEnable (GL_TEXTURE_2D); GlyphImpl.texture.ResetActiveTexture; Tmp := FontImpl.item (Self.all).Render (Text, Length, Position, Spacing, to_Integer (Mode)); return Tmp; end Render; function MakeGlyphImpl (Self : access Item; ftGlyph : in freetype_c.FT_GlyphSlot.item) return access Glyph.item'Class is tempGlyph : Glyph.Container.Glyph_view; begin Self.glyphHeight := Integer (Self.charSize.Height + 0.5); Self.glyphWidth := Integer (Self.charSize.Width + 0.5); if Self.glyphHeight < 1 then Self.glyphHeight := 1; end if; if Self.glyphWidth < 1 then Self.glyphWidth := 1; end if; if Self.textureIDList.is_empty then Self.textureIDList.append (Self.CreateTexture); Self.xOffset := Self.Padding; Self.yOffset := Self.Padding; end if; if Self.xOffset > (Integer (Self.textureWidth) - Self.glyphWidth) then Self.xOffset := Self.Padding; Self.yOffset := Self.yOffset + Self.glyphHeight; if Self.yOffset > (Integer (Self.textureHeight) - Self.glyphHeight) then Self.textureIDList.append (Self.CreateTexture); Self.yOffset := Self.Padding; end if; end if; tempGlyph := openGL.Glyph.texture.new_Glyph (ftGlyph, Self.textureIDList.last_Element, Self.xOffset, Self.yOffset, Integer (Self.textureWidth), Integer (Self.textureHeight)); Self.xOffset := Self.xOffset + Integer ( tempGlyph.BBox.Box.Upper (1) - tempGlyph.BBox.Box.Lower (1) + Real (Self.Padding) + 0.5); Self.remGlyphs := Self.remGlyphs - 1; return tempGlyph; end MakeGlyphImpl; function Quad (Self : access Item; for_Character : in Character) return GlyphImpl.texture.Quad_t is use freetype.charMap; Success : constant Boolean := Self.CheckGlyph (to_characterCode (for_Character)) with unreferenced; the_Glyph : constant Glyph.Container.Glyph_view := Self.glyphList.Glyph (to_characterCode (for_Character)); begin return Glyph.texture.item (the_Glyph.all).Quad ((0.0, 0.0, 0.0)); end Quad; procedure CalculateTextureSize (Self : in out Item) is use openGL.Texture, GL, GL.Binding; use type GL.GLsizei; H : Integer; begin Tasks.check; if Self.maximumGLTextureSize = 0 then Self.maximumGLTextureSize := 1024; glGetIntegerv (GL_MAX_TEXTURE_SIZE, Self.maximumGLTextureSize'Access); pragma assert (Self.maximumGLTextureSize /= 0); -- If you hit this then you have an invalid openGL context. end if; begin Self.textureWidth := Power_of_2_Ceiling ( (Self.remGlyphs * Self.glyphWidth) + (Self.Padding * 2)); exception when constraint_Error => Self.textureWidth := Self.maximumGLTextureSize; end; if Self.textureWidth > Self.maximumGLTextureSize then Self.textureWidth := Self.maximumGLTextureSize; end if; H := Integer ( Real (Integer (Self.textureWidth) - (Self.Padding * 2)) / Real (Self.glyphWidth) + 0.5); Self.textureHeight := Power_of_2_Ceiling ( ((Self.numGlyphs / H) + 1) * Self.glyphHeight); if Self.textureHeight > Self.maximumGLTextureSize then Self.textureHeight := Self.maximumGLTextureSize; end if; end CalculateTextureSize; function CreateTexture (Self : access Item) return openGL.Texture.texture_Name is use openGL.Palette, GL, GL.Binding; begin Tasks.check; Self.CalculateTextureSize; declare use GL.Pointers; the_Image : Image (1 .. Index_t (self.textureHeight), 1 .. Index_t (Self.textureWidth)) := (others => (others => Black)); textID : aliased openGL.Texture.texture_Name; begin glGenTextures (1, textID'Access); glBindTexture (GL_TEXTURE_2D, textID); glTexParameteri (GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_CLAMP_TO_EDGE); glTexParameteri (GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_CLAMP_TO_EDGE); glTexParameteri (GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR); glTexParameteri (GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR); glTexImage2D (GL_TEXTURE_2D, 0, GL_ALPHA, Self.textureWidth, Self.textureHeight, 0, GL_ALPHA, GL_UNSIGNED_BYTE, to_GLvoid_access (the_Image (1, 1).Red'Access)); return textID; end; end CreateTexture; function gl_Texture (Self : in Item) return openGL.Texture.texture_Name is begin return Self.textureIDList.last_Element; end gl_Texture; end openGL.FontImpl.Texture;

31.131579

126

0.565699

0be539ad2ac1b458fa762ca237f1f31026fa91fd

3,414

ads

Ada

tools/csmib/csmib-generator.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

tools/csmib/csmib-generator.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

tools/csmib/csmib-generator.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 -- -- -- -- Tools Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2013, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ package CSMIB.Generator is procedure Generate; end CSMIB.Generator;

68.28

78

0.40246

57d4a246c45b7ad9a80acd5f2cc69a2f5237b291

3,638

ads

Ada

source/amf/uml/amf-uml-directed_relationships-hash.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/uml/amf-uml-directed_relationships-hash.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/uml/amf-uml-directed_relationships-hash.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

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

72.76

94

0.406817

2e3a6d750a818b8a9e5c881b84736673c2ba5a10

1,465

ads

Ada

source/oasis/program-elements-record_aggregates.ads

reznikmm/gela

20134f1d154fb763812e73860c6f4b04f353df79

[ "MIT" ]

null

source/oasis/program-elements-record_aggregates.ads

reznikmm/gela

20134f1d154fb763812e73860c6f4b04f353df79

[ "MIT" ]

null

source/oasis/program-elements-record_aggregates.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.Expressions; with Program.Lexical_Elements; with Program.Elements.Record_Component_Associations; package Program.Elements.Record_Aggregates is pragma Pure (Program.Elements.Record_Aggregates); type Record_Aggregate is limited interface and Program.Elements.Expressions.Expression; type Record_Aggregate_Access is access all Record_Aggregate'Class with Storage_Size => 0; not overriding function Components (Self : Record_Aggregate) return Program.Elements.Record_Component_Associations .Record_Component_Association_Vector_Access is abstract; type Record_Aggregate_Text is limited interface; type Record_Aggregate_Text_Access is access all Record_Aggregate_Text'Class with Storage_Size => 0; not overriding function To_Record_Aggregate_Text (Self : in out Record_Aggregate) return Record_Aggregate_Text_Access is abstract; not overriding function Left_Bracket_Token (Self : Record_Aggregate_Text) return not null Program.Lexical_Elements.Lexical_Element_Access is abstract; not overriding function Right_Bracket_Token (Self : Record_Aggregate_Text) return not null Program.Lexical_Elements.Lexical_Element_Access is abstract; end Program.Elements.Record_Aggregates;

32.555556

78

0.758362

c74c5b885a6e3ae7b0a4dee7ac790fecdc187ec3

3,144

adb

Ada

memsim-master/src/memory-join.adb

strenkml/EE368

00f15bce9e65badddc613355643b1061fd4a8195

[ "MIT" ]

null

memsim-master/src/memory-join.adb

strenkml/EE368

00f15bce9e65badddc613355643b1061fd4a8195

[ "MIT" ]

null

memsim-master/src/memory-join.adb

strenkml/EE368

00f15bce9e65badddc613355643b1061fd4a8195

[ "MIT" ]

null

with Ada.Assertions; use Ada.Assertions; with Memory.Container; use Memory.Container; package body Memory.Join is function Create_Join(parent : access Wrapper_Type'Class; index : Natural) return Join_Pointer is result : constant Join_Pointer := new Join_Type; begin result.parent := parent; result.index := index; return result; end Create_Join; function Clone(mem : Join_Type) return Memory_Pointer is result : constant Join_Pointer := new Join_Type'(mem); begin return Memory_Pointer(result); end Clone; procedure Read(mem : in out Join_Type; address : in Address_Type; size : in Positive) is begin Forward_Read(mem.parent.all, mem.index, address, size); end Read; procedure Write(mem : in out Join_Type; address : in Address_Type; size : in Positive) is begin Forward_Write(mem.parent.all, mem.index, address, size); end Write; function Get_Writes(mem : Join_Type) return Long_Integer is begin Assert(False, "Memory.Join.Get_Writes not implemented"); return 0; end Get_Writes; function To_String(mem : Join_Type) return Unbounded_String is begin return To_Unbounded_String("(join)"); end To_String; function Get_Cost(mem : Join_Type) return Cost_Type is begin return 0; end Get_Cost; function Get_Word_Size(mem : Join_Type) return Positive is begin return Get_Word_Size(mem.parent.all); end Get_Word_Size; function Get_Ports(mem : Join_Type) return Port_Vector_Type is result : Port_Vector_Type; begin Assert(False, "Memory.Join.Get_Ports should not be called"); return result; end Get_Ports; procedure Generate(mem : in Join_Type; sigs : in out Unbounded_String; code : in out Unbounded_String) is name : constant String := "m" & To_String(Get_ID(mem)); word_bits : constant Natural := 8 * Get_Word_Size(mem); begin Declare_Signals(sigs, name, word_bits); end Generate; function Get_Path_Length(mem : Join_Type) return Natural is next : constant Memory_Pointer := Get_Memory(mem.parent.all); jl : constant Natural := Get_Join_Length(mem.parent.all); begin return jl + Get_Path_Length(next.all); end Get_Path_Length; procedure Adjust(mem : in out Join_Type) is begin Adjust(Memory_Type(mem)); mem.parent := null; end Adjust; procedure Set_Parent(mem : in out Join_Type; parent : access Wrapper_Type'Class) is begin mem.parent := parent; end Set_Parent; function Find_Join(mem : Memory_Pointer) return Join_Pointer is begin if mem.all in Join_Type'Class then return Join_Pointer(mem); else declare cp : constant Container_Pointer := Container_Pointer(mem); begin return Find_Join(Get_Memory(cp.all)); end; end if; end Find_Join; end Memory.Join;

29.660377

74

0.638677

57f7c7cb839054bb7bc7d1b6bf53bc10fefefe2d

3,023

ads

Ada

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- SYSTEM.TASK_PRIMITIVES.INTERRUPT_OPERATIONS -- -- -- -- S p e c -- -- -- -- Copyright (C) 1998-2009, Free Software Foundation, Inc. -- -- -- -- GNARL is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNARL was developed by the GNARL team at Florida State University. -- -- Extensive contributions were provided by Ada Core Technologies, Inc. -- -- -- ------------------------------------------------------------------------------ with System.Interrupt_Management; with System.Tasking; package System.Task_Primitives.Interrupt_Operations is pragma Preelaborate; package IM renames System.Interrupt_Management; package ST renames System.Tasking; procedure Set_Interrupt_ID (Interrupt : IM.Interrupt_ID; T : ST.Task_Id); -- Associate an Interrupt_ID with a task function Get_Interrupt_ID (T : ST.Task_Id) return IM.Interrupt_ID; -- Return the Interrupt_ID associated with a task function Get_Task_Id (Interrupt : IM.Interrupt_ID) return ST.Task_Id; -- Return the Task_Id associated with an Interrupt end System.Task_Primitives.Interrupt_Operations;

59.27451

78

0.467747

226a7d42e272227ce5db6ece320b04daeb0399b4

24,036

ads

Ada

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

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

1

2020-01-20T21:26:46.000Z

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

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

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

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S Y S T E M . R I D E N T -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2011, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- -- -- -- -- -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package defines the set of restriction identifiers. It is a generic -- package that is instantiated by the compiler/binder in package Rident, and -- is instantiated in package System.Restrictions for use at run-time. -- The reason that we make this a generic package is so that in the case of -- the instantiation in Rident for use at compile time and bind time, we can -- generate normal image tables for the enumeration types, which are needed -- for diagnostic and informational messages. At run-time we really do not -- want to waste the space for these image tables, and they are not needed, -- so we can do the instantiation under control of Discard_Names to remove -- the tables. pragma Compiler_Unit; generic package System.Rident is pragma Preelaborate; -- The following enumeration type defines the set of restriction -- identifiers that are implemented in GNAT. -- To add a new restriction identifier, add an entry with the name to be -- used in the pragma, and add calls to the Restrict.Check_Restriction -- routine as appropriate. type Restriction_Id is -- The following cases are checked for consistency in the binder. The -- binder will check that every unit either has the restriction set, or -- does not violate the restriction. (Simple_Barriers, -- GNAT (Ravenscar) No_Abort_Statements, -- (RM D.7(5), H.4(3)) No_Access_Subprograms, -- (RM H.4(17)) No_Allocators, -- (RM H.4(7)) No_Allocators_After_Elaboration, -- Ada 2012 (RM D.7(19.1/2)) No_Anonymous_Allocators, -- Ada 2012 (RM H.4(8/1)) No_Asynchronous_Control, -- (RM D.7(10)) No_Calendar, -- GNAT No_Default_Stream_Attributes, -- Ada 2012 (RM 13.12.1(4/2)) No_Delay, -- (RM H.4(21)) No_Direct_Boolean_Operators, -- GNAT No_Dispatch, -- (RM H.4(19)) No_Dispatching_Calls, -- GNAT No_Dynamic_Attachment, -- GNAT No_Dynamic_Priorities, -- (RM D.9(9)) No_Enumeration_Maps, -- GNAT No_Entry_Calls_In_Elaboration_Code, -- GNAT No_Entry_Queue, -- GNAT (Ravenscar) No_Exception_Handlers, -- GNAT No_Exception_Propagation, -- GNAT No_Exception_Registration, -- GNAT No_Exceptions, -- (RM H.4(12)) No_Finalization, -- GNAT No_Fixed_Point, -- (RM H.4(15)) No_Floating_Point, -- (RM H.4(14)) No_IO, -- (RM H.4(20)) No_Implicit_Conditionals, -- GNAT No_Implicit_Dynamic_Code, -- GNAT No_Implicit_Heap_Allocations, -- (RM D.8(8), H.4(3)) No_Implicit_Loops, -- GNAT No_Initialize_Scalars, -- GNAT No_Local_Allocators, -- (RM H.4(8)) No_Local_Timing_Events, -- (RM D.7(10.2/2)) No_Local_Protected_Objects, -- GNAT No_Nested_Finalization, -- (RM D.7(4)) No_Protected_Type_Allocators, -- GNAT No_Protected_Types, -- (RM H.4(5)) No_Recursion, -- (RM H.4(22)) No_Reentrancy, -- (RM H.4(23)) No_Relative_Delay, -- GNAT (Ravenscar) No_Requeue_Statements, -- GNAT No_Secondary_Stack, -- GNAT No_Select_Statements, -- GNAT (Ravenscar) No_Specific_Termination_Handlers, -- (RM D.7(10.7/2)) No_Standard_Storage_Pools, -- GNAT No_Stream_Optimizations, -- GNAT No_Streams, -- GNAT No_Task_Allocators, -- (RM D.7(7)) No_Task_Attributes_Package, -- GNAT No_Task_Hierarchy, -- (RM D.7(3), H.4(3)) No_Task_Termination, -- GNAT (Ravenscar) No_Tasking, -- GNAT No_Terminate_Alternatives, -- (RM D.7(6)) No_Unchecked_Access, -- (RM H.4(18)) No_Unchecked_Conversion, -- (RM H.4(16)) No_Unchecked_Deallocation, -- (RM H.4(9)) Static_Priorities, -- GNAT Static_Storage_Size, -- GNAT -- The following require consistency checking with special rules. See -- individual routines in unit Bcheck for details of what is required. No_Default_Initialization, -- GNAT -- The following cases do not require consistency checking and if used -- as a configuration pragma within a specific unit, apply only to that -- unit (e.g. if used in the package spec, do not apply to the body) -- Note: No_Elaboration_Code is handled specially. Like the other -- non-partition-wide restrictions, it can only be set in a unit that -- is part of the extended main source unit (body/spec/subunits). But -- it is sticky, in that if it is found anywhere within any of these -- units, it applies to all units in this extended main source. Immediate_Reclamation, -- (RM H.4(10)) No_Implementation_Aspect_Specifications, -- Ada 2012 AI-241 No_Implementation_Attributes, -- Ada 2005 AI-257 No_Implementation_Identifiers, -- Ada 2012 AI-246 No_Implementation_Pragmas, -- Ada 2005 AI-257 No_Implementation_Restrictions, -- GNAT No_Implementation_Units, -- Ada 2012 AI-242 No_Implicit_Aliasing, -- GNAT No_Elaboration_Code, -- GNAT No_Obsolescent_Features, -- Ada 2005 AI-368 No_Wide_Characters, -- GNAT SPARK, -- GNAT -- The following cases require a parameter value -- The following entries are fully checked at compile/bind time, which -- means that the compiler can in general tell the minimum value which -- could be used with a restrictions pragma. The binder can deduce the -- appropriate minimum value for the partition by taking the maximum -- value required by any unit. Max_Protected_Entries, -- (RM D.7(14)) Max_Select_Alternatives, -- (RM D.7(12)) Max_Task_Entries, -- (RM D.7(13), H.4(3)) -- The following entries are also fully checked at compile/bind time, -- and the compiler can also at least in some cases tell the minimum -- value which could be used with a restriction pragma. The difference -- is that the contributions are additive, so the binder deduces this -- value by adding the unit contributions. Max_Tasks, -- (RM D.7(19), H.4(3)) -- The following entries are checked at compile time only for zero/ -- nonzero entries. This means that the compiler can tell at compile -- time if a restriction value of zero is (would be) violated, but that -- the compiler cannot distinguish between different non-zero values. Max_Asynchronous_Select_Nesting, -- (RM D.7(18), H.4(3)) Max_Entry_Queue_Length, -- GNAT -- The remaining entries are not checked at compile/bind time Max_Storage_At_Blocking, -- (RM D.7(17)) Not_A_Restriction_Id); -- Synonyms permitted for historical purposes of compatibility. -- Must be coordinated with Restrict.Process_Restriction_Synonym. Boolean_Entry_Barriers : Restriction_Id renames Simple_Barriers; Max_Entry_Queue_Depth : Restriction_Id renames Max_Entry_Queue_Length; No_Dynamic_Interrupts : Restriction_Id renames No_Dynamic_Attachment; No_Requeue : Restriction_Id renames No_Requeue_Statements; No_Task_Attributes : Restriction_Id renames No_Task_Attributes_Package; subtype All_Restrictions is Restriction_Id range Simple_Barriers .. Max_Storage_At_Blocking; -- All restrictions (excluding only Not_A_Restriction_Id) subtype All_Boolean_Restrictions is Restriction_Id range Simple_Barriers .. SPARK; -- All restrictions which do not take a parameter subtype Partition_Boolean_Restrictions is All_Boolean_Restrictions range Simple_Barriers .. Static_Storage_Size; -- Boolean restrictions that are checked for partition consistency. -- Note that all parameter restrictions are checked for partition -- consistency by default, so this distinction is only needed in the -- case of Boolean restrictions. subtype Cunit_Boolean_Restrictions is All_Boolean_Restrictions range Immediate_Reclamation .. SPARK; -- Boolean restrictions that are not checked for partition consistency -- and that thus apply only to the current unit. Note that for these -- restrictions, the compiler does not apply restrictions found in -- with'ed units, parent specs etc. to the main unit, and vice versa. subtype All_Parameter_Restrictions is Restriction_Id range Max_Protected_Entries .. Max_Storage_At_Blocking; -- All restrictions that take a parameter subtype Checked_Parameter_Restrictions is All_Parameter_Restrictions range Max_Protected_Entries .. Max_Entry_Queue_Length; -- These are the parameter restrictions that can be at least partially -- checked at compile/binder time. Minimally, the compiler can detect -- violations of a restriction pragma with a value of zero reliably. subtype Checked_Max_Parameter_Restrictions is Checked_Parameter_Restrictions range Max_Protected_Entries .. Max_Task_Entries; -- Restrictions with parameters that can be checked in some cases by -- maximizing among statically detected instances where the compiler -- can determine the count. subtype Checked_Add_Parameter_Restrictions is Checked_Parameter_Restrictions range Max_Tasks .. Max_Tasks; -- Restrictions with parameters that can be checked in some cases by -- summing the statically detected instances where the compiler can -- determine the count. subtype Checked_Val_Parameter_Restrictions is Checked_Parameter_Restrictions range Max_Protected_Entries .. Max_Tasks; -- Restrictions with parameter where the count is known at least in some -- cases by the compiler/binder. subtype Checked_Zero_Parameter_Restrictions is Checked_Parameter_Restrictions range Max_Asynchronous_Select_Nesting .. Max_Entry_Queue_Length; -- Restrictions with parameters where the compiler can detect the use of -- the feature, and hence violations of a restriction specifying a value -- of zero, but cannot detect specific values other than zero/nonzero. subtype Unchecked_Parameter_Restrictions is All_Parameter_Restrictions range Max_Storage_At_Blocking .. Max_Storage_At_Blocking; -- Restrictions with parameters where the compiler cannot ever detect -- corresponding compile time usage, so the binder and compiler never -- detect violations of any restriction. ------------------------------------- -- Restriction Status Declarations -- ------------------------------------- -- The following declarations are used to record the current status or -- restrictions (for the current unit, or related units, at compile time, -- and for all units in a partition at bind time or run time). type Restriction_Flags is array (All_Restrictions) of Boolean; type Restriction_Values is array (All_Parameter_Restrictions) of Natural; type Parameter_Flags is array (All_Parameter_Restrictions) of Boolean; type Restrictions_Info is record Set : Restriction_Flags; -- An entry is True in the Set array if a restrictions pragma has been -- encountered for the given restriction. If the value is True for a -- parameter restriction, then the corresponding entry in the Value -- array gives the minimum value encountered for any such restriction. Value : Restriction_Values; -- If the entry for a parameter restriction in Set is True (i.e. a -- restrictions pragma for the restriction has been encountered), then -- the corresponding entry in the Value array is the minimum value -- specified by any such restrictions pragma. Note that a restrictions -- pragma specifying a value greater than Int'Last is simply ignored. Violated : Restriction_Flags; -- An entry is True in the violations array if the compiler has detected -- a violation of the restriction. For a parameter restriction, the -- Count and Unknown arrays have additional information. Count : Restriction_Values; -- If an entry for a parameter restriction is True in Violated, the -- corresponding entry in the Count array may record additional -- information. If the actual minimum count is known (by taking -- maximums, or sums, depending on the restriction), it will be -- recorded in this array. If not, then the value will remain zero. -- The value is also zero for a non-violated restriction. Unknown : Parameter_Flags; -- If an entry for a parameter restriction is True in Violated, the -- corresponding entry in the Unknown array may record additional -- information. If the actual count is not known by the compiler (but -- is known to be non-zero), then the entry in Unknown will be True. -- This indicates that the value in Count is not known to be exact, -- and the actual violation count may be higher. -- Note: If Violated (K) is True, then either Count (K) > 0 or -- Unknown (K) = True. It is possible for both these to be set. -- For example, if Count (K) = 3 and Unknown (K) is True, it means -- that the actual violation count is at least 3 but might be higher. end record; No_Restrictions : constant Restrictions_Info := (Set => (others => False), Value => (others => 0), Violated => (others => False), Count => (others => 0), Unknown => (others => False)); -- Used to initialize Restrictions_Info variables ---------------------------------- -- Profile Definitions and Data -- ---------------------------------- -- Note: to add a profile, modify the following declarations appropriately, -- add Name_xxx to Snames, and add a branch to the conditions for pragmas -- Profile and Profile_Warnings in the body of Sem_Prag. type Profile_Name is (No_Profile, No_Implementation_Extensions, Ravenscar, Restricted); -- Names of recognized profiles. No_Profile is used to indicate that a -- restriction came from pragma Restrictions[_Warning], as opposed to -- pragma Profile[_Warning]. subtype Profile_Name_Actual is Profile_Name range No_Implementation_Extensions .. Restricted; -- Actual used profile names type Profile_Data is record Set : Restriction_Flags; -- Set to True if given restriction must be set for the profile, and -- False if it need not be set (False does not mean that it must not be -- set, just that it need not be set). If the flag is True for a -- parameter restriction, then the Value array gives the maximum value -- permitted by the profile. Value : Restriction_Values; -- An entry in this array is meaningful only if the corresponding flag -- in Set is True. In that case, the value in this array is the maximum -- value of the parameter permitted by the profile. end record; Profile_Info : constant array (Profile_Name_Actual) of Profile_Data := (No_Implementation_Extensions => -- Restrictions for Restricted profile (Set => (No_Implementation_Aspect_Specifications => True, No_Implementation_Attributes => True, No_Implementation_Identifiers => True, No_Implementation_Pragmas => True, No_Implementation_Units => True, others => False), -- Value settings for Restricted profile (none Value => (others => 0)), -- Restricted Profile Restricted => -- Restrictions for Restricted profile (Set => (No_Abort_Statements => True, No_Asynchronous_Control => True, No_Dynamic_Attachment => True, No_Dynamic_Priorities => True, No_Entry_Queue => True, No_Local_Protected_Objects => True, No_Protected_Type_Allocators => True, No_Requeue_Statements => True, No_Task_Allocators => True, No_Task_Attributes_Package => True, No_Task_Hierarchy => True, No_Terminate_Alternatives => True, Max_Asynchronous_Select_Nesting => True, Max_Protected_Entries => True, Max_Select_Alternatives => True, Max_Task_Entries => True, others => False), -- Value settings for Restricted profile Value => (Max_Asynchronous_Select_Nesting => 0, Max_Protected_Entries => 1, Max_Select_Alternatives => 0, Max_Task_Entries => 0, others => 0)), -- Ravenscar Profile -- Note: the table entries here only represent the -- required restriction profile for Ravenscar. The -- full Ravenscar profile also requires: -- pragma Dispatching_Policy (FIFO_Within_Priorities); -- pragma Locking_Policy (Ceiling_Locking); -- pragma Detect_Blocking Ravenscar => -- Restrictions for Ravenscar = Restricted profile .. (Set => (No_Abort_Statements => True, No_Asynchronous_Control => True, No_Dynamic_Attachment => True, No_Dynamic_Priorities => True, No_Entry_Queue => True, No_Local_Protected_Objects => True, No_Protected_Type_Allocators => True, No_Requeue_Statements => True, No_Task_Allocators => True, No_Task_Attributes_Package => True, No_Task_Hierarchy => True, No_Terminate_Alternatives => True, Max_Asynchronous_Select_Nesting => True, Max_Protected_Entries => True, Max_Select_Alternatives => True, Max_Task_Entries => True, -- plus these additional restrictions: No_Calendar => True, No_Implicit_Heap_Allocations => True, No_Relative_Delay => True, No_Select_Statements => True, No_Task_Termination => True, Simple_Barriers => True, others => False), -- Value settings for Ravenscar (same as Restricted) Value => (Max_Asynchronous_Select_Nesting => 0, Max_Protected_Entries => 1, Max_Select_Alternatives => 0, Max_Task_Entries => 0, others => 0))); end System.Rident;

52.138829

79

0.544142

2e59d99cc29855768d99e2f6c37386f6a9d2c1a2

1,681

ads

Ada

tests/nanomsg-test_socket_bind_connect.ads

landgraf/nanomsg-ada

6abe8f517c53b2d4c030c4e2736f883371ef9270

[ "MIT" ]

2

2015-07-28T19:47:19.000Z

2020-05-29T06:49:50.000Z

tests/nanomsg-test_socket_bind_connect.ads

landgraf/nanomsg-ada

6abe8f517c53b2d4c030c4e2736f883371ef9270

[ "MIT" ]

2

2015-11-28T14:02:13.000Z

2017-10-05T09:21:35.000Z

tests/nanomsg-test_socket_bind_connect.ads

landgraf/nanomsg-ada

6abe8f517c53b2d4c030c4e2736f883371ef9270

[ "MIT" ]

null

-- The MIT License (MIT) -- Copyright (c) 2015 Pavel Zhukov <[email protected]> -- Permission is hereby granted, free of charge, to any person obtaining a copy -- of this software and associated documentation files (the "Software"), to deal -- in the Software without restriction, including without limitation the rights -- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell -- copies of the Software, and to permit persons to whom the Software is -- furnished to do so, subject to the following conditions: -- The above copyright notice and this permission notice shall be included in all -- copies or substantial portions of the Software. -- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER -- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, -- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE -- SOFTWARE. with Aunit; use Aunit; with Nanomsg.Socket; with Aunit.Simple_Test_Cases; package Nanomsg.Test_Socket_Bind_Connect is type TC is new Simple_Test_Cases.Test_Case with record Socket1 : Nanomsg.Socket.Socket_T; Socket2 : Nanomsg.Socket.Socket_T; end record; overriding procedure Tear_Down (T : in out Tc); overriding procedure Run_Test (T : in out TC); overriding function Name (T : TC) return Message_String; end Nanomsg.Test_Socket_Bind_Connect;

39.093023

82

0.74539

2e0bedd92f9c4508cf203290c51d874b829518b4

2,824

ada

Ada

Task/Conways-Game-of-Life/Ada/conways-game-of-life.ada

djgoku/RosettaCodeData

91df62d46142e921b3eacdb52b0316c39ee236bc

[ "Info-ZIP" ]

1

2018-11-09T22:08:38.000Z

Task/Conways-Game-of-Life/Ada/conways-game-of-life.ada

p0l4r/RosettaCodeData

ba8067c3b7e68156d666c9a802c07cdacecc14ea

[ "Info-ZIP" ]

null

Task/Conways-Game-of-Life/Ada/conways-game-of-life.ada

p0l4r/RosettaCodeData

ba8067c3b7e68156d666c9a802c07cdacecc14ea

[ "Info-ZIP" ]

1

2018-11-09T22:08:40.000Z

with Ada.Text_IO; use Ada.Text_IO; procedure Life is type Cell is (O, X); -- Two states of a cell -- Computation of neighborhood function "+" (L, R : Cell) return Integer is begin case L is when O => case R is when O => return 0; when X => return 1; end case; when X => case R is when O => return 1; when X => return 2; end case; end case; end "+"; function "+" (L : Integer; R : Cell) return Integer is begin case R is when O => return L; when X => return L + 1; end case; end "+"; -- A colony of cells. The borders are dire and unhabited type Petri_Dish is array (Positive range <>, Positive range <>) of Cell; procedure Step (Culture : in out Petri_Dish) is Above : array (Culture'Range (2)) of Cell := (others => O); Left : Cell; This : Cell; begin for I in Culture'First (1) + 1 .. Culture'Last (1) - 1 loop Left := O; for J in Culture'First (2) + 1 .. Culture'Last (2) - 1 loop case Above (J-1) + Above (J) + Above (J+1) + Left + Culture (I, J+1) + Culture (I+1, J-1) + Culture (I+1, J) + Culture (I+1, J+1) is when 2 => -- Survives if alive This := Culture (I, J); when 3 => -- Survives or else multiplies This := X; when others => -- Dies This := O; end case; Above (J-1) := Left; Left := Culture (I, J); Culture (I, J) := This; end loop; Above (Above'Last - 1) := Left; end loop; end Step; procedure Put (Culture : Petri_Dish) is begin for I in Culture'Range loop for J in Culture'Range loop case Culture (I, J) is when O => Put (' '); when X => Put ('#'); end case; end loop; New_Line; end loop; end Put; Blinker : Petri_Dish := (2..4 =>(O,O,X,O,O), 1|5 =>(O,O,O,O,O)); Glider : Petri_Dish := ( (O,O,O,O,O,O,O,O,O,O,O), (O,O,X,O,O,O,O,O,O,O,O), (O,O,O,X,O,O,O,O,O,O,O), (O,X,X,X,O,O,O,O,O,O,O), (O,O,O,O,O,O,O,O,O,O,O), (O,O,O,O,O,O,O,O,O,O,O) ); begin for Generation in 1..3 loop Put_Line ("Blinker" & Integer'Image (Generation)); Put (Blinker); Step (Blinker); end loop; for Generation in 1..5 loop Put_Line ("Glider" & Integer'Image (Generation)); Put (Glider); Step (Glider); end loop; end Life;

31.032967

78

0.4483

c7600f5cb166d977d2583bd011f616bbf190f340

5,433

ads

Ada

src/arch/cores/armv7-m/m4-fpu.ads

vdh-anssi/ewok-kernel

9a88dcae16659c212c4123b7a9272c9dfa51f85a

[ "Apache-2.0" ]

65

2018-09-26T09:10:11.000Z

2022-01-30T21:17:37.000Z

src/arch/cores/armv7-m/m4-fpu.ads

vdh-anssi/ewok-kernel

9a88dcae16659c212c4123b7a9272c9dfa51f85a

[ "Apache-2.0" ]

22

2019-04-07T15:15:54.000Z

2020-10-15T12:45:54.000Z

src/arch/cores/armv7-m/m4-fpu.ads

vdh-anssi/ewok-kernel

9a88dcae16659c212c4123b7a9272c9dfa51f85a

[ "Apache-2.0" ]

10

2018-09-27T09:43:08.000Z

2021-01-29T22:50:17.000Z

-- -- Copyright 2018 The wookey project team <[email protected]> -- - Ryad Benadjila -- - Arnauld Michelizza -- - Mathieu Renard -- - Philippe Thierry -- - Philippe Trebuchet -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. -- -- with system; package m4.fpu with spark_mode => on is ------------------------------------------------- -- Coprocessor access control register (CPACR) -- ------------------------------------------------- type t_cp_access is (ACCESS_DENIED, ACCESS_PRIV, ACCESS_UNDEF, ACCESS_FULL) with size => 2; for t_cp_access use (ACCESS_DENIED => 2#00#, ACCESS_PRIV => 2#01#, ACCESS_UNDEF => 2#10#, ACCESS_FULL => 2#11#); type t_CPACR is record CP10 : t_cp_access; CP11 : t_cp_access; end record with volatile_full_access, size => 32; for t_CPACR use record CP10 at 0 range 20 .. 21; CP11 at 0 range 22 .. 23; end record; ----------------------------------------------------- -- Floating-point context control register (FPCCR) -- ----------------------------------------------------- type t_FPU_FPCCR is record LSPACT : boolean; USER : boolean; THREAD : boolean; HFRDY : boolean; MMRDY : boolean; BFRDY : boolean; MONRDY : boolean; LSPEN : boolean; ASPEN : boolean; end record with volatile_full_access, size => 32; for t_FPU_FPCCR use record LSPACT at 0 range 0 .. 0; USER at 0 range 1 .. 1; THREAD at 0 range 3 .. 3; HFRDY at 0 range 4 .. 4; MMRDY at 0 range 5 .. 5; BFRDY at 0 range 6 .. 6; MONRDY at 0 range 8 .. 8; LSPEN at 0 range 30 .. 30; ASPEN at 0 range 31 .. 31; end record; ----------------------------------------------------- -- Floating-point context address register (FPCAR) -- ----------------------------------------------------- type t_FPU_FPCAR is record ADDRESS : unsigned_32; end record with volatile_full_access, size => 32; ---------------------------------------------------- -- Floating-point status control register (FPSCR) -- ---------------------------------------------------- type t_FPU_FPSCR is record IOC : bit; DZC : bit; OFC : bit; UFC : bit; IXC : bit; reserved_5_6 : bits_2; IDC : bit; reserved_8_15 : unsigned_8; reserved_16_21 : bits_6; RMode : bits_2; FZ : bit; DN : bit; AHP : bit; reserved_27_27 : bit; V : bit; C : bit; Z : bit; N : bit; end record with volatile_full_access, size => 32; for t_FPU_FPSCR use record IOC at 0 range 0 .. 0; DZC at 0 range 1 .. 1; OFC at 0 range 2 .. 2; UFC at 0 range 3 .. 3; IXC at 0 range 4 .. 4; reserved_5_6 at 0 range 5 .. 6; IDC at 0 range 7 .. 7; reserved_8_15 at 0 range 8 .. 15; reserved_16_21 at 0 range 16 .. 21; RMode at 0 range 22 .. 23; FZ at 0 range 24 .. 24; DN at 0 range 25 .. 25; AHP at 0 range 26 .. 26; reserved_27_27 at 0 range 27 .. 27; V at 0 range 28 .. 28; C at 0 range 29 .. 29; Z at 0 range 30 .. 30; N at 0 range 31 .. 31; end record; ------------------------------------------------------------- -- Floating-point default status control register (FPDSCR) -- ------------------------------------------------------------- type t_FPU_FPDSCR is record RMode : bits_2; FZ : bit; DN : bit; AHP : bit; end record with size => 32, volatile_full_access; for t_FPU_FPDSCR use record RMode at 0 range 22 .. 23; FZ at 0 range 24 .. 24; DN at 0 range 25 .. 25; AHP at 0 range 26 .. 26; end record; -------------------- -- FPU peripheral -- -------------------- type t_FPU_peripheral is record FPCCR : t_FPU_FPCCR; FPCAR : t_FPU_FPCAR; FPDSCR : t_FPU_FPDSCR; end record with volatile; for t_FPU_peripheral use record FPCCR at 16#04# range 0 .. 31; FPCAR at 16#08# range 0 .. 31; FPDSCR at 16#0C# range 0 .. 31; end record; FPU : t_FPU_peripheral with import, volatile, address => system'to_address(16#E000_EF30#); CPACR : t_CPACR with import, volatile, address => system'to_address(16#E000_ED88#); end m4.fpu;

28.594737

79

0.47414

c724b69a4e949a0e76dc5c62f0542c229b52345a

1,614

ads

Ada

source/asis/spec/ada-wide_wide_text_io-unbounded_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-wide_wide_text_io-unbounded_io.ads

faelys/gela-asis

48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253

[ "BSD-3-Clause" ]

null

source/asis/spec/ada-wide_wide_text_io-unbounded_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.Strings.Wide_Wide_Unbounded; package Ada.Wide_Wide_Text_IO.Unbounded_IO is procedure Put (File : in File_Type; Item : in Strings.Wide_Wide_Unbounded.Wide_Wide_Unbounded_String); procedure Put (Item : in Strings.Wide_Wide_Unbounded.Wide_Wide_Unbounded_String); procedure Put_Line (File : in File_Type; Item : in Strings.Wide_Wide_Unbounded.Wide_Wide_Unbounded_String); procedure Put_Line (Item : in Strings.Wide_Wide_Unbounded.Wide_Wide_Unbounded_String); function Get_Line (File : in File_Type) return Strings.Wide_Wide_Unbounded.Wide_Wide_Unbounded_String; function Get_Line return Strings.Wide_Wide_Unbounded.Wide_Wide_Unbounded_String; procedure Get_Line (File : in File_Type; Item : out Strings.Wide_Wide_Unbounded.Wide_Wide_Unbounded_String); procedure Get_Line (Item : out Strings.Wide_Wide_Unbounded.Wide_Wide_Unbounded_String); end Ada.Wide_Wide_Text_IO.Unbounded_IO;

36.681818

78

0.581165

292b7e123fa60479c0d975aaf0175048d1164915

386

adb

Ada

test/examples/ada.adb

jmpcosta/loc

0efc9aadd4cc08a6c5c6841f494862b35f4533be

[ "MIT" ]

null

test/examples/ada.adb

jmpcosta/loc

0efc9aadd4cc08a6c5c6841f494862b35f4533be

[ "MIT" ]

null

test/examples/ada.adb

jmpcosta/loc

0efc9aadd4cc08a6c5c6841f494862b35f4533be

[ "MIT" ]

null

-- ***************************************************************************************** -- -- File description: -- -- Author: Joao Costa -- Purpose: ADA programming language example -- -- ***************************************************************************************** with Ada.Text_IO; use Ada.Text_IO; procedure Hello is begin Put_Line ("Hello, world!"); end Hello;

25.733333

92

0.362694

3d051428dacfd5cab539ad0c09df60c89351d910

1,495

ads

Ada

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

charlie5/cBound

741be08197a61ad9c72553e3302f3b669902216d

[ "0BSD" ]

2

2015-11-12T11:16:20.000Z

2021-08-24T22:32:04.000Z

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

charlie5/cBound

741be08197a61ad9c72553e3302f3b669902216d

[ "0BSD" ]

1

2018-06-05T05:19:35.000Z

2021-11-20T01:13:23.000Z

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

charlie5/cBound

741be08197a61ad9c72553e3302f3b669902216d

[ "0BSD" ]

null

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

26.696429

75

0.670903

0666b2d787f6075aac37d2ea480d399be8bae9fd

2,473

ads

Ada

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

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

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

null

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

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

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

null

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

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

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

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . D I M . L O N G _ M K S -- -- -- -- S p e c -- -- -- -- Copyright (C) 2018-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.Dim.Generic_Mks; package System.Dim.Long_Mks is new System.Dim.Generic_Mks (Long_Float);

70.657143

78

0.384553

c7990f1e8a4a47054dc6bee723632963a77e3538

20,269

adb

Ada

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

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

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

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

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

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

with Ada.Text_IO, Ada.Characters.Handling, Ada.Strings.Fixed; package body ARM_Input is -- -- Ada reference manual formatter (ARM_Form). -- -- This package contains the abstract definition of reading an input file -- or other entity, and routines to lex the input entities. -- -- --------------------------------------- -- Copyright 2000, 2002, 2004, 2005, 2011, 2013 -- AXE Consultants. All rights reserved. -- P.O. Box 1512, Madison WI 53701 -- E-Mail: [email protected] -- -- ARM_Form is free software: you can redistribute it and/or modify -- it under the terms of the GNU General Public License version 3 -- as published by the Free Software Foundation. -- -- AXE CONSULTANTS MAKES THIS TOOL AND SOURCE CODE AVAILABLE ON AN "AS IS" -- BASIS AND MAKES NO WARRANTY, EXPRESS OR IMPLIED, AS TO THE ACCURACY, -- CAPABILITY, EFFICIENCY, MERCHANTABILITY, OR FUNCTIONING OF THIS TOOL. -- IN NO EVENT WILL AXE CONSULTANTS BE LIABLE FOR ANY GENERAL, -- CONSEQUENTIAL, INDIRECT, INCIDENTAL, EXEMPLARY, OR SPECIAL DAMAGES, -- EVEN IF AXE CONSULTANTS HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH -- DAMAGES. -- -- A copy of the GNU General Public License is available in the file -- gpl-3-0.txt in the standard distribution of the ARM_Form tool. -- Otherwise, see <http://www.gnu.org/licenses/>. -- -- If the GPLv3 license is not satisfactory for your needs, a commercial -- use license is available for this tool. Contact Randy at AXE Consultants -- for more information. -- -- --------------------------------------- -- -- Edit History: -- -- 5/15/00 - RLB - Created base package. -- 5/16/00 - RLB - Added `' as a open/close pairing. -- 7/18/02 - RLB - Added Check_One_of_Parameter_Names. -- 12/06/04 - RLB - Expanded Check_One_of_Parameter_Names to take up to -- five names. -- 1/26/05 - RLB - Fixed so that quoted parameters can be skipped. -- 8/16/11 - RLB - Added code so that looping operations stop when -- the input is empty. (Otherwise, bad comments cause -- an infinite loop.) -- 10/18/11 - RLB - Changed to GPLv3 license. -- 3/26/13 - RLB - Added %% as a bracket pairing, so the Google -- Analytics snippett can be inserted. function Is_Open_Char (Open_Char : in Character) return Boolean is -- Return True if character is a parameter opening character -- ('<', '[', '{', '(', '`'), and False otherwise. begin case Open_Char is when '<' | '[' | '{' | '(' | '`' | '%' => return True; when others => return False; end case; end Is_Open_Char; function Get_Close_Char (Open_Char : in Character) return Character is -- Return the parameter closing character for an opening character. -- Raises Not_Valid_Error if Open_Char is not an opening character -- ('<', '[', '{', '(', '`'). begin case Open_Char is when '<' => return '>'; when '[' => return ']'; when '{' => return '}'; when '(' => return ')'; when '`' => return '''; when '%' => return '%'; when others => Ada.Text_IO.Put_Line ("** Not an Open_Char - " & Open_Char); raise ARM_Input.Not_Valid_Error; end case; end Get_Close_Char; function Get_Open_Char (Close_Char : in Character) return Character is -- Return the parameter opening character for an closing character. -- Raises Not_Valid_Error if Open_Char is not an closing character -- ('>', ']', '}', ')', '''). begin case Close_Char is when '>' => return '<'; when ']' => return '['; when '}' => return '{'; when ')' => return '('; when ''' => return '`'; when '%' => return '%'; when others => Ada.Text_IO.Put_Line ("** Not a Close_Char - " & Close_Char); raise ARM_Input.Not_Valid_Error; end case; end Get_Open_Char; procedure Get_Name (Input_Object : in out Input_Type'Class; Name : out ARM_Input.Command_Name_Type; Null_Name_Allowed : in Boolean := False) is -- Get a name from the Input_Object. "Names" are sequences of -- alphanumeric characters. If Null_Name_Allowed is False, -- an error is produced if no name is found. Ch : Character; Len : Natural := 0; begin Name := (others => ' '); loop Get_Char (Input_Object, Ch); if Ada.Characters.Handling.Is_Alphanumeric (Ch) then Len := Len + 1; Name(Len) := Ch; else -- End of the name. Replace_Char (Input_Object); if Len = 0 and then (not Null_Name_Allowed) then Ada.Text_IO.Put_Line (" ** Failed to find command name on line " & Line_String (Input_Object)); end if; return; end if; end loop; end Get_Name; procedure Copy_to_String_until_Close_Char (Input_Object : in out Input_Type'Class; Close_Char : in Character; Buffer : out String; Len : out Natural) is -- Copy text from Input_Object to Buffer until the matching -- Close_Char is found. Len is the number of characters copied. -- Use this when we only need a string; use recording when we -- need the string *and* we still must process the type. -- Note that we watch for matching opening characters, in -- case a nested command uses one. Ch : Character; Start_Ch : Character; Start_Ch_Count : Natural := 0; begin if Close_Char = '"' then Start_Ch := Character'Val(128); -- This character shouldn't occur in input text. -- Buglet: We don't have a way to tell whether this is an inner -- command or just the end; best to avoid nesting of -- quoted parameters. elsif Close_Char = '%' then Start_Ch := Character'Val(129); -- This character shouldn't occur in input text. -- Buglet: We don't have a way to tell whether this is an inner -- command or just the end; best to avoid nesting of -- quoted parameters. else Start_Ch := ARM_Input.Get_Open_Char (Close_Char); end if; ARM_Input.Get_Char (Input_Object, Ch); Len := 0; loop if Ch = Start_Ch then -- In case an inner command uses the same -- start/end character. Start_Ch_Count := Start_Ch_Count + 1; elsif Ch = Close_Char then exit when Start_Ch_Count = 0; Start_Ch_Count := Start_Ch_Count - 1; elsif Ch = Ascii.SUB then -- End of file, quit immediately. Ada.Text_IO.Put_Line (" ** End of file when recording string on line " & ARM_Input.Line_String (Input_Object)); exit; end if; if Len >= Buffer'Length then Ada.Text_IO.Put_Line (" ** String buffer overflow on line " & ARM_Input.Line_String (Input_Object)); ----Debug: --raise Program_Error; -- Where the heck are we?? else Buffer (Buffer'First + Len) := Ch; Len := Len + 1; end if; ARM_Input.Get_Char (Input_Object, Ch); end loop; end Copy_to_String_until_Close_Char; procedure Skip_until_Close_Char (Input_Object : in out Input_Type'Class; Close_Char : in Character) is -- Skip text from Input_Object until the matching Close_Char is found. -- Note that we watch for matching opening characters, in -- case a nested command uses one. Ch : Character; Start_Ch : Character; Start_Ch_Count : Natural := 0; Start_Line : constant String := ARM_Input.Line_String (Input_Object); -- Save this in case of severe error. begin if Close_Char = '"' then Start_Ch := Character'Val(128); -- This character shouldn't occur in input text. -- Buglet: We don't have a way to tell whether this is an inner -- command or just the end; best to avoid nesting of -- quoted parameters. else Start_Ch := ARM_Input.Get_Open_Char (Close_Char); end if; --Ada.Text_IO.Put_Line ("?? Skip: Start=" & Start_Ch & "; Close=" & Close_Char & " on line " & -- ARM_Input.Line_String (Input_Object)); ARM_Input.Get_Char (Input_Object, Ch); loop if Ch = Start_Ch then -- In case an inner command uses the same -- start/end character. Start_Ch_Count := Start_Ch_Count + 1; --Ada.Text_IO.Put_Line ("?? Skip: Start found, cnt=" & Natural'Image(Start_Ch_Count) & " on line " & -- ARM_Input.Line_String (Input_Object)); elsif Ch = Close_Char then --if Start_Ch_Count = 0 then --Ada.Text_IO.Put_Line ("?? Skip: Close found on line " & -- ARM_Input.Line_String (Input_Object)); --end if; exit when Start_Ch_Count = 0; Start_Ch_Count := Start_Ch_Count - 1; --Ada.Text_IO.Put_Line ("?? Skip: Close found, cnt=" & Natural'Image(Start_Ch_Count) & " on line " & -- ARM_Input.Line_String (Input_Object)); elsif Ch = Ascii.SUB then -- End of file, quit immediately. Ada.Text_IO.Put_Line (" ** End of file when skipping to end, started on line " & Start_Line); exit; end if; -- Ignore everything until the end character -- turns up (or the end of file). ARM_Input.Get_Char (Input_Object, Ch); end loop; end Skip_until_Close_Char; procedure Check_Parameter_Name (Input_Object : in out Input_Type'Class; Param_Name : in ARM_Input.Command_Name_Type; Is_First : in Boolean; Param_Close_Bracket : out Character) is -- Check that the name of a parameter (if any) is Param_Name. -- This is the first parameter is Is_First is True; otherwise -- it is a later parameter. (For a later parameter, we'll skip -- the comma and any whitespace.) -- If the parameter has an argument, the opening character will -- be read, and the closing character will be returned in -- in Param_Close_Bracket. If the parameter wasn't found, an -- error message will be produced, and Param_Close_Bracket will -- be set to ' '. Our_Param_Name : ARM_Input.Command_Name_Type; Ch : Character; begin if not Is_First then -- Skip over the comma and any whitespace: ARM_Input.Get_Char (Input_Object, Ch); if Ch /= ',' then Ada.Text_IO.Put_Line (" ** Bad parameter separator for " & Ada.Strings.Fixed.Trim (Param_Name, Ada.Strings.Right) & ": " & Ch & " on line " & ARM_Input.Line_String (Input_Object)); else ARM_Input.Get_Char (Input_Object, Ch); end if; while (Ch = ' ' or else Ch = Ascii.LF) loop ARM_Input.Get_Char (Input_Object, Ch); end loop; ARM_Input.Replace_Char (Input_Object); -- else nothing to clean up. end if; Arm_Input.Get_Name (Input_Object, Our_Param_Name, Null_Name_Allowed => True); if Ada.Characters.Handling.To_Lower (Param_Name) = Ada.Characters.Handling.To_Lower (Our_Param_Name) then ARM_Input.Get_Char (Input_Object, Ch); if Ch /= '=' then Ada.Text_IO.Put_Line (" ** Bad parameter character for " & Ada.Strings.Fixed.Trim(Our_Param_Name, Ada.Strings.Right) & " parameter: " & Ch & " on line " & ARM_Input.Line_String (Input_Object)); end if; elsif Ada.Strings.Fixed.Trim (Param_Name, Ada.Strings.Right) = "" then null; -- No parameter name. else Ada.Text_IO.Put_Line (" ** Bad parameter name: " & Ada.Strings.Fixed.Trim (Our_Param_Name, Ada.Strings.Right) & ", " & Ada.Strings.Fixed.Trim (Param_Name, Ada.Strings.Right) & " expected on line " & ARM_Input.Line_String (Input_Object)); end if; -- Now, open the parameter section: ARM_Input.Get_Char (Input_Object, Ch); if ARM_Input.Is_Open_Char (Ch) then -- Start parameter: Param_Close_Bracket := ARM_Input.Get_Close_Char (Ch); elsif Ch = '"' then -- Start quoted parameter: Param_Close_Bracket := '"'; else -- No parameter. Weird. ARM_Input.Replace_Char (Input_Object); Ada.Text_IO.Put_Line (" ** Failed to find parameter text for " & Ada.Strings.Fixed.Trim (Our_Param_Name, Ada.Strings.Right) & ", line " & ARM_Input.Line_String (Input_Object)); Param_Close_Bracket := ' '; end if; end Check_Parameter_Name; procedure Check_One_of_Parameter_Names ( Input_Object : in out Input_Type'Class; Param_Name_1 : in ARM_Input.Command_Name_Type; Param_Name_2 : in ARM_Input.Command_Name_Type; Param_Name_3 : in ARM_Input.Command_Name_Type := (others => ' '); Param_Name_4 : in ARM_Input.Command_Name_Type := (others => ' '); Param_Name_5 : in ARM_Input.Command_Name_Type := (others => ' '); Is_First : in Boolean; Param_Close_Bracket : out Character; Param_Found : out Param_Num) is -- Check that the name of a parameter (if any) is one of the given -- names. If the parameter is set to all blanks, it is not used. -- This is the first parameter is Is_First is True; -- otherwise it is a later parameter. (For a later parameter, we'll -- skip the comma and any whitespace.) -- Param_Found will be set to the number of the parameter that was -- found. -- If the parameter has an argument, the opening character will -- be read, and the closing character will be returned in -- in Param_Close_Bracket. If the parameter wasn't found, an -- error message will be produced, Param_Close_Bracket will -- be set to ' ', and Param_Found will be set to 0. Our_Param_Name : ARM_Input.Command_Name_Type; Ch : Character; begin if not Is_First then -- Skip over the comma and any whitespace: ARM_Input.Get_Char (Input_Object, Ch); if Ch /= ',' then Ada.Text_IO.Put_Line (" ** Bad parameter separator for " & Ada.Strings.Fixed.Trim (Param_Name_1, Ada.Strings.Right) & " or " & Ada.Strings.Fixed.Trim (Param_Name_2, Ada.Strings.Right) & ": " & Ch & " on line " & ARM_Input.Line_String (Input_Object)); else ARM_Input.Get_Char (Input_Object, Ch); end if; while (Ch = ' ' or else Ch = Ascii.LF) loop ARM_Input.Get_Char (Input_Object, Ch); end loop; ARM_Input.Replace_Char (Input_Object); -- else nothing to clean up. end if; Arm_Input.Get_Name (Input_Object, Our_Param_Name, Null_Name_Allowed => True); if Param_Name_1 /= ARM_Input.Command_Name_Type'(others => ' ') and then Ada.Characters.Handling.To_Lower (Param_Name_1) = Ada.Characters.Handling.To_Lower (Our_Param_Name) then ARM_Input.Get_Char (Input_Object, Ch); if Ch /= '=' then Ada.Text_IO.Put_Line (" ** Bad parameter character for " & Ada.Strings.Fixed.Trim(Our_Param_Name, Ada.Strings.Right) & " parameter: " & Ch & " on line " & ARM_Input.Line_String (Input_Object)); end if; Param_Found := 1; elsif Param_Name_2 /= ARM_Input.Command_Name_Type'(others => ' ') and then Ada.Characters.Handling.To_Lower (Param_Name_2) = Ada.Characters.Handling.To_Lower (Our_Param_Name) then ARM_Input.Get_Char (Input_Object, Ch); if Ch /= '=' then Ada.Text_IO.Put_Line (" ** Bad parameter character for " & Ada.Strings.Fixed.Trim(Our_Param_Name, Ada.Strings.Right) & " parameter: " & Ch & " on line " & ARM_Input.Line_String (Input_Object)); end if; Param_Found := 2; elsif Param_Name_3 /= ARM_Input.Command_Name_Type'(others => ' ') and then Ada.Characters.Handling.To_Lower (Param_Name_3) = Ada.Characters.Handling.To_Lower (Our_Param_Name) then ARM_Input.Get_Char (Input_Object, Ch); if Ch /= '=' then Ada.Text_IO.Put_Line (" ** Bad parameter character for " & Ada.Strings.Fixed.Trim(Our_Param_Name, Ada.Strings.Right) & " parameter: " & Ch & " on line " & ARM_Input.Line_String (Input_Object)); end if; Param_Found := 3; elsif Param_Name_4 /= ARM_Input.Command_Name_Type'(others => ' ') and then Ada.Characters.Handling.To_Lower (Param_Name_4) = Ada.Characters.Handling.To_Lower (Our_Param_Name) then ARM_Input.Get_Char (Input_Object, Ch); if Ch /= '=' then Ada.Text_IO.Put_Line (" ** Bad parameter character for " & Ada.Strings.Fixed.Trim(Our_Param_Name, Ada.Strings.Right) & " parameter: " & Ch & " on line " & ARM_Input.Line_String (Input_Object)); end if; Param_Found := 4; elsif Param_Name_5 /= ARM_Input.Command_Name_Type'(others => ' ') and then Ada.Characters.Handling.To_Lower (Param_Name_5) = Ada.Characters.Handling.To_Lower (Our_Param_Name) then ARM_Input.Get_Char (Input_Object, Ch); if Ch /= '=' then Ada.Text_IO.Put_Line (" ** Bad parameter character for " & Ada.Strings.Fixed.Trim(Our_Param_Name, Ada.Strings.Right) & " parameter: " & Ch & " on line " & ARM_Input.Line_String (Input_Object)); end if; Param_Found := 5; else if Param_Name_5 /= ARM_Input.Command_Name_Type'(others => ' ') then Ada.Text_IO.Put_Line (" ** Bad parameter name: " & Ada.Strings.Fixed.Trim (Our_Param_Name, Ada.Strings.Right) & "; but " & Ada.Strings.Fixed.Trim (Param_Name_1, Ada.Strings.Right) & ", " & Ada.Strings.Fixed.Trim (Param_Name_2, Ada.Strings.Right) & ", " & Ada.Strings.Fixed.Trim (Param_Name_3, Ada.Strings.Right) & ", " & Ada.Strings.Fixed.Trim (Param_Name_4, Ada.Strings.Right) & ", or " & Ada.Strings.Fixed.Trim (Param_Name_5, Ada.Strings.Right) & " expected on line " & ARM_Input.Line_String (Input_Object)); elsif Param_Name_4 /= ARM_Input.Command_Name_Type'(others => ' ') then Ada.Text_IO.Put_Line (" ** Bad parameter name: " & Ada.Strings.Fixed.Trim (Our_Param_Name, Ada.Strings.Right) & "; but " & Ada.Strings.Fixed.Trim (Param_Name_1, Ada.Strings.Right) & ", " & Ada.Strings.Fixed.Trim (Param_Name_2, Ada.Strings.Right) & ", " & Ada.Strings.Fixed.Trim (Param_Name_3, Ada.Strings.Right) & ", or " & Ada.Strings.Fixed.Trim (Param_Name_4, Ada.Strings.Right) & " expected on line " & ARM_Input.Line_String (Input_Object)); elsif Param_Name_3 /= ARM_Input.Command_Name_Type'(others => ' ') then Ada.Text_IO.Put_Line (" ** Bad parameter name: " & Ada.Strings.Fixed.Trim (Our_Param_Name, Ada.Strings.Right) & "; but " & Ada.Strings.Fixed.Trim (Param_Name_1, Ada.Strings.Right) & ", " & Ada.Strings.Fixed.Trim (Param_Name_2, Ada.Strings.Right) & ", or " & Ada.Strings.Fixed.Trim (Param_Name_3, Ada.Strings.Right) & " expected on line " & ARM_Input.Line_String (Input_Object)); else Ada.Text_IO.Put_Line (" ** Bad parameter name: " & Ada.Strings.Fixed.Trim (Our_Param_Name, Ada.Strings.Right) & "; but " & Ada.Strings.Fixed.Trim (Param_Name_1, Ada.Strings.Right) & " or " & Ada.Strings.Fixed.Trim (Param_Name_2, Ada.Strings.Right) & " expected on line " & ARM_Input.Line_String (Input_Object)); end if; Param_Found := 0; end if; -- Now, open the parameter section: ARM_Input.Get_Char (Input_Object, Ch); if ARM_Input.Is_Open_Char (Ch) then -- Start parameter: Param_Close_Bracket := ARM_Input.Get_Close_Char (Ch); elsif Ch = '"' then -- Start quoted parameter: Param_Close_Bracket := '"'; else -- No parameter. Weird. ARM_Input.Replace_Char (Input_Object); Ada.Text_IO.Put_Line (" ** Failed to find parameter text for " & Ada.Strings.Fixed.Trim (Our_Param_Name, Ada.Strings.Right) & ", line " & ARM_Input.Line_String (Input_Object)); Param_Close_Bracket := ' '; end if; end Check_One_of_Parameter_Names; end ARM_Input;

45.548315

122

0.622527

2e7b6fde9ef14eff30b9131f006724fc089be60c

5,488

adb

Ada

ada/core/demo/agar_ada_core_demo.adb

auzkok/libagar

8dffa4afe73df47cf7e461c3073b744373d3af0b

[ "BSD-2-Clause" ]

286

2017-07-31T20:05:16.000Z

2022-03-26T20:26:24.000Z

ada/core/demo/agar_ada_core_demo.adb

kalatestimine/libagar

f830265ad00a82d4cddd8b59943bd3887ebb1486

[ "BSD-2-Clause" ]

67

2017-08-30T18:56:21.000Z

2021-09-08T03:38:20.000Z

ada/core/demo/agar_ada_core_demo.adb

kalatestimine/libagar

f830265ad00a82d4cddd8b59943bd3887ebb1486

[ "BSD-2-Clause" ]

31

2017-08-14T13:34:12.000Z

2022-03-14T15:33:49.000Z

---------------------------------------------------- -- agar_ada_core_demo.adb: Agar Ada bindings demo -- ---------------------------------------------------- with Agar; with Agar.Init; with Agar.Error; with Agar.Object; use Agar.Object; with Agar.Event; with Agar.DSO; with Agar.Types; use Agar.Types; with Ada.Text_IO; with System; with myatexit; with myeventhandler; with Animal; with Ada.Real_Time; use Ada.Real_Time; procedure agar_ada_core_demo is package T_IO renames Ada.Text_IO; package EV renames Agar.Event; package RT renames Ada.Real_Time; Major : Natural; Minor : Natural; Patch : Natural; My_Parent : Object_Access; My_Child_1 : Object_Access; My_Child_2 : Object_Access; Animal_Class : Class_Access; Cow : Object_Access; Event : EV.Event_Access; Epoch : constant RT.Time := RT.Clock; begin if not Agar.Init.Init_Core (Program_Name => "agar_ada_core_demo", Create_Directory => True) then raise program_error with Agar.Error.Get_Error; end if; T_IO.Put_Line("Agar-Core initialized in " & Duration'Image(RT.To_Duration(RT.Clock - Epoch)) & "s"); -- Register a test atexit callback. Agar.Init.At_Exit(myatexit.atexit'Access); -- Print Agar's version number. Agar.Init.Get_Version(Major, Minor, Patch); T_IO.Put_Line ("Agar version" & Integer'Image(Major) & " ." & Integer'Image(Minor) & " ." & Integer'Image(Patch)); T_IO.Put_Line ("Memory model: " & Natural'Image(AG_MODEL)); -- Register the Agar object class "Animal" specified in animal.ads. T_IO.Put_Line("Registering Animal class (" & Natural'Image(Animal.Animal'Size / System.Storage_Unit) & " bytes)"); Animal_Class := Animal.Create_Class; -- Create an instance the Animal class. Cow := New_Object(Animal_Class); Set_Name(Cow, "Cow"); Debug(Cow, "Moo!"); -- Create a generic AG_Object(3) instance. My_Parent := New_Object(Lookup_Class("AG_Object")); Set_Name(My_Parent, "My_Test_Object"); -- Access the class description of the object. T_IO.Put_Line("Object is" & Natural'Image(Natural(My_Parent.Class.Size)) & " bytes"); -- Configure an event handler for `some-event' and pass it some arguments. Event := Set_Event (Object => My_Parent, Event => "some-event", Func => myeventhandler.Some_Event'Access); EV.Push_String (Event, "This is a string argument"); -- untagged arguments EV.Push_Float (Event, 1234.0); EV.Push_Natural (Event, "width", 640); -- tagged arguments EV.Push_Natural (Event, "height", 480); -- Raise `some-event' by name. T_IO.Put_Line("Raising some-event by name"); Post_Event (My_Parent, "some-event"); -- Raise `some-event' by access (as returned by Set_Event). T_IO.Put_Line("Raising some-event by access"); Post_Event (My_Parent, Event); -- -- Raise `some-event' and pass the callback procedure some extra arguments -- on top of the existing argument list constructed by Set_Event. -- --Event := Prepare_Event (My_Parent, "Some-Event"); --EV.Push_Integer (Event, "timestamp", Ada.Real_Time.Clock - Epoch); --EV.Push_String (Event, "Hello there!"); --Post_Event (Event); -- Create two child objects under My_Parent. T_IO.Put_Line("Creating child objects"); My_Child_1 := New_Object(My_Parent, "My_Child_1", Lookup_Class("AG_Object")); My_Child_2 := New_Object(My_Parent, "My_Child_2", Lookup_Class("AG_Object")); -- Objects can send events to each other. Post_Event (Object => My_Child_2, Event => "Ping"); -- Propagate makes events broadcast to the object's descendants. Set_Event (Object => My_Parent, Event => "Ping", Func => myeventhandler.Ping'Access, Async => False, Propagate => True); Post_Event (Object => My_Parent, Event => "Ping"); T_IO.Put_Line("My_Parent path = " & Get_Name(My_Parent)); T_IO.Put_Line("My_Child_1 path = " & Get_Name(My_Child_1)); T_IO.Put_Line("My_Child_2 path = " & Get_Name(My_Child_2)); -- The Parent and Root members of an object are protected by the parent VFS. Lock_VFS(My_Child_2); T_IO.Put_Line("Parent of My_Child_2 is = " & Get_Name(My_Child_2.Parent)); T_IO.Put_Line("Root of My_Child_2 is = " & Get_Name(My_Child_2.Root)); Unlock_VFS(My_Child_2); -- Serialize an object to a file. if not Save(Cow, "Cow.obj") then raise program_error with Agar.Error.Get_Error; end if; T_IO.Put_Line("Saved Cow to Cow.obj"); if not Save(My_Parent, "My_Parent.obj") then raise program_error with Agar.Error.Get_Error; end if; T_IO.Put_Line("Saved My_Parent to My_Parent.obj"); -- Serialize the entire VFS to the default data directory. if not Save_All(My_Parent) then raise program_error with Agar.Error.Get_Error; end if; T_IO.Put_Line("Saved My_Parent to VFS"); -- Register a module directory and list all available DSOs. Agar.Object.Register_Module_Directory ("/tmp/dsotest"); declare DSO_List : constant Agar.DSO.DSO_List := Agar.DSO.Get_List; begin for DSO of DSO_List loop T_IO.Put("Available DSO: "); T_IO.Put_Line(DSO); end loop; end; Detach(My_Child_1); Detach(My_Child_2); Destroy(My_Child_1); Destroy(My_Child_2); Destroy(My_Parent); Destroy(Cow); Destroy_Class(Animal_Class); T_IO.Put_Line("Exiting after " & Duration'Image(RT.To_Duration(RT.Clock - Epoch)) & "s"); Agar.Init.Quit; end agar_ada_core_demo;

31.181818

79

0.674745

41729d4bddf6118766923be6738d6e4786bbc57c

2,883

ads

Ada

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

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

80

2015-01-02T10:14:04.000Z

2021-06-07T06:29:49.000Z

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

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

9

2015-05-14T11:03:12.000Z

2018-01-04T07:12:58.000Z

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

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

69

2015-01-02T10:45:56.000Z

2021-09-06T07:52:13.000Z

------------------------------------------------------------------------------ -- -- -- GNAT RUNTIME COMPONENTS -- -- -- -- S Y S T E M . E X P _ L L F -- -- -- -- S p e c -- -- -- -- $Revision$ -- -- -- Copyright (C) 1992,1993,1994 Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- Long_Long_Float exponentiation (checks on) with System.Exp_Gen; package System.Exp_LLF is pragma Pure (Exp_LLF); function Exp_Long_Long_Float is new System.Exp_Gen.Exp_Float_Type (Long_Long_Float); end System.Exp_LLF;

61.340426

78

0.423517

587e4468d3f00ecba64f963ba9d37c05b27c7925

1,118

adb

Ada

day22/tests/day-test.adb

jwarwick/aoc_2020

b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377

[ "MIT" ]

3

2020-12-26T23:44:33.000Z

2021-12-06T16:00:54.000Z

day22/tests/day-test.adb

jwarwick/aoc_2020

b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377

[ "MIT" ]

null

day22/tests/day-test.adb

jwarwick/aoc_2020

b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377

[ "MIT" ]

null

with AUnit.Assertions; use AUnit.Assertions; with Ada.Text_IO; package body Day.Test is procedure Test_Part1 (T : in out AUnit.Test_Cases.Test_Case'Class) is pragma Unreferenced (T); t1 : constant Natural := combat("test1.txt"); begin Assert(t1 = 306, "Wrong number, expected 306, got" & t1'IMAGE); end Test_Part1; procedure Test_Part2 (T : in out AUnit.Test_Cases.Test_Case'Class) is pragma Unreferenced (T); t1 : constant Natural := recursive_combat("test1.txt"); t2 : constant Natural := recursive_combat("test2.txt"); begin Ada.Text_IO.put_line("Infinite game ended" & t2'IMAGE); Assert(t1 = 291, "Wrong number, expected 291, got" & t1'IMAGE); end Test_Part2; function Name (T : Test) return AUnit.Message_String is pragma Unreferenced (T); begin return AUnit.Format ("Test Day package"); end Name; procedure Register_Tests (T : in out Test) is use AUnit.Test_Cases.Registration; begin Register_Routine (T, Test_Part1'Access, "Test Part 1"); Register_Routine (T, Test_Part2'Access, "Test Part 2"); end Register_Tests; end Day.Test;

31.055556

71

0.702147

3dc1d124c5b21515a55808e7ffc5af3899951cfb

11,797

adb

Ada

boards/stm32f769_discovery/src/audio.adb

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

2

2018-05-16T03:56:39.000Z

2019-07-31T13:53:56.000Z

boards/stm32f769_discovery/src/audio.adb

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

null

boards/stm32f769_discovery/src/audio.adb

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- Copyright (C) 2016, AdaCore -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions are -- -- met: -- -- 1. Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- 2. Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in -- -- the documentation and/or other materials provided with the -- -- distribution. -- -- 3. Neither the name of STMicroelectronics nor the names of its -- -- contributors may be used to endorse or promote products derived -- -- from this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT -- -- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, -- -- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY -- -- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -- -- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -- -- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- -- This file is based on: -- -- @file stm32f746g_discovery_audio.c -- -- @author MCD Application Team -- ------------------------------------------------------------------------------ with HAL; use HAL; with STM32; use STM32; with STM32.Device; use STM32.Device; with STM32.Board; use STM32.Board; with STM32.GPIO; use STM32.GPIO; with STM32.DMA; use STM32.DMA; with STM32.SAI; use STM32.SAI; with STM32.Setup; with STM32.I2C; package body Audio is Audio_SAI : SAI_Controller renames SAI_1; -- Audio_INT : GPIO_Point renames PB10; SAI1_MCLK_A : GPIO_Point renames PG7; SAI1_SCK_A : GPIO_Point renames PE5; SAI1_SD_A : GPIO_Point renames PE6; SAI1_SD_B : GPIO_Point renames PE3; SAI1_FS_A : GPIO_Point renames PE4; SAI_Pins : constant GPIO_Points := (SAI1_MCLK_A, SAI1_SCK_A, SAI1_SD_A, SAI1_SD_B, SAI1_FS_A); SAI_Pins_AF : GPIO_Alternate_Function renames GPIO_AF_SAI1_6; -- SAI in/out conf SAI_Out_Block : SAI_Block renames Block_A; -- SAI_In_Block : SAI_Block renames Block_B; procedure Set_Audio_Clock (Freq : Audio_Frequency); procedure Initialize_Audio_Out_Pins; procedure Initialize_SAI_Out (Freq : Audio_Frequency); procedure Initialize_Audio_I2C; --------------------- -- Set_Audio_Clock -- --------------------- procedure Set_Audio_Clock (Freq : Audio_Frequency) is begin -- Two groups of frequencies: the 44kHz family and the 48kHz family -- The Actual audio frequency is calculated then with the following -- formula: -- Master_Clock = 256 * FS = SAI_CK / Master_Clock_Divider -- We need to find a value of SAI_CK that allows such integer master -- clock divider case Freq is when Audio_Freq_11kHz | Audio_Freq_22kHz | Audio_Freq_44kHz => -- HSE/PLLM = 1MHz = PLLI2S VCO Input Configure_SAI_I2S_Clock (Audio_SAI, PLLI2SN => 429, -- VCO Output = 429MHz PLLI2SQ => 2, -- SAI Clk(First level) = 214.5 MHz PLLI2SDIVQ => 19); -- I2S Clk = 215.4 / 19 = 11.289 MHz when Audio_Freq_8kHz | Audio_Freq_16kHz | Audio_Freq_48kHz | Audio_Freq_96kHz => Configure_SAI_I2S_Clock (Audio_SAI, PLLI2SN => 344, -- VCO Output = 344MHz PLLI2SQ => 7, -- SAI Clk(First level) = 49.142 MHz PLLI2SDIVQ => 1); -- I2S Clk = 49.142 MHz end case; end Set_Audio_Clock; ------------------------------- -- Initialize_Audio_Out_Pins -- ------------------------------- procedure Initialize_Audio_Out_Pins is begin Enable_Clock (Audio_SAI); Enable_Clock (SAI_Pins); Configure_IO (SAI_Pins, (Mode => Mode_AF, Output_Type => Push_Pull, Speed => Speed_High, Resistors => Floating)); Configure_Alternate_Function (SAI_Pins, SAI_Pins_AF); Enable_Clock (Audio_DMA); -- Configure the DMA channel to the SAI peripheral Disable (Audio_DMA, Audio_DMA_Out_Stream); Configure (Audio_DMA, Audio_DMA_Out_Stream, (Channel => Audio_DMA_Out_Channel, Direction => Memory_To_Peripheral, Increment_Peripheral_Address => False, Increment_Memory_Address => True, Peripheral_Data_Format => HalfWords, Memory_Data_Format => HalfWords, Operation_Mode => Circular_Mode, Priority => Priority_High, FIFO_Enabled => True, FIFO_Threshold => FIFO_Threshold_Full_Configuration, Memory_Burst_Size => Memory_Burst_Single, Peripheral_Burst_Size => Peripheral_Burst_Single)); Clear_All_Status (Audio_DMA, Audio_DMA_Out_Stream); end Initialize_Audio_Out_Pins; ------------------------ -- Initialize_SAI_Out -- ------------------------ procedure Initialize_SAI_Out (Freq : Audio_Frequency) is begin STM32.SAI.Disable (Audio_SAI, SAI_Out_Block); STM32.SAI.Configure_Audio_Block (Audio_SAI, SAI_Out_Block, Frequency => Audio_Frequency'Enum_Rep (Freq), Stereo_Mode => Stereo, Mode => Master_Transmitter, MCD_Enabled => True, Protocol => Free_Protocol, Data_Size => Data_16b, Endianness => Data_MSB_First, Clock_Strobing => Clock_Strobing_Rising_Edge, Synchronization => Asynchronous_Mode, Output_Drive => Drive_Immediate, FIFO_Threshold => FIFO_1_Quarter_Full); STM32.SAI.Configure_Block_Frame (Audio_SAI, SAI_Out_Block, Frame_Length => 64, Frame_Active => 32, Frame_Sync => FS_Frame_And_Channel_Identification, FS_Polarity => FS_Active_Low, FS_Offset => Before_First_Bit); STM32.SAI.Configure_Block_Slot (Audio_SAI, SAI_Out_Block, First_Bit_Offset => 0, Slot_Size => Data_Size, Number_Of_Slots => 4, Enabled_Slots => Slot_0 or Slot_2); STM32.SAI.Enable (Audio_SAI, SAI_Out_Block); end Initialize_SAI_Out; -------------------------- -- Initialize_Audio_I2C -- -------------------------- procedure Initialize_Audio_I2C is begin if not STM32.I2C.Is_Configured (Audio_I2C) then STM32.Setup.Setup_I2C_Master (Port => Audio_I2C, SDA => Audio_I2C_SDA, SCL => Audio_I2C_SCL, SDA_AF => Audio_I2C_SDA_AF, SCL_AF => Audio_I2C_SCL_AF, Clock_Speed => 100_000); end if; end Initialize_Audio_I2C; ---------------- -- Initialize -- ---------------- procedure Initialize_Audio_Out (This : in out WM8994_Audio_Device; Volume : Audio_Volume; Frequency : Audio_Frequency) is begin STM32.SAI.Deinitialize (Audio_SAI, SAI_Out_Block); Set_Audio_Clock (Frequency); -- Initialize the SAI Initialize_Audio_Out_Pins; Initialize_SAI_Out (Frequency); -- Initialize the I2C Port to send commands to the driver Initialize_Audio_I2C; if This.Device.Read_ID /= WM8994.WM8994_ID then raise Constraint_Error with "Invalid ID received from the Audio Code"; end if; This.Device.Reset; This.Device.Init (Input => WM8994.No_Input, Output => WM8994.Auto, Volume => UInt8 (Volume), Frequency => WM8994.Audio_Frequency'Enum_Val (Audio_Frequency'Enum_Rep (Frequency))); end Initialize_Audio_Out; ---------- -- Play -- ---------- procedure Play (This : in out WM8994_Audio_Device; Buffer : Audio_Buffer) is begin This.Device.Play; Start_Transfer_with_Interrupts (This => Audio_DMA, Stream => Audio_DMA_Out_Stream, Source => Buffer (Buffer'First)'Address, Destination => Audio_SAI.ADR'Address, Data_Count => Buffer'Length, Enabled_Interrupts => (Half_Transfer_Complete_Interrupt => True, Transfer_Complete_Interrupt => True, others => False)); Enable_DMA (Audio_SAI, SAI_Out_Block); if not Enabled (Audio_SAI, SAI_Out_Block) then Enable (Audio_SAI, SAI_Out_Block); end if; end Play; ----------- -- Pause -- ----------- procedure Pause (This : in out WM8994_Audio_Device) is begin This.Device.Pause; DMA_Pause (Audio_SAI, SAI_Out_Block); end Pause; ------------ -- Resume -- ------------ procedure Resume (This : in out WM8994_Audio_Device) is begin This.Device.Resume; DMA_Resume (Audio_SAI, SAI_Out_Block); end Resume; ---------- -- Stop -- ---------- procedure Stop (This : in out WM8994_Audio_Device) is begin This.Device.Stop (WM8994.Stop_Power_Down_Sw); DMA_Stop (Audio_SAI, SAI_Out_Block); STM32.DMA.Disable (Audio_DMA, Audio_DMA_Out_Stream); STM32.DMA.Clear_All_Status (Audio_DMA, Audio_DMA_Out_Stream); end Stop; ---------------- -- Set_Volume -- ---------------- procedure Set_Volume (This : in out WM8994_Audio_Device; Volume : Audio_Volume) is begin This.Device.Set_Volume (UInt8 (Volume)); end Set_Volume; ------------------- -- Set_Frequency -- ------------------- procedure Set_Frequency (This : in out WM8994_Audio_Device; Frequency : Audio_Frequency) is pragma Unreferenced (This); begin Set_Audio_Clock (Frequency); STM32.SAI.Disable (Audio_SAI, SAI_Out_Block); Initialize_SAI_Out (Frequency); STM32.SAI.Enable (Audio_SAI, SAI_Out_Block); end Set_Frequency; end Audio;

36.298462

79

0.549123

c7238e26e5d9769f9c276650c16171d3917e73fc

9,844

adb

Ada

Ada95/src/terminal_interface-curses-text_io.adb

neverware-mirrors/ncurses

931939e0d2765af13962820e59cb6629df3ee638

[ "X11" ]

269

2015-03-01T21:34:42.000Z

2022-03-30T23:07:18.000Z

Ada95/src/terminal_interface-curses-text_io.adb

neverware-mirrors/ncurses

931939e0d2765af13962820e59cb6629df3ee638

[ "X11" ]

3

2020-10-09T15:00:37.000Z

2020-10-09T15:05:19.000Z

Ada95/src/terminal_interface-curses-text_io.adb

neverware-mirrors/ncurses

931939e0d2765af13962820e59cb6629df3ee638

[ "X11" ]

97

2016-04-25T06:22:54.000Z

2022-03-30T23:07:19.000Z

------------------------------------------------------------------------------ -- -- -- GNAT ncurses Binding -- -- -- -- Terminal_Interface.Curses.Text_IO -- -- -- -- B O D Y -- -- -- ------------------------------------------------------------------------------ -- Copyright 2020 Thomas E. Dickey -- -- Copyright 1999-2011,2014 Free Software Foundation, Inc. -- -- -- -- Permission is hereby granted, free of charge, to any person obtaining a -- -- copy of this software and associated documentation files (the -- -- "Software"), to deal in the Software without restriction, including -- -- without limitation the rights to use, copy, modify, merge, publish, -- -- distribute, distribute with modifications, sublicense, and/or sell -- -- copies of the Software, and to permit persons to whom the Software is -- -- furnished to do so, subject to the following conditions: -- -- -- -- The above copyright notice and this permission notice shall be included -- -- in all copies or substantial portions of the Software. -- -- -- -- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -- -- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -- -- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. -- -- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -- -- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -- -- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR -- -- THE USE OR OTHER DEALINGS IN THE SOFTWARE. -- -- -- -- Except as contained in this notice, the name(s) of the above copyright -- -- holders shall not be used in advertising or otherwise to promote the -- -- sale, use or other dealings in this Software without prior written -- -- authorization. -- ------------------------------------------------------------------------------ -- Author: Juergen Pfeifer, 1996 -- Version Control: -- $Revision: 1.23 $ -- $Date: 2020/02/02 23:34:34 $ -- Binding Version 01.00 ------------------------------------------------------------------------------ package body Terminal_Interface.Curses.Text_IO is Default_Window : Window := Null_Window; procedure Set_Window (Win : Window) is begin Default_Window := Win; end Set_Window; function Get_Window return Window is begin if Default_Window = Null_Window then return Standard_Window; else return Default_Window; end if; end Get_Window; pragma Inline (Get_Window); procedure Flush (Win : Window) is begin Refresh (Win); end Flush; procedure Flush is begin Flush (Get_Window); end Flush; -------------------------------------------- -- Specification of line and page lengths -- -------------------------------------------- -- There are no set routines in this package. I assume, that you allocate -- the window with an appropriate size. -- A scroll-window is interpreted as an page with unbounded page length, -- i.e. it returns the conventional 0 as page length. function Line_Length (Win : Window) return Count is N_Lines : Line_Count; N_Cols : Column_Count; begin Get_Size (Win, N_Lines, N_Cols); -- if Natural (N_Cols) > Natural (Count'Last) then -- raise Layout_Error; -- end if; return Count (N_Cols); end Line_Length; function Line_Length return Count is begin return Line_Length (Get_Window); end Line_Length; function Page_Length (Win : Window) return Count is N_Lines : Line_Count; N_Cols : Column_Count; begin if Scrolling_Allowed (Win) then return 0; else Get_Size (Win, N_Lines, N_Cols); -- if Natural (N_Lines) > Natural (Count'Last) then -- raise Layout_Error; -- end if; return Count (N_Lines); end if; end Page_Length; function Page_Length return Count is begin return Page_Length (Get_Window); end Page_Length; ------------------------------------ -- Column, Line, and Page Control -- ------------------------------------ procedure New_Line (Win : Window; Spacing : Positive_Count := 1) is P_Size : constant Count := Page_Length (Win); begin if not Spacing'Valid then raise Constraint_Error; end if; for I in 1 .. Spacing loop if P_Size > 0 and then Line (Win) >= P_Size then New_Page (Win); else Add (Win, ASCII.LF); end if; end loop; end New_Line; procedure New_Line (Spacing : Positive_Count := 1) is begin New_Line (Get_Window, Spacing); end New_Line; procedure New_Page (Win : Window) is begin Clear (Win); end New_Page; procedure New_Page is begin New_Page (Get_Window); end New_Page; procedure Set_Col (Win : Window; To : Positive_Count) is Y : Line_Position; X1 : Column_Position; X2 : Column_Position; N : Natural; begin if not To'Valid then raise Constraint_Error; end if; Get_Cursor_Position (Win, Y, X1); N := Natural (To); N := N - 1; X2 := Column_Position (N); if X1 > X2 then New_Line (Win, 1); X1 := 0; end if; if X1 < X2 then declare Filler : constant String (Integer (X1) .. (Integer (X2) - 1)) := (others => ' '); begin Put (Win, Filler); end; end if; end Set_Col; procedure Set_Col (To : Positive_Count) is begin Set_Col (Get_Window, To); end Set_Col; procedure Set_Line (Win : Window; To : Positive_Count) is Y1 : Line_Position; Y2 : Line_Position; X : Column_Position; N : Natural; begin if not To'Valid then raise Constraint_Error; end if; Get_Cursor_Position (Win, Y1, X); pragma Warnings (Off, X); -- unreferenced N := Natural (To); N := N - 1; Y2 := Line_Position (N); if Y2 < Y1 then New_Page (Win); Y1 := 0; end if; if Y1 < Y2 then New_Line (Win, Positive_Count (Y2 - Y1)); end if; end Set_Line; procedure Set_Line (To : Positive_Count) is begin Set_Line (Get_Window, To); end Set_Line; function Col (Win : Window) return Positive_Count is Y : Line_Position; X : Column_Position; N : Natural; begin Get_Cursor_Position (Win, Y, X); N := Natural (X); N := N + 1; -- if N > Natural (Count'Last) then -- raise Layout_Error; -- end if; return Positive_Count (N); end Col; function Col return Positive_Count is begin return Col (Get_Window); end Col; function Line (Win : Window) return Positive_Count is Y : Line_Position; X : Column_Position; N : Natural; begin Get_Cursor_Position (Win, Y, X); N := Natural (Y); N := N + 1; -- if N > Natural (Count'Last) then -- raise Layout_Error; -- end if; return Positive_Count (N); end Line; function Line return Positive_Count is begin return Line (Get_Window); end Line; ----------------------- -- Characters Output -- ----------------------- procedure Put (Win : Window; Item : Character) is P_Size : constant Count := Page_Length (Win); Y : Line_Position; X : Column_Position; L : Line_Count; C : Column_Count; begin if P_Size > 0 then Get_Cursor_Position (Win, Y, X); Get_Size (Win, L, C); if (Y + 1) = L and then (X + 1) = C then New_Page (Win); end if; end if; Add (Win, Item); end Put; procedure Put (Item : Character) is begin Put (Get_Window, Item); end Put; -------------------- -- Strings-Output -- -------------------- procedure Put (Win : Window; Item : String) is P_Size : constant Count := Page_Length (Win); Y : Line_Position; X : Column_Position; L : Line_Count; C : Column_Count; begin if P_Size > 0 then Get_Cursor_Position (Win, Y, X); Get_Size (Win, L, C); if (Y + 1) = L and then (X + 1 + Item'Length) >= C then New_Page (Win); end if; end if; Add (Win, Item); end Put; procedure Put (Item : String) is begin Put (Get_Window, Item); end Put; procedure Put_Line (Win : Window; Item : String) is begin Put (Win, Item); New_Line (Win, 1); end Put_Line; procedure Put_Line (Item : String) is begin Put_Line (Get_Window, Item); end Put_Line; end Terminal_Interface.Curses.Text_IO;

28.952941

78

0.50386

29588b2abe68df99411f6059a02613270188b30a

2,716

adb

Ada

src/extraction-file_system.adb

TNO/Dependency_Graph_Extractor-Ada

cfcc9132cf181e4db5139c14150f221efa69a6d6

[ "BSD-3-Clause" ]

null

src/extraction-file_system.adb

TNO/Dependency_Graph_Extractor-Ada

cfcc9132cf181e4db5139c14150f221efa69a6d6

[ "BSD-3-Clause" ]

null

src/extraction-file_system.adb

TNO/Dependency_Graph_Extractor-Ada

cfcc9132cf181e4db5139c14150f221efa69a6d6

[ "BSD-3-Clause" ]

null

with Extraction.Node_Edge_Types; with Ada.Text_IO; package body Extraction.File_System is use type VFS.File_Array_Access; use type VFS.Filesystem_String; function All_Relevant_Files (Directory : VFS.Virtual_File) return VFS.File_Array_Access with Pre => Directory.Is_Directory; -- Only analyse relevant files -- I.e. remove irrelevant files and directories -- (e.g. version management related directories and files) function All_Relevant_Files (Directory : VFS.Virtual_File) return VFS.File_Array_Access is Result : VFS.File_Array_Access; function Is_Hidden (File : VFS.Virtual_File) return Boolean; function Is_Hidden (File : VFS.Virtual_File) return Boolean -- Linux-style hidden files and directories start with a '.' is Base_Name : constant String := +File.Base_Name; begin return Base_Name (Base_Name'First) = '.'; end Is_Hidden; procedure Internal (Directory : VFS.Virtual_File); procedure Internal (Directory : VFS.Virtual_File) is Files : VFS.File_Array_Access := Directory.Read_Dir; begin for File of Files.all loop if Is_Hidden (File) then Ada.Text_IO.Put_Line ("Skipping " & (+File.Full_Name)); else VFS.Append (Result, File); if File.Is_Directory then Internal (File); end if; end if; end loop; VFS.Unchecked_Free (Files); end Internal; begin Internal (Directory); return Result; end All_Relevant_Files; procedure Extract_Nodes (Directory : VFS.Virtual_File; Graph : Graph_Operations.Graph_Context) -- Add all relevant files in the file system. -- This enables the finding of "dead files": -- Files in the archive but no longer compiled / used by any project. is Files : VFS.File_Array_Access := All_Relevant_Files (Directory); begin Graph.Write_Node (Directory); if Files /= null then for File of Files.all loop Graph.Write_Node (File); end loop; end if; VFS.Unchecked_Free (Files); end Extract_Nodes; procedure Extract_Edges (Directory : VFS.Virtual_File; Graph : Graph_Operations.Graph_Context) is Files : VFS.File_Array_Access := All_Relevant_Files (Directory); begin if Files /= null then for File of Files.all loop Graph.Write_Edge (File.Get_Parent, File, Node_Edge_Types.Edge_Type_Contains); end loop; end if; VFS.Unchecked_Free (Files); end Extract_Edges; end Extraction.File_System;

30.863636

76

0.642489

2263575d1d9b31d8f23b3651f7b6b3b1baf409c2

7,277

adb

Ada

src/drivers/qspi_u2008/sam-qspi.adb

Fabien-Chouteau/samd51-hal

54d4b29df100502d8b3e3b4680a198640faa5f4d

[ "BSD-3-Clause" ]

1

2020-02-24T23:19:03.000Z

src/drivers/qspi_u2008/sam-qspi.adb

Fabien-Chouteau/samd51-hal

54d4b29df100502d8b3e3b4680a198640faa5f4d

[ "BSD-3-Clause" ]

null

src/drivers/qspi_u2008/sam-qspi.adb

Fabien-Chouteau/samd51-hal

54d4b29df100502d8b3e3b4680a198640faa5f4d

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- Copyright (C) 2020-2021, AdaCore -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions are -- -- met: -- -- 1. Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- 2. Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in -- -- the documentation and/or other materials provided with the -- -- distribution. -- -- 3. Neither the name of the copyright holder nor the names of its -- -- contributors may be used to endorse or promote products derived -- -- from this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT -- -- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, -- -- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY -- -- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -- -- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -- -- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ with System; with System.Machine_Code; use System.Machine_Code; with SAM_SVD.QSPI; use SAM_SVD.QSPI; package body SAM.QSPI is QSPI_Region : constant := 16#04000000#; Empty : UInt8_Array (1 .. 0); ------------ -- Enable -- ------------ procedure Enable is begin QSPI_Periph.CTRLA.ENABLE := True; end Enable; ----------- -- Reset -- ----------- procedure Reset is begin QSPI_Periph.CTRLA.SWRST := True; end Reset; --------------- -- Configure -- --------------- procedure Configure (Baud : UInt8) is begin QSPI_Periph.BAUD.BAUD := Baud; QSPI_Periph.CTRLB.MODE := MEMORY; QSPI_Periph.CTRLB.DATALEN := Val_8BITS; QSPI_Periph.CTRLB.CSMODE := LASTXFER; end Configure; --------- -- Run -- --------- procedure Run (Command : UInt8) is Iframe : QSPI_INSTRFRAME_Register := (others => <>); begin Iframe.WIDTH := SINGLE_BIT_SPI; Iframe.ADDRLEN := Val_24BITS; Iframe.TFRTYPE := READ; Iframe.INSTREN := True; Run_Instruction (Command, Iframe, 0, Empty); end Run; ---------- -- Read -- ---------- procedure Read (Command : UInt8; Data : out UInt8_Array) is Iframe : QSPI_INSTRFRAME_Register := (others => <>); begin Iframe.WIDTH := SINGLE_BIT_SPI; Iframe.ADDRLEN := Val_24BITS; Iframe.TFRTYPE := READ; Iframe.DATAEN := True; Iframe.INSTREN := True; Run_Instruction (Command, Iframe, 0, Data); end Read; ----------- -- Write -- ----------- procedure Write (Command : UInt8; Data : in out UInt8_Array) is Iframe : QSPI_INSTRFRAME_Register := (others => <>); begin Iframe.WIDTH := SINGLE_BIT_SPI; Iframe.ADDRLEN := Val_24BITS; Iframe.TFRTYPE := WRITE; Iframe.DATAEN := Data'Length /= 0; Iframe.INSTREN := True; Run_Instruction (Command, Iframe, 0, Data); end Write; ----------- -- Erase -- ----------- procedure Erase (Command : UInt8; Addr : UInt32) is Iframe : QSPI_INSTRFRAME_Register := (others => <>); begin Iframe.WIDTH := SINGLE_BIT_SPI; Iframe.ADDRLEN := Val_24BITS; Iframe.TFRTYPE := WRITE; Iframe.ADDREN := True; Iframe.INSTREN := True; Run_Instruction (Command, Iframe, Addr, Empty); end Erase; ----------------- -- Read_Memory -- ----------------- procedure Read_Memory (Addr : UInt32; Data : out UInt8_Array) is Iframe : QSPI_INSTRFRAME_Register := (others => <>); begin Iframe.WIDTH := QUAD_OUTPUT; Iframe.ADDRLEN := Val_24BITS; Iframe.TFRTYPE := READMEMORY; Iframe.ADDREN := True; Iframe.DATAEN := True; Iframe.INSTREN := True; Iframe.DUMMYLEN := 8; Run_Instruction (16#6B#, Iframe, Addr, Data); end Read_Memory; ------------------ -- Write_Memory -- ------------------ procedure Write_Memory (Addr : UInt32; Data : in out UInt8_Array) is Iframe : QSPI_INSTRFRAME_Register := (others => <>); begin Iframe.WIDTH := QUAD_OUTPUT; Iframe.ADDRLEN := Val_24BITS; Iframe.TFRTYPE := WRITEMEMORY; Iframe.ADDREN := True; Iframe.DATAEN := True; Iframe.INSTREN := True; Run_Instruction (16#32#, Iframe, Addr, Data); end Write_Memory; --------------------- -- Run_Instruction -- --------------------- procedure Run_Instruction (Command : UInt8; Iframe : SAM_SVD.QSPI.QSPI_INSTRFRAME_Register; Addr : UInt32; Buffer : in out UInt8_Array) is Unused : QSPI_INSTRFRAME_Register; begin -- WTF?!? -- if Command in 16#20# | 16#D8# then -- QSPI_Periph.INSTRADDR := Addr; -- end if; QSPI_Periph.INSTRCTRL.INSTR := Command; QSPI_Periph.INSTRADDR := Addr; QSPI_Periph.INSTRFRAME := Iframe; -- Dummy read of INSTRFRAME needed to synchronize. -- See Instruction Transmission Flow Diagram, figure 37.9, page 995 -- and Example 4, page 998, section 37.6.8.5. Unused := QSPI_Periph.INSTRFRAME; if Buffer'Length /= 0 then declare Mem : UInt8_Array (Buffer'First .. Buffer'Last) with Address => System'To_Address (QSPI_Region + Addr); begin case Iframe.TFRTYPE is when READ | READMEMORY => Buffer := Mem; when WRITE | WRITEMEMORY => Mem := Buffer; end case; end; end if; Asm ("dsb" & ASCII.LF & ASCII.HT & "isb", Volatile => True); QSPI_Periph.CTRLA := (SWRST => False, ENABLE => True, LASTXFER => True, others => <>); while not QSPI_Periph.INTFLAG.INSTREND loop null; end loop; QSPI_Periph.INTFLAG.INSTREND := True; end Run_Instruction; end SAM.QSPI;

31.63913

78

0.538271

c738103b6382df70ba7ee6e30703e67f6aed608a

10,871

ads

Ada

awa/plugins/awa-tags/src/awa-tags-components.ads

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

81

2015-01-18T23:02:30.000Z

2022-03-19T17:34:57.000Z

awa/plugins/awa-tags/src/awa-tags-components.ads

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

20

2015-12-09T19:26:19.000Z

2022-03-23T14:32:43.000Z

awa/plugins/awa-tags/src/awa-tags-components.ads

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

16

2015-06-29T02:44:06.000Z

2021-09-23T18:47:50.000Z

----------------------------------------------------------------------- -- awa-tags-components -- Tags component -- Copyright (C) 2013 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Util.Beans.Basic; with Util.Beans.Objects; with Util.Strings.Vectors; with EL.Expressions; with ASF.Components.Html.Forms; with ASF.Contexts.Faces; with ASF.Contexts.Writer; with ASF.Events.Faces; with ASF.Factory; with AWA.Tags.Models; -- == HTML components == -- -- === Displaying a list of tags === -- The <tt>awa:tagList</tt> component displays a list of tags. Each tag can be rendered as -- a link if the <tt>tagLink</tt> attribute is defined. The list of tags is passed in the -- <tt>value</tt> attribute. When rending that list, the <tt>var</tt> attribute is used to -- setup a variable with the tag value. The <tt>tagLink</tt> attribute is then evaluated -- against that variable and the result defines the link. -- -- <awa:tagList value='#{questionList.tags}' id='qtags' styleClass="tagedit-list" -- tagLink="#{contextPath}/questions/tagged.html?tag=#{tagName}" -- var="tagName" -- tagClass="tagedit-listelement tagedit-listelement-old"/> -- -- === Tag editing === -- The <tt>awa:tagList</tt> component allows to add or remove tags associated with a given -- database entity. The tag management works with the jQuery plugin Tagedit. For this, -- the page must include the /js/jquery.tagedit.js Javascript resource. -- -- The tag edition is active only if the <tt>awa:tagList</tt> component is placed within an -- <tt>h:form</tt> component. The <tt>value</tt> attribute defines the list of tags. This must -- be a <tt>Tag_List_Bean</tt> object. -- -- <awa:tagList value='#{question.tags}' id='qtags' -- autoCompleteUrl='#{contextPath}/questions/lists/tag-search.html'/> -- -- When the form is submitted and validated, the procedure <tt>Set_Added</tt> and -- <tt>Set_Deleted</tt> are called on the value bean with the list of tags that were -- added and removed. These operations are called in the <tt>UPDATE_MODEL_VALUES</tt> -- phase (ie, before calling the action's bean operation). -- -- === Tag cloud === -- The <tt>awa:tagCloud</tt> component displays a list of tags as a tag cloud. -- The tags list passed in the <tt>value</tt> attribute must inherit from the -- <tt>Tag_Info_List_Bean</tt> type which indicates for each tag the number of -- times it is used. -- -- <awa:tagCloud value='#{questionTagList}' id='cloud' styleClass="tag-cloud" -- var="tagName" rows="30" -- tagLink="#{contextPath}/questions/tagged.html?tag=#{tagName}" -- tagClass="tag-link"/> -- package AWA.Tags.Components is use ASF.Contexts.Writer; -- Get the Tags component factory. function Definition return ASF.Factory.Factory_Bindings_Access; -- ------------------------------ -- Input component -- ------------------------------ -- The AWA input component overrides the ASF input component to build a compact component -- that displays a label, the input field and the associated error message if necessary. -- -- The generated HTML looks like: -- -- <ul class='taglist'> -- <li>tag</li> -- </ul> -- -- or -- -- <input type='text' name='' value='tag'/> -- type Tag_UIInput is new ASF.Components.Html.Forms.UIInput with record -- List of tags that have been added. Added : Util.Strings.Vectors.Vector; -- List of tags that have been removed. Deleted : Util.Strings.Vectors.Vector; -- True if the submitted values are correct. Is_Valid : Boolean := False; end record; type Tag_UIInput_Access is access all Tag_UIInput'Class; -- Returns True if the tag component must be rendered as readonly. function Is_Readonly (UI : in Tag_UIInput; Context : in ASF.Contexts.Faces.Faces_Context'Class) return Boolean; -- Get the tag after convertion with the optional converter. function Get_Tag (UI : in Tag_UIInput; Tag : in Util.Beans.Objects.Object; Context : in ASF.Contexts.Faces.Faces_Context'Class) return String; -- Render the tag as a readonly item. procedure Render_Readonly_Tag (UI : in Tag_UIInput; Tag : in Util.Beans.Objects.Object; Class : in Util.Beans.Objects.Object; Writer : in Response_Writer_Access; Context : in out ASF.Contexts.Faces.Faces_Context'Class); -- Render the tag as a link. procedure Render_Link_Tag (UI : in Tag_UIInput; Name : in String; Tag : in Util.Beans.Objects.Object; Link : in EL.Expressions.Expression; Class : in Util.Beans.Objects.Object; Writer : in Response_Writer_Access; Context : in out ASF.Contexts.Faces.Faces_Context'Class); -- Render the tag for an input form. procedure Render_Form_Tag (UI : in Tag_UIInput; Id : in String; Tag : in Util.Beans.Objects.Object; Writer : in Response_Writer_Access; Context : in out ASF.Contexts.Faces.Faces_Context'Class); -- a link is rendered for each tag. Otherwise, each tag is rendered as a <tt>span</tt>. procedure Render_Readonly (UI : in Tag_UIInput; List : in Util.Beans.Basic.List_Bean_Access; Context : in out ASF.Contexts.Faces.Faces_Context'Class); -- Render the list of tags for a form. procedure Render_Form (UI : in Tag_UIInput; List : in Util.Beans.Basic.List_Bean_Access; Context : in out ASF.Contexts.Faces.Faces_Context'Class); -- Render the javascript to enable the tag edition. procedure Render_Script (UI : in Tag_UIInput; Id : in String; Writer : in Response_Writer_Access; Context : in out ASF.Contexts.Faces.Faces_Context'Class); -- Render the input component. Starts the DL/DD list and write the input -- component with the possible associated error message. overriding procedure Encode_Begin (UI : in Tag_UIInput; Context : in out ASF.Contexts.Faces.Faces_Context'Class); -- Render the end of the input component. Closes the DL/DD list. overriding procedure Encode_End (UI : in Tag_UIInput; Context : in out ASF.Contexts.Faces.Faces_Context'Class); -- Get the action method expression to invoke if the command is pressed. function Get_Action_Expression (UI : in Tag_UIInput; Context : in ASF.Contexts.Faces.Faces_Context'Class) return EL.Expressions.Method_Expression; -- Decode any new state of the specified component from the request contained -- in the specified context and store that state on the component. -- -- During decoding, events may be enqueued for later processing -- (by event listeners that have registered an interest), by calling -- the Queue_Event on the associated component. overriding procedure Process_Decodes (UI : in out Tag_UIInput; Context : in out ASF.Contexts.Faces.Faces_Context'Class); -- Perform the component tree processing required by the Update Model Values -- phase of the request processing lifecycle for all facets of this component, -- all children of this component, and this component itself, as follows. -- <ul> -- <li>If this component rendered property is false, skip further processing. -- <li>Call the Process_Updates/b> of all facets and children. -- <ul> overriding procedure Process_Updates (UI : in out Tag_UIInput; Context : in out ASF.Contexts.Faces.Faces_Context'Class); -- Broadcast the event to the event listeners installed on this component. -- Listeners are called in the order in which they were added. overriding procedure Broadcast (UI : in out Tag_UIInput; Event : not null access ASF.Events.Faces.Faces_Event'Class; Context : in out ASF.Contexts.Faces.Faces_Context'Class); -- ------------------------------ -- Tag Cloud Component -- ------------------------------ -- The tag cloud component type Tag_UICloud is new ASF.Components.Html.UIHtmlComponent with null record; type Tag_Info_Array is array (Positive range <>) of AWA.Tags.Models.Tag_Info; type Tag_Info_Array_Access is access all Tag_Info_Array; -- Render the tag cloud component. overriding procedure Encode_Children (UI : in Tag_UICloud; Context : in out ASF.Contexts.Faces.Faces_Context'Class); -- Compute the weight for each tag in the list according to the <tt>minWeight</tt> and -- <tt>maxWeight</tt> attributes. The computed weight is an integer multiplied by 100 -- and will range from 100xminWeight and 100xmaxWeight. procedure Compute_Cloud_Weight (UI : in Tag_UICloud; List : in out Tag_Info_Array; Context : in out ASF.Contexts.Faces.Faces_Context'Class); -- Render the list of tags. If the <tt>tagLink</tt> attribute is defined, a link -- is rendered for each tag. procedure Render_Cloud (UI : in Tag_UICloud; List : in Tag_Info_Array; Context : in out ASF.Contexts.Faces.Faces_Context'Class); end AWA.Tags.Components;

47.265217

97

0.610983

2eddd5616612ae1e7b267e84a14125a1134609cf

2,723

ads

Ada

.emacs.d/elpa/wisi-3.0.1/wisitoken-parse-packrat-generated.ads

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

.emacs.d/elpa/wisi-3.0.1/wisitoken-parse-packrat-generated.ads

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

.emacs.d/elpa/wisi-3.0.1/wisitoken-parse-packrat-generated.ads

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

-- Abstract : -- -- Types and operations for a packrat parser runtime, with nonterm -- parsing subprograms generated by wisi-generate. -- -- References: -- -- see parent. -- -- Copyright (C) 2018 - 2019 Free Software Foundation, Inc. -- -- This library is free software; you can redistribute it and/or modify it -- under terms of the GNU General Public License as published by the Free -- Software Foundation; either version 3, or (at your option) any later -- version. This library is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHAN- -- TABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- As a special exception under Section 7 of GPL version 3, you are granted -- additional permissions described in the GCC Runtime Library Exception, -- version 3.1, as published by the Free Software Foundation. pragma License (Modified_GPL); with WisiToken.Syntax_Trees; package WisiToken.Parse.Packrat.Generated is Recursive : exception; -- FIXME: delete type Memo_State is (No_Result, Failure, Success); subtype Result_States is Memo_State range Failure .. Success; type Memo_Entry (State : Memo_State := No_Result) is record case State is when No_Result => Recursive : Boolean := False; -- FIXME: delete when Failure => null; when Success => Result : aliased WisiToken.Syntax_Trees.Valid_Node_Index; Last_Token : Base_Token_Index; -- FIXME: change to Last_Pos end case; end record; package Memos is new SAL.Gen_Unbounded_Definite_Vectors (Token_Index, Memo_Entry, Default_Element => (others => <>)); subtype Result_Type is Memo_Entry with Dynamic_Predicate => Result_Type.State in Result_States; package Derivs is new SAL.Gen_Unbounded_Definite_Vectors (Token_ID, Memos.Vector, Default_Element => Memos.Empty_Vector); type Parse_WisiToken_Accept is access -- WORKAROUND: using Packrat.Parser'Class here hits a GNAT Bug box in GPL 2018. function (Parser : in out Base_Parser'Class; Last_Pos : in Base_Token_Index) return Result_Type; type Parser is new Packrat.Parser with record Derivs : Generated.Derivs.Vector; -- FIXME: use discriminated array, as in procedural Parse_WisiToken_Accept : Generated.Parse_WisiToken_Accept; end record; overriding procedure Parse (Parser : aliased in out Generated.Parser); overriding function Tree (Parser : in Generated.Parser) return Syntax_Trees.Tree; overriding function Any_Errors (Parser : in Generated.Parser) return Boolean; overriding procedure Put_Errors (Parser : in Generated.Parser); end WisiToken.Parse.Packrat.Generated;

36.797297

101

0.731913

2e18b431931be9b35a51c69872e636ed0a072e66

117

ads

Ada

src/title_screen.ads

Fabien-Chouteau/motherlode

a97e3f41d189b9725592873b4ae547850ee3a51c

[ "MIT" ]

2

2020-08-24T15:01:37.000Z

2020-10-16T22:37:07.000Z

src/title_screen.ads

Fabien-Chouteau/motherlode

a97e3f41d189b9725592873b4ae547850ee3a51c

[ "MIT" ]

null

src/title_screen.ads

Fabien-Chouteau/motherlode

a97e3f41d189b9725592873b4ae547850ee3a51c

[ "MIT" ]

1

2021-01-19T12:00:35.000Z

13

38

0.735043

2ec09d5e784c7140de2f6741fa2a1a9475283837

2,884

ads

Ada

boards/stm32f051_rfm69/stm32gd-board.ads

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

1

2021-04-06T07:57:56.000Z

boards/stm32f051_rfm69/stm32gd-board.ads

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

null

boards/stm32f051_rfm69/stm32gd-board.ads

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

2

2018-05-29T13:59:31.000Z

2019-02-03T19:48:08.000Z

with STM32GD.GPIO; with STM32GD.GPIO.Pin; with STM32GD.USART; with STM32GD.USART.Peripheral; with STM32GD.SPI; with STM32GD.SPI.Peripheral; with STM32GD.I2C; with STM32GD.I2C.Peripheral; with STM32GD.RTC; with STM32GD.Clock; with STM32GD.Clock.Tree; with Drivers.Text_IO; with Drivers.RFM69; package STM32GD.Board is package Clocks is new STM32GD.Clock.Tree; package GPIO renames STM32GD.GPIO; package BUTTON is new GPIO.Pin (Pin => GPIO.Pin_0, Port => GPIO.Port_A); package LED is new GPIO.Pin (Pin => GPIO.Pin_1, Port => GPIO.Port_B, Mode => GPIO.Mode_Out); package LED2 is new GPIO.Pin (Pin => GPIO.Pin_0, Port => GPIO.Port_B, Mode => GPIO.Mode_Out); package LED3 is new GPIO.Pin (Pin => GPIO.Pin_3, Port => GPIO.Port_B, Mode => GPIO.Mode_Out); package SCLK is new GPIO.Pin (Pin => GPIO.Pin_5, Port => GPIO.Port_A, Mode => GPIO.Mode_AF); package MISO is new GPIO.Pin (Pin => GPIO.Pin_6, Port => GPIO.Port_A, Mode => GPIO.Mode_AF); package MOSI is new GPIO.Pin (Pin => GPIO.Pin_7, Port => GPIO.Port_A, Mode => GPIO.Mode_AF); package CSN is new GPIO.Pin (Pin => GPIO.Pin_4, Port => GPIO.Port_A, Mode => GPIO.Mode_Out); package TX is new GPIO.Pin (Pin => GPIO.Pin_9, Port => GPIO.Port_A, Pull_Resistor => GPIO.Pull_Up, Mode => GPIO.Mode_AF, Alternate_Function => 1); package RX is new GPIO.Pin (Pin => GPIO.Pin_10, Port => GPIO.Port_A, Pull_Resistor => GPIO.Pull_Up, Mode => GPIO.Mode_AF, Alternate_Function => 1); package RFM69_RESET is new GPIO.Pin (Pin => GPIO.Pin_2, Port => GPIO.Port_A, Mode => GPIO.Mode_Out); package IRQ is new GPIO.Pin (Pin => GPIO.Pin_3, Port => GPIO.Port_A, Mode => GPIO.Mode_In); package SCL is new GPIO.Pin (Pin => GPIO.Pin_6, Port => GPIO.Port_B, Mode => GPIO.Mode_AF, Alternate_Function => 1); package SCL_OUT is new GPIO.Pin (Pin => GPIO.Pin_6, Port => GPIO.Port_B, Mode => GPIO.Mode_Out); package SDA is new GPIO.Pin (Pin => GPIO.Pin_7, Port => GPIO.Port_B, Mode => GPIO.Mode_AF, Alternate_Function => 1); package SPI is new STM32GD.SPI.Peripheral (SPI => STM32GD.SPI.SPI_1); package I2C is new STM32GD.I2C.Peripheral ( I2C => STM32GD.I2C.I2C_1); package USART is new STM32GD.USART.Peripheral (USART => STM32GD.USART.USART_1, Speed => 115200, RX_DMA_Buffer_Size => 64, Clock_Tree => CLOCKS, Clock => STM32GD.Clock.HSI); package Radio is new Drivers.RFM69 (SPI => SPI, Chip_Select => CSN, IRQ => IRQ, Frequency => 868_000_000); package Text_IO is new Drivers.Text_IO (USART => STM32GD.Board.USART); package RTC is new STM32GD.RTC (Clock_Tree => STM32GD.Board.Clocks, Clock => STM32GD.Clock.LSI); procedure Init; procedure Enable_Peripherals; procedure Disable_Peripherals; end STM32GD.Board;

56.54902

160

0.665742

2e4909cfaaf660e2550a69a736bb81b833c42c55

2,762

adb

Ada

src/extraction-derived_type_defs.adb

TNO/Dependency_Graph_Extractor-Ada

cfcc9132cf181e4db5139c14150f221efa69a6d6

[ "BSD-3-Clause" ]

null

src/extraction-derived_type_defs.adb

TNO/Dependency_Graph_Extractor-Ada

cfcc9132cf181e4db5139c14150f221efa69a6d6

[ "BSD-3-Clause" ]

null

src/extraction-derived_type_defs.adb

TNO/Dependency_Graph_Extractor-Ada

cfcc9132cf181e4db5139c14150f221efa69a6d6

[ "BSD-3-Clause" ]

null

with Extraction.Node_Edge_Types; with Extraction.Utilities; package body Extraction.Derived_Type_Defs is use type LALCO.Ada_Node_Kind_Type; function Has_Interfaces (Node : LAL.Ada_Node'Class) return Boolean is (Node.Kind in LALCO.Ada_Derived_Type_Def | LALCO.Ada_Task_Def | LALCO.Ada_Protected_Type_Decl | LALCO.Ada_Single_Protected_Decl); function Get_Interfaces (Node : LAL.Ada_Node'Class) return LAL.Parent_List; function Get_Interfaces (Node : LAL.Ada_Node'Class) return LAL.Parent_List is begin case Node.Kind is when LALCO.Ada_Derived_Type_Def => return Node.As_Derived_Type_Def.F_Interfaces; when LALCO.Ada_Task_Def => return Node.As_Task_Def.F_Interfaces; when LALCO.Ada_Protected_Type_Decl => return Node.As_Protected_Type_Decl.F_Interfaces; when LALCO.Ada_Single_Protected_Decl => return Node.As_Single_Protected_Decl.F_Interfaces; when others => raise Internal_Extraction_Error with "Cases in Has_Interfaces and Get_Interfaces do not match"; end case; end Get_Interfaces; procedure Extract_Edges (Node : LAL.Ada_Node'Class; Graph : Graph_Operations.Graph_Context) is begin if Node.Kind = LALCO.Ada_Derived_Type_Def then declare Derived_Type_Def : constant LAL.Derived_Type_Def := Node.As_Derived_Type_Def; Type_Decl : constant LAL.Basic_Decl := Utilities.Get_Parent_Basic_Decl (Derived_Type_Def); Subtype_Indication : constant LAL.Subtype_Indication := Derived_Type_Def.F_Subtype_Indication; begin if not Subtype_Indication.Is_Null then declare Parent : constant LAL.Basic_Decl := Utilities.Get_Referenced_Decl (Subtype_Indication.F_Name); begin Graph.Write_Edge (Type_Decl, Parent, Node_Edge_Types.Edge_Type_Derives_From); end; end if; end; end if; if Has_Interfaces (Node) then declare Decl : constant LAL.Basic_Decl := Utilities.Get_Parent_Basic_Decl (Node); begin for Interface_Ref of Get_Interfaces (Node) loop declare Parent : constant LAL.Basic_Decl := Utilities.Get_Referenced_Decl (Interface_Ref); begin Graph.Write_Edge (Decl, Parent, Node_Edge_Types.Edge_Type_Derives_From); end; end loop; end; end if; end Extract_Edges; end Extraction.Derived_Type_Defs;

36.342105

78

0.629254

290e07604e33b333c66cddc1f6178872f09fdace

1,857

ads

Ada

source/configs.ads

jquorning/CELLE

0584a22bd48464c2727751fca9dbca079e217b0c

[ "blessing" ]

null

source/configs.ads

jquorning/CELLE

0584a22bd48464c2727751fca9dbca079e217b0c

[ "blessing" ]

null

source/configs.ads

jquorning/CELLE

0584a22bd48464c2727751fca9dbca079e217b0c

[ "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 Rules; with Rule_Lists; with Symbol_Sets; with Prop_Links; limited with States; package Configs is -- A configuration is a production rule of the grammar together with -- a mark (dot) showing how much of that rule has been processed so far. -- Configurations also contain a follow-set which is a list of terminal -- symbols which are allowed to immediately follow the end of the rule. -- Every configuration is recorded as an instance of the following: type Config_Status is (Complete, Incomplete); type Config_Record; type Config_Access is access all Config_Record; type Config_Record is record Rule : Rule_Lists.Rule_Access; -- The rule upon which the configuration is based Dot : Rules.Dot_Type; -- The parse point Follow_Set : Symbol_Sets.Set_Type; -- Follow-set for this configuration only Forward_PL : Prop_Links.List; -- Forward propagation links Backward_PL : Prop_Links.List; -- Follow-set backwards propagation links State : access States.State_Record; -- Pointer to state which contains this Status : Config_Status; -- Used during followset and shift computations Next : Config_Access; -- Next configuration in the state Basis : Config_Access; -- The next basis configuration end record; function "<" (Left, Right : in Config_Record) return Boolean; function "<" (Left, Right : in Config_Access) return Boolean; end Configs;

28.569231

76

0.670436

2217ee2787f155119f94b79c31f72db879a802d7

1,914

ads

Ada

awa/samples/src/atlas-microblog-modules.ads

Letractively/ada-awa

3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe

[ "Apache-2.0" ]

7

2016-05-01T13:19:01.000Z

2020-03-18T14:47:27.000Z

awa/samples/src/atlas-microblog-modules.ads

Letractively/ada-awa

3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe

[ "Apache-2.0" ]

3

2018-06-06T15:52:11.000Z

2020-03-11T14:03:46.000Z

src/atlas-microblog-modules.ads

stcarrez/atlas

712e6c99ebf2d6742f493b74bef9275205df98c6

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- atlas-microblog-modules -- Module microblog -- Copyright (C) 2012 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with ASF.Applications; with AWA.Modules; with Atlas.Microblog.Models; package Atlas.Microblog.Modules is -- The name under which the module is registered. NAME : constant String := "microblog"; -- ------------------------------ -- Module microblog -- ------------------------------ type Microblog_Module is new AWA.Modules.Module with private; type Microblog_Module_Access is access all Microblog_Module'Class; -- Initialize the microblog module. overriding procedure Initialize (Plugin : in out Microblog_Module; App : in AWA.Modules.Application_Access; Props : in ASF.Applications.Config); -- Get the microblog module. function Get_Microblog_Module return Microblog_Module_Access; -- Create a post for the microblog. procedure Create (Plugin : in Microblog_Module; Post : in out Atlas.Microblog.Models.Mblog_Ref); private type Microblog_Module is new AWA.Modules.Module with null record; end Atlas.Microblog.Modules;

37.529412

76

0.634796

ad1d81bad97c4069cd501aab58ffae8a74ae37c9

2,290

adb

Ada

src/ada/src/tests/test_msg_decode.adb

VVCAS-Sean/OpenUxAS

dcd7be29d182d278a5387908f568d6f8a06b79ee

[ "NASA-1.3" ]

88

2017-08-24T07:02:01.000Z

2022-03-18T04:34:17.000Z

src/ada/src/tests/test_msg_decode.adb

VVCAS-Sean/OpenUxAS

dcd7be29d182d278a5387908f568d6f8a06b79ee

[ "NASA-1.3" ]

46

2017-06-08T18:18:08.000Z

2022-03-15T18:24:43.000Z

src/ada/src/tests/test_msg_decode.adb

VVCAS-Sean/OpenUxAS

dcd7be29d182d278a5387908f568d6f8a06b79ee

[ "NASA-1.3" ]

53

2017-06-22T14:48:05.000Z

2022-02-15T16:59:38.000Z

with ZMQ.Sockets; with ZMQ.Contexts; with ZMQ.Messages; with Ada.Text_IO; use Ada.Text_IO; with AVTAS.LMCP.Types; use AVTAS.LMCP.Types; with AVTAS.LMCP.ByteBuffers; use AVTAS.LMCP.ByteBuffers; with AVTAS.Lmcp.Factory; procedure Test_Msg_Decode is Ctx : ZMQ.Contexts.Context; Sub : ZMQ.Sockets.Socket; Buffer : ByteBuffer (Capacity => 4*1024); begin Ctx.Set_Number_Of_IO_Threads (1); Sub.Initialize (Ctx, ZMQ.Sockets.SUB); Sub.Connect ("tcp://127.0.0.1:5560"); -- Accept all forwarded messages (filtering on PUB side via 'SubscribeToMessage' child elements) Sub.Establish_Message_Filter (""); loop declare ZmqMsg : ZMQ.Messages.Message; begin ZmqMsg.Initialize (0); Buffer.Clear; Sub.Recv (ZmqMsg); -- Put_Line (ZmqMsg.GetData); Buffer.Put_Raw_Bytes (ZmqMsg.GetData); Buffer.Rewind; declare CtrlStr : Int32; MsgSize : UInt32; MsgExists : Boolean; SeriesId : Int64; MsgType : Uint32; Version : Uint16; LMCP_CONTROL_STR : constant Int32 := 1634103916; begin Buffer.Get_Int32 (CtrlStr); if CtrlStr /= LMCP_CONTROL_STR then Put_Line ("wrong LMCP_CONTROL_STR:" & CtrlStr'Image); goto Continue; end if; Buffer.Get_UInt32 (MsgSize); if Buffer.Capacity < MsgSize then Put_Line ("wrong msgsize:" & MsgSize'Image); goto Continue; end if; if not AVTAS.lmcp.factory.Validate (Buffer) then Put_Line ("checksum not valid"); goto Continue; end if; Buffer.Get_Boolean (MsgExists); if not MsgExists then Put_Line ("msg not present"); goto Continue; end if; Buffer.Get_Int64 (SeriesId); Buffer.Get_UInt32 (MsgType); Buffer.Get_UInt16 (Version); Put_Line ("SeriesId:" & SeriesId'Image); Put_Line ("MsgType:" & MsgType'Image); Put_Line ("Version:" & Version'Image); end; end; <<Continue>> end loop; end Test_Msg_Decode;

29.358974

99

0.565939

3dadf87bf5cfea57f2b49c139f1c1389be84bb01

4,614

ads

Ada

source/HandlerList.ads

bracke/Meaning

709f609df916aa9442f9b75c7dcb62ab807a48e9

[ "MIT" ]

null

source/HandlerList.ads

bracke/Meaning

709f609df916aa9442f9b75c7dcb62ab807a48e9

[ "MIT" ]

null

source/HandlerList.ads

bracke/Meaning

709f609df916aa9442f9b75c7dcb62ab807a48e9

[ "MIT" ]

null

-------------------------------------------------------------------------------- -- -- -- Copyright (C) 2004, RISC OS Ada Library (RASCAL) developers. -- -- -- -- This library is free software; you can redistribute it and/or -- -- modify it under the terms of the GNU Lesser General Public -- -- License as published by the Free Software Foundation; either -- -- version 2.1 of the License, or (at your option) any later version. -- -- -- -- This library is distributed in the hope that it will be useful, -- -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -- -- Lesser General Public License for more details. -- -- -- -- You should have received a copy of the GNU Lesser General Public -- -- License along with this library; if not, write to the Free Software -- -- Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA -- -- -- -------------------------------------------------------------------------------- -- @brief HandlerList types and methods. -- $Author$ -- $Date$ -- $Revision$ with RASCAL.OS; use RASCAL.OS; package HandlerList is type Position is private; type List (Nr : Integer; W : Integer; I : Integer) is limited private; type ListPointer is access List; -- raised if no space left for a new node OutOfSpace : exception; -- raised if a Position is past the end PastEnd : exception; -- raised if a Position is before the begin PastBegin : exception; EmptyList : exception; -- -- Pre: L and X are defined -- Post: a node containing X is inserted -- at the front or rear of L, respectively -- procedure AddToRear (L : in out List; X : Event_Pointer); function First (L : List) return Position; -- -- Pre: L and P are defined; P designates a node in L -- Post: returns the value of the element at position P -- Raises: EmptyList if L is empty -- PastBegin if P points before the beginning of L -- PastEnd if P points beyond the end of L -- function Retrieve (L : in List; P : in Position) return Event_Pointer; -- -- Pre: L and P are defined; P designates a node in L -- Post: the node at position P of L is deleted -- Raises: EmptyList if L is empty -- PastBegin if P is NULL -- procedure Delete (L : in out List; P : Position); -- -- Pre: L and P are defined; P designates a node in L -- Post: P is advanced to designate the next node of L -- Raises: EmptyList if L is empty -- PastEnd if P points beyond the end of L -- procedure GoAhead (L : List; P : in out Position); -- -- Pre: L and P are defined; P designates a node in L -- Post: P is moved to designate the previous node of L -- Raises: EmptyList if L is empty -- PastBegin if P points beyond the end of L -- procedure GoBack (L : List; P : in out Position); function IsEmpty (L : List) return Boolean; function IsFirst (L : List; P : Position) return Boolean; function IsLast (L : List; P : Position) return Boolean; function IsPastEnd (L : List; P : Position) return Boolean; -- -- Pre: L and P are defined -- Post: return True if the condition is met; False otherwise -- function IsPastBegin (L : List; P : Position) return Boolean; function Get_Event_Code (L : in List) return integer; private type Node; type Position is access Node; type Node is record Info : Event_Pointer; Link : Position; end record; type List (Nr : Integer) is record Code : Integer := Nr; Head : Position; Tail : Position; end record; ------------------------------------------------------------------------ -- | Generic ADT for one-way linked lists -- | Author: Michael B. Feldman, The George Washington University -- | Last Modified: January 1996 ------------------------------------------------------------------------ end HandlerList;

36.619048

80

0.523407

2ee0d9d240951c6dbc0aae3a5677e080ab3af31c

3,022

ads

Ada

Ada95/samples/sample-curses_demo.ads

mbloms/ncurses

74137fec04e130a88ef25618cf730af988a4f51a

[ "X11" ]

11

2019-01-02T17:00:32.000Z

2020-06-29T21:27:54.000Z

Ada95/samples/sample-curses_demo.ads

mbloms/ncurses

74137fec04e130a88ef25618cf730af988a4f51a

[ "X11" ]

4

2019-01-02T13:48:36.000Z

2019-02-18T21:17:41.000Z

Ada95/samples/sample-curses_demo.ads

mbloms/ncurses

74137fec04e130a88ef25618cf730af988a4f51a

[ "X11" ]

6

2019-02-15T20:11:02.000Z

2020-01-11T00:48:53.000Z

------------------------------------------------------------------------------ -- -- -- GNAT ncurses Binding Samples -- -- -- -- Sample.Curses_Demo -- -- -- -- S P E C -- -- -- ------------------------------------------------------------------------------ -- Copyright (c) 1998,2003 Free Software Foundation, Inc. -- -- -- -- Permission is hereby granted, free of charge, to any person obtaining a -- -- copy of this software and associated documentation files (the -- -- "Software"), to deal in the Software without restriction, including -- -- without limitation the rights to use, copy, modify, merge, publish, -- -- distribute, distribute with modifications, sublicense, and/or sell -- -- copies of the Software, and to permit persons to whom the Software is -- -- furnished to do so, subject to the following conditions: -- -- -- -- The above copyright notice and this permission notice shall be included -- -- in all copies or substantial portions of the Software. -- -- -- -- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -- -- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -- -- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. -- -- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -- -- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -- -- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR -- -- THE USE OR OTHER DEALINGS IN THE SOFTWARE. -- -- -- -- Except as contained in this notice, the name(s) of the above copyright -- -- holders shall not be used in advertising or otherwise to promote the -- -- sale, use or other dealings in this Software without prior written -- -- authorization. -- ------------------------------------------------------------------------------ -- Author: Juergen Pfeifer, 1996 -- Version Control -- $Revision: 1.10 $ -- Binding Version 01.00 ------------------------------------------------------------------------------ package Sample.Curses_Demo is procedure Demo; end Sample.Curses_Demo;

65.695652

78

0.411979

2e34aef5d1bfb4433ba91f88614e2de909af2d3f

2,538

adb

Ada

src/response_helpers.adb

psyomn/ash

7630208f9f2dc296f75076141d591354bde02ac7

[ "Apache-2.0" ]

11

2017-04-08T17:48:19.000Z

2021-12-31T23:36:25.000Z

src/response_helpers.adb

psyomn/axios

7630208f9f2dc296f75076141d591354bde02ac7

[ "Apache-2.0" ]

3

2017-03-24T04:34:15.000Z

2017-04-03T05:18:47.000Z

src/response_helpers.adb

psyomn/axios

7630208f9f2dc296f75076141d591354bde02ac7

[ "Apache-2.0" ]

4

2017-05-14T11:46:37.000Z

2019-04-18T20:34:07.000Z

-- Copyright 2019 Simon Symeonidis (psyomn) -- -- 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.Calendar; with Ada.Strings; use Ada.Strings; with Ada.Strings.Fixed; use Ada.Strings.Fixed; with GNAT.Calendar.Time_IO; with Common_Utils; use Common_Utils; package body Response_Helpers is function Headers (Status : HTTP_Status.Code) return String is Content_Type : constant String := "Content-Type: text/html; charset=iso-8859-1"; begin return First_Header_Line (Status) & Response_Date & CRLF & "Server: ash" & CRLF & Content_Type & CRLF & "Content-Length: "; end Headers; function Response_Date return String is package ac renames Ada.Calendar; package gct renames GNAT.Calendar.Time_IO; Current_Time : constant ac.Time := ac.Clock; Format : constant gct.Picture_String := "%a, %d %B %Y %H:%M:%S EST"; Field_Name : constant String := "Date: "; Result : constant String := Field_Name & gct.Image (Current_Time, Format); begin return Result; end Response_Date; function Make_Response (Status : HTTP_Status.Code; S : String) return String is Length : constant Positive := S'Length; Length_Str : constant String := Trim ( Source => Positive'Image (Length), Side => Both ); begin return Headers (Status) & Length_Str & CRLF & CRLF & S; end Make_Response; function First_Header_Line (Status : HTTP_Status.Code) return String is use HTTP_Status; Status_Str : constant String := Integer_To_Trimmed_String (Integer (Status)); Message : constant String := Message_Of_Code (Status); HTTP_Version : constant String := "1.0"; Result : constant String := "HTTP/" & HTTP_Version & " " & Status_Str & " " & Message & CRLF; begin return Result; end First_Header_Line; end Response_Helpers;

33.84

76

0.648148

2f10fd29d59f662f1924f5e6ed6c2927286f80a6

8,752

adb

Ada

src/base/log/util-log-appenders.adb

yrashk/ada-util

2aaa1d87e92a7137e1c63dce90f0722c549dfafd

[ "Apache-2.0" ]

60

2015-01-18T23:05:34.000Z

2022-03-20T18:56:30.000Z

src/base/log/util-log-appenders.adb

yrashk/ada-util

2aaa1d87e92a7137e1c63dce90f0722c549dfafd

[ "Apache-2.0" ]

20

2016-09-15T16:41:30.000Z

2022-03-29T22:02:32.000Z

src/base/log/util-log-appenders.adb

yrashk/ada-util

2aaa1d87e92a7137e1c63dce90f0722c549dfafd

[ "Apache-2.0" ]

10

2015-02-13T04:00:45.000Z

2022-03-20T18:57:54.000Z

----------------------------------------------------------------------- -- util-log-appenders -- Log appenders -- Copyright (C) 2001 - 2021 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.Calendar.Formatting; with Ada.Strings; with Ada.Strings.Fixed; with Ada.Unchecked_Deallocation; with Util.Strings.Transforms; package body Util.Log.Appenders is use Ada; use Ada.Finalization; Appender_Factories : Appender_Factory_Access; -- ------------------------------ -- Get the log level that triggers display of the log events -- ------------------------------ function Get_Level (Self : in Appender) return Level_Type is begin return Self.Level; end Get_Level; -- ------------------------------ -- Set the log level. -- ------------------------------ procedure Set_Level (Self : in out Appender; Name : in String; Properties : in Util.Properties.Manager; Level : in Level_Type) is Prop_Name : constant String := "appender." & Name & ".level"; begin if Properties.Exists (Prop_Name) then Self.Level := Get_Level (Properties.Get (Prop_Name), Level); else Self.Level := Level; end if; end Set_Level; procedure Set_Level (Self : in out Appender; Level : in Level_Type) is begin Self.Level := Level; end Set_Level; -- ------------------------------ -- Set the log layout format. -- ------------------------------ procedure Set_Layout (Self : in out Appender; Name : in String; Properties : in Util.Properties.Manager; Layout : in Layout_Type) is use Ada.Strings; use Util.Strings.Transforms; Prop_Name : constant String := "appender." & Name & ".layout"; begin if Properties.Exists (Prop_Name) then declare Value : constant String := To_Lower_Case (Fixed.Trim (Properties.Get (Prop_Name), Both)); begin if Value = "message" then Self.Layout := MESSAGE; elsif Value = "level-message" then Self.Layout := LEVEL_MESSAGE; elsif Value = "date-level-message" or Value = "level-date-message" then Self.Layout := DATE_LEVEL_MESSAGE; else Self.Layout := FULL; end if; end; else Self.Layout := Layout; end if; end Set_Layout; procedure Set_Layout (Self : in out Appender; Layout : in Layout_Type) is begin Self.Layout := Layout; end Set_Layout; -- ------------------------------ -- Format the event into a string -- ------------------------------ function Format (Self : in Appender'Class; Date : in Ada.Calendar.Time; Level : in Level_Type; Logger : in String) return String is begin case Self.Layout is when MESSAGE => return ""; when LEVEL_MESSAGE => return Get_Level_Name (Level) & ": "; when DATE_LEVEL_MESSAGE => return "[" & Calendar.Formatting.Image (Date) & "] " & Get_Level_Name (Level) & ": "; when FULL => return "[" & Calendar.Formatting.Image (Date) & "] " & Get_Level_Name (Level) & " - " & Logger & " - : "; end case; end Format; overriding procedure Append (Self : in out List_Appender; Message : in Util.Strings.Builders.Builder; Date : in Ada.Calendar.Time; Level : in Level_Type; Logger : in String) is begin for I in 1 .. Self.Count loop Self.Appenders (I).Append (Message, Date, Level, Logger); end loop; end Append; -- ------------------------------ -- Flush the log events. -- ------------------------------ overriding procedure Flush (Self : in out List_Appender) is begin for I in 1 .. Self.Count loop Self.Appenders (I).Flush; end loop; end Flush; -- ------------------------------ -- Add the appender to the list. -- ------------------------------ procedure Add_Appender (Self : in out List_Appender; Object : in Appender_Access) is begin if Self.Count < Self.Appenders'Last then Self.Count := Self.Count + 1; Self.Appenders (Self.Count) := Object; end if; end Add_Appender; -- ------------------------------ -- Create a list appender and configure it according to the properties -- ------------------------------ function Create_List_Appender (Name : in String) return List_Appender_Access is Result : constant List_Appender_Access := new List_Appender '(Limited_Controlled with Length => Name'Length, Name => Name, others => <>); begin return Result; end Create_List_Appender; -- ------------------------------ -- Find an appender with a given name from the list of appenders. -- Returns null if there is no such appender. -- ------------------------------ function Find_Appender (List : in Appender_List; Name : in String) return Appender_Access is Appender : Appender_Access := List.First; begin while Appender /= null loop if Appender.Name = Name then return Appender; end if; Appender := Appender.Next; end loop; return null; end Find_Appender; -- ------------------------------ -- Add the appender to the list of appenders. -- ------------------------------ procedure Add_Appender (List : in out Appender_List; Appender : in Appender_Access) is begin Appender.Next := List.First; List.First := Appender; end Add_Appender; -- ------------------------------ -- Clear the list of appenders. -- ------------------------------ procedure Clear (List : in out Appender_List) is procedure Free is new Ada.Unchecked_Deallocation (Object => Appender'Class, Name => Appender_Access); Appender : Appender_Access; begin loop Appender := List.First; exit when Appender = null; List.First := Appender.Next; Free (Appender); end loop; end Clear; -- ------------------------------ -- Register the factory handler to create an appender instance. -- ------------------------------ procedure Register (Into : in Appender_Factory_Access; Name : in String; Create : in Factory_Access) is begin Into.Name := Name; Into.Factory := Create; Into.Next_Factory := Appender_Factories; Appender_Factories := Into; end Register; -- ------------------------------ -- Create an appender instance with a factory with the given name. -- ------------------------------ function Create (Name : in String; Config : in Util.Properties.Manager; Default : in Level_Type) return Appender_Access is Prop_Name : constant String := "appender." & Name; Appender_Type : constant String := Config.Get (Prop_Name, "console"); Factory : Appender_Factory_Access := Appender_Factories; begin while Factory /= null loop if Factory.Name = Appender_Type then return Factory.Factory (Name, Config, Default); end if; Factory := Factory.Next_Factory; end loop; Factory := Appender_Factories; if Factory /= null then return Factory.Factory (Name, Config, Default); end if; return null; end Create; end Util.Log.Appenders;

34.592885

83

0.515539

0b38ad22974efc335da9ab861cb5634f7beaedca

160,514

adb

Ada

HLS/lab2/yuv_filter.prj/solution2/.autopilot/db/yuv_scale.bind.adb

lfVelez/ISPR

840f41c2053a48642a7b287feecfea79c6f389b3

[ "MIT" ]

1

2021-03-03T16:53:52.000Z

HLS/lab2/yuv_filter.prj/solution2/.autopilot/db/yuv_scale.bind.adb

lfVelez/ISPR

840f41c2053a48642a7b287feecfea79c6f389b3

[ "MIT" ]

null

HLS/lab2/yuv_filter.prj/solution2/.autopilot/db/yuv_scale.bind.adb

lfVelez/ISPR

840f41c2053a48642a7b287feecfea79c6f389b3

[ "MIT" ]

null

<?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="14"> <syndb class_id="0" tracking_level="0" version="0"> <userIPLatency>-1</userIPLatency> <userIPName></userIPName> <cdfg class_id="1" tracking_level="1" version="0" object_id="_0"> <name>yuv_scale</name> <ret_bitwidth>32</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>11</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_channels_ch1</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.channels.ch1</originalName> <rtlName></rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>8</bitwidth> </Value> <direction>0</direction> <if_type>1</if_type> <array_size>2457600</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>in_channels_ch2</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>in.channels.ch2</originalName> <rtlName></rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>8</bitwidth> </Value> <direction>0</direction> <if_type>1</if_type> <array_size>2457600</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>in_channels_ch3</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>in.channels.ch3</originalName> <rtlName></rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>8</bitwidth> </Value> <direction>0</direction> <if_type>1</if_type> <array_size>2457600</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>in_width_read</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>in.width</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</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>in_height_read</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>in.height</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</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>out_channels_ch1</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>out.channels.ch1</originalName> <rtlName></rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>8</bitwidth> </Value> <direction>1</direction> <if_type>1</if_type> <array_size>2457600</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>out_channels_ch2</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>out.channels.ch2</originalName> <rtlName></rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>8</bitwidth> </Value> <direction>1</direction> <if_type>1</if_type> <array_size>2457600</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>out_channels_ch3</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>out.channels.ch3</originalName> <rtlName></rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>8</bitwidth> </Value> <direction>1</direction> <if_type>1</if_type> <array_size>2457600</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>Y_scale</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>Y_scale</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>U_scale</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>U_scale</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>V_scale</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>V_scale</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>56</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_12"> <Value> <Obj> <type>0</type> <id>12</id> <name>V_scale_read</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>V_scale</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>79</item> <item>80</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_13"> <Value> <Obj> <type>0</type> <id>13</id> <name>U_scale_read</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>U_scale</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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> </item> <item class_id_reference="9" object_id="_14"> <Value> <Obj> <type>0</type> <id>14</id> <name>Y_scale_read</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>Y_scale</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>83</item> <item>84</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_15"> <Value> <Obj> <type>0</type> <id>15</id> <name>in_height_read_1</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>in.height</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>86</item> <item>87</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_16"> <Value> <Obj> <type>0</type> <id>16</id> <name>in_width_read_1</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>in.width</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>88</item> <item>89</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_17"> <Value> <Obj> <type>0</type> <id>17</id> <name>tmp_cast</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>138</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="11" tracking_level="0" version="0"> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second class_id="12" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="13" tracking_level="0" version="0"> <first class_id="14" tracking_level="0" version="0"> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>138</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>15</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> </item> <item class_id_reference="9" object_id="_18"> <Value> <Obj> <type>0</type> <id>18</id> <name>tmp_1_cast</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>139</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>139</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>91</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_19"> <Value> <Obj> <type>0</type> <id>19</id> <name>tmp_2_cast</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>129</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>129</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>92</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_20"> <Value> <Obj> <type>0</type> <id>20</id> <name>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>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>93</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_21"> <Value> <Obj> <type>0</type> <id>21</id> <name>cast1</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>1</count> <item_version>0</item_version> <item>94</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_22"> <Value> <Obj> <type>0</type> <id>22</id> <name>bound</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>95</item> <item>96</item> </oprand_edges> <opcode>mul</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_23"> <Value> <Obj> <type>0</type> <id>23</id> <name></name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>129</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>129</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>97</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_24"> <Value> <Obj> <type>0</type> <id>25</id> <name>indvar_flatten</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>99</item> <item>100</item> <item>101</item> <item>102</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_25"> <Value> <Obj> <type>0</type> <id>26</id> <name>x</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>134</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>134</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>104</item> <item>105</item> <item>106</item> <item>107</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_26"> <Value> <Obj> <type>0</type> <id>27</id> <name>y</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>y</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>108</item> <item>109</item> <item>110</item> <item>111</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_27"> <Value> <Obj> <type>0</type> <id>28</id> <name>exitcond_flatten</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>112</item> <item>113</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_28"> <Value> <Obj> <type>0</type> <id>29</id> <name>indvar_flatten_next</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>114</item> <item>116</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_29"> <Value> <Obj> <type>0</type> <id>30</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>117</item> <item>118</item> <item>119</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_30"> <Value> <Obj> <type>0</type> <id>32</id> <name>x_1</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>129</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>129</second> </item> </second> </item> </inlineStackInfo> <originalName>x</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>121</item> <item>122</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_31"> <Value> <Obj> <type>0</type> <id>35</id> <name>exitcond3</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>132</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>132</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>123</item> <item>124</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_32"> <Value> <Obj> <type>0</type> <id>36</id> <name>y_mid2</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>132</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>132</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>125</item> <item>126</item> <item>127</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_33"> <Value> <Obj> <type>0</type> <id>37</id> <name>tmp_3_mid2_v</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>134</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>134</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>128</item> <item>129</item> <item>130</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_34"> <Value> <Obj> <type>0</type> <id>38</id> <name>tmp</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>134</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>134</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>131</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_35"> <Value> <Obj> <type>0</type> <id>39</id> <name>p_shl_cast</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>134</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>134</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>23</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>133</item> <item>134</item> <item>136</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_36"> <Value> <Obj> <type>0</type> <id>40</id> <name>tmp_1</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>134</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>134</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>137</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_37"> <Value> <Obj> <type>0</type> <id>41</id> <name>p_shl1_cast</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>134</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>134</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>23</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>139</item> <item>140</item> <item>142</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_38"> <Value> <Obj> <type>0</type> <id>42</id> <name>tmp_3</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>134</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>134</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>23</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>143</item> <item>144</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_39"> <Value> <Obj> <type>0</type> <id>46</id> <name>tmp_5_cast</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>134</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>134</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>23</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>145</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_40"> <Value> <Obj> <type>0</type> <id>47</id> <name>tmp_5</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>134</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>134</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>23</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>146</item> <item>147</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_41"> <Value> <Obj> <type>0</type> <id>48</id> <name>tmp_10_cast</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>134</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>134</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>148</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_42"> <Value> <Obj> <type>0</type> <id>49</id> <name>in_channels_ch1_addr</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>134</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>134</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>22</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>149</item> <item>151</item> <item>152</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_43"> <Value> <Obj> <type>0</type> <id>50</id> <name>in_channels_ch2_addr</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>135</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>135</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>22</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>153</item> <item>154</item> <item>155</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_44"> <Value> <Obj> <type>0</type> <id>51</id> <name>in_channels_ch3_addr</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>136</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>136</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>22</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>156</item> <item>157</item> <item>158</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_45"> <Value> <Obj> <type>0</type> <id>52</id> <name>out_channels_ch1_add</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>140</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>140</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>22</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>159</item> <item>160</item> <item>161</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_46"> <Value> <Obj> <type>0</type> <id>53</id> <name>out_channels_ch2_add</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>141</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>141</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>22</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>162</item> <item>163</item> <item>164</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_47"> <Value> <Obj> <type>0</type> <id>54</id> <name>out_channels_ch3_add</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>142</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>142</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>22</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>165</item> <item>166</item> <item>167</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_48"> <Value> <Obj> <type>0</type> <id>55</id> <name>Y</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>134</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>134</second> </item> </second> </item> </inlineStackInfo> <originalName>Y</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>168</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_49"> <Value> <Obj> <type>0</type> <id>56</id> <name>U</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>135</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>135</second> </item> </second> </item> </inlineStackInfo> <originalName>U</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>169</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_50"> <Value> <Obj> <type>0</type> <id>57</id> <name>V</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>136</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>136</second> </item> </second> </item> </inlineStackInfo> <originalName>V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>170</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_51"> <Value> <Obj> <type>0</type> <id>58</id> <name>tmp_6_cast</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>137</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>137</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>171</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_52"> <Value> <Obj> <type>0</type> <id>59</id> <name>tmp_7</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>137</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>137</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>172</item> <item>173</item> </oprand_edges> <opcode>mul</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_53"> <Value> <Obj> <type>0</type> <id>60</id> <name>tmp_9_cast</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>138</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>138</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>174</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_54"> <Value> <Obj> <type>0</type> <id>61</id> <name>tmp_s</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>138</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>138</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>175</item> <item>176</item> </oprand_edges> <opcode>mul</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_55"> <Value> <Obj> <type>0</type> <id>62</id> <name>tmp_4_cast</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>139</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>139</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>177</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_56"> <Value> <Obj> <type>0</type> <id>63</id> <name>tmp_8</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>139</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>139</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>178</item> <item>179</item> </oprand_edges> <opcode>mul</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_57"> <Value> <Obj> <type>0</type> <id>64</id> <name>tmp_4</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>140</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>140</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>181</item> <item>182</item> <item>184</item> <item>186</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_58"> <Value> <Obj> <type>0</type> <id>65</id> <name></name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>140</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>140</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>187</item> <item>188</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_59"> <Value> <Obj> <type>0</type> <id>66</id> <name>tmp_6</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>141</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>141</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>189</item> <item>190</item> <item>191</item> <item>192</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_60"> <Value> <Obj> <type>0</type> <id>67</id> <name></name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>141</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>141</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>193</item> <item>194</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_61"> <Value> <Obj> <type>0</type> <id>68</id> <name>tmp_9</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>142</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>142</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>195</item> <item>196</item> <item>197</item> <item>198</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_62"> <Value> <Obj> <type>0</type> <id>69</id> <name></name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>142</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>142</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>199</item> <item>200</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_63"> <Value> <Obj> <type>0</type> <id>71</id> <name>y_1</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>132</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>132</second> </item> </second> </item> </inlineStackInfo> <originalName>y</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>201</item> <item>202</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_64"> <Value> <Obj> <type>0</type> <id>72</id> <name></name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>132</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>132</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>203</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_65"> <Value> <Obj> <type>0</type> <id>74</id> <name>mrv</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>145</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>145</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>205</item> <item>206</item> </oprand_edges> <opcode>insertvalue</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_66"> <Value> <Obj> <type>0</type> <id>75</id> <name>mrv_1</name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>145</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>145</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>207</item> <item>208</item> </oprand_edges> <opcode>insertvalue</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_67"> <Value> <Obj> <type>0</type> <id>76</id> <name></name> <fileName>yuv_filter.c</fileName> <fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory> <lineNumber>145</lineNumber> <contextFuncName>yuv_scale</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>yuv_scale</second> </first> <second>145</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>209</item> </oprand_edges> <opcode>ret</opcode> <m_Display>0</m_Display> </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="_68"> <Value> <Obj> <type>2</type> <id>98</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_69"> <Value> <Obj> <type>2</type> <id>103</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>16</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_70"> <Value> <Obj> <type>2</type> <id>115</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_71"> <Value> <Obj> <type>2</type> <id>120</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_72"> <Value> <Obj> <type>2</type> <id>135</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>10</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_73"> <Value> <Obj> <type>2</type> <id>141</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_74"> <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>64</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_75"> <Value> <Obj> <type>2</type> <id>183</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="_76"> <Value> <Obj> <type>2</type> <id>185</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>14</content> </item> <item class_id_reference="16" object_id="_77"> <Value> <Obj> <type>2</type> <id>204</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>4</const_type> <content><Undef not integral></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="_78"> <Obj> <type>3</type> <id>24</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>12</count> <item_version>0</item_version> <item>12</item> <item>13</item> <item>14</item> <item>15</item> <item>16</item> <item>17</item> <item>18</item> <item>19</item> <item>20</item> <item>21</item> <item>22</item> <item>23</item> </node_objs> </item> <item class_id_reference="18" object_id="_79"> <Obj> <type>3</type> <id>31</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>6</count> <item_version>0</item_version> <item>25</item> <item>26</item> <item>27</item> <item>28</item> <item>29</item> <item>30</item> </node_objs> </item> <item class_id_reference="18" object_id="_80"> <Obj> <type>3</type> <id>73</id> <name>.reset</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>35</count> <item_version>0</item_version> <item>32</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>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>71</item> <item>72</item> </node_objs> </item> <item class_id_reference="18" object_id="_81"> <Obj> <type>3</type> <id>77</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>74</item> <item>75</item> <item>76</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>111</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_82"> <id>80</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>12</sink_obj> </item> <item class_id_reference="20" object_id="_83"> <id>82</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>13</sink_obj> </item> <item class_id_reference="20" object_id="_84"> <id>84</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>14</sink_obj> </item> <item class_id_reference="20" object_id="_85"> <id>87</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>15</sink_obj> </item> <item class_id_reference="20" object_id="_86"> <id>89</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>16</sink_obj> </item> <item class_id_reference="20" object_id="_87"> <id>90</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>17</sink_obj> </item> <item class_id_reference="20" object_id="_88"> <id>91</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>18</sink_obj> </item> <item class_id_reference="20" object_id="_89"> <id>92</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>19</sink_obj> </item> <item class_id_reference="20" object_id="_90"> <id>93</id> <edge_type>1</edge_type> <source_obj>16</source_obj> <sink_obj>20</sink_obj> </item> <item class_id_reference="20" object_id="_91"> <id>94</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>21</sink_obj> </item> <item class_id_reference="20" object_id="_92"> <id>95</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>22</sink_obj> </item> <item class_id_reference="20" object_id="_93"> <id>96</id> <edge_type>1</edge_type> <source_obj>20</source_obj> <sink_obj>22</sink_obj> </item> <item class_id_reference="20" object_id="_94"> <id>97</id> <edge_type>2</edge_type> <source_obj>31</source_obj> <sink_obj>23</sink_obj> </item> <item class_id_reference="20" object_id="_95"> <id>99</id> <edge_type>1</edge_type> <source_obj>98</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_96"> <id>100</id> <edge_type>2</edge_type> <source_obj>24</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_97"> <id>101</id> <edge_type>1</edge_type> <source_obj>29</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_98"> <id>102</id> <edge_type>2</edge_type> <source_obj>73</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_99"> <id>104</id> <edge_type>1</edge_type> <source_obj>103</source_obj> <sink_obj>26</sink_obj> </item> <item class_id_reference="20" object_id="_100"> <id>105</id> <edge_type>2</edge_type> <source_obj>24</source_obj> <sink_obj>26</sink_obj> </item> <item class_id_reference="20" object_id="_101"> <id>106</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>26</sink_obj> </item> <item class_id_reference="20" object_id="_102"> <id>107</id> <edge_type>2</edge_type> <source_obj>73</source_obj> <sink_obj>26</sink_obj> </item> <item class_id_reference="20" object_id="_103"> <id>108</id> <edge_type>1</edge_type> <source_obj>103</source_obj> <sink_obj>27</sink_obj> </item> <item class_id_reference="20" object_id="_104"> <id>109</id> <edge_type>2</edge_type> <source_obj>24</source_obj> <sink_obj>27</sink_obj> </item> <item class_id_reference="20" object_id="_105"> <id>110</id> <edge_type>1</edge_type> <source_obj>71</source_obj> <sink_obj>27</sink_obj> </item> <item class_id_reference="20" object_id="_106"> <id>111</id> <edge_type>2</edge_type> <source_obj>73</source_obj> <sink_obj>27</sink_obj> </item> <item class_id_reference="20" object_id="_107"> <id>112</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>28</sink_obj> </item> <item class_id_reference="20" object_id="_108"> <id>113</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>28</sink_obj> </item> <item class_id_reference="20" object_id="_109"> <id>114</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>29</sink_obj> </item> <item class_id_reference="20" object_id="_110"> <id>116</id> <edge_type>1</edge_type> <source_obj>115</source_obj> <sink_obj>29</sink_obj> </item> <item class_id_reference="20" object_id="_111"> <id>117</id> <edge_type>1</edge_type> <source_obj>28</source_obj> <sink_obj>30</sink_obj> </item> <item class_id_reference="20" object_id="_112"> <id>118</id> <edge_type>2</edge_type> <source_obj>73</source_obj> <sink_obj>30</sink_obj> </item> <item class_id_reference="20" object_id="_113"> <id>119</id> <edge_type>2</edge_type> <source_obj>77</source_obj> <sink_obj>30</sink_obj> </item> <item class_id_reference="20" object_id="_114"> <id>121</id> <edge_type>1</edge_type> <source_obj>120</source_obj> <sink_obj>32</sink_obj> </item> <item class_id_reference="20" object_id="_115"> <id>122</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>32</sink_obj> </item> <item class_id_reference="20" object_id="_116"> <id>123</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>35</sink_obj> </item> <item class_id_reference="20" object_id="_117"> <id>124</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>35</sink_obj> </item> <item class_id_reference="20" object_id="_118"> <id>125</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>36</sink_obj> </item> <item class_id_reference="20" object_id="_119"> <id>126</id> <edge_type>1</edge_type> <source_obj>103</source_obj> <sink_obj>36</sink_obj> </item> <item class_id_reference="20" object_id="_120"> <id>127</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>36</sink_obj> </item> <item class_id_reference="20" object_id="_121"> <id>128</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>37</sink_obj> </item> <item class_id_reference="20" object_id="_122"> <id>129</id> <edge_type>1</edge_type> <source_obj>32</source_obj> <sink_obj>37</sink_obj> </item> <item class_id_reference="20" object_id="_123"> <id>130</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>37</sink_obj> </item> <item class_id_reference="20" object_id="_124"> <id>131</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>38</sink_obj> </item> <item class_id_reference="20" object_id="_125"> <id>134</id> <edge_type>1</edge_type> <source_obj>38</source_obj> <sink_obj>39</sink_obj> </item> <item class_id_reference="20" object_id="_126"> <id>136</id> <edge_type>1</edge_type> <source_obj>135</source_obj> <sink_obj>39</sink_obj> </item> <item class_id_reference="20" object_id="_127"> <id>137</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>40</sink_obj> </item> <item class_id_reference="20" object_id="_128"> <id>140</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>41</sink_obj> </item> <item class_id_reference="20" object_id="_129"> <id>142</id> <edge_type>1</edge_type> <source_obj>141</source_obj> <sink_obj>41</sink_obj> </item> <item class_id_reference="20" object_id="_130"> <id>143</id> <edge_type>1</edge_type> <source_obj>39</source_obj> <sink_obj>42</sink_obj> </item> <item class_id_reference="20" object_id="_131"> <id>144</id> <edge_type>1</edge_type> <source_obj>41</source_obj> <sink_obj>42</sink_obj> </item> <item class_id_reference="20" object_id="_132"> <id>145</id> <edge_type>1</edge_type> <source_obj>36</source_obj> <sink_obj>46</sink_obj> </item> <item class_id_reference="20" object_id="_133"> <id>146</id> <edge_type>1</edge_type> <source_obj>46</source_obj> <sink_obj>47</sink_obj> </item> <item class_id_reference="20" object_id="_134"> <id>147</id> <edge_type>1</edge_type> <source_obj>42</source_obj> <sink_obj>47</sink_obj> </item> <item class_id_reference="20" object_id="_135"> <id>148</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>48</sink_obj> </item> <item class_id_reference="20" object_id="_136"> <id>149</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>49</sink_obj> </item> <item class_id_reference="20" object_id="_137"> <id>151</id> <edge_type>1</edge_type> <source_obj>150</source_obj> <sink_obj>49</sink_obj> </item> <item class_id_reference="20" object_id="_138"> <id>152</id> <edge_type>1</edge_type> <source_obj>48</source_obj> <sink_obj>49</sink_obj> </item> <item class_id_reference="20" object_id="_139"> <id>153</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>50</sink_obj> </item> <item class_id_reference="20" object_id="_140"> <id>154</id> <edge_type>1</edge_type> <source_obj>150</source_obj> <sink_obj>50</sink_obj> </item> <item class_id_reference="20" object_id="_141"> <id>155</id> <edge_type>1</edge_type> <source_obj>48</source_obj> <sink_obj>50</sink_obj> </item> <item class_id_reference="20" object_id="_142"> <id>156</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>51</sink_obj> </item> <item class_id_reference="20" object_id="_143"> <id>157</id> <edge_type>1</edge_type> <source_obj>150</source_obj> <sink_obj>51</sink_obj> </item> <item class_id_reference="20" object_id="_144"> <id>158</id> <edge_type>1</edge_type> <source_obj>48</source_obj> <sink_obj>51</sink_obj> </item> <item class_id_reference="20" object_id="_145"> <id>159</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>52</sink_obj> </item> <item class_id_reference="20" object_id="_146"> <id>160</id> <edge_type>1</edge_type> <source_obj>150</source_obj> <sink_obj>52</sink_obj> </item> <item class_id_reference="20" object_id="_147"> <id>161</id> <edge_type>1</edge_type> <source_obj>48</source_obj> <sink_obj>52</sink_obj> </item> <item class_id_reference="20" object_id="_148"> <id>162</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>53</sink_obj> </item> <item class_id_reference="20" object_id="_149"> <id>163</id> <edge_type>1</edge_type> <source_obj>150</source_obj> <sink_obj>53</sink_obj> </item> <item class_id_reference="20" object_id="_150"> <id>164</id> <edge_type>1</edge_type> <source_obj>48</source_obj> <sink_obj>53</sink_obj> </item> <item class_id_reference="20" object_id="_151"> <id>165</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>54</sink_obj> </item> <item class_id_reference="20" object_id="_152"> <id>166</id> <edge_type>1</edge_type> <source_obj>150</source_obj> <sink_obj>54</sink_obj> </item> <item class_id_reference="20" object_id="_153"> <id>167</id> <edge_type>1</edge_type> <source_obj>48</source_obj> <sink_obj>54</sink_obj> </item> <item class_id_reference="20" object_id="_154"> <id>168</id> <edge_type>1</edge_type> <source_obj>49</source_obj> <sink_obj>55</sink_obj> </item> <item class_id_reference="20" object_id="_155"> <id>169</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>56</sink_obj> </item> <item class_id_reference="20" object_id="_156"> <id>170</id> <edge_type>1</edge_type> <source_obj>51</source_obj> <sink_obj>57</sink_obj> </item> <item class_id_reference="20" object_id="_157"> <id>171</id> <edge_type>1</edge_type> <source_obj>55</source_obj> <sink_obj>58</sink_obj> </item> <item class_id_reference="20" object_id="_158"> <id>172</id> <edge_type>1</edge_type> <source_obj>58</source_obj> <sink_obj>59</sink_obj> </item> <item class_id_reference="20" object_id="_159"> <id>173</id> <edge_type>1</edge_type> <source_obj>17</source_obj> <sink_obj>59</sink_obj> </item> <item class_id_reference="20" object_id="_160"> <id>174</id> <edge_type>1</edge_type> <source_obj>56</source_obj> <sink_obj>60</sink_obj> </item> <item class_id_reference="20" object_id="_161"> <id>175</id> <edge_type>1</edge_type> <source_obj>60</source_obj> <sink_obj>61</sink_obj> </item> <item class_id_reference="20" object_id="_162"> <id>176</id> <edge_type>1</edge_type> <source_obj>18</source_obj> <sink_obj>61</sink_obj> </item> <item class_id_reference="20" object_id="_163"> <id>177</id> <edge_type>1</edge_type> <source_obj>57</source_obj> <sink_obj>62</sink_obj> </item> <item class_id_reference="20" object_id="_164"> <id>178</id> <edge_type>1</edge_type> <source_obj>62</source_obj> <sink_obj>63</sink_obj> </item> <item class_id_reference="20" object_id="_165"> <id>179</id> <edge_type>1</edge_type> <source_obj>19</source_obj> <sink_obj>63</sink_obj> </item> <item class_id_reference="20" object_id="_166"> <id>182</id> <edge_type>1</edge_type> <source_obj>59</source_obj> <sink_obj>64</sink_obj> </item> <item class_id_reference="20" object_id="_167"> <id>184</id> <edge_type>1</edge_type> <source_obj>183</source_obj> <sink_obj>64</sink_obj> </item> <item class_id_reference="20" object_id="_168"> <id>186</id> <edge_type>1</edge_type> <source_obj>185</source_obj> <sink_obj>64</sink_obj> </item> <item class_id_reference="20" object_id="_169"> <id>187</id> <edge_type>1</edge_type> <source_obj>64</source_obj> <sink_obj>65</sink_obj> </item> <item class_id_reference="20" object_id="_170"> <id>188</id> <edge_type>1</edge_type> <source_obj>52</source_obj> <sink_obj>65</sink_obj> </item> <item class_id_reference="20" object_id="_171"> <id>190</id> <edge_type>1</edge_type> <source_obj>61</source_obj> <sink_obj>66</sink_obj> </item> <item class_id_reference="20" object_id="_172"> <id>191</id> <edge_type>1</edge_type> <source_obj>183</source_obj> <sink_obj>66</sink_obj> </item> <item class_id_reference="20" object_id="_173"> <id>192</id> <edge_type>1</edge_type> <source_obj>185</source_obj> <sink_obj>66</sink_obj> </item> <item class_id_reference="20" object_id="_174"> <id>193</id> <edge_type>1</edge_type> <source_obj>66</source_obj> <sink_obj>67</sink_obj> </item> <item class_id_reference="20" object_id="_175"> <id>194</id> <edge_type>1</edge_type> <source_obj>53</source_obj> <sink_obj>67</sink_obj> </item> <item class_id_reference="20" object_id="_176"> <id>196</id> <edge_type>1</edge_type> <source_obj>63</source_obj> <sink_obj>68</sink_obj> </item> <item class_id_reference="20" object_id="_177"> <id>197</id> <edge_type>1</edge_type> <source_obj>183</source_obj> <sink_obj>68</sink_obj> </item> <item class_id_reference="20" object_id="_178"> <id>198</id> <edge_type>1</edge_type> <source_obj>185</source_obj> <sink_obj>68</sink_obj> </item> <item class_id_reference="20" object_id="_179"> <id>199</id> <edge_type>1</edge_type> <source_obj>68</source_obj> <sink_obj>69</sink_obj> </item> <item class_id_reference="20" object_id="_180"> <id>200</id> <edge_type>1</edge_type> <source_obj>54</source_obj> <sink_obj>69</sink_obj> </item> <item class_id_reference="20" object_id="_181"> <id>201</id> <edge_type>1</edge_type> <source_obj>120</source_obj> <sink_obj>71</sink_obj> </item> <item class_id_reference="20" object_id="_182"> <id>202</id> <edge_type>1</edge_type> <source_obj>36</source_obj> <sink_obj>71</sink_obj> </item> <item class_id_reference="20" object_id="_183"> <id>203</id> <edge_type>2</edge_type> <source_obj>31</source_obj> <sink_obj>72</sink_obj> </item> <item class_id_reference="20" object_id="_184"> <id>205</id> <edge_type>1</edge_type> <source_obj>204</source_obj> <sink_obj>74</sink_obj> </item> <item class_id_reference="20" object_id="_185"> <id>206</id> <edge_type>1</edge_type> <source_obj>16</source_obj> <sink_obj>74</sink_obj> </item> <item class_id_reference="20" object_id="_186"> <id>207</id> <edge_type>1</edge_type> <source_obj>74</source_obj> <sink_obj>75</sink_obj> </item> <item class_id_reference="20" object_id="_187"> <id>208</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>75</sink_obj> </item> <item class_id_reference="20" object_id="_188"> <id>209</id> <edge_type>1</edge_type> <source_obj>75</source_obj> <sink_obj>76</sink_obj> </item> <item class_id_reference="20" object_id="_189"> <id>241</id> <edge_type>2</edge_type> <source_obj>24</source_obj> <sink_obj>31</sink_obj> </item> <item class_id_reference="20" object_id="_190"> <id>242</id> <edge_type>2</edge_type> <source_obj>31</source_obj> <sink_obj>77</sink_obj> </item> <item class_id_reference="20" object_id="_191"> <id>243</id> <edge_type>2</edge_type> <source_obj>31</source_obj> <sink_obj>73</sink_obj> </item> <item class_id_reference="20" object_id="_192"> <id>244</id> <edge_type>2</edge_type> <source_obj>73</source_obj> <sink_obj>31</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="_193"> <mId>1</mId> <mTag>yuv_scale</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>2457611</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_194"> <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>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_195"> <mId>3</mId> <mTag>YUV_SCALE_LOOP_X_YUV_SCALE_LOOP_Y</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>31</item> <item>73</item> </basic_blocks> <mII>1</mII> <mDepth>11</mDepth> <mMinTripCount>40000</mMinTripCount> <mMaxTripCount>2457600</mMaxTripCount> <mMinLatency>2457609</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_196"> <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>77</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> </cdfg_regions> <fsm class_id="24" tracking_level="1" version="0" object_id="_197"> <states class_id="25" tracking_level="0" version="0"> <count>13</count> <item_version>0</item_version> <item class_id="26" tracking_level="1" version="0" object_id="_198"> <id>1</id> <operations class_id="27" tracking_level="0" version="0"> <count>12</count> <item_version>0</item_version> <item class_id="28" tracking_level="1" version="0" object_id="_199"> <id>12</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_200"> <id>13</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_201"> <id>14</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_202"> <id>15</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_203"> <id>16</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_204"> <id>17</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_205"> <id>18</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_206"> <id>19</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_207"> <id>20</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_208"> <id>21</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_209"> <id>22</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_210"> <id>23</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_211"> <id>2</id> <operations> <count>12</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_212"> <id>25</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_213"> <id>26</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_214"> <id>27</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_215"> <id>28</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_216"> <id>29</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_217"> <id>30</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_218"> <id>32</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_219"> <id>35</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_220"> <id>36</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_221"> <id>37</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_222"> <id>38</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_223"> <id>40</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_224"> <id>3</id> <operations> <count>6</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_225"> <id>39</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_226"> <id>41</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_227"> <id>42</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_228"> <id>46</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_229"> <id>47</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_230"> <id>71</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_231"> <id>4</id> <operations> <count>7</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_232"> <id>48</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_233"> <id>49</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_234"> <id>50</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_235"> <id>51</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_236"> <id>55</id> <stage>4</stage> <latency>4</latency> </item> <item class_id_reference="28" object_id="_237"> <id>56</id> <stage>4</stage> <latency>4</latency> </item> <item class_id_reference="28" object_id="_238"> <id>57</id> <stage>4</stage> <latency>4</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_239"> <id>5</id> <operations> <count>3</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_240"> <id>55</id> <stage>3</stage> <latency>4</latency> </item> <item class_id_reference="28" object_id="_241"> <id>56</id> <stage>3</stage> <latency>4</latency> </item> <item class_id_reference="28" object_id="_242"> <id>57</id> <stage>3</stage> <latency>4</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_243"> <id>6</id> <operations> <count>3</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_244"> <id>55</id> <stage>2</stage> <latency>4</latency> </item> <item class_id_reference="28" object_id="_245"> <id>56</id> <stage>2</stage> <latency>4</latency> </item> <item class_id_reference="28" object_id="_246"> <id>57</id> <stage>2</stage> <latency>4</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_247"> <id>7</id> <operations> <count>3</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_248"> <id>55</id> <stage>1</stage> <latency>4</latency> </item> <item class_id_reference="28" object_id="_249"> <id>56</id> <stage>1</stage> <latency>4</latency> </item> <item class_id_reference="28" object_id="_250"> <id>57</id> <stage>1</stage> <latency>4</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_251"> <id>8</id> <operations> <count>6</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_252"> <id>58</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_253"> <id>59</id> <stage>3</stage> <latency>3</latency> </item> <item class_id_reference="28" object_id="_254"> <id>60</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_255"> <id>61</id> <stage>3</stage> <latency>3</latency> </item> <item class_id_reference="28" object_id="_256"> <id>62</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_257"> <id>63</id> <stage>3</stage> <latency>3</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_258"> <id>9</id> <operations> <count>3</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_259"> <id>59</id> <stage>2</stage> <latency>3</latency> </item> <item class_id_reference="28" object_id="_260"> <id>61</id> <stage>2</stage> <latency>3</latency> </item> <item class_id_reference="28" object_id="_261"> <id>63</id> <stage>2</stage> <latency>3</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_262"> <id>10</id> <operations> <count>6</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_263"> <id>59</id> <stage>1</stage> <latency>3</latency> </item> <item class_id_reference="28" object_id="_264"> <id>61</id> <stage>1</stage> <latency>3</latency> </item> <item class_id_reference="28" object_id="_265"> <id>63</id> <stage>1</stage> <latency>3</latency> </item> <item class_id_reference="28" object_id="_266"> <id>64</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_267"> <id>66</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_268"> <id>68</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_269"> <id>11</id> <operations> <count>6</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_270"> <id>52</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_271"> <id>53</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_272"> <id>54</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_273"> <id>65</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_274"> <id>67</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_275"> <id>69</id> <stage>2</stage> <latency>2</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_276"> <id>12</id> <operations> <count>10</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_277"> <id>33</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_278"> <id>34</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_279"> <id>43</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_280"> <id>44</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_281"> <id>45</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_282"> <id>65</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_283"> <id>67</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_284"> <id>69</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_285"> <id>70</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_286"> <id>72</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_287"> <id>13</id> <operations> <count>3</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_288"> <id>74</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_289"> <id>75</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_290"> <id>76</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> </states> <transitions class_id="29" tracking_level="0" version="0"> <count>13</count> <item_version>0</item_version> <item class_id="30" tracking_level="1" version="0" object_id="_291"> <inState>1</inState> <outState>2</outState> <condition class_id="31" tracking_level="0" version="0"> <id>23</id> <sop class_id="32" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="33" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_292"> <inState>3</inState> <outState>4</outState> <condition> <id>40</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_293"> <inState>4</inState> <outState>5</outState> <condition> <id>41</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_294"> <inState>5</inState> <outState>6</outState> <condition> <id>42</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_295"> <inState>6</inState> <outState>7</outState> <condition> <id>43</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_296"> <inState>7</inState> <outState>8</outState> <condition> <id>44</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_297"> <inState>8</inState> <outState>9</outState> <condition> <id>45</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_298"> <inState>9</inState> <outState>10</outState> <condition> <id>46</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_299"> <inState>10</inState> <outState>11</outState> <condition> <id>47</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_300"> <inState>11</inState> <outState>12</outState> <condition> <id>48</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="_301"> <inState>12</inState> <outState>2</outState> <condition> <id>49</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="_302"> <inState>2</inState> <outState>13</outState> <condition> <id>39</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>28</first> <second>0</second> </first> <second>0</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_303"> <inState>2</inState> <outState>3</outState> <condition> <id>50</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>28</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>56</count> <item_version>0</item_version> <item class_id="38" tracking_level="0" version="0"> <first>12</first> <second class_id="39" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>13</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>14</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>15</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>16</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>17</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>18</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>19</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>20</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>21</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>22</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>23</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>25</first> <second> <first>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>32</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>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>40</first> <second> <first>1</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>46</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>47</first> <second> <first>2</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>10</first> <second>0</second> </second> </item> <item> <first>53</first> <second> <first>10</first> <second>0</second> </second> </item> <item> <first>54</first> <second> <first>10</first> <second>0</second> </second> </item> <item> <first>55</first> <second> <first>3</first> <second>3</second> </second> </item> <item> <first>56</first> <second> <first>3</first> <second>3</second> </second> </item> <item> <first>57</first> <second> <first>3</first> <second>3</second> </second> </item> <item> <first>58</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>59</first> <second> <first>7</first> <second>2</second> </second> </item> <item> <first>60</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>61</first> <second> <first>7</first> <second>2</second> </second> </item> <item> <first>62</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>63</first> <second> <first>7</first> <second>2</second> </second> </item> <item> <first>64</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>65</first> <second> <first>10</first> <second>1</second> </second> </item> <item> <first>66</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>67</first> <second> <first>10</first> <second>1</second> </second> </item> <item> <first>68</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>69</first> <second> <first>10</first> <second>1</second> </second> </item> <item> <first>71</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>72</first> <second> <first>11</first> <second>0</second> </second> </item> <item> <first>74</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>75</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>76</first> <second> <first>2</first> <second>0</second> </second> </item> </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>24</first> <second class_id="42" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>31</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>73</first> <second> <first>1</first> <second>11</second> </second> </item> <item> <first>77</first> <second> <first>2</first> <second>2</second> </second> </item> </bblk_ent_exit> <regions class_id="43" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="44" tracking_level="1" version="0" object_id="_304"> <region_name>YUV_SCALE_LOOP_X_YUV_SCALE_LOOP_Y</region_name> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>31</item> <item>73</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>11</pipe_depth> </item> </regions> <dp_fu_nodes class_id="45" tracking_level="0" version="0"> <count>52</count> <item_version>0</item_version> <item class_id="46" tracking_level="0" version="0"> <first>76</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>82</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>88</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> <item> <first>94</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>100</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>106</first> <second> <count>1</count> <item_version>0</item_version> <item>49</item> </second> </item> <item> <first>113</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>120</first> <second> <count>1</count> <item_version>0</item_version> <item>51</item> </second> </item> <item> <first>127</first> <second> <count>4</count> <item_version>0</item_version> <item>55</item> <item>55</item> <item>55</item> <item>55</item> </second> </item> <item> <first>132</first> <second> <count>4</count> <item_version>0</item_version> <item>56</item> <item>56</item> <item>56</item> <item>56</item> </second> </item> <item> <first>137</first> <second> <count>4</count> <item_version>0</item_version> <item>57</item> <item>57</item> <item>57</item> <item>57</item> </second> </item> <item> <first>142</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>149</first> <second> <count>1</count> <item_version>0</item_version> <item>53</item> </second> </item> <item> <first>156</first> <second> <count>1</count> <item_version>0</item_version> <item>54</item> </second> </item> <item> <first>163</first> <second> <count>2</count> <item_version>0</item_version> <item>65</item> <item>65</item> </second> </item> <item> <first>168</first> <second> <count>2</count> <item_version>0</item_version> <item>67</item> <item>67</item> </second> </item> <item> <first>173</first> <second> <count>2</count> <item_version>0</item_version> <item>69</item> <item>69</item> </second> </item> <item> <first>182</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>193</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>204</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> <item> <first>211</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> <item> <first>215</first> <second> <count>1</count> <item_version>0</item_version> <item>18</item> </second> </item> <item> <first>219</first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> <item> <first>223</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>227</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>231</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>236</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>242</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>248</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>253</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>261</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>269</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>273</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>277</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> <item> <first>284</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>291</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>297</first> <second> <count>1</count> <item_version>0</item_version> <item>46</item> </second> </item> <item> <first>300</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>306</first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>311</first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> <item> <first>317</first> <second> <count>1</count> <item_version>0</item_version> <item>58</item> </second> </item> <item> <first>320</first> <second> <count>3</count> <item_version>0</item_version> <item>59</item> <item>59</item> <item>59</item> </second> </item> <item> <first>325</first> <second> <count>1</count> <item_version>0</item_version> <item>60</item> </second> </item> <item> <first>328</first> <second> <count>3</count> <item_version>0</item_version> <item>61</item> <item>61</item> <item>61</item> </second> </item> <item> <first>333</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>336</first> <second> <count>3</count> <item_version>0</item_version> <item>63</item> <item>63</item> <item>63</item> </second> </item> <item> <first>341</first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> <item> <first>351</first> <second> <count>1</count> <item_version>0</item_version> <item>66</item> </second> </item> <item> <first>361</first> <second> <count>1</count> <item_version>0</item_version> <item>68</item> </second> </item> <item> <first>371</first> <second> <count>1</count> <item_version>0</item_version> <item>74</item> </second> </item> <item> <first>376</first> <second> <count>1</count> <item_version>0</item_version> <item>75</item> </second> </item> <item> <first>381</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> </dp_fu_nodes> <dp_fu_nodes_expression class_id="48" tracking_level="0" version="0"> <count>38</count> <item_version>0</item_version> <item class_id="49" tracking_level="0" version="0"> <first>bound_fu_381</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>cast1_fu_227</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>cast_fu_223</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>exitcond3_fu_248</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>exitcond_flatten_fu_231</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>in_channels_ch1_addr_gep_fu_106</first> <second> <count>1</count> <item_version>0</item_version> <item>49</item> </second> </item> <item> <first>in_channels_ch2_addr_gep_fu_113</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>in_channels_ch3_addr_gep_fu_120</first> <second> <count>1</count> <item_version>0</item_version> <item>51</item> </second> </item> <item> <first>indvar_flatten_next_fu_236</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>indvar_flatten_phi_fu_182</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>mrv_1_fu_376</first> <second> <count>1</count> <item_version>0</item_version> <item>75</item> </second> </item> <item> <first>mrv_fu_371</first> <second> <count>1</count> <item_version>0</item_version> <item>74</item> </second> </item> <item> <first>out_channels_ch1_add_gep_fu_142</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>out_channels_ch2_add_gep_fu_149</first> <second> <count>1</count> <item_version>0</item_version> <item>53</item> </second> </item> <item> <first>out_channels_ch3_add_gep_fu_156</first> <second> <count>1</count> <item_version>0</item_version> <item>54</item> </second> </item> <item> <first>p_shl1_cast_fu_284</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>p_shl_cast_fu_277</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> <item> <first>tmp_10_cast_fu_311</first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> <item> <first>tmp_1_cast_fu_215</first> <second> <count>1</count> <item_version>0</item_version> <item>18</item> </second> </item> <item> <first>tmp_1_fu_273</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>tmp_2_cast_fu_219</first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> <item> <first>tmp_3_fu_291</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>tmp_3_mid2_v_fu_261</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>tmp_4_cast_fu_333</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>tmp_4_fu_341</first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> <item> <first>tmp_5_cast_fu_297</first> <second> <count>1</count> <item_version>0</item_version> <item>46</item> </second> </item> <item> <first>tmp_5_fu_300</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>tmp_6_cast_fu_317</first> <second> <count>1</count> <item_version>0</item_version> <item>58</item> </second> </item> <item> <first>tmp_6_fu_351</first> <second> <count>1</count> <item_version>0</item_version> <item>66</item> </second> </item> <item> <first>tmp_9_cast_fu_325</first> <second> <count>1</count> <item_version>0</item_version> <item>60</item> </second> </item> <item> <first>tmp_9_fu_361</first> <second> <count>1</count> <item_version>0</item_version> <item>68</item> </second> </item> <item> <first>tmp_cast_fu_211</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> <item> <first>tmp_fu_269</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>x_1_fu_242</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>x_phi_fu_193</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>y_1_fu_306</first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>y_mid2_fu_253</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>y_phi_fu_204</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> </dp_fu_nodes_expression> <dp_fu_nodes_module> <count>3</count> <item_version>0</item_version> <item> <first>grp_fu_320</first> <second> <count>3</count> <item_version>0</item_version> <item>59</item> <item>59</item> <item>59</item> </second> </item> <item> <first>grp_fu_328</first> <second> <count>3</count> <item_version>0</item_version> <item>61</item> <item>61</item> <item>61</item> </second> </item> <item> <first>grp_fu_336</first> <second> <count>3</count> <item_version>0</item_version> <item>63</item> <item>63</item> <item>63</item> </second> </item> </dp_fu_nodes_module> <dp_fu_nodes_io> <count>5</count> <item_version>0</item_version> <item> <first>U_scale_read_read_fu_82</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>V_scale_read_read_fu_76</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>Y_scale_read_read_fu_88</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> <item> <first>in_height_read_1_read_fu_94</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>in_width_read_1_read_fu_100</first> <second> <count>1</count> <item_version>0</item_version> <item>16</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>6</count> <item_version>0</item_version> <item class_id="51" tracking_level="0" version="0"> <first class_id="52" tracking_level="0" version="0"> <first>in_channels_ch1</first> <second>0</second> </first> <second> <count>4</count> <item_version>0</item_version> <item>55</item> <item>55</item> <item>55</item> <item>55</item> </second> </item> <item> <first> <first>in_channels_ch2</first> <second>0</second> </first> <second> <count>4</count> <item_version>0</item_version> <item>56</item> <item>56</item> <item>56</item> <item>56</item> </second> </item> <item> <first> <first>in_channels_ch3</first> <second>0</second> </first> <second> <count>4</count> <item_version>0</item_version> <item>57</item> <item>57</item> <item>57</item> <item>57</item> </second> </item> <item> <first> <first>out_channels_ch1</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>65</item> <item>65</item> </second> </item> <item> <first> <first>out_channels_ch2</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>67</item> <item>67</item> </second> </item> <item> <first> <first>out_channels_ch3</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>69</item> <item>69</item> </second> </item> </dp_mem_port_nodes> <dp_reg_nodes> <count>33</count> <item_version>0</item_version> <item> <first>178</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>189</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>200</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> <item> <first>387</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>393</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>398</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> <item> <first>403</first> <second> <count>1</count> <item_version>0</item_version> <item>18</item> </second> </item> <item> <first>408</first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> <item> <first>413</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>418</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>422</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>427</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>433</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>438</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>443</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>448</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>453</first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>458</first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> <item> <first>465</first> <second> <count>1</count> <item_version>0</item_version> <item>49</item> </second> </item> <item> <first>470</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>475</first> <second> <count>1</count> <item_version>0</item_version> <item>51</item> </second> </item> <item> <first>480</first> <second> <count>1</count> <item_version>0</item_version> <item>55</item> </second> </item> <item> <first>485</first> <second> <count>1</count> <item_version>0</item_version> <item>56</item> </second> </item> <item> <first>490</first> <second> <count>1</count> <item_version>0</item_version> <item>57</item> </second> </item> <item> <first>495</first> <second> <count>1</count> <item_version>0</item_version> <item>58</item> </second> </item> <item> <first>500</first> <second> <count>1</count> <item_version>0</item_version> <item>60</item> </second> </item> <item> <first>505</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>510</first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> <item> <first>515</first> <second> <count>1</count> <item_version>0</item_version> <item>66</item> </second> </item> <item> <first>520</first> <second> <count>1</count> <item_version>0</item_version> <item>68</item> </second> </item> <item> <first>525</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>530</first> <second> <count>1</count> <item_version>0</item_version> <item>53</item> </second> </item> <item> <first>535</first> <second> <count>1</count> <item_version>0</item_version> <item>54</item> </second> </item> </dp_reg_nodes> <dp_regname_nodes> <count>33</count> <item_version>0</item_version> <item> <first>U_reg_485</first> <second> <count>1</count> <item_version>0</item_version> <item>56</item> </second> </item> <item> <first>V_reg_490</first> <second> <count>1</count> <item_version>0</item_version> <item>57</item> </second> </item> <item> <first>Y_reg_480</first> <second> <count>1</count> <item_version>0</item_version> <item>55</item> </second> </item> <item> <first>bound_reg_413</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>exitcond_flatten_reg_418</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>in_channels_ch1_addr_reg_465</first> <second> <count>1</count> <item_version>0</item_version> <item>49</item> </second> </item> <item> <first>in_channels_ch2_addr_reg_470</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>in_channels_ch3_addr_reg_475</first> <second> <count>1</count> <item_version>0</item_version> <item>51</item> </second> </item> <item> <first>in_height_read_1_reg_387</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>in_width_read_1_reg_393</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>indvar_flatten_next_reg_422</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>indvar_flatten_reg_178</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>out_channels_ch1_add_reg_525</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>out_channels_ch2_add_reg_530</first> <second> <count>1</count> <item_version>0</item_version> <item>53</item> </second> </item> <item> <first>out_channels_ch3_add_reg_535</first> <second> <count>1</count> <item_version>0</item_version> <item>54</item> </second> </item> <item> <first>tmp_10_cast_reg_458</first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> <item> <first>tmp_1_cast_reg_403</first> <second> <count>1</count> <item_version>0</item_version> <item>18</item> </second> </item> <item> <first>tmp_1_reg_443</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>tmp_2_cast_reg_408</first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> <item> <first>tmp_3_mid2_v_reg_433</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>tmp_4_cast_reg_505</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>tmp_4_reg_510</first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> <item> <first>tmp_5_reg_448</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>tmp_6_cast_reg_495</first> <second> <count>1</count> <item_version>0</item_version> <item>58</item> </second> </item> <item> <first>tmp_6_reg_515</first> <second> <count>1</count> <item_version>0</item_version> <item>66</item> </second> </item> <item> <first>tmp_9_cast_reg_500</first> <second> <count>1</count> <item_version>0</item_version> <item>60</item> </second> </item> <item> <first>tmp_9_reg_520</first> <second> <count>1</count> <item_version>0</item_version> <item>68</item> </second> </item> <item> <first>tmp_cast_reg_398</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> <item> <first>tmp_reg_438</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>x_reg_189</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>y_1_reg_453</first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>y_mid2_reg_427</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>y_reg_200</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> </dp_regname_nodes> <dp_reg_phi> <count>3</count> <item_version>0</item_version> <item> <first>178</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>189</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>200</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> </dp_reg_phi> <dp_regname_phi> <count>3</count> <item_version>0</item_version> <item> <first>indvar_flatten_reg_178</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>x_reg_189</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>y_reg_200</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> </dp_regname_phi> <dp_port_io_nodes class_id="53" tracking_level="0" version="0"> <count>11</count> <item_version>0</item_version> <item class_id="54" tracking_level="0" version="0"> <first>U_scale</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> </second> </item> <item> <first>V_scale</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> </second> </item> <item> <first>Y_scale</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> </second> </item> <item> <first>in_channels_ch1(p0)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>load</first> <second> <count>4</count> <item_version>0</item_version> <item>55</item> <item>55</item> <item>55</item> <item>55</item> </second> </item> </second> </item> <item> <first>in_channels_ch2(p0)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>load</first> <second> <count>4</count> <item_version>0</item_version> <item>56</item> <item>56</item> <item>56</item> <item>56</item> </second> </item> </second> </item> <item> <first>in_channels_ch3(p0)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>load</first> <second> <count>4</count> <item_version>0</item_version> <item>57</item> <item>57</item> <item>57</item> <item>57</item> </second> </item> </second> </item> <item> <first>in_height_read</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> </second> </item> <item> <first>in_width_read</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> </second> </item> <item> <first>out_channels_ch1(p0)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>store</first> <second> <count>2</count> <item_version>0</item_version> <item>65</item> <item>65</item> </second> </item> </second> </item> <item> <first>out_channels_ch2(p0)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>store</first> <second> <count>2</count> <item_version>0</item_version> <item>67</item> <item>67</item> </second> </item> </second> </item> <item> <first>out_channels_ch3(p0)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>store</first> <second> <count>2</count> <item_version>0</item_version> <item>69</item> <item>69</item> </second> </item> </second> </item> </dp_port_io_nodes> <port2core class_id="55" tracking_level="0" version="0"> <count>6</count> <item_version>0</item_version> <item class_id="56" tracking_level="0" version="0"> <first>1</first> <second>RAM</second> </item> <item> <first>2</first> <second>RAM</second> </item> <item> <first>3</first> <second>RAM</second> </item> <item> <first>6</first> <second>RAM</second> </item> <item> <first>7</first> <second>RAM</second> </item> <item> <first>8</first> <second>RAM</second> </item> </port2core> <node2core> <count>0</count> <item_version>0</item_version> </node2core> </syndb> </boost_serialization>

24.383108

90

0.581856

ad340ee5eb33df0f9ff4d3e418f9224e0a6c1feb

3,153

ads

Ada

spec/asm_generic_posix_types_h.ads

0xA1/pi-spi

f1976005eee16947a0f5d68bf7e01504d140b83e

[ "0BSD" ]

null

spec/asm_generic_posix_types_h.ads

0xA1/pi-spi

f1976005eee16947a0f5d68bf7e01504d140b83e

[ "0BSD" ]

null

spec/asm_generic_posix_types_h.ads

0xA1/pi-spi

f1976005eee16947a0f5d68bf7e01504d140b83e

[ "0BSD" ]

null

pragma Ada_2005; pragma Style_Checks (Off); with Interfaces.C; use Interfaces.C; with arm_linux_gnueabihf_asm_posix_types_h; with Interfaces.C.Strings; package asm_generic_posix_types_h is -- * This file is generally used by user-level software, so you need to -- * be a little careful about namespace pollution etc. -- * -- * First the types that are often defined in different ways across -- * architectures, so that you can override them. -- subtype uu_kernel_long_t is long; -- /usr/include/asm-generic/posix_types.h:14 subtype uu_kernel_ulong_t is unsigned_long; -- /usr/include/asm-generic/posix_types.h:15 subtype uu_kernel_ino_t is uu_kernel_ulong_t; -- /usr/include/asm-generic/posix_types.h:19 subtype uu_kernel_pid_t is int; -- /usr/include/asm-generic/posix_types.h:27 subtype uu_kernel_suseconds_t is uu_kernel_long_t; -- /usr/include/asm-generic/posix_types.h:40 subtype uu_kernel_daddr_t is int; -- /usr/include/asm-generic/posix_types.h:44 subtype uu_kernel_uid32_t is unsigned; -- /usr/include/asm-generic/posix_types.h:48 subtype uu_kernel_gid32_t is unsigned; -- /usr/include/asm-generic/posix_types.h:49 subtype uu_kernel_old_uid_t is arm_linux_gnueabihf_asm_posix_types_h.uu_kernel_uid_t; -- /usr/include/asm-generic/posix_types.h:53 subtype uu_kernel_old_gid_t is arm_linux_gnueabihf_asm_posix_types_h.uu_kernel_gid_t; -- /usr/include/asm-generic/posix_types.h:54 -- * Most 32 bit architectures use "unsigned int" size_t, -- * and all 64 bit architectures use "unsigned long" size_t. -- subtype uu_kernel_size_t is unsigned; -- /usr/include/asm-generic/posix_types.h:67 subtype uu_kernel_ssize_t is int; -- /usr/include/asm-generic/posix_types.h:68 subtype uu_kernel_ptrdiff_t is int; -- /usr/include/asm-generic/posix_types.h:69 type uu_kernel_fsid_t_val_array is array (0 .. 1) of aliased int; type uu_kernel_fsid_t is record val : aliased uu_kernel_fsid_t_val_array; -- /usr/include/asm-generic/posix_types.h:79 end record; pragma Convention (C_Pass_By_Copy, uu_kernel_fsid_t); -- /usr/include/asm-generic/posix_types.h:80 -- skipped anonymous struct anon_1 -- * anything below here should be completely generic -- subtype uu_kernel_off_t is uu_kernel_long_t; -- /usr/include/asm-generic/posix_types.h:86 subtype uu_kernel_loff_t is Long_Long_Integer; -- /usr/include/asm-generic/posix_types.h:87 subtype uu_kernel_time_t is uu_kernel_long_t; -- /usr/include/asm-generic/posix_types.h:88 subtype uu_kernel_clock_t is uu_kernel_long_t; -- /usr/include/asm-generic/posix_types.h:89 subtype uu_kernel_timer_t is int; -- /usr/include/asm-generic/posix_types.h:90 subtype uu_kernel_clockid_t is int; -- /usr/include/asm-generic/posix_types.h:91 type uu_kernel_caddr_t is new Interfaces.C.Strings.chars_ptr; -- /usr/include/asm-generic/posix_types.h:92 subtype uu_kernel_uid16_t is unsigned_short; -- /usr/include/asm-generic/posix_types.h:93 subtype uu_kernel_gid16_t is unsigned_short; -- /usr/include/asm-generic/posix_types.h:94 end asm_generic_posix_types_h;

40.948052

134

0.7634

57c279b26913959d91fad637094c7daf87a30a75

11,505

ads

Ada

source/amf/uml/amf-internals-uml_consider_ignore_fragments.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/uml/amf-internals-uml_consider_ignore_fragments.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/uml/amf-internals-uml_consider_ignore_fragments.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2012, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ with AMF.Internals.UML_Named_Elements; with AMF.UML.Consider_Ignore_Fragments; with AMF.UML.Dependencies.Collections; with AMF.UML.Gates.Collections; with AMF.UML.General_Orderings.Collections; with AMF.UML.Interaction_Operands.Collections; with AMF.UML.Interactions; with AMF.UML.Lifelines.Collections; with AMF.UML.Named_Elements.Collections; with AMF.UML.Namespaces; with AMF.UML.Packages.Collections; with AMF.UML.String_Expressions; with AMF.Visitors; package AMF.Internals.UML_Consider_Ignore_Fragments is type UML_Consider_Ignore_Fragment_Proxy is limited new AMF.Internals.UML_Named_Elements.UML_Named_Element_Proxy and AMF.UML.Consider_Ignore_Fragments.UML_Consider_Ignore_Fragment with null record; overriding function Get_Message (Self : not null access constant UML_Consider_Ignore_Fragment_Proxy) return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element; -- Getter of ConsiderIgnoreFragment::message. -- -- The set of messages that apply to this fragment overriding function Get_Cfragment_Gate (Self : not null access constant UML_Consider_Ignore_Fragment_Proxy) return AMF.UML.Gates.Collections.Set_Of_UML_Gate; -- Getter of CombinedFragment::cfragmentGate. -- -- Specifies the gates that form the interface between this -- CombinedFragment and its surroundings overriding function Get_Interaction_Operator (Self : not null access constant UML_Consider_Ignore_Fragment_Proxy) return AMF.UML.UML_Interaction_Operator_Kind; -- Getter of CombinedFragment::interactionOperator. -- -- Specifies the operation which defines the semantics of this combination -- of InteractionFragments. overriding procedure Set_Interaction_Operator (Self : not null access UML_Consider_Ignore_Fragment_Proxy; To : AMF.UML.UML_Interaction_Operator_Kind); -- Setter of CombinedFragment::interactionOperator. -- -- Specifies the operation which defines the semantics of this combination -- of InteractionFragments. overriding function Get_Operand (Self : not null access constant UML_Consider_Ignore_Fragment_Proxy) return AMF.UML.Interaction_Operands.Collections.Ordered_Set_Of_UML_Interaction_Operand; -- Getter of CombinedFragment::operand. -- -- The set of operands of the combined fragment. overriding function Get_Covered (Self : not null access constant UML_Consider_Ignore_Fragment_Proxy) return AMF.UML.Lifelines.Collections.Set_Of_UML_Lifeline; -- Getter of InteractionFragment::covered. -- -- References the Lifelines that the InteractionFragment involves. overriding function Get_Enclosing_Interaction (Self : not null access constant UML_Consider_Ignore_Fragment_Proxy) return AMF.UML.Interactions.UML_Interaction_Access; -- Getter of InteractionFragment::enclosingInteraction. -- -- The Interaction enclosing this InteractionFragment. overriding procedure Set_Enclosing_Interaction (Self : not null access UML_Consider_Ignore_Fragment_Proxy; To : AMF.UML.Interactions.UML_Interaction_Access); -- Setter of InteractionFragment::enclosingInteraction. -- -- The Interaction enclosing this InteractionFragment. overriding function Get_Enclosing_Operand (Self : not null access constant UML_Consider_Ignore_Fragment_Proxy) return AMF.UML.Interaction_Operands.UML_Interaction_Operand_Access; -- Getter of InteractionFragment::enclosingOperand. -- -- The operand enclosing this InteractionFragment (they may nest -- recursively) overriding procedure Set_Enclosing_Operand (Self : not null access UML_Consider_Ignore_Fragment_Proxy; To : AMF.UML.Interaction_Operands.UML_Interaction_Operand_Access); -- Setter of InteractionFragment::enclosingOperand. -- -- The operand enclosing this InteractionFragment (they may nest -- recursively) overriding function Get_General_Ordering (Self : not null access constant UML_Consider_Ignore_Fragment_Proxy) return AMF.UML.General_Orderings.Collections.Set_Of_UML_General_Ordering; -- Getter of InteractionFragment::generalOrdering. -- -- The general ordering relationships contained in this fragment. overriding function Get_Client_Dependency (Self : not null access constant UML_Consider_Ignore_Fragment_Proxy) return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency; -- Getter of NamedElement::clientDependency. -- -- Indicates the dependencies that reference the client. overriding function Get_Name_Expression (Self : not null access constant UML_Consider_Ignore_Fragment_Proxy) return AMF.UML.String_Expressions.UML_String_Expression_Access; -- Getter of NamedElement::nameExpression. -- -- The string expression used to define the name of this named element. overriding procedure Set_Name_Expression (Self : not null access UML_Consider_Ignore_Fragment_Proxy; To : AMF.UML.String_Expressions.UML_String_Expression_Access); -- Setter of NamedElement::nameExpression. -- -- The string expression used to define the name of this named element. overriding function Get_Namespace (Self : not null access constant UML_Consider_Ignore_Fragment_Proxy) return AMF.UML.Namespaces.UML_Namespace_Access; -- Getter of NamedElement::namespace. -- -- Specifies the namespace that owns the NamedElement. overriding function Get_Qualified_Name (Self : not null access constant UML_Consider_Ignore_Fragment_Proxy) return AMF.Optional_String; -- Getter of NamedElement::qualifiedName. -- -- A name which allows the NamedElement to be identified within a -- hierarchy of nested Namespaces. It is constructed from the names of the -- containing namespaces starting at the root of the hierarchy and ending -- with the name of the NamedElement itself. overriding function All_Owning_Packages (Self : not null access constant UML_Consider_Ignore_Fragment_Proxy) return AMF.UML.Packages.Collections.Set_Of_UML_Package; -- Operation NamedElement::allOwningPackages. -- -- The query allOwningPackages() returns all the directly or indirectly -- owning packages. overriding function Is_Distinguishable_From (Self : not null access constant UML_Consider_Ignore_Fragment_Proxy; N : AMF.UML.Named_Elements.UML_Named_Element_Access; Ns : AMF.UML.Namespaces.UML_Namespace_Access) return Boolean; -- Operation NamedElement::isDistinguishableFrom. -- -- The query isDistinguishableFrom() determines whether two NamedElements -- may logically co-exist within a Namespace. By default, two named -- elements are distinguishable if (a) they have unrelated types or (b) -- they have related types but different names. overriding function Namespace (Self : not null access constant UML_Consider_Ignore_Fragment_Proxy) return AMF.UML.Namespaces.UML_Namespace_Access; -- Operation NamedElement::namespace. -- -- Missing derivation for NamedElement::/namespace : Namespace overriding procedure Enter_Element (Self : not null access constant UML_Consider_Ignore_Fragment_Proxy; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control); -- Dispatch call to corresponding subprogram of visitor interface. overriding procedure Leave_Element (Self : not null access constant UML_Consider_Ignore_Fragment_Proxy; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control); -- Dispatch call to corresponding subprogram of visitor interface. overriding procedure Visit_Element (Self : not null access constant UML_Consider_Ignore_Fragment_Proxy; Iterator : in out AMF.Visitors.Abstract_Iterator'Class; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control); -- Dispatch call to corresponding subprogram of iterator interface. end AMF.Internals.UML_Consider_Ignore_Fragments;

49.805195

94

0.660756

1a40a1c02c76a4314d2e33d3a18516fbc77e558e

35,498

ads

Ada

src/condor_tests/cmd_status-af_orig_first_test.ads

olifre/htcondor

e1299614fbdcad113a206270f3940e2e8777c2bd

[ "Apache-2.0" ]

217

2015-01-08T04:49:42.000Z

2022-03-27T10:11:58.000Z

src/condor_tests/cmd_status-af_orig_first_test.ads

olifre/htcondor

e1299614fbdcad113a206270f3940e2e8777c2bd

[ "Apache-2.0" ]

185

2015-05-03T13:26:31.000Z

2022-03-28T03:08:59.000Z

src/condor_tests/cmd_status-af_orig_first_test.ads

olifre/htcondor

e1299614fbdcad113a206270f3940e2e8777c2bd

[ "Apache-2.0" ]

133

2015-02-11T09:17:45.000Z

2022-03-31T07:28:54.000Z

AcceptedWhileDraining = false Activity = "Idle" AddressV1 = "{[ p=\"primary\"; a=\"10.0.0.3\"; port=36347; n=\"Internet\"; alias=\"gthain.localdomain\"; spid=\"startd_888024_2e07\"; noUDP=true; ], [ p=\"IPv4\"; a=\"10.0.0.3\"; port=36347; n=\"Internet\"; alias=\"gthain.localdomain\"; spid=\"startd_888024_2e07\"; noUDP=true; ]}" Arch = "X86_64" AuthenticatedIdentity = "condor@family" AuthenticationMethod = "FAMILY" CanHibernate = true ClockDay = 0 ClockMin = 980 COLLECTOR_HOST_STRING = "gthain.localdomain:0" CondorLoadAvg = 0.0 CondorPlatform = "$CondorPlatform: X86_64-Fedora_33 $" CondorVersion = "$CondorVersion: 8.9.12 Mar 14 2021 BuildID: UW_development RC $" ConsoleIdle = 0 CpuBusy = ((LoadAvg - CondorLoadAvg) >= 0.5) CpuBusyTime = 0 CpuCacheSize = 8192 CpuFamily = 6 CpuIsBusy = true CpuModelNumber = 142 Cpus = 1 CurrentRank = 0.0 DaemonCoreDutyCycle = 0.0 DaemonLastReconfigTime = 1615756825 DaemonShutdown = time() - DaemonStartTime > 1500 DaemonStartTime = 1615756825 DetectedCpus = 8 DetectedMemory = 15661 Disk = 16190387 EnteredCurrentActivity = 1615756825 EnteredCurrentState = 1615756825 ExpectedMachineGracefulDrainingBadput = 0 ExpectedMachineGracefulDrainingCompletion = 1615756825 ExpectedMachineQuickDrainingBadput = 0 ExpectedMachineQuickDrainingCompletion = 1615756825 FileSystemDomain = "gthain.localdomain" has_avx = true has_avx2 = true has_sse4_1 = true has_sse4_2 = true has_ssse3 = true HasFileTransfer = true HasIOProxy = true HasJICLocalConfig = true HasJICLocalStdin = true HasJobDeferral = true HasJobTransferPlugins = true HasMPI = true HasPerFileEncryption = true HasReconnect = true HasSelfCheckpointTransfers = true HasSingularity = true HasTDP = true HasTransferInputRemaps = true HasUserNamespaces = true HasVM = false HibernationLevel = 0 HibernationState = "NONE" HibernationSupportedStates = "S3,S4,S5" IsLocalStartd = false IsWakeAble = false IsWakeOnLanEnabled = false IsWakeOnLanSupported = false JobPreemptions = 0 JobRankPreemptions = 0 JobStarts = 0 JobUserPrioPreemptions = 0 KeyboardIdle = 0 LastBenchmark = 0 LastFetchWorkCompleted = 0 LastFetchWorkSpawned = 0 LastHeardFrom = 1615756825 LoadAvg = 0.59 Machine = "gthain.localdomain" MachineMaxVacateTime = 10 * 60 MachineResources = "Cpus Memory Disk Swap" MaxJobRetirementTime = 0 Memory = 1957 MonitorSelfAge = 1 MonitorSelfCPUUsage = 1.0 MonitorSelfImageSize = 26716 MonitorSelfRegisteredSocketCount = 0 MonitorSelfResidentSetSize = 12836 MonitorSelfSecuritySessions = 10 MonitorSelfTime = 1615756825 MyAddress = "<10.0.0.3:36347?addrs=10.0.0.3-36347&alias=gthain.localdomain&noUDP&sock=startd_888024_2e07>" MyCurrentTime = 1615756825 MyType = "Machine" Name = "[email protected]" NextFetchWorkDelay = -1 NumPids = 0 OpSys = "LINUX" OpSysAndVer = "Fedora33" OpSysLegacy = "LINUX" OpSysLongName = "Fedora release 33 (Thirty Three)" OpSysMajorVer = 33 OpSysName = "Fedora" OpSysShortName = "Fedora" OpSysVer = 3300 Rank = 0.0 RecentDaemonCoreDutyCycle = 0.0 RecentJobPreemptions = 0 RecentJobRankPreemptions = 0 RecentJobStarts = 0 RecentJobUserPrioPreemptions = 0 Requirements = START RetirementTimeRemaining = 0 SingularityVersion = "singularity version 3.7.1-1.fc33" SlotID = 1 SlotType = "Static" SlotTypeID = 0 SlotWeight = Cpus Start = true StartdIpAddr = "<10.0.0.3:36347?addrs=10.0.0.3-36347&alias=gthain.localdomain&noUDP&sock=startd_888024_2e07>" StarterAbilityList = "HasVM,HasMPI,HasFileTransfer,HasJobDeferral,HasSingularity,HasJobTransferPlugins,HasPerFileEncryption,HasReconnect,HasTDP,HasJICLocalStdin,HasTransferInputRemaps,HasSelfCheckpointTransfers,HasJICLocalConfig" State = "Unclaimed" SubnetMask = "255.255.255.0" TargetType = "Job" TimeToLive = 2147483647 TotalCondorLoadAvg = 0.0 TotalCpus = 8.0 TotalDisk = 129523096 TotalLoadAvg = 0.59 TotalMemory = 15661 TotalSlotCpus = 1 TotalSlotDisk = 16190387.0 TotalSlotMemory = 1957 TotalSlots = 8 TotalVirtualMemory = 28313600 UidDomain = "gthain.localdomain" Unhibernate = MY.MachineLastMatchTime =!= undefined UpdateSequenceNumber = 1 UpdatesHistory = "00000000000000000000000000000000" UpdatesLost = 0 UpdatesSequenced = 0 UpdatesTotal = 1 UtsnameMachine = "x86_64" UtsnameNodename = "gthain.localdomain" UtsnameRelease = "5.10.21-200.fc33.x86_64" UtsnameSysname = "Linux" UtsnameVersion = "#1 SMP Mon Mar 8 00:24:40 UTC 2021" VirtualMemory = 3539200 WakeOnLanEnabledFlags = "NONE" WakeOnLanSupportedFlags = "NONE" AcceptedWhileDraining = false Activity = "Idle" AddressV1 = "{[ p=\"primary\"; a=\"10.0.0.3\"; port=36347; n=\"Internet\"; alias=\"gthain.localdomain\"; spid=\"startd_888024_2e07\"; noUDP=true; ], [ p=\"IPv4\"; a=\"10.0.0.3\"; port=36347; n=\"Internet\"; alias=\"gthain.localdomain\"; spid=\"startd_888024_2e07\"; noUDP=true; ]}" Arch = "X86_64" AuthenticatedIdentity = "condor@family" AuthenticationMethod = "FAMILY" CanHibernate = true ClockDay = 0 ClockMin = 980 COLLECTOR_HOST_STRING = "gthain.localdomain:0" CondorLoadAvg = 0.0 CondorPlatform = "$CondorPlatform: X86_64-Fedora_33 $" CondorVersion = "$CondorVersion: 8.9.12 Mar 14 2021 BuildID: UW_development RC $" ConsoleIdle = 0 CpuBusy = ((LoadAvg - CondorLoadAvg) >= 0.5) CpuBusyTime = 0 CpuCacheSize = 8192 CpuFamily = 6 CpuIsBusy = false CpuModelNumber = 142 Cpus = 1 CurrentRank = 0.0 DaemonCoreDutyCycle = 0.0 DaemonLastReconfigTime = 1615756825 DaemonShutdown = time() - DaemonStartTime > 1500 DaemonStartTime = 1615756825 DetectedCpus = 8 DetectedMemory = 15661 Disk = 16190387 EnteredCurrentActivity = 1615756825 EnteredCurrentState = 1615756825 ExpectedMachineGracefulDrainingBadput = 0 ExpectedMachineGracefulDrainingCompletion = 1615756825 ExpectedMachineQuickDrainingBadput = 0 ExpectedMachineQuickDrainingCompletion = 1615756825 FileSystemDomain = "gthain.localdomain" HardwareAddress = "40:ec:99:82:52:b2" has_avx = true has_avx2 = true has_sse4_1 = true has_sse4_2 = true has_ssse3 = true HasFileTransfer = true HasIOProxy = true HasJICLocalConfig = true HasJICLocalStdin = true HasJobDeferral = true HasJobTransferPlugins = true HasMPI = true HasPerFileEncryption = true HasReconnect = true HasSelfCheckpointTransfers = true HasSingularity = true HasTDP = true HasTransferInputRemaps = true HasUserNamespaces = true HasVM = false HibernationLevel = 0 HibernationState = "NONE" HibernationSupportedStates = "S3,S4,S5" IsLocalStartd = false IsWakeAble = false IsWakeOnLanEnabled = false IsWakeOnLanSupported = false JobPreemptions = 0 JobRankPreemptions = 0 JobStarts = 0 JobUserPrioPreemptions = 0 KeyboardIdle = 0 LastBenchmark = 0 LastFetchWorkCompleted = 0 LastFetchWorkSpawned = 0 LastHeardFrom = 1615756825 LoadAvg = 0.0 Machine = "gthain.localdomain" MachineMaxVacateTime = 10 * 60 MachineResources = "Cpus Memory Disk Swap" MaxJobRetirementTime = 0 Memory = 1957 MonitorSelfAge = 1 MonitorSelfCPUUsage = 1.0 MonitorSelfImageSize = 26716 MonitorSelfRegisteredSocketCount = 0 MonitorSelfResidentSetSize = 12836 MonitorSelfSecuritySessions = 10 MonitorSelfTime = 1615756825 MyAddress = "<10.0.0.3:36347?addrs=10.0.0.3-36347&alias=gthain.localdomain&noUDP&sock=startd_888024_2e07>" MyCurrentTime = 1615756825 MyType = "Machine" Name = "[email protected]" NextFetchWorkDelay = -1 NumPids = 0 OpSys = "LINUX" OpSysAndVer = "Fedora33" OpSysLegacy = "LINUX" OpSysLongName = "Fedora release 33 (Thirty Three)" OpSysMajorVer = 33 OpSysName = "Fedora" OpSysShortName = "Fedora" OpSysVer = 3300 Rank = 0.0 RecentDaemonCoreDutyCycle = 0.0 RecentJobPreemptions = 0 RecentJobRankPreemptions = 0 RecentJobStarts = 0 RecentJobUserPrioPreemptions = 0 Requirements = START RetirementTimeRemaining = 0 SingularityVersion = "singularity version 3.7.1-1.fc33" SlotID = 2 SlotType = "Static" SlotTypeID = 0 SlotWeight = Cpus Start = true StartdIpAddr = "<10.0.0.3:36347?addrs=10.0.0.3-36347&alias=gthain.localdomain&noUDP&sock=startd_888024_2e07>" StarterAbilityList = "HasVM,HasMPI,HasFileTransfer,HasJobDeferral,HasSingularity,HasJobTransferPlugins,HasPerFileEncryption,HasReconnect,HasTDP,HasJICLocalStdin,HasTransferInputRemaps,HasSelfCheckpointTransfers,HasJICLocalConfig" State = "Unclaimed" SubnetMask = "255.255.255.0" TargetType = "Job" TimeToLive = 2147483647 TotalCondorLoadAvg = 0.0 TotalCpus = 8.0 TotalDisk = 129523096 TotalLoadAvg = 0.59 TotalMemory = 15661 TotalSlotCpus = 1 TotalSlotDisk = 16190387.0 TotalSlotMemory = 1957 TotalSlots = 8 TotalVirtualMemory = 28313600 UidDomain = "gthain.localdomain" Unhibernate = MY.MachineLastMatchTime =!= undefined UpdateSequenceNumber = 1 UpdatesHistory = "00000000000000000000000000000000" UpdatesLost = 0 UpdatesSequenced = 0 UpdatesTotal = 1 UtsnameMachine = "x86_64" UtsnameNodename = "gthain.localdomain" UtsnameRelease = "5.10.21-200.fc33.x86_64" UtsnameSysname = "Linux" UtsnameVersion = "#1 SMP Mon Mar 8 00:24:40 UTC 2021" VirtualMemory = 3539200 WakeOnLanEnabledFlags = "NONE" WakeOnLanSupportedFlags = "NONE" AcceptedWhileDraining = false Activity = "Idle" AddressV1 = "{[ p=\"primary\"; a=\"10.0.0.3\"; port=36347; n=\"Internet\"; alias=\"gthain.localdomain\"; spid=\"startd_888024_2e07\"; noUDP=true; ], [ p=\"IPv4\"; a=\"10.0.0.3\"; port=36347; n=\"Internet\"; alias=\"gthain.localdomain\"; spid=\"startd_888024_2e07\"; noUDP=true; ]}" Arch = "X86_64" AuthenticatedIdentity = "condor@family" AuthenticationMethod = "FAMILY" CanHibernate = true ClockDay = 0 ClockMin = 980 COLLECTOR_HOST_STRING = "gthain.localdomain:0" CondorLoadAvg = 0.0 CondorPlatform = "$CondorPlatform: X86_64-Fedora_33 $" CondorVersion = "$CondorVersion: 8.9.12 Mar 14 2021 BuildID: UW_development RC $" ConsoleIdle = 0 CpuBusy = ((LoadAvg - CondorLoadAvg) >= 0.5) CpuBusyTime = 0 CpuCacheSize = 8192 CpuFamily = 6 CpuIsBusy = false CpuModelNumber = 142 Cpus = 1 CurrentRank = 0.0 DaemonCoreDutyCycle = 0.0 DaemonLastReconfigTime = 1615756825 DaemonShutdown = time() - DaemonStartTime > 1500 DaemonStartTime = 1615756825 DetectedCpus = 8 DetectedMemory = 15661 Disk = 16190387 EnteredCurrentActivity = 1615756825 EnteredCurrentState = 1615756825 ExpectedMachineGracefulDrainingBadput = 0 ExpectedMachineGracefulDrainingCompletion = 1615756825 ExpectedMachineQuickDrainingBadput = 0 ExpectedMachineQuickDrainingCompletion = 1615756825 FileSystemDomain = "gthain.localdomain" HardwareAddress = "40:ec:99:82:52:b2" has_avx = true has_avx2 = true has_sse4_1 = true has_sse4_2 = true has_ssse3 = true HasFileTransfer = true HasIOProxy = true HasJICLocalConfig = true HasJICLocalStdin = true HasJobDeferral = true HasJobTransferPlugins = true HasMPI = true HasPerFileEncryption = true HasReconnect = true HasSelfCheckpointTransfers = true HasSingularity = true HasTDP = true HasTransferInputRemaps = true HasUserNamespaces = true HasVM = false HibernationLevel = 0 HibernationState = "NONE" HibernationSupportedStates = "S3,S4,S5" IsLocalStartd = false IsWakeAble = false IsWakeOnLanEnabled = false IsWakeOnLanSupported = false JobPreemptions = 0 JobRankPreemptions = 0 JobStarts = 0 JobUserPrioPreemptions = 0 KeyboardIdle = 0 LastBenchmark = 0 LastFetchWorkCompleted = 0 LastFetchWorkSpawned = 0 LastHeardFrom = 1615756825 LoadAvg = 0.0 Machine = "gthain.localdomain" MachineMaxVacateTime = 10 * 60 MachineResources = "Cpus Memory Disk Swap" MaxJobRetirementTime = 0 Memory = 1957 MonitorSelfAge = 1 MonitorSelfCPUUsage = 1.0 MonitorSelfImageSize = 26716 MonitorSelfRegisteredSocketCount = 0 MonitorSelfResidentSetSize = 12836 MonitorSelfSecuritySessions = 10 MonitorSelfTime = 1615756825 MyAddress = "<10.0.0.3:36347?addrs=10.0.0.3-36347&alias=gthain.localdomain&noUDP&sock=startd_888024_2e07>" MyCurrentTime = 1615756825 MyType = "Machine" Name = "[email protected]" NextFetchWorkDelay = -1 NumPids = 0 OpSys = "LINUX" OpSysAndVer = "Fedora33" OpSysLegacy = "LINUX" OpSysLongName = "Fedora release 33 (Thirty Three)" OpSysMajorVer = 33 OpSysName = "Fedora" OpSysShortName = "Fedora" OpSysVer = 3300 Rank = 0.0 RecentDaemonCoreDutyCycle = 0.0 RecentJobPreemptions = 0 RecentJobRankPreemptions = 0 RecentJobStarts = 0 RecentJobUserPrioPreemptions = 0 Requirements = START RetirementTimeRemaining = 0 SingularityVersion = "singularity version 3.7.1-1.fc33" SlotID = 3 SlotType = "Static" SlotTypeID = 0 SlotWeight = Cpus Start = true StartdIpAddr = "<10.0.0.3:36347?addrs=10.0.0.3-36347&alias=gthain.localdomain&noUDP&sock=startd_888024_2e07>" StarterAbilityList = "HasVM,HasMPI,HasFileTransfer,HasJobDeferral,HasSingularity,HasJobTransferPlugins,HasPerFileEncryption,HasReconnect,HasTDP,HasJICLocalStdin,HasTransferInputRemaps,HasSelfCheckpointTransfers,HasJICLocalConfig" State = "Unclaimed" SubnetMask = "255.255.255.0" TargetType = "Job" TimeToLive = 2147483647 TotalCondorLoadAvg = 0.0 TotalCpus = 8.0 TotalDisk = 129523096 TotalLoadAvg = 0.59 TotalMemory = 15661 TotalSlotCpus = 1 TotalSlotDisk = 16190387.0 TotalSlotMemory = 1957 TotalSlots = 8 TotalVirtualMemory = 28313600 UidDomain = "gthain.localdomain" Unhibernate = MY.MachineLastMatchTime =!= undefined UpdateSequenceNumber = 1 UpdatesHistory = "00000000000000000000000000000000" UpdatesLost = 0 UpdatesSequenced = 0 UpdatesTotal = 1 UtsnameMachine = "x86_64" UtsnameNodename = "gthain.localdomain" UtsnameRelease = "5.10.21-200.fc33.x86_64" UtsnameSysname = "Linux" UtsnameVersion = "#1 SMP Mon Mar 8 00:24:40 UTC 2021" VirtualMemory = 3539200 WakeOnLanEnabledFlags = "NONE" WakeOnLanSupportedFlags = "NONE" AcceptedWhileDraining = false Activity = "Idle" AddressV1 = "{[ p=\"primary\"; a=\"10.0.0.3\"; port=36347; n=\"Internet\"; alias=\"gthain.localdomain\"; spid=\"startd_888024_2e07\"; noUDP=true; ], [ p=\"IPv4\"; a=\"10.0.0.3\"; port=36347; n=\"Internet\"; alias=\"gthain.localdomain\"; spid=\"startd_888024_2e07\"; noUDP=true; ]}" Arch = "X86_64" AuthenticatedIdentity = "condor@family" AuthenticationMethod = "FAMILY" CanHibernate = true ClockDay = 0 ClockMin = 980 COLLECTOR_HOST_STRING = "gthain.localdomain:0" CondorLoadAvg = 0.0 CondorPlatform = "$CondorPlatform: X86_64-Fedora_33 $" CondorVersion = "$CondorVersion: 8.9.12 Mar 14 2021 BuildID: UW_development RC $" ConsoleIdle = 0 CpuBusy = ((LoadAvg - CondorLoadAvg) >= 0.5) CpuBusyTime = 0 CpuCacheSize = 8192 CpuFamily = 6 CpuIsBusy = false CpuModelNumber = 142 Cpus = 1 CurrentRank = 0.0 DaemonCoreDutyCycle = 0.0 DaemonLastReconfigTime = 1615756825 DaemonShutdown = time() - DaemonStartTime > 1500 DaemonStartTime = 1615756825 DetectedCpus = 8 DetectedMemory = 15661 Disk = 16190387 EnteredCurrentActivity = 1615756825 EnteredCurrentState = 1615756825 ExpectedMachineGracefulDrainingBadput = 0 ExpectedMachineGracefulDrainingCompletion = 1615756825 ExpectedMachineQuickDrainingBadput = 0 ExpectedMachineQuickDrainingCompletion = 1615756825 FileSystemDomain = "gthain.localdomain" HardwareAddress = "40:ec:99:82:52:b2" has_avx = true has_avx2 = true has_sse4_1 = true has_sse4_2 = true has_ssse3 = true HasFileTransfer = true HasIOProxy = true HasJICLocalConfig = true HasJICLocalStdin = true HasJobDeferral = true HasJobTransferPlugins = true HasMPI = true HasPerFileEncryption = true HasReconnect = true HasSelfCheckpointTransfers = true HasSingularity = true HasTDP = true HasTransferInputRemaps = true HasUserNamespaces = true HasVM = false HibernationLevel = 0 HibernationState = "NONE" HibernationSupportedStates = "S3,S4,S5" IsLocalStartd = false IsWakeAble = false IsWakeOnLanEnabled = false IsWakeOnLanSupported = false JobPreemptions = 0 JobRankPreemptions = 0 JobStarts = 0 JobUserPrioPreemptions = 0 KeyboardIdle = 0 LastBenchmark = 0 LastFetchWorkCompleted = 0 LastFetchWorkSpawned = 0 LastHeardFrom = 1615756825 LoadAvg = 0.0 Machine = "gthain.localdomain" MachineMaxVacateTime = 10 * 60 MachineResources = "Cpus Memory Disk Swap" MaxJobRetirementTime = 0 Memory = 1957 MonitorSelfAge = 1 MonitorSelfCPUUsage = 1.0 MonitorSelfImageSize = 26716 MonitorSelfRegisteredSocketCount = 0 MonitorSelfResidentSetSize = 12836 MonitorSelfSecuritySessions = 10 MonitorSelfTime = 1615756825 MyAddress = "<10.0.0.3:36347?addrs=10.0.0.3-36347&alias=gthain.localdomain&noUDP&sock=startd_888024_2e07>" MyCurrentTime = 1615756825 MyType = "Machine" Name = "[email protected]" NextFetchWorkDelay = -1 NumPids = 0 OpSys = "LINUX" OpSysAndVer = "Fedora33" OpSysLegacy = "LINUX" OpSysLongName = "Fedora release 33 (Thirty Three)" OpSysMajorVer = 33 OpSysName = "Fedora" OpSysShortName = "Fedora" OpSysVer = 3300 Rank = 0.0 RecentDaemonCoreDutyCycle = 0.0 RecentJobPreemptions = 0 RecentJobRankPreemptions = 0 RecentJobStarts = 0 RecentJobUserPrioPreemptions = 0 Requirements = START RetirementTimeRemaining = 0 SingularityVersion = "singularity version 3.7.1-1.fc33" SlotID = 4 SlotType = "Static" SlotTypeID = 0 SlotWeight = Cpus Start = true StartdIpAddr = "<10.0.0.3:36347?addrs=10.0.0.3-36347&alias=gthain.localdomain&noUDP&sock=startd_888024_2e07>" StarterAbilityList = "HasVM,HasMPI,HasFileTransfer,HasJobDeferral,HasSingularity,HasJobTransferPlugins,HasPerFileEncryption,HasReconnect,HasTDP,HasJICLocalStdin,HasTransferInputRemaps,HasSelfCheckpointTransfers,HasJICLocalConfig" State = "Unclaimed" SubnetMask = "255.255.255.0" TargetType = "Job" TimeToLive = 2147483647 TotalCondorLoadAvg = 0.0 TotalCpus = 8.0 TotalDisk = 129523096 TotalLoadAvg = 0.59 TotalMemory = 15661 TotalSlotCpus = 1 TotalSlotDisk = 16190387.0 TotalSlotMemory = 1957 TotalSlots = 8 TotalVirtualMemory = 28313600 UidDomain = "gthain.localdomain" Unhibernate = MY.MachineLastMatchTime =!= undefined UpdateSequenceNumber = 1 UpdatesHistory = "00000000000000000000000000000000" UpdatesLost = 0 UpdatesSequenced = 0 UpdatesTotal = 1 UtsnameMachine = "x86_64" UtsnameNodename = "gthain.localdomain" UtsnameRelease = "5.10.21-200.fc33.x86_64" UtsnameSysname = "Linux" UtsnameVersion = "#1 SMP Mon Mar 8 00:24:40 UTC 2021" VirtualMemory = 3539200 WakeOnLanEnabledFlags = "NONE" WakeOnLanSupportedFlags = "NONE" AcceptedWhileDraining = false Activity = "Idle" AddressV1 = "{[ p=\"primary\"; a=\"10.0.0.3\"; port=36347; n=\"Internet\"; alias=\"gthain.localdomain\"; spid=\"startd_888024_2e07\"; noUDP=true; ], [ p=\"IPv4\"; a=\"10.0.0.3\"; port=36347; n=\"Internet\"; alias=\"gthain.localdomain\"; spid=\"startd_888024_2e07\"; noUDP=true; ]}" Arch = "X86_64" AuthenticatedIdentity = "condor@family" AuthenticationMethod = "FAMILY" CanHibernate = true ClockDay = 0 ClockMin = 980 COLLECTOR_HOST_STRING = "gthain.localdomain:0" CondorLoadAvg = 0.0 CondorPlatform = "$CondorPlatform: X86_64-Fedora_33 $" CondorVersion = "$CondorVersion: 8.9.12 Mar 14 2021 BuildID: UW_development RC $" ConsoleIdle = 0 CpuBusy = ((LoadAvg - CondorLoadAvg) >= 0.5) CpuBusyTime = 0 CpuCacheSize = 8192 CpuFamily = 6 CpuIsBusy = false CpuModelNumber = 142 Cpus = 1 CurrentRank = 0.0 DaemonCoreDutyCycle = 0.0 DaemonLastReconfigTime = 1615756825 DaemonShutdown = time() - DaemonStartTime > 1500 DaemonStartTime = 1615756825 DetectedCpus = 8 DetectedMemory = 15661 Disk = 16190387 EnteredCurrentActivity = 1615756825 EnteredCurrentState = 1615756825 ExpectedMachineGracefulDrainingBadput = 0 ExpectedMachineGracefulDrainingCompletion = 1615756825 ExpectedMachineQuickDrainingBadput = 0 ExpectedMachineQuickDrainingCompletion = 1615756825 FileSystemDomain = "gthain.localdomain" HardwareAddress = "40:ec:99:82:52:b2" has_avx = true has_avx2 = true has_sse4_1 = true has_sse4_2 = true has_ssse3 = true HasFileTransfer = true HasIOProxy = true HasJICLocalConfig = true HasJICLocalStdin = true HasJobDeferral = true HasJobTransferPlugins = true HasMPI = true HasPerFileEncryption = true HasReconnect = true HasSelfCheckpointTransfers = true HasSingularity = true HasTDP = true HasTransferInputRemaps = true HasUserNamespaces = true HasVM = false HibernationLevel = 0 HibernationState = "NONE" HibernationSupportedStates = "S3,S4,S5" IsLocalStartd = false IsWakeAble = false IsWakeOnLanEnabled = false IsWakeOnLanSupported = false JobPreemptions = 0 JobRankPreemptions = 0 JobStarts = 0 JobUserPrioPreemptions = 0 KeyboardIdle = 0 LastBenchmark = 0 LastFetchWorkCompleted = 0 LastFetchWorkSpawned = 0 LastHeardFrom = 1615756825 LoadAvg = 0.0 Machine = "gthain.localdomain" MachineMaxVacateTime = 10 * 60 MachineResources = "Cpus Memory Disk Swap" MaxJobRetirementTime = 0 Memory = 1957 MonitorSelfAge = 1 MonitorSelfCPUUsage = 1.0 MonitorSelfImageSize = 26716 MonitorSelfRegisteredSocketCount = 0 MonitorSelfResidentSetSize = 12836 MonitorSelfSecuritySessions = 10 MonitorSelfTime = 1615756825 MyAddress = "<10.0.0.3:36347?addrs=10.0.0.3-36347&alias=gthain.localdomain&noUDP&sock=startd_888024_2e07>" MyCurrentTime = 1615756825 MyType = "Machine" Name = "[email protected]" NextFetchWorkDelay = -1 NumPids = 0 OpSys = "LINUX" OpSysAndVer = "Fedora33" OpSysLegacy = "LINUX" OpSysLongName = "Fedora release 33 (Thirty Three)" OpSysMajorVer = 33 OpSysName = "Fedora" OpSysShortName = "Fedora" OpSysVer = 3300 Rank = 0.0 RecentDaemonCoreDutyCycle = 0.0 RecentJobPreemptions = 0 RecentJobRankPreemptions = 0 RecentJobStarts = 0 RecentJobUserPrioPreemptions = 0 Requirements = START RetirementTimeRemaining = 0 SingularityVersion = "singularity version 3.7.1-1.fc33" SlotID = 5 SlotType = "Static" SlotTypeID = 0 SlotWeight = Cpus Start = true StartdIpAddr = "<10.0.0.3:36347?addrs=10.0.0.3-36347&alias=gthain.localdomain&noUDP&sock=startd_888024_2e07>" StarterAbilityList = "HasVM,HasMPI,HasFileTransfer,HasJobDeferral,HasSingularity,HasJobTransferPlugins,HasPerFileEncryption,HasReconnect,HasTDP,HasJICLocalStdin,HasTransferInputRemaps,HasSelfCheckpointTransfers,HasJICLocalConfig" State = "Unclaimed" SubnetMask = "255.255.255.0" TargetType = "Job" TimeToLive = 2147483647 TotalCondorLoadAvg = 0.0 TotalCpus = 8.0 TotalDisk = 129523096 TotalLoadAvg = 0.59 TotalMemory = 15661 TotalSlotCpus = 1 TotalSlotDisk = 16190387.0 TotalSlotMemory = 1957 TotalSlots = 8 TotalVirtualMemory = 28313600 UidDomain = "gthain.localdomain" Unhibernate = MY.MachineLastMatchTime =!= undefined UpdateSequenceNumber = 1 UpdatesHistory = "00000000000000000000000000000000" UpdatesLost = 0 UpdatesSequenced = 0 UpdatesTotal = 1 UtsnameMachine = "x86_64" UtsnameNodename = "gthain.localdomain" UtsnameRelease = "5.10.21-200.fc33.x86_64" UtsnameSysname = "Linux" UtsnameVersion = "#1 SMP Mon Mar 8 00:24:40 UTC 2021" VirtualMemory = 3539200 WakeOnLanEnabledFlags = "NONE" WakeOnLanSupportedFlags = "NONE" AcceptedWhileDraining = false Activity = "Idle" AddressV1 = "{[ p=\"primary\"; a=\"10.0.0.3\"; port=36347; n=\"Internet\"; alias=\"gthain.localdomain\"; spid=\"startd_888024_2e07\"; noUDP=true; ], [ p=\"IPv4\"; a=\"10.0.0.3\"; port=36347; n=\"Internet\"; alias=\"gthain.localdomain\"; spid=\"startd_888024_2e07\"; noUDP=true; ]}" Arch = "X86_64" AuthenticatedIdentity = "condor@family" AuthenticationMethod = "FAMILY" CanHibernate = true ClockDay = 0 ClockMin = 980 COLLECTOR_HOST_STRING = "gthain.localdomain:0" CondorLoadAvg = 0.0 CondorPlatform = "$CondorPlatform: X86_64-Fedora_33 $" CondorVersion = "$CondorVersion: 8.9.12 Mar 14 2021 BuildID: UW_development RC $" ConsoleIdle = 0 CpuBusy = ((LoadAvg - CondorLoadAvg) >= 0.5) CpuBusyTime = 0 CpuCacheSize = 8192 CpuFamily = 6 CpuIsBusy = false CpuModelNumber = 142 Cpus = 1 CurrentRank = 0.0 DaemonCoreDutyCycle = 0.0 DaemonLastReconfigTime = 1615756825 DaemonShutdown = time() - DaemonStartTime > 1500 DaemonStartTime = 1615756825 DetectedCpus = 8 DetectedMemory = 15661 Disk = 16190387 EnteredCurrentActivity = 1615756825 EnteredCurrentState = 1615756825 ExpectedMachineGracefulDrainingBadput = 0 ExpectedMachineGracefulDrainingCompletion = 1615756825 ExpectedMachineQuickDrainingBadput = 0 ExpectedMachineQuickDrainingCompletion = 1615756825 FileSystemDomain = "gthain.localdomain" HardwareAddress = "40:ec:99:82:52:b2" has_avx = true has_avx2 = true has_sse4_1 = true has_sse4_2 = true has_ssse3 = true HasFileTransfer = true HasIOProxy = true HasJICLocalConfig = true HasJICLocalStdin = true HasJobDeferral = true HasJobTransferPlugins = true HasMPI = true HasPerFileEncryption = true HasReconnect = true HasSelfCheckpointTransfers = true HasSingularity = true HasTDP = true HasTransferInputRemaps = true HasUserNamespaces = true HasVM = false HibernationLevel = 0 HibernationState = "NONE" HibernationSupportedStates = "S3,S4,S5" IsLocalStartd = false IsWakeAble = false IsWakeOnLanEnabled = false IsWakeOnLanSupported = false JobPreemptions = 0 JobRankPreemptions = 0 JobStarts = 0 JobUserPrioPreemptions = 0 KeyboardIdle = 0 LastBenchmark = 0 LastFetchWorkCompleted = 0 LastFetchWorkSpawned = 0 LastHeardFrom = 1615756825 LoadAvg = 0.0 Machine = "gthain.localdomain" MachineMaxVacateTime = 10 * 60 MachineResources = "Cpus Memory Disk Swap" MaxJobRetirementTime = 0 Memory = 1957 MonitorSelfAge = 1 MonitorSelfCPUUsage = 1.0 MonitorSelfImageSize = 26716 MonitorSelfRegisteredSocketCount = 0 MonitorSelfResidentSetSize = 12836 MonitorSelfSecuritySessions = 10 MonitorSelfTime = 1615756825 MyAddress = "<10.0.0.3:36347?addrs=10.0.0.3-36347&alias=gthain.localdomain&noUDP&sock=startd_888024_2e07>" MyCurrentTime = 1615756825 MyType = "Machine" Name = "[email protected]" NextFetchWorkDelay = -1 NumPids = 0 OpSys = "LINUX" OpSysAndVer = "Fedora33" OpSysLegacy = "LINUX" OpSysLongName = "Fedora release 33 (Thirty Three)" OpSysMajorVer = 33 OpSysName = "Fedora" OpSysShortName = "Fedora" OpSysVer = 3300 Rank = 0.0 RecentDaemonCoreDutyCycle = 0.0 RecentJobPreemptions = 0 RecentJobRankPreemptions = 0 RecentJobStarts = 0 RecentJobUserPrioPreemptions = 0 Requirements = START RetirementTimeRemaining = 0 SingularityVersion = "singularity version 3.7.1-1.fc33" SlotID = 6 SlotType = "Static" SlotTypeID = 0 SlotWeight = Cpus Start = true StartdIpAddr = "<10.0.0.3:36347?addrs=10.0.0.3-36347&alias=gthain.localdomain&noUDP&sock=startd_888024_2e07>" StarterAbilityList = "HasVM,HasMPI,HasFileTransfer,HasJobDeferral,HasSingularity,HasJobTransferPlugins,HasPerFileEncryption,HasReconnect,HasTDP,HasJICLocalStdin,HasTransferInputRemaps,HasSelfCheckpointTransfers,HasJICLocalConfig" State = "Unclaimed" SubnetMask = "255.255.255.0" TargetType = "Job" TimeToLive = 2147483647 TotalCondorLoadAvg = 0.0 TotalCpus = 8.0 TotalDisk = 129523096 TotalLoadAvg = 0.59 TotalMemory = 15661 TotalSlotCpus = 1 TotalSlotDisk = 16190387.0 TotalSlotMemory = 1957 TotalSlots = 8 TotalVirtualMemory = 28313600 UidDomain = "gthain.localdomain" Unhibernate = MY.MachineLastMatchTime =!= undefined UpdateSequenceNumber = 1 UpdatesHistory = "00000000000000000000000000000000" UpdatesLost = 0 UpdatesSequenced = 0 UpdatesTotal = 1 UtsnameMachine = "x86_64" UtsnameNodename = "gthain.localdomain" UtsnameRelease = "5.10.21-200.fc33.x86_64" UtsnameSysname = "Linux" UtsnameVersion = "#1 SMP Mon Mar 8 00:24:40 UTC 2021" VirtualMemory = 3539200 WakeOnLanEnabledFlags = "NONE" WakeOnLanSupportedFlags = "NONE" AcceptedWhileDraining = false Activity = "Idle" AddressV1 = "{[ p=\"primary\"; a=\"10.0.0.3\"; port=36347; n=\"Internet\"; alias=\"gthain.localdomain\"; spid=\"startd_888024_2e07\"; noUDP=true; ], [ p=\"IPv4\"; a=\"10.0.0.3\"; port=36347; n=\"Internet\"; alias=\"gthain.localdomain\"; spid=\"startd_888024_2e07\"; noUDP=true; ]}" Arch = "X86_64" AuthenticatedIdentity = "condor@family" AuthenticationMethod = "FAMILY" CanHibernate = true ClockDay = 0 ClockMin = 980 COLLECTOR_HOST_STRING = "gthain.localdomain:0" CondorLoadAvg = 0.0 CondorPlatform = "$CondorPlatform: X86_64-Fedora_33 $" CondorVersion = "$CondorVersion: 8.9.12 Mar 14 2021 BuildID: UW_development RC $" ConsoleIdle = 0 CpuBusy = ((LoadAvg - CondorLoadAvg) >= 0.5) CpuBusyTime = 0 CpuCacheSize = 8192 CpuFamily = 6 CpuIsBusy = false CpuModelNumber = 142 Cpus = 1 CurrentRank = 0.0 DaemonCoreDutyCycle = 0.0 DaemonLastReconfigTime = 1615756825 DaemonShutdown = time() - DaemonStartTime > 1500 DaemonStartTime = 1615756825 DetectedCpus = 8 DetectedMemory = 15661 Disk = 16190387 EnteredCurrentActivity = 1615756825 EnteredCurrentState = 1615756825 ExpectedMachineGracefulDrainingBadput = 0 ExpectedMachineGracefulDrainingCompletion = 1615756825 ExpectedMachineQuickDrainingBadput = 0 ExpectedMachineQuickDrainingCompletion = 1615756825 FileSystemDomain = "gthain.localdomain" HardwareAddress = "40:ec:99:82:52:b2" has_avx = true has_avx2 = true has_sse4_1 = true has_sse4_2 = true has_ssse3 = true HasFileTransfer = true HasIOProxy = true HasJICLocalConfig = true HasJICLocalStdin = true HasJobDeferral = true HasJobTransferPlugins = true HasMPI = true HasPerFileEncryption = true HasReconnect = true HasSelfCheckpointTransfers = true HasSingularity = true HasTDP = true HasTransferInputRemaps = true HasUserNamespaces = true HasVM = false HibernationLevel = 0 HibernationState = "NONE" HibernationSupportedStates = "S3,S4,S5" IsLocalStartd = false IsWakeAble = false IsWakeOnLanEnabled = false IsWakeOnLanSupported = false JobPreemptions = 0 JobRankPreemptions = 0 JobStarts = 0 JobUserPrioPreemptions = 0 KeyboardIdle = 0 LastBenchmark = 0 LastFetchWorkCompleted = 0 LastFetchWorkSpawned = 0 LastHeardFrom = 1615756825 LoadAvg = 0.0 Machine = "gthain.localdomain" MachineMaxVacateTime = 10 * 60 MachineResources = "Cpus Memory Disk Swap" MaxJobRetirementTime = 0 Memory = 1957 MonitorSelfAge = 1 MonitorSelfCPUUsage = 1.0 MonitorSelfImageSize = 26716 MonitorSelfRegisteredSocketCount = 0 MonitorSelfResidentSetSize = 12836 MonitorSelfSecuritySessions = 10 MonitorSelfTime = 1615756825 MyAddress = "<10.0.0.3:36347?addrs=10.0.0.3-36347&alias=gthain.localdomain&noUDP&sock=startd_888024_2e07>" MyCurrentTime = 1615756825 MyType = "Machine" Name = "[email protected]" NextFetchWorkDelay = -1 NumPids = 0 OpSys = "LINUX" OpSysAndVer = "Fedora33" OpSysLegacy = "LINUX" OpSysLongName = "Fedora release 33 (Thirty Three)" OpSysMajorVer = 33 OpSysName = "Fedora" OpSysShortName = "Fedora" OpSysVer = 3300 Rank = 0.0 RecentDaemonCoreDutyCycle = 0.0 RecentJobPreemptions = 0 RecentJobRankPreemptions = 0 RecentJobStarts = 0 RecentJobUserPrioPreemptions = 0 Requirements = START RetirementTimeRemaining = 0 SingularityVersion = "singularity version 3.7.1-1.fc33" SlotID = 7 SlotType = "Static" SlotTypeID = 0 SlotWeight = Cpus Start = true StartdIpAddr = "<10.0.0.3:36347?addrs=10.0.0.3-36347&alias=gthain.localdomain&noUDP&sock=startd_888024_2e07>" StarterAbilityList = "HasVM,HasMPI,HasFileTransfer,HasJobDeferral,HasSingularity,HasJobTransferPlugins,HasPerFileEncryption,HasReconnect,HasTDP,HasJICLocalStdin,HasTransferInputRemaps,HasSelfCheckpointTransfers,HasJICLocalConfig" State = "Unclaimed" SubnetMask = "255.255.255.0" TargetType = "Job" TimeToLive = 2147483647 TotalCondorLoadAvg = 0.0 TotalCpus = 8.0 TotalDisk = 129523096 TotalLoadAvg = 0.59 TotalMemory = 15661 TotalSlotCpus = 1 TotalSlotDisk = 16190387.0 TotalSlotMemory = 1957 TotalSlots = 8 TotalVirtualMemory = 28313600 UidDomain = "gthain.localdomain" Unhibernate = MY.MachineLastMatchTime =!= undefined UpdateSequenceNumber = 1 UpdatesHistory = "00000000000000000000000000000000" UpdatesLost = 0 UpdatesSequenced = 0 UpdatesTotal = 1 UtsnameMachine = "x86_64" UtsnameNodename = "gthain.localdomain" UtsnameRelease = "5.10.21-200.fc33.x86_64" UtsnameSysname = "Linux" UtsnameVersion = "#1 SMP Mon Mar 8 00:24:40 UTC 2021" VirtualMemory = 3539200 WakeOnLanEnabledFlags = "NONE" WakeOnLanSupportedFlags = "NONE" AcceptedWhileDraining = false Activity = "Idle" AddressV1 = "{[ p=\"primary\"; a=\"10.0.0.3\"; port=36347; n=\"Internet\"; alias=\"gthain.localdomain\"; spid=\"startd_888024_2e07\"; noUDP=true; ], [ p=\"IPv4\"; a=\"10.0.0.3\"; port=36347; n=\"Internet\"; alias=\"gthain.localdomain\"; spid=\"startd_888024_2e07\"; noUDP=true; ]}" Arch = "X86_64" AuthenticatedIdentity = "condor@family" AuthenticationMethod = "FAMILY" CanHibernate = true ClockDay = 0 ClockMin = 980 COLLECTOR_HOST_STRING = "gthain.localdomain:0" CondorLoadAvg = 0.0 CondorPlatform = "$CondorPlatform: X86_64-Fedora_33 $" CondorVersion = "$CondorVersion: 8.9.12 Mar 14 2021 BuildID: UW_development RC $" ConsoleIdle = 0 CpuBusy = ((LoadAvg - CondorLoadAvg) >= 0.5) CpuBusyTime = 0 CpuCacheSize = 8192 CpuFamily = 6 CpuIsBusy = false CpuModelNumber = 142 Cpus = 1 CurrentRank = 0.0 DaemonCoreDutyCycle = 0.0 DaemonLastReconfigTime = 1615756825 DaemonShutdown = time() - DaemonStartTime > 1500 DaemonStartTime = 1615756825 DetectedCpus = 8 DetectedMemory = 15661 Disk = 16190387 EnteredCurrentActivity = 1615756825 EnteredCurrentState = 1615756825 ExpectedMachineGracefulDrainingBadput = 0 ExpectedMachineGracefulDrainingCompletion = 1615756825 ExpectedMachineQuickDrainingBadput = 0 ExpectedMachineQuickDrainingCompletion = 1615756825 FileSystemDomain = "gthain.localdomain" HardwareAddress = "40:ec:99:82:52:b2" has_avx = true has_avx2 = true has_sse4_1 = true has_sse4_2 = true has_ssse3 = true HasFileTransfer = true HasIOProxy = true HasJICLocalConfig = true HasJICLocalStdin = true HasJobDeferral = true HasJobTransferPlugins = true HasMPI = true HasPerFileEncryption = true HasReconnect = true HasSelfCheckpointTransfers = true HasSingularity = true HasTDP = true HasTransferInputRemaps = true HasUserNamespaces = true HasVM = false HibernationLevel = 0 HibernationState = "NONE" HibernationSupportedStates = "S3,S4,S5" IsLocalStartd = false IsWakeAble = false IsWakeOnLanEnabled = false IsWakeOnLanSupported = false JobPreemptions = 0 JobRankPreemptions = 0 JobStarts = 0 JobUserPrioPreemptions = 0 KeyboardIdle = 0 LastBenchmark = 0 LastFetchWorkCompleted = 0 LastFetchWorkSpawned = 0 LastHeardFrom = 1615756825 LoadAvg = 0.0 Machine = "gthain.localdomain" MachineMaxVacateTime = 10 * 60 MachineResources = "Cpus Memory Disk Swap" MaxJobRetirementTime = 0 Memory = 1957 MonitorSelfAge = 1 MonitorSelfCPUUsage = 1.0 MonitorSelfImageSize = 26716 MonitorSelfRegisteredSocketCount = 0 MonitorSelfResidentSetSize = 12836 MonitorSelfSecuritySessions = 10 MonitorSelfTime = 1615756825 MyAddress = "<10.0.0.3:36347?addrs=10.0.0.3-36347&alias=gthain.localdomain&noUDP&sock=startd_888024_2e07>" MyCurrentTime = 1615756825 MyType = "Machine" Name = "[email protected]" NextFetchWorkDelay = -1 NumPids = 0 OpSys = "LINUX" OpSysAndVer = "Fedora33" OpSysLegacy = "LINUX" OpSysLongName = "Fedora release 33 (Thirty Three)" OpSysMajorVer = 33 OpSysName = "Fedora" OpSysShortName = "Fedora" OpSysVer = 3300 Rank = 0.0 RecentDaemonCoreDutyCycle = 0.0 RecentJobPreemptions = 0 RecentJobRankPreemptions = 0 RecentJobStarts = 0 RecentJobUserPrioPreemptions = 0 Requirements = START RetirementTimeRemaining = 0 SingularityVersion = "singularity version 3.7.1-1.fc33" SlotID = 8 SlotType = "Static" SlotTypeID = 0 SlotWeight = Cpus Start = true StartdIpAddr = "<10.0.0.3:36347?addrs=10.0.0.3-36347&alias=gthain.localdomain&noUDP&sock=startd_888024_2e07>" StarterAbilityList = "HasVM,HasMPI,HasFileTransfer,HasJobDeferral,HasSingularity,HasJobTransferPlugins,HasPerFileEncryption,HasReconnect,HasTDP,HasJICLocalStdin,HasTransferInputRemaps,HasSelfCheckpointTransfers,HasJICLocalConfig" State = "Unclaimed" SubnetMask = "255.255.255.0" TargetType = "Job" TimeToLive = 2147483647 TotalCondorLoadAvg = 0.0 TotalCpus = 8.0 TotalDisk = 129523096 TotalLoadAvg = 0.59 TotalMemory = 15661 TotalSlotCpus = 1 TotalSlotDisk = 16190387.0 TotalSlotMemory = 1957 TotalSlots = 8 TotalVirtualMemory = 28313600 UidDomain = "gthain.localdomain" Unhibernate = MY.MachineLastMatchTime =!= undefined UpdateSequenceNumber = 1 UpdatesHistory = "00000000000000000000000000000000" UpdatesLost = 0 UpdatesSequenced = 0 UpdatesTotal = 1 UtsnameMachine = "x86_64" UtsnameNodename = "gthain.localdomain" UtsnameRelease = "5.10.21-200.fc33.x86_64" UtsnameSysname = "Linux" UtsnameVersion = "#1 SMP Mon Mar 8 00:24:40 UTC 2021" VirtualMemory = 3539200 WakeOnLanEnabledFlags = "NONE" WakeOnLanSupportedFlags = "NONE"

30.392123

281

0.79365

1ac0f0b272dd4fc6dbdf3538b56e6455f458380f

15,414

adb

Ada

hls_cmd_line_testing/cmd_line_proj/hls_sin_proj/solution1/.autopilot/db/p_source_files_sr.adb

benjmarshall/hls_scratchpad

d57b22ac4cca28b8b331150feb4d1f9c0697d6ff

[ "MIT" ]

1

2017-11-17T00:25:21.000Z

hls_cmd_line_testing/hls_gui_proj/hls_sin_proj/solution1/.autopilot/db/p_source_files_sr.adb

benjmarshall/hls_scratchpad

d57b22ac4cca28b8b331150feb4d1f9c0697d6ff

[ "MIT" ]

null

hls_cmd_line_testing/hls_gui_proj/hls_sin_proj/solution1/.autopilot/db/p_source_files_sr.adb

benjmarshall/hls_scratchpad

d57b22ac4cca28b8b331150feb4d1f9c0697d6ff

[ "MIT" ]

null

<?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="14"> <syndb class_id="0" tracking_level="0" version="0"> <userIPLatency>-1</userIPLatency> <userIPName/> <cdfg class_id="1" tracking_level="1" version="0" object_id="_0"> <name>p_source_files_sr</name> <ret_bitwidth>64</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="3" tracking_level="1" version="0" object_id="_1"> <Value class_id="4" tracking_level="0" version="0"> <Obj class_id="5" tracking_level="0" version="0"> <type>1</type> <id>1</id> <name>p_read</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>64</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs class_id="7" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> </ports> <nodes class_id="8" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_2"> <Value> <Obj> <type>0</type> <id>2</id> <name>p_read_1</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> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>6</item> <item>7</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_3"> <Value> <Obj> <type>0</type> <id>3</id> <name/> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>8</item> </oprand_edges> <opcode>ret</opcode> <m_Display>0</m_Display> </item> </nodes> <consts class_id="11" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </consts> <blocks class_id="12" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="13" tracking_level="1" version="0" object_id="_4"> <Obj> <type>3</type> <id>4</id> <name>__../source_files/sr</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>2</item> <item>3</item> </node_objs> </item> </blocks> <edges class_id="14" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="15" tracking_level="1" version="0" object_id="_5"> <id>7</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>2</sink_obj> </item> <item class_id_reference="15" object_id="_6"> <id>8</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>3</sink_obj> </item> </edges> </cdfg> <cdfg_regions class_id="16" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="17" tracking_level="1" version="0" object_id="_7"> <mId>1</mId> <mTag>__../source_files/sr</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>4</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> </cdfg_regions> <fsm class_id="19" tracking_level="1" version="0" object_id="_8"> <states class_id="20" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="21" tracking_level="1" version="0" object_id="_9"> <id>1</id> <operations class_id="22" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="23" tracking_level="1" version="0" object_id="_10"> <id>2</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="23" object_id="_11"> <id>3</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> </states> <transitions class_id="24" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </transitions> </fsm> <res class_id="25" tracking_level="1" version="0" object_id="_12"> <dp_component_resource class_id="26" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_component_resource> <dp_expression_resource> <count>1</count> <item_version>0</item_version> <item class_id="27" tracking_level="0" version="0"> <first>ap_block_state1 ( or ) </first> <second class_id="28" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="29" tracking_level="0" version="0"> <first>(0P0)</first> <second>1</second> </item> <item> <first>(1P1)</first> <second>1</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>2</second> </item> </second> </item> </dp_expression_resource> <dp_fifo_resource> <count>0</count> <item_version>0</item_version> </dp_fifo_resource> <dp_memory_resource> <count>0</count> <item_version>0</item_version> </dp_memory_resource> <dp_multiplexer_resource> <count>2</count> <item_version>0</item_version> <item> <first>ap_done</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_return</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>64</second> </item> <item> <first>(2Count)</first> <second>128</second> </item> <item> <first>LUT</first> <second>9</second> </item> </second> </item> </dp_multiplexer_resource> <dp_register_resource> <count>3</count> <item_version>0</item_version> <item> <first>ap_CS_fsm</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>1</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>1</second> </item> </second> </item> <item> <first>ap_done_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>ap_return_preg</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>64</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>64</second> </item> </second> </item> </dp_register_resource> <dp_component_map class_id="30" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_component_map> <dp_expression_map> <count>0</count> <item_version>0</item_version> </dp_expression_map> <dp_fifo_map> <count>0</count> <item_version>0</item_version> </dp_fifo_map> <dp_memory_map> <count>0</count> <item_version>0</item_version> </dp_memory_map> </res> <node_label_latency class_id="31" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="32" tracking_level="0" version="0"> <first>2</first> <second class_id="33" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>3</first> <second> <first>0</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="34" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="35" tracking_level="0" version="0"> <first>4</first> <second class_id="36" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> </bblk_ent_exit> <regions class_id="37" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </regions> <dp_fu_nodes class_id="38" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="39" tracking_level="0" version="0"> <first>4</first> <second> <count>1</count> <item_version>0</item_version> <item>2</item> </second> </item> </dp_fu_nodes> <dp_fu_nodes_expression class_id="41" 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>1</count> <item_version>0</item_version> <item class_id="42" tracking_level="0" version="0"> <first>p_read_1_read_fu_4</first> <second> <count>1</count> <item_version>0</item_version> <item>2</item> </second> </item> </dp_fu_nodes_io> <return_ports> <count>1</count> <item_version>0</item_version> <item> <first>ap_return</first> <second> <count>1</count> <item_version>0</item_version> <item>3</item> </second> </item> </return_ports> <dp_mem_port_nodes class_id="43" 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="44" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="45" tracking_level="0" version="0"> <first>p_read</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>2</item> </second> </item> </second> </item> </dp_port_io_nodes> <port2core class_id="46" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </port2core> <node2core> <count>0</count> <item_version>0</item_version> </node2core> </syndb> </boost_serialization>

30.88978

79

0.4976

c76cb716fb6c5ba65139c1988bd270303a61ab8a

265

ads

Ada

source/hash/a-stboha.ads

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

33

2015-04-04T09:19:36.000Z

2021-11-10T05:33:34.000Z

source/hash/a-stboha.ads

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

8

2017-11-14T13:05:07.000Z

2018-08-09T15:28:49.000Z

source/hash/a-stboha.ads

ytomino/drake

4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2

[ "MIT" ]

9

2015-02-03T17:09:53.000Z

2021-11-12T01:16:05.000Z

pragma License (Unrestricted); with Ada.Containers; generic with package Bounded is new Generic_Bounded_Length (<>); function Ada.Strings.Bounded.Hash (Key : Bounded.Bounded_String) return Containers.Hash_Type; pragma Preelaborate (Ada.Strings.Bounded.Hash);

33.125

64

0.796226

ad4fce3bea44bc3423464f7c14f6968a8874cc6b

4,695

ads

Ada

tools/configure/configure-tests-firebird.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

tools/configure/configure-tests-firebird.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

tools/configure/configure-tests-firebird.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 -- -- -- -- Tools 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: 2359 $ $Date: 2011-12-27 10:20:56 +0200 (Вт, 27 дек 2011) $ ------------------------------------------------------------------------------ -- This test detects parameters to link with PostgreSQL client library. -- -- It sets following substitutions variables: -- - HAS_FIREBIRD -- - FIREBIRD_LIBRARY_OPTIONS ------------------------------------------------------------------------------ with Configure.Abstract_Tests; private with Configure.Component_Switches; package Configure.Tests.Firebird is type Firebird_Test is new Configure.Abstract_Tests.Abstract_Test with private; overriding function Name (Self : Firebird_Test) return String; -- Returns name of the test to be used in reports. overriding function Help (Self : Firebird_Test) return Unbounded_String_Vector; -- Returns help information for test. overriding procedure Execute (Self : in out Firebird_Test; Arguments : in out Unbounded_String_Vector); -- Executes test's actions. All used arguments must be removed from -- Arguments. private type Firebird_Test is new Configure.Abstract_Tests.Abstract_Test with record Switches : Configure.Component_Switches.Component_Switches := Configure.Component_Switches.Create (Name => "firebird", Description => "Firebird support", Libdir_Enabled => True); end record; end Configure.Tests.Firebird;

56.566265

78

0.47476

2e8459e33ea484b0553659268f3163640f2f0fda

281,736

adb

Ada

llvm-gcc-4.2-2.9/gcc/ada/sem_res.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

llvm-gcc-4.2-2.9/gcc/ada/sem_res.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

llvm-gcc-4.2-2.9/gcc/ada/sem_res.adb

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S E M _ R E S -- -- -- -- 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. -- -- -- ------------------------------------------------------------------------------ with Atree; use Atree; with Checks; use Checks; with Debug; use Debug; with Debug_A; use Debug_A; with Einfo; use Einfo; with Errout; use Errout; with Expander; use Expander; with Exp_Disp; use Exp_Disp; with Exp_Ch7; use Exp_Ch7; with Exp_Tss; use Exp_Tss; with Exp_Util; use Exp_Util; with Freeze; use Freeze; with Itypes; use Itypes; with Lib; use Lib; with Lib.Xref; use Lib.Xref; with Namet; use Namet; with Nmake; use Nmake; with Nlists; use Nlists; with Opt; use Opt; with Output; use Output; with Restrict; use Restrict; with Rident; use Rident; with Rtsfind; use Rtsfind; with Sem; use Sem; with Sem_Aggr; use Sem_Aggr; with Sem_Attr; use Sem_Attr; with Sem_Cat; use Sem_Cat; with Sem_Ch4; use Sem_Ch4; with Sem_Ch6; use Sem_Ch6; with Sem_Ch8; use Sem_Ch8; 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_Intr; use Sem_Intr; with Sem_Util; use Sem_Util; with Sem_Type; use Sem_Type; with Sem_Warn; use Sem_Warn; with Sinfo; use Sinfo; with Snames; use Snames; with Stand; use Stand; with Stringt; use Stringt; with Targparm; use Targparm; with Tbuild; use Tbuild; with Uintp; use Uintp; with Urealp; use Urealp; package body Sem_Res is ----------------------- -- Local Subprograms -- ----------------------- -- Second pass (top-down) type checking and overload resolution procedures -- Typ is the type required by context. These procedures propagate the -- type information recursively to the descendants of N. If the node -- is not overloaded, its Etype is established in the first pass. If -- overloaded, the Resolve routines set the correct type. For arith. -- operators, the Etype is the base type of the context. -- Note that Resolve_Attribute is separated off in Sem_Attr procedure Ambiguous_Character (C : Node_Id); -- Give list of candidate interpretations when a character literal cannot -- be resolved. procedure Check_Discriminant_Use (N : Node_Id); -- Enforce the restrictions on the use of discriminants when constraining -- a component of a discriminated type (record or concurrent type). procedure Check_For_Visible_Operator (N : Node_Id; T : Entity_Id); -- Given a node for an operator associated with type T, check that -- the operator is visible. Operators all of whose operands are -- universal must be checked for visibility during resolution -- because their type is not determinable based on their operands. procedure Check_Fully_Declared_Prefix (Typ : Entity_Id; Pref : Node_Id); -- Check that the type of the prefix of a dereference is not incomplete function Check_Infinite_Recursion (N : Node_Id) return Boolean; -- Given a call node, N, which is known to occur immediately within the -- subprogram being called, determines whether it is a detectable case of -- an infinite recursion, and if so, outputs appropriate messages. Returns -- True if an infinite recursion is detected, and False otherwise. procedure Check_Initialization_Call (N : Entity_Id; Nam : Entity_Id); -- If the type of the object being initialized uses the secondary stack -- directly or indirectly, create a transient scope for the call to the -- init proc. This is because we do not create transient scopes for the -- initialization of individual components within the init proc itself. -- Could be optimized away perhaps? function Is_Predefined_Op (Nam : Entity_Id) return Boolean; -- Utility to check whether the name in the call is a predefined -- operator, in which case the call is made into an operator node. -- An instance of an intrinsic conversion operation may be given -- an operator name, but is not treated like an operator. procedure Replace_Actual_Discriminants (N : Node_Id; Default : Node_Id); -- If a default expression in entry call N depends on the discriminants -- of the task, it must be replaced with a reference to the discriminant -- of the task being called. procedure Resolve_Allocator (N : Node_Id; Typ : Entity_Id); procedure Resolve_Arithmetic_Op (N : Node_Id; Typ : Entity_Id); procedure Resolve_Call (N : Node_Id; Typ : Entity_Id); procedure Resolve_Character_Literal (N : Node_Id; Typ : Entity_Id); procedure Resolve_Comparison_Op (N : Node_Id; Typ : Entity_Id); procedure Resolve_Conditional_Expression (N : Node_Id; Typ : Entity_Id); procedure Resolve_Equality_Op (N : Node_Id; Typ : Entity_Id); procedure Resolve_Explicit_Dereference (N : Node_Id; Typ : Entity_Id); procedure Resolve_Entity_Name (N : Node_Id; Typ : Entity_Id); procedure Resolve_Indexed_Component (N : Node_Id; Typ : Entity_Id); procedure Resolve_Integer_Literal (N : Node_Id; Typ : Entity_Id); procedure Resolve_Logical_Op (N : Node_Id; Typ : Entity_Id); procedure Resolve_Membership_Op (N : Node_Id; Typ : Entity_Id); procedure Resolve_Null (N : Node_Id; Typ : Entity_Id); procedure Resolve_Operator_Symbol (N : Node_Id; Typ : Entity_Id); procedure Resolve_Op_Concat (N : Node_Id; Typ : Entity_Id); procedure Resolve_Op_Expon (N : Node_Id; Typ : Entity_Id); procedure Resolve_Op_Not (N : Node_Id; Typ : Entity_Id); procedure Resolve_Qualified_Expression (N : Node_Id; Typ : Entity_Id); procedure Resolve_Range (N : Node_Id; Typ : Entity_Id); procedure Resolve_Real_Literal (N : Node_Id; Typ : Entity_Id); procedure Resolve_Reference (N : Node_Id; Typ : Entity_Id); procedure Resolve_Selected_Component (N : Node_Id; Typ : Entity_Id); procedure Resolve_Shift (N : Node_Id; Typ : Entity_Id); procedure Resolve_Short_Circuit (N : Node_Id; Typ : Entity_Id); procedure Resolve_Slice (N : Node_Id; Typ : Entity_Id); procedure Resolve_String_Literal (N : Node_Id; Typ : Entity_Id); procedure Resolve_Subprogram_Info (N : Node_Id; Typ : Entity_Id); procedure Resolve_Type_Conversion (N : Node_Id; Typ : Entity_Id); procedure Resolve_Unary_Op (N : Node_Id; Typ : Entity_Id); procedure Resolve_Unchecked_Expression (N : Node_Id; Typ : Entity_Id); procedure Resolve_Unchecked_Type_Conversion (N : Node_Id; Typ : Entity_Id); function Operator_Kind (Op_Name : Name_Id; Is_Binary : Boolean) return Node_Kind; -- Utility to map the name of an operator into the corresponding Node. Used -- by other node rewriting procedures. procedure Resolve_Actuals (N : Node_Id; Nam : Entity_Id); -- Resolve actuals of call, and add default expressions for missing ones. -- N is the Node_Id for the subprogram call, and Nam is the entity of the -- called subprogram. procedure Resolve_Entry_Call (N : Node_Id; Typ : Entity_Id); -- Called from Resolve_Call, when the prefix denotes an entry or element -- of entry family. Actuals are resolved as for subprograms, and the node -- is rebuilt as an entry call. Also called for protected operations. Typ -- is the context type, which is used when the operation is a protected -- function with no arguments, and the return value is indexed. procedure Resolve_Intrinsic_Operator (N : Node_Id; Typ : Entity_Id); -- A call to a user-defined intrinsic operator is rewritten as a call -- to the corresponding predefined operator, with suitable conversions. procedure Resolve_Intrinsic_Unary_Operator (N : Node_Id; Typ : Entity_Id); -- Ditto, for unary operators (only arithmetic ones) procedure Rewrite_Operator_As_Call (N : Node_Id; Nam : Entity_Id); -- If an operator node resolves to a call to a user-defined operator, -- rewrite the node as a function call. procedure Make_Call_Into_Operator (N : Node_Id; Typ : Entity_Id; Op_Id : Entity_Id); -- Inverse transformation: if an operator is given in functional notation, -- then after resolving the node, transform into an operator node, so -- that operands are resolved properly. Recall that predefined operators -- do not have a full signature and special resolution rules apply. procedure Rewrite_Renamed_Operator (N : Node_Id; Op : Entity_Id; Typ : Entity_Id); -- An operator can rename another, e.g. in an instantiation. In that -- case, the proper operator node must be constructed and resolved. procedure Set_String_Literal_Subtype (N : Node_Id; Typ : Entity_Id); -- The String_Literal_Subtype is built for all strings that are not -- operands of a static concatenation operation. If the argument is -- not a N_String_Literal node, then the call has no effect. procedure Set_Slice_Subtype (N : Node_Id); -- Build subtype of array type, with the range specified by the slice function Unique_Fixed_Point_Type (N : Node_Id) return Entity_Id; -- A universal_fixed expression in an universal context is unambiguous -- if there is only one applicable fixed point type. Determining whether -- there is only one requires a search over all visible entities, and -- happens only in very pathological cases (see 6115-006). function Valid_Conversion (N : Node_Id; Target : Entity_Id; Operand : Node_Id) return Boolean; -- Verify legality rules given in 4.6 (8-23). Target is the target -- type of the conversion, which may be an implicit conversion of -- an actual parameter to an anonymous access type (in which case -- N denotes the actual parameter and N = Operand). ------------------------- -- Ambiguous_Character -- ------------------------- procedure Ambiguous_Character (C : Node_Id) is E : Entity_Id; begin if Nkind (C) = N_Character_Literal then Error_Msg_N ("ambiguous character literal", C); Error_Msg_N ("\possible interpretations: Character, Wide_Character!", C); E := Current_Entity (C); while Present (E) loop Error_Msg_NE ("\possible interpretation:}!", C, Etype (E)); E := Homonym (E); end loop; end if; end Ambiguous_Character; ------------------------- -- Analyze_And_Resolve -- ------------------------- procedure Analyze_And_Resolve (N : Node_Id) is begin Analyze (N); Resolve (N); end Analyze_And_Resolve; procedure Analyze_And_Resolve (N : Node_Id; Typ : Entity_Id) is begin Analyze (N); Resolve (N, Typ); end Analyze_And_Resolve; -- Version withs check(s) suppressed procedure Analyze_And_Resolve (N : Node_Id; Typ : Entity_Id; Suppress : Check_Id) is Scop : constant Entity_Id := Current_Scope; begin if Suppress = All_Checks then declare Svg : constant Suppress_Array := Scope_Suppress; begin Scope_Suppress := (others => True); Analyze_And_Resolve (N, Typ); Scope_Suppress := Svg; end; else declare Svg : constant Boolean := Scope_Suppress (Suppress); begin Scope_Suppress (Suppress) := True; Analyze_And_Resolve (N, Typ); Scope_Suppress (Suppress) := Svg; end; end if; if Current_Scope /= Scop and then Scope_Is_Transient then -- This can only happen if a transient scope was created -- for an inner expression, which will be removed upon -- completion of the analysis of an enclosing construct. -- The transient scope must have the suppress status of -- the enclosing environment, not of this Analyze call. Scope_Stack.Table (Scope_Stack.Last).Save_Scope_Suppress := Scope_Suppress; end if; end Analyze_And_Resolve; procedure Analyze_And_Resolve (N : Node_Id; Suppress : Check_Id) is Scop : constant Entity_Id := Current_Scope; begin if Suppress = All_Checks then declare Svg : constant Suppress_Array := Scope_Suppress; begin Scope_Suppress := (others => True); Analyze_And_Resolve (N); Scope_Suppress := Svg; end; else declare Svg : constant Boolean := Scope_Suppress (Suppress); begin Scope_Suppress (Suppress) := True; Analyze_And_Resolve (N); Scope_Suppress (Suppress) := Svg; end; end if; if Current_Scope /= Scop and then Scope_Is_Transient then Scope_Stack.Table (Scope_Stack.Last).Save_Scope_Suppress := Scope_Suppress; end if; end Analyze_And_Resolve; ---------------------------- -- Check_Discriminant_Use -- ---------------------------- procedure Check_Discriminant_Use (N : Node_Id) is PN : constant Node_Id := Parent (N); Disc : constant Entity_Id := Entity (N); P : Node_Id; D : Node_Id; begin -- Any use in a default expression is legal if In_Default_Expression then null; elsif Nkind (PN) = N_Range then -- Discriminant cannot be used to constrain a scalar type P := Parent (PN); if Nkind (P) = N_Range_Constraint and then Nkind (Parent (P)) = N_Subtype_Indication and then Nkind (Parent (Parent (P))) = N_Component_Definition then Error_Msg_N ("discriminant cannot constrain scalar type", N); elsif Nkind (P) = N_Index_Or_Discriminant_Constraint then -- The following check catches the unusual case where -- a discriminant appears within an index constraint -- that is part of a larger expression within a constraint -- on a component, e.g. "C : Int range 1 .. F (new A(1 .. D))". -- For now we only check case of record components, and -- note that a similar check should also apply in the -- case of discriminant constraints below. ??? -- Note that the check for N_Subtype_Declaration below is to -- detect the valid use of discriminants in the constraints of a -- subtype declaration when this subtype declaration appears -- inside the scope of a record type (which is syntactically -- illegal, but which may be created as part of derived type -- processing for records). See Sem_Ch3.Build_Derived_Record_Type -- for more info. if Ekind (Current_Scope) = E_Record_Type and then Scope (Disc) = Current_Scope and then not (Nkind (Parent (P)) = N_Subtype_Indication and then (Nkind (Parent (Parent (P))) = N_Component_Definition or else Nkind (Parent (Parent (P))) = N_Subtype_Declaration) and then Paren_Count (N) = 0) then Error_Msg_N ("discriminant must appear alone in component constraint", N); return; end if; -- Detect a common beginner error: -- type R (D : Positive := 100) is record -- Name : String (1 .. D); -- end record; -- The default value causes an object of type R to be -- allocated with room for Positive'Last characters. declare SI : Node_Id; T : Entity_Id; TB : Node_Id; CB : Entity_Id; function Large_Storage_Type (T : Entity_Id) return Boolean; -- Return True if type T has a large enough range that -- any array whose index type covered the whole range of -- the type would likely raise Storage_Error. ------------------------ -- Large_Storage_Type -- ------------------------ function Large_Storage_Type (T : Entity_Id) return Boolean is begin return T = Standard_Integer or else T = Standard_Positive or else T = Standard_Natural; end Large_Storage_Type; begin -- Check that the Disc has a large range if not Large_Storage_Type (Etype (Disc)) then goto No_Danger; end if; -- If the enclosing type is limited, we allocate only the -- default value, not the maximum, and there is no need for -- a warning. if Is_Limited_Type (Scope (Disc)) then goto No_Danger; end if; -- Check that it is the high bound if N /= High_Bound (PN) or else No (Discriminant_Default_Value (Disc)) then goto No_Danger; end if; -- Check the array allows a large range at this bound. -- First find the array SI := Parent (P); if Nkind (SI) /= N_Subtype_Indication then goto No_Danger; end if; T := Entity (Subtype_Mark (SI)); if not Is_Array_Type (T) then goto No_Danger; end if; -- Next, find the dimension TB := First_Index (T); CB := First (Constraints (P)); while True and then Present (TB) and then Present (CB) and then CB /= PN loop Next_Index (TB); Next (CB); end loop; if CB /= PN then goto No_Danger; end if; -- Now, check the dimension has a large range if not Large_Storage_Type (Etype (TB)) then goto No_Danger; end if; -- Warn about the danger Error_Msg_N ("creation of & object may raise Storage_Error?", Scope (Disc)); <<No_Danger>> null; end; end if; -- Legal case is in index or discriminant constraint elsif Nkind (PN) = N_Index_Or_Discriminant_Constraint or else Nkind (PN) = N_Discriminant_Association then if Paren_Count (N) > 0 then Error_Msg_N ("discriminant in constraint must appear alone", N); elsif Nkind (N) = N_Expanded_Name and then Comes_From_Source (N) then Error_Msg_N ("discriminant must appear alone as a direct name", N); end if; return; -- Otherwise, context is an expression. It should not be within -- (i.e. a subexpression of) a constraint for a component. else D := PN; P := Parent (PN); while Nkind (P) /= N_Component_Declaration and then Nkind (P) /= N_Subtype_Indication and then Nkind (P) /= N_Entry_Declaration loop D := P; P := Parent (P); exit when No (P); end loop; -- If the discriminant is used in an expression that is a bound -- of a scalar type, an Itype is created and the bounds are attached -- to its range, not to the original subtype indication. Such use -- is of course a double fault. if (Nkind (P) = N_Subtype_Indication and then (Nkind (Parent (P)) = N_Component_Definition or else Nkind (Parent (P)) = N_Derived_Type_Definition) and then D = Constraint (P)) -- The constraint itself may be given by a subtype indication, -- rather than by a more common discrete range. or else (Nkind (P) = N_Subtype_Indication and then Nkind (Parent (P)) = N_Index_Or_Discriminant_Constraint) or else Nkind (P) = N_Entry_Declaration or else Nkind (D) = N_Defining_Identifier then Error_Msg_N ("discriminant in constraint must appear alone", N); end if; end if; end Check_Discriminant_Use; -------------------------------- -- Check_For_Visible_Operator -- -------------------------------- procedure Check_For_Visible_Operator (N : Node_Id; T : Entity_Id) is begin if Is_Invisible_Operator (N, T) then Error_Msg_NE ("operator for} is not directly visible!", N, First_Subtype (T)); Error_Msg_N ("use clause would make operation legal!", N); end if; end Check_For_Visible_Operator; ---------------------------------- -- Check_Fully_Declared_Prefix -- ---------------------------------- procedure Check_Fully_Declared_Prefix (Typ : Entity_Id; Pref : Node_Id) is begin -- Check that the designated type of the prefix of a dereference is -- not an incomplete type. This cannot be done unconditionally, because -- dereferences of private types are legal in default expressions. This -- case is taken care of in Check_Fully_Declared, called below. There -- are also 2005 cases where it is legal for the prefix to be unfrozen. -- This consideration also applies to similar checks for allocators, -- qualified expressions, and type conversions. -- An additional exception concerns other per-object expressions that -- are not directly related to component declarations, in particular -- representation pragmas for tasks. These will be per-object -- expressions if they depend on discriminants or some global entity. -- If the task has access discriminants, the designated type may be -- incomplete at the point the expression is resolved. This resolution -- takes place within the body of the initialization procedure, where -- the discriminant is replaced by its discriminal. if Is_Entity_Name (Pref) and then Ekind (Entity (Pref)) = E_In_Parameter then null; -- Ada 2005 (AI-326): Tagged incomplete types allowed. The wrong usages -- are handled by Analyze_Access_Attribute, Analyze_Assignment, -- Analyze_Object_Renaming, and Freeze_Entity. elsif Ada_Version >= Ada_05 and then Is_Entity_Name (Pref) and then Ekind (Directly_Designated_Type (Etype (Pref))) = E_Incomplete_Type and then Is_Tagged_Type (Directly_Designated_Type (Etype (Pref))) then null; else Check_Fully_Declared (Typ, Parent (Pref)); end if; end Check_Fully_Declared_Prefix; ------------------------------ -- Check_Infinite_Recursion -- ------------------------------ function Check_Infinite_Recursion (N : Node_Id) return Boolean is P : Node_Id; C : Node_Id; function Same_Argument_List return Boolean; -- Check whether list of actuals is identical to list of formals -- of called function (which is also the enclosing scope). ------------------------ -- Same_Argument_List -- ------------------------ function Same_Argument_List return Boolean is A : Node_Id; F : Entity_Id; Subp : Entity_Id; begin if not Is_Entity_Name (Name (N)) then return False; else Subp := Entity (Name (N)); end if; F := First_Formal (Subp); A := First_Actual (N); while Present (F) and then Present (A) loop if not Is_Entity_Name (A) or else Entity (A) /= F then return False; end if; Next_Actual (A); Next_Formal (F); end loop; return True; end Same_Argument_List; -- Start of processing for Check_Infinite_Recursion begin -- Loop moving up tree, quitting if something tells us we are -- definitely not in an infinite recursion situation. C := N; loop P := Parent (C); exit when Nkind (P) = N_Subprogram_Body; if Nkind (P) = N_Or_Else or else Nkind (P) = N_And_Then or else Nkind (P) = N_If_Statement or else Nkind (P) = N_Case_Statement then return False; elsif Nkind (P) = N_Handled_Sequence_Of_Statements and then C /= First (Statements (P)) then -- If the call is the expression of a return statement and -- the actuals are identical to the formals, it's worth a -- warning. However, we skip this if there is an immediately -- preceding raise statement, since the call is never executed. -- Furthermore, this corresponds to a common idiom: -- function F (L : Thing) return Boolean is -- begin -- raise Program_Error; -- return F (L); -- end F; -- for generating a stub function if Nkind (Parent (N)) = N_Return_Statement and then Same_Argument_List then exit when not Is_List_Member (Parent (N)); -- OK, return statement is in a statement list, look for raise declare Nod : Node_Id; begin -- Skip past N_Freeze_Entity nodes generated by expansion Nod := Prev (Parent (N)); while Present (Nod) and then Nkind (Nod) = N_Freeze_Entity loop Prev (Nod); end loop; -- If no raise statement, give warning exit when Nkind (Nod) /= N_Raise_Statement and then (Nkind (Nod) not in N_Raise_xxx_Error or else Present (Condition (Nod))); end; end if; return False; else C := P; end if; end loop; Error_Msg_N ("possible infinite recursion?", N); Error_Msg_N ("\Storage_Error may be raised at run time?", N); return True; end Check_Infinite_Recursion; ------------------------------- -- Check_Initialization_Call -- ------------------------------- procedure Check_Initialization_Call (N : Entity_Id; Nam : Entity_Id) is Typ : constant Entity_Id := Etype (First_Formal (Nam)); function Uses_SS (T : Entity_Id) return Boolean; -- Check whether the creation of an object of the type will involve -- use of the secondary stack. If T is a record type, this is true -- if the expression for some component uses the secondary stack, eg. -- through a call to a function that returns an unconstrained value. -- False if T is controlled, because cleanups occur elsewhere. ------------- -- Uses_SS -- ------------- function Uses_SS (T : Entity_Id) return Boolean is Comp : Entity_Id; Expr : Node_Id; begin if Is_Controlled (T) then return False; elsif Is_Array_Type (T) then return Uses_SS (Component_Type (T)); elsif Is_Record_Type (T) then Comp := First_Component (T); while Present (Comp) loop if Ekind (Comp) = E_Component and then Nkind (Parent (Comp)) = N_Component_Declaration then Expr := Expression (Parent (Comp)); -- The expression for a dynamic component may be -- rewritten as a dereference. Retrieve original -- call. if Nkind (Original_Node (Expr)) = N_Function_Call and then Requires_Transient_Scope (Etype (Expr)) then return True; elsif Uses_SS (Etype (Comp)) then return True; end if; end if; Next_Component (Comp); end loop; return False; else return False; end if; end Uses_SS; -- Start of processing for Check_Initialization_Call begin -- Nothing to do if functions do not use the secondary stack for -- returns (i.e. they use a depressed stack pointer instead). if Functions_Return_By_DSP_On_Target then return; -- Otherwise establish a transient scope if the type needs it elsif Uses_SS (Typ) then Establish_Transient_Scope (First_Actual (N), Sec_Stack => True); end if; end Check_Initialization_Call; ------------------------------ -- Check_Parameterless_Call -- ------------------------------ procedure Check_Parameterless_Call (N : Node_Id) is Nam : Node_Id; function Prefix_Is_Access_Subp return Boolean; -- If the prefix is of an access_to_subprogram type, the node must be -- rewritten as a call. Ditto if the prefix is overloaded and all its -- interpretations are access to subprograms. --------------------------- -- Prefix_Is_Access_Subp -- --------------------------- function Prefix_Is_Access_Subp return Boolean is I : Interp_Index; It : Interp; begin if not Is_Overloaded (N) then return Ekind (Etype (N)) = E_Subprogram_Type and then Base_Type (Etype (Etype (N))) /= Standard_Void_Type; else Get_First_Interp (N, I, It); while Present (It.Typ) loop if Ekind (It.Typ) /= E_Subprogram_Type or else Base_Type (Etype (It.Typ)) = Standard_Void_Type then return False; end if; Get_Next_Interp (I, It); end loop; return True; end if; end Prefix_Is_Access_Subp; -- Start of processing for Check_Parameterless_Call begin -- Defend against junk stuff if errors already detected if Total_Errors_Detected /= 0 then if Nkind (N) in N_Has_Etype and then Etype (N) = Any_Type then return; elsif Nkind (N) in N_Has_Chars and then Chars (N) in Error_Name_Or_No_Name then return; end if; Require_Entity (N); end if; -- If the context expects a value, and the name is a procedure, -- this is most likely a missing 'Access. Do not try to resolve -- the parameterless call, error will be caught when the outer -- call is analyzed. if Is_Entity_Name (N) and then Ekind (Entity (N)) = E_Procedure and then not Is_Overloaded (N) and then (Nkind (Parent (N)) = N_Parameter_Association or else Nkind (Parent (N)) = N_Function_Call or else Nkind (Parent (N)) = N_Procedure_Call_Statement) then return; end if; -- Rewrite as call if overloadable entity that is (or could be, in -- the overloaded case) a function call. If we know for sure that -- the entity is an enumeration literal, we do not rewrite it. if (Is_Entity_Name (N) and then Is_Overloadable (Entity (N)) and then (Ekind (Entity (N)) /= E_Enumeration_Literal or else Is_Overloaded (N))) -- Rewrite as call if it is an explicit deference of an expression of -- a subprogram access type, and the suprogram type is not that of a -- procedure or entry. or else (Nkind (N) = N_Explicit_Dereference and then Prefix_Is_Access_Subp) -- Rewrite as call if it is a selected component which is a function, -- this is the case of a call to a protected function (which may be -- overloaded with other protected operations). or else (Nkind (N) = N_Selected_Component and then (Ekind (Entity (Selector_Name (N))) = E_Function or else ((Ekind (Entity (Selector_Name (N))) = E_Entry or else Ekind (Entity (Selector_Name (N))) = E_Procedure) and then Is_Overloaded (Selector_Name (N))))) -- If one of the above three conditions is met, rewrite as call. -- Apply the rewriting only once. then if Nkind (Parent (N)) /= N_Function_Call or else N /= Name (Parent (N)) then Nam := New_Copy (N); -- If overloaded, overload set belongs to new copy Save_Interps (N, Nam); -- Change node to parameterless function call (note that the -- Parameter_Associations associations field is left set to Empty, -- its normal default value since there are no parameters) Change_Node (N, N_Function_Call); Set_Name (N, Nam); Set_Sloc (N, Sloc (Nam)); Analyze_Call (N); end if; elsif Nkind (N) = N_Parameter_Association then Check_Parameterless_Call (Explicit_Actual_Parameter (N)); end if; end Check_Parameterless_Call; ---------------------- -- Is_Predefined_Op -- ---------------------- function Is_Predefined_Op (Nam : Entity_Id) return Boolean is begin return Is_Intrinsic_Subprogram (Nam) and then not Is_Generic_Instance (Nam) and then Chars (Nam) in Any_Operator_Name and then (No (Alias (Nam)) or else Is_Predefined_Op (Alias (Nam))); end Is_Predefined_Op; ----------------------------- -- Make_Call_Into_Operator -- ----------------------------- procedure Make_Call_Into_Operator (N : Node_Id; Typ : Entity_Id; Op_Id : Entity_Id) is Op_Name : constant Name_Id := Chars (Op_Id); Act1 : Node_Id := First_Actual (N); Act2 : Node_Id := Next_Actual (Act1); Error : Boolean := False; Func : constant Entity_Id := Entity (Name (N)); Is_Binary : constant Boolean := Present (Act2); Op_Node : Node_Id; Opnd_Type : Entity_Id; Orig_Type : Entity_Id := Empty; Pack : Entity_Id; type Kind_Test is access function (E : Entity_Id) return Boolean; function Is_Definite_Access_Type (E : Entity_Id) return Boolean; -- Determine whether E is an access type declared by an access decla- -- ration, and not an (anonymous) allocator type. function Operand_Type_In_Scope (S : Entity_Id) return Boolean; -- If the operand is not universal, and the operator is given by a -- expanded name, verify that the operand has an interpretation with -- a type defined in the given scope of the operator. function Type_In_P (Test : Kind_Test) return Entity_Id; -- Find a type of the given class in the package Pack that contains -- the operator. ----------------------------- -- Is_Definite_Access_Type -- ----------------------------- function Is_Definite_Access_Type (E : Entity_Id) return Boolean is Btyp : constant Entity_Id := Base_Type (E); begin return Ekind (Btyp) = E_Access_Type or else (Ekind (Btyp) = E_Access_Subprogram_Type and then Comes_From_Source (Btyp)); end Is_Definite_Access_Type; --------------------------- -- Operand_Type_In_Scope -- --------------------------- function Operand_Type_In_Scope (S : Entity_Id) return Boolean is Nod : constant Node_Id := Right_Opnd (Op_Node); I : Interp_Index; It : Interp; begin if not Is_Overloaded (Nod) then return Scope (Base_Type (Etype (Nod))) = S; else Get_First_Interp (Nod, I, It); while Present (It.Typ) loop if Scope (Base_Type (It.Typ)) = S then return True; end if; Get_Next_Interp (I, It); end loop; return False; end if; end Operand_Type_In_Scope; --------------- -- Type_In_P -- --------------- function Type_In_P (Test : Kind_Test) return Entity_Id is E : Entity_Id; function In_Decl return Boolean; -- Verify that node is not part of the type declaration for the -- candidate type, which would otherwise be invisible. ------------- -- In_Decl -- ------------- function In_Decl return Boolean is Decl_Node : constant Node_Id := Parent (E); N2 : Node_Id; begin N2 := N; if Etype (E) = Any_Type then return True; elsif No (Decl_Node) then return False; else while Present (N2) and then Nkind (N2) /= N_Compilation_Unit loop if N2 = Decl_Node then return True; else N2 := Parent (N2); end if; end loop; return False; end if; end In_Decl; -- Start of processing for Type_In_P begin -- If the context type is declared in the prefix package, this -- is the desired base type. if Scope (Base_Type (Typ)) = Pack and then Test (Typ) then return Base_Type (Typ); else E := First_Entity (Pack); while Present (E) loop if Test (E) and then not In_Decl then return E; end if; Next_Entity (E); end loop; return Empty; end if; end Type_In_P; -- Start of processing for Make_Call_Into_Operator begin Op_Node := New_Node (Operator_Kind (Op_Name, Is_Binary), Sloc (N)); -- Binary operator if Is_Binary then Set_Left_Opnd (Op_Node, Relocate_Node (Act1)); Set_Right_Opnd (Op_Node, Relocate_Node (Act2)); Save_Interps (Act1, Left_Opnd (Op_Node)); Save_Interps (Act2, Right_Opnd (Op_Node)); Act1 := Left_Opnd (Op_Node); Act2 := Right_Opnd (Op_Node); -- Unary operator else Set_Right_Opnd (Op_Node, Relocate_Node (Act1)); Save_Interps (Act1, Right_Opnd (Op_Node)); Act1 := Right_Opnd (Op_Node); end if; -- If the operator is denoted by an expanded name, and the prefix is -- not Standard, but the operator is a predefined one whose scope is -- Standard, then this is an implicit_operator, inserted as an -- interpretation by the procedure of the same name. This procedure -- overestimates the presence of implicit operators, because it does -- not examine the type of the operands. Verify now that the operand -- type appears in the given scope. If right operand is universal, -- check the other operand. In the case of concatenation, either -- argument can be the component type, so check the type of the result. -- If both arguments are literals, look for a type of the right kind -- defined in the given scope. This elaborate nonsense is brought to -- you courtesy of b33302a. The type itself must be frozen, so we must -- find the type of the proper class in the given scope. -- A final wrinkle is the multiplication operator for fixed point -- types, which is defined in Standard only, and not in the scope of -- the fixed_point type itself. if Nkind (Name (N)) = N_Expanded_Name then Pack := Entity (Prefix (Name (N))); -- If the entity being called is defined in the given package, -- it is a renaming of a predefined operator, and known to be -- legal. if Scope (Entity (Name (N))) = Pack and then Pack /= Standard_Standard then null; -- Visibility does not need to be checked in an instance: if the -- operator was not visible in the generic it has been diagnosed -- already, else there is an implicit copy of it in the instance. elsif In_Instance then null; elsif (Op_Name = Name_Op_Multiply or else Op_Name = Name_Op_Divide) and then Is_Fixed_Point_Type (Etype (Left_Opnd (Op_Node))) and then Is_Fixed_Point_Type (Etype (Right_Opnd (Op_Node))) then if Pack /= Standard_Standard then Error := True; end if; -- Ada 2005, AI-420: Predefined equality on Universal_Access -- is available. elsif Ada_Version >= Ada_05 and then (Op_Name = Name_Op_Eq or else Op_Name = Name_Op_Ne) and then Ekind (Etype (Act1)) = E_Anonymous_Access_Type then null; else Opnd_Type := Base_Type (Etype (Right_Opnd (Op_Node))); if Op_Name = Name_Op_Concat then Opnd_Type := Base_Type (Typ); elsif (Scope (Opnd_Type) = Standard_Standard and then Is_Binary) or else (Nkind (Right_Opnd (Op_Node)) = N_Attribute_Reference and then Is_Binary and then not Comes_From_Source (Opnd_Type)) then Opnd_Type := Base_Type (Etype (Left_Opnd (Op_Node))); end if; if Scope (Opnd_Type) = Standard_Standard then -- Verify that the scope contains a type that corresponds to -- the given literal. Optimize the case where Pack is Standard. if Pack /= Standard_Standard then if Opnd_Type = Universal_Integer then Orig_Type := Type_In_P (Is_Integer_Type'Access); elsif Opnd_Type = Universal_Real then Orig_Type := Type_In_P (Is_Real_Type'Access); elsif Opnd_Type = Any_String then Orig_Type := Type_In_P (Is_String_Type'Access); elsif Opnd_Type = Any_Access then Orig_Type := Type_In_P (Is_Definite_Access_Type'Access); elsif Opnd_Type = Any_Composite then Orig_Type := Type_In_P (Is_Composite_Type'Access); if Present (Orig_Type) then if Has_Private_Component (Orig_Type) then Orig_Type := Empty; else Set_Etype (Act1, Orig_Type); if Is_Binary then Set_Etype (Act2, Orig_Type); end if; end if; end if; else Orig_Type := Empty; end if; Error := No (Orig_Type); end if; elsif Ekind (Opnd_Type) = E_Allocator_Type and then No (Type_In_P (Is_Definite_Access_Type'Access)) then Error := True; -- If the type is defined elsewhere, and the operator is not -- defined in the given scope (by a renaming declaration, e.g.) -- then this is an error as well. If an extension of System is -- present, and the type may be defined there, Pack must be -- System itself. elsif Scope (Opnd_Type) /= Pack and then Scope (Op_Id) /= Pack and then (No (System_Aux_Id) or else Scope (Opnd_Type) /= System_Aux_Id or else Pack /= Scope (System_Aux_Id)) then if not Is_Overloaded (Right_Opnd (Op_Node)) then Error := True; else Error := not Operand_Type_In_Scope (Pack); end if; elsif Pack = Standard_Standard and then not Operand_Type_In_Scope (Standard_Standard) then Error := True; end if; end if; if Error then Error_Msg_Node_2 := Pack; Error_Msg_NE ("& not declared in&", N, Selector_Name (Name (N))); Set_Etype (N, Any_Type); return; end if; end if; Set_Chars (Op_Node, Op_Name); if not Is_Private_Type (Etype (N)) then Set_Etype (Op_Node, Base_Type (Etype (N))); else Set_Etype (Op_Node, Etype (N)); end if; -- If this is a call to a function that renames a predefined equality, -- the renaming declaration provides a type that must be used to -- resolve the operands. This must be done now because resolution of -- the equality node will not resolve any remaining ambiguity, and it -- assumes that the first operand is not overloaded. if (Op_Name = Name_Op_Eq or else Op_Name = Name_Op_Ne) and then Ekind (Func) = E_Function and then Is_Overloaded (Act1) then Resolve (Act1, Base_Type (Etype (First_Formal (Func)))); Resolve (Act2, Base_Type (Etype (First_Formal (Func)))); end if; Set_Entity (Op_Node, Op_Id); Generate_Reference (Op_Id, N, ' '); Rewrite (N, Op_Node); -- If this is an arithmetic operator and the result type is private, -- the operands and the result must be wrapped in conversion to -- expose the underlying numeric type and expand the proper checks, -- e.g. on division. if Is_Private_Type (Typ) then case Nkind (N) is when N_Op_Add | N_Op_Subtract | N_Op_Multiply | N_Op_Divide | N_Op_Expon | N_Op_Mod | N_Op_Rem => Resolve_Intrinsic_Operator (N, Typ); when N_Op_Plus | N_Op_Minus | N_Op_Abs => Resolve_Intrinsic_Unary_Operator (N, Typ); when others => Resolve (N, Typ); end case; else Resolve (N, Typ); end if; -- For predefined operators on literals, the operation freezes -- their type. if Present (Orig_Type) then Set_Etype (Act1, Orig_Type); Freeze_Expression (Act1); end if; end Make_Call_Into_Operator; ------------------- -- Operator_Kind -- ------------------- function Operator_Kind (Op_Name : Name_Id; Is_Binary : Boolean) return Node_Kind is Kind : Node_Kind; begin if Is_Binary then -- LLVM local begin if Op_Name = Name_Op_And then Kind := N_Op_And; elsif Op_Name = Name_Op_Or then Kind := N_Op_Or; elsif Op_Name = Name_Op_Xor then Kind := N_Op_Xor; elsif Op_Name = Name_Op_Eq then Kind := N_Op_Eq; elsif Op_Name = Name_Op_Ne then Kind := N_Op_Ne; elsif Op_Name = Name_Op_Lt then Kind := N_Op_Lt; elsif Op_Name = Name_Op_Le then Kind := N_Op_Le; elsif Op_Name = Name_Op_Gt then Kind := N_Op_Gt; elsif Op_Name = Name_Op_Ge then Kind := N_Op_Ge; elsif Op_Name = Name_Op_Add then Kind := N_Op_Add; elsif Op_Name = Name_Op_Subtract then Kind := N_Op_Subtract; elsif Op_Name = Name_Op_Concat then Kind := N_Op_Concat; elsif Op_Name = Name_Op_Multiply then Kind := N_Op_Multiply; elsif Op_Name = Name_Op_Divide then Kind := N_Op_Divide; elsif Op_Name = Name_Op_Mod then Kind := N_Op_Mod; elsif Op_Name = Name_Op_Rem then Kind := N_Op_Rem; elsif Op_Name = Name_Op_Expon then Kind := N_Op_Expon; -- LLVM local end else raise Program_Error; end if; -- Unary operators else -- LLVM local begin if Op_Name = Name_Op_Add then Kind := N_Op_Plus; elsif Op_Name = Name_Op_Subtract then Kind := N_Op_Minus; elsif Op_Name = Name_Op_Abs then Kind := N_Op_Abs; elsif Op_Name = Name_Op_Not then Kind := N_Op_Not; -- LLVM local end else raise Program_Error; end if; end if; return Kind; end Operator_Kind; ----------------------------- -- Pre_Analyze_And_Resolve -- ----------------------------- procedure Pre_Analyze_And_Resolve (N : Node_Id; T : Entity_Id) is Save_Full_Analysis : constant Boolean := Full_Analysis; begin Full_Analysis := False; Expander_Mode_Save_And_Set (False); -- We suppress all checks for this analysis, since the checks will -- be applied properly, and in the right location, when the default -- expression is reanalyzed and reexpanded later on. Analyze_And_Resolve (N, T, Suppress => All_Checks); Expander_Mode_Restore; Full_Analysis := Save_Full_Analysis; end Pre_Analyze_And_Resolve; -- Version without context type procedure Pre_Analyze_And_Resolve (N : Node_Id) is Save_Full_Analysis : constant Boolean := Full_Analysis; begin Full_Analysis := False; Expander_Mode_Save_And_Set (False); Analyze (N); Resolve (N, Etype (N), Suppress => All_Checks); Expander_Mode_Restore; Full_Analysis := Save_Full_Analysis; end Pre_Analyze_And_Resolve; ---------------------------------- -- Replace_Actual_Discriminants -- ---------------------------------- procedure Replace_Actual_Discriminants (N : Node_Id; Default : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Tsk : Node_Id := Empty; function Process_Discr (Nod : Node_Id) return Traverse_Result; ------------------- -- Process_Discr -- ------------------- function Process_Discr (Nod : Node_Id) return Traverse_Result is Ent : Entity_Id; begin if Nkind (Nod) = N_Identifier then Ent := Entity (Nod); if Present (Ent) and then Ekind (Ent) = E_Discriminant then Rewrite (Nod, Make_Selected_Component (Loc, Prefix => New_Copy_Tree (Tsk, New_Sloc => Loc), Selector_Name => Make_Identifier (Loc, Chars (Ent)))); Set_Etype (Nod, Etype (Ent)); end if; end if; return OK; end Process_Discr; procedure Replace_Discrs is new Traverse_Proc (Process_Discr); -- Start of processing for Replace_Actual_Discriminants begin if not Expander_Active then return; end if; if Nkind (Name (N)) = N_Selected_Component then Tsk := Prefix (Name (N)); elsif Nkind (Name (N)) = N_Indexed_Component then Tsk := Prefix (Prefix (Name (N))); end if; if No (Tsk) then return; else Replace_Discrs (Default); end if; end Replace_Actual_Discriminants; ------------- -- Resolve -- ------------- procedure Resolve (N : Node_Id; Typ : Entity_Id) is I : Interp_Index; I1 : Interp_Index := 0; -- prevent junk warning It : Interp; It1 : Interp; Found : Boolean := False; Seen : Entity_Id := Empty; -- prevent junk warning Ctx_Type : Entity_Id := Typ; Expr_Type : Entity_Id := Empty; -- prevent junk warning Err_Type : Entity_Id := Empty; Ambiguous : Boolean := False; procedure Patch_Up_Value (N : Node_Id; Typ : Entity_Id); -- Try and fix up a literal so that it matches its expected type. New -- literals are manufactured if necessary to avoid cascaded errors. procedure Resolution_Failed; -- Called when attempt at resolving current expression fails -------------------- -- Patch_Up_Value -- -------------------- procedure Patch_Up_Value (N : Node_Id; Typ : Entity_Id) is begin if Nkind (N) = N_Integer_Literal and then Is_Real_Type (Typ) then Rewrite (N, Make_Real_Literal (Sloc (N), Realval => UR_From_Uint (Intval (N)))); Set_Etype (N, Universal_Real); Set_Is_Static_Expression (N); elsif Nkind (N) = N_Real_Literal and then Is_Integer_Type (Typ) then Rewrite (N, Make_Integer_Literal (Sloc (N), Intval => UR_To_Uint (Realval (N)))); Set_Etype (N, Universal_Integer); Set_Is_Static_Expression (N); elsif Nkind (N) = N_String_Literal and then Is_Character_Type (Typ) then Set_Character_Literal_Name (Char_Code (Character'Pos ('A'))); Rewrite (N, Make_Character_Literal (Sloc (N), Chars => Name_Find, Char_Literal_Value => UI_From_Int (Character'Pos ('A')))); Set_Etype (N, Any_Character); Set_Is_Static_Expression (N); elsif Nkind (N) /= N_String_Literal and then Is_String_Type (Typ) then Rewrite (N, Make_String_Literal (Sloc (N), Strval => End_String)); elsif Nkind (N) = N_Range then Patch_Up_Value (Low_Bound (N), Typ); Patch_Up_Value (High_Bound (N), Typ); end if; end Patch_Up_Value; ----------------------- -- Resolution_Failed -- ----------------------- procedure Resolution_Failed is begin Patch_Up_Value (N, Typ); Set_Etype (N, Typ); Debug_A_Exit ("resolving ", N, " (done, resolution failed)"); Set_Is_Overloaded (N, False); -- The caller will return without calling the expander, so we need -- to set the analyzed flag. Note that it is fine to set Analyzed -- to True even if we are in the middle of a shallow analysis, -- (see the spec of sem for more details) since this is an error -- situation anyway, and there is no point in repeating the -- analysis later (indeed it won't work to repeat it later, since -- we haven't got a clear resolution of which entity is being -- referenced.) Set_Analyzed (N, True); return; end Resolution_Failed; -- Start of processing for Resolve begin if N = Error then return; end if; -- Access attribute on remote subprogram cannot be used for -- a non-remote access-to-subprogram type. if Nkind (N) = N_Attribute_Reference and then (Attribute_Name (N) = Name_Access or else Attribute_Name (N) = Name_Unrestricted_Access or else Attribute_Name (N) = Name_Unchecked_Access) and then Comes_From_Source (N) and then Is_Entity_Name (Prefix (N)) and then Is_Subprogram (Entity (Prefix (N))) and then Is_Remote_Call_Interface (Entity (Prefix (N))) and then not Is_Remote_Access_To_Subprogram_Type (Typ) then Error_Msg_N ("prefix must statically denote a non-remote subprogram", N); end if; -- If the context is a Remote_Access_To_Subprogram, access attributes -- must be resolved with the corresponding fat pointer. There is no need -- to check for the attribute name since the return type of an -- attribute is never a remote type. if Nkind (N) = N_Attribute_Reference and then Comes_From_Source (N) and then (Is_Remote_Call_Interface (Typ) or else Is_Remote_Types (Typ)) then declare Attr : constant Attribute_Id := Get_Attribute_Id (Attribute_Name (N)); Pref : constant Node_Id := Prefix (N); Decl : Node_Id; Spec : Node_Id; Is_Remote : Boolean := True; begin -- Check that Typ is a remote access-to-subprogram type if Is_Remote_Access_To_Subprogram_Type (Typ) then -- Prefix (N) must statically denote a remote subprogram -- declared in a package specification. if Attr = Attribute_Access then Decl := Unit_Declaration_Node (Entity (Pref)); if Nkind (Decl) = N_Subprogram_Body then Spec := Corresponding_Spec (Decl); if not No (Spec) then Decl := Unit_Declaration_Node (Spec); end if; end if; Spec := Parent (Decl); if not Is_Entity_Name (Prefix (N)) or else Nkind (Spec) /= N_Package_Specification or else not Is_Remote_Call_Interface (Defining_Entity (Spec)) then Is_Remote := False; Error_Msg_N ("prefix must statically denote a remote subprogram ", N); end if; end if; -- If we are generating code for a distributed program. -- perform semantic checks against the corresponding -- remote entities. if (Attr = Attribute_Access or else Attr = Attribute_Unchecked_Access or else Attr = Attribute_Unrestricted_Access) and then Expander_Active and then Get_PCS_Name /= Name_No_DSA then Check_Subtype_Conformant (New_Id => Entity (Prefix (N)), Old_Id => Designated_Type (Corresponding_Remote_Type (Typ)), Err_Loc => N); if Is_Remote then Process_Remote_AST_Attribute (N, Typ); end if; end if; end if; end; end if; Debug_A_Entry ("resolving ", N); if Comes_From_Source (N) then if Is_Fixed_Point_Type (Typ) then Check_Restriction (No_Fixed_Point, N); elsif Is_Floating_Point_Type (Typ) and then Typ /= Universal_Real and then Typ /= Any_Real then Check_Restriction (No_Floating_Point, N); end if; end if; -- Return if already analyzed if Analyzed (N) then Debug_A_Exit ("resolving ", N, " (done, already analyzed)"); return; -- Return if type = Any_Type (previous error encountered) elsif Etype (N) = Any_Type then Debug_A_Exit ("resolving ", N, " (done, Etype = Any_Type)"); return; end if; Check_Parameterless_Call (N); -- If not overloaded, then we know the type, and all that needs doing -- is to check that this type is compatible with the context. if not Is_Overloaded (N) then Found := Covers (Typ, Etype (N)); Expr_Type := Etype (N); -- In the overloaded case, we must select the interpretation that -- is compatible with the context (i.e. the type passed to Resolve) else -- Loop through possible interpretations Get_First_Interp (N, I, It); Interp_Loop : while Present (It.Typ) loop -- We are only interested in interpretations that are compatible -- with the expected type, any other interpretations are ignored if not Covers (Typ, It.Typ) then if Debug_Flag_V then Write_Str (" interpretation incompatible with context"); Write_Eol; end if; else -- First matching interpretation if not Found then Found := True; I1 := I; Seen := It.Nam; Expr_Type := It.Typ; -- Matching interpretation that is not the first, maybe an -- error, but there are some cases where preference rules are -- used to choose between the two possibilities. These and -- some more obscure cases are handled in Disambiguate. else Error_Msg_Sloc := Sloc (Seen); It1 := Disambiguate (N, I1, I, Typ); -- Disambiguation has succeeded. Skip the remaining -- interpretations. if It1 /= No_Interp then Seen := It1.Nam; Expr_Type := It1.Typ; while Present (It.Typ) loop Get_Next_Interp (I, It); end loop; else -- Before we issue an ambiguity complaint, check for -- the case of a subprogram call where at least one -- of the arguments is Any_Type, and if so, suppress -- the message, since it is a cascaded error. if Nkind (N) = N_Function_Call or else Nkind (N) = N_Procedure_Call_Statement then declare A : Node_Id; E : Node_Id; begin A := First_Actual (N); while Present (A) loop E := A; if Nkind (E) = N_Parameter_Association then E := Explicit_Actual_Parameter (E); end if; if Etype (E) = Any_Type then if Debug_Flag_V then Write_Str ("Any_Type in call"); Write_Eol; end if; exit Interp_Loop; end if; Next_Actual (A); end loop; end; elsif Nkind (N) in N_Binary_Op and then (Etype (Left_Opnd (N)) = Any_Type or else Etype (Right_Opnd (N)) = Any_Type) then exit Interp_Loop; elsif Nkind (N) in N_Unary_Op and then Etype (Right_Opnd (N)) = Any_Type then exit Interp_Loop; end if; -- Not that special case, so issue message using the -- flag Ambiguous to control printing of the header -- message only at the start of an ambiguous set. if not Ambiguous then Error_Msg_NE ("ambiguous expression (cannot resolve&)!", N, It.Nam); Error_Msg_N ("possible interpretation#!", N); Ambiguous := True; end if; Error_Msg_Sloc := Sloc (It.Nam); -- By default, the error message refers to the candidate -- interpretation. But if it is a predefined operator, -- it is implicitly declared at the declaration of -- the type of the operand. Recover the sloc of that -- declaration for the error message. if Nkind (N) in N_Op and then Scope (It.Nam) = Standard_Standard and then not Is_Overloaded (Right_Opnd (N)) and then Scope (Base_Type (Etype (Right_Opnd (N)))) /= Standard_Standard then Err_Type := First_Subtype (Etype (Right_Opnd (N))); if Comes_From_Source (Err_Type) and then Present (Parent (Err_Type)) then Error_Msg_Sloc := Sloc (Parent (Err_Type)); end if; elsif Nkind (N) in N_Binary_Op and then Scope (It.Nam) = Standard_Standard and then not Is_Overloaded (Left_Opnd (N)) and then Scope (Base_Type (Etype (Left_Opnd (N)))) /= Standard_Standard then Err_Type := First_Subtype (Etype (Left_Opnd (N))); if Comes_From_Source (Err_Type) and then Present (Parent (Err_Type)) then Error_Msg_Sloc := Sloc (Parent (Err_Type)); end if; else Err_Type := Empty; end if; if Nkind (N) in N_Op and then Scope (It.Nam) = Standard_Standard and then Present (Err_Type) then Error_Msg_N ("possible interpretation (predefined)#!", N); else Error_Msg_N ("possible interpretation#!", N); end if; end if; end if; -- We have a matching interpretation, Expr_Type is the -- type from this interpretation, and Seen is the entity. -- For an operator, just set the entity name. The type will -- be set by the specific operator resolution routine. if Nkind (N) in N_Op then Set_Entity (N, Seen); Generate_Reference (Seen, N); elsif Nkind (N) = N_Character_Literal then Set_Etype (N, Expr_Type); -- For an explicit dereference, attribute reference, range, -- short-circuit form (which is not an operator node), -- or a call with a name that is an explicit dereference, -- there is nothing to be done at this point. elsif Nkind (N) = N_Explicit_Dereference or else Nkind (N) = N_Attribute_Reference or else Nkind (N) = N_And_Then or else Nkind (N) = N_Indexed_Component or else Nkind (N) = N_Or_Else or else Nkind (N) = N_Range or else Nkind (N) = N_Selected_Component or else Nkind (N) = N_Slice or else Nkind (Name (N)) = N_Explicit_Dereference then null; -- For procedure or function calls, set the type of the -- name, and also the entity pointer for the prefix elsif (Nkind (N) = N_Procedure_Call_Statement or else Nkind (N) = N_Function_Call) and then (Is_Entity_Name (Name (N)) or else Nkind (Name (N)) = N_Operator_Symbol) then Set_Etype (Name (N), Expr_Type); Set_Entity (Name (N), Seen); Generate_Reference (Seen, Name (N)); elsif Nkind (N) = N_Function_Call and then Nkind (Name (N)) = N_Selected_Component then Set_Etype (Name (N), Expr_Type); Set_Entity (Selector_Name (Name (N)), Seen); Generate_Reference (Seen, Selector_Name (Name (N))); -- For all other cases, just set the type of the Name else Set_Etype (Name (N), Expr_Type); end if; end if; -- Move to next interpretation exit Interp_Loop when No (It.Typ); Get_Next_Interp (I, It); end loop Interp_Loop; end if; -- At this stage Found indicates whether or not an acceptable -- interpretation exists. If not, then we have an error, except -- that if the context is Any_Type as a result of some other error, -- then we suppress the error report. if not Found then if Typ /= Any_Type then -- If type we are looking for is Void, then this is the -- procedure call case, and the error is simply that what -- we gave is not a procedure name (we think of procedure -- calls as expressions with types internally, but the user -- doesn't think of them this way!) if Typ = Standard_Void_Type then -- Special case message if function used as a procedure if Nkind (N) = N_Procedure_Call_Statement and then Is_Entity_Name (Name (N)) and then Ekind (Entity (Name (N))) = E_Function then Error_Msg_NE ("cannot use function & in a procedure call", Name (N), Entity (Name (N))); -- Otherwise give general message (not clear what cases -- this covers, but no harm in providing for them!) else Error_Msg_N ("expect procedure name in procedure call", N); end if; Found := True; -- Otherwise we do have a subexpression with the wrong type -- Check for the case of an allocator which uses an access -- type instead of the designated type. This is a common -- error and we specialize the message, posting an error -- on the operand of the allocator, complaining that we -- expected the designated type of the allocator. elsif Nkind (N) = N_Allocator and then Ekind (Typ) in Access_Kind and then Ekind (Etype (N)) in Access_Kind and then Designated_Type (Etype (N)) = Typ then Wrong_Type (Expression (N), Designated_Type (Typ)); Found := True; -- Check for view mismatch on Null in instances, for -- which the view-swapping mechanism has no identifier. elsif (In_Instance or else In_Inlined_Body) and then (Nkind (N) = N_Null) and then Is_Private_Type (Typ) and then Is_Access_Type (Full_View (Typ)) then Resolve (N, Full_View (Typ)); Set_Etype (N, Typ); return; -- Check for an aggregate. Sometimes we can get bogus -- aggregates from misuse of parentheses, and we are -- about to complain about the aggregate without even -- looking inside it. -- Instead, if we have an aggregate of type Any_Composite, -- then analyze and resolve the component fields, and then -- only issue another message if we get no errors doing -- this (otherwise assume that the errors in the aggregate -- caused the problem). elsif Nkind (N) = N_Aggregate and then Etype (N) = Any_Composite then -- Disable expansion in any case. If there is a type mismatch -- it may be fatal to try to expand the aggregate. The flag -- would otherwise be set to false when the error is posted. Expander_Active := False; declare procedure Check_Aggr (Aggr : Node_Id); -- Check one aggregate, and set Found to True if we -- have a definite error in any of its elements procedure Check_Elmt (Aelmt : Node_Id); -- Check one element of aggregate and set Found to -- True if we definitely have an error in the element. procedure Check_Aggr (Aggr : Node_Id) is Elmt : Node_Id; begin if Present (Expressions (Aggr)) then Elmt := First (Expressions (Aggr)); while Present (Elmt) loop Check_Elmt (Elmt); Next (Elmt); end loop; end if; if Present (Component_Associations (Aggr)) then Elmt := First (Component_Associations (Aggr)); while Present (Elmt) loop Check_Elmt (Expression (Elmt)); Next (Elmt); end loop; end if; end Check_Aggr; ---------------- -- Check_Elmt -- ---------------- procedure Check_Elmt (Aelmt : Node_Id) is begin -- If we have a nested aggregate, go inside it (to -- attempt a naked analyze-resolve of the aggregate -- can cause undesirable cascaded errors). Do not -- resolve expression if it needs a type from context, -- as for integer * fixed expression. if Nkind (Aelmt) = N_Aggregate then Check_Aggr (Aelmt); else Analyze (Aelmt); if not Is_Overloaded (Aelmt) and then Etype (Aelmt) /= Any_Fixed then Resolve (Aelmt); end if; if Etype (Aelmt) = Any_Type then Found := True; end if; end if; end Check_Elmt; begin Check_Aggr (N); end; end if; -- If an error message was issued already, Found got reset -- to True, so if it is still False, issue the standard -- Wrong_Type message. if not Found then if Is_Overloaded (N) and then Nkind (N) = N_Function_Call then declare Subp_Name : Node_Id; begin if Is_Entity_Name (Name (N)) then Subp_Name := Name (N); elsif Nkind (Name (N)) = N_Selected_Component then -- Protected operation: retrieve operation name Subp_Name := Selector_Name (Name (N)); else raise Program_Error; end if; Error_Msg_Node_2 := Typ; Error_Msg_NE ("no visible interpretation of&" & " matches expected type&", N, Subp_Name); end; if All_Errors_Mode then declare Index : Interp_Index; It : Interp; begin Error_Msg_N ("\possible interpretations:", N); Get_First_Interp (Name (N), Index, It); while Present (It.Nam) loop Error_Msg_Sloc := Sloc (It.Nam); Error_Msg_Node_2 := It.Typ; Error_Msg_NE ("\& declared#, type&", N, It.Nam); Get_Next_Interp (Index, It); end loop; end; else Error_Msg_N ("\use -gnatf for details", N); end if; else Wrong_Type (N, Typ); end if; end if; end if; Resolution_Failed; return; -- Test if we have more than one interpretation for the context elsif Ambiguous then Resolution_Failed; return; -- Here we have an acceptable interpretation for the context else -- Propagate type information and normalize tree for various -- predefined operations. If the context only imposes a class of -- types, rather than a specific type, propagate the actual type -- downward. if Typ = Any_Integer or else Typ = Any_Boolean or else Typ = Any_Modular or else Typ = Any_Real or else Typ = Any_Discrete then Ctx_Type := Expr_Type; -- Any_Fixed is legal in a real context only if a specific -- fixed point type is imposed. If Norman Cohen can be -- confused by this, it deserves a separate message. if Typ = Any_Real and then Expr_Type = Any_Fixed then Error_Msg_N ("illegal context for mixed mode operation", N); Set_Etype (N, Universal_Real); Ctx_Type := Universal_Real; end if; end if; -- A user-defined operator is tranformed into a function call at -- this point, so that further processing knows that operators are -- really operators (i.e. are predefined operators). User-defined -- operators that are intrinsic are just renamings of the predefined -- ones, and need not be turned into calls either, but if they rename -- a different operator, we must transform the node accordingly. -- Instantiations of Unchecked_Conversion are intrinsic but are -- treated as functions, even if given an operator designator. if Nkind (N) in N_Op and then Present (Entity (N)) and then Ekind (Entity (N)) /= E_Operator then if not Is_Predefined_Op (Entity (N)) then Rewrite_Operator_As_Call (N, Entity (N)); elsif Present (Alias (Entity (N))) and then Nkind (Parent (Parent (Entity (N)))) = N_Subprogram_Renaming_Declaration then Rewrite_Renamed_Operator (N, Alias (Entity (N)), Typ); -- If the node is rewritten, it will be fully resolved in -- Rewrite_Renamed_Operator. if Analyzed (N) then return; end if; end if; end if; case N_Subexpr'(Nkind (N)) is when N_Aggregate => Resolve_Aggregate (N, Ctx_Type); when N_Allocator => Resolve_Allocator (N, Ctx_Type); when N_And_Then | N_Or_Else => Resolve_Short_Circuit (N, Ctx_Type); when N_Attribute_Reference => Resolve_Attribute (N, Ctx_Type); when N_Character_Literal => Resolve_Character_Literal (N, Ctx_Type); when N_Conditional_Expression => Resolve_Conditional_Expression (N, Ctx_Type); when N_Expanded_Name => Resolve_Entity_Name (N, Ctx_Type); when N_Extension_Aggregate => Resolve_Extension_Aggregate (N, Ctx_Type); when N_Explicit_Dereference => Resolve_Explicit_Dereference (N, Ctx_Type); when N_Function_Call => Resolve_Call (N, Ctx_Type); when N_Identifier => Resolve_Entity_Name (N, Ctx_Type); when N_In | N_Not_In => Resolve_Membership_Op (N, Ctx_Type); when N_Indexed_Component => Resolve_Indexed_Component (N, Ctx_Type); when N_Integer_Literal => Resolve_Integer_Literal (N, Ctx_Type); when N_Null => Resolve_Null (N, Ctx_Type); when N_Op_And | N_Op_Or | N_Op_Xor => Resolve_Logical_Op (N, Ctx_Type); when N_Op_Eq | N_Op_Ne => Resolve_Equality_Op (N, Ctx_Type); when N_Op_Lt | N_Op_Le | N_Op_Gt | N_Op_Ge => Resolve_Comparison_Op (N, Ctx_Type); when N_Op_Not => Resolve_Op_Not (N, Ctx_Type); when N_Op_Add | N_Op_Subtract | N_Op_Multiply | N_Op_Divide | N_Op_Mod | N_Op_Rem => Resolve_Arithmetic_Op (N, Ctx_Type); when N_Op_Concat => Resolve_Op_Concat (N, Ctx_Type); when N_Op_Expon => Resolve_Op_Expon (N, Ctx_Type); when N_Op_Plus | N_Op_Minus | N_Op_Abs => Resolve_Unary_Op (N, Ctx_Type); when N_Op_Shift => Resolve_Shift (N, Ctx_Type); when N_Procedure_Call_Statement => Resolve_Call (N, Ctx_Type); when N_Operator_Symbol => Resolve_Operator_Symbol (N, Ctx_Type); when N_Qualified_Expression => Resolve_Qualified_Expression (N, Ctx_Type); when N_Raise_xxx_Error => Set_Etype (N, Ctx_Type); when N_Range => Resolve_Range (N, Ctx_Type); when N_Real_Literal => Resolve_Real_Literal (N, Ctx_Type); when N_Reference => Resolve_Reference (N, Ctx_Type); when N_Selected_Component => Resolve_Selected_Component (N, Ctx_Type); when N_Slice => Resolve_Slice (N, Ctx_Type); when N_String_Literal => Resolve_String_Literal (N, Ctx_Type); when N_Subprogram_Info => Resolve_Subprogram_Info (N, Ctx_Type); when N_Type_Conversion => Resolve_Type_Conversion (N, Ctx_Type); when N_Unchecked_Expression => Resolve_Unchecked_Expression (N, Ctx_Type); when N_Unchecked_Type_Conversion => Resolve_Unchecked_Type_Conversion (N, Ctx_Type); end case; -- If the subexpression was replaced by a non-subexpression, then -- all we do is to expand it. The only legitimate case we know of -- is converting procedure call statement to entry call statements, -- but there may be others, so we are making this test general. if Nkind (N) not in N_Subexpr then Debug_A_Exit ("resolving ", N, " (done)"); Expand (N); return; end if; -- The expression is definitely NOT overloaded at this point, so -- we reset the Is_Overloaded flag to avoid any confusion when -- reanalyzing the node. Set_Is_Overloaded (N, False); -- Freeze expression type, entity if it is a name, and designated -- type if it is an allocator (RM 13.14(10,11,13)). -- Now that the resolution of the type of the node is complete, -- and we did not detect an error, we can expand this node. We -- skip the expand call if we are in a default expression, see -- section "Handling of Default Expressions" in Sem spec. Debug_A_Exit ("resolving ", N, " (done)"); -- We unconditionally freeze the expression, even if we are in -- default expression mode (the Freeze_Expression routine tests -- this flag and only freezes static types if it is set). Freeze_Expression (N); -- Now we can do the expansion Expand (N); end if; end Resolve; ------------- -- Resolve -- ------------- -- Version with check(s) suppressed procedure Resolve (N : Node_Id; Typ : Entity_Id; Suppress : Check_Id) is begin if Suppress = All_Checks then declare Svg : constant Suppress_Array := Scope_Suppress; begin Scope_Suppress := (others => True); Resolve (N, Typ); Scope_Suppress := Svg; end; else declare Svg : constant Boolean := Scope_Suppress (Suppress); begin Scope_Suppress (Suppress) := True; Resolve (N, Typ); Scope_Suppress (Suppress) := Svg; end; end if; end Resolve; ------------- -- Resolve -- ------------- -- Version with implicit type procedure Resolve (N : Node_Id) is begin Resolve (N, Etype (N)); end Resolve; --------------------- -- Resolve_Actuals -- --------------------- procedure Resolve_Actuals (N : Node_Id; Nam : Entity_Id) is Loc : constant Source_Ptr := Sloc (N); A : Node_Id; F : Entity_Id; A_Typ : Entity_Id; F_Typ : Entity_Id; Prev : Node_Id := Empty; procedure Insert_Default; -- If the actual is missing in a call, insert in the actuals list -- an instance of the default expression. The insertion is always -- a named association. function Same_Ancestor (T1, T2 : Entity_Id) return Boolean; -- Check whether T1 and T2, or their full views, are derived from a -- common type. Used to enforce the restrictions on array conversions -- of AI95-00246. -------------------- -- Insert_Default -- -------------------- procedure Insert_Default is Actval : Node_Id; Assoc : Node_Id; begin -- Missing argument in call, nothing to insert if No (Default_Value (F)) then return; else -- Note that we do a full New_Copy_Tree, so that any associated -- Itypes are properly copied. This may not be needed any more, -- but it does no harm as a safety measure! Defaults of a generic -- formal may be out of bounds of the corresponding actual (see -- cc1311b) and an additional check may be required. Actval := New_Copy_Tree (Default_Value (F), New_Scope => Current_Scope, New_Sloc => Loc); if Is_Concurrent_Type (Scope (Nam)) and then Has_Discriminants (Scope (Nam)) then Replace_Actual_Discriminants (N, Actval); end if; if Is_Overloadable (Nam) and then Present (Alias (Nam)) then if Base_Type (Etype (F)) /= Base_Type (Etype (Actval)) and then not Is_Tagged_Type (Etype (F)) then -- If default is a real literal, do not introduce a -- conversion whose effect may depend on the run-time -- size of universal real. if Nkind (Actval) = N_Real_Literal then Set_Etype (Actval, Base_Type (Etype (F))); else Actval := Unchecked_Convert_To (Etype (F), Actval); end if; end if; if Is_Scalar_Type (Etype (F)) then Enable_Range_Check (Actval); end if; Set_Parent (Actval, N); -- Resolve aggregates with their base type, to avoid scope -- anomalies: the subtype was first built in the suprogram -- declaration, and the current call may be nested. if Nkind (Actval) = N_Aggregate and then Has_Discriminants (Etype (Actval)) then Analyze_And_Resolve (Actval, Base_Type (Etype (Actval))); else Analyze_And_Resolve (Actval, Etype (Actval)); end if; else Set_Parent (Actval, N); -- See note above concerning aggregates if Nkind (Actval) = N_Aggregate and then Has_Discriminants (Etype (Actval)) then Analyze_And_Resolve (Actval, Base_Type (Etype (Actval))); -- Resolve entities with their own type, which may differ -- from the type of a reference in a generic context (the -- view swapping mechanism did not anticipate the re-analysis -- of default values in calls). elsif Is_Entity_Name (Actval) then Analyze_And_Resolve (Actval, Etype (Entity (Actval))); else Analyze_And_Resolve (Actval, Etype (Actval)); end if; end if; -- If default is a tag indeterminate function call, propagate -- tag to obtain proper dispatching. if Is_Controlling_Formal (F) and then Nkind (Default_Value (F)) = N_Function_Call then Set_Is_Controlling_Actual (Actval); end if; end if; -- If the default expression raises constraint error, then just -- silently replace it with an N_Raise_Constraint_Error node, -- since we already gave the warning on the subprogram spec. if Raises_Constraint_Error (Actval) then Rewrite (Actval, Make_Raise_Constraint_Error (Loc, Reason => CE_Range_Check_Failed)); Set_Raises_Constraint_Error (Actval); Set_Etype (Actval, Etype (F)); end if; Assoc := Make_Parameter_Association (Loc, Explicit_Actual_Parameter => Actval, Selector_Name => Make_Identifier (Loc, Chars (F))); -- Case of insertion is first named actual if No (Prev) or else Nkind (Parent (Prev)) /= N_Parameter_Association then Set_Next_Named_Actual (Assoc, First_Named_Actual (N)); Set_First_Named_Actual (N, Actval); if No (Prev) then if No (Parameter_Associations (N)) then Set_Parameter_Associations (N, New_List (Assoc)); else Append (Assoc, Parameter_Associations (N)); end if; else Insert_After (Prev, Assoc); end if; -- Case of insertion is not first named actual else Set_Next_Named_Actual (Assoc, Next_Named_Actual (Parent (Prev))); Set_Next_Named_Actual (Parent (Prev), Actval); Append (Assoc, Parameter_Associations (N)); end if; Mark_Rewrite_Insertion (Assoc); Mark_Rewrite_Insertion (Actval); Prev := Actval; end Insert_Default; ------------------- -- Same_Ancestor -- ------------------- function Same_Ancestor (T1, T2 : Entity_Id) return Boolean is FT1 : Entity_Id := T1; FT2 : Entity_Id := T2; begin if Is_Private_Type (T1) and then Present (Full_View (T1)) then FT1 := Full_View (T1); end if; if Is_Private_Type (T2) and then Present (Full_View (T2)) then FT2 := Full_View (T2); end if; return Root_Type (Base_Type (FT1)) = Root_Type (Base_Type (FT2)); end Same_Ancestor; -- Start of processing for Resolve_Actuals begin A := First_Actual (N); F := First_Formal (Nam); while Present (F) loop if No (A) and then Needs_No_Actuals (Nam) then null; -- If we have an error in any actual or formal, indicated by -- a type of Any_Type, then abandon resolution attempt, and -- set result type to Any_Type. elsif (Present (A) and then Etype (A) = Any_Type) or else Etype (F) = Any_Type then Set_Etype (N, Any_Type); return; end if; if Present (A) and then (Nkind (Parent (A)) /= N_Parameter_Association or else Chars (Selector_Name (Parent (A))) = Chars (F)) then -- If the formal is Out or In_Out, do not resolve and expand the -- conversion, because it is subsequently expanded into explicit -- temporaries and assignments. However, the object of the -- conversion can be resolved. An exception is the case of tagged -- type conversion with a class-wide actual. In that case we want -- the tag check to occur and no temporary will be needed (no -- representation change can occur) and the parameter is passed by -- reference, so we go ahead and resolve the type conversion. -- Another exception is the case of reference to component or -- subcomponent of a bit-packed array, in which case we want to -- defer expansion to the point the in and out assignments are -- performed. if Ekind (F) /= E_In_Parameter and then Nkind (A) = N_Type_Conversion and then not Is_Class_Wide_Type (Etype (Expression (A))) then if Ekind (F) = E_In_Out_Parameter and then Is_Array_Type (Etype (F)) then if Has_Aliased_Components (Etype (Expression (A))) /= Has_Aliased_Components (Etype (F)) then if Ada_Version < Ada_05 then Error_Msg_N ("both component types in a view conversion must be" & " aliased, or neither", A); -- Ada 2005: rule is relaxed (see AI-363) elsif Has_Aliased_Components (Etype (F)) and then not Has_Aliased_Components (Etype (Expression (A))) then Error_Msg_N ("view conversion operand must have aliased " & "components", N); Error_Msg_N ("\since target type has aliased components", N); end if; elsif not Same_Ancestor (Etype (F), Etype (Expression (A))) and then (Is_By_Reference_Type (Etype (F)) or else Is_By_Reference_Type (Etype (Expression (A)))) then Error_Msg_N ("view conversion between unrelated by reference " & "array types not allowed (\'A'I-00246)", A); end if; end if; if (Conversion_OK (A) or else Valid_Conversion (A, Etype (A), Expression (A))) and then not Is_Ref_To_Bit_Packed_Array (Expression (A)) then Resolve (Expression (A)); end if; else if Nkind (A) = N_Type_Conversion and then Is_Array_Type (Etype (F)) and then not Same_Ancestor (Etype (F), Etype (Expression (A))) and then (Is_Limited_Type (Etype (F)) or else Is_Limited_Type (Etype (Expression (A)))) then Error_Msg_N ("conversion between unrelated limited array types " & "not allowed (\A\I-00246)", A); if Is_Limited_Type (Etype (F)) then Explain_Limited_Type (Etype (F), A); end if; if Is_Limited_Type (Etype (Expression (A))) then Explain_Limited_Type (Etype (Expression (A)), A); end if; end if; -- (Ada 2005: AI-251): If the actual is an allocator whose -- directly designated type is a class-wide interface, we build -- an anonymous access type to use it as the type of the -- allocator. Later, when the subprogram call is expanded, if -- the interface has a secondary dispatch table the expander -- will add a type conversion to force the correct displacement -- of the pointer. if Nkind (A) = N_Allocator then declare DDT : constant Entity_Id := Directly_Designated_Type (Base_Type (Etype (F))); New_Itype : Entity_Id; begin if Is_Class_Wide_Type (DDT) and then Is_Interface (DDT) then New_Itype := Create_Itype (E_Anonymous_Access_Type, A); Set_Etype (New_Itype, Etype (A)); Init_Size_Align (New_Itype); Set_Directly_Designated_Type (New_Itype, Directly_Designated_Type (Etype (A))); Set_Etype (A, New_Itype); end if; end; end if; Resolve (A, Etype (F)); end if; A_Typ := Etype (A); F_Typ := Etype (F); -- Perform error checks for IN and IN OUT parameters if Ekind (F) /= E_Out_Parameter then -- Check unset reference. For scalar parameters, it is clearly -- wrong to pass an uninitialized value as either an IN or -- IN-OUT parameter. For composites, it is also clearly an -- error to pass a completely uninitialized value as an IN -- parameter, but the case of IN OUT is trickier. We prefer -- not to give a warning here. For example, suppose there is -- a routine that sets some component of a record to False. -- It is perfectly reasonable to make this IN-OUT and allow -- either initialized or uninitialized records to be passed -- in this case. -- For partially initialized composite values, we also avoid -- warnings, since it is quite likely that we are passing a -- partially initialized value and only the initialized fields -- will in fact be read in the subprogram. if Is_Scalar_Type (A_Typ) or else (Ekind (F) = E_In_Parameter and then not Is_Partially_Initialized_Type (A_Typ)) then Check_Unset_Reference (A); end if; -- In Ada 83 we cannot pass an OUT parameter as an IN or IN OUT -- actual to a nested call, since this is case of reading an -- out parameter, which is not allowed. if Ada_Version = Ada_83 and then Is_Entity_Name (A) and then Ekind (Entity (A)) = E_Out_Parameter then Error_Msg_N ("(Ada 83) illegal reading of out parameter", A); end if; end if; if Ekind (F) /= E_In_Parameter and then not Is_OK_Variable_For_Out_Formal (A) then Error_Msg_NE ("actual for& must be a variable", A, F); if Is_Entity_Name (A) then Kill_Checks (Entity (A)); else Kill_All_Checks; end if; end if; if Etype (A) = Any_Type then Set_Etype (N, Any_Type); return; end if; -- Apply appropriate range checks for in, out, and in-out -- parameters. Out and in-out parameters also need a separate -- check, if there is a type conversion, to make sure the return -- value meets the constraints of the variable before the -- conversion. -- Gigi looks at the check flag and uses the appropriate types. -- For now since one flag is used there is an optimization which -- might not be done in the In Out case since Gigi does not do -- any analysis. More thought required about this ??? if Ekind (F) = E_In_Parameter or else Ekind (F) = E_In_Out_Parameter then if Is_Scalar_Type (Etype (A)) then Apply_Scalar_Range_Check (A, F_Typ); elsif Is_Array_Type (Etype (A)) then Apply_Length_Check (A, F_Typ); elsif Is_Record_Type (F_Typ) and then Has_Discriminants (F_Typ) and then Is_Constrained (F_Typ) and then (not Is_Derived_Type (F_Typ) or else Comes_From_Source (Nam)) then Apply_Discriminant_Check (A, F_Typ); elsif Is_Access_Type (F_Typ) and then Is_Array_Type (Designated_Type (F_Typ)) and then Is_Constrained (Designated_Type (F_Typ)) then Apply_Length_Check (A, F_Typ); elsif Is_Access_Type (F_Typ) and then Has_Discriminants (Designated_Type (F_Typ)) and then Is_Constrained (Designated_Type (F_Typ)) then Apply_Discriminant_Check (A, F_Typ); else Apply_Range_Check (A, F_Typ); end if; -- Ada 2005 (AI-231) if Ada_Version >= Ada_05 and then Is_Access_Type (F_Typ) and then Can_Never_Be_Null (F_Typ) and then Nkind (A) = N_Null then Apply_Compile_Time_Constraint_Error (N => A, Msg => "(Ada 2005) NULL not allowed in " & "null-excluding formal?", Reason => CE_Null_Not_Allowed); end if; end if; if Ekind (F) = E_Out_Parameter or else Ekind (F) = E_In_Out_Parameter then if Nkind (A) = N_Type_Conversion then if Is_Scalar_Type (A_Typ) then Apply_Scalar_Range_Check (Expression (A), Etype (Expression (A)), A_Typ); else Apply_Range_Check (Expression (A), Etype (Expression (A)), A_Typ); end if; else if Is_Scalar_Type (F_Typ) then Apply_Scalar_Range_Check (A, A_Typ, F_Typ); elsif Is_Array_Type (F_Typ) and then Ekind (F) = E_Out_Parameter then Apply_Length_Check (A, F_Typ); else Apply_Range_Check (A, A_Typ, F_Typ); end if; end if; end if; -- An actual associated with an access parameter is implicitly -- converted to the anonymous access type of the formal and -- must satisfy the legality checks for access conversions. if Ekind (F_Typ) = E_Anonymous_Access_Type then if not Valid_Conversion (A, F_Typ, A) then Error_Msg_N ("invalid implicit conversion for access parameter", A); end if; end if; -- Check bad case of atomic/volatile argument (RM C.6(12)) if Is_By_Reference_Type (Etype (F)) and then Comes_From_Source (N) then if Is_Atomic_Object (A) and then not Is_Atomic (Etype (F)) then Error_Msg_N ("cannot pass atomic argument to non-atomic formal", N); elsif Is_Volatile_Object (A) and then not Is_Volatile (Etype (F)) then Error_Msg_N ("cannot pass volatile argument to non-volatile formal", N); end if; end if; -- Check that subprograms don't have improper controlling -- arguments (RM 3.9.2 (9)) if Is_Controlling_Formal (F) then Set_Is_Controlling_Actual (A); elsif Nkind (A) = N_Explicit_Dereference then Validate_Remote_Access_To_Class_Wide_Type (A); end if; if (Is_Class_Wide_Type (A_Typ) or else Is_Dynamically_Tagged (A)) and then not Is_Class_Wide_Type (F_Typ) and then not Is_Controlling_Formal (F) then Error_Msg_N ("class-wide argument not allowed here!", A); if Is_Subprogram (Nam) and then Comes_From_Source (Nam) then Error_Msg_Node_2 := F_Typ; Error_Msg_NE ("& is not a dispatching operation of &!", A, Nam); end if; elsif Is_Access_Type (A_Typ) and then Is_Access_Type (F_Typ) and then Ekind (F_Typ) /= E_Access_Subprogram_Type and then (Is_Class_Wide_Type (Designated_Type (A_Typ)) or else (Nkind (A) = N_Attribute_Reference and then Is_Class_Wide_Type (Etype (Prefix (A))))) and then not Is_Class_Wide_Type (Designated_Type (F_Typ)) and then not Is_Controlling_Formal (F) then Error_Msg_N ("access to class-wide argument not allowed here!", A); if Is_Subprogram (Nam) and then Comes_From_Source (Nam) then Error_Msg_Node_2 := Designated_Type (F_Typ); Error_Msg_NE ("& is not a dispatching operation of &!", A, Nam); end if; end if; Eval_Actual (A); -- If it is a named association, treat the selector_name as -- a proper identifier, and mark the corresponding entity. if Nkind (Parent (A)) = N_Parameter_Association then Set_Entity (Selector_Name (Parent (A)), F); Generate_Reference (F, Selector_Name (Parent (A))); Set_Etype (Selector_Name (Parent (A)), F_Typ); Generate_Reference (F_Typ, N, ' '); end if; Prev := A; if Ekind (F) /= E_Out_Parameter then Check_Unset_Reference (A); end if; Next_Actual (A); -- Case where actual is not present else Insert_Default; end if; Next_Formal (F); end loop; end Resolve_Actuals; ----------------------- -- Resolve_Allocator -- ----------------------- procedure Resolve_Allocator (N : Node_Id; Typ : Entity_Id) is E : constant Node_Id := Expression (N); Subtyp : Entity_Id; Discrim : Entity_Id; Constr : Node_Id; Disc_Exp : Node_Id; function In_Dispatching_Context return Boolean; -- If the allocator is an actual in a call, it is allowed to be -- class-wide when the context is not because it is a controlling -- actual. ---------------------------- -- In_Dispatching_Context -- ---------------------------- function In_Dispatching_Context return Boolean is Par : constant Node_Id := Parent (N); begin return (Nkind (Par) = N_Function_Call or else Nkind (Par) = N_Procedure_Call_Statement) and then Is_Entity_Name (Name (Par)) and then Is_Dispatching_Operation (Entity (Name (Par))); end In_Dispatching_Context; -- Start of processing for Resolve_Allocator begin -- Replace general access with specific type if Ekind (Etype (N)) = E_Allocator_Type then Set_Etype (N, Base_Type (Typ)); end if; if Is_Abstract (Typ) then Error_Msg_N ("type of allocator cannot be abstract", N); end if; -- For qualified expression, resolve the expression using the -- given subtype (nothing to do for type mark, subtype indication) if Nkind (E) = N_Qualified_Expression then if Is_Class_Wide_Type (Etype (E)) and then not Is_Class_Wide_Type (Designated_Type (Typ)) and then not In_Dispatching_Context then Error_Msg_N ("class-wide allocator not allowed for this access type", N); end if; Resolve (Expression (E), Etype (E)); Check_Unset_Reference (Expression (E)); -- A qualified expression requires an exact match of the type, -- class-wide matching is not allowed. if (Is_Class_Wide_Type (Etype (Expression (E))) or else Is_Class_Wide_Type (Etype (E))) and then Base_Type (Etype (Expression (E))) /= Base_Type (Etype (E)) then Wrong_Type (Expression (E), Etype (E)); end if; -- For a subtype mark or subtype indication, freeze the subtype else Freeze_Expression (E); if Is_Access_Constant (Typ) and then not No_Initialization (N) then Error_Msg_N ("initialization required for access-to-constant allocator", N); end if; -- A special accessibility check is needed for allocators that -- constrain access discriminants. The level of the type of the -- expression used to contrain an access discriminant cannot be -- deeper than the type of the allocator (in constrast to access -- parameters, where the level of the actual can be arbitrary). -- We can't use Valid_Conversion to perform this check because -- in general the type of the allocator is unrelated to the type -- of the access discriminant. Note that specialized checks are -- needed for the cases of a constraint expression which is an -- access attribute or an access discriminant. if Nkind (Original_Node (E)) = N_Subtype_Indication and then Ekind (Typ) /= E_Anonymous_Access_Type then Subtyp := Entity (Subtype_Mark (Original_Node (E))); if Has_Discriminants (Subtyp) then Discrim := First_Discriminant (Base_Type (Subtyp)); Constr := First (Constraints (Constraint (Original_Node (E)))); while Present (Discrim) and then Present (Constr) loop if Ekind (Etype (Discrim)) = E_Anonymous_Access_Type then if Nkind (Constr) = N_Discriminant_Association then Disc_Exp := Original_Node (Expression (Constr)); else Disc_Exp := Original_Node (Constr); end if; if Type_Access_Level (Etype (Disc_Exp)) > Type_Access_Level (Typ) then Error_Msg_N ("operand type has deeper level than allocator type", Disc_Exp); elsif Nkind (Disc_Exp) = N_Attribute_Reference and then Get_Attribute_Id (Attribute_Name (Disc_Exp)) = Attribute_Access and then Object_Access_Level (Prefix (Disc_Exp)) > Type_Access_Level (Typ) then Error_Msg_N ("prefix of attribute has deeper level than" & " allocator type", Disc_Exp); -- When the operand is an access discriminant the check -- is against the level of the prefix object. elsif Ekind (Etype (Disc_Exp)) = E_Anonymous_Access_Type and then Nkind (Disc_Exp) = N_Selected_Component and then Object_Access_Level (Prefix (Disc_Exp)) > Type_Access_Level (Typ) then Error_Msg_N ("access discriminant has deeper level than" & " allocator type", Disc_Exp); end if; end if; Next_Discriminant (Discrim); Next (Constr); end loop; end if; end if; end if; -- Ada 2005 (AI-344): A class-wide allocator requires an accessibility -- check that the level of the type of the created object is not deeper -- than the level of the allocator's access type, since extensions can -- now occur at deeper levels than their ancestor types. This is a -- static accessibility level check; a run-time check is also needed in -- the case of an initialized allocator with a class-wide argument (see -- Expand_Allocator_Expression). if Ada_Version >= Ada_05 and then Is_Class_Wide_Type (Designated_Type (Typ)) then declare Exp_Typ : Entity_Id; begin if Nkind (E) = N_Qualified_Expression then Exp_Typ := Etype (E); elsif Nkind (E) = N_Subtype_Indication then Exp_Typ := Entity (Subtype_Mark (Original_Node (E))); else Exp_Typ := Entity (E); end if; if Type_Access_Level (Exp_Typ) > Type_Access_Level (Typ) then if In_Instance_Body then Error_Msg_N ("?type in allocator has deeper level than" & " designated class-wide type", E); Error_Msg_N ("\?Program_Error will be raised at run time", E); Rewrite (N, Make_Raise_Program_Error (Sloc (N), Reason => PE_Accessibility_Check_Failed)); Set_Etype (N, Typ); else Error_Msg_N ("type in allocator has deeper level than" & " designated class-wide type", E); end if; end if; end; end if; -- Check for allocation from an empty storage pool if No_Pool_Assigned (Typ) then declare Loc : constant Source_Ptr := Sloc (N); begin Error_Msg_N ("?allocation from empty storage pool", N); Error_Msg_N ("\?Storage_Error will be raised at run time", N); Insert_Action (N, Make_Raise_Storage_Error (Loc, Reason => SE_Empty_Storage_Pool)); end; -- If the context is an unchecked conversion, as may happen within -- an inlined subprogram, the allocator is being resolved with its -- own anonymous type. In that case, if the target type has a specific -- storage pool, it must be inherited explicitly by the allocator type. elsif Nkind (Parent (N)) = N_Unchecked_Type_Conversion and then No (Associated_Storage_Pool (Typ)) then Set_Associated_Storage_Pool (Typ, Associated_Storage_Pool (Etype (Parent (N)))); end if; end Resolve_Allocator; --------------------------- -- Resolve_Arithmetic_Op -- --------------------------- -- Used for resolving all arithmetic operators except exponentiation procedure Resolve_Arithmetic_Op (N : Node_Id; Typ : Entity_Id) is L : constant Node_Id := Left_Opnd (N); R : constant Node_Id := Right_Opnd (N); TL : constant Entity_Id := Base_Type (Etype (L)); TR : constant Entity_Id := Base_Type (Etype (R)); T : Entity_Id; Rop : Node_Id; B_Typ : constant Entity_Id := Base_Type (Typ); -- We do the resolution using the base type, because intermediate values -- in expressions always are of the base type, not a subtype of it. function Is_Integer_Or_Universal (N : Node_Id) return Boolean; -- Return True iff given type is Integer or universal real/integer procedure Set_Mixed_Mode_Operand (N : Node_Id; T : Entity_Id); -- Choose type of integer literal in fixed-point operation to conform -- to available fixed-point type. T is the type of the other operand, -- which is needed to determine the expected type of N. procedure Set_Operand_Type (N : Node_Id); -- Set operand type to T if universal ----------------------------- -- Is_Integer_Or_Universal -- ----------------------------- function Is_Integer_Or_Universal (N : Node_Id) return Boolean is T : Entity_Id; Index : Interp_Index; It : Interp; begin if not Is_Overloaded (N) then T := Etype (N); return Base_Type (T) = Base_Type (Standard_Integer) or else T = Universal_Integer or else T = Universal_Real; else Get_First_Interp (N, Index, It); while Present (It.Typ) loop if Base_Type (It.Typ) = Base_Type (Standard_Integer) or else It.Typ = Universal_Integer or else It.Typ = Universal_Real then return True; end if; Get_Next_Interp (Index, It); end loop; end if; return False; end Is_Integer_Or_Universal; ---------------------------- -- Set_Mixed_Mode_Operand -- ---------------------------- procedure Set_Mixed_Mode_Operand (N : Node_Id; T : Entity_Id) is Index : Interp_Index; It : Interp; begin if Universal_Interpretation (N) = Universal_Integer then -- A universal integer literal is resolved as standard integer -- except in the case of a fixed-point result, where we leave it -- as universal (to be handled by Exp_Fixd later on) if Is_Fixed_Point_Type (T) then Resolve (N, Universal_Integer); else Resolve (N, Standard_Integer); end if; elsif Universal_Interpretation (N) = Universal_Real and then (T = Base_Type (Standard_Integer) or else T = Universal_Integer or else T = Universal_Real) then -- A universal real can appear in a fixed-type context. We resolve -- the literal with that context, even though this might raise an -- exception prematurely (the other operand may be zero). Resolve (N, B_Typ); elsif Etype (N) = Base_Type (Standard_Integer) and then T = Universal_Real and then Is_Overloaded (N) then -- Integer arg in mixed-mode operation. Resolve with universal -- type, in case preference rule must be applied. Resolve (N, Universal_Integer); elsif Etype (N) = T and then B_Typ /= Universal_Fixed then -- Not a mixed-mode operation, resolve with context Resolve (N, B_Typ); elsif Etype (N) = Any_Fixed then -- N may itself be a mixed-mode operation, so use context type Resolve (N, B_Typ); elsif Is_Fixed_Point_Type (T) and then B_Typ = Universal_Fixed and then Is_Overloaded (N) then -- Must be (fixed * fixed) operation, operand must have one -- compatible interpretation. Resolve (N, Any_Fixed); elsif Is_Fixed_Point_Type (B_Typ) and then (T = Universal_Real or else Is_Fixed_Point_Type (T)) and then Is_Overloaded (N) then -- C * F(X) in a fixed context, where C is a real literal or a -- fixed-point expression. F must have either a fixed type -- interpretation or an integer interpretation, but not both. Get_First_Interp (N, Index, It); while Present (It.Typ) loop if Base_Type (It.Typ) = Base_Type (Standard_Integer) then if Analyzed (N) then Error_Msg_N ("ambiguous operand in fixed operation", N); else Resolve (N, Standard_Integer); end if; elsif Is_Fixed_Point_Type (It.Typ) then if Analyzed (N) then Error_Msg_N ("ambiguous operand in fixed operation", N); else Resolve (N, It.Typ); end if; end if; Get_Next_Interp (Index, It); end loop; -- Reanalyze the literal with the fixed type of the context. If -- context is Universal_Fixed, we are within a conversion, leave -- the literal as a universal real because there is no usable -- fixed type, and the target of the conversion plays no role in -- the resolution. declare Op2 : Node_Id; T2 : Entity_Id; begin if N = L then Op2 := R; else Op2 := L; end if; if B_Typ = Universal_Fixed and then Nkind (Op2) = N_Real_Literal then T2 := Universal_Real; else T2 := B_Typ; end if; Set_Analyzed (Op2, False); Resolve (Op2, T2); end; else Resolve (N); end if; end Set_Mixed_Mode_Operand; ---------------------- -- Set_Operand_Type -- ---------------------- procedure Set_Operand_Type (N : Node_Id) is begin if Etype (N) = Universal_Integer or else Etype (N) = Universal_Real then Set_Etype (N, T); end if; end Set_Operand_Type; -- Start of processing for Resolve_Arithmetic_Op begin if Comes_From_Source (N) and then Ekind (Entity (N)) = E_Function and then Is_Imported (Entity (N)) and then Is_Intrinsic_Subprogram (Entity (N)) then Resolve_Intrinsic_Operator (N, Typ); return; -- Special-case for mixed-mode universal expressions or fixed point -- type operation: each argument is resolved separately. The same -- treatment is required if one of the operands of a fixed point -- operation is universal real, since in this case we don't do a -- conversion to a specific fixed-point type (instead the expander -- takes care of the case). elsif (B_Typ = Universal_Integer or else B_Typ = Universal_Real) and then Present (Universal_Interpretation (L)) and then Present (Universal_Interpretation (R)) then Resolve (L, Universal_Interpretation (L)); Resolve (R, Universal_Interpretation (R)); Set_Etype (N, B_Typ); elsif (B_Typ = Universal_Real or else Etype (N) = Universal_Fixed or else (Etype (N) = Any_Fixed and then Is_Fixed_Point_Type (B_Typ)) or else (Is_Fixed_Point_Type (B_Typ) and then (Is_Integer_Or_Universal (L) or else Is_Integer_Or_Universal (R)))) and then (Nkind (N) = N_Op_Multiply or else Nkind (N) = N_Op_Divide) then if TL = Universal_Integer or else TR = Universal_Integer then Check_For_Visible_Operator (N, B_Typ); end if; -- If context is a fixed type and one operand is integer, the -- other is resolved with the type of the context. if Is_Fixed_Point_Type (B_Typ) and then (Base_Type (TL) = Base_Type (Standard_Integer) or else TL = Universal_Integer) then Resolve (R, B_Typ); Resolve (L, TL); elsif Is_Fixed_Point_Type (B_Typ) and then (Base_Type (TR) = Base_Type (Standard_Integer) or else TR = Universal_Integer) then Resolve (L, B_Typ); Resolve (R, TR); else Set_Mixed_Mode_Operand (L, TR); Set_Mixed_Mode_Operand (R, TL); end if; if Etype (N) = Universal_Fixed or else Etype (N) = Any_Fixed then if B_Typ = Universal_Fixed and then Nkind (Parent (N)) /= N_Type_Conversion and then Nkind (Parent (N)) /= N_Unchecked_Type_Conversion then Error_Msg_N ("type cannot be determined from context!", N); Error_Msg_N ("\explicit conversion to result type required", N); Set_Etype (L, Any_Type); Set_Etype (R, Any_Type); else if Ada_Version = Ada_83 and then Etype (N) = Universal_Fixed and then Nkind (Parent (N)) /= N_Type_Conversion and then Nkind (Parent (N)) /= N_Unchecked_Type_Conversion then Error_Msg_N ("(Ada 83) fixed-point operation " & "needs explicit conversion", N); end if; Set_Etype (N, B_Typ); end if; elsif Is_Fixed_Point_Type (B_Typ) and then (Is_Integer_Or_Universal (L) or else Nkind (L) = N_Real_Literal or else Nkind (R) = N_Real_Literal or else Is_Integer_Or_Universal (R)) then Set_Etype (N, B_Typ); elsif Etype (N) = Any_Fixed then -- If no previous errors, this is only possible if one operand -- is overloaded and the context is universal. Resolve as such. Set_Etype (N, B_Typ); end if; else if (TL = Universal_Integer or else TL = Universal_Real) and then (TR = Universal_Integer or else TR = Universal_Real) then Check_For_Visible_Operator (N, B_Typ); end if; -- If the context is Universal_Fixed and the operands are also -- universal fixed, this is an error, unless there is only one -- applicable fixed_point type (usually duration). if B_Typ = Universal_Fixed and then Etype (L) = Universal_Fixed then T := Unique_Fixed_Point_Type (N); if T = Any_Type then Set_Etype (N, T); return; else Resolve (L, T); Resolve (R, T); end if; else Resolve (L, B_Typ); Resolve (R, B_Typ); end if; -- If one of the arguments was resolved to a non-universal type. -- label the result of the operation itself with the same type. -- Do the same for the universal argument, if any. T := Intersect_Types (L, R); Set_Etype (N, Base_Type (T)); Set_Operand_Type (L); Set_Operand_Type (R); end if; Generate_Operator_Reference (N, Typ); Eval_Arithmetic_Op (N); -- Set overflow and division checking bit. Much cleverer code needed -- here eventually and perhaps the Resolve routines should be separated -- for the various arithmetic operations, since they will need -- different processing. ??? if Nkind (N) in N_Op then if not Overflow_Checks_Suppressed (Etype (N)) then Enable_Overflow_Check (N); end if; -- Give warning if explicit division by zero if (Nkind (N) = N_Op_Divide or else Nkind (N) = N_Op_Rem or else Nkind (N) = N_Op_Mod) and then not Division_Checks_Suppressed (Etype (N)) then Rop := Right_Opnd (N); if Compile_Time_Known_Value (Rop) and then ((Is_Integer_Type (Etype (Rop)) and then Expr_Value (Rop) = Uint_0) or else (Is_Real_Type (Etype (Rop)) and then Expr_Value_R (Rop) = Ureal_0)) then Apply_Compile_Time_Constraint_Error (N, "division by zero?", CE_Divide_By_Zero, Loc => Sloc (Right_Opnd (N))); -- Otherwise just set the flag to check at run time else Set_Do_Division_Check (N); end if; end if; end if; Check_Unset_Reference (L); Check_Unset_Reference (R); end Resolve_Arithmetic_Op; ------------------ -- Resolve_Call -- ------------------ procedure Resolve_Call (N : Node_Id; Typ : Entity_Id) is Loc : constant Source_Ptr := Sloc (N); Subp : constant Node_Id := Name (N); Nam : Entity_Id; I : Interp_Index; It : Interp; Norm_OK : Boolean; Scop : Entity_Id; begin -- The context imposes a unique interpretation with type Typ on a -- procedure or function call. Find the entity of the subprogram that -- yields the expected type, and propagate the corresponding formal -- constraints on the actuals. The caller has established that an -- interpretation exists, and emitted an error if not unique. -- First deal with the case of a call to an access-to-subprogram, -- dereference made explicit in Analyze_Call. if Ekind (Etype (Subp)) = E_Subprogram_Type then if not Is_Overloaded (Subp) then Nam := Etype (Subp); else -- Find the interpretation whose type (a subprogram type) has a -- return type that is compatible with the context. Analysis of -- the node has established that one exists. Nam := Empty; Get_First_Interp (Subp, I, It); while Present (It.Typ) loop if Covers (Typ, Etype (It.Typ)) then Nam := It.Typ; exit; end if; Get_Next_Interp (I, It); end loop; if No (Nam) then raise Program_Error; end if; end if; -- If the prefix is not an entity, then resolve it if not Is_Entity_Name (Subp) then Resolve (Subp, Nam); end if; -- For an indirect call, we always invalidate checks, since we do not -- know whether the subprogram is local or global. Yes we could do -- better here, e.g. by knowing that there are no local subprograms, -- but it does not seem worth the effort. Similarly, we kill al -- knowledge of current constant values. Kill_Current_Values; -- If this is a procedure call which is really an entry call, do the -- conversion of the procedure call to an entry call. Protected -- operations use the same circuitry because the name in the call can be -- an arbitrary expression with special resolution rules. elsif Nkind (Subp) = N_Selected_Component or else Nkind (Subp) = N_Indexed_Component or else (Is_Entity_Name (Subp) and then Ekind (Entity (Subp)) = E_Entry) then Resolve_Entry_Call (N, Typ); Check_Elab_Call (N); -- Kill checks and constant values, as above for indirect case -- Who knows what happens when another task is activated? Kill_Current_Values; return; -- Normal subprogram call with name established in Resolve elsif not (Is_Type (Entity (Subp))) then Nam := Entity (Subp); Set_Entity_With_Style_Check (Subp, Nam); Generate_Reference (Nam, Subp); -- Otherwise we must have the case of an overloaded call else pragma Assert (Is_Overloaded (Subp)); Nam := Empty; -- We know that it will be assigned in loop below Get_First_Interp (Subp, I, It); while Present (It.Typ) loop if Covers (Typ, It.Typ) then Nam := It.Nam; Set_Entity_With_Style_Check (Subp, Nam); Generate_Reference (Nam, Subp); exit; end if; Get_Next_Interp (I, It); end loop; end if; -- Check that a call to Current_Task does not occur in an entry body if Is_RTE (Nam, RE_Current_Task) then declare P : Node_Id; begin P := N; loop P := Parent (P); exit when No (P); if Nkind (P) = N_Entry_Body then Error_Msg_NE ("& should not be used in entry body ('R'M C.7(17))", N, Nam); exit; end if; end loop; end; end if; -- Cannot call thread body directly if Is_Thread_Body (Nam) then Error_Msg_N ("cannot call thread body directly", N); end if; -- If the subprogram is not global, then kill all checks. This is a bit -- conservative, since in many cases we could do better, but it is not -- worth the effort. Similarly, we kill constant values. However we do -- not need to do this for internal entities (unless they are inherited -- user-defined subprograms), since they are not in the business of -- molesting global values. if not Is_Library_Level_Entity (Nam) and then (Comes_From_Source (Nam) or else (Present (Alias (Nam)) and then Comes_From_Source (Alias (Nam)))) then Kill_Current_Values; end if; -- Check for call to subprogram marked Is_Obsolescent Check_Obsolescent (Nam, N); -- Check that a procedure call does not occur in the context of the -- entry call statement of a conditional or timed entry call. Note that -- the case of a call to a subprogram renaming of an entry will also be -- rejected. The test for N not being an N_Entry_Call_Statement is -- defensive, covering the possibility that the processing of entry -- calls might reach this point due to later modifications of the code -- above. if Nkind (Parent (N)) = N_Entry_Call_Alternative and then Nkind (N) /= N_Entry_Call_Statement and then Entry_Call_Statement (Parent (N)) = N then if Ada_Version < Ada_05 then Error_Msg_N ("entry call required in select statement", N); -- Ada 2005 (AI-345): If a procedure_call_statement is used -- for a procedure_or_entry_call, the procedure_name or pro- -- cedure_prefix of the procedure_call_statement shall denote -- an entry renamed by a procedure, or (a view of) a primitive -- subprogram of a limited interface whose first parameter is -- a controlling parameter. elsif Nkind (N) = N_Procedure_Call_Statement and then not Is_Renamed_Entry (Nam) and then not Is_Controlling_Limited_Procedure (Nam) then Error_Msg_N ("entry call or dispatching primitive of interface required", N); end if; end if; -- Check that this is not a call to a protected procedure or -- entry from within a protected function. if Ekind (Current_Scope) = E_Function and then Ekind (Scope (Current_Scope)) = E_Protected_Type and then Ekind (Nam) /= E_Function and then Scope (Nam) = Scope (Current_Scope) then Error_Msg_N ("within protected function, protected " & "object is constant", N); Error_Msg_N ("\cannot call operation that may modify it", N); end if; -- Freeze the subprogram name if not in default expression. Note that we -- freeze procedure calls as well as function calls. Procedure calls are -- not frozen according to the rules (RM 13.14(14)) because it is -- impossible to have a procedure call to a non-frozen procedure in pure -- Ada, but in the code that we generate in the expander, this rule -- needs extending because we can generate procedure calls that need -- freezing. if Is_Entity_Name (Subp) and then not In_Default_Expression then Freeze_Expression (Subp); end if; -- For a predefined operator, the type of the result is the type imposed -- by context, except for a predefined operation on universal fixed. -- Otherwise The type of the call is the type returned by the subprogram -- being called. if Is_Predefined_Op (Nam) then if Etype (N) /= Universal_Fixed then Set_Etype (N, Typ); end if; -- If the subprogram returns an array type, and the context requires the -- component type of that array type, the node is really an indexing of -- the parameterless call. Resolve as such. A pathological case occurs -- when the type of the component is an access to the array type. In -- this case the call is truly ambiguous. elsif Needs_No_Actuals (Nam) and then ((Is_Array_Type (Etype (Nam)) and then Covers (Typ, Component_Type (Etype (Nam)))) or else (Is_Access_Type (Etype (Nam)) and then Is_Array_Type (Designated_Type (Etype (Nam))) and then Covers (Typ, Component_Type (Designated_Type (Etype (Nam)))))) then declare Index_Node : Node_Id; New_Subp : Node_Id; Ret_Type : constant Entity_Id := Etype (Nam); begin if Is_Access_Type (Ret_Type) and then Ret_Type = Component_Type (Designated_Type (Ret_Type)) then Error_Msg_N ("cannot disambiguate function call and indexing", N); else New_Subp := Relocate_Node (Subp); Set_Entity (Subp, Nam); if Component_Type (Ret_Type) /= Any_Type then Index_Node := Make_Indexed_Component (Loc, Prefix => Make_Function_Call (Loc, Name => New_Subp), Expressions => Parameter_Associations (N)); -- Since we are correcting a node classification error made -- by the parser, we call Replace rather than Rewrite. Replace (N, Index_Node); Set_Etype (Prefix (N), Ret_Type); Set_Etype (N, Typ); Resolve_Indexed_Component (N, Typ); Check_Elab_Call (Prefix (N)); end if; end if; return; end; else Set_Etype (N, Etype (Nam)); end if; -- In the case where the call is to an overloaded subprogram, Analyze -- calls Normalize_Actuals once per overloaded subprogram. Therefore in -- such a case Normalize_Actuals needs to be called once more to order -- the actuals correctly. Otherwise the call will have the ordering -- given by the last overloaded subprogram whether this is the correct -- one being called or not. if Is_Overloaded (Subp) then Normalize_Actuals (N, Nam, False, Norm_OK); pragma Assert (Norm_OK); end if; -- In any case, call is fully resolved now. Reset Overload flag, to -- prevent subsequent overload resolution if node is analyzed again Set_Is_Overloaded (Subp, False); Set_Is_Overloaded (N, False); -- If we are calling the current subprogram from immediately within its -- body, then that is the case where we can sometimes detect cases of -- infinite recursion statically. Do not try this in case restriction -- No_Recursion is in effect anyway. Scop := Current_Scope; if Nam = Scop and then not Restriction_Active (No_Recursion) and then Check_Infinite_Recursion (N) then -- Here we detected and flagged an infinite recursion, so we do -- not need to test the case below for further warnings. null; -- If call is to immediately containing subprogram, then check for -- the case of a possible run-time detectable infinite recursion. else while Scop /= Standard_Standard loop if Nam = Scop then -- Although in general recursion is not statically checkable, -- the case of calling an immediately containing subprogram -- is easy to catch. Check_Restriction (No_Recursion, N); -- If the recursive call is to a parameterless procedure, then -- even if we can't statically detect infinite recursion, this -- is pretty suspicious, and we output a warning. Furthermore, -- we will try later to detect some cases here at run time by -- expanding checking code (see Detect_Infinite_Recursion in -- package Exp_Ch6). -- If the recursive call is within a handler we do not emit a -- warning, because this is a common idiom: loop until input -- is correct, catch illegal input in handler and restart. if No (First_Formal (Nam)) and then Etype (Nam) = Standard_Void_Type and then not Error_Posted (N) and then Nkind (Parent (N)) /= N_Exception_Handler then Set_Has_Recursive_Call (Nam); Error_Msg_N ("possible infinite recursion?", N); Error_Msg_N ("\Storage_Error may be raised at run time?", N); end if; exit; end if; Scop := Scope (Scop); end loop; end if; -- If subprogram name is a predefined operator, it was given in -- functional notation. Replace call node with operator node, so -- that actuals can be resolved appropriately. if Is_Predefined_Op (Nam) or else Ekind (Nam) = E_Operator then Make_Call_Into_Operator (N, Typ, Entity (Name (N))); return; elsif Present (Alias (Nam)) and then Is_Predefined_Op (Alias (Nam)) then Resolve_Actuals (N, Nam); Make_Call_Into_Operator (N, Typ, Alias (Nam)); return; end if; -- Create a transient scope if the resulting type requires it -- There are 3 notable exceptions: in init procs, the transient scope -- overhead is not needed and even incorrect due to the actual expansion -- of adjust calls; the second case is enumeration literal pseudo calls, -- the other case is intrinsic subprograms (Unchecked_Conversion and -- source information functions) that do not use the secondary stack -- even though the return type is unconstrained. -- If this is an initialization call for a type whose initialization -- uses the secondary stack, we also need to create a transient scope -- for it, precisely because we will not do it within the init proc -- itself. -- If the subprogram is marked Inlined_Always, then even if it returns -- an unconstrained type the call does not require use of the secondary -- stack. if Is_Inlined (Nam) and then Present (First_Rep_Item (Nam)) and then Nkind (First_Rep_Item (Nam)) = N_Pragma and then Chars (First_Rep_Item (Nam)) = Name_Inline_Always then null; elsif Expander_Active and then Is_Type (Etype (Nam)) and then Requires_Transient_Scope (Etype (Nam)) and then Ekind (Nam) /= E_Enumeration_Literal and then not Within_Init_Proc and then not Is_Intrinsic_Subprogram (Nam) then Establish_Transient_Scope (N, Sec_Stack => not Functions_Return_By_DSP_On_Target); -- If the call appears within the bounds of a loop, it will -- be rewritten and reanalyzed, nothing left to do here. if Nkind (N) /= N_Function_Call then return; end if; elsif Is_Init_Proc (Nam) and then not Within_Init_Proc then Check_Initialization_Call (N, Nam); end if; -- A protected function cannot be called within the definition of the -- enclosing protected type. if Is_Protected_Type (Scope (Nam)) and then In_Open_Scopes (Scope (Nam)) and then not Has_Completion (Scope (Nam)) then Error_Msg_NE ("& cannot be called before end of protected definition", N, Nam); end if; -- Propagate interpretation to actuals, and add default expressions -- where needed. if Present (First_Formal (Nam)) then Resolve_Actuals (N, Nam); -- Overloaded literals are rewritten as function calls, for -- purpose of resolution. After resolution, we can replace -- the call with the literal itself. elsif Ekind (Nam) = E_Enumeration_Literal then Copy_Node (Subp, N); Resolve_Entity_Name (N, Typ); -- Avoid validation, since it is a static function call return; end if; -- If the subprogram is a primitive operation, check whether or not -- it is a correct dispatching call. if Is_Overloadable (Nam) and then Is_Dispatching_Operation (Nam) then Check_Dispatching_Call (N); elsif Is_Abstract (Nam) and then not In_Instance then Error_Msg_NE ("cannot call abstract subprogram &!", N, Nam); end if; if Is_Intrinsic_Subprogram (Nam) then Check_Intrinsic_Call (N); end if; Eval_Call (N); Check_Elab_Call (N); end Resolve_Call; ------------------------------- -- Resolve_Character_Literal -- ------------------------------- procedure Resolve_Character_Literal (N : Node_Id; Typ : Entity_Id) is B_Typ : constant Entity_Id := Base_Type (Typ); C : Entity_Id; begin -- Verify that the character does belong to the type of the context Set_Etype (N, B_Typ); Eval_Character_Literal (N); -- Wide_Wide_Character literals must always be defined, since the set -- of wide wide character literals is complete, i.e. if a character -- literal is accepted by the parser, then it is OK for wide wide -- character (out of range character literals are rejected). if Root_Type (B_Typ) = Standard_Wide_Wide_Character then return; -- Always accept character literal for type Any_Character, which -- occurs in error situations and in comparisons of literals, both -- of which should accept all literals. elsif B_Typ = Any_Character then return; -- For Standard.Character or a type derived from it, check that -- the literal is in range elsif Root_Type (B_Typ) = Standard_Character then if In_Character_Range (UI_To_CC (Char_Literal_Value (N))) then return; end if; -- For Standard.Wide_Character or a type derived from it, check -- that the literal is in range elsif Root_Type (B_Typ) = Standard_Wide_Character then if In_Wide_Character_Range (UI_To_CC (Char_Literal_Value (N))) then return; end if; -- For Standard.Wide_Wide_Character or a type derived from it, we -- know the literal is in range, since the parser checked! elsif Root_Type (B_Typ) = Standard_Wide_Wide_Character then return; -- If the entity is already set, this has already been resolved in -- a generic context, or comes from expansion. Nothing else to do. elsif Present (Entity (N)) then return; -- Otherwise we have a user defined character type, and we can use -- the standard visibility mechanisms to locate the referenced entity else C := Current_Entity (N); while Present (C) loop if Etype (C) = B_Typ then Set_Entity_With_Style_Check (N, C); Generate_Reference (C, N); return; end if; C := Homonym (C); end loop; end if; -- If we fall through, then the literal does not match any of the -- entries of the enumeration type. This isn't just a constraint -- error situation, it is an illegality (see RM 4.2). Error_Msg_NE ("character not defined for }", N, First_Subtype (B_Typ)); end Resolve_Character_Literal; --------------------------- -- Resolve_Comparison_Op -- --------------------------- -- Context requires a boolean type, and plays no role in resolution. -- Processing identical to that for equality operators. The result -- type is the base type, which matters when pathological subtypes of -- booleans with limited ranges are used. procedure Resolve_Comparison_Op (N : Node_Id; Typ : Entity_Id) is L : constant Node_Id := Left_Opnd (N); R : constant Node_Id := Right_Opnd (N); T : Entity_Id; begin -- If this is an intrinsic operation which is not predefined, use -- the types of its declared arguments to resolve the possibly -- overloaded operands. Otherwise the operands are unambiguous and -- specify the expected type. if Scope (Entity (N)) /= Standard_Standard then T := Etype (First_Entity (Entity (N))); else T := Find_Unique_Type (L, R); if T = Any_Fixed then T := Unique_Fixed_Point_Type (L); end if; end if; Set_Etype (N, Base_Type (Typ)); Generate_Reference (T, N, ' '); if T /= Any_Type then if T = Any_String or else T = Any_Composite or else T = Any_Character then if T = Any_Character then Ambiguous_Character (L); else Error_Msg_N ("ambiguous operands for comparison", N); end if; Set_Etype (N, Any_Type); return; else Resolve (L, T); Resolve (R, T); Check_Unset_Reference (L); Check_Unset_Reference (R); Generate_Operator_Reference (N, T); Eval_Relational_Op (N); end if; end if; end Resolve_Comparison_Op; ------------------------------------ -- Resolve_Conditional_Expression -- ------------------------------------ procedure Resolve_Conditional_Expression (N : Node_Id; Typ : Entity_Id) is Condition : constant Node_Id := First (Expressions (N)); Then_Expr : constant Node_Id := Next (Condition); Else_Expr : constant Node_Id := Next (Then_Expr); begin Resolve (Condition, Standard_Boolean); Resolve (Then_Expr, Typ); Resolve (Else_Expr, Typ); Set_Etype (N, Typ); Eval_Conditional_Expression (N); end Resolve_Conditional_Expression; ----------------------------------------- -- Resolve_Discrete_Subtype_Indication -- ----------------------------------------- procedure Resolve_Discrete_Subtype_Indication (N : Node_Id; Typ : Entity_Id) is R : Node_Id; S : Entity_Id; begin Analyze (Subtype_Mark (N)); S := Entity (Subtype_Mark (N)); if Nkind (Constraint (N)) /= N_Range_Constraint then Error_Msg_N ("expect range constraint for discrete type", N); Set_Etype (N, Any_Type); else R := Range_Expression (Constraint (N)); if R = Error then return; end if; Analyze (R); if Base_Type (S) /= Base_Type (Typ) then Error_Msg_NE ("expect subtype of }", N, First_Subtype (Typ)); -- Rewrite the constraint as a range of Typ -- to allow compilation to proceed further. Set_Etype (N, Typ); Rewrite (Low_Bound (R), Make_Attribute_Reference (Sloc (Low_Bound (R)), Prefix => New_Occurrence_Of (Typ, Sloc (R)), Attribute_Name => Name_First)); Rewrite (High_Bound (R), Make_Attribute_Reference (Sloc (High_Bound (R)), Prefix => New_Occurrence_Of (Typ, Sloc (R)), Attribute_Name => Name_First)); else Resolve (R, Typ); Set_Etype (N, Etype (R)); -- Additionally, we must check that the bounds are compatible -- with the given subtype, which might be different from the -- type of the context. Apply_Range_Check (R, S); -- ??? If the above check statically detects a Constraint_Error -- it replaces the offending bound(s) of the range R with a -- Constraint_Error node. When the itype which uses these bounds -- is frozen the resulting call to Duplicate_Subexpr generates -- a new temporary for the bounds. -- Unfortunately there are other itypes that are also made depend -- on these bounds, so when Duplicate_Subexpr is called they get -- a forward reference to the newly created temporaries and Gigi -- aborts on such forward references. This is probably sign of a -- more fundamental problem somewhere else in either the order of -- itype freezing or the way certain itypes are constructed. -- To get around this problem we call Remove_Side_Effects right -- away if either bounds of R are a Constraint_Error. declare L : constant Node_Id := Low_Bound (R); H : constant Node_Id := High_Bound (R); begin if Nkind (L) = N_Raise_Constraint_Error then Remove_Side_Effects (L); end if; if Nkind (H) = N_Raise_Constraint_Error then Remove_Side_Effects (H); end if; end; Check_Unset_Reference (Low_Bound (R)); Check_Unset_Reference (High_Bound (R)); end if; end if; end Resolve_Discrete_Subtype_Indication; ------------------------- -- Resolve_Entity_Name -- ------------------------- -- Used to resolve identifiers and expanded names procedure Resolve_Entity_Name (N : Node_Id; Typ : Entity_Id) is E : constant Entity_Id := Entity (N); begin -- If garbage from errors, set to Any_Type and return if No (E) and then Total_Errors_Detected /= 0 then Set_Etype (N, Any_Type); return; end if; -- Replace named numbers by corresponding literals. Note that this is -- the one case where Resolve_Entity_Name must reset the Etype, since -- it is currently marked as universal. if Ekind (E) = E_Named_Integer then Set_Etype (N, Typ); Eval_Named_Integer (N); elsif Ekind (E) = E_Named_Real then Set_Etype (N, Typ); Eval_Named_Real (N); -- Allow use of subtype only if it is a concurrent type where we are -- currently inside the body. This will eventually be expanded -- into a call to Self (for tasks) or _object (for protected -- objects). Any other use of a subtype is invalid. elsif Is_Type (E) then if Is_Concurrent_Type (E) and then In_Open_Scopes (E) then null; else Error_Msg_N ("invalid use of subtype mark in expression or call", N); end if; -- Check discriminant use if entity is discriminant in current scope, -- i.e. discriminant of record or concurrent type currently being -- analyzed. Uses in corresponding body are unrestricted. elsif Ekind (E) = E_Discriminant and then Scope (E) = Current_Scope and then not Has_Completion (Current_Scope) then Check_Discriminant_Use (N); -- A parameterless generic function cannot appear in a context that -- requires resolution. elsif Ekind (E) = E_Generic_Function then Error_Msg_N ("illegal use of generic function", N); elsif Ekind (E) = E_Out_Parameter and then Ada_Version = Ada_83 and then (Nkind (Parent (N)) in N_Op or else (Nkind (Parent (N)) = N_Assignment_Statement and then N = Expression (Parent (N))) or else Nkind (Parent (N)) = N_Explicit_Dereference) then Error_Msg_N ("(Ada 83) illegal reading of out parameter", N); -- In all other cases, just do the possible static evaluation else -- A deferred constant that appears in an expression must have -- a completion, unless it has been removed by in-place expansion -- of an aggregate. if Ekind (E) = E_Constant and then Comes_From_Source (E) and then No (Constant_Value (E)) and then Is_Frozen (Etype (E)) and then not In_Default_Expression and then not Is_Imported (E) then if No_Initialization (Parent (E)) or else (Present (Full_View (E)) and then No_Initialization (Parent (Full_View (E)))) then null; else Error_Msg_N ( "deferred constant is frozen before completion", N); end if; end if; Eval_Entity_Name (N); end if; end Resolve_Entity_Name; ------------------- -- Resolve_Entry -- ------------------- procedure Resolve_Entry (Entry_Name : Node_Id) is Loc : constant Source_Ptr := Sloc (Entry_Name); Nam : Entity_Id; New_N : Node_Id; S : Entity_Id; Tsk : Entity_Id; E_Name : Node_Id; Index : Node_Id; function Actual_Index_Type (E : Entity_Id) return Entity_Id; -- If the bounds of the entry family being called depend on task -- discriminants, build a new index subtype where a discriminant is -- replaced with the value of the discriminant of the target task. -- The target task is the prefix of the entry name in the call. ----------------------- -- Actual_Index_Type -- ----------------------- function Actual_Index_Type (E : Entity_Id) return Entity_Id is Typ : constant Entity_Id := Entry_Index_Type (E); Tsk : constant Entity_Id := Scope (E); Lo : constant Node_Id := Type_Low_Bound (Typ); Hi : constant Node_Id := Type_High_Bound (Typ); New_T : Entity_Id; function Actual_Discriminant_Ref (Bound : Node_Id) return Node_Id; -- If the bound is given by a discriminant, replace with a reference -- to the discriminant of the same name in the target task. -- If the entry name is the target of a requeue statement and the -- entry is in the current protected object, the bound to be used -- is the discriminal of the object (see apply_range_checks for -- details of the transformation). ----------------------------- -- Actual_Discriminant_Ref -- ----------------------------- function Actual_Discriminant_Ref (Bound : Node_Id) return Node_Id is Typ : constant Entity_Id := Etype (Bound); Ref : Node_Id; begin Remove_Side_Effects (Bound); if not Is_Entity_Name (Bound) or else Ekind (Entity (Bound)) /= E_Discriminant then return Bound; elsif Is_Protected_Type (Tsk) and then In_Open_Scopes (Tsk) and then Nkind (Parent (Entry_Name)) = N_Requeue_Statement then return New_Occurrence_Of (Discriminal (Entity (Bound)), Loc); else Ref := Make_Selected_Component (Loc, Prefix => New_Copy_Tree (Prefix (Prefix (Entry_Name))), Selector_Name => New_Occurrence_Of (Entity (Bound), Loc)); Analyze (Ref); Resolve (Ref, Typ); return Ref; end if; end Actual_Discriminant_Ref; -- Start of processing for Actual_Index_Type begin if not Has_Discriminants (Tsk) or else (not Is_Entity_Name (Lo) and then not Is_Entity_Name (Hi)) then return Entry_Index_Type (E); else New_T := Create_Itype (Ekind (Typ), Parent (Entry_Name)); Set_Etype (New_T, Base_Type (Typ)); Set_Size_Info (New_T, Typ); Set_RM_Size (New_T, RM_Size (Typ)); Set_Scalar_Range (New_T, Make_Range (Sloc (Entry_Name), Low_Bound => Actual_Discriminant_Ref (Lo), High_Bound => Actual_Discriminant_Ref (Hi))); return New_T; end if; end Actual_Index_Type; -- Start of processing of Resolve_Entry begin -- Find name of entry being called, and resolve prefix of name -- with its own type. The prefix can be overloaded, and the name -- and signature of the entry must be taken into account. if Nkind (Entry_Name) = N_Indexed_Component then -- Case of dealing with entry family within the current tasks E_Name := Prefix (Entry_Name); else E_Name := Entry_Name; end if; if Is_Entity_Name (E_Name) then -- Entry call to an entry (or entry family) in the current task. -- This is legal even though the task will deadlock. Rewrite as -- call to current task. -- This can also be a call to an entry in an enclosing task. -- If this is a single task, we have to retrieve its name, -- because the scope of the entry is the task type, not the -- object. If the enclosing task is a task type, the identity -- of the task is given by its own self variable. -- Finally this can be a requeue on an entry of the same task -- or protected object. S := Scope (Entity (E_Name)); for J in reverse 0 .. Scope_Stack.Last loop if Is_Task_Type (Scope_Stack.Table (J).Entity) and then not Comes_From_Source (S) then -- S is an enclosing task or protected object. The concurrent -- declaration has been converted into a type declaration, and -- the object itself has an object declaration that follows -- the type in the same declarative part. Tsk := Next_Entity (S); while Etype (Tsk) /= S loop Next_Entity (Tsk); end loop; S := Tsk; exit; elsif S = Scope_Stack.Table (J).Entity then -- Call to current task. Will be transformed into call to Self exit; end if; end loop; New_N := Make_Selected_Component (Loc, Prefix => New_Occurrence_Of (S, Loc), Selector_Name => New_Occurrence_Of (Entity (E_Name), Loc)); Rewrite (E_Name, New_N); Analyze (E_Name); elsif Nkind (Entry_Name) = N_Selected_Component and then Is_Overloaded (Prefix (Entry_Name)) then -- Use the entry name (which must be unique at this point) to -- find the prefix that returns the corresponding task type or -- protected type. declare Pref : constant Node_Id := Prefix (Entry_Name); Ent : constant Entity_Id := Entity (Selector_Name (Entry_Name)); I : Interp_Index; It : Interp; begin Get_First_Interp (Pref, I, It); while Present (It.Typ) loop if Scope (Ent) = It.Typ then Set_Etype (Pref, It.Typ); exit; end if; Get_Next_Interp (I, It); end loop; end; end if; if Nkind (Entry_Name) = N_Selected_Component then Resolve (Prefix (Entry_Name)); else pragma Assert (Nkind (Entry_Name) = N_Indexed_Component); Nam := Entity (Selector_Name (Prefix (Entry_Name))); Resolve (Prefix (Prefix (Entry_Name))); Index := First (Expressions (Entry_Name)); Resolve (Index, Entry_Index_Type (Nam)); -- Up to this point the expression could have been the actual -- in a simple entry call, and be given by a named association. if Nkind (Index) = N_Parameter_Association then Error_Msg_N ("expect expression for entry index", Index); else Apply_Range_Check (Index, Actual_Index_Type (Nam)); end if; end if; end Resolve_Entry; ------------------------ -- Resolve_Entry_Call -- ------------------------ procedure Resolve_Entry_Call (N : Node_Id; Typ : Entity_Id) is Entry_Name : constant Node_Id := Name (N); Loc : constant Source_Ptr := Sloc (Entry_Name); Actuals : List_Id; First_Named : Node_Id; Nam : Entity_Id; Norm_OK : Boolean; Obj : Node_Id; Was_Over : Boolean; begin -- We kill all checks here, because it does not seem worth the -- effort to do anything better, an entry call is a big operation. Kill_All_Checks; -- Processing of the name is similar for entry calls and protected -- operation calls. Once the entity is determined, we can complete -- the resolution of the actuals. -- The selector may be overloaded, in the case of a protected object -- with overloaded functions. The type of the context is used for -- resolution. if Nkind (Entry_Name) = N_Selected_Component and then Is_Overloaded (Selector_Name (Entry_Name)) and then Typ /= Standard_Void_Type then declare I : Interp_Index; It : Interp; begin Get_First_Interp (Selector_Name (Entry_Name), I, It); while Present (It.Typ) loop if Covers (Typ, It.Typ) then Set_Entity (Selector_Name (Entry_Name), It.Nam); Set_Etype (Entry_Name, It.Typ); Generate_Reference (It.Typ, N, ' '); end if; Get_Next_Interp (I, It); end loop; end; end if; Resolve_Entry (Entry_Name); if Nkind (Entry_Name) = N_Selected_Component then -- Simple entry call Nam := Entity (Selector_Name (Entry_Name)); Obj := Prefix (Entry_Name); Was_Over := Is_Overloaded (Selector_Name (Entry_Name)); else pragma Assert (Nkind (Entry_Name) = N_Indexed_Component); -- Call to member of entry family Nam := Entity (Selector_Name (Prefix (Entry_Name))); Obj := Prefix (Prefix (Entry_Name)); Was_Over := Is_Overloaded (Selector_Name (Prefix (Entry_Name))); end if; -- We cannot in general check the maximum depth of protected entry -- calls at compile time. But we can tell that any protected entry -- call at all violates a specified nesting depth of zero. if Is_Protected_Type (Scope (Nam)) then Check_Restriction (Max_Entry_Queue_Length, N); end if; -- Use context type to disambiguate a protected function that can be -- called without actuals and that returns an array type, and where -- the argument list may be an indexing of the returned value. if Ekind (Nam) = E_Function and then Needs_No_Actuals (Nam) and then Present (Parameter_Associations (N)) and then ((Is_Array_Type (Etype (Nam)) and then Covers (Typ, Component_Type (Etype (Nam)))) or else (Is_Access_Type (Etype (Nam)) and then Is_Array_Type (Designated_Type (Etype (Nam))) and then Covers (Typ, Component_Type (Designated_Type (Etype (Nam)))))) then declare Index_Node : Node_Id; begin Index_Node := Make_Indexed_Component (Loc, Prefix => Make_Function_Call (Loc, Name => Relocate_Node (Entry_Name)), Expressions => Parameter_Associations (N)); -- Since we are correcting a node classification error made by -- the parser, we call Replace rather than Rewrite. Replace (N, Index_Node); Set_Etype (Prefix (N), Etype (Nam)); Set_Etype (N, Typ); Resolve_Indexed_Component (N, Typ); return; end; end if; -- The operation name may have been overloaded. Order the actuals -- according to the formals of the resolved entity, and set the -- return type to that of the operation. if Was_Over then Normalize_Actuals (N, Nam, False, Norm_OK); pragma Assert (Norm_OK); Set_Etype (N, Etype (Nam)); end if; Resolve_Actuals (N, Nam); Generate_Reference (Nam, Entry_Name); if Ekind (Nam) = E_Entry or else Ekind (Nam) = E_Entry_Family then Check_Potentially_Blocking_Operation (N); end if; -- Verify that a procedure call cannot masquerade as an entry -- call where an entry call is expected. if Ekind (Nam) = E_Procedure then if Nkind (Parent (N)) = N_Entry_Call_Alternative and then N = Entry_Call_Statement (Parent (N)) then Error_Msg_N ("entry call required in select statement", N); elsif Nkind (Parent (N)) = N_Triggering_Alternative and then N = Triggering_Statement (Parent (N)) then Error_Msg_N ("triggering statement cannot be procedure call", N); elsif Ekind (Scope (Nam)) = E_Task_Type and then not In_Open_Scopes (Scope (Nam)) then Error_Msg_N ("task has no entry with this name", Entry_Name); end if; end if; -- After resolution, entry calls and protected procedure calls -- are changed into entry calls, for expansion. The structure -- of the node does not change, so it can safely be done in place. -- Protected function calls must keep their structure because they -- are subexpressions. if Ekind (Nam) /= E_Function then -- A protected operation that is not a function may modify the -- corresponding object, and cannot apply to a constant. -- If this is an internal call, the prefix is the type itself. if Is_Protected_Type (Scope (Nam)) and then not Is_Variable (Obj) and then (not Is_Entity_Name (Obj) or else not Is_Type (Entity (Obj))) then Error_Msg_N ("prefix of protected procedure or entry call must be variable", Entry_Name); end if; Actuals := Parameter_Associations (N); First_Named := First_Named_Actual (N); Rewrite (N, Make_Entry_Call_Statement (Loc, Name => Entry_Name, Parameter_Associations => Actuals)); Set_First_Named_Actual (N, First_Named); Set_Analyzed (N, True); -- Protected functions can return on the secondary stack, in which -- case we must trigger the transient scope mechanism. elsif Expander_Active and then Requires_Transient_Scope (Etype (Nam)) then Establish_Transient_Scope (N, Sec_Stack => not Functions_Return_By_DSP_On_Target); end if; end Resolve_Entry_Call; ------------------------- -- Resolve_Equality_Op -- ------------------------- -- Both arguments must have the same type, and the boolean context -- does not participate in the resolution. The first pass verifies -- that the interpretation is not ambiguous, and the type of the left -- argument is correctly set, or is Any_Type in case of ambiguity. -- If both arguments are strings or aggregates, allocators, or Null, -- they are ambiguous even though they carry a single (universal) type. -- Diagnose this case here. procedure Resolve_Equality_Op (N : Node_Id; Typ : Entity_Id) is L : constant Node_Id := Left_Opnd (N); R : constant Node_Id := Right_Opnd (N); T : Entity_Id := Find_Unique_Type (L, R); function Find_Unique_Access_Type return Entity_Id; -- In the case of allocators, make a last-ditch attempt to find a single -- access type with the right designated type. This is semantically -- dubious, and of no interest to any real code, but c48008a makes it -- all worthwhile. ----------------------------- -- Find_Unique_Access_Type -- ----------------------------- function Find_Unique_Access_Type return Entity_Id is Acc : Entity_Id; E : Entity_Id; S : Entity_Id; begin if Ekind (Etype (R)) = E_Allocator_Type then Acc := Designated_Type (Etype (R)); elsif Ekind (Etype (L)) = E_Allocator_Type then Acc := Designated_Type (Etype (L)); else return Empty; end if; S := Current_Scope; while S /= Standard_Standard loop E := First_Entity (S); while Present (E) loop if Is_Type (E) and then Is_Access_Type (E) and then Ekind (E) /= E_Allocator_Type and then Designated_Type (E) = Base_Type (Acc) then return E; end if; Next_Entity (E); end loop; S := Scope (S); end loop; return Empty; end Find_Unique_Access_Type; -- Start of processing for Resolve_Equality_Op begin Set_Etype (N, Base_Type (Typ)); Generate_Reference (T, N, ' '); if T = Any_Fixed then T := Unique_Fixed_Point_Type (L); end if; if T /= Any_Type then if T = Any_String or else T = Any_Composite or else T = Any_Character then if T = Any_Character then Ambiguous_Character (L); else Error_Msg_N ("ambiguous operands for equality", N); end if; Set_Etype (N, Any_Type); return; elsif T = Any_Access or else Ekind (T) = E_Allocator_Type then T := Find_Unique_Access_Type; if No (T) then Error_Msg_N ("ambiguous operands for equality", N); Set_Etype (N, Any_Type); return; end if; end if; Resolve (L, T); Resolve (R, T); if Warn_On_Redundant_Constructs and then Comes_From_Source (N) and then Is_Entity_Name (R) and then Entity (R) = Standard_True and then Comes_From_Source (R) then Error_Msg_N ("comparison with True is redundant?", R); end if; Check_Unset_Reference (L); Check_Unset_Reference (R); Generate_Operator_Reference (N, T); -- If this is an inequality, it may be the implicit inequality -- created for a user-defined operation, in which case the corres- -- ponding equality operation is not intrinsic, and the operation -- cannot be constant-folded. Else fold. if Nkind (N) = N_Op_Eq or else Comes_From_Source (Entity (N)) or else Ekind (Entity (N)) = E_Operator or else Is_Intrinsic_Subprogram (Corresponding_Equality (Entity (N))) then Eval_Relational_Op (N); elsif Nkind (N) = N_Op_Ne and then Is_Abstract (Entity (N)) then Error_Msg_NE ("cannot call abstract subprogram &!", N, Entity (N)); end if; -- Ada 2005: If one operand is an anonymous access type, convert -- the other operand to it, to ensure that the underlying types -- match in the back-end. -- We apply the same conversion in the case one of the operands is -- a private subtype of the type of the other. if Expander_Active and then (Ekind (T) = E_Anonymous_Access_Type or else Is_Private_Type (T)) then if Etype (L) /= T then Rewrite (L, Make_Unchecked_Type_Conversion (Sloc (L), Subtype_Mark => New_Occurrence_Of (T, Sloc (L)), Expression => Relocate_Node (L))); Analyze_And_Resolve (L, T); end if; if (Etype (R)) /= T then Rewrite (R, Make_Unchecked_Type_Conversion (Sloc (R), Subtype_Mark => New_Occurrence_Of (Etype (L), Sloc (R)), Expression => Relocate_Node (R))); Analyze_And_Resolve (R, T); end if; end if; end if; end Resolve_Equality_Op; ---------------------------------- -- Resolve_Explicit_Dereference -- ---------------------------------- procedure Resolve_Explicit_Dereference (N : Node_Id; Typ : Entity_Id) is Loc : constant Source_Ptr := Sloc (N); New_N : Node_Id; P : constant Node_Id := Prefix (N); I : Interp_Index; It : Interp; begin Check_Fully_Declared_Prefix (Typ, P); if Is_Overloaded (P) then -- Use the context type to select the prefix that has the correct -- designated type. Get_First_Interp (P, I, It); while Present (It.Typ) loop exit when Is_Access_Type (It.Typ) and then Covers (Typ, Designated_Type (It.Typ)); Get_Next_Interp (I, It); end loop; if Present (It.Typ) then Resolve (P, It.Typ); else -- If no interpretation covers the designated type of the prefix, -- this is the pathological case where not all implementations of -- the prefix allow the interpretation of the node as a call. Now -- that the expected type is known, Remove other interpretations -- from prefix, rewrite it as a call, and resolve again, so that -- the proper call node is generated. Get_First_Interp (P, I, It); while Present (It.Typ) loop if Ekind (It.Typ) /= E_Access_Subprogram_Type then Remove_Interp (I); end if; Get_Next_Interp (I, It); end loop; New_N := Make_Function_Call (Loc, Name => Make_Explicit_Dereference (Loc, Prefix => P), Parameter_Associations => New_List); Save_Interps (N, New_N); Rewrite (N, New_N); Analyze_And_Resolve (N, Typ); return; end if; Set_Etype (N, Designated_Type (It.Typ)); else Resolve (P); end if; if Is_Access_Type (Etype (P)) then Apply_Access_Check (N); end if; -- If the designated type is a packed unconstrained array type, and the -- explicit dereference is not in the context of an attribute reference, -- then we must compute and set the actual subtype, since it is needed -- by Gigi. The reason we exclude the attribute case is that this is -- handled fine by Gigi, and in fact we use such attributes to build the -- actual subtype. We also exclude generated code (which builds actual -- subtypes directly if they are needed). if Is_Array_Type (Etype (N)) and then Is_Packed (Etype (N)) and then not Is_Constrained (Etype (N)) and then Nkind (Parent (N)) /= N_Attribute_Reference and then Comes_From_Source (N) then Set_Etype (N, Get_Actual_Subtype (N)); end if; -- Note: there is no Eval processing required for an explicit deference, -- because the type is known to be an allocators, and allocator -- expressions can never be static. end Resolve_Explicit_Dereference; ------------------------------- -- Resolve_Indexed_Component -- ------------------------------- procedure Resolve_Indexed_Component (N : Node_Id; Typ : Entity_Id) is Name : constant Node_Id := Prefix (N); Expr : Node_Id; Array_Type : Entity_Id := Empty; -- to prevent junk warning Index : Node_Id; begin if Is_Overloaded (Name) then -- Use the context type to select the prefix that yields the correct -- component type. declare I : Interp_Index; It : Interp; I1 : Interp_Index := 0; P : constant Node_Id := Prefix (N); Found : Boolean := False; begin Get_First_Interp (P, I, It); while Present (It.Typ) loop if (Is_Array_Type (It.Typ) and then Covers (Typ, Component_Type (It.Typ))) or else (Is_Access_Type (It.Typ) and then Is_Array_Type (Designated_Type (It.Typ)) and then Covers (Typ, Component_Type (Designated_Type (It.Typ)))) then if Found then It := Disambiguate (P, I1, I, Any_Type); if It = No_Interp then Error_Msg_N ("ambiguous prefix for indexing", N); Set_Etype (N, Typ); return; else Found := True; Array_Type := It.Typ; I1 := I; end if; else Found := True; Array_Type := It.Typ; I1 := I; end if; end if; Get_Next_Interp (I, It); end loop; end; else Array_Type := Etype (Name); end if; Resolve (Name, Array_Type); Array_Type := Get_Actual_Subtype_If_Available (Name); -- If prefix is access type, dereference to get real array type. -- Note: we do not apply an access check because the expander always -- introduces an explicit dereference, and the check will happen there. if Is_Access_Type (Array_Type) then Array_Type := Designated_Type (Array_Type); end if; -- If name was overloaded, set component type correctly now Set_Etype (N, Component_Type (Array_Type)); Index := First_Index (Array_Type); Expr := First (Expressions (N)); -- The prefix may have resolved to a string literal, in which case its -- etype has a special representation. This is only possible currently -- if the prefix is a static concatenation, written in functional -- notation. if Ekind (Array_Type) = E_String_Literal_Subtype then Resolve (Expr, Standard_Positive); else while Present (Index) and Present (Expr) loop Resolve (Expr, Etype (Index)); Check_Unset_Reference (Expr); if Is_Scalar_Type (Etype (Expr)) then Apply_Scalar_Range_Check (Expr, Etype (Index)); else Apply_Range_Check (Expr, Get_Actual_Subtype (Index)); end if; Next_Index (Index); Next (Expr); end loop; end if; Eval_Indexed_Component (N); end Resolve_Indexed_Component; ----------------------------- -- Resolve_Integer_Literal -- ----------------------------- procedure Resolve_Integer_Literal (N : Node_Id; Typ : Entity_Id) is begin Set_Etype (N, Typ); Eval_Integer_Literal (N); end Resolve_Integer_Literal; -------------------------------- -- Resolve_Intrinsic_Operator -- -------------------------------- procedure Resolve_Intrinsic_Operator (N : Node_Id; Typ : Entity_Id) is Btyp : constant Entity_Id := Base_Type (Underlying_Type (Typ)); Op : Entity_Id; Arg1 : Node_Id; Arg2 : Node_Id; begin Op := Entity (N); while Scope (Op) /= Standard_Standard loop Op := Homonym (Op); pragma Assert (Present (Op)); end loop; Set_Entity (N, Op); Set_Is_Overloaded (N, False); -- If the operand type is private, rewrite with suitable conversions on -- the operands and the result, to expose the proper underlying numeric -- type. if Is_Private_Type (Typ) then Arg1 := Unchecked_Convert_To (Btyp, Left_Opnd (N)); if Nkind (N) = N_Op_Expon then Arg2 := Unchecked_Convert_To (Standard_Integer, Right_Opnd (N)); else Arg2 := Unchecked_Convert_To (Btyp, Right_Opnd (N)); end if; Save_Interps (Left_Opnd (N), Expression (Arg1)); Save_Interps (Right_Opnd (N), Expression (Arg2)); Set_Left_Opnd (N, Arg1); Set_Right_Opnd (N, Arg2); Set_Etype (N, Btyp); Rewrite (N, Unchecked_Convert_To (Typ, N)); Resolve (N, Typ); elsif Typ /= Etype (Left_Opnd (N)) or else Typ /= Etype (Right_Opnd (N)) then -- Add explicit conversion where needed, and save interpretations -- in case operands are overloaded. Arg1 := Convert_To (Typ, Left_Opnd (N)); Arg2 := Convert_To (Typ, Right_Opnd (N)); if Nkind (Arg1) = N_Type_Conversion then Save_Interps (Left_Opnd (N), Expression (Arg1)); else Save_Interps (Left_Opnd (N), Arg1); end if; if Nkind (Arg2) = N_Type_Conversion then Save_Interps (Right_Opnd (N), Expression (Arg2)); else Save_Interps (Right_Opnd (N), Arg2); end if; Rewrite (Left_Opnd (N), Arg1); Rewrite (Right_Opnd (N), Arg2); Analyze (Arg1); Analyze (Arg2); Resolve_Arithmetic_Op (N, Typ); else Resolve_Arithmetic_Op (N, Typ); end if; end Resolve_Intrinsic_Operator; -------------------------------------- -- Resolve_Intrinsic_Unary_Operator -- -------------------------------------- procedure Resolve_Intrinsic_Unary_Operator (N : Node_Id; Typ : Entity_Id) is Btyp : constant Entity_Id := Base_Type (Underlying_Type (Typ)); Op : Entity_Id; Arg2 : Node_Id; begin Op := Entity (N); while Scope (Op) /= Standard_Standard loop Op := Homonym (Op); pragma Assert (Present (Op)); end loop; Set_Entity (N, Op); if Is_Private_Type (Typ) then Arg2 := Unchecked_Convert_To (Btyp, Right_Opnd (N)); Save_Interps (Right_Opnd (N), Expression (Arg2)); Set_Right_Opnd (N, Arg2); Set_Etype (N, Btyp); Rewrite (N, Unchecked_Convert_To (Typ, N)); Resolve (N, Typ); else Resolve_Unary_Op (N, Typ); end if; end Resolve_Intrinsic_Unary_Operator; ------------------------ -- Resolve_Logical_Op -- ------------------------ procedure Resolve_Logical_Op (N : Node_Id; Typ : Entity_Id) is B_Typ : Entity_Id; N_Opr : constant Node_Kind := Nkind (N); begin -- Predefined operations on scalar types yield the base type. On the -- other hand, logical operations on arrays yield the type of the -- arguments (and the context). if Is_Array_Type (Typ) then B_Typ := Typ; else B_Typ := Base_Type (Typ); end if; -- The following test is required because the operands of the operation -- may be literals, in which case the resulting type appears to be -- compatible with a signed integer type, when in fact it is compatible -- only with modular types. If the context itself is universal, the -- operation is illegal. if not Valid_Boolean_Arg (Typ) then Error_Msg_N ("invalid context for logical operation", N); Set_Etype (N, Any_Type); return; elsif Typ = Any_Modular then Error_Msg_N ("no modular type available in this context", N); Set_Etype (N, Any_Type); return; elsif Is_Modular_Integer_Type (Typ) and then Etype (Left_Opnd (N)) = Universal_Integer and then Etype (Right_Opnd (N)) = Universal_Integer then Check_For_Visible_Operator (N, B_Typ); end if; Resolve (Left_Opnd (N), B_Typ); Resolve (Right_Opnd (N), B_Typ); Check_Unset_Reference (Left_Opnd (N)); Check_Unset_Reference (Right_Opnd (N)); Set_Etype (N, B_Typ); Generate_Operator_Reference (N, B_Typ); Eval_Logical_Op (N); -- Check for violation of restriction No_Direct_Boolean_Operators -- if the operator was not eliminated by the Eval_Logical_Op call. if Nkind (N) = N_Opr and then Root_Type (Etype (Left_Opnd (N))) = Standard_Boolean then Check_Restriction (No_Direct_Boolean_Operators, N); end if; end Resolve_Logical_Op; --------------------------- -- Resolve_Membership_Op -- --------------------------- -- The context can only be a boolean type, and does not determine -- the arguments. Arguments should be unambiguous, but the preference -- rule for universal types applies. procedure Resolve_Membership_Op (N : Node_Id; Typ : Entity_Id) is pragma Warnings (Off, Typ); L : constant Node_Id := Left_Opnd (N); R : constant Node_Id := Right_Opnd (N); T : Entity_Id; begin if L = Error or else R = Error then return; end if; if not Is_Overloaded (R) and then (Etype (R) = Universal_Integer or else Etype (R) = Universal_Real) and then Is_Overloaded (L) then T := Etype (R); -- Ada 2005 (AI-251): Give support to the following case: -- type I is interface; -- type T is tagged ... -- function Test (O : I'Class) is -- begin -- return O in T'Class. -- end Test; -- In this case we have nothing else to do; the membership test will be -- done at run-time. elsif Ada_Version >= Ada_05 and then Is_Class_Wide_Type (Etype (L)) and then Is_Interface (Etype (L)) and then Is_Class_Wide_Type (Etype (R)) and then not Is_Interface (Etype (R)) then return; else T := Intersect_Types (L, R); end if; Resolve (L, T); Check_Unset_Reference (L); if Nkind (R) = N_Range and then not Is_Scalar_Type (T) then Error_Msg_N ("scalar type required for range", R); end if; if Is_Entity_Name (R) then Freeze_Expression (R); else Resolve (R, T); Check_Unset_Reference (R); end if; Eval_Membership_Op (N); end Resolve_Membership_Op; ------------------ -- Resolve_Null -- ------------------ procedure Resolve_Null (N : Node_Id; Typ : Entity_Id) is begin -- Handle restriction against anonymous null access values This -- restriction can be turned off using -gnatdh. -- Ada 2005 (AI-231): Remove restriction if Ada_Version < Ada_05 and then not Debug_Flag_J and then Ekind (Typ) = E_Anonymous_Access_Type and then Comes_From_Source (N) then -- In the common case of a call which uses an explicitly null -- value for an access parameter, give specialized error msg if Nkind (Parent (N)) = N_Procedure_Call_Statement or else Nkind (Parent (N)) = N_Function_Call then Error_Msg_N ("null is not allowed as argument for an access parameter", N); -- Standard message for all other cases (are there any?) else Error_Msg_N ("null cannot be of an anonymous access type", N); end if; end if; -- In a distributed context, null for a remote access to subprogram -- may need to be replaced with a special record aggregate. In this -- case, return after having done the transformation. if (Ekind (Typ) = E_Record_Type or else Is_Remote_Access_To_Subprogram_Type (Typ)) and then Remote_AST_Null_Value (N, Typ) then return; end if; -- The null literal takes its type from the context Set_Etype (N, Typ); end Resolve_Null; ----------------------- -- Resolve_Op_Concat -- ----------------------- procedure Resolve_Op_Concat (N : Node_Id; Typ : Entity_Id) is Btyp : constant Entity_Id := Base_Type (Typ); Op1 : constant Node_Id := Left_Opnd (N); Op2 : constant Node_Id := Right_Opnd (N); procedure Resolve_Concatenation_Arg (Arg : Node_Id; Is_Comp : Boolean); -- Internal procedure to resolve one operand of concatenation operator. -- The operand is either of the array type or of the component type. -- If the operand is an aggregate, and the component type is composite, -- this is ambiguous if component type has aggregates. ------------------------------- -- Resolve_Concatenation_Arg -- ------------------------------- procedure Resolve_Concatenation_Arg (Arg : Node_Id; Is_Comp : Boolean) is begin if In_Instance then if Is_Comp or else (not Is_Overloaded (Arg) and then Etype (Arg) /= Any_Composite and then Covers (Component_Type (Typ), Etype (Arg))) then Resolve (Arg, Component_Type (Typ)); else Resolve (Arg, Btyp); end if; elsif Has_Compatible_Type (Arg, Component_Type (Typ)) then if Nkind (Arg) = N_Aggregate and then Is_Composite_Type (Component_Type (Typ)) then if Is_Private_Type (Component_Type (Typ)) then Resolve (Arg, Btyp); else Error_Msg_N ("ambiguous aggregate must be qualified", Arg); Set_Etype (Arg, Any_Type); end if; else if Is_Overloaded (Arg) and then Has_Compatible_Type (Arg, Typ) and then Etype (Arg) /= Any_Type then declare I : Interp_Index; It : Interp; Func : Entity_Id; begin Get_First_Interp (Arg, I, It); Func := It.Nam; Get_Next_Interp (I, It); -- Special-case the error message when the overloading -- is caused by a function that yields and array and -- can be called without parameters. if It.Nam = Func then Error_Msg_Sloc := Sloc (Func); Error_Msg_N ("\ambiguous call to function#", Arg); Error_Msg_NE ("\interpretation as call yields&", Arg, Typ); Error_Msg_NE ("\interpretation as indexing of call yields&", Arg, Component_Type (Typ)); else Error_Msg_N ("ambiguous operand for concatenation!", Arg); Get_First_Interp (Arg, I, It); while Present (It.Nam) loop Error_Msg_Sloc := Sloc (It.Nam); if Base_Type (It.Typ) = Base_Type (Typ) or else Base_Type (It.Typ) = Base_Type (Component_Type (Typ)) then Error_Msg_N ("\possible interpretation#", Arg); end if; Get_Next_Interp (I, It); end loop; end if; end; end if; Resolve (Arg, Component_Type (Typ)); if Nkind (Arg) = N_String_Literal then Set_Etype (Arg, Component_Type (Typ)); end if; if Arg = Left_Opnd (N) then Set_Is_Component_Left_Opnd (N); else Set_Is_Component_Right_Opnd (N); end if; end if; else Resolve (Arg, Btyp); end if; Check_Unset_Reference (Arg); end Resolve_Concatenation_Arg; -- Start of processing for Resolve_Op_Concat begin Set_Etype (N, Btyp); if Is_Limited_Composite (Btyp) then Error_Msg_N ("concatenation not available for limited array", N); Explain_Limited_Type (Btyp, N); end if; -- If the operands are themselves concatenations, resolve them as such -- directly. This removes several layers of recursion and allows GNAT to -- handle larger multiple concatenations. if Nkind (Op1) = N_Op_Concat and then not Is_Array_Type (Component_Type (Typ)) and then Entity (Op1) = Entity (N) then Resolve_Op_Concat (Op1, Typ); else Resolve_Concatenation_Arg (Op1, Is_Component_Left_Opnd (N)); end if; if Nkind (Op2) = N_Op_Concat and then not Is_Array_Type (Component_Type (Typ)) and then Entity (Op2) = Entity (N) then Resolve_Op_Concat (Op2, Typ); else Resolve_Concatenation_Arg (Op2, Is_Component_Right_Opnd (N)); end if; Generate_Operator_Reference (N, Typ); if Is_String_Type (Typ) then Eval_Concatenation (N); end if; -- If this is not a static concatenation, but the result is a -- string type (and not an array of strings) insure that static -- string operands have their subtypes properly constructed. if Nkind (N) /= N_String_Literal and then Is_Character_Type (Component_Type (Typ)) then Set_String_Literal_Subtype (Op1, Typ); Set_String_Literal_Subtype (Op2, Typ); end if; end Resolve_Op_Concat; ---------------------- -- Resolve_Op_Expon -- ---------------------- procedure Resolve_Op_Expon (N : Node_Id; Typ : Entity_Id) is B_Typ : constant Entity_Id := Base_Type (Typ); begin -- Catch attempts to do fixed-point exponentation with universal -- operands, which is a case where the illegality is not caught during -- normal operator analysis. if Is_Fixed_Point_Type (Typ) and then Comes_From_Source (N) then Error_Msg_N ("exponentiation not available for fixed point", N); return; end if; if Comes_From_Source (N) and then Ekind (Entity (N)) = E_Function and then Is_Imported (Entity (N)) and then Is_Intrinsic_Subprogram (Entity (N)) then Resolve_Intrinsic_Operator (N, Typ); return; end if; if Etype (Left_Opnd (N)) = Universal_Integer or else Etype (Left_Opnd (N)) = Universal_Real then Check_For_Visible_Operator (N, B_Typ); end if; -- We do the resolution using the base type, because intermediate values -- in expressions always are of the base type, not a subtype of it. Resolve (Left_Opnd (N), B_Typ); Resolve (Right_Opnd (N), Standard_Integer); Check_Unset_Reference (Left_Opnd (N)); Check_Unset_Reference (Right_Opnd (N)); Set_Etype (N, B_Typ); Generate_Operator_Reference (N, B_Typ); Eval_Op_Expon (N); -- Set overflow checking bit. Much cleverer code needed here eventually -- and perhaps the Resolve routines should be separated for the various -- arithmetic operations, since they will need different processing. ??? if Nkind (N) in N_Op then if not Overflow_Checks_Suppressed (Etype (N)) then Enable_Overflow_Check (N); end if; end if; end Resolve_Op_Expon; -------------------- -- Resolve_Op_Not -- -------------------- procedure Resolve_Op_Not (N : Node_Id; Typ : Entity_Id) is B_Typ : Entity_Id; function Parent_Is_Boolean return Boolean; -- This function determines if the parent node is a boolean operator -- or operation (comparison op, membership test, or short circuit form) -- and the not in question is the left operand of this operation. -- Note that if the not is in parens, then false is returned. function Parent_Is_Boolean return Boolean is begin if Paren_Count (N) /= 0 then return False; else case Nkind (Parent (N)) is when N_Op_And | N_Op_Eq | N_Op_Ge | N_Op_Gt | N_Op_Le | N_Op_Lt | N_Op_Ne | N_Op_Or | N_Op_Xor | N_In | N_Not_In | N_And_Then | N_Or_Else => return Left_Opnd (Parent (N)) = N; when others => return False; end case; end if; end Parent_Is_Boolean; -- Start of processing for Resolve_Op_Not begin -- Predefined operations on scalar types yield the base type. On the -- other hand, logical operations on arrays yield the type of the -- arguments (and the context). if Is_Array_Type (Typ) then B_Typ := Typ; else B_Typ := Base_Type (Typ); end if; if not Valid_Boolean_Arg (Typ) then Error_Msg_N ("invalid operand type for operator&", N); Set_Etype (N, Any_Type); return; elsif Typ = Universal_Integer or else Typ = Any_Modular then if Parent_Is_Boolean then Error_Msg_N ("operand of not must be enclosed in parentheses", Right_Opnd (N)); else Error_Msg_N ("no modular type available in this context", N); end if; Set_Etype (N, Any_Type); return; else if not Is_Boolean_Type (Typ) and then Parent_Is_Boolean then Error_Msg_N ("?not expression should be parenthesized here", N); end if; Resolve (Right_Opnd (N), B_Typ); Check_Unset_Reference (Right_Opnd (N)); Set_Etype (N, B_Typ); Generate_Operator_Reference (N, B_Typ); Eval_Op_Not (N); end if; end Resolve_Op_Not; ----------------------------- -- Resolve_Operator_Symbol -- ----------------------------- -- Nothing to be done, all resolved already procedure Resolve_Operator_Symbol (N : Node_Id; Typ : Entity_Id) is pragma Warnings (Off, N); pragma Warnings (Off, Typ); begin null; end Resolve_Operator_Symbol; ---------------------------------- -- Resolve_Qualified_Expression -- ---------------------------------- procedure Resolve_Qualified_Expression (N : Node_Id; Typ : Entity_Id) is pragma Warnings (Off, Typ); Target_Typ : constant Entity_Id := Entity (Subtype_Mark (N)); Expr : constant Node_Id := Expression (N); begin Resolve (Expr, Target_Typ); -- A qualified expression requires an exact match of the type, -- class-wide matching is not allowed. However, if the qualifying -- type is specific and the expression has a class-wide type, it -- may still be okay, since it can be the result of the expansion -- of a call to a dispatching function, so we also have to check -- class-wideness of the type of the expression's original node. if (Is_Class_Wide_Type (Target_Typ) or else (Is_Class_Wide_Type (Etype (Expr)) and then Is_Class_Wide_Type (Etype (Original_Node (Expr))))) and then Base_Type (Etype (Expr)) /= Base_Type (Target_Typ) then Wrong_Type (Expr, Target_Typ); end if; -- If the target type is unconstrained, then we reset the type of -- the result from the type of the expression. For other cases, the -- actual subtype of the expression is the target type. if Is_Composite_Type (Target_Typ) and then not Is_Constrained (Target_Typ) then Set_Etype (N, Etype (Expr)); end if; Eval_Qualified_Expression (N); end Resolve_Qualified_Expression; ------------------- -- Resolve_Range -- ------------------- procedure Resolve_Range (N : Node_Id; Typ : Entity_Id) is L : constant Node_Id := Low_Bound (N); H : constant Node_Id := High_Bound (N); begin Set_Etype (N, Typ); Resolve (L, Typ); Resolve (H, Typ); Check_Unset_Reference (L); Check_Unset_Reference (H); -- We have to check the bounds for being within the base range as -- required for a non-static context. Normally this is automatic and -- done as part of evaluating expressions, but the N_Range node is an -- exception, since in GNAT we consider this node to be a subexpression, -- even though in Ada it is not. The circuit in Sem_Eval could check for -- this, but that would put the test on the main evaluation path for -- expressions. Check_Non_Static_Context (L); Check_Non_Static_Context (H); -- If bounds are static, constant-fold them, so size computations -- are identical between front-end and back-end. Do not perform this -- transformation while analyzing generic units, as type information -- would then be lost when reanalyzing the constant node in the -- instance. if Is_Discrete_Type (Typ) and then Expander_Active then if Is_OK_Static_Expression (L) then Fold_Uint (L, Expr_Value (L), Is_Static_Expression (L)); end if; if Is_OK_Static_Expression (H) then Fold_Uint (H, Expr_Value (H), Is_Static_Expression (H)); end if; end if; end Resolve_Range; -------------------------- -- Resolve_Real_Literal -- -------------------------- procedure Resolve_Real_Literal (N : Node_Id; Typ : Entity_Id) is Actual_Typ : constant Entity_Id := Etype (N); begin -- Special processing for fixed-point literals to make sure that the -- value is an exact multiple of small where this is required. We -- skip this for the universal real case, and also for generic types. if Is_Fixed_Point_Type (Typ) and then Typ /= Universal_Fixed and then Typ /= Any_Fixed and then not Is_Generic_Type (Typ) then declare Val : constant Ureal := Realval (N); Cintr : constant Ureal := Val / Small_Value (Typ); Cint : constant Uint := UR_Trunc (Cintr); Den : constant Uint := Norm_Den (Cintr); Stat : Boolean; begin -- Case of literal is not an exact multiple of the Small if Den /= 1 then -- For a source program literal for a decimal fixed-point -- type, this is statically illegal (RM 4.9(36)). if Is_Decimal_Fixed_Point_Type (Typ) and then Actual_Typ = Universal_Real and then Comes_From_Source (N) then Error_Msg_N ("value has extraneous low order digits", N); end if; -- Generate a warning if literal from source if Is_Static_Expression (N) and then Warn_On_Bad_Fixed_Value then Error_Msg_N ("static fixed-point value is not a multiple of Small?", N); end if; -- Replace literal by a value that is the exact representation -- of a value of the type, i.e. a multiple of the small value, -- by truncation, since Machine_Rounds is false for all GNAT -- fixed-point types (RM 4.9(38)). Stat := Is_Static_Expression (N); Rewrite (N, Make_Real_Literal (Sloc (N), Realval => Small_Value (Typ) * Cint)); Set_Is_Static_Expression (N, Stat); end if; -- In all cases, set the corresponding integer field Set_Corresponding_Integer_Value (N, Cint); end; end if; -- Now replace the actual type by the expected type as usual Set_Etype (N, Typ); Eval_Real_Literal (N); end Resolve_Real_Literal; ----------------------- -- Resolve_Reference -- ----------------------- procedure Resolve_Reference (N : Node_Id; Typ : Entity_Id) is P : constant Node_Id := Prefix (N); begin -- Replace general access with specific type if Ekind (Etype (N)) = E_Allocator_Type then Set_Etype (N, Base_Type (Typ)); end if; Resolve (P, Designated_Type (Etype (N))); -- If we are taking the reference of a volatile entity, then treat -- it as a potential modification of this entity. This is much too -- conservative, but is necessary because remove side effects can -- result in transformations of normal assignments into reference -- sequences that otherwise fail to notice the modification. if Is_Entity_Name (P) and then Treat_As_Volatile (Entity (P)) then Note_Possible_Modification (P); end if; end Resolve_Reference; -------------------------------- -- Resolve_Selected_Component -- -------------------------------- procedure Resolve_Selected_Component (N : Node_Id; Typ : Entity_Id) is Comp : Entity_Id; Comp1 : Entity_Id := Empty; -- prevent junk warning P : constant Node_Id := Prefix (N); S : constant Node_Id := Selector_Name (N); T : Entity_Id := Etype (P); I : Interp_Index; I1 : Interp_Index := 0; -- prevent junk warning It : Interp; It1 : Interp; Found : Boolean; function Init_Component return Boolean; -- Check whether this is the initialization of a component within an -- init proc (by assignment or call to another init proc). If true, -- there is no need for a discriminant check. -------------------- -- Init_Component -- -------------------- function Init_Component return Boolean is begin return Inside_Init_Proc and then Nkind (Prefix (N)) = N_Identifier and then Chars (Prefix (N)) = Name_uInit and then Nkind (Parent (Parent (N))) = N_Case_Statement_Alternative; end Init_Component; -- Start of processing for Resolve_Selected_Component begin if Is_Overloaded (P) then -- Use the context type to select the prefix that has a selector -- of the correct name and type. Found := False; Get_First_Interp (P, I, It); Search : while Present (It.Typ) loop if Is_Access_Type (It.Typ) then T := Designated_Type (It.Typ); else T := It.Typ; end if; if Is_Record_Type (T) then Comp := First_Entity (T); while Present (Comp) loop if Chars (Comp) = Chars (S) and then Covers (Etype (Comp), Typ) then if not Found then Found := True; I1 := I; It1 := It; Comp1 := Comp; else It := Disambiguate (P, I1, I, Any_Type); if It = No_Interp then Error_Msg_N ("ambiguous prefix for selected component", N); Set_Etype (N, Typ); return; else It1 := It; -- There may be an implicit dereference. Retrieve -- designated record type. if Is_Access_Type (It1.Typ) then T := Designated_Type (It1.Typ); else T := It1.Typ; end if; if Scope (Comp1) /= T then -- Resolution chooses the new interpretation. -- Find the component with the right name. Comp1 := First_Entity (T); while Present (Comp1) and then Chars (Comp1) /= Chars (S) loop Comp1 := Next_Entity (Comp1); end loop; end if; exit Search; end if; end if; end if; Comp := Next_Entity (Comp); end loop; end if; Get_Next_Interp (I, It); end loop Search; Resolve (P, It1.Typ); Set_Etype (N, Typ); Set_Entity (S, Comp1); else -- Resolve prefix with its type Resolve (P, T); end if; -- If prefix is an access type, the node will be transformed into an -- explicit dereference during expansion. The type of the node is the -- designated type of that of the prefix. if Is_Access_Type (Etype (P)) then T := Designated_Type (Etype (P)); Check_Fully_Declared_Prefix (T, P); else T := Etype (P); end if; if Has_Discriminants (T) and then (Ekind (Entity (S)) = E_Component or else Ekind (Entity (S)) = E_Discriminant) and then Present (Original_Record_Component (Entity (S))) and then Ekind (Original_Record_Component (Entity (S))) = E_Component and then Present (Discriminant_Checking_Func (Original_Record_Component (Entity (S)))) and then not Discriminant_Checks_Suppressed (T) and then not Init_Component then Set_Do_Discriminant_Check (N); end if; if Ekind (Entity (S)) = E_Void then Error_Msg_N ("premature use of component", S); end if; -- If the prefix is a record conversion, this may be a renamed -- discriminant whose bounds differ from those of the original -- one, so we must ensure that a range check is performed. if Nkind (P) = N_Type_Conversion and then Ekind (Entity (S)) = E_Discriminant and then Is_Discrete_Type (Typ) then Set_Etype (N, Base_Type (Typ)); end if; -- Note: No Eval processing is required, because the prefix is of a -- record type, or protected type, and neither can possibly be static. end Resolve_Selected_Component; ------------------- -- Resolve_Shift -- ------------------- procedure Resolve_Shift (N : Node_Id; Typ : Entity_Id) is B_Typ : constant Entity_Id := Base_Type (Typ); L : constant Node_Id := Left_Opnd (N); R : constant Node_Id := Right_Opnd (N); begin -- We do the resolution using the base type, because intermediate values -- in expressions always are of the base type, not a subtype of it. Resolve (L, B_Typ); Resolve (R, Standard_Natural); Check_Unset_Reference (L); Check_Unset_Reference (R); Set_Etype (N, B_Typ); Generate_Operator_Reference (N, B_Typ); Eval_Shift (N); end Resolve_Shift; --------------------------- -- Resolve_Short_Circuit -- --------------------------- procedure Resolve_Short_Circuit (N : Node_Id; Typ : Entity_Id) is B_Typ : constant Entity_Id := Base_Type (Typ); L : constant Node_Id := Left_Opnd (N); R : constant Node_Id := Right_Opnd (N); begin Resolve (L, B_Typ); Resolve (R, B_Typ); Check_Unset_Reference (L); Check_Unset_Reference (R); Set_Etype (N, B_Typ); Eval_Short_Circuit (N); end Resolve_Short_Circuit; ------------------- -- Resolve_Slice -- ------------------- procedure Resolve_Slice (N : Node_Id; Typ : Entity_Id) is Name : constant Node_Id := Prefix (N); Drange : constant Node_Id := Discrete_Range (N); Array_Type : Entity_Id := Empty; Index : Node_Id; begin if Is_Overloaded (Name) then -- Use the context type to select the prefix that yields the -- correct array type. declare I : Interp_Index; I1 : Interp_Index := 0; It : Interp; P : constant Node_Id := Prefix (N); Found : Boolean := False; begin Get_First_Interp (P, I, It); while Present (It.Typ) loop if (Is_Array_Type (It.Typ) and then Covers (Typ, It.Typ)) or else (Is_Access_Type (It.Typ) and then Is_Array_Type (Designated_Type (It.Typ)) and then Covers (Typ, Designated_Type (It.Typ))) then if Found then It := Disambiguate (P, I1, I, Any_Type); if It = No_Interp then Error_Msg_N ("ambiguous prefix for slicing", N); Set_Etype (N, Typ); return; else Found := True; Array_Type := It.Typ; I1 := I; end if; else Found := True; Array_Type := It.Typ; I1 := I; end if; end if; Get_Next_Interp (I, It); end loop; end; else Array_Type := Etype (Name); end if; Resolve (Name, Array_Type); if Is_Access_Type (Array_Type) then Apply_Access_Check (N); Array_Type := Designated_Type (Array_Type); -- If the prefix is an access to an unconstrained array, we must use -- the actual subtype of the object to perform the index checks. The -- object denoted by the prefix is implicit in the node, so we build -- an explicit representation for it in order to compute the actual -- subtype. if not Is_Constrained (Array_Type) then Remove_Side_Effects (Prefix (N)); declare Obj : constant Node_Id := Make_Explicit_Dereference (Sloc (N), Prefix => New_Copy_Tree (Prefix (N))); begin Set_Etype (Obj, Array_Type); Set_Parent (Obj, Parent (N)); Array_Type := Get_Actual_Subtype (Obj); end; end if; elsif Is_Entity_Name (Name) or else (Nkind (Name) = N_Function_Call and then not Is_Constrained (Etype (Name))) then Array_Type := Get_Actual_Subtype (Name); end if; -- If name was overloaded, set slice type correctly now Set_Etype (N, Array_Type); -- If the range is specified by a subtype mark, no resolution is -- necessary. Else resolve the bounds, and apply needed checks. if not Is_Entity_Name (Drange) then Index := First_Index (Array_Type); Resolve (Drange, Base_Type (Etype (Index))); if Nkind (Drange) = N_Range then Apply_Range_Check (Drange, Etype (Index)); end if; end if; Set_Slice_Subtype (N); Eval_Slice (N); end Resolve_Slice; ---------------------------- -- Resolve_String_Literal -- ---------------------------- procedure Resolve_String_Literal (N : Node_Id; Typ : Entity_Id) is C_Typ : constant Entity_Id := Component_Type (Typ); R_Typ : constant Entity_Id := Root_Type (C_Typ); Loc : constant Source_Ptr := Sloc (N); Str : constant String_Id := Strval (N); Strlen : constant Nat := String_Length (Str); Subtype_Id : Entity_Id; Need_Check : Boolean; begin -- For a string appearing in a concatenation, defer creation of the -- string_literal_subtype until the end of the resolution of the -- concatenation, because the literal may be constant-folded away. This -- is a useful optimization for long concatenation expressions. -- If the string is an aggregate built for a single character (which -- happens in a non-static context) or a is null string to which special -- checks may apply, we build the subtype. Wide strings must also get a -- string subtype if they come from a one character aggregate. Strings -- generated by attributes might be static, but it is often hard to -- determine whether the enclosing context is static, so we generate -- subtypes for them as well, thus losing some rarer optimizations ??? -- Same for strings that come from a static conversion. Need_Check := (Strlen = 0 and then Typ /= Standard_String) or else Nkind (Parent (N)) /= N_Op_Concat or else (N /= Left_Opnd (Parent (N)) and then N /= Right_Opnd (Parent (N))) or else ((Typ = Standard_Wide_String or else Typ = Standard_Wide_Wide_String) and then Nkind (Original_Node (N)) /= N_String_Literal); -- If the resolving type is itself a string literal subtype, we -- can just reuse it, since there is no point in creating another. if Ekind (Typ) = E_String_Literal_Subtype then Subtype_Id := Typ; elsif Nkind (Parent (N)) = N_Op_Concat and then not Need_Check and then Nkind (Original_Node (N)) /= N_Character_Literal and then Nkind (Original_Node (N)) /= N_Attribute_Reference and then Nkind (Original_Node (N)) /= N_Qualified_Expression and then Nkind (Original_Node (N)) /= N_Type_Conversion then Subtype_Id := Typ; -- Otherwise we must create a string literal subtype. Note that the -- whole idea of string literal subtypes is simply to avoid the need -- for building a full fledged array subtype for each literal. else Set_String_Literal_Subtype (N, Typ); Subtype_Id := Etype (N); end if; if Nkind (Parent (N)) /= N_Op_Concat or else Need_Check then Set_Etype (N, Subtype_Id); Eval_String_Literal (N); end if; if Is_Limited_Composite (Typ) or else Is_Private_Composite (Typ) then Error_Msg_N ("string literal not available for private array", N); Set_Etype (N, Any_Type); return; end if; -- The validity of a null string has been checked in the -- call to Eval_String_Literal. if Strlen = 0 then return; -- Always accept string literal with component type Any_Character, which -- occurs in error situations and in comparisons of literals, both of -- which should accept all literals. elsif R_Typ = Any_Character then return; -- If the type is bit-packed, then we always tranform the string literal -- into a full fledged aggregate. elsif Is_Bit_Packed_Array (Typ) then null; -- Deal with cases of Wide_Wide_String, Wide_String, and String else -- For Standard.Wide_Wide_String, or any other type whose component -- type is Standard.Wide_Wide_Character, we know that all the -- characters in the string must be acceptable, since the parser -- accepted the characters as valid character literals. if R_Typ = Standard_Wide_Wide_Character then null; -- For the case of Standard.String, or any other type whose component -- type is Standard.Character, we must make sure that there are no -- wide characters in the string, i.e. that it is entirely composed -- of characters in range of type Character. -- If the string literal is the result of a static concatenation, the -- test has already been performed on the components, and need not be -- repeated. elsif R_Typ = Standard_Character and then Nkind (Original_Node (N)) /= N_Op_Concat then for J in 1 .. Strlen loop if not In_Character_Range (Get_String_Char (Str, J)) then -- If we are out of range, post error. This is one of the -- very few places that we place the flag in the middle of -- a token, right under the offending wide character. Error_Msg ("literal out of range of type Standard.Character", Source_Ptr (Int (Loc) + J)); return; end if; end loop; -- For the case of Standard.Wide_String, or any other type whose -- component type is Standard.Wide_Character, we must make sure that -- there are no wide characters in the string, i.e. that it is -- entirely composed of characters in range of type Wide_Character. -- If the string literal is the result of a static concatenation, -- the test has already been performed on the components, and need -- not be repeated. elsif R_Typ = Standard_Wide_Character and then Nkind (Original_Node (N)) /= N_Op_Concat then for J in 1 .. Strlen loop if not In_Wide_Character_Range (Get_String_Char (Str, J)) then -- If we are out of range, post error. This is one of the -- very few places that we place the flag in the middle of -- a token, right under the offending wide character. -- This is not quite right, because characters in general -- will take more than one character position ??? Error_Msg ("literal out of range of type Standard.Wide_Character", Source_Ptr (Int (Loc) + J)); return; end if; end loop; -- If the root type is not a standard character, then we will convert -- the string into an aggregate and will let the aggregate code do -- the checking. Standard Wide_Wide_Character is also OK here. else null; end if; -- See if the component type of the array corresponding to the string -- has compile time known bounds. If yes we can directly check -- whether the evaluation of the string will raise constraint error. -- Otherwise we need to transform the string literal into the -- corresponding character aggregate and let the aggregate -- code do the checking. if R_Typ = Standard_Character or else R_Typ = Standard_Wide_Character or else R_Typ = Standard_Wide_Wide_Character then -- Check for the case of full range, where we are definitely OK if Component_Type (Typ) = Base_Type (Component_Type (Typ)) then return; end if; -- Here the range is not the complete base type range, so check declare Comp_Typ_Lo : constant Node_Id := Type_Low_Bound (Component_Type (Typ)); Comp_Typ_Hi : constant Node_Id := Type_High_Bound (Component_Type (Typ)); Char_Val : Uint; begin if Compile_Time_Known_Value (Comp_Typ_Lo) and then Compile_Time_Known_Value (Comp_Typ_Hi) then for J in 1 .. Strlen loop Char_Val := UI_From_Int (Int (Get_String_Char (Str, J))); if Char_Val < Expr_Value (Comp_Typ_Lo) or else Char_Val > Expr_Value (Comp_Typ_Hi) then Apply_Compile_Time_Constraint_Error (N, "character out of range?", CE_Range_Check_Failed, Loc => Source_Ptr (Int (Loc) + J)); end if; end loop; return; end if; end; end if; end if; -- If we got here we meed to transform the string literal into the -- equivalent qualified positional array aggregate. This is rather -- heavy artillery for this situation, but it is hard work to avoid. declare Lits : constant List_Id := New_List; P : Source_Ptr := Loc + 1; C : Char_Code; begin -- Build the character literals, we give them source locations that -- correspond to the string positions, which is a bit tricky given -- the possible presence of wide character escape sequences. for J in 1 .. Strlen loop C := Get_String_Char (Str, J); Set_Character_Literal_Name (C); Append_To (Lits, Make_Character_Literal (P, Chars => Name_Find, Char_Literal_Value => UI_From_CC (C))); if In_Character_Range (C) then P := P + 1; -- Should we have a call to Skip_Wide here ??? -- ??? else -- Skip_Wide (P); end if; end loop; Rewrite (N, Make_Qualified_Expression (Loc, Subtype_Mark => New_Reference_To (Typ, Loc), Expression => Make_Aggregate (Loc, Expressions => Lits))); Analyze_And_Resolve (N, Typ); end; end Resolve_String_Literal; ----------------------------- -- Resolve_Subprogram_Info -- ----------------------------- procedure Resolve_Subprogram_Info (N : Node_Id; Typ : Entity_Id) is begin Set_Etype (N, Typ); end Resolve_Subprogram_Info; ----------------------------- -- Resolve_Type_Conversion -- ----------------------------- procedure Resolve_Type_Conversion (N : Node_Id; Typ : Entity_Id) is Conv_OK : constant Boolean := Conversion_OK (N); Target_Type : Entity_Id := Etype (N); Operand : Node_Id; Opnd_Type : Entity_Id; Rop : Node_Id; Orig_N : Node_Id; Orig_T : Node_Id; begin Operand := Expression (N); if not Conv_OK and then not Valid_Conversion (N, Target_Type, Operand) then return; end if; if Etype (Operand) = Any_Fixed then -- Mixed-mode operation involving a literal. Context must be a fixed -- type which is applied to the literal subsequently. if Is_Fixed_Point_Type (Typ) then Set_Etype (Operand, Universal_Real); elsif Is_Numeric_Type (Typ) and then (Nkind (Operand) = N_Op_Multiply or else Nkind (Operand) = N_Op_Divide) and then (Etype (Right_Opnd (Operand)) = Universal_Real or else Etype (Left_Opnd (Operand)) = Universal_Real) then -- Return if expression is ambiguous if Unique_Fixed_Point_Type (N) = Any_Type then return; -- If nothing else, the available fixed type is Duration else Set_Etype (Operand, Standard_Duration); end if; -- Resolve the real operand with largest available precision if Etype (Right_Opnd (Operand)) = Universal_Real then Rop := New_Copy_Tree (Right_Opnd (Operand)); else Rop := New_Copy_Tree (Left_Opnd (Operand)); end if; Resolve (Rop, Universal_Real); -- If the operand is a literal (it could be a non-static and -- illegal exponentiation) check whether the use of Duration -- is potentially inaccurate. if Nkind (Rop) = N_Real_Literal and then Realval (Rop) /= Ureal_0 and then abs (Realval (Rop)) < Delta_Value (Standard_Duration) then Error_Msg_N ("universal real operand can only be interpreted?", Rop); Error_Msg_N ("\as Duration, and will lose precision?", Rop); end if; elsif Is_Numeric_Type (Typ) and then Nkind (Operand) in N_Op and then Unique_Fixed_Point_Type (N) /= Any_Type then Set_Etype (Operand, Standard_Duration); else Error_Msg_N ("invalid context for mixed mode operation", N); Set_Etype (Operand, Any_Type); return; end if; end if; Opnd_Type := Etype (Operand); Resolve (Operand); -- Note: we do the Eval_Type_Conversion call before applying the -- required checks for a subtype conversion. This is important, -- since both are prepared under certain circumstances to change -- the type conversion to a constraint error node, but in the case -- of Eval_Type_Conversion this may reflect an illegality in the -- static case, and we would miss the illegality (getting only a -- warning message), if we applied the type conversion checks first. Eval_Type_Conversion (N); -- If after evaluation, we still have a type conversion, then we -- may need to apply checks required for a subtype conversion. -- Skip these type conversion checks if universal fixed operands -- operands involved, since range checks are handled separately for -- these cases (in the appropriate Expand routines in unit Exp_Fixd). if Nkind (N) = N_Type_Conversion and then not Is_Generic_Type (Root_Type (Target_Type)) and then Target_Type /= Universal_Fixed and then Opnd_Type /= Universal_Fixed then Apply_Type_Conversion_Checks (N); end if; -- Issue warning for conversion of simple object to its own type -- We have to test the original nodes, since they may have been -- rewritten by various optimizations. Orig_N := Original_Node (N); if Warn_On_Redundant_Constructs and then Comes_From_Source (Orig_N) and then Nkind (Orig_N) = N_Type_Conversion and then not In_Instance then Orig_N := Original_Node (Expression (Orig_N)); Orig_T := Target_Type; -- If the node is part of a larger expression, the Target_Type -- may not be the original type of the node if the context is a -- condition. Recover original type to see if conversion is needed. if Is_Boolean_Type (Orig_T) and then Nkind (Parent (N)) in N_Op then Orig_T := Etype (Parent (N)); end if; if Is_Entity_Name (Orig_N) and then Etype (Entity (Orig_N)) = Orig_T then Error_Msg_NE ("?useless conversion, & has this type", N, Entity (Orig_N)); end if; end if; -- Ada 2005 (AI-251): Handle conversions to abstract interface types if Ada_Version >= Ada_05 then if Is_Access_Type (Target_Type) then Target_Type := Directly_Designated_Type (Target_Type); end if; if Is_Class_Wide_Type (Target_Type) then Target_Type := Etype (Target_Type); end if; if Is_Interface (Target_Type) then if Is_Access_Type (Opnd_Type) then Opnd_Type := Directly_Designated_Type (Opnd_Type); end if; if Is_Class_Wide_Type (Opnd_Type) then Opnd_Type := Etype (Opnd_Type); end if; -- Handle subtypes if Ekind (Opnd_Type) = E_Protected_Subtype or else Ekind (Opnd_Type) = E_Task_Subtype then Opnd_Type := Etype (Opnd_Type); end if; if not Interface_Present_In_Ancestor (Typ => Opnd_Type, Iface => Target_Type) then -- The static analysis is not enough to know if the interface -- is implemented or not. Hence we must pass the work to the -- expander to generate the required code to evaluate the -- conversion at run-time. Expand_Interface_Conversion (N, Is_Static => False); else Expand_Interface_Conversion (N); end if; end if; end if; end Resolve_Type_Conversion; ---------------------- -- Resolve_Unary_Op -- ---------------------- procedure Resolve_Unary_Op (N : Node_Id; Typ : Entity_Id) is B_Typ : constant Entity_Id := Base_Type (Typ); R : constant Node_Id := Right_Opnd (N); OK : Boolean; Lo : Uint; Hi : Uint; begin -- Generate warning for expressions like -5 mod 3 if Paren_Count (N) = 0 and then Nkind (N) = N_Op_Minus and then Paren_Count (Right_Opnd (N)) = 0 and then Nkind (Right_Opnd (N)) = N_Op_Mod and then Comes_From_Source (N) then Error_Msg_N ("?unary minus expression should be parenthesized here", N); end if; if Comes_From_Source (N) and then Ekind (Entity (N)) = E_Function and then Is_Imported (Entity (N)) and then Is_Intrinsic_Subprogram (Entity (N)) then Resolve_Intrinsic_Unary_Operator (N, Typ); return; end if; if Etype (R) = Universal_Integer or else Etype (R) = Universal_Real then Check_For_Visible_Operator (N, B_Typ); end if; Set_Etype (N, B_Typ); Resolve (R, B_Typ); -- Generate warning for expressions like abs (x mod 2) if Warn_On_Redundant_Constructs and then Nkind (N) = N_Op_Abs then Determine_Range (Right_Opnd (N), OK, Lo, Hi); if OK and then Hi >= Lo and then Lo >= 0 then Error_Msg_N ("?abs applied to known non-negative value has no effect", N); end if; end if; Check_Unset_Reference (R); Generate_Operator_Reference (N, B_Typ); Eval_Unary_Op (N); -- Set overflow checking bit. Much cleverer code needed here eventually -- and perhaps the Resolve routines should be separated for the various -- arithmetic operations, since they will need different processing ??? if Nkind (N) in N_Op then if not Overflow_Checks_Suppressed (Etype (N)) then Enable_Overflow_Check (N); end if; end if; end Resolve_Unary_Op; ---------------------------------- -- Resolve_Unchecked_Expression -- ---------------------------------- procedure Resolve_Unchecked_Expression (N : Node_Id; Typ : Entity_Id) is begin Resolve (Expression (N), Typ, Suppress => All_Checks); Set_Etype (N, Typ); end Resolve_Unchecked_Expression; --------------------------------------- -- Resolve_Unchecked_Type_Conversion -- --------------------------------------- procedure Resolve_Unchecked_Type_Conversion (N : Node_Id; Typ : Entity_Id) is pragma Warnings (Off, Typ); Operand : constant Node_Id := Expression (N); Opnd_Type : constant Entity_Id := Etype (Operand); begin -- Resolve operand using its own type Resolve (Operand, Opnd_Type); Eval_Unchecked_Conversion (N); end Resolve_Unchecked_Type_Conversion; ------------------------------ -- Rewrite_Operator_As_Call -- ------------------------------ procedure Rewrite_Operator_As_Call (N : Node_Id; Nam : Entity_Id) is Loc : constant Source_Ptr := Sloc (N); Actuals : constant List_Id := New_List; New_N : Node_Id; begin if Nkind (N) in N_Binary_Op then Append (Left_Opnd (N), Actuals); end if; Append (Right_Opnd (N), Actuals); New_N := Make_Function_Call (Sloc => Loc, Name => New_Occurrence_Of (Nam, Loc), Parameter_Associations => Actuals); Preserve_Comes_From_Source (New_N, N); Preserve_Comes_From_Source (Name (New_N), N); Rewrite (N, New_N); Set_Etype (N, Etype (Nam)); end Rewrite_Operator_As_Call; ------------------------------ -- Rewrite_Renamed_Operator -- ------------------------------ procedure Rewrite_Renamed_Operator (N : Node_Id; Op : Entity_Id; Typ : Entity_Id) is Nam : constant Name_Id := Chars (Op); Is_Binary : constant Boolean := Nkind (N) in N_Binary_Op; Op_Node : Node_Id; begin -- Rewrite the operator node using the real operator, not its -- renaming. Exclude user-defined intrinsic operations of the same -- name, which are treated separately and rewritten as calls. if Ekind (Op) /= E_Function or else Chars (N) /= Nam then Op_Node := New_Node (Operator_Kind (Nam, Is_Binary), Sloc (N)); Set_Chars (Op_Node, Nam); Set_Etype (Op_Node, Etype (N)); Set_Entity (Op_Node, Op); Set_Right_Opnd (Op_Node, Right_Opnd (N)); -- Indicate that both the original entity and its renaming -- are referenced at this point. Generate_Reference (Entity (N), N); Generate_Reference (Op, N); if Is_Binary then Set_Left_Opnd (Op_Node, Left_Opnd (N)); end if; Rewrite (N, Op_Node); -- If the context type is private, add the appropriate conversions -- so that the operator is applied to the full view. This is done -- in the routines that resolve intrinsic operators, if Is_Intrinsic_Subprogram (Op) and then Is_Private_Type (Typ) then case Nkind (N) is when N_Op_Add | N_Op_Subtract | N_Op_Multiply | N_Op_Divide | N_Op_Expon | N_Op_Mod | N_Op_Rem => Resolve_Intrinsic_Operator (N, Typ); when N_Op_Plus | N_Op_Minus | N_Op_Abs => Resolve_Intrinsic_Unary_Operator (N, Typ); when others => Resolve (N, Typ); end case; end if; elsif Ekind (Op) = E_Function and then Is_Intrinsic_Subprogram (Op) then -- Operator renames a user-defined operator of the same name. Use -- the original operator in the node, which is the one that gigi -- knows about. Set_Entity (N, Op); Set_Is_Overloaded (N, False); end if; end Rewrite_Renamed_Operator; ----------------------- -- Set_Slice_Subtype -- ----------------------- -- Build an implicit subtype declaration to represent the type delivered -- by the slice. This is an abbreviated version of an array subtype. We -- define an index subtype for the slice, using either the subtype name -- or the discrete range of the slice. To be consistent with index usage -- elsewhere, we create a list header to hold the single index. This list -- is not otherwise attached to the syntax tree. procedure Set_Slice_Subtype (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Index_List : constant List_Id := New_List; Index : Node_Id; Index_Subtype : Entity_Id; Index_Type : Entity_Id; Slice_Subtype : Entity_Id; Drange : constant Node_Id := Discrete_Range (N); begin if Is_Entity_Name (Drange) then Index_Subtype := Entity (Drange); else -- We force the evaluation of a range. This is definitely needed in -- the renamed case, and seems safer to do unconditionally. Note in -- any case that since we will create and insert an Itype referring -- to this range, we must make sure any side effect removal actions -- are inserted before the Itype definition. if Nkind (Drange) = N_Range then Force_Evaluation (Low_Bound (Drange)); Force_Evaluation (High_Bound (Drange)); end if; Index_Type := Base_Type (Etype (Drange)); Index_Subtype := Create_Itype (Subtype_Kind (Ekind (Index_Type)), N); Set_Scalar_Range (Index_Subtype, Drange); Set_Etype (Index_Subtype, Index_Type); Set_Size_Info (Index_Subtype, Index_Type); Set_RM_Size (Index_Subtype, RM_Size (Index_Type)); end if; Slice_Subtype := Create_Itype (E_Array_Subtype, N); Index := New_Occurrence_Of (Index_Subtype, Loc); Set_Etype (Index, Index_Subtype); Append (Index, Index_List); Set_First_Index (Slice_Subtype, Index); Set_Etype (Slice_Subtype, Base_Type (Etype (N))); Set_Is_Constrained (Slice_Subtype, True); Init_Size_Align (Slice_Subtype); Check_Compile_Time_Size (Slice_Subtype); -- The Etype of the existing Slice node is reset to this slice -- subtype. Its bounds are obtained from its first index. Set_Etype (N, Slice_Subtype); -- In the packed case, this must be immediately frozen -- Couldn't we always freeze here??? and if we did, then the above -- call to Check_Compile_Time_Size could be eliminated, which would -- be nice, because then that routine could be made private to Freeze. if Is_Packed (Slice_Subtype) and not In_Default_Expression then Freeze_Itype (Slice_Subtype, N); end if; end Set_Slice_Subtype; -------------------------------- -- Set_String_Literal_Subtype -- -------------------------------- procedure Set_String_Literal_Subtype (N : Node_Id; Typ : Entity_Id) is Loc : constant Source_Ptr := Sloc (N); Low_Bound : constant Node_Id := Type_Low_Bound (Etype (First_Index (Typ))); Subtype_Id : Entity_Id; begin if Nkind (N) /= N_String_Literal then return; end if; Subtype_Id := Create_Itype (E_String_Literal_Subtype, N); Set_String_Literal_Length (Subtype_Id, UI_From_Int (String_Length (Strval (N)))); Set_Etype (Subtype_Id, Base_Type (Typ)); Set_Is_Constrained (Subtype_Id); Set_Etype (N, Subtype_Id); if Is_OK_Static_Expression (Low_Bound) then -- The low bound is set from the low bound of the corresponding -- index type. Note that we do not store the high bound in the -- string literal subtype, but it can be deduced if necessary -- from the length and the low bound. Set_String_Literal_Low_Bound (Subtype_Id, Low_Bound); else Set_String_Literal_Low_Bound (Subtype_Id, Make_Integer_Literal (Loc, 1)); Set_Etype (String_Literal_Low_Bound (Subtype_Id), Standard_Positive); -- Build bona fide subtypes for the string, and wrap it in an -- unchecked conversion, because the backend expects the -- String_Literal_Subtype to have a static lower bound. declare Index_List : constant List_Id := New_List; Index_Type : constant Entity_Id := Etype (First_Index (Typ)); High_Bound : constant Node_Id := Make_Op_Add (Loc, Left_Opnd => New_Copy_Tree (Low_Bound), Right_Opnd => Make_Integer_Literal (Loc, String_Length (Strval (N)) - 1)); Array_Subtype : Entity_Id; Index_Subtype : Entity_Id; Drange : Node_Id; Index : Node_Id; begin Index_Subtype := Create_Itype (Subtype_Kind (Ekind (Index_Type)), N); Drange := Make_Range (Loc, Low_Bound, High_Bound); Set_Scalar_Range (Index_Subtype, Drange); Set_Parent (Drange, N); Analyze_And_Resolve (Drange, Index_Type); Set_Etype (Index_Subtype, Index_Type); Set_Size_Info (Index_Subtype, Index_Type); Set_RM_Size (Index_Subtype, RM_Size (Index_Type)); Array_Subtype := Create_Itype (E_Array_Subtype, N); Index := New_Occurrence_Of (Index_Subtype, Loc); Set_Etype (Index, Index_Subtype); Append (Index, Index_List); Set_First_Index (Array_Subtype, Index); Set_Etype (Array_Subtype, Base_Type (Typ)); Set_Is_Constrained (Array_Subtype, True); Init_Size_Align (Array_Subtype); Rewrite (N, Make_Unchecked_Type_Conversion (Loc, Subtype_Mark => New_Occurrence_Of (Array_Subtype, Loc), Expression => Relocate_Node (N))); Set_Etype (N, Array_Subtype); end; end if; end Set_String_Literal_Subtype; ----------------------------- -- Unique_Fixed_Point_Type -- ----------------------------- function Unique_Fixed_Point_Type (N : Node_Id) return Entity_Id is T1 : Entity_Id := Empty; T2 : Entity_Id; Item : Node_Id; Scop : Entity_Id; procedure Fixed_Point_Error; -- If true ambiguity, give details ----------------------- -- Fixed_Point_Error -- ----------------------- procedure Fixed_Point_Error is begin Error_Msg_N ("ambiguous universal_fixed_expression", N); Error_Msg_NE ("\possible interpretation as}", N, T1); Error_Msg_NE ("\possible interpretation as}", N, T2); end Fixed_Point_Error; -- Start of processing for Unique_Fixed_Point_Type begin -- The operations on Duration are visible, so Duration is always a -- possible interpretation. T1 := Standard_Duration; -- Look for fixed-point types in enclosing scopes Scop := Current_Scope; while Scop /= Standard_Standard loop T2 := First_Entity (Scop); while Present (T2) loop if Is_Fixed_Point_Type (T2) and then Current_Entity (T2) = T2 and then Scope (Base_Type (T2)) = Scop then if Present (T1) then Fixed_Point_Error; return Any_Type; else T1 := T2; end if; end if; Next_Entity (T2); end loop; Scop := Scope (Scop); end loop; -- Look for visible fixed type declarations in the context Item := First (Context_Items (Cunit (Current_Sem_Unit))); while Present (Item) loop if Nkind (Item) = N_With_Clause then Scop := Entity (Name (Item)); T2 := First_Entity (Scop); while Present (T2) loop if Is_Fixed_Point_Type (T2) and then Scope (Base_Type (T2)) = Scop and then (Is_Potentially_Use_Visible (T2) or else In_Use (T2)) then if Present (T1) then Fixed_Point_Error; return Any_Type; else T1 := T2; end if; end if; Next_Entity (T2); end loop; end if; Next (Item); end loop; if Nkind (N) = N_Real_Literal then Error_Msg_NE ("real literal interpreted as }?", N, T1); else Error_Msg_NE ("universal_fixed expression interpreted as }?", N, T1); end if; return T1; end Unique_Fixed_Point_Type; ---------------------- -- Valid_Conversion -- ---------------------- function Valid_Conversion (N : Node_Id; Target : Entity_Id; Operand : Node_Id) return Boolean is Target_Type : constant Entity_Id := Base_Type (Target); Opnd_Type : Entity_Id := Etype (Operand); function Conversion_Check (Valid : Boolean; Msg : String) return Boolean; -- Little routine to post Msg if Valid is False, returns Valid value function Valid_Tagged_Conversion (Target_Type : Entity_Id; Opnd_Type : Entity_Id) return Boolean; -- Specifically test for validity of tagged conversions ---------------------- -- Conversion_Check -- ---------------------- function Conversion_Check (Valid : Boolean; Msg : String) return Boolean is begin if not Valid then Error_Msg_N (Msg, Operand); end if; return Valid; end Conversion_Check; ----------------------------- -- Valid_Tagged_Conversion -- ----------------------------- function Valid_Tagged_Conversion (Target_Type : Entity_Id; Opnd_Type : Entity_Id) return Boolean is begin -- Upward conversions are allowed (RM 4.6(22)) if Covers (Target_Type, Opnd_Type) or else Is_Ancestor (Target_Type, Opnd_Type) then return True; -- Downward conversion are allowed if the operand is class-wide -- (RM 4.6(23)). elsif Is_Class_Wide_Type (Opnd_Type) and then Covers (Opnd_Type, Target_Type) then return True; elsif Covers (Opnd_Type, Target_Type) or else Is_Ancestor (Opnd_Type, Target_Type) then return Conversion_Check (False, "downward conversion of tagged objects not allowed"); -- Ada 2005 (AI-251): The conversion of a tagged type to an -- abstract interface type is always valid elsif Is_Interface (Target_Type) then return True; else Error_Msg_NE ("invalid tagged conversion, not compatible with}", N, First_Subtype (Opnd_Type)); return False; end if; end Valid_Tagged_Conversion; -- Start of processing for Valid_Conversion begin Check_Parameterless_Call (Operand); if Is_Overloaded (Operand) then declare I : Interp_Index; I1 : Interp_Index; It : Interp; It1 : Interp; N1 : Entity_Id; begin -- Remove procedure calls, which syntactically cannot appear -- in this context, but which cannot be removed by type checking, -- because the context does not impose a type. -- When compiling for VMS, spurious ambiguities can be produced -- when arithmetic operations have a literal operand and return -- System.Address or a descendant of it. These ambiguities are -- otherwise resolved by the context, but for conversions there -- is no context type and the removal of the spurious operations -- must be done explicitly here. -- The node may be labelled overloaded, but still contain only -- one interpretation because others were discarded in previous -- filters. If this is the case, retain the single interpretation -- if legal. Get_First_Interp (Operand, I, It); Opnd_Type := It.Typ; Get_Next_Interp (I, It); if Present (It.Typ) and then Opnd_Type /= Standard_Void_Type then -- More than one candidate interpretation is available Get_First_Interp (Operand, I, It); while Present (It.Typ) loop if It.Typ = Standard_Void_Type then Remove_Interp (I); end if; if Present (System_Aux_Id) and then Is_Descendent_Of_Address (It.Typ) then Remove_Interp (I); end if; Get_Next_Interp (I, It); end loop; end if; Get_First_Interp (Operand, I, It); I1 := I; It1 := It; if No (It.Typ) then Error_Msg_N ("illegal operand in conversion", Operand); return False; end if; Get_Next_Interp (I, It); if Present (It.Typ) then N1 := It1.Nam; It1 := Disambiguate (Operand, I1, I, Any_Type); if It1 = No_Interp then Error_Msg_N ("ambiguous operand in conversion", Operand); Error_Msg_Sloc := Sloc (It.Nam); Error_Msg_N ("possible interpretation#!", Operand); Error_Msg_Sloc := Sloc (N1); Error_Msg_N ("possible interpretation#!", Operand); return False; end if; end if; Set_Etype (Operand, It1.Typ); Opnd_Type := It1.Typ; end; end if; if Chars (Current_Scope) = Name_Unchecked_Conversion then -- This check is dubious, what if there were a user defined -- scope whose name was Unchecked_Conversion ??? return True; elsif Is_Numeric_Type (Target_Type) then if Opnd_Type = Universal_Fixed then return True; elsif (In_Instance or else In_Inlined_Body) and then not Comes_From_Source (N) then return True; else return Conversion_Check (Is_Numeric_Type (Opnd_Type), "illegal operand for numeric conversion"); end if; elsif Is_Array_Type (Target_Type) then if not Is_Array_Type (Opnd_Type) or else Opnd_Type = Any_Composite or else Opnd_Type = Any_String then Error_Msg_N ("illegal operand for array conversion", Operand); return False; elsif Number_Dimensions (Target_Type) /= Number_Dimensions (Opnd_Type) then Error_Msg_N ("incompatible number of dimensions for conversion", Operand); return False; else declare Target_Index : Node_Id := First_Index (Target_Type); Opnd_Index : Node_Id := First_Index (Opnd_Type); Target_Index_Type : Entity_Id; Opnd_Index_Type : Entity_Id; Target_Comp_Type : constant Entity_Id := Component_Type (Target_Type); Opnd_Comp_Type : constant Entity_Id := Component_Type (Opnd_Type); begin while Present (Target_Index) and then Present (Opnd_Index) loop Target_Index_Type := Etype (Target_Index); Opnd_Index_Type := Etype (Opnd_Index); if not (Is_Integer_Type (Target_Index_Type) and then Is_Integer_Type (Opnd_Index_Type)) and then (Root_Type (Target_Index_Type) /= Root_Type (Opnd_Index_Type)) then Error_Msg_N ("incompatible index types for array conversion", Operand); return False; end if; Next_Index (Target_Index); Next_Index (Opnd_Index); end loop; declare BT : constant Entity_Id := Base_Type (Target_Comp_Type); BO : constant Entity_Id := Base_Type (Opnd_Comp_Type); begin if BT = BO then null; elsif (Ekind (BT) = E_Anonymous_Access_Type or else Ekind (BT) = E_Anonymous_Access_Subprogram_Type) and then Ekind (BO) = Ekind (BT) and then Subtypes_Statically_Match (Target_Comp_Type, Opnd_Comp_Type) then null; else Error_Msg_N ("incompatible component types for array conversion", Operand); return False; end if; end; if Is_Constrained (Target_Comp_Type) /= Is_Constrained (Opnd_Comp_Type) or else not Subtypes_Statically_Match (Target_Comp_Type, Opnd_Comp_Type) then Error_Msg_N ("component subtypes must statically match", Operand); return False; end if; end; end if; return True; -- Ada 2005 (AI-251) elsif (Ekind (Target_Type) = E_General_Access_Type or else Ekind (Target_Type) = E_Anonymous_Access_Type) and then Is_Interface (Directly_Designated_Type (Target_Type)) then -- Check the static accessibility rule of 4.6(17). Note that the -- check is not enforced when within an instance body, since the RM -- requires such cases to be caught at run time. if Ekind (Target_Type) /= E_Anonymous_Access_Type then if Type_Access_Level (Opnd_Type) > Type_Access_Level (Target_Type) then -- In an instance, this is a run-time check, but one we know -- will fail, so generate an appropriate warning. The raise -- will be generated by Expand_N_Type_Conversion. if In_Instance_Body then Error_Msg_N ("?cannot convert local pointer to non-local access type", Operand); Error_Msg_N ("\?Program_Error will be raised at run time", Operand); else Error_Msg_N ("cannot convert local pointer to non-local access type", Operand); return False; end if; -- Special accessibility checks are needed in the case of access -- discriminants declared for a limited type. elsif Ekind (Opnd_Type) = E_Anonymous_Access_Type and then not Is_Local_Anonymous_Access (Opnd_Type) then -- When the operand is a selected access discriminant the check -- needs to be made against the level of the object denoted by -- the prefix of the selected name. (Object_Access_Level -- handles checking the prefix of the operand for this case.) if Nkind (Operand) = N_Selected_Component and then Object_Access_Level (Operand) > Type_Access_Level (Target_Type) then -- In an instance, this is a run-time check, but one we -- know will fail, so generate an appropriate warning. -- The raise will be generated by Expand_N_Type_Conversion. if In_Instance_Body then Error_Msg_N ("?cannot convert access discriminant to non-local" & " access type", Operand); Error_Msg_N ("\?Program_Error will be raised at run time", Operand); else Error_Msg_N ("cannot convert access discriminant to non-local" & " access type", Operand); return False; end if; end if; -- The case of a reference to an access discriminant from -- within a limited type declaration (which will appear as -- a discriminal) is always illegal because the level of the -- discriminant is considered to be deeper than any (namable) -- access type. if Is_Entity_Name (Operand) and then not Is_Local_Anonymous_Access (Opnd_Type) and then (Ekind (Entity (Operand)) = E_In_Parameter or else Ekind (Entity (Operand)) = E_Constant) and then Present (Discriminal_Link (Entity (Operand))) then Error_Msg_N ("discriminant has deeper accessibility level than target", Operand); return False; end if; end if; end if; return True; elsif (Ekind (Target_Type) = E_General_Access_Type or else Ekind (Target_Type) = E_Anonymous_Access_Type) and then Conversion_Check (Is_Access_Type (Opnd_Type) and then Ekind (Opnd_Type) /= E_Access_Subprogram_Type and then Ekind (Opnd_Type) /= E_Access_Protected_Subprogram_Type, "must be an access-to-object type") then if Is_Access_Constant (Opnd_Type) and then not Is_Access_Constant (Target_Type) then Error_Msg_N ("access-to-constant operand type not allowed", Operand); return False; end if; -- Check the static accessibility rule of 4.6(17). Note that the -- check is not enforced when within an instance body, since the RM -- requires such cases to be caught at run time. if Ekind (Target_Type) /= E_Anonymous_Access_Type or else Is_Local_Anonymous_Access (Target_Type) then if Type_Access_Level (Opnd_Type) > Type_Access_Level (Target_Type) then -- In an instance, this is a run-time check, but one we -- know will fail, so generate an appropriate warning. -- The raise will be generated by Expand_N_Type_Conversion. if In_Instance_Body then Error_Msg_N ("?cannot convert local pointer to non-local access type", Operand); Error_Msg_N ("\?Program_Error will be raised at run time", Operand); else Error_Msg_N ("cannot convert local pointer to non-local access type", Operand); return False; end if; -- Special accessibility checks are needed in the case of access -- discriminants declared for a limited type. elsif Ekind (Opnd_Type) = E_Anonymous_Access_Type and then not Is_Local_Anonymous_Access (Opnd_Type) then -- When the operand is a selected access discriminant the check -- needs to be made against the level of the object denoted by -- the prefix of the selected name. (Object_Access_Level -- handles checking the prefix of the operand for this case.) if Nkind (Operand) = N_Selected_Component and then Object_Access_Level (Operand) > Type_Access_Level (Target_Type) then -- In an instance, this is a run-time check, but one we -- know will fail, so generate an appropriate warning. -- The raise will be generated by Expand_N_Type_Conversion. if In_Instance_Body then Error_Msg_N ("?cannot convert access discriminant to non-local" & " access type", Operand); Error_Msg_N ("\?Program_Error will be raised at run time", Operand); else Error_Msg_N ("cannot convert access discriminant to non-local" & " access type", Operand); return False; end if; end if; -- The case of a reference to an access discriminant from -- within a limited type declaration (which will appear as -- a discriminal) is always illegal because the level of the -- discriminant is considered to be deeper than any (namable) -- access type. if Is_Entity_Name (Operand) and then (Ekind (Entity (Operand)) = E_In_Parameter or else Ekind (Entity (Operand)) = E_Constant) and then Present (Discriminal_Link (Entity (Operand))) then Error_Msg_N ("discriminant has deeper accessibility level than target", Operand); return False; end if; end if; end if; declare Target : constant Entity_Id := Designated_Type (Target_Type); Opnd : constant Entity_Id := Designated_Type (Opnd_Type); begin if Is_Tagged_Type (Target) then return Valid_Tagged_Conversion (Target, Opnd); else if Base_Type (Target) /= Base_Type (Opnd) then Error_Msg_NE ("target designated type not compatible with }", N, Base_Type (Opnd)); return False; -- Ada 2005 AI-384: legality rule is symmetric in both -- designated types. The conversion is legal (with possible -- constraint check) if either designated type is -- unconstrained. elsif Subtypes_Statically_Match (Target, Opnd) or else (Has_Discriminants (Target) and then (not Is_Constrained (Opnd) or else not Is_Constrained (Target))) then return True; else Error_Msg_NE ("target designated subtype not compatible with }", N, Opnd); return False; end if; end if; end; elsif (Ekind (Target_Type) = E_Access_Subprogram_Type or else Ekind (Target_Type) = E_Anonymous_Access_Subprogram_Type) and then No (Corresponding_Remote_Type (Opnd_Type)) and then Conversion_Check (Ekind (Base_Type (Opnd_Type)) = E_Access_Subprogram_Type, "illegal operand for access subprogram conversion") then -- Check that the designated types are subtype conformant Check_Subtype_Conformant (New_Id => Designated_Type (Target_Type), Old_Id => Designated_Type (Opnd_Type), Err_Loc => N); -- Check the static accessibility rule of 4.6(20) if Type_Access_Level (Opnd_Type) > Type_Access_Level (Target_Type) then Error_Msg_N ("operand type has deeper accessibility level than target", Operand); -- Check that if the operand type is declared in a generic body, -- then the target type must be declared within that same body -- (enforces last sentence of 4.6(20)). elsif Present (Enclosing_Generic_Body (Opnd_Type)) then declare O_Gen : constant Node_Id := Enclosing_Generic_Body (Opnd_Type); T_Gen : Node_Id; begin T_Gen := Enclosing_Generic_Body (Target_Type); while Present (T_Gen) and then T_Gen /= O_Gen loop T_Gen := Enclosing_Generic_Body (T_Gen); end loop; if T_Gen /= O_Gen then Error_Msg_N ("target type must be declared in same generic body" & " as operand type", N); end if; end; end if; return True; elsif Is_Remote_Access_To_Subprogram_Type (Target_Type) and then Is_Remote_Access_To_Subprogram_Type (Opnd_Type) then -- It is valid to convert from one RAS type to another provided -- that their specification statically match. Check_Subtype_Conformant (New_Id => Designated_Type (Corresponding_Remote_Type (Target_Type)), Old_Id => Designated_Type (Corresponding_Remote_Type (Opnd_Type)), Err_Loc => N); return True; elsif Is_Tagged_Type (Target_Type) then return Valid_Tagged_Conversion (Target_Type, Opnd_Type); -- Types derived from the same root type are convertible elsif Root_Type (Target_Type) = Root_Type (Opnd_Type) then return True; -- In an instance, there may be inconsistent views of the same -- type, or types derived from the same type. elsif In_Instance and then Underlying_Type (Target_Type) = Underlying_Type (Opnd_Type) then return True; -- Special check for common access type error case elsif Ekind (Target_Type) = E_Access_Type and then Is_Access_Type (Opnd_Type) then Error_Msg_N ("target type must be general access type!", N); Error_Msg_NE ("add ALL to }!", N, Target_Type); return False; else Error_Msg_NE ("invalid conversion, not compatible with }", N, Opnd_Type); return False; end if; end Valid_Conversion; end Sem_Res;

35.798729

79

0.546806

ad98a8814260ad24441cafbf7bb87414a079c558

936

adb

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/unchecked_convert11.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/unchecked_convert11.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- { dg-do run } with Unchecked_Conversion; procedure Unchecked_Convert11 is subtype Unsigned_Type is Integer range 2_034 .. 2_164; subtype Signed_Type is Integer range -2048 .. 2047; type Rec is record S : Signed_Type; end record; pragma Pack (Rec); function To_Signed_Type is new Unchecked_Conversion (Source => Unsigned_Type, Target => Rec); function To_Unsigned_Type is new Unchecked_Conversion (Source => Rec, Target => Unsigned_Type); Data : Unsigned_Type; Temp : Rec; begin Data := 2100; Temp := To_Signed_Type (Data); if Temp.S /= -1996 then raise Program_Error; end if; Data := To_Unsigned_Type (Temp); if Data /= 2100 then raise Program_Error; end if; Data := 2047; Temp := To_Signed_Type (Data); if Temp.S /= 2047 then raise Program_Error; end if; Data := To_Unsigned_Type (Temp); if Data /= 2047 then raise Program_Error; end if; end;

19.5

71

0.679487

ad2b6fd21e4805f7828a77e2b9d863be79c04506

961

ads

Ada

alloy/coursework_two/console.ads

m-f-1998/university

12ddd56227c09018c2998960be32330f292adef8

[ "Apache-2.0" ]

null

alloy/coursework_two/console.ads

m-f-1998/university

12ddd56227c09018c2998960be32330f292adef8

[ "Apache-2.0" ]

null

alloy/coursework_two/console.ads

m-f-1998/university

12ddd56227c09018c2998960be32330f292adef8

[ "Apache-2.0" ]

null

-- Author: A. Ireland -- -- Address: School Mathematical & Computer Sciences -- Heriot-Watt University -- Edinburgh, EH14 4AS -- -- E-mail: [email protected] -- -- Last modified: 13.9.2019 -- -- Filename: console.ads -- -- Description: Models the console associated with the WTP system, i.e. -- the reset mechanism that is required to close the -- emergency drainage valve. pragma SPARK_Mode (On); package Console with Abstract_State => State is procedure Enable_Reset with Global => (Output => State), Depends => (State => null); procedure Disable_Reset with Global => (Output => State), Depends => (State => null); function Reset_Enabled return Boolean with Global => (Input => State), Depends => (Reset_Enabled'Result => State); end Console;

20.891304

80

0.555671

1ac808989244b0842f93f9ecd19dbc1f1a96360b

357,002

adb

Ada

HLS/lab2/yuv_filter.prj/solution3/.autopilot/db/rgb2yuv11.adb

lfVelez/ISPR

840f41c2053a48642a7b287feecfea79c6f389b3

[ "MIT" ]

1

2021-03-03T16:53:52.000Z

HLS/lab2/yuv_filter.prj/solution3/.autopilot/db/rgb2yuv11.adb

lfVelez/ISPR

840f41c2053a48642a7b287feecfea79c6f389b3

[ "MIT" ]

null

HLS/lab2/yuv_filter.prj/solution3/.autopilot/db/rgb2yuv11.adb

lfVelez/ISPR

840f41c2053a48642a7b287feecfea79c6f389b3

[ "MIT" ]

null

<?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="14"> <syndb class_id="0" tracking_level="0" version="0"> <userIPLatency>-1</userIPLatency> <userIPName/> <cdfg class_id="1" tracking_level="1" version="0" object_id="_0"> <name>rgb2yuv11</name> <ret_bitwidth>0</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>16</count> <item_version>0</item_version> <item class_id="3" tracking_level="1" version="0" object_id="_1"> <Value class_id="4" tracking_level="0" version="0"> <Obj class_id="5" tracking_level="0" version="0"> <type>1</type> <id>1</id> <name>in_channels_ch1</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>in.channels.ch1</originalName> <rtlName/> <coreName>RAM</coreName> </Obj> <bitwidth>8</bitwidth> </Value> <direction>0</direction> <if_type>1</if_type> <array_size>2457600</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>in_channels_ch2</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>in.channels.ch2</originalName> <rtlName/> <coreName>RAM</coreName> </Obj> <bitwidth>8</bitwidth> </Value> <direction>0</direction> <if_type>1</if_type> <array_size>2457600</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>in_channels_ch3</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>in.channels.ch3</originalName> <rtlName/> <coreName>RAM</coreName> </Obj> <bitwidth>8</bitwidth> </Value> <direction>0</direction> <if_type>1</if_type> <array_size>2457600</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>in_width</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>in.width</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>16</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>in_height</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>in.height</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>16</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>out_channels_ch1</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>out.channels.ch1</originalName> <rtlName/> <coreName>FIFO_LUTRAM</coreName> </Obj> <bitwidth>8</bitwidth> </Value> <direction>1</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_7"> <Value> <Obj> <type>1</type> <id>7</id> <name>out_channels_ch2</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>out.channels.ch2</originalName> <rtlName/> <coreName>FIFO_LUTRAM</coreName> </Obj> <bitwidth>8</bitwidth> </Value> <direction>1</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_8"> <Value> <Obj> <type>1</type> <id>8</id> <name>out_channels_ch3</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>out.channels.ch3</originalName> <rtlName/> <coreName>FIFO_LUTRAM</coreName> </Obj> <bitwidth>8</bitwidth> </Value> <direction>1</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_9"> <Value> <Obj> <type>1</type> <id>9</id> <name>out_width</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>out.width</originalName> <rtlName/> <coreName>FIFO_LUTRAM</coreName> </Obj> <bitwidth>16</bitwidth> </Value> <direction>1</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_10"> <Value> <Obj> <type>1</type> <id>10</id> <name>out_height</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>out.height</originalName> <rtlName/> <coreName>FIFO_LUTRAM</coreName> </Obj> <bitwidth>16</bitwidth> </Value> <direction>1</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_11"> <Value> <Obj> <type>1</type> <id>11</id> <name>Y_scale</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>8</bitwidth> </Value> <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>U_scale</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>8</bitwidth> </Value> <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>V_scale</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>8</bitwidth> </Value> <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="_14"> <Value> <Obj> <type>1</type> <id>14</id> <name>Y_scale_out</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName>FIFO_LUTRAM</coreName> </Obj> <bitwidth>8</bitwidth> </Value> <direction>1</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_15"> <Value> <Obj> <type>1</type> <id>15</id> <name>U_scale_out</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName>FIFO_LUTRAM</coreName> </Obj> <bitwidth>8</bitwidth> </Value> <direction>1</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_16"> <Value> <Obj> <type>1</type> <id>16</id> <name>V_scale_out</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName>FIFO_LUTRAM</coreName> </Obj> <bitwidth>8</bitwidth> </Value> <direction>1</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> </ports> <nodes class_id="8" tracking_level="0" version="0"> <count>93</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_17"> <Value> <Obj> <type>0</type> <id>23</id> <name>V_scale_read</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>129</item> <item>130</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_18"> <Value> <Obj> <type>0</type> <id>24</id> <name>U_scale_read</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>131</item> <item>132</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>25</id> <name>Y_scale_read</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>133</item> <item>134</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_20"> <Value> <Obj> <type>0</type> <id>26</id> <name/> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>136</item> <item>137</item> <item>138</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_21"> <Value> <Obj> <type>0</type> <id>28</id> <name/> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>139</item> <item>140</item> <item>141</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_22"> <Value> <Obj> <type>0</type> <id>30</id> <name/> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>142</item> <item>143</item> <item>144</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_23"> <Value> <Obj> <type>0</type> <id>31</id> <name>width</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>43</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="11" tracking_level="0" version="0"> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second class_id="12" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="13" tracking_level="0" version="0"> <first class_id="14" tracking_level="0" version="0"> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>43</second> </item> </second> </item> </inlineStackInfo> <originalName>width</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>146</item> <item>147</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_24"> <Value> <Obj> <type>0</type> <id>32</id> <name>height</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>44</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>44</second> </item> </second> </item> </inlineStackInfo> <originalName>height</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>148</item> <item>149</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_25"> <Value> <Obj> <type>0</type> <id>33</id> <name/> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>45</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>45</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>151</item> <item>152</item> <item>153</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_26"> <Value> <Obj> <type>0</type> <id>34</id> <name/> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>46</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>46</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>154</item> <item>155</item> <item>156</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_27"> <Value> <Obj> <type>0</type> <id>35</id> <name>cast</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>43</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>43</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>bound_fu_594_p10</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>157</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_28"> <Value> <Obj> <type>0</type> <id>36</id> <name>cast1</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>44</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>44</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>bound_fu_594_p00</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>158</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_29"> <Value> <Obj> <type>0</type> <id>37</id> <name>bound</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>44</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>44</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>yuv_filter_mul_mubkb_U1</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>159</item> <item>160</item> </oprand_edges> <opcode>mul</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_30"> <Value> <Obj> <type>0</type> <id>38</id> <name/> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>49</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>49</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>161</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_31"> <Value> <Obj> <type>0</type> <id>40</id> <name>indvar_flatten</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>4</count> <item_version>0</item_version> <item>163</item> <item>164</item> <item>165</item> <item>166</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_32"> <Value> <Obj> <type>0</type> <id>41</id> <name>x_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>54</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>54</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>168</item> <item>169</item> <item>170</item> <item>171</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_33"> <Value> <Obj> <type>0</type> <id>42</id> <name>y_i_i</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>y</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>172</item> <item>173</item> <item>174</item> <item>175</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_34"> <Value> <Obj> <type>0</type> <id>43</id> <name>exitcond_flatten</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>44</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>44</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>exitcond_flatten_fu_302_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>176</item> <item>177</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_35"> <Value> <Obj> <type>0</type> <id>44</id> <name>indvar_flatten_next</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName>indvar_flatten_next_fu_307_p2</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>178</item> <item>180</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_36"> <Value> <Obj> <type>0</type> <id>45</id> <name/> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>44</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>44</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>181</item> <item>182</item> <item>183</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_37"> <Value> <Obj> <type>0</type> <id>47</id> <name>x</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>49</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>49</second> </item> </second> </item> </inlineStackInfo> <originalName>x</originalName> <rtlName>x_fu_313_p2</rtlName> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>185</item> <item>186</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_38"> <Value> <Obj> <type>0</type> <id>50</id> <name>exitcond_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>52</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>52</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>exitcond_i_i_fu_319_p2</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>187</item> <item>188</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_39"> <Value> <Obj> <type>0</type> <id>51</id> <name>y_i_i_mid2</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>52</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>52</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>y_i_i_mid2_fu_324_p3</rtlName> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>189</item> <item>190</item> <item>191</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_40"> <Value> <Obj> <type>0</type> <id>52</id> <name>tmp_i_i_mid2_v</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>54</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>54</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_i_i_mid2_v_fu_332_p3</rtlName> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>192</item> <item>193</item> <item>194</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_41"> <Value> <Obj> <type>0</type> <id>53</id> <name>tmp_22</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>54</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>54</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_22_fu_340_p1</rtlName> <coreName/> </Obj> <bitwidth>13</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> </item> <item class_id_reference="9" object_id="_42"> <Value> <Obj> <type>0</type> <id>54</id> <name>p_shl_cast</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>54</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>54</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_shl_cast_fu_348_p3</rtlName> <coreName/> </Obj> <bitwidth>23</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>197</item> <item>198</item> <item>200</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_43"> <Value> <Obj> <type>0</type> <id>55</id> <name>tmp_23</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>54</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>54</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_23_fu_344_p1</rtlName> <coreName/> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>201</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_44"> <Value> <Obj> <type>0</type> <id>56</id> <name>p_shl1_cast</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>54</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>54</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_shl1_cast_fu_355_p3</rtlName> <coreName/> </Obj> <bitwidth>23</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>203</item> <item>204</item> <item>206</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_45"> <Value> <Obj> <type>0</type> <id>57</id> <name>tmp_s</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>54</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>54</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_s_fu_362_p2</rtlName> <coreName/> </Obj> <bitwidth>23</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>207</item> <item>208</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_46"> <Value> <Obj> <type>0</type> <id>61</id> <name>tmp_i_i_cast</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>54</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>54</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_i_i_cast_fu_368_p1</rtlName> <coreName/> </Obj> <bitwidth>23</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>209</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_47"> <Value> <Obj> <type>0</type> <id>62</id> <name>tmp_24</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>54</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>54</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_24_fu_371_p2</rtlName> <coreName/> </Obj> <bitwidth>23</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>210</item> <item>211</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_48"> <Value> <Obj> <type>0</type> <id>63</id> <name>tmp_26_cast</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>54</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>54</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_26_cast_fu_382_p1</rtlName> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>212</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_49"> <Value> <Obj> <type>0</type> <id>64</id> <name>in_channels_ch1_addr</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>54</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>54</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>22</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>213</item> <item>215</item> <item>216</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_50"> <Value> <Obj> <type>0</type> <id>65</id> <name>in_channels_ch2_addr</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>55</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>55</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>22</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>217</item> <item>218</item> <item>219</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_51"> <Value> <Obj> <type>0</type> <id>66</id> <name>in_channels_ch3_addr</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>56</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>56</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>22</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>220</item> <item>221</item> <item>222</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_52"> <Value> <Obj> <type>0</type> <id>67</id> <name>R</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>54</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>54</second> </item> </second> </item> </inlineStackInfo> <originalName>R</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>223</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_53"> <Value> <Obj> <type>0</type> <id>68</id> <name>G</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>55</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>55</second> </item> </second> </item> </inlineStackInfo> <originalName>G</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>224</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_54"> <Value> <Obj> <type>0</type> <id>69</id> <name>B</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>56</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>56</second> </item> </second> </item> </inlineStackInfo> <originalName>B</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>225</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_55"> <Value> <Obj> <type>0</type> <id>70</id> <name>tmp_40_cast14_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_40_cast14_i_i_fu_406_p1</rtlName> <coreName/> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>226</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_56"> <Value> <Obj> <type>0</type> <id>71</id> <name>p_shl5_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_shl5_i_i_fu_409_p3</rtlName> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>228</item> <item>229</item> <item>231</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_57"> <Value> <Obj> <type>0</type> <id>72</id> <name>p_shl5_cast_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_shl5_cast_i_i_fu_416_p1</rtlName> <coreName/> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>232</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_58"> <Value> <Obj> <type>0</type> <id>73</id> <name>p_shl6_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_shl6_i_i_fu_388_p3</rtlName> <coreName/> </Obj> <bitwidth>9</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>234</item> <item>235</item> <item>237</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_59"> <Value> <Obj> <type>0</type> <id>74</id> <name>p_shl6_cast_i_i_cast</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_shl6_cast_i_i_cast_fu_396_p1</rtlName> <coreName/> </Obj> <bitwidth>10</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> </item> <item class_id_reference="9" object_id="_60"> <Value> <Obj> <type>0</type> <id>75</id> <name>tmp_42_cast11_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_42_cast11_i_i_fu_543_p1</rtlName> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>239</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_61"> <Value> <Obj> <type>0</type> <id>76</id> <name>tmp_42_cast11_i_i_ca</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>grp_fu_600_p20</rtlName> <coreName/> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>240</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_62"> <Value> <Obj> <type>0</type> <id>77</id> <name>p_shl4_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_shl4_i_i_fu_423_p3</rtlName> <coreName/> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>242</item> <item>243</item> <item>245</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_63"> <Value> <Obj> <type>0</type> <id>78</id> <name>p_shl4_cast_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_shl4_cast_i_i_fu_430_p1</rtlName> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>246</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_64"> <Value> <Obj> <type>0</type> <id>79</id> <name>tmp_44_cast10_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>grp_fu_600_p10</rtlName> <coreName/> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>247</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_65"> <Value> <Obj> <type>0</type> <id>80</id> <name>tmp_45_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>yuv_filter_mac_mucud_U2</rtlName> <coreName/> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>249</item> <item>250</item> </oprand_edges> <opcode>mul</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_66"> <Value> <Obj> <type>0</type> <id>81</id> <name>tmp</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_fu_400_p2</rtlName> <coreName/> </Obj> <bitwidth>10</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>252</item> <item>253</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_67"> <Value> <Obj> <type>0</type> <id>82</id> <name>tmp_cast</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_cast_fu_437_p1</rtlName> <coreName/> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>254</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_68"> <Value> <Obj> <type>0</type> <id>83</id> <name>tmp_46_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_46_i_i_fu_440_p2</rtlName> <coreName/> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>255</item> <item>256</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_69"> <Value> <Obj> <type>0</type> <id>84</id> <name>tmp_46_cast_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_46_cast_i_i_fu_446_p1</rtlName> <coreName/> </Obj> <bitwidth>16</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> </item> <item class_id_reference="9" object_id="_70"> <Value> <Obj> <type>0</type> <id>85</id> <name>tmp1</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp1_fu_450_p2</rtlName> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>258</item> <item>259</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_71"> <Value> <Obj> <type>0</type> <id>86</id> <name>tmp2</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>yuv_filter_mac_mucud_U2</rtlName> <coreName/> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>260</item> <item>261</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_72"> <Value> <Obj> <type>0</type> <id>87</id> <name>tmp2_cast</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp2_cast_fu_456_p1</rtlName> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>262</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_73"> <Value> <Obj> <type>0</type> <id>88</id> <name>tmp_48_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_48_i_i_fu_459_p2</rtlName> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>263</item> <item>264</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_74"> <Value> <Obj> <type>0</type> <id>89</id> <name>tmp_50_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_50_i_i_reg_734</rtlName> <coreName/> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>266</item> <item>267</item> <item>269</item> <item>271</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_75"> <Value> <Obj> <type>0</type> <id>90</id> <name>Y</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName>Y</originalName> <rtlName>out_channels_ch1_din</rtlName> <coreName/> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>273</item> <item>274</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_76"> <Value> <Obj> <type>0</type> <id>91</id> <name>tmp_51_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>58</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>yuv_filter_mac_mudEe_U3</rtlName> <coreName/> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>276</item> <item>277</item> </oprand_edges> <opcode>mul</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_77"> <Value> <Obj> <type>0</type> <id>92</id> <name>tmp_52_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>58</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>yuv_filter_mac_mufYi_U5</rtlName> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>279</item> <item>280</item> </oprand_edges> <opcode>mul</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_78"> <Value> <Obj> <type>0</type> <id>93</id> <name>p_shl2_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>58</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_shl2_i_i_fu_475_p3</rtlName> <coreName/> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>281</item> <item>282</item> <item>283</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_79"> <Value> <Obj> <type>0</type> <id>94</id> <name>p_shl2_cast_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>58</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_shl2_cast_i_i_fu_482_p1</rtlName> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>284</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_80"> <Value> <Obj> <type>0</type> <id>95</id> <name>p_shl3_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>58</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_shl3_i_i_fu_486_p3</rtlName> <coreName/> </Obj> <bitwidth>12</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>286</item> <item>287</item> <item>289</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_81"> <Value> <Obj> <type>0</type> <id>96</id> <name>p_shl3_cast7_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>58</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_shl3_cast7_i_i_fu_493_p1</rtlName> <coreName/> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>290</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_82"> <Value> <Obj> <type>0</type> <id>97</id> <name>p_shl3_cast_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>58</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_shl3_cast_i_i_fu_497_p1</rtlName> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>291</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_83"> <Value> <Obj> <type>0</type> <id>98</id> <name>tmp_53_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>58</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_53_i_i_fu_501_p2</rtlName> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>292</item> <item>293</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_84"> <Value> <Obj> <type>0</type> <id>99</id> <name>tmp_54_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>58</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>yuv_filter_mac_mudEe_U3</rtlName> <coreName/> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>295</item> <item>296</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_85"> <Value> <Obj> <type>0</type> <id>100</id> <name>tmp_54_cast_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>58</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_54_cast_i_i_fu_507_p1</rtlName> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>297</item> </oprand_edges> <opcode>sext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_86"> <Value> <Obj> <type>0</type> <id>101</id> <name>tmp3</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>58</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp3_fu_510_p2</rtlName> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>298</item> <item>299</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_87"> <Value> <Obj> <type>0</type> <id>102</id> <name>tmp_56_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>58</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>yuv_filter_mac_mufYi_U5</rtlName> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>300</item> <item>301</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_88"> <Value> <Obj> <type>0</type> <id>103</id> <name>tmp_58_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>58</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_58_i_i_reg_754</rtlName> <coreName/> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>302</item> <item>303</item> <item>304</item> <item>305</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_89"> <Value> <Obj> <type>0</type> <id>104</id> <name>U</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>58</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName>U</originalName> <rtlName>out_channels_ch2_din</rtlName> <coreName/> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>306</item> <item>308</item> </oprand_edges> <opcode>xor</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_90"> <Value> <Obj> <type>0</type> <id>105</id> <name>tmp_59_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>yuv_filter_mac_mueOg_U4</rtlName> <coreName/> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>310</item> <item>311</item> </oprand_edges> <opcode>mul</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_91"> <Value> <Obj> <type>0</type> <id>106</id> <name>tmp_60_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>yuv_filter_mac_mufYi_U6</rtlName> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>313</item> <item>314</item> </oprand_edges> <opcode>mul</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_92"> <Value> <Obj> <type>0</type> <id>107</id> <name>p_neg_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>58</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_neg_i_i_fu_516_p2</rtlName> <coreName/> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>316</item> <item>317</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_93"> <Value> <Obj> <type>0</type> <id>108</id> <name>p_neg_cast_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>58</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_neg_cast_i_i_fu_522_p1</rtlName> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>318</item> </oprand_edges> <opcode>sext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_94"> <Value> <Obj> <type>0</type> <id>109</id> <name>p_shl1_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_shl1_i_i_fu_526_p3</rtlName> <coreName/> </Obj> <bitwidth>9</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>319</item> <item>320</item> <item>321</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_95"> <Value> <Obj> <type>0</type> <id>110</id> <name>p_shl1_cast_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>p_shl1_cast_i_i_fu_533_p1</rtlName> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>322</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_96"> <Value> <Obj> <type>0</type> <id>111</id> <name>tmp_61_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_61_i_i_fu_537_p2</rtlName> <coreName/> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>323</item> <item>324</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_97"> <Value> <Obj> <type>0</type> <id>112</id> <name>tmp_61_cast_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_61_cast_i_i_fu_555_p1</rtlName> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>325</item> </oprand_edges> <opcode>sext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_98"> <Value> <Obj> <type>0</type> <id>113</id> <name>tmp_62_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>yuv_filter_mac_mueOg_U4</rtlName> <coreName/> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>326</item> <item>327</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_99"> <Value> <Obj> <type>0</type> <id>114</id> <name>tmp_62_cast_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_62_cast_i_i_fu_558_p1</rtlName> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>328</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_100"> <Value> <Obj> <type>0</type> <id>115</id> <name>tmp4</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>grp_fu_634_p2</rtlName> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>329</item> <item>330</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_101"> <Value> <Obj> <type>0</type> <id>116</id> <name>tmp_64_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>yuv_filter_mac_mufYi_U6</rtlName> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>331</item> <item>332</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_102"> <Value> <Obj> <type>0</type> <id>117</id> <name>tmp_66_i_i</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_66_i_i_reg_759</rtlName> <coreName/> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>333</item> <item>334</item> <item>335</item> <item>336</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_103"> <Value> <Obj> <type>0</type> <id>118</id> <name>V</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName>V</originalName> <rtlName>out_channels_ch3_din</rtlName> <coreName/> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>337</item> <item>338</item> </oprand_edges> <opcode>xor</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_104"> <Value> <Obj> <type>0</type> <id>119</id> <name/> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>340</item> <item>341</item> <item>342</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_105"> <Value> <Obj> <type>0</type> <id>120</id> <name/> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>343</item> <item>344</item> <item>345</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_106"> <Value> <Obj> <type>0</type> <id>121</id> <name/> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>62</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>62</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>346</item> <item>347</item> <item>348</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_107"> <Value> <Obj> <type>0</type> <id>123</id> <name>y</name> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>52</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>52</second> </item> </second> </item> </inlineStackInfo> <originalName>y</originalName> <rtlName>y_fu_377_p2</rtlName> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>349</item> <item>350</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_108"> <Value> <Obj> <type>0</type> <id>124</id> <name/> <fileName>yuv_filter.c</fileName> <fileDirectory>..</fileDirectory> <lineNumber>52</lineNumber> <contextFuncName>rgb2yuv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>yuv_filter.c</first> <second>rgb2yuv</second> </first> <second>52</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>351</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_109"> <Value> <Obj> <type>0</type> <id>126</id> <name/> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <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>23</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_110"> <Value> <Obj> <type>2</type> <id>162</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_111"> <Value> <Obj> <type>2</type> <id>167</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_112"> <Value> <Obj> <type>2</type> <id>179</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="_113"> <Value> <Obj> <type>2</type> <id>184</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_114"> <Value> <Obj> <type>2</type> <id>199</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>10</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_115"> <Value> <Obj> <type>2</type> <id>205</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>8</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_116"> <Value> <Obj> <type>2</type> <id>214</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>64</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_117"> <Value> <Obj> <type>2</type> <id>230</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>6</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_118"> <Value> <Obj> <type>2</type> <id>236</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_119"> <Value> <Obj> <type>2</type> <id>244</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>7</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_120"> <Value> <Obj> <type>2</type> <id>248</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>25</content> </item> <item class_id_reference="16" object_id="_121"> <Value> <Obj> <type>2</type> <id>251</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>10</bitwidth> </Value> <const_type>0</const_type> <content>128</content> </item> <item class_id_reference="16" object_id="_122"> <Value> <Obj> <type>2</type> <id>268</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>8</content> </item> <item class_id_reference="16" object_id="_123"> <Value> <Obj> <type>2</type> <id>270</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>15</content> </item> <item class_id_reference="16" object_id="_124"> <Value> <Obj> <type>2</type> <id>272</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>8</bitwidth> </Value> <const_type>0</const_type> <content>16</content> </item> <item class_id_reference="16" object_id="_125"> <Value> <Obj> <type>2</type> <id>275</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>15</bitwidth> </Value> <const_type>0</const_type> <content>32730</content> </item> <item class_id_reference="16" object_id="_126"> <Value> <Obj> <type>2</type> <id>278</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <const_type>0</const_type> <content>65462</content> </item> <item class_id_reference="16" object_id="_127"> <Value> <Obj> <type>2</type> <id>288</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>4</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_128"> <Value> <Obj> <type>2</type> <id>294</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>15</bitwidth> </Value> <const_type>0</const_type> <content>128</content> </item> <item class_id_reference="16" object_id="_129"> <Value> <Obj> <type>2</type> <id>307</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>8</bitwidth> </Value> <const_type>0</const_type> <content>128</content> </item> <item class_id_reference="16" object_id="_130"> <Value> <Obj> <type>2</type> <id>309</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>15</bitwidth> </Value> <const_type>0</const_type> <content>122</content> </item> <item class_id_reference="16" object_id="_131"> <Value> <Obj> <type>2</type> <id>312</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>16</bitwidth> </Value> <const_type>0</const_type> <content>65442</content> </item> <item class_id_reference="16" object_id="_132"> <Value> <Obj> <type>2</type> <id>315</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>13</bitwidth> </Value> <const_type>0</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="_133"> <Obj> <type>3</type> <id>39</id> <name>entry</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>14</count> <item_version>0</item_version> <item>23</item> <item>24</item> <item>25</item> <item>26</item> <item>28</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> </node_objs> </item> <item class_id_reference="18" object_id="_134"> <Obj> <type>3</type> <id>46</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>6</count> <item_version>0</item_version> <item>40</item> <item>41</item> <item>42</item> <item>43</item> <item>44</item> <item>45</item> </node_objs> </item> <item class_id_reference="18" object_id="_135"> <Obj> <type>3</type> <id>125</id> <name>.reset</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>72</count> <item_version>0</item_version> <item>47</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>61</item> <item>62</item> <item>63</item> <item>64</item> <item>65</item> <item>66</item> <item>67</item> <item>68</item> <item>69</item> <item>70</item> <item>71</item> <item>72</item> <item>73</item> <item>74</item> <item>75</item> <item>76</item> <item>77</item> <item>78</item> <item>79</item> <item>80</item> <item>81</item> <item>82</item> <item>83</item> <item>84</item> <item>85</item> <item>86</item> <item>87</item> <item>88</item> <item>89</item> <item>90</item> <item>91</item> <item>92</item> <item>93</item> <item>94</item> <item>95</item> <item>96</item> <item>97</item> <item>98</item> <item>99</item> <item>100</item> <item>101</item> <item>102</item> <item>103</item> <item>104</item> <item>105</item> <item>106</item> <item>107</item> <item>108</item> <item>109</item> <item>110</item> <item>111</item> <item>112</item> <item>113</item> <item>114</item> <item>115</item> <item>116</item> <item>117</item> <item>118</item> <item>119</item> <item>120</item> <item>121</item> <item>123</item> <item>124</item> </node_objs> </item> <item class_id_reference="18" object_id="_136"> <Obj> <type>3</type> <id>127</id> <name>.exit</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>126</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>169</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_137"> <id>130</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>23</sink_obj> </item> <item class_id_reference="20" object_id="_138"> <id>132</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>24</sink_obj> </item> <item class_id_reference="20" object_id="_139"> <id>134</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_140"> <id>137</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>26</sink_obj> </item> <item class_id_reference="20" object_id="_141"> <id>138</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>26</sink_obj> </item> <item class_id_reference="20" object_id="_142"> <id>140</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>28</sink_obj> </item> <item class_id_reference="20" object_id="_143"> <id>141</id> <edge_type>1</edge_type> <source_obj>24</source_obj> <sink_obj>28</sink_obj> </item> <item class_id_reference="20" object_id="_144"> <id>143</id> <edge_type>1</edge_type> <source_obj>16</source_obj> <sink_obj>30</sink_obj> </item> <item class_id_reference="20" object_id="_145"> <id>144</id> <edge_type>1</edge_type> <source_obj>23</source_obj> <sink_obj>30</sink_obj> </item> <item class_id_reference="20" object_id="_146"> <id>147</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>31</sink_obj> </item> <item class_id_reference="20" object_id="_147"> <id>149</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>32</sink_obj> </item> <item class_id_reference="20" object_id="_148"> <id>152</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>33</sink_obj> </item> <item class_id_reference="20" object_id="_149"> <id>153</id> <edge_type>1</edge_type> <source_obj>31</source_obj> <sink_obj>33</sink_obj> </item> <item class_id_reference="20" object_id="_150"> <id>155</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>34</sink_obj> </item> <item class_id_reference="20" object_id="_151"> <id>156</id> <edge_type>1</edge_type> <source_obj>32</source_obj> <sink_obj>34</sink_obj> </item> <item class_id_reference="20" object_id="_152"> <id>157</id> <edge_type>1</edge_type> <source_obj>31</source_obj> <sink_obj>35</sink_obj> </item> <item class_id_reference="20" object_id="_153"> <id>158</id> <edge_type>1</edge_type> <source_obj>32</source_obj> <sink_obj>36</sink_obj> </item> <item class_id_reference="20" object_id="_154"> <id>159</id> <edge_type>1</edge_type> <source_obj>36</source_obj> <sink_obj>37</sink_obj> </item> <item class_id_reference="20" object_id="_155"> <id>160</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>37</sink_obj> </item> <item class_id_reference="20" object_id="_156"> <id>161</id> <edge_type>2</edge_type> <source_obj>46</source_obj> <sink_obj>38</sink_obj> </item> <item class_id_reference="20" object_id="_157"> <id>163</id> <edge_type>1</edge_type> <source_obj>162</source_obj> <sink_obj>40</sink_obj> </item> <item class_id_reference="20" object_id="_158"> <id>164</id> <edge_type>2</edge_type> <source_obj>39</source_obj> <sink_obj>40</sink_obj> </item> <item class_id_reference="20" object_id="_159"> <id>165</id> <edge_type>1</edge_type> <source_obj>44</source_obj> <sink_obj>40</sink_obj> </item> <item class_id_reference="20" object_id="_160"> <id>166</id> <edge_type>2</edge_type> <source_obj>125</source_obj> <sink_obj>40</sink_obj> </item> <item class_id_reference="20" object_id="_161"> <id>168</id> <edge_type>1</edge_type> <source_obj>167</source_obj> <sink_obj>41</sink_obj> </item> <item class_id_reference="20" object_id="_162"> <id>169</id> <edge_type>2</edge_type> <source_obj>39</source_obj> <sink_obj>41</sink_obj> </item> <item class_id_reference="20" object_id="_163"> <id>170</id> <edge_type>1</edge_type> <source_obj>52</source_obj> <sink_obj>41</sink_obj> </item> <item class_id_reference="20" object_id="_164"> <id>171</id> <edge_type>2</edge_type> <source_obj>125</source_obj> <sink_obj>41</sink_obj> </item> <item class_id_reference="20" object_id="_165"> <id>172</id> <edge_type>1</edge_type> <source_obj>167</source_obj> <sink_obj>42</sink_obj> </item> <item class_id_reference="20" object_id="_166"> <id>173</id> <edge_type>2</edge_type> <source_obj>39</source_obj> <sink_obj>42</sink_obj> </item> <item class_id_reference="20" object_id="_167"> <id>174</id> <edge_type>1</edge_type> <source_obj>123</source_obj> <sink_obj>42</sink_obj> </item> <item class_id_reference="20" object_id="_168"> <id>175</id> <edge_type>2</edge_type> <source_obj>125</source_obj> <sink_obj>42</sink_obj> </item> <item class_id_reference="20" object_id="_169"> <id>176</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>43</sink_obj> </item> <item class_id_reference="20" object_id="_170"> <id>177</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>43</sink_obj> </item> <item class_id_reference="20" object_id="_171"> <id>178</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>44</sink_obj> </item> <item class_id_reference="20" object_id="_172"> <id>180</id> <edge_type>1</edge_type> <source_obj>179</source_obj> <sink_obj>44</sink_obj> </item> <item class_id_reference="20" object_id="_173"> <id>181</id> <edge_type>1</edge_type> <source_obj>43</source_obj> <sink_obj>45</sink_obj> </item> <item class_id_reference="20" object_id="_174"> <id>182</id> <edge_type>2</edge_type> <source_obj>125</source_obj> <sink_obj>45</sink_obj> </item> <item class_id_reference="20" object_id="_175"> <id>183</id> <edge_type>2</edge_type> <source_obj>127</source_obj> <sink_obj>45</sink_obj> </item> <item class_id_reference="20" object_id="_176"> <id>185</id> <edge_type>1</edge_type> <source_obj>184</source_obj> <sink_obj>47</sink_obj> </item> <item class_id_reference="20" object_id="_177"> <id>186</id> <edge_type>1</edge_type> <source_obj>41</source_obj> <sink_obj>47</sink_obj> </item> <item class_id_reference="20" object_id="_178"> <id>187</id> <edge_type>1</edge_type> <source_obj>42</source_obj> <sink_obj>50</sink_obj> </item> <item class_id_reference="20" object_id="_179"> <id>188</id> <edge_type>1</edge_type> <source_obj>32</source_obj> <sink_obj>50</sink_obj> </item> <item class_id_reference="20" object_id="_180"> <id>189</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>51</sink_obj> </item> <item class_id_reference="20" object_id="_181"> <id>190</id> <edge_type>1</edge_type> <source_obj>167</source_obj> <sink_obj>51</sink_obj> </item> <item class_id_reference="20" object_id="_182"> <id>191</id> <edge_type>1</edge_type> <source_obj>42</source_obj> <sink_obj>51</sink_obj> </item> <item class_id_reference="20" object_id="_183"> <id>192</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>52</sink_obj> </item> <item class_id_reference="20" object_id="_184"> <id>193</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>52</sink_obj> </item> <item class_id_reference="20" object_id="_185"> <id>194</id> <edge_type>1</edge_type> <source_obj>41</source_obj> <sink_obj>52</sink_obj> </item> <item class_id_reference="20" object_id="_186"> <id>195</id> <edge_type>1</edge_type> <source_obj>52</source_obj> <sink_obj>53</sink_obj> </item> <item class_id_reference="20" object_id="_187"> <id>198</id> <edge_type>1</edge_type> <source_obj>53</source_obj> <sink_obj>54</sink_obj> </item> <item class_id_reference="20" object_id="_188"> <id>200</id> <edge_type>1</edge_type> <source_obj>199</source_obj> <sink_obj>54</sink_obj> </item> <item class_id_reference="20" object_id="_189"> <id>201</id> <edge_type>1</edge_type> <source_obj>52</source_obj> <sink_obj>55</sink_obj> </item> <item class_id_reference="20" object_id="_190"> <id>204</id> <edge_type>1</edge_type> <source_obj>55</source_obj> <sink_obj>56</sink_obj> </item> <item class_id_reference="20" object_id="_191"> <id>206</id> <edge_type>1</edge_type> <source_obj>205</source_obj> <sink_obj>56</sink_obj> </item> <item class_id_reference="20" object_id="_192"> <id>207</id> <edge_type>1</edge_type> <source_obj>54</source_obj> <sink_obj>57</sink_obj> </item> <item class_id_reference="20" object_id="_193"> <id>208</id> <edge_type>1</edge_type> <source_obj>56</source_obj> <sink_obj>57</sink_obj> </item> <item class_id_reference="20" object_id="_194"> <id>209</id> <edge_type>1</edge_type> <source_obj>51</source_obj> <sink_obj>61</sink_obj> </item> <item class_id_reference="20" object_id="_195"> <id>210</id> <edge_type>1</edge_type> <source_obj>61</source_obj> <sink_obj>62</sink_obj> </item> <item class_id_reference="20" object_id="_196"> <id>211</id> <edge_type>1</edge_type> <source_obj>57</source_obj> <sink_obj>62</sink_obj> </item> <item class_id_reference="20" object_id="_197"> <id>212</id> <edge_type>1</edge_type> <source_obj>62</source_obj> <sink_obj>63</sink_obj> </item> <item class_id_reference="20" object_id="_198"> <id>213</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>64</sink_obj> </item> <item class_id_reference="20" object_id="_199"> <id>215</id> <edge_type>1</edge_type> <source_obj>214</source_obj> <sink_obj>64</sink_obj> </item> <item class_id_reference="20" object_id="_200"> <id>216</id> <edge_type>1</edge_type> <source_obj>63</source_obj> <sink_obj>64</sink_obj> </item> <item class_id_reference="20" object_id="_201"> <id>217</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>65</sink_obj> </item> <item class_id_reference="20" object_id="_202"> <id>218</id> <edge_type>1</edge_type> <source_obj>214</source_obj> <sink_obj>65</sink_obj> </item> <item class_id_reference="20" object_id="_203"> <id>219</id> <edge_type>1</edge_type> <source_obj>63</source_obj> <sink_obj>65</sink_obj> </item> <item class_id_reference="20" object_id="_204"> <id>220</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>66</sink_obj> </item> <item class_id_reference="20" object_id="_205"> <id>221</id> <edge_type>1</edge_type> <source_obj>214</source_obj> <sink_obj>66</sink_obj> </item> <item class_id_reference="20" object_id="_206"> <id>222</id> <edge_type>1</edge_type> <source_obj>63</source_obj> <sink_obj>66</sink_obj> </item> <item class_id_reference="20" object_id="_207"> <id>223</id> <edge_type>1</edge_type> <source_obj>64</source_obj> <sink_obj>67</sink_obj> </item> <item class_id_reference="20" object_id="_208"> <id>224</id> <edge_type>1</edge_type> <source_obj>65</source_obj> <sink_obj>68</sink_obj> </item> <item class_id_reference="20" object_id="_209"> <id>225</id> <edge_type>1</edge_type> <source_obj>66</source_obj> <sink_obj>69</sink_obj> </item> <item class_id_reference="20" object_id="_210"> <id>226</id> <edge_type>1</edge_type> <source_obj>67</source_obj> <sink_obj>70</sink_obj> </item> <item class_id_reference="20" object_id="_211"> <id>229</id> <edge_type>1</edge_type> <source_obj>67</source_obj> <sink_obj>71</sink_obj> </item> <item class_id_reference="20" object_id="_212"> <id>231</id> <edge_type>1</edge_type> <source_obj>230</source_obj> <sink_obj>71</sink_obj> </item> <item class_id_reference="20" object_id="_213"> <id>232</id> <edge_type>1</edge_type> <source_obj>71</source_obj> <sink_obj>72</sink_obj> </item> <item class_id_reference="20" object_id="_214"> <id>235</id> <edge_type>1</edge_type> <source_obj>67</source_obj> <sink_obj>73</sink_obj> </item> <item class_id_reference="20" object_id="_215"> <id>237</id> <edge_type>1</edge_type> <source_obj>236</source_obj> <sink_obj>73</sink_obj> </item> <item class_id_reference="20" object_id="_216"> <id>238</id> <edge_type>1</edge_type> <source_obj>73</source_obj> <sink_obj>74</sink_obj> </item> <item class_id_reference="20" object_id="_217"> <id>239</id> <edge_type>1</edge_type> <source_obj>68</source_obj> <sink_obj>75</sink_obj> </item> <item class_id_reference="20" object_id="_218"> <id>240</id> <edge_type>1</edge_type> <source_obj>68</source_obj> <sink_obj>76</sink_obj> </item> <item class_id_reference="20" object_id="_219"> <id>243</id> <edge_type>1</edge_type> <source_obj>68</source_obj> <sink_obj>77</sink_obj> </item> <item class_id_reference="20" object_id="_220"> <id>245</id> <edge_type>1</edge_type> <source_obj>244</source_obj> <sink_obj>77</sink_obj> </item> <item class_id_reference="20" object_id="_221"> <id>246</id> <edge_type>1</edge_type> <source_obj>77</source_obj> <sink_obj>78</sink_obj> </item> <item class_id_reference="20" object_id="_222"> <id>247</id> <edge_type>1</edge_type> <source_obj>69</source_obj> <sink_obj>79</sink_obj> </item> <item class_id_reference="20" object_id="_223"> <id>249</id> <edge_type>1</edge_type> <source_obj>248</source_obj> <sink_obj>80</sink_obj> </item> <item class_id_reference="20" object_id="_224"> <id>250</id> <edge_type>1</edge_type> <source_obj>79</source_obj> <sink_obj>80</sink_obj> </item> <item class_id_reference="20" object_id="_225"> <id>252</id> <edge_type>1</edge_type> <source_obj>251</source_obj> <sink_obj>81</sink_obj> </item> <item class_id_reference="20" object_id="_226"> <id>253</id> <edge_type>1</edge_type> <source_obj>74</source_obj> <sink_obj>81</sink_obj> </item> <item class_id_reference="20" object_id="_227"> <id>254</id> <edge_type>1</edge_type> <source_obj>81</source_obj> <sink_obj>82</sink_obj> </item> <item class_id_reference="20" object_id="_228"> <id>255</id> <edge_type>1</edge_type> <source_obj>82</source_obj> <sink_obj>83</sink_obj> </item> <item class_id_reference="20" object_id="_229"> <id>256</id> <edge_type>1</edge_type> <source_obj>72</source_obj> <sink_obj>83</sink_obj> </item> <item class_id_reference="20" object_id="_230"> <id>257</id> <edge_type>1</edge_type> <source_obj>83</source_obj> <sink_obj>84</sink_obj> </item> <item class_id_reference="20" object_id="_231"> <id>258</id> <edge_type>1</edge_type> <source_obj>78</source_obj> <sink_obj>85</sink_obj> </item> <item class_id_reference="20" object_id="_232"> <id>259</id> <edge_type>1</edge_type> <source_obj>84</source_obj> <sink_obj>85</sink_obj> </item> <item class_id_reference="20" object_id="_233"> <id>260</id> <edge_type>1</edge_type> <source_obj>80</source_obj> <sink_obj>86</sink_obj> </item> <item class_id_reference="20" object_id="_234"> <id>261</id> <edge_type>1</edge_type> <source_obj>76</source_obj> <sink_obj>86</sink_obj> </item> <item class_id_reference="20" object_id="_235"> <id>262</id> <edge_type>1</edge_type> <source_obj>86</source_obj> <sink_obj>87</sink_obj> </item> <item class_id_reference="20" object_id="_236"> <id>263</id> <edge_type>1</edge_type> <source_obj>87</source_obj> <sink_obj>88</sink_obj> </item> <item class_id_reference="20" object_id="_237"> <id>264</id> <edge_type>1</edge_type> <source_obj>85</source_obj> <sink_obj>88</sink_obj> </item> <item class_id_reference="20" object_id="_238"> <id>267</id> <edge_type>1</edge_type> <source_obj>88</source_obj> <sink_obj>89</sink_obj> </item> <item class_id_reference="20" object_id="_239"> <id>269</id> <edge_type>1</edge_type> <source_obj>268</source_obj> <sink_obj>89</sink_obj> </item> <item class_id_reference="20" object_id="_240"> <id>271</id> <edge_type>1</edge_type> <source_obj>270</source_obj> <sink_obj>89</sink_obj> </item> <item class_id_reference="20" object_id="_241"> <id>273</id> <edge_type>1</edge_type> <source_obj>272</source_obj> <sink_obj>90</sink_obj> </item> <item class_id_reference="20" object_id="_242"> <id>274</id> <edge_type>1</edge_type> <source_obj>89</source_obj> <sink_obj>90</sink_obj> </item> <item class_id_reference="20" object_id="_243"> <id>276</id> <edge_type>1</edge_type> <source_obj>275</source_obj> <sink_obj>91</sink_obj> </item> <item class_id_reference="20" object_id="_244"> <id>277</id> <edge_type>1</edge_type> <source_obj>70</source_obj> <sink_obj>91</sink_obj> </item> <item class_id_reference="20" object_id="_245"> <id>279</id> <edge_type>1</edge_type> <source_obj>278</source_obj> <sink_obj>92</sink_obj> </item> <item class_id_reference="20" object_id="_246"> <id>280</id> <edge_type>1</edge_type> <source_obj>75</source_obj> <sink_obj>92</sink_obj> </item> <item class_id_reference="20" object_id="_247"> <id>282</id> <edge_type>1</edge_type> <source_obj>69</source_obj> <sink_obj>93</sink_obj> </item> <item class_id_reference="20" object_id="_248"> <id>283</id> <edge_type>1</edge_type> <source_obj>244</source_obj> <sink_obj>93</sink_obj> </item> <item class_id_reference="20" object_id="_249"> <id>284</id> <edge_type>1</edge_type> <source_obj>93</source_obj> <sink_obj>94</sink_obj> </item> <item class_id_reference="20" object_id="_250"> <id>287</id> <edge_type>1</edge_type> <source_obj>69</source_obj> <sink_obj>95</sink_obj> </item> <item class_id_reference="20" object_id="_251"> <id>289</id> <edge_type>1</edge_type> <source_obj>288</source_obj> <sink_obj>95</sink_obj> </item> <item class_id_reference="20" object_id="_252"> <id>290</id> <edge_type>1</edge_type> <source_obj>95</source_obj> <sink_obj>96</sink_obj> </item> <item class_id_reference="20" object_id="_253"> <id>291</id> <edge_type>1</edge_type> <source_obj>95</source_obj> <sink_obj>97</sink_obj> </item> <item class_id_reference="20" object_id="_254"> <id>292</id> <edge_type>1</edge_type> <source_obj>94</source_obj> <sink_obj>98</sink_obj> </item> <item class_id_reference="20" object_id="_255"> <id>293</id> <edge_type>1</edge_type> <source_obj>97</source_obj> <sink_obj>98</sink_obj> </item> <item class_id_reference="20" object_id="_256"> <id>295</id> <edge_type>1</edge_type> <source_obj>294</source_obj> <sink_obj>99</sink_obj> </item> <item class_id_reference="20" object_id="_257"> <id>296</id> <edge_type>1</edge_type> <source_obj>91</source_obj> <sink_obj>99</sink_obj> </item> <item class_id_reference="20" object_id="_258"> <id>297</id> <edge_type>1</edge_type> <source_obj>99</source_obj> <sink_obj>100</sink_obj> </item> <item class_id_reference="20" object_id="_259"> <id>298</id> <edge_type>1</edge_type> <source_obj>98</source_obj> <sink_obj>101</sink_obj> </item> <item class_id_reference="20" object_id="_260"> <id>299</id> <edge_type>1</edge_type> <source_obj>100</source_obj> <sink_obj>101</sink_obj> </item> <item class_id_reference="20" object_id="_261"> <id>300</id> <edge_type>1</edge_type> <source_obj>101</source_obj> <sink_obj>102</sink_obj> </item> <item class_id_reference="20" object_id="_262"> <id>301</id> <edge_type>1</edge_type> <source_obj>92</source_obj> <sink_obj>102</sink_obj> </item> <item class_id_reference="20" object_id="_263"> <id>303</id> <edge_type>1</edge_type> <source_obj>102</source_obj> <sink_obj>103</sink_obj> </item> <item class_id_reference="20" object_id="_264"> <id>304</id> <edge_type>1</edge_type> <source_obj>268</source_obj> <sink_obj>103</sink_obj> </item> <item class_id_reference="20" object_id="_265"> <id>305</id> <edge_type>1</edge_type> <source_obj>270</source_obj> <sink_obj>103</sink_obj> </item> <item class_id_reference="20" object_id="_266"> <id>306</id> <edge_type>1</edge_type> <source_obj>103</source_obj> <sink_obj>104</sink_obj> </item> <item class_id_reference="20" object_id="_267"> <id>308</id> <edge_type>1</edge_type> <source_obj>307</source_obj> <sink_obj>104</sink_obj> </item> <item class_id_reference="20" object_id="_268"> <id>310</id> <edge_type>1</edge_type> <source_obj>309</source_obj> <sink_obj>105</sink_obj> </item> <item class_id_reference="20" object_id="_269"> <id>311</id> <edge_type>1</edge_type> <source_obj>70</source_obj> <sink_obj>105</sink_obj> </item> <item class_id_reference="20" object_id="_270"> <id>313</id> <edge_type>1</edge_type> <source_obj>312</source_obj> <sink_obj>106</sink_obj> </item> <item class_id_reference="20" object_id="_271"> <id>314</id> <edge_type>1</edge_type> <source_obj>75</source_obj> <sink_obj>106</sink_obj> </item> <item class_id_reference="20" object_id="_272"> <id>316</id> <edge_type>1</edge_type> <source_obj>315</source_obj> <sink_obj>107</sink_obj> </item> <item class_id_reference="20" object_id="_273"> <id>317</id> <edge_type>1</edge_type> <source_obj>96</source_obj> <sink_obj>107</sink_obj> </item> <item class_id_reference="20" object_id="_274"> <id>318</id> <edge_type>1</edge_type> <source_obj>107</source_obj> <sink_obj>108</sink_obj> </item> <item class_id_reference="20" object_id="_275"> <id>320</id> <edge_type>1</edge_type> <source_obj>69</source_obj> <sink_obj>109</sink_obj> </item> <item class_id_reference="20" object_id="_276"> <id>321</id> <edge_type>1</edge_type> <source_obj>236</source_obj> <sink_obj>109</sink_obj> </item> <item class_id_reference="20" object_id="_277"> <id>322</id> <edge_type>1</edge_type> <source_obj>109</source_obj> <sink_obj>110</sink_obj> </item> <item class_id_reference="20" object_id="_278"> <id>323</id> <edge_type>1</edge_type> <source_obj>108</source_obj> <sink_obj>111</sink_obj> </item> <item class_id_reference="20" object_id="_279"> <id>324</id> <edge_type>1</edge_type> <source_obj>110</source_obj> <sink_obj>111</sink_obj> </item> <item class_id_reference="20" object_id="_280"> <id>325</id> <edge_type>1</edge_type> <source_obj>111</source_obj> <sink_obj>112</sink_obj> </item> <item class_id_reference="20" object_id="_281"> <id>326</id> <edge_type>1</edge_type> <source_obj>294</source_obj> <sink_obj>113</sink_obj> </item> <item class_id_reference="20" object_id="_282"> <id>327</id> <edge_type>1</edge_type> <source_obj>105</source_obj> <sink_obj>113</sink_obj> </item> <item class_id_reference="20" object_id="_283"> <id>328</id> <edge_type>1</edge_type> <source_obj>113</source_obj> <sink_obj>114</sink_obj> </item> <item class_id_reference="20" object_id="_284"> <id>329</id> <edge_type>1</edge_type> <source_obj>114</source_obj> <sink_obj>115</sink_obj> </item> <item class_id_reference="20" object_id="_285"> <id>330</id> <edge_type>1</edge_type> <source_obj>112</source_obj> <sink_obj>115</sink_obj> </item> <item class_id_reference="20" object_id="_286"> <id>331</id> <edge_type>1</edge_type> <source_obj>115</source_obj> <sink_obj>116</sink_obj> </item> <item class_id_reference="20" object_id="_287"> <id>332</id> <edge_type>1</edge_type> <source_obj>106</source_obj> <sink_obj>116</sink_obj> </item> <item class_id_reference="20" object_id="_288"> <id>334</id> <edge_type>1</edge_type> <source_obj>116</source_obj> <sink_obj>117</sink_obj> </item> <item class_id_reference="20" object_id="_289"> <id>335</id> <edge_type>1</edge_type> <source_obj>268</source_obj> <sink_obj>117</sink_obj> </item> <item class_id_reference="20" object_id="_290"> <id>336</id> <edge_type>1</edge_type> <source_obj>270</source_obj> <sink_obj>117</sink_obj> </item> <item class_id_reference="20" object_id="_291"> <id>337</id> <edge_type>1</edge_type> <source_obj>117</source_obj> <sink_obj>118</sink_obj> </item> <item class_id_reference="20" object_id="_292"> <id>338</id> <edge_type>1</edge_type> <source_obj>307</source_obj> <sink_obj>118</sink_obj> </item> <item class_id_reference="20" object_id="_293"> <id>341</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>119</sink_obj> </item> <item class_id_reference="20" object_id="_294"> <id>342</id> <edge_type>1</edge_type> <source_obj>90</source_obj> <sink_obj>119</sink_obj> </item> <item class_id_reference="20" object_id="_295"> <id>344</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>120</sink_obj> </item> <item class_id_reference="20" object_id="_296"> <id>345</id> <edge_type>1</edge_type> <source_obj>104</source_obj> <sink_obj>120</sink_obj> </item> <item class_id_reference="20" object_id="_297"> <id>347</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>121</sink_obj> </item> <item class_id_reference="20" object_id="_298"> <id>348</id> <edge_type>1</edge_type> <source_obj>118</source_obj> <sink_obj>121</sink_obj> </item> <item class_id_reference="20" object_id="_299"> <id>349</id> <edge_type>1</edge_type> <source_obj>184</source_obj> <sink_obj>123</sink_obj> </item> <item class_id_reference="20" object_id="_300"> <id>350</id> <edge_type>1</edge_type> <source_obj>51</source_obj> <sink_obj>123</sink_obj> </item> <item class_id_reference="20" object_id="_301"> <id>351</id> <edge_type>2</edge_type> <source_obj>46</source_obj> <sink_obj>124</sink_obj> </item> <item class_id_reference="20" object_id="_302"> <id>523</id> <edge_type>2</edge_type> <source_obj>39</source_obj> <sink_obj>46</sink_obj> </item> <item class_id_reference="20" object_id="_303"> <id>524</id> <edge_type>2</edge_type> <source_obj>46</source_obj> <sink_obj>127</sink_obj> </item> <item class_id_reference="20" object_id="_304"> <id>525</id> <edge_type>2</edge_type> <source_obj>46</source_obj> <sink_obj>125</sink_obj> </item> <item class_id_reference="20" object_id="_305"> <id>526</id> <edge_type>2</edge_type> <source_obj>125</source_obj> <sink_obj>46</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="_306"> <mId>1</mId> <mTag>rgb2yuv11</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>2457609</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> <item class_id_reference="22" object_id="_307"> <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>39</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> <item class_id_reference="22" object_id="_308"> <mId>3</mId> <mTag>RGB2YUV_LOOP_X_RGB2YUV_LOOP_Y</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>46</item> <item>125</item> </basic_blocks> <mII>1</mII> <mDepth>9</mDepth> <mMinTripCount>40000</mMinTripCount> <mMaxTripCount>2457600</mMaxTripCount> <mMinLatency>2457607</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> <item class_id_reference="22" object_id="_309"> <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>127</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> </cdfg_regions> <fsm class_id="24" tracking_level="1" version="0" object_id="_310"> <states class_id="25" tracking_level="0" version="0"> <count>11</count> <item_version>0</item_version> <item class_id="26" tracking_level="1" version="0" object_id="_311"> <id>1</id> <operations class_id="27" tracking_level="0" version="0"> <count>22</count> <item_version>0</item_version> <item class_id="28" tracking_level="1" version="0" object_id="_312"> <id>17</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_313"> <id>18</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_314"> <id>19</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_315"> <id>20</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_316"> <id>21</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_317"> <id>22</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_318"> <id>23</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_319"> <id>24</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_320"> <id>25</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_321"> <id>26</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_322"> <id>27</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_323"> <id>28</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_324"> <id>29</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_325"> <id>30</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_326"> <id>31</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_327"> <id>32</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_328"> <id>33</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_329"> <id>34</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_330"> <id>35</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_331"> <id>36</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_332"> <id>37</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_333"> <id>38</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_334"> <id>2</id> <operations> <count>12</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_335"> <id>40</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_336"> <id>41</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_337"> <id>42</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_338"> <id>43</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_339"> <id>44</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_340"> <id>45</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_341"> <id>47</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_342"> <id>50</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_343"> <id>51</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_344"> <id>52</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_345"> <id>53</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_346"> <id>55</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_347"> <id>3</id> <operations> <count>6</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_348"> <id>54</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_349"> <id>56</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_350"> <id>57</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_351"> <id>61</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_352"> <id>62</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_353"> <id>123</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_354"> <id>4</id> <operations> <count>7</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_355"> <id>63</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_356"> <id>64</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_357"> <id>65</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_358"> <id>66</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_359"> <id>67</id> <stage>4</stage> <latency>4</latency> </item> <item class_id_reference="28" object_id="_360"> <id>68</id> <stage>4</stage> <latency>4</latency> </item> <item class_id_reference="28" object_id="_361"> <id>69</id> <stage>4</stage> <latency>4</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_362"> <id>5</id> <operations> <count>3</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_363"> <id>67</id> <stage>3</stage> <latency>4</latency> </item> <item class_id_reference="28" object_id="_364"> <id>68</id> <stage>3</stage> <latency>4</latency> </item> <item class_id_reference="28" object_id="_365"> <id>69</id> <stage>3</stage> <latency>4</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_366"> <id>6</id> <operations> <count>3</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_367"> <id>67</id> <stage>2</stage> <latency>4</latency> </item> <item class_id_reference="28" object_id="_368"> <id>68</id> <stage>2</stage> <latency>4</latency> </item> <item class_id_reference="28" object_id="_369"> <id>69</id> <stage>2</stage> <latency>4</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_370"> <id>7</id> <operations> <count>6</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_371"> <id>67</id> <stage>1</stage> <latency>4</latency> </item> <item class_id_reference="28" object_id="_372"> <id>68</id> <stage>1</stage> <latency>4</latency> </item> <item class_id_reference="28" object_id="_373"> <id>69</id> <stage>1</stage> <latency>4</latency> </item> <item class_id_reference="28" object_id="_374"> <id>73</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_375"> <id>74</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_376"> <id>81</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_377"> <id>8</id> <operations> <count>33</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_378"> <id>70</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_379"> <id>71</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_380"> <id>72</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_381"> <id>76</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_382"> <id>77</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_383"> <id>78</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_384"> <id>79</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_385"> <id>80</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_386"> <id>82</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_387"> <id>83</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_388"> <id>84</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_389"> <id>85</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_390"> <id>86</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_391"> <id>87</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_392"> <id>88</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_393"> <id>89</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_394"> <id>91</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_395"> <id>93</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_396"> <id>94</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_397"> <id>95</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_398"> <id>96</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_399"> <id>97</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_400"> <id>98</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_401"> <id>99</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_402"> <id>100</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_403"> <id>101</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_404"> <id>105</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_405"> <id>107</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_406"> <id>108</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_407"> <id>109</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_408"> <id>110</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_409"> <id>111</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_410"> <id>113</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_411"> <id>9</id> <operations> <count>10</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_412"> <id>75</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_413"> <id>92</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_414"> <id>102</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_415"> <id>103</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_416"> <id>106</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_417"> <id>112</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_418"> <id>114</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_419"> <id>115</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_420"> <id>116</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_421"> <id>117</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_422"> <id>10</id> <operations> <count>13</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_423"> <id>48</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_424"> <id>49</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_425"> <id>58</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_426"> <id>59</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_427"> <id>60</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_428"> <id>90</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_429"> <id>104</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_430"> <id>118</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_431"> <id>119</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_432"> <id>120</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_433"> <id>121</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_434"> <id>122</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_435"> <id>124</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_436"> <id>11</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_437"> <id>126</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> </states> <transitions class_id="29" tracking_level="0" version="0"> <count>11</count> <item_version>0</item_version> <item class_id="30" tracking_level="1" version="0" object_id="_438"> <inState>1</inState> <outState>2</outState> <condition class_id="31" tracking_level="0" version="0"> <id>23</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="_439"> <inState>3</inState> <outState>4</outState> <condition> <id>38</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_440"> <inState>4</inState> <outState>5</outState> <condition> <id>39</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="_441"> <inState>5</inState> <outState>6</outState> <condition> <id>40</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_442"> <inState>6</inState> <outState>7</outState> <condition> <id>41</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_443"> <inState>7</inState> <outState>8</outState> <condition> <id>42</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_444"> <inState>8</inState> <outState>9</outState> <condition> <id>43</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_445"> <inState>9</inState> <outState>10</outState> <condition> <id>44</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_446"> <inState>10</inState> <outState>2</outState> <condition> <id>45</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_447"> <inState>2</inState> <outState>11</outState> <condition> <id>37</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>43</first> <second>0</second> </first> <second>0</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_448"> <inState>2</inState> <outState>3</outState> <condition> <id>46</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>43</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="_449"> <dp_component_resource class_id="37" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_component_resource> <dp_expression_resource> <count>27</count> <item_version>0</item_version> <item class_id="38" tracking_level="0" version="0"> <first>ap_block_pp0_stage0_flag00001001 ( and ) </first> <second class_id="39" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="40" tracking_level="0" version="0"> <first>(0P0)</first> <second>1</second> </item> <item> <first>(1P1)</first> <second>1</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>2</second> </item> </second> </item> <item> <first>ap_block_state1 ( or ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>1</second> </item> <item> <first>(1P1)</first> <second>1</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>2</second> </item> </second> </item> <item> <first>ap_block_state10_pp0_stage0_iter8 ( or ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>1</second> </item> <item> <first>(1P1)</first> <second>1</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>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_reg_pp0_iter1 ( 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>exitcond_flatten_fu_302_p2 ( icmp ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>32</second> </item> <item> <first>(1P1)</first> <second>32</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>16</second> </item> </second> </item> <item> <first>exitcond_i_i_fu_319_p2 ( icmp ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>16</second> </item> <item> <first>(1P1)</first> <second>16</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>8</second> </item> </second> </item> <item> <first>grp_fu_634_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>16</second> </item> <item> <first>(1P1)</first> <second>16</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>23</second> </item> </second> </item> <item> <first>indvar_flatten_next_fu_307_p2 ( + ) </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> <item> <first>out_channels_ch1_din ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>5</second> </item> <item> <first>(1P1)</first> <second>8</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>15</second> </item> </second> </item> <item> <first>out_channels_ch2_din ( xor ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>8</second> </item> <item> <first>(1P1)</first> <second>9</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>9</second> </item> </second> </item> <item> <first>out_channels_ch3_din ( xor ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>8</second> </item> <item> <first>(1P1)</first> <second>9</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>9</second> </item> </second> </item> <item> <first>p_neg_i_i_fu_516_p2 ( - ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>1</second> </item> <item> <first>(1P1)</first> <second>13</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>20</second> </item> </second> </item> <item> <first>start_write ( 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>tmp1_fu_450_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>16</second> </item> <item> <first>(1P1)</first> <second>16</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>23</second> </item> </second> </item> <item> <first>tmp3_fu_510_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>16</second> </item> <item> <first>(1P1)</first> <second>16</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>23</second> </item> </second> </item> <item> <first>tmp_24_fu_371_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>23</second> </item> <item> <first>(1P1)</first> <second>23</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>23</second> </item> </second> </item> <item> <first>tmp_46_i_i_fu_440_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>15</second> </item> <item> <first>(1P1)</first> <second>15</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>22</second> </item> </second> </item> <item> <first>tmp_48_i_i_fu_459_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>16</second> </item> <item> <first>(1P1)</first> <second>16</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>23</second> </item> </second> </item> <item> <first>tmp_53_i_i_fu_501_p2 ( - ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>16</second> </item> <item> <first>(1P1)</first> <second>16</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>23</second> </item> </second> </item> <item> <first>tmp_61_i_i_fu_537_p2 ( - ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>14</second> </item> <item> <first>(1P1)</first> <second>14</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>21</second> </item> </second> </item> <item> <first>tmp_fu_400_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>8</second> </item> <item> <first>(1P1)</first> <second>10</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>17</second> </item> </second> </item> <item> <first>tmp_i_i_mid2_v_fu_332_p3 ( select ) </first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>1</second> </item> <item> <first>(1P1)</first> <second>16</second> </item> <item> <first>(2P2)</first> <second>16</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>16</second> </item> </second> </item> <item> <first>tmp_s_fu_362_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>23</second> </item> <item> <first>(1P1)</first> <second>23</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>23</second> </item> </second> </item> <item> <first>x_fu_313_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>1</second> </item> <item> <first>(1P1)</first> <second>16</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>23</second> </item> </second> </item> <item> <first>y_fu_377_p2 ( + ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>1</second> </item> <item> <first>(1P1)</first> <second>16</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>23</second> </item> </second> </item> <item> <first>y_i_i_mid2_fu_324_p3 ( select ) </first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>1</second> </item> <item> <first>(1P1)</first> <second>1</second> </item> <item> <first>(2P2)</first> <second>16</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>16</second> </item> </second> </item> </dp_expression_resource> <dp_fifo_resource> <count>0</count> <item_version>0</item_version> </dp_fifo_resource> <dp_memory_resource> <count>0</count> <item_version>0</item_version> </dp_memory_resource> <dp_multiplexer_resource> <count>18</count> <item_version>0</item_version> <item> <first>U_scale_out_blk_n</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>V_scale_out_blk_n</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>Y_scale_out_blk_n</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_NS_fsm</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>4</second> </item> <item> <first>(1Bits)</first> <second>1</second> </item> <item> <first>(2Count)</first> <second>4</second> </item> <item> <first>LUT</first> <second>21</second> </item> </second> </item> <item> <first>ap_done</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_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_iter8</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>indvar_flatten_reg_261</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>32</second> </item> <item> <first>(2Count)</first> <second>64</second> </item> <item> <first>LUT</first> <second>9</second> </item> </second> </item> <item> <first>out_channels_ch1_blk_n</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>out_channels_ch2_blk_n</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>out_channels_ch3_blk_n</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>out_height_blk_n</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>out_width_blk_n</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>real_start</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>x_i_i_phi_fu_276_p4</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>16</second> </item> <item> <first>(2Count)</first> <second>32</second> </item> <item> <first>LUT</first> <second>9</second> </item> </second> </item> <item> <first>x_i_i_reg_272</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>16</second> </item> <item> <first>(2Count)</first> <second>32</second> </item> <item> <first>LUT</first> <second>9</second> </item> </second> </item> <item> <first>y_i_i_phi_fu_287_p4</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>16</second> </item> <item> <first>(2Count)</first> <second>32</second> </item> <item> <first>LUT</first> <second>9</second> </item> </second> </item> <item> <first>y_i_i_reg_283</first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0Size)</first> <second>2</second> </item> <item> <first>(1Bits)</first> <second>16</second> </item> <item> <first>(2Count)</first> <second>32</second> </item> <item> <first>LUT</first> <second>9</second> </item> </second> </item> </dp_multiplexer_resource> <dp_register_resource> <count>36</count> <item_version>0</item_version> <item> <first>B_reg_721</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>8</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>8</second> </item> </second> </item> <item> <first>G_reg_714</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>8</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>8</second> </item> </second> </item> <item> <first>R_reg_708</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>8</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>8</second> </item> </second> </item> <item> <first>ap_CS_fsm</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>3</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>3</second> </item> </second> </item> <item> <first>ap_done_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>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_pp0_iter3</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_iter4</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_iter5</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_iter6</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_iter7</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_iter8</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>1</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>1</second> </item> </second> </item> <item> <first>ap_reg_pp0_iter6_G_reg_714</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>8</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>8</second> </item> </second> </item> <item> <first>ap_reg_pp0_iter7_tmp_50_i_i_reg_734</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>8</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>8</second> </item> </second> </item> <item> <first>bound_reg_648</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>exitcond_flatten_reg_653</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>1</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>1</second> </item> </second> </item> <item> <first>indvar_flatten_reg_261</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>real_start_status_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>start_control_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>start_once_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>tmp3_reg_739</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>16</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>16</second> </item> </second> </item> <item> <first>tmp_22_reg_673</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>tmp_23_reg_678</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>15</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>15</second> </item> </second> </item> <item> <first>tmp_24_reg_683</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>23</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>23</second> </item> </second> </item> <item> <first>tmp_50_i_i_reg_734</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>8</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>8</second> </item> </second> </item> <item> <first>tmp_58_i_i_reg_754</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>8</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>8</second> </item> </second> </item> <item> <first>tmp_61_i_i_reg_744</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>14</second> </item> <item> <first>(Consts)</first> <second>1</second> </item> <item> <first>FF</first> <second>13</second> </item> </second> </item> <item> <first>tmp_62_i_i_reg_749</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>15</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>15</second> </item> </second> </item> <item> <first>tmp_66_i_i_reg_759</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>8</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>8</second> </item> </second> </item> <item> <first>tmp_i_i_mid2_v_reg_668</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>16</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>16</second> </item> </second> </item> <item> <first>tmp_reg_729</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>10</second> </item> <item> <first>(Consts)</first> <second>1</second> </item> <item> <first>FF</first> <second>9</second> </item> </second> </item> <item> <first>x_i_i_reg_272</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>16</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>16</second> </item> </second> </item> <item> <first>y_i_i_mid2_reg_662</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>16</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>16</second> </item> </second> </item> <item> <first>y_i_i_reg_283</first> <second> <count>3</count> <item_version>0</item_version> <item> <first>(Bits)</first> <second>16</second> </item> <item> <first>(Consts)</first> <second>0</second> </item> <item> <first>FF</first> <second>16</second> </item> </second> </item> </dp_register_resource> <dp_component_map class_id="41" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_component_map> <dp_expression_map> <count>21</count> <item_version>0</item_version> <item class_id="42" tracking_level="0" version="0"> <first>exitcond_flatten_fu_302_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>exitcond_i_i_fu_319_p2 ( icmp ) </first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>grp_fu_634_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>115</item> </second> </item> <item> <first>indvar_flatten_next_fu_307_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>44</item> </second> </item> <item> <first>out_channels_ch1_din ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>90</item> </second> </item> <item> <first>out_channels_ch2_din ( xor ) </first> <second> <count>1</count> <item_version>0</item_version> <item>104</item> </second> </item> <item> <first>out_channels_ch3_din ( xor ) </first> <second> <count>1</count> <item_version>0</item_version> <item>118</item> </second> </item> <item> <first>p_neg_i_i_fu_516_p2 ( - ) </first> <second> <count>1</count> <item_version>0</item_version> <item>107</item> </second> </item> <item> <first>tmp1_fu_450_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>85</item> </second> </item> <item> <first>tmp3_fu_510_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>101</item> </second> </item> <item> <first>tmp_24_fu_371_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>tmp_46_i_i_fu_440_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>tmp_48_i_i_fu_459_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>88</item> </second> </item> <item> <first>tmp_53_i_i_fu_501_p2 ( - ) </first> <second> <count>1</count> <item_version>0</item_version> <item>98</item> </second> </item> <item> <first>tmp_61_i_i_fu_537_p2 ( - ) </first> <second> <count>1</count> <item_version>0</item_version> <item>111</item> </second> </item> <item> <first>tmp_fu_400_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>81</item> </second> </item> <item> <first>tmp_i_i_mid2_v_fu_332_p3 ( select ) </first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>tmp_s_fu_362_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>57</item> </second> </item> <item> <first>x_fu_313_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>y_fu_377_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>123</item> </second> </item> <item> <first>y_i_i_mid2_fu_324_p3 ( select ) </first> <second> <count>1</count> <item_version>0</item_version> <item>51</item> </second> </item> </dp_expression_map> <dp_fifo_map> <count>0</count> <item_version>0</item_version> </dp_fifo_map> <dp_memory_map> <count>0</count> <item_version>0</item_version> </dp_memory_map> </res> <node_label_latency class_id="43" tracking_level="0" version="0"> <count>93</count> <item_version>0</item_version> <item class_id="44" tracking_level="0" version="0"> <first>23</first> <second class_id="45" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>24</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>25</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>26</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>28</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>30</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>31</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>32</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>33</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>34</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>35</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>36</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>37</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>38</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>40</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>41</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>42</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>43</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>44</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>45</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>47</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>50</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>51</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>52</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>53</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>54</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>55</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>56</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>57</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>61</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>62</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>63</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>64</first> <second> <first>3</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>3</first> <second>0</second> </second> </item> <item> <first>67</first> <second> <first>3</first> <second>3</second> </second> </item> <item> <first>68</first> <second> <first>3</first> <second>3</second> </second> </item> <item> <first>69</first> <second> <first>3</first> <second>3</second> </second> </item> <item> <first>70</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>71</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>72</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>73</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>74</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>75</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>76</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>77</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>78</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>79</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>80</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>81</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>82</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>83</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>84</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>85</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>86</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>87</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>88</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>89</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>90</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>91</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>92</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>93</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>94</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>95</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>96</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>97</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>98</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>99</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>100</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>101</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>102</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>103</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>104</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>105</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>106</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>107</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>108</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>109</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>110</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>111</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>112</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>113</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>114</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>115</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>116</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>117</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>118</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>119</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>120</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>121</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>123</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>124</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>126</first> <second> <first>2</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="46" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="47" tracking_level="0" version="0"> <first>39</first> <second class_id="48" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>46</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>125</first> <second> <first>1</first> <second>9</second> </second> </item> <item> <first>127</first> <second> <first>2</first> <second>2</second> </second> </item> </bblk_ent_exit> <regions class_id="49" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="50" tracking_level="1" version="0" object_id="_450"> <region_name>RGB2YUV_LOOP_X_RGB2YUV_LOOP_Y</region_name> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>46</item> <item>125</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>9</pipe_depth> </item> </regions> <dp_fu_nodes class_id="51" tracking_level="0" version="0"> <count>84</count> <item_version>0</item_version> <item class_id="52" tracking_level="0" version="0"> <first>134</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>140</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>146</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>152</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>160</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>168</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>176</first> <second> <count>1</count> <item_version>0</item_version> <item>31</item> </second> </item> <item> <first>182</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>188</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>196</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>204</first> <second> <count>1</count> <item_version>0</item_version> <item>119</item> </second> </item> <item> <first>211</first> <second> <count>1</count> <item_version>0</item_version> <item>120</item> </second> </item> <item> <first>218</first> <second> <count>1</count> <item_version>0</item_version> <item>121</item> </second> </item> <item> <first>225</first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> <item> <first>232</first> <second> <count>1</count> <item_version>0</item_version> <item>65</item> </second> </item> <item> <first>239</first> <second> <count>1</count> <item_version>0</item_version> <item>66</item> </second> </item> <item> <first>246</first> <second> <count>4</count> <item_version>0</item_version> <item>67</item> <item>67</item> <item>67</item> <item>67</item> </second> </item> <item> <first>251</first> <second> <count>4</count> <item_version>0</item_version> <item>68</item> <item>68</item> <item>68</item> <item>68</item> </second> </item> <item> <first>256</first> <second> <count>4</count> <item_version>0</item_version> <item>69</item> <item>69</item> <item>69</item> <item>69</item> </second> </item> <item> <first>265</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>276</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>287</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>294</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>298</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>302</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>307</first> <second> <count>1</count> <item_version>0</item_version> <item>44</item> </second> </item> <item> <first>313</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>319</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>324</first> <second> <count>1</count> <item_version>0</item_version> <item>51</item> </second> </item> <item> <first>332</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>340</first> <second> <count>1</count> <item_version>0</item_version> <item>53</item> </second> </item> <item> <first>344</first> <second> <count>1</count> <item_version>0</item_version> <item>55</item> </second> </item> <item> <first>348</first> <second> <count>1</count> <item_version>0</item_version> <item>54</item> </second> </item> <item> <first>355</first> <second> <count>1</count> <item_version>0</item_version> <item>56</item> </second> </item> <item> <first>362</first> <second> <count>1</count> <item_version>0</item_version> <item>57</item> </second> </item> <item> <first>368</first> <second> <count>1</count> <item_version>0</item_version> <item>61</item> </second> </item> <item> <first>371</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>377</first> <second> <count>1</count> <item_version>0</item_version> <item>123</item> </second> </item> <item> <first>382</first> <second> <count>1</count> <item_version>0</item_version> <item>63</item> </second> </item> <item> <first>388</first> <second> <count>1</count> <item_version>0</item_version> <item>73</item> </second> </item> <item> <first>396</first> <second> <count>1</count> <item_version>0</item_version> <item>74</item> </second> </item> <item> <first>400</first> <second> <count>1</count> <item_version>0</item_version> <item>81</item> </second> </item> <item> <first>406</first> <second> <count>1</count> <item_version>0</item_version> <item>70</item> </second> </item> <item> <first>409</first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>416</first> <second> <count>1</count> <item_version>0</item_version> <item>72</item> </second> </item> <item> <first>420</first> <second> <count>1</count> <item_version>0</item_version> <item>76</item> </second> </item> <item> <first>423</first> <second> <count>1</count> <item_version>0</item_version> <item>77</item> </second> </item> <item> <first>430</first> <second> <count>1</count> <item_version>0</item_version> <item>78</item> </second> </item> <item> <first>434</first> <second> <count>1</count> <item_version>0</item_version> <item>79</item> </second> </item> <item> <first>437</first> <second> <count>1</count> <item_version>0</item_version> <item>82</item> </second> </item> <item> <first>440</first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>446</first> <second> <count>1</count> <item_version>0</item_version> <item>84</item> </second> </item> <item> <first>450</first> <second> <count>1</count> <item_version>0</item_version> <item>85</item> </second> </item> <item> <first>456</first> <second> <count>1</count> <item_version>0</item_version> <item>87</item> </second> </item> <item> <first>459</first> <second> <count>1</count> <item_version>0</item_version> <item>88</item> </second> </item> <item> <first>465</first> <second> <count>1</count> <item_version>0</item_version> <item>89</item> </second> </item> <item> <first>475</first> <second> <count>1</count> <item_version>0</item_version> <item>93</item> </second> </item> <item> <first>482</first> <second> <count>1</count> <item_version>0</item_version> <item>94</item> </second> </item> <item> <first>486</first> <second> <count>1</count> <item_version>0</item_version> <item>95</item> </second> </item> <item> <first>493</first> <second> <count>1</count> <item_version>0</item_version> <item>96</item> </second> </item> <item> <first>497</first> <second> <count>1</count> <item_version>0</item_version> <item>97</item> </second> </item> <item> <first>501</first> <second> <count>1</count> <item_version>0</item_version> <item>98</item> </second> </item> <item> <first>507</first> <second> <count>1</count> <item_version>0</item_version> <item>100</item> </second> </item> <item> <first>510</first> <second> <count>1</count> <item_version>0</item_version> <item>101</item> </second> </item> <item> <first>516</first> <second> <count>1</count> <item_version>0</item_version> <item>107</item> </second> </item> <item> <first>522</first> <second> <count>1</count> <item_version>0</item_version> <item>108</item> </second> </item> <item> <first>526</first> <second> <count>1</count> <item_version>0</item_version> <item>109</item> </second> </item> <item> <first>533</first> <second> <count>1</count> <item_version>0</item_version> <item>110</item> </second> </item> <item> <first>537</first> <second> <count>1</count> <item_version>0</item_version> <item>111</item> </second> </item> <item> <first>543</first> <second> <count>1</count> <item_version>0</item_version> <item>75</item> </second> </item> <item> <first>546</first> <second> <count>1</count> <item_version>0</item_version> <item>103</item> </second> </item> <item> <first>555</first> <second> <count>1</count> <item_version>0</item_version> <item>112</item> </second> </item> <item> <first>558</first> <second> <count>1</count> <item_version>0</item_version> <item>114</item> </second> </item> <item> <first>561</first> <second> <count>1</count> <item_version>0</item_version> <item>115</item> </second> </item> <item> <first>567</first> <second> <count>1</count> <item_version>0</item_version> <item>117</item> </second> </item> <item> <first>576</first> <second> <count>1</count> <item_version>0</item_version> <item>90</item> </second> </item> <item> <first>582</first> <second> <count>1</count> <item_version>0</item_version> <item>104</item> </second> </item> <item> <first>588</first> <second> <count>1</count> <item_version>0</item_version> <item>118</item> </second> </item> <item> <first>594</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>600</first> <second> <count>2</count> <item_version>0</item_version> <item>80</item> <item>86</item> </second> </item> <item> <first>609</first> <second> <count>2</count> <item_version>0</item_version> <item>91</item> <item>99</item> </second> </item> <item> <first>618</first> <second> <count>2</count> <item_version>0</item_version> <item>105</item> <item>113</item> </second> </item> <item> <first>626</first> <second> <count>2</count> <item_version>0</item_version> <item>92</item> <item>102</item> </second> </item> <item> <first>634</first> <second> <count>2</count> <item_version>0</item_version> <item>106</item> <item>116</item> </second> </item> </dp_fu_nodes> <dp_fu_nodes_expression class_id="54" tracking_level="0" version="0"> <count>68</count> <item_version>0</item_version> <item class_id="55" tracking_level="0" version="0"> <first>U_fu_582</first> <second> <count>1</count> <item_version>0</item_version> <item>104</item> </second> </item> <item> <first>V_fu_588</first> <second> <count>1</count> <item_version>0</item_version> <item>118</item> </second> </item> <item> <first>Y_fu_576</first> <second> <count>1</count> <item_version>0</item_version> <item>90</item> </second> </item> <item> <first>bound_fu_594</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>cast1_fu_298</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>cast_fu_294</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>exitcond_flatten_fu_302</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>exitcond_i_i_fu_319</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>grp_fu_600</first> <second> <count>2</count> <item_version>0</item_version> <item>80</item> <item>86</item> </second> </item> <item> <first>grp_fu_609</first> <second> <count>2</count> <item_version>0</item_version> <item>91</item> <item>99</item> </second> </item> <item> <first>grp_fu_618</first> <second> <count>2</count> <item_version>0</item_version> <item>105</item> <item>113</item> </second> </item> <item> <first>grp_fu_626</first> <second> <count>2</count> <item_version>0</item_version> <item>92</item> <item>102</item> </second> </item> <item> <first>grp_fu_634</first> <second> <count>2</count> <item_version>0</item_version> <item>106</item> <item>116</item> </second> </item> <item> <first>in_channels_ch1_addr_gep_fu_225</first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> <item> <first>in_channels_ch2_addr_gep_fu_232</first> <second> <count>1</count> <item_version>0</item_version> <item>65</item> </second> </item> <item> <first>in_channels_ch3_addr_gep_fu_239</first> <second> <count>1</count> <item_version>0</item_version> <item>66</item> </second> </item> <item> <first>indvar_flatten_next_fu_307</first> <second> <count>1</count> <item_version>0</item_version> <item>44</item> </second> </item> <item> <first>indvar_flatten_phi_fu_265</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>p_neg_cast_i_i_fu_522</first> <second> <count>1</count> <item_version>0</item_version> <item>108</item> </second> </item> <item> <first>p_neg_i_i_fu_516</first> <second> <count>1</count> <item_version>0</item_version> <item>107</item> </second> </item> <item> <first>p_shl1_cast_fu_355</first> <second> <count>1</count> <item_version>0</item_version> <item>56</item> </second> </item> <item> <first>p_shl1_cast_i_i_fu_533</first> <second> <count>1</count> <item_version>0</item_version> <item>110</item> </second> </item> <item> <first>p_shl1_i_i_fu_526</first> <second> <count>1</count> <item_version>0</item_version> <item>109</item> </second> </item> <item> <first>p_shl2_cast_i_i_fu_482</first> <second> <count>1</count> <item_version>0</item_version> <item>94</item> </second> </item> <item> <first>p_shl2_i_i_fu_475</first> <second> <count>1</count> <item_version>0</item_version> <item>93</item> </second> </item> <item> <first>p_shl3_cast7_i_i_fu_493</first> <second> <count>1</count> <item_version>0</item_version> <item>96</item> </second> </item> <item> <first>p_shl3_cast_i_i_fu_497</first> <second> <count>1</count> <item_version>0</item_version> <item>97</item> </second> </item> <item> <first>p_shl3_i_i_fu_486</first> <second> <count>1</count> <item_version>0</item_version> <item>95</item> </second> </item> <item> <first>p_shl4_cast_i_i_fu_430</first> <second> <count>1</count> <item_version>0</item_version> <item>78</item> </second> </item> <item> <first>p_shl4_i_i_fu_423</first> <second> <count>1</count> <item_version>0</item_version> <item>77</item> </second> </item> <item> <first>p_shl5_cast_i_i_fu_416</first> <second> <count>1</count> <item_version>0</item_version> <item>72</item> </second> </item> <item> <first>p_shl5_i_i_fu_409</first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>p_shl6_cast_i_i_cast_fu_396</first> <second> <count>1</count> <item_version>0</item_version> <item>74</item> </second> </item> <item> <first>p_shl6_i_i_fu_388</first> <second> <count>1</count> <item_version>0</item_version> <item>73</item> </second> </item> <item> <first>p_shl_cast_fu_348</first> <second> <count>1</count> <item_version>0</item_version> <item>54</item> </second> </item> <item> <first>tmp1_fu_450</first> <second> <count>1</count> <item_version>0</item_version> <item>85</item> </second> </item> <item> <first>tmp2_cast_fu_456</first> <second> <count>1</count> <item_version>0</item_version> <item>87</item> </second> </item> <item> <first>tmp3_fu_510</first> <second> <count>1</count> <item_version>0</item_version> <item>101</item> </second> </item> <item> <first>tmp4_fu_561</first> <second> <count>1</count> <item_version>0</item_version> <item>115</item> </second> </item> <item> <first>tmp_22_fu_340</first> <second> <count>1</count> <item_version>0</item_version> <item>53</item> </second> </item> <item> <first>tmp_23_fu_344</first> <second> <count>1</count> <item_version>0</item_version> <item>55</item> </second> </item> <item> <first>tmp_24_fu_371</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>tmp_26_cast_fu_382</first> <second> <count>1</count> <item_version>0</item_version> <item>63</item> </second> </item> <item> <first>tmp_40_cast14_i_i_fu_406</first> <second> <count>1</count> <item_version>0</item_version> <item>70</item> </second> </item> <item> <first>tmp_42_cast11_i_i_ca_fu_420</first> <second> <count>1</count> <item_version>0</item_version> <item>76</item> </second> </item> <item> <first>tmp_42_cast11_i_i_fu_543</first> <second> <count>1</count> <item_version>0</item_version> <item>75</item> </second> </item> <item> <first>tmp_44_cast10_i_i_fu_434</first> <second> <count>1</count> <item_version>0</item_version> <item>79</item> </second> </item> <item> <first>tmp_46_cast_i_i_fu_446</first> <second> <count>1</count> <item_version>0</item_version> <item>84</item> </second> </item> <item> <first>tmp_46_i_i_fu_440</first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>tmp_48_i_i_fu_459</first> <second> <count>1</count> <item_version>0</item_version> <item>88</item> </second> </item> <item> <first>tmp_50_i_i_fu_465</first> <second> <count>1</count> <item_version>0</item_version> <item>89</item> </second> </item> <item> <first>tmp_53_i_i_fu_501</first> <second> <count>1</count> <item_version>0</item_version> <item>98</item> </second> </item> <item> <first>tmp_54_cast_i_i_fu_507</first> <second> <count>1</count> <item_version>0</item_version> <item>100</item> </second> </item> <item> <first>tmp_58_i_i_fu_546</first> <second> <count>1</count> <item_version>0</item_version> <item>103</item> </second> </item> <item> <first>tmp_61_cast_i_i_fu_555</first> <second> <count>1</count> <item_version>0</item_version> <item>112</item> </second> </item> <item> <first>tmp_61_i_i_fu_537</first> <second> <count>1</count> <item_version>0</item_version> <item>111</item> </second> </item> <item> <first>tmp_62_cast_i_i_fu_558</first> <second> <count>1</count> <item_version>0</item_version> <item>114</item> </second> </item> <item> <first>tmp_66_i_i_fu_567</first> <second> <count>1</count> <item_version>0</item_version> <item>117</item> </second> </item> <item> <first>tmp_cast_fu_437</first> <second> <count>1</count> <item_version>0</item_version> <item>82</item> </second> </item> <item> <first>tmp_fu_400</first> <second> <count>1</count> <item_version>0</item_version> <item>81</item> </second> </item> <item> <first>tmp_i_i_cast_fu_368</first> <second> <count>1</count> <item_version>0</item_version> <item>61</item> </second> </item> <item> <first>tmp_i_i_mid2_v_fu_332</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>tmp_s_fu_362</first> <second> <count>1</count> <item_version>0</item_version> <item>57</item> </second> </item> <item> <first>x_fu_313</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>x_i_i_phi_fu_276</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>y_fu_377</first> <second> <count>1</count> <item_version>0</item_version> <item>123</item> </second> </item> <item> <first>y_i_i_mid2_fu_324</first> <second> <count>1</count> <item_version>0</item_version> <item>51</item> </second> </item> <item> <first>y_i_i_phi_fu_287</first> <second> <count>1</count> <item_version>0</item_version> <item>42</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>13</count> <item_version>0</item_version> <item> <first>StgValue_122_write_fu_204</first> <second> <count>1</count> <item_version>0</item_version> <item>119</item> </second> </item> <item> <first>StgValue_123_write_fu_211</first> <second> <count>1</count> <item_version>0</item_version> <item>120</item> </second> </item> <item> <first>StgValue_124_write_fu_218</first> <second> <count>1</count> <item_version>0</item_version> <item>121</item> </second> </item> <item> <first>StgValue_21_write_fu_152</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>StgValue_23_write_fu_160</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>StgValue_25_write_fu_168</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>StgValue_28_write_fu_188</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>StgValue_29_write_fu_196</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>U_scale_read_read_fu_140</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>V_scale_read_read_fu_134</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>Y_scale_read_read_fu_146</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>height_read_fu_182</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>width_read_fu_176</first> <second> <count>1</count> <item_version>0</item_version> <item>31</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>3</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>in_channels_ch1</first> <second>0</second> </first> <second> <count>4</count> <item_version>0</item_version> <item>67</item> <item>67</item> <item>67</item> <item>67</item> </second> </item> <item> <first> <first>in_channels_ch2</first> <second>0</second> </first> <second> <count>4</count> <item_version>0</item_version> <item>68</item> <item>68</item> <item>68</item> <item>68</item> </second> </item> <item> <first> <first>in_channels_ch3</first> <second>0</second> </first> <second> <count>4</count> <item_version>0</item_version> <item>69</item> <item>69</item> <item>69</item> <item>69</item> </second> </item> </dp_mem_port_nodes> <dp_reg_nodes> <count>26</count> <item_version>0</item_version> <item> <first>261</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>272</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>283</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>643</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>648</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>653</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>657</first> <second> <count>1</count> <item_version>0</item_version> <item>44</item> </second> </item> <item> <first>662</first> <second> <count>1</count> <item_version>0</item_version> <item>51</item> </second> </item> <item> <first>668</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>673</first> <second> <count>1</count> <item_version>0</item_version> <item>53</item> </second> </item> <item> <first>678</first> <second> <count>1</count> <item_version>0</item_version> <item>55</item> </second> </item> <item> <first>683</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>688</first> <second> <count>1</count> <item_version>0</item_version> <item>123</item> </second> </item> <item> <first>693</first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> <item> <first>698</first> <second> <count>1</count> <item_version>0</item_version> <item>65</item> </second> </item> <item> <first>703</first> <second> <count>1</count> <item_version>0</item_version> <item>66</item> </second> </item> <item> <first>708</first> <second> <count>1</count> <item_version>0</item_version> <item>67</item> </second> </item> <item> <first>714</first> <second> <count>1</count> <item_version>0</item_version> <item>68</item> </second> </item> <item> <first>721</first> <second> <count>1</count> <item_version>0</item_version> <item>69</item> </second> </item> <item> <first>729</first> <second> <count>1</count> <item_version>0</item_version> <item>81</item> </second> </item> <item> <first>734</first> <second> <count>1</count> <item_version>0</item_version> <item>89</item> </second> </item> <item> <first>739</first> <second> <count>1</count> <item_version>0</item_version> <item>101</item> </second> </item> <item> <first>744</first> <second> <count>1</count> <item_version>0</item_version> <item>111</item> </second> </item> <item> <first>749</first> <second> <count>1</count> <item_version>0</item_version> <item>113</item> </second> </item> <item> <first>754</first> <second> <count>1</count> <item_version>0</item_version> <item>103</item> </second> </item> <item> <first>759</first> <second> <count>1</count> <item_version>0</item_version> <item>117</item> </second> </item> </dp_reg_nodes> <dp_regname_nodes> <count>26</count> <item_version>0</item_version> <item> <first>B_reg_721</first> <second> <count>1</count> <item_version>0</item_version> <item>69</item> </second> </item> <item> <first>G_reg_714</first> <second> <count>1</count> <item_version>0</item_version> <item>68</item> </second> </item> <item> <first>R_reg_708</first> <second> <count>1</count> <item_version>0</item_version> <item>67</item> </second> </item> <item> <first>bound_reg_648</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>exitcond_flatten_reg_653</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>height_reg_643</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>in_channels_ch1_addr_reg_693</first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> <item> <first>in_channels_ch2_addr_reg_698</first> <second> <count>1</count> <item_version>0</item_version> <item>65</item> </second> </item> <item> <first>in_channels_ch3_addr_reg_703</first> <second> <count>1</count> <item_version>0</item_version> <item>66</item> </second> </item> <item> <first>indvar_flatten_next_reg_657</first> <second> <count>1</count> <item_version>0</item_version> <item>44</item> </second> </item> <item> <first>indvar_flatten_reg_261</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>tmp3_reg_739</first> <second> <count>1</count> <item_version>0</item_version> <item>101</item> </second> </item> <item> <first>tmp_22_reg_673</first> <second> <count>1</count> <item_version>0</item_version> <item>53</item> </second> </item> <item> <first>tmp_23_reg_678</first> <second> <count>1</count> <item_version>0</item_version> <item>55</item> </second> </item> <item> <first>tmp_24_reg_683</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>tmp_50_i_i_reg_734</first> <second> <count>1</count> <item_version>0</item_version> <item>89</item> </second> </item> <item> <first>tmp_58_i_i_reg_754</first> <second> <count>1</count> <item_version>0</item_version> <item>103</item> </second> </item> <item> <first>tmp_61_i_i_reg_744</first> <second> <count>1</count> <item_version>0</item_version> <item>111</item> </second> </item> <item> <first>tmp_62_i_i_reg_749</first> <second> <count>1</count> <item_version>0</item_version> <item>113</item> </second> </item> <item> <first>tmp_66_i_i_reg_759</first> <second> <count>1</count> <item_version>0</item_version> <item>117</item> </second> </item> <item> <first>tmp_i_i_mid2_v_reg_668</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>tmp_reg_729</first> <second> <count>1</count> <item_version>0</item_version> <item>81</item> </second> </item> <item> <first>x_i_i_reg_272</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>y_i_i_mid2_reg_662</first> <second> <count>1</count> <item_version>0</item_version> <item>51</item> </second> </item> <item> <first>y_i_i_reg_283</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>y_reg_688</first> <second> <count>1</count> <item_version>0</item_version> <item>123</item> </second> </item> </dp_regname_nodes> <dp_reg_phi> <count>3</count> <item_version>0</item_version> <item> <first>261</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>272</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>283</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> </dp_reg_phi> <dp_regname_phi> <count>3</count> <item_version>0</item_version> <item> <first>indvar_flatten_reg_261</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>x_i_i_reg_272</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>y_i_i_reg_283</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> </dp_regname_phi> <dp_port_io_nodes class_id="59" tracking_level="0" version="0"> <count>16</count> <item_version>0</item_version> <item class_id="60" tracking_level="0" version="0"> <first>U_scale</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> </second> </item> <item> <first>U_scale_out</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> </second> </item> <item> <first>V_scale</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> </second> </item> <item> <first>V_scale_out</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> </second> </item> <item> <first>Y_scale</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>Y_scale_out</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> </second> </item> <item> <first>in_channels_ch1(p0)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>load</first> <second> <count>4</count> <item_version>0</item_version> <item>67</item> <item>67</item> <item>67</item> <item>67</item> </second> </item> </second> </item> <item> <first>in_channels_ch2(p0)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>load</first> <second> <count>4</count> <item_version>0</item_version> <item>68</item> <item>68</item> <item>68</item> <item>68</item> </second> </item> </second> </item> <item> <first>in_channels_ch3(p0)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>load</first> <second> <count>4</count> <item_version>0</item_version> <item>69</item> <item>69</item> <item>69</item> <item>69</item> </second> </item> </second> </item> <item> <first>in_height</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> </second> </item> <item> <first>in_width</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>31</item> </second> </item> </second> </item> <item> <first>out_channels_ch1</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>1</count> <item_version>0</item_version> <item>119</item> </second> </item> </second> </item> <item> <first>out_channels_ch2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>1</count> <item_version>0</item_version> <item>120</item> </second> </item> </second> </item> <item> <first>out_channels_ch3</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>1</count> <item_version>0</item_version> <item>121</item> </second> </item> </second> </item> <item> <first>out_height</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> </second> </item> <item> <first>out_width</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> </second> </item> </dp_port_io_nodes> <port2core class_id="61" tracking_level="0" version="0"> <count>11</count> <item_version>0</item_version> <item class_id="62" tracking_level="0" version="0"> <first>1</first> <second>RAM</second> </item> <item> <first>2</first> <second>RAM</second> </item> <item> <first>3</first> <second>RAM</second> </item> <item> <first>6</first> <second>FIFO_LUTRAM</second> </item> <item> <first>7</first> <second>FIFO_LUTRAM</second> </item> <item> <first>8</first> <second>FIFO_LUTRAM</second> </item> <item> <first>9</first> <second>FIFO_LUTRAM</second> </item> <item> <first>10</first> <second>FIFO_LUTRAM</second> </item> <item> <first>14</first> <second>FIFO_LUTRAM</second> </item> <item> <first>15</first> <second>FIFO_LUTRAM</second> </item> <item> <first>16</first> <second>FIFO_LUTRAM</second> </item> </port2core> <node2core> <count>0</count> <item_version>0</item_version> </node2core> </syndb> </boost_serialization>

30.144558

86

0.433726

419a2608eb96774359fbaf78330b290ebe360f3d

976

ads

Ada

regtests/secret-testsuite.ads

stcarrez/ada-libsecret

68be85771a11f6fa0236104999855d09daf68b89

[ "Apache-2.0" ]

2

2017-06-23T21:23:54.000Z

2019-02-09T22:21:59.000Z

regtests/secret-testsuite.ads

stcarrez/ada-libsecret

68be85771a11f6fa0236104999855d09daf68b89

[ "Apache-2.0" ]

null

regtests/secret-testsuite.ads

stcarrez/ada-libsecret

68be85771a11f6fa0236104999855d09daf68b89

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- secret-testsuite - Secret Test suite -- 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 Util.Tests; package Secret.Testsuite is function Suite return Util.Tests.Access_Test_Suite; end Secret.Testsuite;

37.538462

76

0.634221

59528d5c0b5434e4613f403844f04cb7f4d907d6

6,147

ads

Ada

src/lv-objx-tabview.ads

Fabien-Chouteau/ada-lvlg

ccf8da85aeafa38f4ae669b61298237424dc7e55

[ "MIT" ]

3

2019-01-02T18:34:22.000Z

2019-04-27T15:27:07.000Z

src/lv-objx-tabview.ads

Fabien-Chouteau/ada-lvlg

ccf8da85aeafa38f4ae669b61298237424dc7e55

[ "MIT" ]

2

2019-12-19T20:52:56.000Z

2020-01-25T21:22:53.000Z

src/lv-objx-tabview.ads

Fabien-Chouteau/ada-lvgl

ccf8da85aeafa38f4ae669b61298237424dc7e55

[ "MIT" ]

null

with Lv.Style; with Lv.Objx.Page; package Lv.Objx.Tabview is subtype Instance is Obj_T; type Action_T is access function (Self : access Instance; Tab_Id : Uint16_T) return Res_T; pragma Convention (C, Action_T); type Btns_Pos_T is (Pos_Top, Pos_Bottom); type Style_T is (Style_Bg, Style_Indic, Style_Btn_Bg, Style_Btn_Rel, Style_Btn_Pr, Style_Btn_Tgl_Rel, Style_Btn_Tgl_Pr); -- Create a Tab view object -- @param par pointer to an object, it will be the parent of the new tab -- @param copy pointer to a tab object, if not NULL then the new object will be copied from it -- @return pointer to the created tab function Create (Par : Obj_T; Copy : Instance) return Instance; -- Delete all children of the scrl object, without deleting scrl child. -- @param self pointer to an object procedure Clean (Self : Instance); -- Add a new tab with the given name -- @param self pointer to Tab view object where to ass the new tab -- @param name the text on the tab button -- @return pointer to the created page object (lv_page). You can create your content here function Add_Tab (Self : Instance; Name : C_String_Ptr) return Lv.Objx.Page.Instance; ---------------------- -- Setter functions -- ---------------------- -- Set a new tab -- @param self pointer to Tab view object -- @param id index of a tab to load -- @param anim_en true: set with sliding animation; false: set immediately procedure Set_Tab_Act (Self : Instance; Id : Uint16_T; Anim_En : U_Bool); -- Set an action to call when a tab is loaded (Good to create content only if required) -- lv_tabview_get_act() still gives the current (old) tab (to remove content from here) -- @param self pointer to a tabview object -- @param action pointer to a function to call when a tab is loaded procedure Set_Tab_Load_Action (Self : Instance; Action : Action_T); -- Enable horizontal sliding with touch pad -- @param self pointer to Tab view object -- @param en true: enable sliding; false: disable sliding procedure Set_Sliding (Self : Instance; En : U_Bool); -- Set the animation time of tab view when a new tab is loaded -- @param self pointer to Tab view object -- @param anim_time time of animation in milliseconds procedure Set_Anim_Time (Self : Instance; Anim_Time : Uint16_T); -- Set the style of a tab view -- @param self pointer to a tan view object -- @param type which style should be set -- @param style pointer to the new style procedure Set_Style (Self : Instance; Typ : Style_T; Style : access Lv.Style.Style); -- Set the position of tab select buttons -- @param self pointer to a tan view object -- @param btns_pos which button position procedure Set_Btns_Pos (Self : Instance; Btns_Pos : Btns_Pos_T); ---------------------- -- Getter functions -- ---------------------- -- Get the index of the currently active tab -- @param self pointer to Tab view object -- @return the active tab index function Tab_Act (Self : Instance) return Uint16_T; -- Get the number of tabs -- @param self pointer to Tab view object -- @return tab count function Tab_Count (Self : Instance) return Uint16_T; -- Get the page (content area) of a tab -- @param self pointer to Tab view object -- @param id index of the tab (>= 0) -- @return pointer to page (lv_page) object function Tab (Self : Instance; Id : Uint16_T) return Lv.Objx.Page.Instance; -- Get the tab load action -- @param self pointer to a tabview object -- @param return the current tab load action function Tab_Load_Action (Self : Instance) return Action_T; -- Get horizontal sliding is enabled or not -- @param self pointer to Tab view object -- @return true: enable sliding; false: disable sliding function Sliding (Self : Instance) return U_Bool; -- Get the animation time of tab view when a new tab is loaded -- @param self pointer to Tab view object -- @return time of animation in milliseconds function Anim_Time (Self : Instance) return Uint16_T; -- Get a style of a tab view -- @param self pointer to a ab view object -- @param type which style should be get -- @return style pointer to a style function Style (Self : Instance; Style_Type : Style_T) return access Lv.Style.Style; -- Get position of tab select buttons -- @param self pointer to a ab view object function Btns_Pos (Self : Instance) return Btns_Pos_T; ------------- -- Imports -- ------------- pragma Import (C, Create, "lv_tabview_create"); pragma Import (C, Clean, "lv_tabview_clean"); pragma Import (C, Add_Tab, "lv_tabview_add_tab"); pragma Import (C, Set_Tab_Act, "lv_tabview_set_tab_act"); pragma Import (C, Set_Tab_Load_Action, "lv_tabview_set_tab_load_action"); pragma Import (C, Set_Sliding, "lv_tabview_set_sliding"); pragma Import (C, Set_Anim_Time, "lv_tabview_set_anim_time"); pragma Import (C, Set_Style, "lv_tabview_set_style"); pragma Import (C, Set_Btns_Pos, "lv_tabview_set_btns_pos"); pragma Import (C, Tab_Act, "lv_tabview_get_tab_act"); pragma Import (C, Tab_Count, "lv_tabview_get_tab_count"); pragma Import (C, Tab, "lv_tabview_get_tab"); pragma Import (C, Tab_Load_Action, "lv_tabview_get_tab_load_action"); pragma Import (C, Sliding, "lv_tabview_get_sliding"); pragma Import (C, Anim_Time, "lv_tabview_get_anim_time"); pragma Import (C, Style, "lv_tabview_get_style"); pragma Import (C, Btns_Pos, "lv_tabview_get_btns_pos"); for Btns_Pos_T'Size use 8; for Btns_Pos_T use (Pos_Top => 0, Pos_Bottom => 1); for Style_T'Size use 8; for Style_T use (Style_Bg => 0, Style_Indic => 1, Style_Btn_Bg => 2, Style_Btn_Rel => 3, Style_Btn_Pr => 4, Style_Btn_Tgl_Rel => 5, Style_Btn_Tgl_Pr => 6); end Lv.Objx.Tabview;

36.158824

98

0.661298

2965984410d3b115747df42b56ec5fefe9625b9c

102

ada

Ada

Task/Bitmap-Midpoint-circle-algorithm/Ada/bitmap-midpoint-circle-algorithm-2.ada

mullikine/RosettaCodeData

4f0027c6ce83daa36118ee8b67915a13cd23ab67

[ "Info-ZIP" ]

1

2018-11-09T22:08:38.000Z

Task/Bitmap-Midpoint-circle-algorithm/Ada/bitmap-midpoint-circle-algorithm-2.ada

mullikine/RosettaCodeData

4f0027c6ce83daa36118ee8b67915a13cd23ab67

[ "Info-ZIP" ]

null

Task/Bitmap-Midpoint-circle-algorithm/Ada/bitmap-midpoint-circle-algorithm-2.ada

mullikine/RosettaCodeData

4f0027c6ce83daa36118ee8b67915a13cd23ab67

[ "Info-ZIP" ]

1

2018-11-09T22:08:40.000Z

X : Image (1..16, 1..16); begin Fill (X, White); Circle (X, (8, 8), 5, Black); Print (X);

17

32

0.470588

3dd22b631309c284f4ba31a95e527d1903c75290

2,798

adb

Ada

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

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

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

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

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

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . R A N D O M _ S E E D -- -- -- -- B o d y -- -- -- -- Copyright (C) 2011-2021, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- -- -- -- -- -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- Version used on bare board platforms with Ada.Real_Time; use Ada.Real_Time; with Ada.Unchecked_Conversion; package body System.Random_Seed is function To_U64 is new Ada.Unchecked_Conversion (Time, Interfaces.Unsigned_64); -------------- -- Get_Seed -- -------------- function Get_Seed return Interfaces.Unsigned_64 is begin return To_U64 (Clock); end Get_Seed; end System.Random_Seed;

53.807692

78

0.355254

ad98c5b09dd84fbc358f520f438329378b5333ca

59

adb

Ada

tests/linkedlist/src/main.adb

TUM-EI-RCS/StratoX

5fdd04e01a25efef6052376f43ce85b5bc973392

[ "BSD-3-Clause" ]

12

2017-06-08T14:19:57.000Z

2022-03-09T02:48:59.000Z

tests/linkedlist/src/main.adb

TUM-EI-RCS/StratoX

5fdd04e01a25efef6052376f43ce85b5bc973392

[ "BSD-3-Clause" ]

6

2017-06-08T13:13:50.000Z

2020-05-15T09:32:43.000Z

tests/linkedlist/src/main.adb

TUM-EI-RCS/StratoX

5fdd04e01a25efef6052376f43ce85b5bc973392

[ "BSD-3-Clause" ]

3

2017-06-30T14:05:06.000Z

2022-02-17T12:20:45.000Z

with Wrap; procedure main is begin Wrap.foo; end main;

8.428571

17

0.711864

1ab7ca5d1e6c0e74c12d7378346d93f67416909f

662

ada

Ada

examples/Ada/peering3.ada

dcramer/zguide

a07fe97c4c597e6401b4281ae07c3a156590f4c6

[ "Zed", "X11", "MIT" ]

2

2015-09-24T19:53:04.000Z

2015-11-06T10:22:53.000Z

examples/Ada/peering3.ada

gaubert/zguide

e24c02481c47b129a37f261d1109140572f255f4

[ "Zed", "X11", "MIT" ]

null

examples/Ada/peering3.ada

gaubert/zguide

e24c02481c47b129a37f261d1109140572f255f4

[ "Zed", "X11", "MIT" ]

null

No-one has translated the peering3 example into Ada yet. Be the first to create peering3 in Ada and get one free Internet! If you're the author of the Ada binding, this is a great way to get people to use 0MQ in Ada. To submit a new translation email it to [email protected]. Please: * Stick to identical functionality and naming used in examples so that readers can easily compare languages. * You MUST place your name as author in the examples so readers can contact you. * You MUST state in the email that you license your code under the MIT/X11 license. Subscribe to the email list at http://lists.zeromq.org/mailman/listinfo/zeromq-dev.

47.285714

83

0.776435

c7bd592d6f6c0f84d4e69cd1a54d325bde501a1f

3,276

ada

Ada

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- C45624B.ADA -- Grant of Unlimited Rights -- -- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687, -- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained -- unlimited rights in the software and documentation contained herein. -- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making -- this public release, the Government intends to confer upon all -- recipients unlimited rights equal to those held by the Government. -- These rights include rights to use, duplicate, release or disclose the -- released technical data and computer software in whole or in part, in -- any manner and for any purpose whatsoever, and to have or permit others -- to do so. -- -- DISCLAIMER -- -- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR -- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED -- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE -- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE -- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A -- PARTICULAR PURPOSE OF SAID MATERIAL. --* -- OBJECTIVE: -- FOR FLOATING POINT TYPES, CHECK THAT -- CONSTRAINT_ERROR IS RAISED IF THE RESULT OF A FLOATING POINT -- EXPONENTIATION IS OUTSIDE THE RANGE OF THE BASE TYPE AND -- MACHINE_OVERFLOWS IS FALSE. THIS TESTS DIGITS 6. -- *** NOTE: This test has been modified since ACVC version 1.11 to -- 9X -- *** remove incompatibilities associated with the transition -- 9X -- *** to Ada 9X. -- 9X -- *** -- 9X -- HISTORY: -- BCB 07/14/88 CREATED ORIGINAL TEST. -- MRM 03/30/93 REMOVED NUMERIC_ERROR FOR 9X COMPATIBILITY WITH REPORT; USE REPORT; PROCEDURE C45624B IS TYPE FLT IS DIGITS 6; F : FLT; FUNCTION EQUAL_FLT (ONE, TWO : FLT) RETURN BOOLEAN IS BEGIN RETURN ONE = TWO * FLT (IDENT_INT(1)); END EQUAL_FLT; BEGIN TEST ("C45624B", "FOR FLOATING POINT TYPES, CHECK THAT " & "CONSTRAINT_ERROR IS RAISED " & "IF MACHINE_OVERFLOWS IS FALSE. THIS TESTS " & "DIGITS 6"); IF FLT'MACHINE_OVERFLOWS THEN NOT_APPLICABLE ("THIS TEST IS NOT APPLICABLE DUE TO " & "MACHINE_OVERFLOWS BEING TRUE"); ELSE BEGIN F := FLT'BASE'LAST**IDENT_INT (2); COMMENT ("CONSTRAINT_ERROR WAS NOT RAISED WHEN " & "MACHINE_OVERFLOWS WAS FALSE"); IF NOT EQUAL_FLT(F,F**IDENT_INT(1)) THEN COMMENT ("DON'T OPTIMIZE F"); END IF; EXCEPTION WHEN CONSTRAINT_ERROR => COMMENT ("CONSTRAINT_ERROR WAS RAISED WHEN " & "MACHINE_OVERFLOWS WAS FALSE"); WHEN OTHERS => FAILED ("AN EXCEPTION OTHER THAN CONSTRAINT_ERROR " & "WAS RAISED"); END; END IF; RESULT; END C45624B;

39.95122

79

0.578755

ad6d36c712f9a6b4f3d83416b54ca7e9b25eb069

4,154

adb

Ada

testsuite/league/TN-492/test_492.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

testsuite/league/TN-492/test_492.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

testsuite/league/TN-492/test_492.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 -- -- -- -- Testsuite Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2018, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ -- This test checks encoding of an emoji character in UTF-8. ------------------------------------------------------------------------------ with Ada.Streams; with League.Strings; with League.Text_Codecs; procedure Text_492 is use type Ada.Streams.Stream_Element_Array; Line : constant Wide_Wide_String := (1 => Wide_Wide_Character'Val (16#1F60A#)); -- 😊 Text : constant League.Strings.Universal_String := League.Strings.To_Universal_String (Line); UTF8 : constant League.Text_Codecs.Text_Codec := League.Text_Codecs.Codec (League.Strings.To_Universal_String ("utf-8")); Raw : constant Ada.Streams.Stream_Element_Array := UTF8.Encode (Text).To_Stream_Element_Array; begin if Raw /= (16#F0#, 16#9F#, 16#98#, 16#8A#) then raise Program_Error; end if; end Text_492;

63.907692

78

0.445113

57df26e7adf603666f939c68e42339895fe3ace8

472

adb

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/volatile2.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/volatile2.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- { dg-do compile } -- { dg-options "-gnatws" } package body volatile2 is procedure Copy is R : Result; M : Integer; subtype Get_Data is Command_Data (Get, R.Data'Last); begin declare G : Get_Data; for G'Address use M'Address; begin for I in 1 .. R.Data'Last loop G.Data (I) := (Time => R.Data (I).Time); end loop; end; end; end volatile2;

20.521739

63

0.491525

59a9e25bb94471fa5fbdee78b8b69e554237cdbf

6,306

ada

Ada

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- C45532F.ADA -- Grant of Unlimited Rights -- -- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687, -- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained -- unlimited rights in the software and documentation contained herein. -- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making -- this public release, the Government intends to confer upon all -- recipients unlimited rights equal to those held by the Government. -- These rights include rights to use, duplicate, release or disclose the -- released technical data and computer software in whole or in part, in -- any manner and for any purpose whatsoever, and to have or permit others -- to do so. -- -- DISCLAIMER -- -- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR -- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED -- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE -- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE -- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A -- PARTICULAR PURPOSE OF SAID MATERIAL. --* -- OBJECTIVE: -- CHECK THAT THE OPERATOR "/" PRODUCES CORRECT RESULTS -- FOR FIXED POINT TYPES USING 3 SUBTESTS. -- THIS TEST REQUIRES MIN_WORD_LENGTH = 16. -- THIS TEST USES VALUES OF DELTA WHICH ARE LESS THAN 0.5. -- -- TEST CASES ARE: -- A) THE OPERATOR /, A, B, AND A / B ALL MODEL NUMBERS. -- B) THE OPERATOR /, A, B MODEL NUMBERS A / B NOT. -- C) THE OPERATOR /, USING NO MODEL NUMBERS. -- -- REPEAT FOR MINIMUM REQUIRED WORD LENGTHS OF 12, 16, 32 AND 48, -- WITH RANGE <, =, AND > THAN 1.0 AND -- WITH DELTA <, =, AND > THAN 1.0. -- HISTORY: -- NTW 09/08/86 CREATED ORIGINAL TEST. -- RJW 11/05/86 REVISED COMMENTS. -- DHH 10/19/87 SHORTENED LINES CONTAINING MORE THAN 72 CHARACTERS. -- RDH 04/27/90 REVISED APPLICABILITY CRITERIA. -- BCB 10/03/90 REMOVED APPLICABILITY CRITERIA AND N/A => ERROR -- LINE. CHANGED EXTENSION FROM '.DEP' TO '.ADA'. WITH REPORT; PROCEDURE C45532F IS USE REPORT; MIN_WORD_LENGTH : CONSTANT := 16; -- MUST BE EVEN & >= 6 FULL_SCALE : CONSTANT := 2 ** (MIN_WORD_LENGTH - 1); FORTH : CONSTANT := FULL_SCALE / 4; A_THIRD : CONSTANT := FULL_SCALE / 3; DEL1 : CONSTANT := 0.5 / FULL_SCALE; TYPE FX_0P5 IS DELTA DEL1 * 1 RANGE -0.5 .. 0.5 - DEL1 * 1; TYPE FX_1 IS DELTA DEL1 * 2 RANGE -1.0 .. 1.0 - DEL1 * 2; TYPE FX_2 IS DELTA DEL1 * 4 RANGE -2.0 .. 2.0 - DEL1 * 4; BEGIN TEST ("C45532F", "FIXED POINT OPERATOR ""/""" ); -------------------------------------------------- -- CASE A) THE OPERATOR /, A, B, AND A / B ALL MODEL NUMBERS. A: DECLARE A : FX_0P5 := 0.0; B : FX_1 := 0.0; RESULT_VALUE : FX_2 := 0.0; LOWEST_ACCEPTABLE_VALUE : FX_2 := FX_2 (0.5); HIGHEST_ACCEPTABLE_VALUE : FX_2 := FX_2 (0.5); BEGIN IF EQUAL (3, 3) THEN A := FX_0P5 (0.125); -- A MODEL NUMBER B := FX_1 (0.25); -- A MODEL NUMBER END IF; RESULT_VALUE := FX_2 (A / B); IF (RESULT_VALUE < LOWEST_ACCEPTABLE_VALUE) OR (RESULT_VALUE > HIGHEST_ACCEPTABLE_VALUE) THEN FAILED ("RESULT OF ""/"" OUTSIDE RESULT MODEL INTERVAL " & "WHEN A, B, AND A / B ARE ALL MODEL NUMBERS"); END IF; END A; -------------------------------------------------- -- CASE B) THE OPERATOR /, A, B MODEL NUMBERS A / B NOT. B: DECLARE A : FX_0P5 := 0.0; B : FX_0P5 := 0.0; RESULT_VALUE : FX_1 := 0.0; LOWEST_ACCEPTABLE_VALUE : FX_1 := FX_1 (2 * DEL1 * A_THIRD); HIGHEST_ACCEPTABLE_VALUE : FX_1 := FX_1 (2 * DEL1 * (A_THIRD + 1) ); BEGIN IF EQUAL (3, 3) THEN A := FX_0P5 (DEL1 * 1); -- A MODEL NUMBER B := FX_0P5 (DEL1 * 3); -- A MODEL NUMBER END IF; RESULT_VALUE := FX_1 (A / B); IF (RESULT_VALUE < LOWEST_ACCEPTABLE_VALUE) OR (RESULT_VALUE > HIGHEST_ACCEPTABLE_VALUE) THEN FAILED ("RESULT OF ""/"" OUTSIDE RESULT MODEL INTERVAL " & "WHEN A, B MODEL NUMBERS A / B NOT"); END IF; END B; -------------------------------------------------- -- CASE C) THE OPERATOR /, USING NO MODEL NUMBERS C: DECLARE A : FX_1 := 0.0; B : FX_1 := 0.0; RESULT_VALUE : FX_0P5 := 0.0; LOW_COUNT : CONSTANT := 2 * A_THIRD; -- := (2 * FULL_SCALE * (2 * FORTH + 0)) -- / (6 * FORTH + 2); HIGH_COUNT : CONSTANT := 2 * A_THIRD + 4; -- := (2 * FULL_SCALE * (2 * FORTH + 2)) -- / (6 * FORTH + 0); LOWEST_ACCEPTABLE_VALUE : FX_0P5 := FX_0P5 (DEL1 * LOW_COUNT ); HIGHEST_ACCEPTABLE_VALUE : FX_0P5 := FX_0P5 (DEL1 * HIGH_COUNT ); BEGIN IF EQUAL (3, 3) THEN -- A AND B NOT MODEL NUMBERS A := FX_1 (DEL1 * (2 * FORTH + 1)); B := FX_1 (DEL1 * (6 * FORTH + 1)); END IF; RESULT_VALUE := FX_0P5 (A / B); IF (RESULT_VALUE < LOWEST_ACCEPTABLE_VALUE) OR (RESULT_VALUE > HIGHEST_ACCEPTABLE_VALUE) THEN FAILED ("RESULT OF ""/"" OUTSIDE RESULT MODEL INTERVAL " & "WHEN USING NO MODEL NUMBERS"); END IF; END C; -------------------------------------------------- RESULT; END C45532F;

39.660377

79

0.489851

575a1c1251fa42d71d821459285cb1ed5a4ff64d

1,284

adb

Ada

out/prologin_template_intlist.adb

Melyodas/metalang

399a9f1a71402c979d7f8024d4f98f081c80e771

[ "BSD-2-Clause" ]

22

2017-04-24T10:00:45.000Z

2021-04-01T10:11:05.000Z

out/prologin_template_intlist.adb

Melyodas/metalang

399a9f1a71402c979d7f8024d4f98f081c80e771

[ "BSD-2-Clause" ]

12

2017-03-26T18:34:21.000Z

2019-03-21T19:13:03.000Z

out/prologin_template_intlist.adb

Melyodas/metalang

399a9f1a71402c979d7f8024d4f98f081c80e771

[ "BSD-2-Clause" ]

7

2017-10-14T13:33:33.000Z

2021-03-18T15:18:50.000Z

with ada.text_io, ada.Integer_text_IO, Ada.Text_IO.Text_Streams, Ada.Strings.Fixed, Interfaces.C; use ada.text_io, ada.Integer_text_IO, Ada.Strings, Ada.Strings.Fixed, Interfaces.C; procedure prologin_template_intlist is type stringptr is access all char_array; procedure PString(s : stringptr) is begin String'Write (Text_Streams.Stream (Current_Output), To_Ada(s.all)); end; procedure PInt(i : in Integer) is begin String'Write (Text_Streams.Stream (Current_Output), Trim(Integer'Image(i), Left)); end; procedure SkipSpaces is C : Character; Eol : Boolean; begin loop Look_Ahead(C, Eol); exit when Eol or C /= ' '; Get(C); end loop; end; type b is Array (Integer range <>) of Integer; type b_PTR is access b; function programme_candidat(tableau : in b_PTR; taille : in Integer) return Integer is out0 : Integer; begin out0 := 0; for i in integer range 0..taille - 1 loop out0 := out0 + tableau(i); end loop; return out0; end; taille : Integer; tableau : b_PTR; begin Get(taille); SkipSpaces; tableau := new b (0..taille - 1); for a in integer range 0..taille - 1 loop Get(tableau(a)); SkipSpaces; end loop; PInt(programme_candidat(tableau, taille)); PString(new char_array'( To_C("" & Character'Val(10)))); end;

24.226415

97

0.704829

1a80bf29a4465e04427080ce269974a47719b004

3,750

adb

Ada

courses/fundamentals_of_ada/labs/radar/030_basic_types/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/radar/030_basic_types/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/radar/030_basic_types/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 Radar_Internals; procedure Main is -- You are in charge of developping a rotating radar for the new T-1000 -- Some of the radar code is already in place, it is just missing the -- high-level interface to handle incoming objects. type Object_Status_T is (Out_Of_Range, Tracked, Cleared, Selected); -- QUESTION 1 - Part A -- -- Define a type Angle_Degrees_T that is modulo 360 type Angle_Degrees_T is mod 360; -- Define a subtype Object_Distance_Km_T as a Float with values -- between 10cm and 100km subtype Object_Distance_Km_T is Float range 0.000_01 .. 100.0; -- Define a subtype Speed_Kph_T that is a Float between 0 and 50 km/h subtype Speed_Kph_T is Float range 0.0 .. 50.0; John_Connor : Object_Status_T := Out_Of_Range; -- QUESTION 1 - Part B -- -- Set Radar_Angle to be an Angle_Degrees_T with a starting value Radar_Angle : Angle_Degrees_T := 180; -- Declare an Object_Distance_Km_T named Distance_Closest_Object, set to 10km Distance_Closest_Object : Object_Distance_Km_T := 10.0; -- Declare a Speed_Kph_T named Running_Speed, set to 25km/h Running_Speed : Speed_Kph_T := 25.0; -- Assign Time_To_Arrival to -- Distance_Closest_Object divided by Running_Speed * 3600 Time_To_Arrival : Float := Distance_Closest_Object / Running_Speed * 3600.0; begin -- This line will compile if the declarations are OK Radar_Internals.Time_Step (Float (Radar_Angle), Time_To_Arrival, Object_Status_T'Image (John_Connor)); -- QUESTION 2 - Part A -- -- Some time has passed since setup, set variables as follow to reflect that. -- -- Rotate the radar 200 degrees by incrementing its value Radar_Angle := Radar_Angle + 200; -- Set the status of John_Connor to Tracked John_Connor := Tracked; -- Set distance to closest object to 4km Distance_Closest_Object := 4.0; -- Update Running_Time accordingly Time_To_Arrival := Distance_Closest_Object / Running_Speed * 3600.0; -- This line will compile if the declarations are OK Radar_Internals.Time_Step (Float (Radar_Angle), Time_To_Arrival, Object_Status_T'Image (John_Connor)); -- QUESTION 2 - Part B -- -- Some more time has passed since setup. -- -- Rotate the radar 180 degrees Radar_Angle := Radar_Angle + 180; -- Set the status of John_Connor to Selected John_Connor := Selected; -- This line will compile if the declarations are OK Radar_Internals.Time_Step (Float (Radar_Angle), Time_To_Arrival, Object_Status_T'Image (John_Connor)); -- QUESTION 3 - Quiz -- -- a. What happens if we want to rotate the radar by 361 degrees? -- This won't compile: 361 is not a valid `Angle_Degrees_T` -- Radar_Angle := Radar_Angle + 361; -- This will work though, end result is identical to adding 1 degree Radar_Angle := Radar_Angle + 359; Radar_Angle := Radar_Angle + 2; -- b. There is a last minute change in the spec: John Connor is now in -- the "Friend" status, make changes to the code to allow for that. -- Simply add a Friend value to Object_Status_T and call -- John_Connor := Friend; -- Notice that Time_Step handles the new enumeral without issue -- c. What happens to the E.T.A. if Running_Speed is 0? Try it. -- Running speed is used as a divisor, so there will be a division -- by 0. This will either return a NaN or raise a Constraint_Error -- depending on value of Real'Machine_Overflows. -- QUESTION 4 - Advanced -- -- Redefine Object_Distance_Km_T as a type instead of subtype. -- Modify the two division to make it work, using explicit casting. end Main;

34.722222

80

0.695467

22095a8bd2fbd8e056970ee0a6ae33d9ae9b4989

4,678

ads

Ada

source/amf/mof/amf-links.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/mof/amf-links.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/mof/amf-links.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, 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 class represents an instance of an Association, in the same way that -- Element represents an instance of a Class. ------------------------------------------------------------------------------ with AMF.CMOF.Associations; with AMF.Elements; package AMF.Links is pragma Preelaborate; type Link is limited interface; type Link_Access is access all Link'Class; for Link_Access'Storage_Size use 0; not overriding function Get_Association (Self : not null access constant Link) return not null AMF.CMOF.Associations.CMOF_Association_Access is abstract; -- This is the Association of which the Link is an instance. not overriding function Get_First_End (Self : not null access constant Link) return not null AMF.Elements.Element_Access is abstract; -- This is the Element associated with the first end of the Association. not overriding function Get_Second_End (Self : not null access constant Link) return not null AMF.Elements.Element_Access is abstract; -- This is the Element associated with the second end of the Association. not overriding procedure Delete (Self : not null access constant Link) is abstract; -- Deletes the Link. This may leave the same elements associated by other -- links for this Association. end AMF.Links;

57.753086

78

0.476058

58fb28f3aeb12d31d7901ad3c85dacfa049ed4bd

3,100

ads

Ada

tools/scitools/sample/mahjongg/tile.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

1

2020-01-20T21:26:46.000Z

tools/scitools/sample/mahjongg/tile.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

tools/scitools/sample/mahjongg/tile.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

-------------------------------------------------------------------- --| Package : TileADT Version : -------------------------------------------------------------------- --| Abstract : Provides an ADT for a TILE in the Mahjongg game. -------------------------------------------------------------------- --| Compiler/System : IBM AIX/Ada 6000 --| Author : John Dalbey Date : 1/93 --| References : -------------------------------------------------------------------- --| NOTES : --| : --| Version History : -------------------------------------------------------------------- PACKAGE TileADT IS TYPE Tile IS PRIVATE; TYPE TilePair is record Alpha: Tile; Bravo: Tile; end record; RowBound : Constant INTEGER := 9; ColBound : Constant CHARACTER := 'O'; LayerBound : Constant INTEGER := 5; SUBTYPE Row is INTEGER RANGE 1 .. RowBound; -- Row Positions SUBTYPE Col is CHARACTER RANGE 'A' .. ColBound; -- Column positions SUBTYPE Layer is INTEGER RANGE 1 .. LayerBound; -- Layers high --(1 is bottom, 5 is top) SUBTYPE TileValue is INTEGER RANGE -1 .. 42; -- Legal tile values FUNCTION Create (TheCol: Col; TheRow : Row; TheLayer : Layer) RETURN TILE; -- Assumes : TheCol, TheRow, TheLayer have values. -- Uses : TheRow indicates which row on the board. -- TheCol indicates which column on the board. -- TheLayer indicates which layer on the board. -- Results : A Tile is created and assigned a position TheCol,TheRow,TheLayer. PROCEDURE SetValue (TheTile : IN OUT Tile; Value : TileValue); -- Assumes : nothing (though it makes sense that it have been created). -- Uses : TheTile and Value -- Results : TheTile is assigned Value FUNCTION GetValue (TheTile : Tile) RETURN TileValue; -- Assumes : TheTile has a value -- Uses : TheTile -- Results : Returns the current value of TheTile. FUNCTION GetLayer (TheTile : Tile) RETURN Layer; -- Assumes : TheTile has a value -- Uses : TheTile -- Results : Returns TheTile's layer. FUNCTION GetRow (TheTile : Tile) RETURN Row; -- Assumes : TheTile has a value -- Uses : TheTile -- Results : Returns TheTile's Row. FUNCTION GetCol (TheTile : Tile) RETURN Col; -- Assumes : TheTile has a value -- Uses : TheTile -- Results : Returns TheTile's Col. FUNCTION IsMatch (Tile1, Tile2 : Tile) RETURN BOOLEAN; -- Assumes : Tile1, Tile2 have values. -- Uses : Tile1, Tile2. -- Results : Returns TRUE if Tile1 has the same value as Tile2, FALSE otherwise. -- Notes : TRUE only on exact match. Doesn't deal with seasons or other -- "suit" type tiles. PRIVATE TYPE Tile is RECORD Col_Pos : Col; Row_Pos : Row; Layer_Pos: Layer; Value : TileValue; END RECORD; END TileADT;

38.271605

81

0.521613

22f52f4325e2ef11aa4c3d81d1a5bc20d19d8187

958

ads

Ada

gdb/testsuite/gdb.ada/tagged/pck.ads

greyblue9/binutils-gdb

05377632b124fe7600eea7f4ee0e9a35d1b0cbdc

[ "BSD-3-Clause" ]

1

2020-10-14T03:24:35.000Z

gdb/testsuite/gdb.ada/tagged/pck.ads

greyblue9/binutils-gdb

05377632b124fe7600eea7f4ee0e9a35d1b0cbdc

[ "BSD-3-Clause" ]

null

gdb/testsuite/gdb.ada/tagged/pck.ads

greyblue9/binutils-gdb

05377632b124fe7600eea7f4ee0e9a35d1b0cbdc

[ "BSD-3-Clause" ]

null

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

29.030303

73

0.720251

22a1a6fd383a01ca6c23f7cb8c2cc9d030b3c340

3,627

adb

Ada

src/sdl-video-surfaces-makers.adb

alire-project/sdlada

9593807925f5f6651d81514c7f2d163ab3156dc1

[ "Zlib" ]

null

src/sdl-video-surfaces-makers.adb

alire-project/sdlada

9593807925f5f6651d81514c7f2d163ab3156dc1

[ "Zlib" ]

null

src/sdl-video-surfaces-makers.adb

alire-project/sdlada

9593807925f5f6651d81514c7f2d163ab3156dc1

[ "Zlib" ]

null

-------------------------------------------------------------------------------------------------------------------- -- Copyright (c) 2013-2018 Luke A. Guest -- -- This software is provided 'as-is', without any express or implied -- warranty. In no event will the authors be held liable for any damages -- arising from the use of this software. -- -- Permission is granted to anyone to use this software for any purpose, -- including commercial applications, and to alter it and redistribute it -- freely, subject to the following restrictions: -- -- 1. The origin of this software must not be misrepresented; you must not -- claim that you wrote the original software. If you use this software -- in a product, an acknowledgment in the product documentation would be -- appreciated but is not required. -- -- 2. Altered source versions must be plainly marked as such, and must not be -- misrepresented as being the original software. -- -- 3. This notice may not be removed or altered from any source -- distribution. -------------------------------------------------------------------------------------------------------------------- with Ada.Finalization; package body SDL.Video.Surfaces.Makers is procedure Create (Self : in out Surface; Size : in SDL.Sizes; BPP : in Pixel_Depths; Red_Mask : in Colour_Masks; Blue_Mask : in Colour_Masks; Green_Mask : in Colour_Masks; Alpha_Mask : in Colour_Masks) is function SDL_Create_RGB_Surface (Flags : in Surface_Flags := 0; -- TODO: Is this the correct type? Width : in C.int := 0; Height : in C.int := 0; Depth : in Pixel_Depths := 1; Red_Mask : in Colour_Masks := 0; Green_Mask : in Colour_Masks := 0; Blue_Mask : in Colour_Masks := 0; Alpha_Mask : in Colour_Masks := 0) return Internal_Surface_Pointer with Import => True, Convention => C, External_Name => "SDL_CreateRGBSurface"; begin Self.Internal := SDL_Create_RGB_Surface (Width => Size.Width, Height => Size.Height, Depth => BPP, Red_Mask => Red_Mask, Green_Mask => Green_Mask, Blue_Mask => Blue_Mask, Alpha_Mask => Alpha_Mask); end Create; -- TODO: SDL_CreateRGBSurfaceFrom -- procedure Create (Self : in out Surface; File_Name : in String) is -- -- This is actually a macro in the header. -- function SDL_Load_BMP (File_Name : in C.char_array) return Internal_Surface_Pointer with -- Import => True, -- Convention => C, -- External_Name => "SDL_LoadBMP"; -- begin -- Self.Internal := SDL_Load_BMP (C.To_C (File_Name)); -- end Create; function Get_Internal_Surface (Self : in Surface) return Internal_Surface_Pointer is begin return Self.Internal; end Get_Internal_Surface; function Make_Surface_From_Pointer (S : in Internal_Surface_Pointer; Owns : in Boolean := False) return Surface is begin return (Ada.Finalization.Controlled with Internal => S, Owns => Owns); end Make_Surface_From_Pointer; end SDL.Video.Surfaces.Makers;

47.723684

117

0.540392

587d54038deeaa38502dfe62ec1a32fa988a3c63

109,699

adb

Ada

source/reports.adb

jquorning/CELLE

0584a22bd48464c2727751fca9dbca079e217b0c

[ "blessing" ]

null

source/reports.adb

jquorning/CELLE

0584a22bd48464c2727751fca9dbca079e217b0c

[ "blessing" ]

null

source/reports.adb

jquorning/CELLE

0584a22bd48464c2727751fca9dbca079e217b0c

[ "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.Strings.Fixed; with Ada.Strings.Unbounded; with Ada.Unchecked_Deallocation; with Ada.Containers; with Rules; with Rule_Lists; with Symbols; with Report_Parsers; with Actions; with Action_Lists; with Action_Tables; with Action_Algorithms; with Configs; with States; with Options; with Generate_Ada; with Generate_C; with Backend; with Symbol_Sets; with Types; with Templates; with Auxiliary; package body Reports is use type Types.Line_Number; subtype Symbol_Index is Types.Symbol_Index; subtype Line_Number is Types.Line_Number; subtype Offset_Type is Types.Offset_Type; subtype Symbol_Access is Symbols.Symbol_Access; -- subtype Rule_Access is Rules.Rule_Access; subtype Rule_Access is Rule_Lists.Rule_Access; subtype Dot_Type is Rules.Dot_Type; subtype Action_Record is Actions.Action_Record; subtype Action_Table is Action_Tables.Table_Type; subtype Action_Value is Action_Tables.Action_Value; subtype Config_Access is Configs.Config_Access; subtype State_Access is States.State_Access; subtype State_Number is States.State_Number; procedure Rule_Print (File : File_Type; Rule : Rule_Access); procedure Rule_Print (File : File_Type; Rule : Rule_Access; Cursor : Dot_Type); -- Print the text of a rule. This procedure i overloaded !!! procedure Print_Action (Action : Action_Record; File : File_Type; Indent : Natural; Emit : out Boolean); -- Print an Action to File with Indent indention. Return Falese if -- nothing was actually printed. procedure Config_Print (File : File_Type; Config : Config_Access); -- Print the rule for a configuration. function Minimum_Size_Type (LWS : Offset_Type; UPR : Offset_Type; PnBytes : out Integer) return String; -- Return the name of a C datatype able to represent values between -- lwr and upr, inclusive. If pnByte!=NULL then also write the sizeof -- for that type (1, 2, or 4) into *pnByte. function File_Makename (Session : Session_Type; Extension : String) return String; procedure Write_Rule_Text (File : File_Type; Rule : Rule_Access); -- Write text on "out" that describes the rule "rp". procedure Emit_Destructor_Code (File : File_Type; Line : in out Line_Number; Symbol : Symbol_Access; Session : Session_Type); -- The following routine emits code for the destructor for the -- symbol sp procedure Translate_Code (Session : Session_Type; Rule : Rule_Access; Length : out Natural); -- Write and transform the rp->code string so that symbols are expanded. -- Populate the rp->codePrefix and rp->codeSuffix strings, as appropriate. -- -- Return 1 if the expanded code requires that "yylhsminor" local variable -- to be defined. procedure Emit_Code (File : File_Type; Rule : Rule_Access; Session : Session_Type; Line : in out Line_Number); -- Generate code which executes when the rule "rp" is reduced. Write -- the code to "out". Make sure lineno stays up-to-date. procedure Print_Stack_Union (File : File_Type; Line : in out Line_Number; Session : Session_Type; Make_Header : Boolean); -- Print the definition of the union used for the parser's data stack. -- This union contains fields for every possible data type for tokens -- and nonterminals. In the process of computing and printing this -- union, also set the ".dtnum" field of every terminal and nonterminal -- symbol. procedure Generate_Tokens (Session : in Session_Type; Token_Prefix : in String; First : in Integer; Last : in Integer); -- type Render_Record is record Nx_State : Integer; N_Rule : Integer; N_Terminal : Integer; Min_Shift_Reduce : Action_Value; Err_Action : Action_Value; Acc_Action : Action_Value; No_Action : Action_Value; Min_Reduce : Action_Value; Num_Rule_With_Action : Natural; end record; procedure Render_Constants (File : File_Type; Render : Render_Record; Line : in out Line_Number); -- -- procedure Output_Action_Table (File : File_Type; Table : Action_Table; N : Integer; No_Action : Action_Value; Line : in out Line_Number); -- -- -- procedure Output_YY_Lookahead -- (File : File_Type; -- Table : Action_Table; -- N : Integer; -- Nsymbol : Integer; -- Line : in out Line_Number); -- -- procedure Output_YY_Shift_Offsets (File : File_Type; Session : Session_Type; N : Integer; MnTknOfst : Offset_Type; MxTknOfst : Offset_Type; Min_Size_Type : String; Nactiontab : Integer; No_Offset : Offset_Type; Line : in out Line_Number); -- -- -- procedure Output_YY_Reduce_Offsets (File : File_Type; Session : Session_Type; N : Integer; MnNtOfst : Offset_Type; MxNtOfst : Offset_Type; Min_Size_Type : String; No_Offset : Offset_Type; Line : in out Line_Number); procedure Output_Default_Action_Table (File : File_Type; Session : Session_Type; N : Integer; Error_Action : Action_Value; Min_Reduce : Action_Value; Line : in out Line_Number); -- procedure Template_Print_2 -- (Line : in String; -- No_Line_Nos : in Integer; -- Out_Name : in String); -- Print a string to the file and keep the linenumber up to date procedure Write_Arg_Defines (File : File_Type; Name : String; Arg_Ctx : String; Extend : Boolean; Arg : String; Arg_I : String; Line : in out Line_Number); procedure Write_Interface (File : File_Type; Name : String; Tokentype : String; Line : in out Line_Number); pragma Unreferenced (Write_Interface); -- procedure Write_Interface_Begin (File : File_Type; Line : in out Line_Number; Make_Header : Boolean); procedure Write_Interface_End (File : File_Type; Line : in out Line_Number; Make_Header : Boolean); -- Each state contains a set of token transaction and a set of -- nonterminal transactions. Each of these sets makes an instance -- of the following structure. An array of these structures is used -- to order the creation of entries in the yy_action[] table. type AX_Record is record STP : access States.State_Record; -- A pointer to a state Is_Token : Boolean; -- True to use tokens. False for non-terminals Num_Action : Action_Value; -- Number of actions Order : Integer; -- Original order of action sets end record; procedure Generate_Spec (Session : Session_Type; Base_Name : String; Prefix : String; -- Prefix of symbols in spec Module : String; -- Prefix of symbols in spec First : Integer; -- Index of first symbol Last : Integer); -- Index of last symbol -- Create spec file with name File_Name including symols found by -- iterating from First to Last calling callback prepended with -- Suffix. -- procedure Implementation_Open (File_Name : in String); -- Open a file for writing then implementaion (parse.adb/parse.c). -- File handler is located in the context structure. procedure Write_Include (File : File_Type; Line : in out Line_Number; Include_Name : String); -- procedure Generate_The_Defines_1 (File : File_Type; Line : in out Line_Number; YY_Code_Type : String; Symbol_Count : Symbol_Index; YY_Action_Type : String; Is_Wildcard : Boolean; Wildcard_Index : Symbol_Index); -- procedure Generate_The_Defines_2 (File : File_Type; Line : in out Line_Number; Stack_Size : String); -- type Mystruct_Record is record Use_Count : Integer; Index : Symbol_Index; DT_Num : Integer; end record; procedure Error_Fallback (File : File_Type; Line : in out Line_Number; Error_Sym : String; Struct : Mystruct_Record; Has_Fallback : Boolean); -- -- procedure Emit_SQL (File : File_Type; Session : Session_Type); -- type AX_Set_Record is record Token : AX_Record; Non_Terminal : AX_Record; end record; type AX_Set_Array is array (Symbol_Index range <>) of AX_Set_Record; type A_AX_Set_Array is access all AX_Set_Array; procedure Put (File : File_Type; Item : String) renames Ada.Text_IO.Put; procedure Put_Line (File : File_Type; Item : String := "") renames Ada.Text_IO.Put_Line; generic Line : in out Line_Number; procedure Increment; procedure Increment is begin Line := Line + 1; end Increment; ----------------------------------------------------------------------------- -- function Axset_Compare (A, B : AX_Set_Record) return Integer; -- Compare to axset structures for sorting purposes -- static int axset_compare(const void *a, const void *b){ -- struct axset *p1 = (struct axset*)a; -- struct axset *p2 = (struct axset*)b; -- int c; -- c = p2->nAction - p1->nAction; -- if( c==0 ){ -- c = p1->iOrder - p2->iOrder; -- } -- assert( c!=0 || p1==p2 ); -- return c; -- } ------------- -- Reprint -- ------------- procedure Reprint (File : File_Type; Session : Session_Type) is use Ada.Strings.Unbounded; use Symbols; use type Rule_Access; use type Rules.Rule_Symbol_Access; use Types; package Symbol_Index_IO is new Ada.Text_IO.Integer_IO (Num => Types.Symbol_Index); Symbol : Symbol_Access; J : Symbol_Index; Max_Len, Len, N_Columns, Skip : Integer; Column : Natural; begin Put (File, "// Reprint of input file """); Put (File, To_String (Unbounded_String'(Session.File_Name))); Put_Line (File, """."); Put_Line (File, "// Symbols:"); Max_Len := 10; -- Determine Max_Len for I in 0 .. Symbols.Last_Index loop Symbol := Symbols.Element_At (Index => I); Len := Length (Symbol.Name); if Len > Max_Len then Max_Len := Len; end if; end loop; -- Determine N_Columns N_Columns := 76 / (Max_Len + 5); if N_Columns < 1 then N_Columns := 1; end if; -- Print symbol list Skip := (Integer (Session.Num_Symbol) + N_Columns - 1) / N_Columns; for I in 0 .. Skip - 1 loop Put (File, "//"); J := Types.Symbol_Index (I); Column := 0; while J < Session.Num_Symbol loop Symbol := Symbols.Element_At (J); pragma Assert (Symbol.Index = J); Put (File, " "); Symbol_Index_IO.Put (J, Width => 3); Put (File, " "); declare Name : constant String := Symbols.Name_Of (Symbol); Field : String (1 .. Max_Len) := (others => ' '); begin Field (Name'Range) := Name; Put (File, Field); end; J := J + Symbol_Index (Skip); Column := Column + 1; end loop; Put_Line (File, ""); end loop; -- Print rules for Rule of Session.Rule loop Rule_Print (File, Rule); Put (File, "."); if Rule.Prec_Symbol /= null then Put (File, " [" & Name_Of (Symbol_Access (Rule.Prec_Symbol)) & "]"); end if; -- /* if( rp->code ) printf("\n %s",rp->code); */ Put_Line (File, ""); end loop; end Reprint; ------------------- -- Report_Output -- ------------------- procedure Report_Output (Session : Session_Type) is use Ada.Text_IO; use Symbols; use Rules; use Configs; use type Types.Symbol_Index; subtype State_Number is States.State_Number; File : File_Type; Action_Result : Boolean; N : Integer; State : States.State_Access; Config : Config_Access; begin -- fp = file_open(lemp,".out","wb"); Ada.Text_IO.Open (File, Ada.Text_IO.Out_File, "XXX.out"); for I in 0 .. Session.Num_X_State - 1 loop State := Session.Sorted (I); Put (File, "State "); Put (File, State_Number'Image (State.Number)); Put (File, ":"); New_Line (File); if Session.Basis_Flag then Config := State.Basis; else Config := State.Config; end if; while Config /= null loop if Config.Dot = Dot_Type (Config.Rule.RHS.Length) then Put (File, " ("); Put (File, Config.Rule.Number'Image); Put (File, ") "); else Put (File, " "); end if; Config_Print (File, Config); New_Line (File); -- SetPrint(fp,cfp->fws,lemp); -- PlinkPrint(fp,cfp->fplp,"To "); -- PlinkPrint(fp,cfp->bplp,"From"); if Session.Basis_Flag then Config := Config.Basis; else Config := Config.Next; end if; end loop; New_Line (File); for Action of State.Action loop Print_Action (Action, File, 30, Action_Result); if Action_Result then New_Line (File); end if; end loop; New_Line (File); end loop; Put_Line (File, "----------------------------------------------------"); Put_Line (File, "Symbols:"); Put_Line (File, "The first-set of non-terminals is shown after the name."); New_Line (File); for I in 0 .. Symbols.Last_Index - 1 loop declare use type Symbol_Sets.Set_Type; Symbol : Symbol_Access; begin Symbol := Element_At (I); Put (File, " " & I'Image & ": " & Name_Of (Symbol)); if Symbol.Kind = Non_Terminal then Put (File, ":"); if Symbol.Lambda then Put (File, " <lambda>"); end if; for J in 0 .. Session.Num_Terminal - 1 loop if Symbol.First_Set /= Symbol_Sets.Null_Set and then Symbol_Sets.Set_Find (Symbol.First_Set, J) then Put (File, " "); Put (File, Name_Of (Element_At (J))); end if; end loop; end if; if Symbol.Precedence >= 0 then Put (File, " (precedence="); Put (File, Symbol.Precedence'Image); Put (File, ")"); end if; end; New_Line (File); end loop; Put_Line (File, "----------------------------------------------------"); Put_Line (File, "Syntax-only Symbols:"); Put_Line (File, "The following symbols never carry semantic content."); New_Line (File); N := 0; for I in 0 .. Symbols.Last_Index loop declare W : Integer; Symbol : constant Symbol_Access := Element_At (I); begin if not Symbol.Content then W := Ada.Strings.Unbounded.Length (Symbol.Name); if N > 0 and N + W > 75 then New_Line (File); N := 0; end if; if N > 0 then Put (File, " "); N := N + 1; end if; Put (File, Name_Of (Symbol)); N := N + W; end if; end; end loop; if N > 0 then New_Line (File); end if; Put_Line (File, "----------------------------------------------------"); Put_Line (File, "Rules:"); for Rule of Session.Rule loop Put (File, Rule.Number'Image); -- XXX "%4d: ", rp->iRule); Put (File, ": "); Rule_Print (File, Rule); Put (File, "."); if Rule.Prec_Symbol /= null then Put (File, " ["); Put (File, Name_Of (Symbol_Access (Rule.Prec_Symbol))); Put (File, " precedence="); Put (File, Rule.Prec_Symbol.Precedence'Image); Put (File, "]"); end if; New_Line (File); end loop; Close (File); end Report_Output; -------------- -- Emit_SQL -- -------------- procedure Emit_SQL (File : File_Type; Session : Session_Type) is subtype Rule_Number is Rules.Rule_Number; use type Rule_Number; -- use type Ada.Containers.Count_Type; use type Symbol_Index; use type Symbols.Symbol_Kind; I : Rule_Number; J : Symbol_Index; begin Put_Line (File, "BEGIN;"); Put_Line (File, "CREATE TABLE symbol("); Put_Line (File, " id INTEGER PRIMARY KEY,"); Put_Line (File, " name TEXT NOT NULL,"); Put_Line (File, " isTerminal BOOLEAN NOT NULL,"); Put_Line (File, " fallback INTEGER REFERENCES symbol" & " DEFERRABLE INITIALLY DEFERRED"); Put_Line (File, ");"); for I in 0 .. Session.Num_Symbol - 1 loop Put (File, "INSERT INTO symbol(id,name,isTerminal,fallback) "); Put (File, " VALUES("); Put (File, I'Image); Put (File, ",'"); Put (File, Symbols.Name_Of (Symbols.Element_At (I))); Put (File, "',"); Put (File, (if I < Session.Num_Terminal then "TRUE" else "FALSE")); Put (File, ","); if Symbols.Element_At (I).Fallback /= null then Put (File, Symbols.Element_At (I).Fallback.Index'Image); Put_Line (File, ");"); else Put_Line (File, "NULL);"); end if; end loop; Put_Line (File, "CREATE TABLE rule("); Put_Line (File, " ruleid INTEGER PRIMARY KEY,"); Put_Line (File, " lhs INTEGER REFERENCES symbol(id),"); Put_Line (File, " txt TEXT"); Put_Line (File, ");"); Put_Line (File, "CREATE TABLE rulerhs("); Put_Line (File, " ruleid INTEGER REFERENCES rule(ruleid),"); Put_Line (File, " pos INTEGER,"); Put_Line (File, " sym INTEGER REFERENCES symbol(id)"); Put_Line (File, ");"); I := 0; for Rule of Session.Rule loop pragma Assert (I = Rule.Number); Put (File, "INSERT INTO rule(ruleid,lhs,txt) VALUES("); Put (File, Rule.Number'Image); Put (File, ","); Put (File, Rule.LHS.Index'Image); Put (File, ",'"); Write_Rule_Text (File, Rule); Put_Line (File, "');"); J := 0; for Symbol of Rule.RHS loop if Symbol.Kind /= Symbols.Multi_Terminal then Put (File, "INSERT INTO rulerhs(ruleid,pos,sym)VALUES("); Put (File, I'Image); Put (File, ","); Put (File, J'Image); Put (File, ","); Put (File, Symbol.Index'Image); Put (File, ");"); Put_Line (File, ""); else for Sub_Symbol of Symbol.Sub_Symbol loop Put (File, "INSERT INTO rulerhs(ruleid,pos,sym)VALUES("); Put (File, I'Image); Put (File, ","); Put (File, J'Image); Put (File, ","); Put (File, Sub_Symbol.Index'Image); Put (File, ");"); Put_Line (File, ""); end loop; end if; J := J + 1; end loop; I := I + 1; end loop; Put_Line (File, "COMMIT;"); end Emit_SQL; ------------------ -- Report_Table -- ------------------ procedure Report_Table (Session : in out Session_Type; Make_Headers : Boolean; Generate_SQL : Boolean; User_Template_Name : String) is use Ada.Strings.Unbounded; use Sessions; use type Action_Tables.Action_Value; Column_Count : constant := 8; type Column_Number is mod Column_Count; procedure Close (File : in out File_Type) renames Ada.Text_IO.Close; Session_Name : constant String := To_String (Session.Names.Name); Out_File : File_Type; SQL_File : File_Type; File : File_Type renames Out_File; -- char line[LINESIZE]; Lineno : Types.Line_Number := 0; State : States.State_Access; -- struct action *ap; -- Rule : Rules.Rule_Access; Act_Tab : Action_Tables.Table_Access; -- int i, j, n, sz; I : Integer; N : Integer; SZ : Integer; Size_Of_Action_Type : Integer; Size_Of_Code_Type : Integer; -- const char *name; Mn_Tkn_Ofst, Mx_Tkn_Ofst : Offset_Type; Mn_Nt_Ofst, Mx_Nt_Ofst : Offset_Type; AX : A_AX_Set_Array; Template_Open_Success : Integer; Error_Count : Natural := 0; procedure Increment_Line is new Increment (Lineno); begin Session.Min_Shift_Reduce := Action_Value (Session.Sorted.Length); -- Session.Err_Action := Session.Min_Shift_Reduce + Session.N_Rule; Session.Err_Action := Session.Min_Shift_Reduce + Action_Value (Session.Rule.Length); Session.Acc_Action := Session.Err_Action + 1; Session.No_Action := Session.Acc_Action + 1; Session.Min_Reduce := Session.No_Action + 1; -- Session.Max_Action := Session.Min_Reduce + Session.N_Rule; Session.Max_Action := Session.Min_Reduce + Action_Value (Session.Rule.Length); Templates.Open (User_Template_Name, Error_Count, Template_Open_Success); Auxiliary.Recreate (File, Ada.Text_IO.Out_File, File_Name => File_Makename (Session, ".c")); if Generate_SQL then declare use Ada.Text_IO; begin Open (SQL_File, Ada.Text_IO.Out_File, "XXX" & ".sql"); exception when others => -- Close (Input_File); Close (Out_File); return; end; Emit_SQL (SQL_File, Session); end if; -- if( sqlFlag==0 ){ -- sql = 0; -- }else{ -- sql = file_open(lemp, ".sql", "wb"); -- if( sql==0 ){ -- fclose(in); -- fclose(out); -- return; -- } -- } -- lineno = 1; Templates.Transfer (File, Session_Name, Lineno); -- Generate the include code, if any -- Sessions_Print (Session.Outname, Session.No_Linenos_Flag, Session.Include); Templates.Print (File, Ada.Strings.Unbounded.To_String (Session.Out_Name), Session.No_Linenos_Flag, To_String (Session.Names.Include), Lineno); -- lime_print (lime_get_ouüt_name (), lemp->nolinenosflag, lemap->include); -- lime_write_include (lime_get_mh_flag(), file_makename(lemp, ".h")); Write_Include (File, Lineno, File_Makename (Session, ".h")); Templates.Transfer (File, Session_Name, Lineno); -- Generate #defines for all tokens -- XXX Sessions_Session_Copy := Session; -- lime_generate_tokens (lime_get_mh_flag(), lemp->tokenprefix, 1, lemp->nterminal); Generate_Tokens (Session, To_String (Session.Names.Token_Prefix), 1, Integer (Session.Num_Terminal)); Templates.Transfer (File, Session_Name, Lineno); -- Generate the defines declare use Symbols; Code : constant String := Minimum_Size_Type (0, Offset_Type (Symbols.Last_Index), Size_Of_Code_Type); Action : constant String := Minimum_Size_Type (0, Offset_Type (Session.Max_Action), Size_Of_Action_Type); Wildcard : constant Symbol_Access := Session.Wildcard; Is_Wildcard : constant Boolean := Wildcard /= null; begin if Is_Wildcard then Generate_The_Defines_1 (File, Lineno, Code, Symbols.Last_Index, Action, Is_Wildcard => True, Wildcard_Index => Wildcard.Index); else Generate_The_Defines_1 (File, Lineno, Code, Symbols.Last_Index, Action, Is_Wildcard => False, Wildcard_Index => 0); end if; end; -- print_stack_union (lemp, lime_get_mh_flag()); Print_Stack_Union (File, Lineno, Session, Make_Headers); Generate_The_Defines_2 (File, Lineno, To_String (Session.Names.Stack_Size)); Write_Interface_Begin (File, Lineno, Make_Headers); declare function Get_Name return String; function Get_Name return String is begin if Session.Names.Name = "" then return "Parse"; else return To_String (Session.Names.Name); end if; end Get_Name; Name : constant String := Get_Name; use Report_Parsers; ARG : constant String := Get_ARG (Get_Context); CTX : constant String := Get_CTX (Get_Context); ARG_I : Natural; CTX_I : Natural; begin Trim_Right_Symbol (ARG, ARG_I); if ARG = "" then Write_Arg_Defines (File, Name, "ARG", False, "", "", Lineno); else Write_Arg_Defines (File, Name, "ARG", True, ARG, ARG (ARG_I .. ARG'Last), Lineno); end if; Trim_Right_Symbol (CTX, CTX_I); if CTX = "" then Write_Arg_Defines (File, Name, "CTX", False, "", "", Lineno); else Write_Arg_Defines (File, Name, "CTX", True, CTX, CTX (CTX_I .. CTX'Last), Lineno); end if; end; Write_Interface_End (File, Lineno, Make_Headers); Error_Fallback (File, Lineno, "", Struct => (Use_Count => Session.Error_Symbol.Use_Count, Index => Session.Error_Symbol.Index, DT_Num => Session.Error_Symbol.DT_Num), Has_Fallback => Session.Has_Fallback); -- Compute the action table, but do not output it yet. The action -- table must be computed before generating the YYNSTATE macro because -- we need to know how many states can be eliminated. -- AX := (struct axset *) calloc(lemp->nxstate*2, sizeof(ax[0])); -- AX := new AX_Set_Record; -- (struct axset *) calloc(lemp->nxstate*2, sizeof(ax[0])); declare use type Types.Symbol_Index; begin AX := new AX_Set_Array (0 .. Session.Num_X_State - 1); -- if( ax==0 ){ -- fprintf(stderr,"malloc failed\n"); -- exit(1); for I in 0 .. Session.Num_X_State - 1 loop State := Session.Sorted (I); AX (I).Token := (STP => State, Is_Token => True, Num_Action => State.Num_Token, Order => <>); AX (I).Non_Terminal := (STP => State, Is_Token => False, Num_Action => State.Num_Nonterminal, Order => <>); end loop; end; Mx_Tkn_Ofst := 0; Mn_Tkn_Ofst := 0; Mx_Nt_Ofst := 0; Mn_Nt_Ofst := 0; -- In an effort to minimize the action table size, use the heuristic -- of placing the largest action sets first -- for(i=0; i<lemp->nxstate*2; i++) ax[i].iOrder = i; -- qsort(ax, lemp->nxstate*2, sizeof(ax[0]), axset_compare); Act_Tab := Action_Tables.Alloc (Integer (Symbols.Last_Index), Integer (Session.Num_Terminal)); -- for(i=0; i<lemp->nxstate*2 && ax[i].nAction>0; i++){ -- stp = ax[i].stp; -- if( ax[i].isTkn ){ -- for(ap=stp->ap; ap; ap=ap->next){ -- int action; -- if( ap->sp->index>=lemp->nterminal ) continue; -- action = compute_action(lemp, ap); -- if( action<0 ) continue; -- acttab_action(pActtab, ap->sp->index, action); -- } -- stp->iTknOfst = acttab_insert(pActtab, 1); -- if( stp->iTknOfst<mnTknOfst ) mnTknOfst = stp->iTknOfst; -- if( stp->iTknOfst>mxTknOfst ) mxTknOfst = stp->iTknOfst; -- }else{ -- for(ap=stp->ap; ap; ap=ap->next){ -- int action; -- if( ap->sp->index<lemp->nterminal ) continue; -- if( ap->sp->index==lemp->nsymbol ) continue; -- action = compute_action(lemp, ap); -- if( action<0 ) continue; -- acttab_action(pActtab, ap->sp->index, action); -- } -- stp->iNtOfst = acttab_insert(pActtab, 0); -- if( stp->iNtOfst<mnNtOfst ) mnNtOfst = stp->iNtOfst; -- if( stp->iNtOfst>mxNtOfst ) mxNtOfst = stp->iNtOfst; -- } -- -- #if 0 /* Uncomment for a trace of how the yy_action[] table fills out */ -- { int jj, nn; -- for(jj=nn=0; jj<pActtab->nAction; jj++){ -- if( pActtab->aAction[jj].action<0 ) nn++; -- } -- printf("%4d: State %3d %s n: %2d size: %5d freespace: %d\n", -- i, stp->statenum, ax[i].isTkn ? "Token" : "Var ", -- ax[i].nAction, pActtab->nAction, nn); -- } -- #endif -- } -- free(ax); -- -- /* Mark rules that are actually used for reduce actions after all -- ** optimizations have been applied -- */ -- for(rp=lemp->rule; rp; rp=rp->next) rp->doesReduce = LEMON_FALSE; -- for(i=0; i<lemp->nxstate; i++){ -- for(ap=lemp->sorted[i]->ap; ap; ap=ap->next){ -- if( ap->type==REDUCE || ap->type==SHIFTREDUCE ){ -- ap->x.rp->doesReduce = 1; -- } -- } -- } -- Finish rendering the constants now that the action table has -- been computed Render_Constants (File, Render => (Nx_State => Natural (Session.Num_X_State), N_Rule => Integer (Session.Rule.Length), N_Terminal => Integer (Session.Num_Terminal), Min_Shift_Reduce => Session.Min_Shift_Reduce, Err_Action => Session.Err_Action, Acc_Action => Session.Acc_Action, No_Action => Session.No_Action, Min_Reduce => Session.Min_Reduce, Num_Rule_With_Action => Session.Num_Rule_With_Action), Line => Lineno); Templates.Transfer (File, Session_Name, Lineno); -- -- Now output the action table and its associates: -- -- yy_action[] A single table containing all actions. -- yy_lookahead[] A table containing the lookahead for each entry in -- yy_action. Used to detect hash collisions. -- yy_shift_ofst[] For each state, the offset into yy_action for -- shifting terminals. -- yy_reduce_ofst[] For each state, the offset into yy_action for -- shifting non-terminals after a reduce. -- yy_default[] Default action for each state. -- -- Output the yy_action table -- Session.Num_Action_Tab := Action_Tables.Action_Size (Act_Tab.all); N := Session.Num_Action_Tab; Session.Table_Size := Session.Table_Size + N * Size_Of_Action_Type; Output_Action_Table (File, Act_Tab.all, N, Session.No_Action, Lineno); -- -- Output the yy_lookahead table -- lemon.c:4484 -- Output_YY_Lookahead_Table : declare package Integer_IO is new Ada.Text_IO.Integer_IO (Integer); package Action_IO is new Ada.Text_IO.Integer_IO (Action_Value); package Symbol_IO is new Ada.Text_IO.Integer_IO (Symbol_Index); use Integer_IO, Action_IO, Symbol_IO; procedure Increment_Line is new Increment (Lineno); Column : Column_Number := Column_Number'First; Index : Natural; Look_Action : Action_Value; Num_Look_Ahead : Natural; begin Session.Num_Lookahead_Tab := Action_Tables.Lookahead_Size (Act_Tab.all); N := Session.Num_Lookahead_Tab; Session.Table_Size := Session.Table_Size + N * Size_Of_Code_Type; Put_Line (File, "static const YYCODETYPE yy_lookahead[] = {"); Increment_Line; for Index in 0 .. N - 1 loop Look_Action := Act_Tab.Action (Index).Lookahead; if Look_Action < 0 then Look_Action := Action_Value (Session.Num_Symbol); end if; if Column = Column_Number'First then Put (File, " /* "); Put (File, Index); Put (File, " */ "); end if; Put (File, " "); Put (File, Look_Action); Put (File, ","); if Column = Column_Number'Last or Index = N - 1 then Put_Line (File); Increment_Line; end if; Column := Column + 1; end loop; Index := N - 1; -- Dirty C trick using loop variable -- Add extra entries to the end of the yy_lookahead[] table so that -- yy_shift_ofst[]+iToken will always be a valid index into the array, -- even for the largest possible value of yy_shift_ofst[] and iToken. Num_Look_Ahead := Natural (Session.Num_Terminal) + Session.Num_Action_Tab; while Index < Num_Look_Ahead loop if Column = Column_Number'First then Put (File, " /* "); Put (File, Index, Width => 5); Put (File, " */ "); end if; Put (File, " "); Put (File, Session.Num_Terminal, Width => 4); Put (File, ","); if Column = Column_Number'Last then Put_Line (File); Increment_Line; end if; Column := Column + 1; Index := Index + 1; end loop; if Column > Column_Number'First then Put_Line (File); Increment_Line; end if; Put_Line (File, "};"); Increment_Line; end Output_YY_Lookahead_Table; -- Output the yy_shift_ofst[] table N := Natural (Session.Num_X_State); -- while N > 0 and Session.Sorted(N - 1).I_Tkn_Ofst = NO_Offset loop -- N := N - 1; -- end loop; -- -- lime_lemp = lemp; declare use type Offset_Type; Num_Terminal : constant Offset_Type := Offset_Type (Session.Num_Terminal); Num_Actions : constant Offset_Type := Offset_Type (Session.Num_Action_Tab); Upper : constant Offset_Type := Num_Terminal + Num_Actions; Data_Type : constant String := Minimum_Size_Type (Mn_Tkn_Ofst, Upper, SZ); begin Output_YY_Shift_Offsets (File, Session, N, Mn_Tkn_Ofst, Mx_Tkn_Ofst, Data_Type, Session.Num_Action_Tab, No_Offset, Lineno); end; Session.Table_Size := Session.Table_Size + N * SZ; -- -- Output the yy_reduce_ofst[] table -- N := Natural (Session.Num_X_State); -- while( n>0 && lemp->sorted[n-1]->iNtOfst==NO_OFFSET ) n--; -- declare use type Offset_Type; begin Output_YY_Reduce_Offsets (File, Session, N, Mn_Nt_Ofst, Mx_Nt_Ofst, Minimum_Size_Type (Mn_Nt_Ofst - 1, Mx_Nt_Ofst, SZ), No_Offset, Lineno); end; Session.Table_Size := Session.Table_Size + N * SZ; -- -- Output the default action table -- Output_Default_Action_Table (File, Session, Natural (Session.Num_X_State), Session.Err_Action, Session.Min_Reduce, Lineno); Session.Table_Size := Session.Table_Size + N * Size_Of_Action_Type; Templates.Transfer (File, Session_Name, Lineno); -- -- Generate the table of fallback tokens. -- if Session.Has_Fallback then declare use Symbols; use Types; MX : Symbol_Index := Session.Num_Terminal - 1; begin -- while MX > 0 and Session.Symbols (MX).Fallback = 0 loop while MX > 0 and Element_At (Index => MX).Fallback = null loop MX := MX - 1; end loop; Session.Table_Size := Session.Table_Size + Integer (MX + 1) * Size_Of_Code_Type; for I in 0 .. MX loop declare P : constant Symbol_Access := Element_At (I); begin if P.Fallback = null then Put (File, " 0, /* "); Put (File, Name_Of (P)); Put (File, " => nothing */"); Put_Line (File, ""); else Put (File, " "); Put (File, Symbol_Index'Image (P.Fallback.Index)); Put (File, ", /* "); Put (File, Name_Of (P)); Put (File, " => "); Put (File, To_String (P.Fallback.Name)); Put (File, " */"); Put_Line (File, ""); end if; Increment_Line; end; end loop; end; end if; Templates.Transfer (File, Session_Name, Lineno); -- -- Generate A Table Containing the symbolic name of every symbol -- declare use Symbols; use Types; J : Integer; begin for I in Symbol_Index range 0 .. Symbols.Last_Index - 1 loop declare Name : constant String := Name_Of (Element_At (I)); begin -- Session_Sprintf (Line, """" & Name & ""","); Put (File, " /* "); Put (File, Symbol_Index'Image (I)); Put (File, " */ """); Put (File, Name); Put (File, ""","); Put_Line (File, ""); Increment_Line; end; end loop; Templates.Transfer (File, Session_Name, Lineno); -- Generate a table containing a text string that describes every -- rule in the rule set of the grammar. This information is used -- when tracing REDUCE actions. J := 0; for Rule of Session.Rule loop pragma Assert (Rules."=" (Rule.Number, Rules.Rule_Number (J))); Put (File, " /* "); Put (File, Integer'Image (J)); Put (File, " */ """); Write_Rule_Text (File, Rule); Put_Line (File, ""","); Put_Line (File, ""); Increment_Line; end loop; end; Templates.Transfer (File, Session_Name, Lineno); -- Generate code which executes every time a symbol is popped from -- the stack while processing errors or while destroying the parser. -- (In other words, generate the %destructor actions) -- if( lemp->tokendest ){ -- int once = 1; -- for(i=0; i<lemp->nsymbol; i++){ -- struct symbol *sp = lemp->symbols[i]; -- if( sp==0 || sp->type!=TERMINAL ) continue; -- if( once ){ -- lime_put_line (" /* TERMINAL Destructor */"); -- once = 0; -- } -- lime_put (" case "); -- lime_put_int (sp->index); -- lime_put (": /* "); -- lime_put (sp->name); -- lime_put_line (" */"); -- } -- for(i=0; i<lemp->nsymbol && lemp->symbols[i]->type!=TERMINAL; i++); declare use Symbols; use Types; begin I := 0; loop exit when I >= Integer (Symbols.Last_Index); exit when Element_At (Symbol_Index (I)).Kind = Terminal; I := I + 1; end loop; -- I : Symbols.Symbol_Index; -- if( i<lemp->nsymbol ){ Emit_Destructor_Code (File, Lineno, Element_At (Symbol_Index (I)), Session); -- lime_put_line (" break;"); -- } end; -- } -- -- if( lemp->vardest ){ -- struct symbol *dflt_sp = 0; -- int once = 1; -- for(i=0; i<lemp->nsymbol; i++){ -- struct symbol *sp = lemp->symbols[i]; -- if( sp==0 || sp->type==TERMINAL || -- sp->index<=0 || sp->destructor!=0 ) continue; -- if( once ){ -- lime_put_line (" /* Default NON-TERMINAL Destructor */"); -- once = 0; -- } -- lime_put (" case "); -- lime_put_int (sp->index); -- lime_put (": /* "); -- lime_put (sp->name); -- lime_put_line (" */"); -- dflt_sp = sp; -- } -- if( dflt_sp!=0 ){ -- emit_destructor_code (dflt_sp, lemp); // , &lineno); -- } -- lime_put_line (" break;"); -- } -- for(i=0; i<lemp->nsymbol; i++){ -- struct symbol *sp = lemp->symbols[i]; -- if( sp==0 || sp->type==TERMINAL || sp->destructor==0 ) continue; -- if( sp->destLineno<0 ) continue; /* Already emitted */ -- -- lime_put (" case "); -- lime_put_int (sp->index); -- lime_put (": /* "); -- lime_put (sp->name); -- lime_put_line (" */"); -- -- /* Combine duplicate destructors into a single case */ -- for(j=i+1; j<lemp->nsymbol; j++){ -- struct symbol *sp2 = lemp->symbols[j]; -- if( sp2 && sp2->type!=TERMINAL && sp2->destructor -- && sp2->dtnum==sp->dtnum -- && strcmp(sp->destructor,sp2->destructor)==0 ) -- { -- lime_put (" case "); -- lime_put_int (sp2->index); -- lime_put (": /* "); -- lime_put (sp2->name); -- lime_put_line (" */"); -- sp2->destLineno = -1; /* Avoid emitting this destructor again */ -- } -- } -- -- emit_destructor_code (lemp->symbols[i], lemp); // , &lineno); -- lime_put_line (" break;"); -- } -- -- lime_template_transfer (lemp->name); -- -- /* Generate code which executes whenever the parser stack overflows */ -- lime_template_print (lemp->overflow, lemp->nolinenosflag, lemp->outname); -- //lime_template_print (lemp->overflow, lemp->nolinenosflag, lime_get_out_name ()); -- lime_template_transfer (lemp->name); -- Generate the tables of rule information. yyRuleInfoLhs[] and -- yyRuleInfoNRhs[]. -- -- Note: This code depends on the fact that rules are number -- sequentually beginning with 0. declare Index : Natural := 0; begin for Rule of Session.Rule loop Put (File, " "); Put (File, Symbol_Index'Image (Rule.LHS.Index)); Put (File, ", /* ("); Put (File, Natural'Image (I)); Put (File, ") "); Rule_Print (File, Rule); Put (File, " */"); Put_Line (File); Increment_Line; Index := Index + 1; end loop; end; Templates.Transfer (File, Session_Name, Lineno); -- -- for(i=0, rp=lemp->rule; rp; rp=rp->next, i++){ -- lime_put (" "); -- lime_put_int (-rp->nrhs); -- lime_put (", /* ("); -- lime_put_int (i); -- lime_put (") "); -- rule_print (file, rp); -- lime_put_line (" */"); -- } -- Templates.Transfer (File, Session_Name, Lineno); -- Generate code which execution during each REDUCE action Generate_Code_For_Reduce_Action : declare Total : Natural := 0; Length : Natural; begin for Rule of Session.Rule loop Translate_Code (Session, Rule, Length); Total := Total + Length; end loop; if Total /= 0 then Put_Line (File, " YYMINORTYPE yylhsminor;"); Increment_Line; end if; end Generate_Code_For_Reduce_Action; -- First output rules other than the default: rule for Rule of Session.Rule loop -- struct rule *rp2; /* Other rules with the same action */ -- if( rp->codeEmitted ) continue; -- if( rp->noCode ){ -- /* No C code actions, so this will be part of the "default:" rule */ -- continue; -- } -- lime_put (" case "); -- lime_put_int (rp->iRule); -- lime_put (": /* "); -- writeRuleText (rp); -- lime_put_line (" */"); -- -- for(rp2=rp->next; rp2; rp2=rp2->next){ -- if( rp2->code==rp->code && rp2->codePrefix==rp->codePrefix -- && rp2->codeSuffix==rp->codeSuffix ) -- { -- lime_put (" case "); -- lime_put_int (rp2->iRule); -- lime_put (": /* "); -- writeRuleText (rp2); -- lime_put (" */ yytestcase(yyruleno=="); -- lime_put_int (rp2->iRule); -- lime_put_line (");"); -- rp2->codeEmitted = 1; -- } -- } Emit_Code (Out_File, Rule, Session, Lineno); -- lime_put_line (" break;"); -- rp->codeEmitted = 1; end loop; -- -- /* Finally, output the default: rule. We choose as the default: all -- ** empty actions. */ -- lime_put_line (" default:"); -- for(rp=lemp->rule; rp; rp=rp->next){ -- if( rp->codeEmitted ) continue; -- assert( rp->noCode ); -- lime_put (" /* ("); -- lime_put_int (rp->iRule); -- lime_put (") "); -- writeRuleText (rp); -- if( rp->doesReduce ){ -- lime_put (" */ yytestcase(yyruleno=="); -- lime_put_int (rp->iRule); -- lime_put_line (");"); -- }else{ -- lime_put (" (OPTIMIZED OUT) */ assert(yyruleno!="); -- lime_put_int (rp->iRule); -- lime_put_line (");"); -- } -- } -- lime_put_line (" break;"); -- -- lime_template_transfer (lemp->name); -- -- /* Generate code which executes if a parse fails */ -- lime_template_print (lemp->failure, lemp->nolinenosflag, lemp->outname); -- //lime_template_print (lemp->failure, lemp->nolinenosflag, lime_get_out_name ()); -- lime_template_transfer (lemp->name); -- -- /* Generate code which executes when a syntax error occurs */ -- lime_template_print (lemp->error, lemp->nolinenosflag, lemp->outname); -- //lime_template_print (lemp->error, lemp->nolinenosflag, lime_get_out_name ()); -- lime_template_transfer (lemp->name); -- printf ("### 2-55\n"); -- -- /* Generate code which executes when the parser accepts its input */ -- lime_template_print (lemp->accept, lemp->nolinenosflag, lemp->outname); -- //lime_template_print (lemp->accept, lemp->nolinenosflag, lime_get_out_name ()); -- printf ("### 2-56\n"); -- -- lime_template_transfer (lemp->name); -- printf ("### 2-57\n"); -- -- /* Append any addition code the user desires */ -- lime_template_print (lemp->extracode, lemp->nolinenosflag, lemp->outname); -- //lime_template_print (lemp->extracode, lemp->nolinenosflag, lime_get_out_name ()); -- printf ("### 2-58\n"); -- Ada.Text_IO.Close (File_In); Close (Backend.Context.File_Template); -- Ada.Text_IO.Close (File_Out); if Generate_SQL then Close (SQL_File); end if; -- printf ("### 2-58\n"); end Report_Table; --------------------- -- Compress_Tables -- --------------------- procedure Compress_Tables (Session : in out Session_Type) is package Lists renames Action_Lists.Action_DLLs; use Lists; use Actions; use Rules.RHS_Vectors; use type Ada.Containers.Count_Type; use type Rule_Access; use type Symbol_Index; subtype Action_Cursor is Lists.Cursor; No_Element : Action_Cursor renames Lists.No_Element; Rule : Rule_Access; Rule_2 : Rule_Access; R_Best : Rule_Access; N_Best : Integer; N : Integer; Uses_Wildcard : Boolean; begin for State of Session.Sorted loop N_Best := 0; R_Best := null; Uses_Wildcard := False; declare Action_Cur : Action_Cursor; Action_Cur_2 : Action_Cursor; Action : Action_Record renames Lists.Element (Action_Cur); Action_2 : Action_Record renames Lists.Element (Action_Cur_2); begin Action_Cur := State.Action.First; while Action_Cur /= No_Element loop if Action.Kind = Shift and Action.Symbol = Session.Wildcard then Uses_Wildcard := True; end if; if Action.Kind /= Reduce then goto Continue_Outer; end if; Rule := Action.X.Rule; if Rule.LHS_Start then goto Continue_Outer; end if; if Rule = R_Best then goto Continue_Outer; end if; N := 1; Action_Cur_2 := Next (Action_Cur); while Action_Cur_2 /= No_Element loop if Action_2.Kind /= Reduce then goto Continue_Inner; end if; Rule_2 := Action_2.X.Rule; if Rule_2 = R_Best then goto Continue_Inner; end if; if Rule_2 = Rule then N := N + 1; end if; <<Continue_Inner>> Action_Cur_2 := Next (Action_Cur_2); end loop; if N > N_Best then N_Best := N; R_Best := Rule; end if; <<Continue_Outer>> Action_Cur := Next (Action_Cur); end loop; end; -- Do not make a default if the number of rules to default -- is not at least 1 or if the wildcard token is a possible -- lookahead. if N_Best < 1 or Uses_Wildcard then goto Outmost; end if; -- Combine matching REDUCE actions into a single default declare Action_Cur : Action_Cursor; Action : Action_Record renames Lists.Element (Action_Cur); begin Action_Cur := State.Action.First; while Action_Cur /= No_Element loop exit when Action.Kind = Reduce and Action.X.Rule = R_Best; Next (Action_Cur); end loop; pragma Assert (Action_Cur /= No_Element); -- Update Symbol declare Item : Action_Record := Action; begin Item.Symbol := Symbols.Create ("{default}"); State.Action.Replace_Element (Action_Cur, Item); end; Next (Action_Cur); while Action_Cur /= No_Element loop if Action.Kind = Reduce and Action.X.Rule = R_Best then declare Item : Action_Record := Action; begin Item.Kind := Not_Used; State.Action.Replace_Element (Action_Cur, Item); end; end if; Next (Action_Cur); end loop; Action_Lists.Sort (State.Action); end; declare Action_Cur : Action_Cursor; Action : Action_Record renames Lists.Element (Action_Cur); begin Action_Cur := State.Action.First; while Action_Cur /= No_Element loop exit when Action.Kind = Shift; exit when Action.Kind = Reduce and Action.X.Rule /= R_Best; Next (Action_Cur); end loop; if Action_Cur = No_Element then State.Auto_Reduce := True; State.Default_Reduce_Rule := R_Best; end if; end; <<Outmost>> null; end loop; -- Make a second pass over all states and actions. Convert -- every action that is a SHIFT to an autoReduce state into -- a SHIFTREDUCE action. for State of Session.Sorted loop declare Action_Cur : Action_Cursor; Action : Action_Record renames Lists.Element (Action_Cur); begin Action_Cur := State.Action.First; while Action_Cur /= No_Element loop if Action.Kind /= Shift then goto Local; end if; declare Next_State : constant State_Access := Action.X.State; begin if Next_State.Auto_Reduce and then Next_State.Default_Reduce_Rule /= null then declare Item : Action_Record := Action; begin Item.Kind := Shift_Reduce; Item.X.Rule := Next_State.Default_Reduce_Rule; State.Action.Replace_Element (Action_Cur, Item); end; end if; end; <<Local>> Next (Action_Cur); end loop; end; end loop; -- If a SHIFTREDUCE action specifies a rule that has a single RHS term -- (meaning that the SHIFTREDUCE will land back in the state where it -- started) and if there is no C-code associated with the reduce action, -- then we can go ahead and convert the action to be the same as the -- action for the RHS of the rule. for State of Session.Sorted loop declare Action_Cur : Action_Cursor; Action_Cur_2 : Action_Cursor; Action : Action_Record renames Lists.Element (Action_Cur); Action_2 : Action_Record renames Lists.Element (Action_Cur); Next_Action : Action_Cursor; begin Action_Cur := State.Action.First; while Action_Cur /= No_Element loop Next (Action_Cur); if Action.Kind /= Shift_Reduce then goto Looper; end if; Rule := Action.X.Rule; if Rule.No_Code = False then goto Looper; end if; if Length (Rule.RHS) /= 1 then goto Looper; end if; -- #if 1 -- Only apply this optimization to non-terminals. It would be OK to -- apply it to terminal symbols too, but that makes the parser tables -- larger. if Action.Symbol.Index < Session.Num_Terminal then goto Looper; end if; -- #endif -- If we reach this point, it means the optimization can be applied Next_Action := Action_Cur; Action_Cur_2 := State.Action.First; while Action_Cur_2 /= No_Element and then (Action_Cur_2 = Action_Cur or Action_2.Symbol /= Rule.LHS) loop Next (Action_Cur_2); end loop; pragma Assert (Action_Cur_2 /= No_Element); declare Item : Action_Record := Action; begin Item.Symbol_Link := Action_2.Symbol; Item.Kind := Action_2.Kind; Item.X := Action_2.X; State.Action.Replace_Element (Action_Cur, Item); end; <<Looper>> Action_Cur := Next_Action; end loop; end; end loop; end Compress_Tables; ------------------- -- Resort_States -- ------------------- -- lemon.c:4866 procedure Resort_States (Session : in out Session_Type) is use Sessions.State_Vectors; use type Sessions.State_Index; use type Action_Tables.Action_Value; subtype State_Index is Sessions.State_Index; Num_State : constant State_Index := State_Index (Length (Session.Sorted)); State : State_Access; -- Action : Action_Record; -- Access; begin for I in 0 .. Num_State - 1 loop State := Session.Sorted (I); State.Default_Reduce := States.Syntax_Error; State.Num_Token := (if State.Num_Nonterminal = 0 then 1 else 0); State.Token_Offset := Sessions.No_Offset; State.Nonterm_Offset := Sessions.No_Offset; for Action of State.Action loop declare I_Action : constant Integer := Action_Algorithms.Compute_Action (Session, Action); begin if I_Action >= 0 then if Action.Symbol.Index < Session.Num_Terminal then State.Num_Token := State.Num_Token + 1; elsif Action.Symbol.Index < Session.Num_Symbol then State.Num_Nonterminal := State.Num_Nonterminal + 1; else pragma Assert (not State.Auto_Reduce or else State.Default_Reduce_Rule = Action.X.Rule); State.Default_Reduce := (if I_Action /= 0 then States.True else States.False); end if; end if; end; -- Action := Action.Next; end loop; end loop; -- qsort(&lemp->sorted[1], lemp->nstate-1, sizeof(lemp->sorted[0]), -- stateResortCompare); for I in 0 .. Num_State - 1 loop Session.Sorted (I).Number := State_Number (I); end loop; Session.Num_X_State := Num_State; while Session.Num_X_State > 1 and Session.Sorted (Session.Num_X_State - 1).Auto_Reduce loop Session.Num_X_State := Session.Num_X_State - 1; end loop; end Resort_States; ---------------- -- Rule_Print -- ---------------- -- lemon.c:3157 - OVERLOADED procedure Rule_Print (File : File_Type; Rule : Rule_Access; Cursor : Dot_Type) is use Ada.Strings.Unbounded; use Symbols; use type Rules.Dot_Type; begin -- Print LHS Put (File, To_String (Rule.LHS.Name)); Put (File, " ::="); -- Print RHS for I in Rule.RHS.First_Index .. Rule.RHS.Last_Index loop if I = Cursor then Put (File, " *"); end if; exit when I = Rule.RHS.Last_Index; declare Symbol : constant Symbols.Symbol_Access := Symbol_Access (Rule.RHS.Element (I)); First : Boolean := True; begin if Symbol.Kind = Symbols.Multi_Terminal then Put (File, " "); for Sub_Symbol of Symbol.Sub_Symbol loop if not First then Put (File, "|"); end if; Put (File, To_String (Sub_Symbol.Name)); First := False; end loop; else Put (File, " "); Put (File, To_String (Symbol.Name)); end if; end; end loop; end Rule_Print; ------------------ -- Print_Action -- ------------------ procedure Print_Action (Action : Action_Record; File : File_Type; Indent : Natural; Emit : out Boolean) is use Actions; -- subtype Rule_Access is Rules.Rule_Access; subtype Rule_Number is Rules.Rule_Number; procedure Put_Indent (Item : String); function Name_Of (Symbol : Symbols.Symbol_Access) return String renames Symbols.Name_Of; procedure Put_Indent (Item : String) is Image : String (1 .. Indent) := (others => ' '); begin Image (Image'Last - Item'Length .. Image'Last) := Item; Put (File, Image); end Put_Indent; package Rule_IO is new Ada.Text_IO.Integer_IO (Rule_Number); package State_IO is new Ada.Text_IO.Integer_IO (State_Number); use Rule_IO, State_IO; Ignore : constant Dot_Type := Dot_Type'(Rules.Ignore); Symbol_Name : constant String := Name_Of (Action.Symbol); State_Num : constant State_Number := Action.X.State.Number; Rule : constant Rule_Access := Action.X.Rule; begin Rule_IO .Default_Width := 7; State_IO.Default_Width := 7; Emit := True; case Action.Kind is when Shift => Put_Indent (Symbol_Name); Put (File, " shift "); Put (File, State_Num); when Reduce => Put_Indent (Symbol_Name); Put (File, " reduce "); Put (File, Rule.Number); Rule_Print (File, Rule, Ignore); when Shift_Reduce => Put_Indent (Symbol_Name); Put (File, " shift-reduce "); Put (File, Rule.Number); Rule_Print (File, Rule, Ignore); when C_Accept => Put_Indent (Symbol_Name); Put (File, " accept"); when Error => Put_Indent (Symbol_Name); Put (File, " error"); when SR_Conflict | RR_Conflict => Put_Indent (Symbol_Name); Put (File, " reduce "); Put (File, Rule.Number); Put (File, " ** Parsing conflict **"); when SS_Conflict => Put_Indent (Symbol_Name); Put (File, " shift "); Put (File, Action.X.State.Number); Put (File, " ** Parsing conflict **"); when SH_Resolved => if Options.Show_Conflict then Put_Indent (Symbol_Name); Put (File, " shift "); Put (File, Action.X.State.Number); Put (File, " -- dropped by precedence"); else Emit := False; end if; when RD_Resolved => if Options.Show_Conflict then Put_Indent (Symbol_Name); Put (File, " reduce "); Put (File, Action.X.State.Number); Put (File, " -- dropped by precedence"); else Emit := False; end if; when Not_Used => Emit := False; end case; if Emit and Action.Symbol_Link /= null then Put (File, " /* because "); Put (File, Symbol_Name); Put (File, "=="); Put (File, Name_Of (Action.Symbol_Link)); Put (File, " */"); end if; end Print_Action; ------------------ -- Config_Print -- ------------------ procedure Config_Print (File : File_Type; Config : Config_Access) is begin Rule_Print (File, Config.Rule, Config.Dot); end Config_Print; ----------------------- -- Minimum_Size_Type -- ----------------------- function Minimum_Size_Type (LWS : in Offset_Type; UPR : in Offset_Type; PnBytes : out Integer) return String is pragma Unreferenced (LWS, UPR, PnBytes); begin -- static const char *minimum_size_type(int lwr, int upr, int *pnByte){ -- const char *zType = "int"; -- int nByte = 4; -- if( lwr>=0 ){ -- if( upr<=255 ){ -- zType = "unsigned char"; -- nByte = 1; -- }else if( upr<65535 ){ -- zType = "unsigned short int"; -- nByte = 2; -- }else{ -- zType = "unsigned int"; -- nByte = 4; -- } -- }else if( lwr>=-127 && upr<=127 ){ -- zType = "signed char"; -- nByte = 1; -- }else if( lwr>=-32767 && upr<32767 ){ -- zType = "short"; -- nByte = 2; -- } -- if( pnByte ) *pnByte = nByte; -- return zType; -- } return ""; end Minimum_Size_Type; ------------------- -- File_Makename -- ------------------- function File_Makename (Session : in Sessions.Session_Type; Extension : in String) return String is use Ada.Strings; use Ada.Strings.Unbounded; File_Name : constant String := To_String (Session.File_Name); Dot_Position : constant Natural := Fixed.Index (File_Name, ".", Backward); begin if Dot_Position = 0 then return File_Name & Extension; else return File_Name (File_Name'First .. Dot_Position) & Extension; end if; end File_Makename; --------------------- -- Write_Rule_Text -- --------------------- procedure Write_Rule_Text (File : File_Type; Rule : Rule_Access) is use Symbols; begin Put (File, Name_Of (Symbol_Access (Rule.LHS))); Put (File, " ::="); for Symbol of Rule.RHS loop Put (File, " "); if Symbol.Kind = Multi_Terminal then Put (File, Name_Of (Symbol.Sub_Symbol.First_Element)); for K in 1 .. Symbol.Sub_Symbol.Last_Index loop Put (File, "|"); Put (File, Name_Of (Symbol.Sub_Symbol.Element (K))); end loop; else Put (File, Name_Of (Symbol_Access (Symbol))); end if; end loop; end Write_Rule_Text; -------------------------- -- Emit_Destructor_Code -- -------------------------- procedure Emit_Destructor_Code (File : File_Type; Line : in out Line_Number; Symbol : Symbol_Access; Session : Session_Type) is use Ada.Strings.Unbounded; use type Symbols.Symbol_Kind; procedure Increment_Line is new Increment (Line); Item : access Unbounded_String; begin if Symbol.Kind = Symbols.Terminal then Item := Session.Names.Token_Dest'Access; if Item.all = Null_Unbounded_String then return; end if; Put_Line (File, "{"); Increment_Line; elsif Symbol.Destructor = Null_Unbounded_String then Item := Symbol.Destructor'Access; Put_Line (File, "{"); Increment_Line; if not Session.No_Linenos_Flag then Line := Line + 1; Templates.Line_Directive (File, Symbol.Dest_Lineno, To_String (Session.File_Name)); end if; elsif Session.Names.Var_Dest = Null_Unbounded_String then Item := Session.Names.Var_Dest'Access; if Item.all = Null_Unbounded_String then return; end if; Put_Line (File, "{"); Increment_Line; else pragma Assert (False); -- Cannot happen end if; for Index in 1 .. Length (Item.all) loop if Element (Item.all, Index + 0) = '$' and then Element (Item.all, Index + 1) = '$' then Put (File, "(yypminor->yy"); Put (File, Integer'Image (Symbol.DT_Num)); Put (File, ")"); else if Element (Item.all, Index) = ASCII.LF then Increment_Line; end if; Put (File, "" & Element (Item.all, Index)); end if; end loop; Put_Line (File, ""); Increment_Line; if not Session.No_Linenos_Flag then Increment_Line; Templates.Line_Directive (File, Line, To_String (Session.Out_Name)); end if; Put_Line (File, "}"); Increment_Line; end Emit_Destructor_Code; -------------------- -- Translate_Code -- -------------------- procedure Translate_Code (Session : Session_Type; Rule : Rule_Access; Length : out Natural) is begin null; -- PRIVATE int translate_code(struct lemon *lemp, struct rule *rp){ -- char *cp, *xp; -- int i; -- int rc = 0; /* True if yylhsminor is used */ -- int dontUseRhs0 = 0; /* If true, use of left-most RHS label is illegal */ -- const char *zSkip = 0; /* The zOvwrt comment within rp->code, or NULL */ -- char lhsused = 0; /* True if the LHS element has been used */ -- char lhsdirect; /* True if LHS writes directly into stack */ -- char used[MAXRHS]; /* True for each RHS element which is used */ -- char zLhs[50]; /* Convert the LHS symbol into this string */ -- char zOvwrt[900]; /* Comment that to allow LHS to overwrite RHS */ -- for(i=0; i<rp->nrhs; i++) used[i] = 0; -- lhsused = 0; -- if( rp->code==0 ){ -- static char newlinestr[2] = { '\n', '\0' }; -- rp->code = newlinestr; -- rp->line = rp->ruleline; -- rp->noCode = 1; -- }else{ -- rp->noCode = 0; -- } -- if( rp->nrhs==0 ){ -- /* If there are no RHS symbols, then writing directly to the LHS is ok */ -- lhsdirect = 1; -- }else if( rp->rhsalias[0]==0 ){ -- /* The left-most RHS symbol has no value. LHS direct is ok. But -- ** we have to call the distructor on the RHS symbol first. */ -- lhsdirect = 1; -- if( has_destructor(rp->rhs[0],lemp) ){ -- append_str(0,0,0,0); -- append_str(" yy_destructor(yypParser,%d,&yymsp[%d].minor);\n", 0, -- rp->rhs[0]->index,1-rp->nrhs); -- rp->codePrefix = Strsafe(append_str(0,0,0,0)); -- rp->noCode = 0; -- } -- }else if( rp->lhsalias==0 ){ -- /* There is no LHS value symbol. */ -- lhsdirect = 1; -- }else if( strcmp(rp->lhsalias,rp->rhsalias[0])==0 ){ -- /* The LHS symbol and the left-most RHS symbol are the same, so -- ** direct writing is allowed */ -- lhsdirect = 1; -- lhsused = 1; -- used[0] = 1; -- if( rp->lhs->dtnum!=rp->rhs[0]->dtnum ){ -- ErrorMsg(lemp->filename,rp->ruleline, -- "%s(%s) and %s(%s) share the same label but have " -- "different datatypes.", -- rp->lhs->name, rp->lhsalias, rp->rhs[0]->name, rp->rhsalias[0]); -- lemp->errorcnt++; -- } -- }else{ -- lemon_sprintf(zOvwrt, "/*%s-overwrites-%s*/", -- rp->lhsalias, rp->rhsalias[0]); -- zSkip = strstr(rp->code, zOvwrt); -- if( zSkip!=0 ){ -- /* The code contains a special comment that indicates that it is safe -- ** for the LHS label to overwrite left-most RHS label. */ -- lhsdirect = 1; -- }else{ -- lhsdirect = 0; -- } -- } -- if( lhsdirect ){ -- sprintf(zLhs, "yymsp[%d].minor.yy%d",1-rp->nrhs,rp->lhs->dtnum); -- }else{ -- rc = 1; -- sprintf(zLhs, "yylhsminor.yy%d",rp->lhs->dtnum); -- } -- append_str(0,0,0,0); -- /* This const cast is wrong but harmless, if we're careful. */ -- for(cp=(char *)rp->code; *cp; cp++){ -- if( cp==zSkip ){ -- append_str(zOvwrt,0,0,0); -- cp += lemonStrlen(zOvwrt)-1; -- dontUseRhs0 = 1; -- continue; -- } -- if( ISALPHA(*cp) && (cp==rp->code || (!ISALNUM(cp[-1]) && cp[-1]!='_')) ){ -- char saved; -- for(xp= &cp[1]; ISALNUM(*xp) || *xp=='_'; xp++); -- saved = *xp; -- *xp = 0; -- if( rp->lhsalias && strcmp(cp,rp->lhsalias)==0 ){ -- append_str(zLhs,0,0,0); -- cp = xp; -- lhsused = 1; -- }else{ -- for(i=0; i<rp->nrhs; i++){ -- if( rp->rhsalias[i] && strcmp(cp,rp->rhsalias[i])==0 ){ -- if( i==0 && dontUseRhs0 ){ -- ErrorMsg(lemp->filename,rp->ruleline, -- "Label %s used after '%s'.", -- rp->rhsalias[0], zOvwrt); -- lemp->errorcnt++; -- }else if( cp!=rp->code && cp[-1]=='@' ){ -- /* If the argument is of the form @X then substituted -- ** the token number of X, not the value of X */ -- append_str("yymsp[%d].major",-1,i-rp->nrhs+1,0); -- }else{ -- struct symbol *sp = rp->rhs[i]; -- int dtnum; -- if( sp->type==MULTITERMINAL ){ -- dtnum = sp->subsym[0]->dtnum; -- }else{ -- dtnum = sp->dtnum; -- } -- append_str("yymsp[%d].minor.yy%d",0,i-rp->nrhs+1, dtnum); -- } -- cp = xp; -- used[i] = 1; -- break; -- } -- } -- } -- *xp = saved; -- } -- append_str(cp, 1, 0, 0); -- } /* End loop */ -- /* Main code generation completed */ -- cp = append_str(0,0,0,0); -- if( cp && cp[0] ) rp->code = Strsafe(cp); -- append_str(0,0,0,0); -- /* Check to make sure the LHS has been used */ -- if( rp->lhsalias && !lhsused ){ -- ErrorMsg(lemp->filename,rp->ruleline, -- "Label \"%s\" for \"%s(%s)\" is never used.", -- rp->lhsalias,rp->lhs->name,rp->lhsalias); -- lemp->errorcnt++; -- } -- /* Generate destructor code for RHS minor values which are not referenced. -- ** Generate error messages for unused labels and duplicate labels. -- */ -- for(i=0; i<rp->nrhs; i++){ -- if( rp->rhsalias[i] ){ -- if( i>0 ){ -- int j; -- if( rp->lhsalias && strcmp(rp->lhsalias,rp->rhsalias[i])==0 ){ -- ErrorMsg(lemp->filename,rp->ruleline, -- "%s(%s) has the same label as the LHS but is not the left-most " -- "symbol on the RHS.", -- rp->rhs[i]->name, rp->rhsalias[i]); -- lemp->errorcnt++; -- } -- for(j=0; j<i; j++){ -- if( rp->rhsalias[j] && strcmp(rp->rhsalias[j],rp->rhsalias[i])==0 ){ -- ErrorMsg(lemp->filename,rp->ruleline, -- "Label %s used for multiple symbols on the RHS of a rule.", -- rp->rhsalias[i]); -- lemp->errorcnt++; -- break; -- } -- } -- } -- if( !used[i] ){ -- ErrorMsg(lemp->filename,rp->ruleline, -- "Label %s for \"%s(%s)\" is never used.", -- rp->rhsalias[i],rp->rhs[i]->name,rp->rhsalias[i]); -- lemp->errorcnt++; -- } -- }else if( i>0 && has_destructor(rp->rhs[i],lemp) ){ -- append_str(" yy_destructor(yypParser,%d,&yymsp[%d].minor);\n", 0, -- rp->rhs[i]->index,i-rp->nrhs+1); -- } -- } -- /* If unable to write LHS values directly into the stack, write the -- ** saved LHS value now. */ -- if( lhsdirect==0 ){ -- append_str(" yymsp[%d].minor.yy%d = ", 0, 1-rp->nrhs, rp->lhs->dtnum); -- append_str(zLhs, 0, 0, 0); -- append_str(";\n", 0, 0, 0); -- } -- /* Suffix code generation complete */ -- cp = append_str(0,0,0,0); -- if( cp && cp[0] ){ -- rp->codeSuffix = Strsafe(cp); -- rp->noCode = 0; -- } -- return rc; end Translate_Code; --------------- -- Emit_Code -- --------------- procedure Emit_Code (File : File_Type; Rule : Rule_Access; Session : Session_Type; Line : in out Line_Number) is use Ada.Strings.Unbounded; Code_Prefix : String renames To_String (Rule.Code_Prefix); Code : String renames To_String (Rule.Code); Code_Suffix : String renames To_String (Rule.Code_Suffix); begin -- Setup code prior to the #line directive if Code_Prefix /= "" then Put (File, "{"); Put (File, Code_Prefix); for Char of Code_Prefix loop if Char = ASCII.LF then Line := Line + 1; end if; end loop; end if; -- Generate code to do the reduce action if Code /= "" then if not Session.No_Linenos_Flag then Line := Line + 1; Templates.Line_Directive (File, Line, To_String (Session.File_Name)); end if; Put (File, "{"); Put (File, Code); for Char of Code loop if Char = ASCII.LF then Line := Line + 1; end if; end loop; Put_Line (File, "}"); Line := Line + 1; if not Session.No_Linenos_Flag then Line := Line + 1; Templates.Line_Directive (File, Line, To_String (Session.Out_Name)); end if; end if; -- Generate breakdown code that occurs after the #line directive if Code_Suffix /= "" then Put (File, Code_Suffix); for Char of Code_Suffix loop if Char = ASCII.LF then Line := Line + 1; end if; end loop; end if; if Code_Prefix /= "" then Put_Line (File, "}"); end if; end Emit_Code; ----------------------- -- Print_Stack_Union -- ----------------------- procedure Print_Stack_Union (File : File_Type; Line : in out Line_Number; Session : Session_Type; Make_Header : Boolean) is use Ada.Strings.Unbounded; use type Types.Symbol_Index; use type Symbol_Access; use type Symbols.Symbol_Kind; type String_Access is access String; type Type_Array is array (Long_Integer range <>) of String_Access; type Type_Array_Access is access all Type_Array; procedure Increment_Line is new Increment (Line); procedure Free is new Ada.Unchecked_Deallocation (Type_Array, Type_Array_Access); procedure Free is new Ada.Unchecked_Deallocation (String, String_Access); Types : Type_Array_Access; -- A hash table of datatypes Array_Size : Long_Integer; -- Size of the "types" array Max_DT_Length : Integer; -- Maximum length of any ".datatype" field. Std_DT : String_Access; -- Standardized name for a datatype J : Integer; -- Loop counters Hash : Long_Integer; -- For hashing the name of a type begin -- Allocate and initialize types[] and allocate stddt[] Array_Size := Long_Integer (Session.Num_Symbol * 2); Types := new Type_Array'(0 .. Array_Size - 1 => null); Max_DT_Length := 0; if Session.Names.Var_Type /= Null_Unbounded_String then Max_DT_Length := Length (Session.Names.Var_Type); end if; for I in 0 .. Session.Num_Symbol - 1 loop declare Symbol : constant Symbol_Access := Symbols.Element_At (I); begin if Symbol.Data_Type /= Null_Unbounded_String then Max_DT_Length := Integer'Max (Max_DT_Length, Length (Symbol.Data_Type)); end if; end; end loop; Std_DT := new String'(0 .. Max_DT_Length * 2 - 1 + 1 => ASCII.NUL); -- Build a hash table of datatypes. The ".dtnum" field of each symbol -- is filled in with the hash index plus 1. A ".dtnum" value of 0 is -- used for terminal symbols. If there is no %default_type defined -- then 0 is also used as the .dtnum value for nonterminals which do -- not specify a datatype using the %type directive. for I in 0 .. Session.Num_Symbol - 1 loop declare Symbol : constant Symbol_Access := Symbols.Element_At (I); begin if Symbol = Session.Error_Symbol then Symbol.DT_Num := Integer (Array_Size + 1); goto Continue; end if; if Symbol.Kind /= Symbols.Non_Terminal or (Symbol.Data_Type = Null_Unbounded_String and Session.Names.Var_Type = Null_Unbounded_String) then Symbol.DT_Num := 0; goto Continue; end if; declare Item : access Unbounded_String := Symbol.Data_Type'Access; Index : Natural := 1; -- Cp : Char_Access := Symbol.Data_Type; begin if Item.all = Null_Unbounded_String then Item := Session.Names.Var_Type'Access; end if; -- if Cp = 0 then -- Cp := Session.Names.Var_Type; -- end if; while Element (Item.all, Index) = ' ' loop Index := Index + 1; end loop; -- while IS_SPACE (Cp.all) loop -- Cp := Cp + 1; -- end loop; J := 0; -- while Cp.all loop while Index <= Length (Item.all) loop Std_DT (J) := Element (Item.all, Index); -- Cp.all; J := J + 1; -- Cp := Cp + 1; Index := Index + 1; end loop; end; while J > 0 and Std_DT (J - 1) = ' ' loop J := J - 1; end loop; Std_DT (J) := ASCII.NUL; if Session.Names.Token_Type /= Null_Unbounded_String and then Std_DT.all = To_String (Session.Names.Token_Type) then Symbol.DT_Num := 0; goto Continue; end if; Hash := 0; J := 0; while Std_DT (J) /= ASCII.NUL loop Hash := Hash * 53 + Character'Pos (Std_DT (J)); J := J + 1; end loop; Hash := (Hash mod 16#8000_0000#) mod Array_Size; while Types (Hash) /= null loop if Types (Hash) = Std_DT then Symbol.DT_Num := Integer (Hash + 1); exit; end if; Hash := Hash + 1; if Hash >= Array_Size then Hash := 0; end if; end loop; if Types (Hash) = null then Symbol.DT_Num := Integer (Hash + 1); Types (Hash) := new String'(0 .. Std_DT'Length + 1 - 1 => ASCII.NUL); Types (Hash) := Std_DT; end if; end; <<Continue>> end loop; -- Print out the definition of YYTOKENTYPE and YYMINORTYPE -- declare -- Name : constant String := -- (if Session.File_Name /= Null_Unbounded_String -- then To_String (Session.File_Name) -- else "Parse"); -- Token_Type : constant String := -- (if Session.Names.Token_Type /= Null_Unbounded_String -- then To_String (Session.Names.Token_Type) -- else "void*"); -- begin -- Write_Interface_begin (File, Name, Token_Type, Line); -- end; declare Name : constant String := (if Session.File_Name /= Null_Unbounded_String then To_String (Session.File_Name) else "Parse"); begin Write_Interface_Begin (File, Line, Make_Header); Put (File, "#define "); Put (File, Name); Put (File, "TOKENTYPE "); Put_Line (File, (if Session.Names.Token_Type /= Null_Unbounded_String then To_String (Session.Names.Token_Type) else "void*")); Increment_Line; Write_Interface_End (File, Line, Make_Header); Put_Line (File, "typedef union {"); Increment_Line; Put_Line (File, " int yyinit;"); Increment_Line; Put (File, " "); Put (File, Name); Put_Line (File, "TOKENTYPE yy0;"); Increment_Line; end; for I in 0 .. Array_Size - 1 loop if Types (I) /= null then Put (File, " "); Put (File, Types (I).all); Put (File, " yy"); Put (File, Long_Integer'Image (I + 1)); Put_Line (File, ";"); Increment_Line; Free (Types (I)); end if; end loop; if Session.Error_Symbol /= null and then Session.Error_Symbol.Use_Count /= 0 then Put (File, " int yy"); Put (File, Integer'Image (Session.Error_Symbol.DT_Num)); Put_Line (File, ";"); Increment_Line; end if; Free (Std_DT); Free (Types); Put_Line (File, "} YYMINORTYPE;"); Increment_Line; end Print_Stack_Union; ---------------- -- Rule_Print -- ---------------- -- lemon.c:3101 - OVERLOADED procedure Rule_Print (File : File_Type; Rule : Rule_Access) is use Ada.Strings.Unbounded; use Symbols; use type Rules.Dot_Type; begin -- Print LHS Put (File, To_String (Rule.LHS.Name)); Put (File, " ::="); -- This part is uncommented in lemon.c -- Print LHS alias -- if False then -- if Rule.LHS_Alias /= Null_Unbounded_String then -- Put (File, "("); -- Put (File, To_String (Rule.LHS_Alias)); -- Put (File, ")"); -- end if; -- end if; -- Print RHS for I in Rule.RHS.First_Index .. Rule.RHS.Last_Index loop exit when I = Rule.RHS.Last_Index; declare Symbol : constant Symbols.Symbol_Access := Symbol_Access (Rule.RHS.Element (I)); First : Boolean := True; begin if Symbol.Kind = Symbols.Multi_Terminal then Put (File, " "); for Sub_Symbol of Symbol.Sub_Symbol loop if not First then Put (File, "|"); end if; Put (File, To_String (Sub_Symbol.Name)); First := False; end loop; else Put (File, " "); Put (File, To_String (Symbol.Name)); end if; -- This part is uncommented i lemon.c -- if Rule.RHS_Alias.Element (I) /= Null_Unbounded_String then -- Put (File, "("); -- Put (File, To_String (Rule.RHS_Alias.Element (I))); -- Put (File, ")"); -- end if; end; end loop; end Rule_Print; --------------------- -- Generate_Tokens -- --------------------- procedure Generate_Tokens (Session : in Session_Type; Token_Prefix : in String; First : in Integer; Last : in Integer) is File : File_Type renames Ada.Text_IO.Standard_Output; Line : Types.Line_Number := 0; pragma Unreferenced (Session); function Get_Prefix return String; procedure Increment_Line is new Increment (Line); function Get_Prefix return String is begin if Token_Prefix /= "" then return Token_Prefix; else return ""; end if; end Get_Prefix; use Symbols; use Types; Prefix : constant String := Get_Prefix; begin if Options.Make_Headers then -- const char *prefix; */ Put_Line (File, "#if INTERFACE"); Increment_Line; for I in First .. Last loop -- Put_Line (Context.File_Implementation, -- "#define " & -- Value (Prefix) & -- Value (Get_Token_Callback (I)) & -- " " & Integer'Image (I)); -- Line_Number := Line_Number + 1; Put (File, "#define "); Put (File, Prefix); -- Put_CP (Get_Token_Callback (I)); -- return lime_lemp_copy->symbols[index]->name; Put (File, Name_Of (Element_At (Symbol_Index (I)))); Put (File, " "); Put (File, Integer'Image (I)); Put_Line (File, ""); Increment_Line; end loop; Put_Line (File, "#endif"); Increment_Line; end if; end Generate_Tokens; ---------------------- -- Render_Constants -- ---------------------- procedure Render_Constants (File : File_Type; Render : Render_Record; Line : in out Line_Number) is procedure Put (Item : in String; Value : in Integer); procedure Put (Item : in String; Value : in Action_Value); procedure Put (Item : in String; Value : in Integer) is begin Put (File, Item); Put (File, Integer'Image (Value)); Put_Line (File, ""); Line := Line + 1; end Put; procedure Put (Item : in String; Value : in Action_Value) is begin Put (Item, Integer (Value)); end Put; I : Integer; begin Put ("#define YYNSTATE ", Render.Nx_State); Put ("#define YYNRULE ", Render.N_Rule); Put ("#define YYNRULE_WITH_ACTION ", Render.Num_Rule_With_Action); Put ("#define YYNTOKEN ", Render.N_Terminal); Put ("#define YY_MAX_SHIFT ", Render.Nx_State - 1); I := Integer (Render.Min_Shift_Reduce); Put ("#define YY_MIN_SHIFTREDUCE ", I); I := I + Render.N_Rule; Put ("#define YY_MAX_SHIFTREDUCE ", I - 1); Put ("#define YY_ERROR_ACTION ", Render.Err_Action); Put ("#define YY_ACCEPT_ACTION ", Render.Acc_Action); Put ("#define YY_NO_ACTION ", Render.No_Action); Put ("#define YY_MIN_REDUCE ", Render.Min_Reduce); I := Integer (Render.Min_Reduce) + Render.N_Rule; Put ("#define YY_MAX_REDUCE ", I - 1); end Render_Constants; function Image is new Auxiliary.Trim_Image (Integer); function Image is new Auxiliary.Trim_Image (Offset_Type); function Image is new Auxiliary.Trim_Image (Action_Value); ------------------------- -- Output_Action_Table -- ------------------------- -- lemon.c:4377 procedure Output_Action_Table (File : File_Type; Table : Action_Table; N : Integer; No_Action : Action_Value; Line : in out Line_Number) is use type Action_Tables.Action_Value; procedure Increment_Line is new Increment (Line); J : Integer; Action : Action_Tables.Action_Value; begin Put_Line (File, "#define YY_ACTTAB_COUNT (" & Image (N) & ")"); Increment_Line; Put_Line (File, "static const YYACTIONTYPE yy_action[] = {"); Increment_Line; J := 0; for I in 0 .. N - 1 loop -- #define acttab_yyaction(X,N) ((X)->aAction[N].action) -- return acttab_yyaction (lime_pActtab, i); -- struct acttab *lime_pActtab; -- Action := Get_Acttab_YY_Action (I); Action := Table.Action (I).Action; if Action < 0 then Action := No_Action; end if; if J = 0 then Put (File, " /* "); Put (File, Image (I)); Put (File, " */ "); end if; Put (File, " "); Put (File, Image (Integer (Action))); Put (File, ","); if J = 9 or I = N - 1 then Put_Line (File, ""); Increment_Line; J := 0; else J := J + 1; end if; end loop; Put_Line (File, "};"); Increment_Line; end Output_Action_Table; ------------------------- -- Output_YY_lookahead -- ------------------------- -- procedure Output_YY_Lookahead -- (File : File_Type; -- Table : Action_Table; -- N : Integer; -- Nsymbol : Integer; -- Line : in out Line_Number) -- is -- use type Action_Tables.Action_Value; -- procedure Increment_Line is new Increment (Line); -- LA : Action_Value; -- J : Integer := 0; -- begin -- Put_Line (File, "static const YYCODETYPE yy_lookahead[] = {"); Increment_Line; -- for I in 0 .. N - 1 loop -- -- LA := Get_Acttab_YY_Lookahead (I); -- LA := Table.Lookahead (I).Action; -- if LA < 0 then -- LA := Action_Value (Nsymbol); -- end if; -- if J = 0 then -- Put (File, " /* "); -- Put (File, Image (I)); -- Put (File, " */ "); -- end if; -- Put (File, " "); -- Put (File, Image (Integer (LA))); -- Put (File, ","); -- if J = 9 or I = N - 1 then -- Put_Line (File); Increment_Line; -- J := 0; -- else -- J := J + 1; -- end if; -- end loop; -- Put_Line (File, "};"); Increment_Line; -- end Output_YY_Lookahead; ----------------------------- -- Output_YY_Shift_Offsets -- ----------------------------- -- lemon.c:4414 procedure Output_YY_Shift_Offsets (File : File_Type; Session : Session_Type; N : Integer; MnTknOfst : Offset_Type; MxTknOfst : Offset_Type; Min_Size_Type : String; Nactiontab : Integer; No_Offset : Offset_Type; Line : in out Line_Number) is use type Offset_Type; procedure Increment_Line is new Increment (Line); Offset : Offset_Type; J : Integer := 0; begin Put (File, "#define YY_SHIFT_COUNT ("); Put (File, Image (N - 1)); Put_Line (File, ")"); Increment_Line; Put (File, "#define YY_SHIFT_MIN ("); Put (File, Image (MnTknOfst)); Put_Line (File, ")"); Increment_Line; Put (File, "#define YY_SHIFT_MAX ("); Put (File, Image (MxTknOfst)); Put_Line (File, ")"); Increment_Line; Put (File, "static const "); Put (File, Min_Size_Type); Put (File, " yy_shift_ofst[] = {"); Put_Line (File); Increment_Line; -- lemp->tablesize += n*sz; for I in 0 .. N - 1 loop declare use Sessions; State : access States.State_Record; begin State := Session.Sorted (State_Index (I)); Offset := State.Token_Offset; end; if Offset = No_Offset then Offset := Offset_Type (Nactiontab); end if; if J = 0 then Put (File, " /* "); Put (File, Image (I)); Put (File, " */ "); end if; Put (File, " "); Put (File, Image (Offset)); Put (File, ","); if J = 9 or I = N - 1 then Put_Line (File); Increment_Line; J := 0; else J := J + 1; end if; end loop; Put_Line (File, "};"); Increment_Line; end Output_YY_Shift_Offsets; ------------------------------ -- Output_YY_Reduce_Offsets -- ------------------------------ -- lemon.c:4440 procedure Output_YY_Reduce_Offsets (File : File_Type; Session : Session_Type; N : Integer; MnNtOfst : Offset_Type; MxNtOfst : Offset_Type; Min_Size_Type : String; No_Offset : Offset_Type; Line : in out Line_Number) is use type Offset_Type; procedure Increment_Line is new Increment (Line); J : Integer := 0; Offset : Offset_Type; begin Put (File, "#define YY_REDUCE_COUNT ("); Put (File, Image (N - 1)); Put_Line (File, ")"); Increment_Line; Put (File, "#define YY_REDUCE_MIN ("); Put (File, Image (MnNtOfst)); Put_Line (File, ")"); Increment_Line; Put (File, "#define YY_REDUCE_MAX ("); Put (File, Image (MxNtOfst)); Put_Line (File, ")"); Increment_Line; Put (File, "static const "); Put (File, Min_Size_Type); Put (File, " yy_reduce_ofst[] = {"); Put_Line (File); Increment_Line; -- lemp->tablesize += n*sz; for I in 0 .. N - 1 loop declare State : access States.State_Record; begin State := Session.Sorted (Sessions.State_Index (I)); Offset := State.Nonterm_Offset; end; if Offset = No_Offset then Offset := Offset_Type (MnNtOfst - 1); end if; if J = 0 then Put (File, " /* "); Put (File, Image (I)); Put (File, " */ "); end if; Put (File, " "); Put (File, Image (Offset)); Put (File, ","); if J = 9 or I = N - 1 then Put_Line (File); Increment_Line; J := 0; else J := J + 1; end if; end loop; Put_Line (File, "};"); Increment_Line; end Output_YY_Reduce_Offsets; --------------------------------- -- Output_Default_Action_Table -- --------------------------------- -- lemon.c:4465 procedure Output_Default_Action_Table (File : File_Type; Session : Session_Type; N : Integer; Error_Action : Action_Value; Min_Reduce : Action_Value; Line : in out Line_Number) is Num_Column : constant := 8; type Column_Range is mod Num_Column; Column : Column_Range := Column_Range'First; procedure Increment_Line is new Increment (Line); begin Put_Line (File, "static const YYACTIONTYPE yy_default[] = {"); Increment_Line; for I in 0 .. N - 1 loop declare use States; State : constant access States.State_Record := Session.Sorted (Sessions.State_Index (I)); begin if Column = Column_Range'First then Put (File, " /* "); Put (File, Image (I)); Put (File, " */ "); end if; Put (File, " "); if State.Default_Reduce = True then Put (File, Image (Error_Action)); else declare Auto_State : constant Integer := (case State.Default_Reduce is when Syntax_Error => -1, when False => 0, when True => 1); Reduce : constant Integer := Integer (Min_Reduce); State_Reduce : constant Integer := Auto_State + Reduce; begin Put (File, Image (State_Reduce)); end; end if; Put (File, ","); end; if Column = Column_Range'Last or I = N - 1 then Put_Line (File); Increment_Line; end if; Column := Column + 1; end loop; Put_Line (File, "};"); Increment_Line; end Output_Default_Action_Table; -- procedure Template_Print_2 -- (Line : in String; -- No_Line_Nos : in Integer; -- -- Line_Number : in Line_Number_Index; -- Out_Name : in String) -- is -- -- pragma Unreferenced (Out_Name); -- begin -- if Line = "" then -- Ada.Text_IO.Put_Line ("RETURN"); -- return; -- end if; -- Text_Out.Put_Line (Line); -- -- XXX mystisk kode -- -- if( str[-1]!='\n' ){ -- -- putc('\n',out); -- -- (*lineno)++; -- -- } -- Ada.Text_IO.Put ("WLD - "); -- if No_Line_Nos /= 1 then -- Ada.Text_IO.Put_Line ("2"); -- -- (*lineno)++; tplt_linedir(out,*lineno,lemp->outname); -- -- Write_Line_Directive (Line_Number, Out_Name); -- -- Write_Line_Directive (0, Out_Name); -- Text_Out.Put_Line_Directive (Out_Name); -- end if; -- end Template_Print_2; ----------------------- -- Write_Arg_Defines -- ----------------------- procedure Write_Arg_Defines (File : File_Type; Name : String; Arg_Ctx : String; Extend : Boolean; Arg : String; Arg_I : String; Line : in out Line_Number) is procedure Increment_Line is new Increment (Line); procedure Write (Decl : in String); procedure Write (Decl : in String) is begin Put (File, "#define "); Put (File, Name); Put (File, Arg_Ctx); Put (File, Decl); Put (File, Arg); Put (File, ";"); Put_Line (File); Increment_Line; end Write; begin Write ("_SDECL "); Write ("_PDECL ,"); Write ("_PARAM ,"); if Extend = False then Put (File, "#define "); Put (File, Name); Put (File, "_FETCH "); Put (File, Arg); Put (File, "=yypParser->"); Put (File, Arg_I); Put_Line (File, ";"); Increment_Line; Put (File, "#define "); Put (File, Name); Put (File, "_STORE "); Put (File, Arg_I); Put (File, "=yypParser->"); Put (File, Arg_I); Put_Line (File, ";"); Increment_Line; else Write ("_FETCH "); Write ("_STORE "); end if; end Write_Arg_Defines; --------------------- -- Write_Interface -- --------------------- procedure Write_Interface (File : File_Type; Name : String; Tokentype : String; Line : in out Line_Number) is begin if Options.Make_Headers then Put_Line (File, "#if INTERFACE"); Line := Line + 1; end if; Put (File, "#define "); Put (File, Name); Put (File, "TOKENTYPE "); Put (File, Tokentype); Put_Line (File); Line := Line + 1; if Options.Make_Headers then Put_Line (File, "#endif"); Line := Line + 1; end if; end Write_Interface; --------------------------- -- Write_Interface_Begin -- --------------------------- procedure Write_Interface_Begin (File : File_Type; Line : in out Line_Number; Make_Header : Boolean) is begin if Make_Header then Put_Line (File, "#if INTERFACE"); Line := Line + 1; end if; end Write_Interface_Begin; ------------------------- -- Write_Interface_End -- ------------------------- procedure Write_Interface_End (File : File_Type; Line : in out Line_Number; Make_Header : Boolean) is begin if Make_Header then Put_Line (File, "#endif"); Line := Line + 1; end if; end Write_Interface_End; ------------------- -- Report_Header -- ------------------- procedure Report_Header (Session : Session_Type; Token_Prefix : String; Base_Name : String; Module_Name : String; Terminal_Last : Natural) is Prefix : constant String := Token_Prefix; begin if not Options.Make_Headers then return; end if; -- if Token_Prefix = Null_Ptr then -- Prefix := New_String (""); -- end if; -- Generate parse.h.ads Generate_Spec (Session, Base_Name, Prefix, Module_Name, First => 1, Last => Terminal_Last); end Report_Header; ------------------- -- Generate_Spec -- ------------------- procedure Generate_Spec (Session : Session_Type; Base_Name : String; Prefix : String; Module : String; First : Integer; Last : Integer) is use Backend; begin case Options.Language is when Options.Language_Ada => Generate_Ada.Generate_Spec (Context => Context, Base_Name => Base_Name, Module => Module, Prefix => Prefix, First => First, Last => Last); when Options.Language_C => Generate_C.Generate_Spec (Session => Session, Context => Context, File_Name => Base_Name, Module => Module, Prefix => Prefix, First => First, Last => Last); end case; end Generate_Spec; ------------------- -- Write_Include -- ------------------- procedure Write_Include (File : File_Type; Line : in out Line_Number; Include_Name : String) is begin if Options.Make_Headers then Put (File, "#include <"); Put (File, Include_Name); Put_Line (File, ">;"); Line := Line + 1; end if; end Write_Include; ---------------------------- -- Generate_The_Defines_1 -- ---------------------------- procedure Generate_The_Defines_1 (File : File_Type; Line : in out Line_Number; YY_Code_Type : String; Symbol_Count : Symbol_Index; YY_Action_Type : String; Is_Wildcard : Boolean; Wildcard_Index : Symbol_Index) is procedure Increment_Line is new Increment (Line); begin Put (File, "#define YYCODETYPE "); Put (File, YY_Code_Type); Put_Line (File); Increment_Line; Put (File, "#define YYNOCODE "); Put (File, Symbol_Index'Image (Symbol_Count)); Put_Line (File); Increment_Line; Put (File, "#define YYACTIONTYPE "); Put (File, YY_Action_Type); Put_Line (File); Increment_Line; if Is_Wildcard then Put (File, "#define YYWILDCARD "); Put (File, Symbol_Index'Image (Wildcard_Index)); Put_Line (File); Increment_Line; end if; end Generate_The_Defines_1; ---------------------------- -- Generate_The_Defines_2 -- ---------------------------- procedure Generate_The_Defines_2 (File : File_Type; Line : in out Line_Number; Stack_Size : String) is procedure Increment_Line is new Increment (Line); begin Put_Line (File, "#ifndef YYSTACKDEPTH"); Increment_Line; if Stack_Size /= "" then Put (File, "#define YYSTACKDEPTH "); Put (File, Stack_Size); Put_Line (File); Increment_Line; else Put_Line (File, "#define YYSTACKDEPTH 100"); Increment_Line; end if; Put_Line (File, "#endif"); Increment_Line; end Generate_The_Defines_2; -------------------- -- Error_Fallback -- -------------------- procedure Error_Fallback (File : File_Type; Line : in out Line_Number; Error_Sym : String; Struct : Mystruct_Record; Has_Fallback : Boolean) is procedure Increment_Line is new Increment (Line); begin if Error_Sym /= "" and Struct.Use_Count /= 0 then Put (File, "#define YYERRORSYMBOL "); Put (File, Symbol_Index'Image (Struct.Index)); Put_Line (File); Increment_Line; Put (File, "#define YYERRSYMDT yy"); Put (File, Integer'Image (Struct.DT_Num)); Put_Line (File); Increment_Line; end if; if Has_Fallback then Put_Line (File, "#define YYFALLBACK 1"); Increment_Line; end if; end Error_Fallback; end Reports;

32.416962

96

0.507726

3de3c9ab3f424f4cf8a5fe8eda58ea8bf696d98c

9,782

adb

Ada

awa/regtests/awa-commands-tests.adb

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

81

2015-01-18T23:02:30.000Z

2022-03-19T17:34:57.000Z

awa/regtests/awa-commands-tests.adb

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

20

2015-12-09T19:26:19.000Z

2022-03-23T14:32:43.000Z

awa/regtests/awa-commands-tests.adb

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

16

2015-06-29T02:44:06.000Z

2021-09-23T18:47:50.000Z

----------------------------------------------------------------------- -- awa-commands-tests -- Test the AWA.Commands -- Copyright (C) 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.Text_IO; with Util.Processes; with Util.Streams.Pipes; with Util.Streams.Buffered; with Util.Test_Caller; with Util.Log.Loggers; package body AWA.Commands.Tests is Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("AWA.Commands.Tests"); package Caller is new Util.Test_Caller (Test, "Commands"); procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite) is begin Caller.Add_Test (Suite, "Test AWA.Commands.Start_Stop", Test_Start_Stop'Access); Caller.Add_Test (Suite, "Test AWA.Commands.List (tables)", Test_List_Tables'Access); Caller.Add_Test (Suite, "Test AWA.Commands.List (users)", Test_List_Users'Access); Caller.Add_Test (Suite, "Test AWA.Commands.List (sessions)", Test_List_Sessions'Access); Caller.Add_Test (Suite, "Test AWA.Commands.List (jobs)", Test_List_Jobs'Access); Caller.Add_Test (Suite, "Test AWA.Commands.Info (secure configuration 1)", Test_Secure_Configuration'Access); Caller.Add_Test (Suite, "Test AWA.Commands.Info (secure configuration 2)", Test_Secure_Configuration_2'Access); Caller.Add_Test (Suite, "Test AWA.Commands.Info (verbose)", Test_Verbose_Command'Access); end Add_Tests; -- ------------------------------ -- Execute the command and get the output in a string. -- ------------------------------ procedure Execute (T : in out Test; Command : in String; Input : in String; Output : in String; Result : out Ada.Strings.Unbounded.Unbounded_String; Status : in Natural := 0) is P : aliased Util.Streams.Pipes.Pipe_Stream; Buffer : Util.Streams.Buffered.Input_Buffer_Stream; begin if Input'Length > 0 then Log.Info ("Execute: {0} < {1}", Command, Input); elsif Output'Length > 0 then Log.Info ("Execute: {0} > {1}", Command, Output); else Log.Info ("Execute: {0}", Command); end if; P.Set_Input_Stream (Input); P.Set_Output_Stream (Output); P.Open (Command, Util.Processes.READ_ALL); -- Write on the process input stream. Result := Ada.Strings.Unbounded.Null_Unbounded_String; Buffer.Initialize (P'Unchecked_Access, 8192); Buffer.Read (Result); P.Close; Ada.Text_IO.Put_Line (Ada.Strings.Unbounded.To_String (Result)); Log.Info ("Command result: {0}", Result); Util.Tests.Assert_Equals (T, Status, P.Get_Exit_Status, "Command '" & Command & "' failed"); end Execute; -- ------------------------------ -- Test start and stop command. -- ------------------------------ procedure Test_Start_Stop (T : in out Test) is Config : constant String := Util.Tests.Get_Parameter ("test_config_path"); task Start_Server is entry Start; entry Wait (Result : out Ada.Strings.Unbounded.Unbounded_String); end Start_Server; task body Start_Server is Output : Ada.Strings.Unbounded.Unbounded_String; begin accept Start do null; end Start; begin T.Execute ("bin/awa_command -c " & Config & " start -m 26123", "", "", Output, 0); exception when others => Output := Ada.Strings.Unbounded.To_Unbounded_String ("* exception *"); end; accept Wait (Result : out Ada.Strings.Unbounded.Unbounded_String) do Result := Output; end Wait; end Start_Server; Result : Ada.Strings.Unbounded.Unbounded_String; begin -- Launch the 'start' command in a separate task because the command will hang. Start_Server.Start; delay 5.0; -- Launch the 'stop' command, this should terminate the 'start' command. T.Execute ("bin/awa_command -c " & Config & " stop -m 26123", "", "", Result, 0); -- Wait for the task result. Start_Server.Wait (Result); Util.Tests.Assert_Matches (T, "Starting...", Result, "AWA start command output"); end Test_Start_Stop; procedure Test_List_Tables (T : in out Test) is Config : constant String := Util.Tests.Get_Parameter ("test_config_path"); Result : Ada.Strings.Unbounded.Unbounded_String; begin T.Execute ("bin/awa_command -c " & Config & " list -t", "", "", Result, 0); Util.Tests.Assert_Matches (T, "awa_audit *[0-9]+", Result, "Missing awa_audit"); Util.Tests.Assert_Matches (T, "awa_session *[0-9]+", Result, "Missing awa_session"); Util.Tests.Assert_Matches (T, "entity_type *[0-9]+", Result, "Missing entity_type"); Util.Tests.Assert_Matches (T, "awa_wiki_page *[0-9]+", Result, "Missing awa_wiki_page"); end Test_List_Tables; -- ------------------------------ -- Test the list -u command. -- ------------------------------ procedure Test_List_Users (T : in out Test) is Config : constant String := Util.Tests.Get_Parameter ("test_config_path"); Result : Ada.Strings.Unbounded.Unbounded_String; begin T.Execute ("bin/awa_command -c " & Config & " list -u", "", "", Result, 0); Util.Tests.Assert_Matches (T, "Joe Pot", Result, "Missing user"); Util.Tests.Assert_Matches (T, "[email protected]", Result, "Missing email"); end Test_List_Users; -- ------------------------------ -- Test the list -s command. -- ------------------------------ procedure Test_List_Sessions (T : in out Test) is Config : constant String := Util.Tests.Get_Parameter ("test_config_path"); Result : Ada.Strings.Unbounded.Unbounded_String; begin T.Execute ("bin/awa_command -c " & Config & " list -s", "", "", Result, 0); Util.Tests.Assert_Matches (T, "Joe Pot", Result, "Missing user"); end Test_List_Sessions; -- ------------------------------ -- Test the list -j command. -- ------------------------------ procedure Test_List_Jobs (T : in out Test) is Config : constant String := Util.Tests.Get_Parameter ("test_config_path"); Result : Ada.Strings.Unbounded.Unbounded_String; begin T.Execute ("bin/awa_command -c " & Config & " list -j", "", "", Result, 0); Util.Tests.Assert_Matches (T, "S_FACTORY", Result, "Missing factory"); Util.Tests.Assert_Matches (T, "Joe Pot", Result, "Missing user"); end Test_List_Jobs; -- ------------------------------ -- Test the command with a secure keystore configuration. -- ------------------------------ procedure Test_Secure_Configuration (T : in out Test) is Config : constant String := Util.Tests.Get_Parameter ("test_config_path"); Keystore : constant String := Util.Tests.Get_Parameter ("test_keystore_file"); Result : Ada.Strings.Unbounded.Unbounded_String; begin T.Execute ("bin/awa_command -c " & Config & " info --keystore " & Keystore & " --password=unit-test-password", "", "", Result, 0); Util.Tests.Assert_Matches (T, "app_name *AWA Secure Demo", Result, "Secure property not accessed"); end Test_Secure_Configuration; -- ------------------------------ -- Test the command with a secure keystore configuration. -- ------------------------------ procedure Test_Secure_Configuration_2 (T : in out Test) is Config : constant String := Util.Tests.Get_Parameter ("test_secure_config_path"); Result : Ada.Strings.Unbounded.Unbounded_String; begin T.Execute ("bin/awa_command -c " & Config & " info", "", "", Result, 0); Util.Tests.Assert_Matches (T, "app_name *AWA Secure Demo", Result, "Secure property not accessed"); Util.Tests.Assert_Matches (T, "users.auth_key *auth-", Result, "Secure property not accessed"); Util.Tests.Assert_Matches (T, "users.server_id *[123]0", Result, "Secure property not accessed"); end Test_Secure_Configuration_2; -- ------------------------------ -- Test the command with various logging options. -- ------------------------------ procedure Test_Verbose_Command (T : in out Test) is Config : constant String := Util.Tests.Get_Parameter ("test_config_path"); Result : Ada.Strings.Unbounded.Unbounded_String; begin T.Execute ("bin/awa_command -v -c " & Config & " info ", "", "", Result, 0); Util.Tests.Assert_Matches (T, "INFO : Using application search dir:", Result, "Missing log message"); end Test_Verbose_Command; end AWA.Commands.Tests;

43.865471

98

0.580658

2250aa5e2cd7c208a387ecf73d56471a3ea12cd3

57

ads

Ada

math_2d.ads

io7m/coreland-math_2d

0a6e57e6eac8aa2b19c50c0de3ea23c3bc78c4f9

[ "0BSD" ]

1

2017-10-07T05:53:58.000Z

math_2d.ads

io7m/coreland-math_2d

0a6e57e6eac8aa2b19c50c0de3ea23c3bc78c4f9

[ "0BSD" ]

null

math_2d.ads

io7m/coreland-math_2d

0a6e57e6eac8aa2b19c50c0de3ea23c3bc78c4f9

[ "0BSD" ]

null

package Math_2D is pragma Pure (Math_2D); end Math_2D;

14.25

24

0.754386

4d0ed07208bc2afa32cf6d486c8e54f08e993d05

57

ads

Ada

specs/ada/common/tkmrpc-response-ike.ads

DrenfongWong/tkm-rpc

075d22871cf81d497aac656c7f03a513278b641c

[ "BSD-3-Clause" ]

null

specs/ada/common/tkmrpc-response-ike.ads

DrenfongWong/tkm-rpc

075d22871cf81d497aac656c7f03a513278b641c

[ "BSD-3-Clause" ]

null

specs/ada/common/tkmrpc-response-ike.ads

DrenfongWong/tkm-rpc

075d22871cf81d497aac656c7f03a513278b641c

[ "BSD-3-Clause" ]

null

package Tkmrpc.Response.Ike is end Tkmrpc.Response.Ike;

14.25

30

0.807018

5881b01e5e32bfc9e9d4dba5c0938a2d3a4e9e92

1,117

adb

Ada

src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/dyn_arrayidx/foo.adb

alrooney/unum-sdk

bbccb10b0cd3500feccbbef22e27ea111c3d18eb

[ "Apache-2.0" ]

31

2018-08-01T21:25:24.000Z

2022-02-14T07:52:34.000Z

src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/dyn_arrayidx/foo.adb

alrooney/unum-sdk

bbccb10b0cd3500feccbbef22e27ea111c3d18eb

[ "Apache-2.0" ]

40

2018-12-03T19:48:52.000Z

2021-03-10T06:34:26.000Z

src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/dyn_arrayidx/foo.adb

alrooney/unum-sdk

bbccb10b0cd3500feccbbef22e27ea111c3d18eb

[ "Apache-2.0" ]

20

2018-11-16T21:19:22.000Z

2021-10-18T23:08:24.000Z

-- Copyright 2014-2016 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- This program is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. procedure Foo is function Range_Count (L, U : Integer) return Natural is type Array_Type is array (L .. U) of Natural; A : Array_Type := (others => 1); Result : Natural := 0; begin for I of A loop -- START Result := Result + I; end loop; return Result; end Range_Count; R2 : constant Natural := Range_Count (5, 10); begin null; end Foo;

33.848485

73

0.682184

22f5300683e3a3b1bd1eee2e8f708b3c2b7112c4

762

adb

Ada

software/kernel/cpu.adb

TUM-EI-RCS/StratoX

5fdd04e01a25efef6052376f43ce85b5bc973392

[ "BSD-3-Clause" ]

12

2017-06-08T14:19:57.000Z

2022-03-09T02:48:59.000Z

software/kernel/cpu.adb

TUM-EI-RCS/StratoX

5fdd04e01a25efef6052376f43ce85b5bc973392

[ "BSD-3-Clause" ]

6

2017-06-08T13:13:50.000Z

2020-05-15T09:32:43.000Z

software/kernel/cpu.adb

TUM-EI-RCS/StratoX

5fdd04e01a25efef6052376f43ce85b5bc973392

[ "BSD-3-Clause" ]

3

2017-06-30T14:05:06.000Z

2022-02-17T12:20:45.000Z

-- todo: initialize in several functions: initGPIO, initI2C, use HAL -- with Config; use Config; with HIL.GPIO; with HIL.SPI; with HIL.Clock; with HIL.UART; with HIL.I2C; with HIL.Random; with Ada.Real_Time; use Ada.Real_Time; package body CPU with SPARK_Mode is -- configures hardware registers procedure initialize is startup_time : constant Ada.Real_Time.Time := Ada.Real_Time.Clock; begin -- Configure GPIO HIL.Clock.configure; HIL.Random.initialize; HIL.UART.configure; HIL.GPIO.configure; HIL.SPI.configure; delay until startup_time + Ada.Real_Time.Milliseconds (200); HIL.I2C.initialize; end initialize; procedure sleep is -- ?? begin null; end sleep; end CPU;

18.585366

72

0.681102

ad84e9196110dfbfdee090794c679ae0b8dfd83d

4,569

ada

Ada

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

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/cd/cd1c03h.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- CD1C03H.ADA -- Grant of Unlimited Rights -- -- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687, -- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained -- unlimited rights in the software and documentation contained herein. -- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making -- this public release, the Government intends to confer upon all -- recipients unlimited rights equal to those held by the Government. -- These rights include rights to use, duplicate, release or disclose the -- released technical data and computer software in whole or in part, in -- any manner and for any purpose whatsoever, and to have or permit others -- to do so. -- -- DISCLAIMER -- -- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR -- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED -- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE -- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE -- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A -- PARTICULAR PURPOSE OF SAID MATERIAL. --* -- OBJECTIVE: -- CHECK THAT THE RECORD SIZE AND THE COMPONENT POSITIONS AND -- SIZES OF A DERIVED RECORD TYPE ARE INHERITED FROM THE -- PARENT IF THOSE ASPECTS OF THE PARENT WERE DETERMINED BY A -- RECORD REPRESENTATION CLAUSE. -- HISTORY: -- BCB 03/20/89 CHANGED EXTENSION FROM '.ADA' TO '.DEP'. -- JET 09/17/87 CREATED ORIGINAL TEST. WITH REPORT; USE REPORT; WITH SYSTEM; USE SYSTEM; PROCEDURE CD1C03H IS UNITS_PER_INTEGER : CONSTANT := (INTEGER'SIZE + SYSTEM.STORAGE_UNIT - 1) / SYSTEM.STORAGE_UNIT; TYPE E_TYPE IS (RED, BLUE, GREEN); TYPE PARENT_TYPE IS RECORD I : INTEGER RANGE 0 .. 127 := 127; C : CHARACTER := 'S'; B : BOOLEAN := FALSE; E : E_TYPE := BLUE; END RECORD; FOR PARENT_TYPE USE RECORD C AT 0 * UNITS_PER_INTEGER RANGE 0 .. CHARACTER'SIZE - 1; B AT 1 * UNITS_PER_INTEGER RANGE 0 .. BOOLEAN'SIZE - 1; I AT 2 * UNITS_PER_INTEGER RANGE 0 .. INTEGER'SIZE/2 - 1; E AT 3 * UNITS_PER_INTEGER RANGE 0 .. CHARACTER'SIZE - 1; END RECORD; TYPE DERIVED_TYPE IS NEW PARENT_TYPE; P_REC : PARENT_TYPE; REC : DERIVED_TYPE; BEGIN TEST("CD1C03H", "CHECK THAT THE RECORD SIZE AND THE COMPONENT " & "POSITIONS AND SIZES OF A DERIVED RECORD " & "TYPE ARE INHERITED FROM THE PARENT IF THOSE " & "ASPECTS OF THE PARENT WERE DETERMINED BY " & "A RECORD REPRESENTATION CLAUSE"); IF DERIVED_TYPE'SIZE /= IDENT_INT (PARENT_TYPE'SIZE) THEN FAILED ("DERIVED_TYPE'SIZE WAS NOT INHERITED FROM " & "PARENT_TYPE"); END IF; IF REC.I'SIZE /= P_REC.I'SIZE OR REC.C'SIZE /= P_REC.C'SIZE OR REC.B'SIZE /= P_REC.B'SIZE OR REC.E'SIZE /= P_REC.E'SIZE THEN FAILED ("THE SIZES OF DERIVED_TYPE ELEMENTS WERE NOT " & "INHERITED FROM PARENT_TYPE"); END IF; REC := (12, 'T', TRUE, RED); IF (REC.I /= 12) OR (REC.C /= 'T') OR (NOT REC.B) OR (REC.E /= RED) THEN FAILED ("THE VALUES OF DERIVED_TYPE COMPONENTS WERE " & "INCORRECT"); END IF; IF REC.I'POSITION /= P_REC.I'POSITION OR REC.C'POSITION /= P_REC.C'POSITION OR REC.B'POSITION /= P_REC.B'POSITION OR REC.E'POSITION /= P_REC.E'POSITION THEN FAILED ("THE POSITIONS OF DERIVED_TYPE COMPONENTS WERE " & "NOT INHERITED FROM PARENT_TYPE"); END IF; IF REC.I'FIRST_BIT /= P_REC.I'FIRST_BIT OR REC.C'FIRST_BIT /= P_REC.C'FIRST_BIT OR REC.B'FIRST_BIT /= P_REC.B'FIRST_BIT OR REC.E'FIRST_BIT /= P_REC.E'FIRST_BIT THEN FAILED ("THE FIRST_BITS OF DERIVED_TYPE COMPONENTS WERE " & "NOT INHERITED FROM PARENT_TYPE"); END IF; IF REC.I'LAST_BIT /= P_REC.I'LAST_BIT OR REC.C'LAST_BIT /= P_REC.C'LAST_BIT OR REC.B'LAST_BIT /= P_REC.B'LAST_BIT OR REC.E'LAST_BIT /= P_REC.E'LAST_BIT THEN FAILED ("THE LAST_BITS OF DERIVED_TYPE COMPONENTS WERE " & "NOT INHERITED FROM PARENT_TYPE"); END IF; RESULT; END CD1C03H;

37.146341

79

0.602539

3d22f466c0e90842da35d0df56155d9dd40d1ff1

3,907

adb

Ada

apps/bootloader/main_direct.adb

ekoeppen/MSP430_Generic_Ada_Drivers

12b8238ea22dbb0c0c6c63ca46bfa7e2cb80334a

[ "MIT" ]

null

apps/bootloader/main_direct.adb

ekoeppen/MSP430_Generic_Ada_Drivers

12b8238ea22dbb0c0c6c63ca46bfa7e2cb80334a

[ "MIT" ]

null

apps/bootloader/main_direct.adb

ekoeppen/MSP430_Generic_Ada_Drivers

12b8238ea22dbb0c0c6c63ca46bfa7e2cb80334a

[ "MIT" ]

null

with System.Machine_Code; use System.Machine_Code; with System.Storage_Elements; use System.Storage_Elements; with System.Address_To_Access_Conversions; with System; use System; with Interfaces; use Interfaces; with MSPGD.Board; use MSPGD.Board; with MSP430_SVD; use MSP430_SVD; with MSP430_SVD.FLASH; use MSP430_SVD.FLASH; with MSP430_SVD.SYSTEM_CLOCK; use MSP430_SVD.SYSTEM_CLOCK; procedure Main is pragma Preelaborate; Flash_Start : Unsigned_16 with Import, External_Name => "__flash_start"; Flash_Segment_Size : constant Unsigned_16 := 512; type Flash_Memory_Type is array (Unsigned_16 range 0 .. 65535) of Unsigned_8; type Flash_Memory_Pointer is access all Flash_Memory_Type; package Convert is new System.Address_To_Access_Conversions (Flash_Memory_Type); Flash_Memory : constant Convert.Object_Pointer := Convert.To_Pointer (System'To_Address (0)); Line : array (Unsigned_16 range 0 .. 47) of Unsigned_8; Write_Addr : Unsigned_16; Count : Unsigned_8; XON : constant Byte := 17; XOFF : constant Byte := 19; FCTL1 : Unsigned_16 with Import, Address => System'To_Address (16#0128#); FCTL2 : Unsigned_16 with Import, Address => System'To_Address (16#012A#); FCTL3 : Unsigned_16 with Import, Address => System'To_Address (16#012C#); function Nibble (N : Unsigned_8) return Unsigned_8 is begin return (if N >= 65 then N - 65 + 10 else N - 48); end Nibble; function From_Hex (I : Unsigned_16) return Unsigned_8 is begin return 16 * Nibble (Line (I)) + Nibble (Line (I + 1)); end From_Hex; procedure Erase_Flash is Addr : Unsigned_16 := Flash_Start; R_Low : Unsigned_8 := Flash_Memory (65534); R_High : Unsigned_8 := Flash_Memory (65535); begin FCTL3 := 16#A500#; FCTL1 := 16#A502#; Flash_Memory (65534) := 0; while Addr <= 65535 loop if Addr /= 16#FA00# then Flash_Memory (Addr) := 0; end if; Addr := Addr + Flash_Segment_Size; end loop; Flash_Memory (65534) := R_Low; Flash_Memory (65535) := R_High; FCTL1 := 16#A500#; FCTL3 := 16#A510#; end Erase_Flash; procedure Write_Flash is begin FCTL3 := 16#A500#; FCTL1 := 16#A540#; for I in Unsigned_8 range 0 .. Count loop Flash_Memory (Write_Addr) := From_Hex (Unsigned_16 (I) * 2); Write_Addr := Write_Addr + Unsigned_16 (1); end loop; FCTL1 := 16#A500#; FCTL3 := 16#A510#; end Write_Flash; procedure Reset is begin UART.Transmit (XON); FCTL1 := 16#0000#; end Reset; procedure Read_Line is Record_Type : Unsigned_8; begin UART.Transmit (XON); for I in Line'Range loop Line (I) := Unsigned_8 (UART.Receive); exit when Line (I) = 10; end loop; UART.Transmit (XOFF); Count := From_Hex (1); Write_Addr := (Unsigned_16 (From_Hex (3)) * 256 + Unsigned_16 (From_Hex (5))); Record_Type := From_Hex (7); case Record_Type is when 16#00# => Write_Flash; when 16#01# => Reset; when 16#80# => Erase_Flash; when others => null; end case; end Read_Line; procedure Init is CALDCO_8MHz : DCOCTL_Register with Import, Address => System'To_Address (16#10FC#); CALBC1_8MHz : BCSCTL1_Register with Import, Address => System'To_Address (16#10FD#); begin BUTTON.Init; if BUTTON.Is_Set then null; end if; -- SYSTEM_CLOCK_Periph.DCOCTL.MOD_k.Val := 0; -- SYSTEM_CLOCK_Periph.DCOCTL.DCO.Val := 0; SYSTEM_CLOCK_Periph.BCSCTL1 := CALBC1_8MHz; SYSTEM_CLOCK_Periph.DCOCTL := CALDCO_8MHz; RX.Init; TX.Init; UART.Init; FCTL2 := 16#A554#; -- FLASH_Periph.FCTL2 := (FWKEY => 16#A5#, FSSEL => Fssel_1, FN => 20); end Init; begin Init; loop Read_Line; end loop; end Main;

30.523438

96

0.645252

2e7fa05fe025ea7f7c32e0b3b6d4d4d985b33f40

15,854

adb

Ada

awa/src/awa-permissions-services.adb

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

81

2015-01-18T23:02:30.000Z

2022-03-19T17:34:57.000Z

awa/src/awa-permissions-services.adb

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

20

2015-12-09T19:26:19.000Z

2022-03-23T14:32:43.000Z

awa/src/awa-permissions-services.adb

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

16

2015-06-29T02:44:06.000Z

2021-09-23T18:47:50.000Z

----------------------------------------------------------------------- -- awa-permissions-services -- Permissions controller -- Copyright (C) 2011, 2012, 2013, 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 ADO.Queries; with ADO.Sessions.Entities; with ADO.Statements; with ADO.Caches.Discrete; with Util.Log.Loggers; with Util.Strings; with Security.Policies.URLs; with AWA.Permissions.Models; package body AWA.Permissions.Services is use ADO.Sessions; use type ADO.Identifier; Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("AWA.Permissions.Services"); package Permission_Cache is new ADO.Caches.Discrete (Element_Type => Integer); -- ------------------------------ -- Check if the permission with the name <tt>Name</tt> is granted for the current user. -- If the <tt>Entity</tt> is defined, an <tt>Entity_Permission</tt> is created and verified. -- Returns True if the user is granted the given permission. -- ------------------------------ function Has_Permission (Name : in Util.Beans.Objects.Object; Entity : in Util.Beans.Objects.Object) return Util.Beans.Objects.Object is use type Security.Contexts.Security_Context_Access; Context : constant Security.Contexts.Security_Context_Access := Security.Contexts.Current; Perm : constant String := Util.Beans.Objects.To_String (Name); Result : Boolean; begin if Util.Beans.Objects.Is_Empty (Name) or Context = null then Log.Error ("No security context: permission {0} is refused", Perm); Result := False; elsif Util.Beans.Objects.Is_Empty (Entity) then Result := Context.Has_Permission (Perm); else declare P : Entity_Permission (Security.Permissions.Get_Permission_Index (Perm)); begin P.Entity := ADO.Identifier (Util.Beans.Objects.To_Long_Long_Integer (Entity)); Result := Context.Has_Permission (P); end; end if; return Util.Beans.Objects.To_Object (Result); exception when Security.Permissions.Invalid_Name => Log.Error ("Invalid permission {0}", Perm); raise; end Has_Permission; URI : aliased constant String := "http://code.google.com/p/ada-awa/auth"; -- ------------------------------ -- Register the security EL functions in the EL mapper. -- ------------------------------ procedure Set_Functions (Mapper : in out EL.Functions.Function_Mapper'Class) is begin Mapper.Set_Function (Name => "hasPermission", Namespace => URI, Func => Has_Permission'Access, Optimize => False); end Set_Functions; -- ------------------------------ -- Get the permission manager associated with the security context. -- Returns null if there is none. -- ------------------------------ function Get_Permission_Manager (Context : in Security.Contexts.Security_Context'Class) return Permission_Manager_Access is use type Security.Policies.Policy_Manager_Access; M : constant Security.Policies.Policy_Manager_Access := Context.Get_Permission_Manager; begin if M = null then Log.Info ("There is no permission manager"); return null; elsif not (M.all in Permission_Manager'Class) then Log.Info ("Permission manager is not a AWA permission manager"); return null; else return Permission_Manager'Class (M.all)'Access; end if; end Get_Permission_Manager; -- ------------------------------ -- Get the permission manager associated with the security context. -- Returns null if there is none. -- ------------------------------ function Get_Permission_Manager (Context : in ASC.Service_Context_Access) return Permission_Manager_Access is Manager : constant Security.Policies.Policy_Manager_Access := Context.Get_Application.Get_Security_Manager; begin return Permission_Manager'Class (Manager.all)'Access; end Get_Permission_Manager; -- ------------------------------ -- Get the application instance. -- ------------------------------ function Get_Application (Manager : in Permission_Manager) return AWA.Applications.Application_Access is begin return Manager.App; end Get_Application; -- ------------------------------ -- Set the application instance. -- ------------------------------ procedure Set_Application (Manager : in out Permission_Manager; App : in AWA.Applications.Application_Access) is begin Manager.App := App; end Set_Application; -- ------------------------------ -- Initialize the permissions. -- ------------------------------ procedure Start (Manager : in out Permission_Manager) is package Perm renames Security.Permissions; DB : ADO.Sessions.Master_Session := Manager.App.Get_Master_Session; Cache : constant Permission_Cache.Cache_Type_Access := new Permission_Cache.Cache_Type; Count : constant Perm.Permission_Index := Perm.Get_Last_Permission_Index; Last : ADO.Identifier := 0; Insert : ADO.Statements.Insert_Statement; Stmt : ADO.Statements.Query_Statement; Load_Count : Natural := 0; Add_Count : Natural := 0; begin Log.Info ("Initializing {0} permissions", Perm.Permission_Index'Image (Count)); DB.Begin_Transaction; -- Step 1: load the permissions from the database. Stmt := DB.Create_Statement ("SELECT id, name FROM awa_permission"); Stmt.Execute; while Stmt.Has_Elements loop declare Id : constant Integer := Stmt.Get_Integer (0); Name : constant String := Stmt.Get_String (1); begin Log.Debug ("Loaded permission {0} as {1}", Name, Util.Strings.Image (Id)); Permission_Cache.Insert (Cache.all, Name, Id); Load_Count := Load_Count + 1; if ADO.Identifier (Id) > Last then Last := ADO.Identifier (Id); end if; end; Stmt.Next; end loop; -- Step 2: Check that every application permission is defined in the database. -- Create the new entries and allocate them the last id. for I in 1 .. Count loop declare Name : constant String := Perm.Get_Name (I); Result : Integer; begin Manager.Map (I) := ADO.Identifier (Cache.Find (Name)); exception when ADO.Caches.No_Value => Last := Last + 1; Log.Info ("Adding permission {0} as {1}", Name, ADO.Identifier'Image (Last)); Insert := DB.Create_Statement (AWA.Permissions.Models.PERMISSION_TABLE); Insert.Save_Field (Name => "id", Value => Last); Insert.Save_Field (Name => "name", Value => Name); Insert.Execute (Result); Cache.Insert (Name, Integer (Last)); Manager.Map (I) := Last; Add_Count := Add_Count + 1; end; end loop; DB.Add_Cache ("permission", Cache.all'Access); DB.Commit; if Add_Count > 0 then Log.Info ("Found {0} permissions in the database and created {1} permissions", Util.Strings.Image (Load_Count), Util.Strings.Image (Add_Count)); else Log.Info ("Found {0} permissions in the database", Util.Strings.Image (Load_Count)); end if; end Start; -- ------------------------------ -- Add a permission for the current user to access the entity identified by -- Entity and Kind. -- ------------------------------ procedure Add_Permission (Manager : in Permission_Manager; Entity : in ADO.Identifier; Kind : in ADO.Entity_Type; Workspace : in ADO.Identifier; Permission : in Security.Permissions.Permission_Index) is Ctx : constant AWA.Services.Contexts.Service_Context_Access := AWA.Services.Contexts.Current; DB : Master_Session := AWA.Services.Contexts.Get_Master_Session (Ctx); Perm : AWA.Permissions.Models.ACL_Ref; begin Log.Info ("Adding permission"); Ctx.Start; Perm.Set_Entity_Type (Kind); Perm.Set_User_Id (Ctx.Get_User_Identifier); Perm.Set_Entity_Id (Entity); Perm.Set_Writeable (False); Perm.Set_Workspace_Id (Workspace); Perm.Set_Permission (Manager.Map (Permission)); Perm.Save (DB); Ctx.Commit; end Add_Permission; -- ------------------------------ -- Check that the current user has the specified permission. -- Raise NO_PERMISSION exception if the user does not have the permission. -- ------------------------------ procedure Check_Permission (Manager : in Permission_Manager; Entity : in ADO.Identifier; Kind : in ADO.Entity_Type; Permission : in Permission_Type) is pragma Unreferenced (Manager, Permission); use AWA.Services; Ctx : constant Contexts.Service_Context_Access := AWA.Services.Contexts.Current; User : constant ADO.Identifier := Ctx.Get_User_Identifier; DB : constant Session := AWA.Services.Contexts.Get_Session (Ctx); Query : ADO.Queries.Context; begin Query.Set_Query (AWA.Permissions.Models.Query_Check_Entity_Permission); Query.Bind_Param ("user_id", User); Query.Bind_Param ("entity_id", Entity); Query.Bind_Param ("entity_type", Integer (Kind)); declare Stmt : ADO.Statements.Query_Statement := DB.Create_Statement (Query); begin Stmt.Execute; if not Stmt.Has_Elements then Log.Info ("User {0} does not have permission to access entity {1}/{2}", ADO.Identifier'Image (User), ADO.Identifier'Image (Entity), ADO.Entity_Type'Image (Kind)); raise NO_PERMISSION; end if; end; end Check_Permission; -- ------------------------------ -- Get the role names that grant the given permission. -- ------------------------------ function Get_Role_Names (Manager : in Permission_Manager; Permission : in Security.Permissions.Permission_Index) return Security.Policies.Roles.Role_Name_Array is begin return Manager.Roles.Get_Role_Names (Manager.Roles.Get_Grants (Permission)); end Get_Role_Names; -- ------------------------------ -- Add a permission for the user User to access the entity identified by -- Entity which is of type Kind. -- ------------------------------ procedure Add_Permission (Manager : in Permission_Manager; Session : in out ADO.Sessions.Master_Session; User : in ADO.Identifier; Entity : in ADO.Identifier; Kind : in ADO.Entity_Type; Workspace : in ADO.Identifier; Permission : in Security.Permissions.Permission_Index) is Acl : AWA.Permissions.Models.ACL_Ref; begin Acl.Set_User_Id (User); Acl.Set_Entity_Type (Kind); Acl.Set_Entity_Id (Entity); Acl.Set_Writeable (False); Acl.Set_Workspace_Id (Workspace); Acl.Set_Permission (Manager.Map (Permission)); Acl.Save (Session); Log.Info ("Permission created for {0} to access {1}, entity type {2}", ADO.Identifier'Image (User), ADO.Identifier'Image (Entity), ADO.Entity_Type'Image (Kind)); end Add_Permission; -- ------------------------------ -- Add a permission for the user User to access the entity identified by -- Entity. -- ------------------------------ procedure Add_Permission (Manager : in Permission_Manager; Session : in out ADO.Sessions.Master_Session; User : in ADO.Identifier; Entity : in ADO.Objects.Object_Ref'Class; Workspace : in ADO.Identifier; Permission : in Security.Permissions.Permission_Index) is Key : constant ADO.Objects.Object_Key := Entity.Get_Key; Kind : constant ADO.Entity_Type := ADO.Sessions.Entities.Find_Entity_Type (Session => Session, Object => Key); begin Manager.Add_Permission (Session, User, ADO.Objects.Get_Value (Key), Kind, Workspace, Permission); end Add_Permission; -- ------------------------------ -- Create a permission manager for the given application. -- ------------------------------ function Create_Permission_Manager (App : in AWA.Applications.Application_Access) return Security.Policies.Policy_Manager_Access is Result : constant AWA.Permissions.Services.Permission_Manager_Access := new AWA.Permissions.Services.Permission_Manager (10); RP : constant Security.Policies.Roles.Role_Policy_Access := new Security.Policies.Roles.Role_Policy; RU : constant Security.Policies.URLs.URL_Policy_Access := new Security.Policies.URLs.URL_Policy; RE : constant Entity_Policy_Access := new Entity_Policy; begin Result.Roles := RP; Result.Add_Policy (RP.all'Access); Result.Add_Policy (RU.all'Access); Result.Add_Policy (RE.all'Access); Result.Set_Application (App); Log.Info ("Creation of the AWA Permissions manager"); return Result.all'Access; end Create_Permission_Manager; -- ------------------------------ -- Delete all the permissions for a user and on the given workspace. -- ------------------------------ procedure Delete_Permissions (Session : in out ADO.Sessions.Master_Session; User : in ADO.Identifier; Workspace : in ADO.Identifier) is Stmt : ADO.Statements.Delete_Statement := Session.Create_Statement (Models.ACL_TABLE); Result : Natural; begin Stmt.Set_Filter (Filter => "workspace_id = ? AND user_id = ?"); Stmt.Add_Param (Value => Workspace); Stmt.Add_Param (Value => User); Stmt.Execute (Result); Log.Info ("Deleted {0} permissions for user {1} in workspace {2}", Natural'Image (Result), ADO.Identifier'Image (User), ADO.Identifier'Image (Workspace)); end Delete_Permissions; end AWA.Permissions.Services;

42.390374

98

0.576826

c70f409eed7ab8d32738b42a668cd50168d3b4a2

3,606

adb

Ada

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-imglld.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-imglld.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-imglld.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . I M G _ L L D -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2020, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with System.Img_Dec; use System.Img_Dec; package body System.Img_LLD is ----------------------------- -- Image_Long_Long_Decimal -- ---------------------------- procedure Image_Long_Long_Decimal (V : Long_Long_Integer; S : in out String; P : out Natural; Scale : Integer) is pragma Assert (S'First = 1); begin -- Add space at start for non-negative numbers if V >= 0 then S (1) := ' '; P := 1; else P := 0; end if; Set_Image_Long_Long_Decimal (V, S, P, Scale, 1, Integer'Max (1, Scale), 0); end Image_Long_Long_Decimal; --------------------------------- -- Set_Image_Long_Long_Decimal -- --------------------------------- procedure Set_Image_Long_Long_Decimal (V : Long_Long_Integer; S : in out String; P : in out Natural; Scale : Integer; Fore : Natural; Aft : Natural; Exp : Natural) is Digs : String := Long_Long_Integer'Image (V); -- Sign and digits of decimal value begin Set_Decimal_Digits (Digs, Digs'Length, S, P, Scale, Fore, Aft, Exp); end Set_Image_Long_Long_Decimal; end System.Img_LLD;

43.445783

78

0.417637

410a8290c9733aab57de98baf30b0a54ccc2b131

2,508

ads

Ada

awa/src/awa-oauth-filters.ads

twdroeger/ada-awa

77b824773747aecb912c37b1b7b59ea414679b80

[ "Apache-2.0" ]

null

awa/src/awa-oauth-filters.ads

twdroeger/ada-awa

77b824773747aecb912c37b1b7b59ea414679b80

[ "Apache-2.0" ]

null

awa/src/awa-oauth-filters.ads

twdroeger/ada-awa

77b824773747aecb912c37b1b7b59ea414679b80

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- awa-oauth-filters -- OAuth filter -- 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 ASF.Requests; with ASF.Responses; with ASF.Sessions; with ASF.Filters; with ASF.Servlets; with AWA.OAuth.Services; package AWA.OAuth.Filters is -- ------------------------------ -- OAuth Authentication filter -- ------------------------------ -- The Auth_Filter verifies that the access token passed for the OAuth -- operation is valid and it extracts the user to configure the request principal. type Auth_Filter is new ASF.Filters.Filter with private; -- Initialize the filter. overriding procedure Initialize (Filter : in out Auth_Filter; Config : in ASF.Servlets.Filter_Config); -- The Do_Filter method of the Filter is called by the container each time -- a request/response pair is passed through the chain due to a client request -- for a resource at the end of the chain. The Filter_Chain passed in to this -- method allows the Filter to pass on the request and response to the next -- entity in the chain. -- -- Before passing the control to the next filter, initialize the service -- context to give access to the current application, current user and -- manage possible transaction rollbacks. overriding procedure Do_Filter (F : in Auth_Filter; Request : in out ASF.Requests.Request'Class; Response : in out ASF.Responses.Response'Class; Chain : in out ASF.Servlets.Filter_Chain); private type Auth_Filter is new ASF.Filters.Filter with record Realm : AWA.OAuth.Services.Auth_Manager_Access; end record; end AWA.OAuth.Filters;

40.451613

86

0.641148

31c3fa62954dc137c5a74864e93ff52dddf684be

654

adb

Ada

src/ada/debug/lsc-internal-bignum-print.adb

Componolit/libsparkcrypto

8531a07b6e9f5eb33eae0fa32759b4cbd3509d95

[ "OpenSSL", "Unlicense" ]

30

2018-05-18T09:11:50.000Z

2021-05-18T16:29:14.000Z

src/ada/debug/lsc-internal-bignum-print.adb

Componolit/libsparkcrypto

8531a07b6e9f5eb33eae0fa32759b4cbd3509d95

[ "OpenSSL", "Unlicense" ]

15

2018-12-13T07:53:36.000Z

2019-09-24T19:43:35.000Z

src/ada/debug/lsc-internal-bignum-print.adb

Componolit/libsparkcrypto

8531a07b6e9f5eb33eae0fa32759b4cbd3509d95

[ "OpenSSL", "Unlicense" ]

3

2019-04-04T17:41:29.000Z

2021-05-07T22:28:46.000Z

with LSC.Internal.Debug; package body LSC.Internal.Bignum.Print with SPARK_Mode => Off is procedure Print_Big_Int (Item : LSC.Internal.Bignum.Big_Int; Columns : Natural) is begin for I in reverse Item'Range loop LSC.Internal.Debug.Print_Word32 (Item (I)); LSC.Internal.Debug.Put (" "); if (Item'Last - I + 1) mod Columns = 0 then LSC.Internal.Debug.New_Line; end if; end loop; if Item'Length mod Columns /= 0 then LSC.Internal.Debug.New_Line; end if; LSC.Internal.Debug.New_Line; end Print_Big_Int; end LSC.Internal.Bignum.Print;

24.222222

52

0.619266

1a9ca5803709e87394eeda411a3feed949f2550e

6,717

adb

Ada

src/servlet-core-mappers.adb

jquorning/ada-servlet

97db5fcdd59e01441c717b95a9e081aa7d6a7bbe

[ "Apache-2.0" ]

6

2018-01-04T07:19:46.000Z

2020-12-27T14:49:44.000Z

src/servlet-core-mappers.adb

jquorning/ada-servlet

97db5fcdd59e01441c717b95a9e081aa7d6a7bbe

[ "Apache-2.0" ]

9

2020-12-20T15:29:18.000Z

2022-02-04T20:13:58.000Z

src/servlet-core-mappers.adb

jquorning/ada-servlet

97db5fcdd59e01441c717b95a9e081aa7d6a7bbe

[ "Apache-2.0" ]

2

2021-01-06T08:32:38.000Z

2022-01-24T23:46:36.000Z

----------------------------------------------------------------------- -- servlet-servlets-mappers -- Read servlet configuration files -- Copyright (C) 2011, 2012, 2013, 2015, 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.Containers; with EL.Utils; package body Servlet.Core.Mappers is -- ------------------------------ -- Save in the servlet config object the value associated with the given field. -- When the FILTER_MAPPING, SERVLET_MAPPING or CONTEXT_PARAM field -- is reached, insert the new configuration rule in the servlet registry. -- ------------------------------ procedure Set_Member (N : in out Servlet_Config; Field : in Servlet_Fields; Value : in Util.Beans.Objects.Object) is use Util.Beans.Objects; use type Ada.Containers.Count_Type; procedure Add_Filter (Pattern : in Util.Beans.Objects.Object); procedure Add_Mapping (Pattern : in Util.Beans.Objects.Object); procedure Add_Mapping (Handler : access procedure (Pattern : in Util.Beans.Objects.Object); Message : in String); procedure Add_Filter (Pattern : in Util.Beans.Objects.Object) is begin N.Handler.Add_Filter_Mapping (Pattern => To_String (Pattern), Name => To_String (N.Filter_Name)); end Add_Filter; procedure Add_Mapping (Pattern : in Util.Beans.Objects.Object) is begin N.Handler.Add_Mapping (Pattern => To_String (Pattern), Name => To_String (N.Servlet_Name)); end Add_Mapping; procedure Add_Mapping (Handler : access procedure (Pattern : in Util.Beans.Objects.Object); Message : in String) is Last : constant Ada.Containers.Count_Type := N.URL_Patterns.Length; begin if Last = 0 then raise Util.Serialize.Mappers.Field_Error with Message; end if; for I in 1 .. Last loop N.URL_Patterns.Query_Element (Positive (I), Handler); end loop; N.URL_Patterns.Clear; end Add_Mapping; begin -- <context-param> -- <param-name>property</param-name> -- <param-value>false</param-value> -- </context-param> -- <filter-mapping> -- <filter-name>Dump Filter</filter-name> -- <servlet-name>Faces Servlet</servlet-name> -- </filter-mapping> case Field is when FILTER_NAME => N.Filter_Name := Value; when SERVLET_NAME => N.Servlet_Name := Value; when URL_PATTERN => N.URL_Patterns.Append (Value); when PARAM_NAME => N.Param_Name := Value; when PARAM_VALUE => N.Param_Value := EL.Utils.Eval (To_String (Value), N.Context.all); when MIME_TYPE => N.Mime_Type := Value; when EXTENSION => N.Extension := Value; when ERROR_CODE => N.Error_Code := Value; when LOCATION => N.Location := Value; when FILTER_MAPPING => Add_Mapping (Add_Filter'Access, "Missing url-pattern for the filter mapping"); when SERVLET_MAPPING => Add_Mapping (Add_Mapping'Access, "Missing url-pattern for the servlet mapping"); when CONTEXT_PARAM => declare Name : constant String := To_String (N.Param_Name); begin -- If the context parameter already has a value, do not set it again. -- The value comes from an application setting and we want to keep it. if N.Override_Context or else String '(N.Handler.all.Get_Init_Parameter (Name)) = "" then if Util.Beans.Objects.Is_Null (N.Param_Value) then N.Handler.Set_Init_Parameter (Name => Name, Value => ""); else N.Handler.Set_Init_Parameter (Name => Name, Value => To_String (N.Param_Value)); end if; end if; end; when MIME_MAPPING => null; when ERROR_PAGE => N.Handler.Set_Error_Page (Error => To_Integer (N.Error_Code), Page => To_String (N.Location)); end case; end Set_Member; SMapper : aliased Servlet_Mapper.Mapper; -- ------------------------------ -- Setup the XML parser to read the servlet and mapping rules context-param, -- filter-mapping and servlet-mapping. -- ------------------------------ package body Reader_Config is begin Mapper.Add_Mapping ("faces-config", SMapper'Access); Mapper.Add_Mapping ("module", SMapper'Access); Mapper.Add_Mapping ("web-app", SMapper'Access); Config.Handler := Handler; Config.Context := Context; Servlet_Mapper.Set_Context (Mapper, Config'Unchecked_Access); end Reader_Config; begin SMapper.Add_Mapping ("filter-mapping", FILTER_MAPPING); SMapper.Add_Mapping ("filter-mapping/filter-name", FILTER_NAME); SMapper.Add_Mapping ("filter-mapping/servlet-name", SERVLET_NAME); SMapper.Add_Mapping ("filter-mapping/url-pattern", URL_PATTERN); SMapper.Add_Mapping ("servlet-mapping", SERVLET_MAPPING); SMapper.Add_Mapping ("servlet-mapping/servlet-name", SERVLET_NAME); SMapper.Add_Mapping ("servlet-mapping/url-pattern", URL_PATTERN); SMapper.Add_Mapping ("context-param", CONTEXT_PARAM); SMapper.Add_Mapping ("context-param/param-name", PARAM_NAME); SMapper.Add_Mapping ("context-param/param-value", PARAM_VALUE); SMapper.Add_Mapping ("error-page", ERROR_PAGE); SMapper.Add_Mapping ("error-page/error-code", ERROR_CODE); SMapper.Add_Mapping ("error-page/location", LOCATION); end Servlet.Core.Mappers;

39.280702

97

0.585529

c7668696b6633a0ec003bb486d10a4b514e85964

15,600

adb

Ada

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

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

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

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

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

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2012, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ with AMF.Elements; with AMF.Internals.Element_Collections; with AMF.Internals.Helpers; with AMF.Internals.Tables.UML_Attributes; with AMF.Visitors.UML_Iterators; with AMF.Visitors.UML_Visitors; with League.Strings.Internals; with Matreshka.Internals.Strings; package body AMF.Internals.UML_Dependencies is ------------------- -- Enter_Element -- ------------------- overriding procedure Enter_Element (Self : not null access constant UML_Dependency_Proxy; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control) is begin if Visitor in AMF.Visitors.UML_Visitors.UML_Visitor'Class then AMF.Visitors.UML_Visitors.UML_Visitor'Class (Visitor).Enter_Dependency (AMF.UML.Dependencies.UML_Dependency_Access (Self), Control); end if; end Enter_Element; ------------------- -- Leave_Element -- ------------------- overriding procedure Leave_Element (Self : not null access constant UML_Dependency_Proxy; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control) is begin if Visitor in AMF.Visitors.UML_Visitors.UML_Visitor'Class then AMF.Visitors.UML_Visitors.UML_Visitor'Class (Visitor).Leave_Dependency (AMF.UML.Dependencies.UML_Dependency_Access (Self), Control); end if; end Leave_Element; ------------------- -- Visit_Element -- ------------------- overriding procedure Visit_Element (Self : not null access constant UML_Dependency_Proxy; Iterator : in out AMF.Visitors.Abstract_Iterator'Class; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control) is begin if Iterator in AMF.Visitors.UML_Iterators.UML_Iterator'Class then AMF.Visitors.UML_Iterators.UML_Iterator'Class (Iterator).Visit_Dependency (Visitor, AMF.UML.Dependencies.UML_Dependency_Access (Self), Control); end if; end Visit_Element; ---------------- -- Get_Client -- ---------------- overriding function Get_Client (Self : not null access constant UML_Dependency_Proxy) return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is begin return AMF.UML.Named_Elements.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.UML_Attributes.Internal_Get_Client (Self.Element))); end Get_Client; ------------------ -- Get_Supplier -- ------------------ overriding function Get_Supplier (Self : not null access constant UML_Dependency_Proxy) return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is begin return AMF.UML.Named_Elements.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.UML_Attributes.Internal_Get_Supplier (Self.Element))); end Get_Supplier; ---------------- -- Get_Source -- ---------------- overriding function Get_Source (Self : not null access constant UML_Dependency_Proxy) return AMF.UML.Elements.Collections.Set_Of_UML_Element is begin return AMF.UML.Elements.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.UML_Attributes.Internal_Get_Source (Self.Element))); end Get_Source; ---------------- -- Get_Target -- ---------------- overriding function Get_Target (Self : not null access constant UML_Dependency_Proxy) return AMF.UML.Elements.Collections.Set_Of_UML_Element is begin return AMF.UML.Elements.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.UML_Attributes.Internal_Get_Target (Self.Element))); end Get_Target; ------------------------- -- Get_Related_Element -- ------------------------- overriding function Get_Related_Element (Self : not null access constant UML_Dependency_Proxy) return AMF.UML.Elements.Collections.Set_Of_UML_Element is begin return AMF.UML.Elements.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.UML_Attributes.Internal_Get_Related_Element (Self.Element))); end Get_Related_Element; --------------------------- -- Get_Client_Dependency -- --------------------------- overriding function Get_Client_Dependency (Self : not null access constant UML_Dependency_Proxy) return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency is begin return AMF.UML.Dependencies.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.UML_Attributes.Internal_Get_Client_Dependency (Self.Element))); end Get_Client_Dependency; ------------------------- -- Get_Name_Expression -- ------------------------- overriding function Get_Name_Expression (Self : not null access constant UML_Dependency_Proxy) return AMF.UML.String_Expressions.UML_String_Expression_Access is begin return AMF.UML.String_Expressions.UML_String_Expression_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.UML_Attributes.Internal_Get_Name_Expression (Self.Element))); end Get_Name_Expression; ------------------------- -- Set_Name_Expression -- ------------------------- overriding procedure Set_Name_Expression (Self : not null access UML_Dependency_Proxy; To : AMF.UML.String_Expressions.UML_String_Expression_Access) is begin AMF.Internals.Tables.UML_Attributes.Internal_Set_Name_Expression (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_Name_Expression; ------------------- -- Get_Namespace -- ------------------- overriding function Get_Namespace (Self : not null access constant UML_Dependency_Proxy) return AMF.UML.Namespaces.UML_Namespace_Access is begin return AMF.UML.Namespaces.UML_Namespace_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.UML_Attributes.Internal_Get_Namespace (Self.Element))); end Get_Namespace; ------------------------ -- Get_Qualified_Name -- ------------------------ overriding function Get_Qualified_Name (Self : not null access constant UML_Dependency_Proxy) return AMF.Optional_String is begin declare use type Matreshka.Internals.Strings.Shared_String_Access; Aux : constant Matreshka.Internals.Strings.Shared_String_Access := AMF.Internals.Tables.UML_Attributes.Internal_Get_Qualified_Name (Self.Element); begin if Aux = null then return (Is_Empty => True); else return (False, League.Strings.Internals.Create (Aux)); end if; end; end Get_Qualified_Name; ----------------------------------- -- Get_Owning_Template_Parameter -- ----------------------------------- overriding function Get_Owning_Template_Parameter (Self : not null access constant UML_Dependency_Proxy) return AMF.UML.Template_Parameters.UML_Template_Parameter_Access is begin return AMF.UML.Template_Parameters.UML_Template_Parameter_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.UML_Attributes.Internal_Get_Owning_Template_Parameter (Self.Element))); end Get_Owning_Template_Parameter; ----------------------------------- -- Set_Owning_Template_Parameter -- ----------------------------------- overriding procedure Set_Owning_Template_Parameter (Self : not null access UML_Dependency_Proxy; To : AMF.UML.Template_Parameters.UML_Template_Parameter_Access) is begin AMF.Internals.Tables.UML_Attributes.Internal_Set_Owning_Template_Parameter (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_Owning_Template_Parameter; ---------------------------- -- Get_Template_Parameter -- ---------------------------- overriding function Get_Template_Parameter (Self : not null access constant UML_Dependency_Proxy) return AMF.UML.Template_Parameters.UML_Template_Parameter_Access is begin return AMF.UML.Template_Parameters.UML_Template_Parameter_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.UML_Attributes.Internal_Get_Template_Parameter (Self.Element))); end Get_Template_Parameter; ---------------------------- -- Set_Template_Parameter -- ---------------------------- overriding procedure Set_Template_Parameter (Self : not null access UML_Dependency_Proxy; To : AMF.UML.Template_Parameters.UML_Template_Parameter_Access) is begin AMF.Internals.Tables.UML_Attributes.Internal_Set_Template_Parameter (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_Template_Parameter; ------------------------- -- All_Owning_Packages -- ------------------------- overriding function All_Owning_Packages (Self : not null access constant UML_Dependency_Proxy) return AMF.UML.Packages.Collections.Set_Of_UML_Package is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "All_Owning_Packages unimplemented"); raise Program_Error with "Unimplemented procedure UML_Dependency_Proxy.All_Owning_Packages"; return All_Owning_Packages (Self); end All_Owning_Packages; ----------------------------- -- Is_Distinguishable_From -- ----------------------------- overriding function Is_Distinguishable_From (Self : not null access constant UML_Dependency_Proxy; N : AMF.UML.Named_Elements.UML_Named_Element_Access; Ns : AMF.UML.Namespaces.UML_Namespace_Access) return Boolean is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "Is_Distinguishable_From unimplemented"); raise Program_Error with "Unimplemented procedure UML_Dependency_Proxy.Is_Distinguishable_From"; return Is_Distinguishable_From (Self, N, Ns); end Is_Distinguishable_From; --------------- -- Namespace -- --------------- overriding function Namespace (Self : not null access constant UML_Dependency_Proxy) return AMF.UML.Namespaces.UML_Namespace_Access is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "Namespace unimplemented"); raise Program_Error with "Unimplemented procedure UML_Dependency_Proxy.Namespace"; return Namespace (Self); end Namespace; ------------------------ -- Is_Compatible_With -- ------------------------ overriding function Is_Compatible_With (Self : not null access constant UML_Dependency_Proxy; P : AMF.UML.Parameterable_Elements.UML_Parameterable_Element_Access) return Boolean is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "Is_Compatible_With unimplemented"); raise Program_Error with "Unimplemented procedure UML_Dependency_Proxy.Is_Compatible_With"; return Is_Compatible_With (Self, P); end Is_Compatible_With; --------------------------- -- Is_Template_Parameter -- --------------------------- overriding function Is_Template_Parameter (Self : not null access constant UML_Dependency_Proxy) return Boolean is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "Is_Template_Parameter unimplemented"); raise Program_Error with "Unimplemented procedure UML_Dependency_Proxy.Is_Template_Parameter"; return Is_Template_Parameter (Self); end Is_Template_Parameter; end AMF.Internals.UML_Dependencies;

39.19598

102

0.598654

31a8e426238bcc89adce5d45df4d44a242c22d00

3,393

ads

Ada

4-high/gel/source/joint/gel-slider_joint.ads

charlie5/lace

e9b7dc751d500ff3f559617a6fc3089ace9dc134

[ "0BSD" ]

20

2015-11-04T09:23:59.000Z

2022-01-14T10:21:42.000Z

4-high/gel/source/joint/gel-slider_joint.ads

charlie5/lace-alire

9ace9682cf4daac7adb9f980c2868d6225b8111c

[ "0BSD" ]

2

2015-11-04T17:05:56.000Z

2015-12-08T03:16:13.000Z

4-high/gel/source/joint/gel-slider_joint.ads

charlie5/lace-alire

9ace9682cf4daac7adb9f980c2868d6225b8111c

[ "0BSD" ]

1

2015-12-07T12:53:52.000Z

with gel.Joint, gel.Sprite, physics.Joint.slider, physics.Space; package gel.slider_Joint -- -- Allows sprites to be connected via a slider joint. -- is type Item is new gel.Joint.Item with private; type View is access all Item'Class; type Views is array (math.Index range <>) of View; Sway : constant Joint.Degree_of_freedom := 1; -- TODO: These are duplicated. Heave : constant Joint.Degree_of_freedom := 2; Surge : constant Joint.Degree_of_freedom := 3; Pitch : constant Joint.Degree_of_freedom := 4; Yaw : constant Joint.Degree_of_freedom := 5; Roll : constant Joint.Degree_of_freedom := 6; package std_physics renames standard.Physics; use Math; --------- --- Forge -- procedure define (Self : access Item; in_Space : in std_physics.Space.view; Sprite_A, Sprite_B : access gel.Sprite.item'Class; pivot_Anchor : in Vector_3; pivot_Axis : in Matrix_3x3); procedure define (Self : access Item; in_Space : in std_physics.Space.view; Sprite_A, Sprite_B : access gel.Sprite.item'Class; Frame_A, Frame_B : in Matrix_4x4); overriding procedure destroy (Self : in out Item); -------------- --- Attributes -- overriding function Physics (Self : in Item) return gel.Joint.Physics_view; overriding function Frame_A (Self : in Item) return Matrix_4x4; overriding function Frame_B (Self : in Item) return Matrix_4x4; overriding procedure Frame_A_is (Self : in out Item; Now : in Matrix_4x4); overriding procedure Frame_B_is (Self : in out Item; Now : in Matrix_4x4); overriding function Degrees_of_freedom (Self : in Item) return Joint.Degree_of_freedom; -- Bounds - limits the range of motion for a Degree of freedom. -- overriding function is_Bound (Self : in Item; for_Degree : in Joint.Degree_of_freedom) return Boolean; overriding function low_Bound (Self : access Item; for_Degree : in Joint.Degree_of_freedom) return Real; overriding procedure low_Bound_is (Self : access Item; for_Degree : in Joint.Degree_of_freedom; Now : in Real); overriding function high_Bound (Self : access Item; for_Degree : in Joint.Degree_of_freedom) return Real; overriding procedure high_Bound_is (Self : access Item; for_Degree : in Joint.Degree_of_freedom; Now : in Real); overriding function Extent (Self : in Item; for_Degree : in Joint.Degree_of_freedom) return Real; overriding procedure Velocity_is (Self : in Item; for_Degree : in Joint.Degree_of_freedom; Now : in Real); -------------- --- Operations -- -- Nil. private type physics_slider_Joint_view is access all std_physics.Joint.slider.item'Class; type Item is new gel.Joint.Item with record Physics : access std_physics.Joint.slider.item'Class; end record; end gel.slider_Joint;

31.12844

106

0.591217

2e651b66f7b028ce0d7b3de7d5ab7d4cda9d9909

21,163

adb

Ada

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/i-c.adb

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

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

null

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/i-c.adb

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

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

null

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/i-c.adb

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

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

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- I N T E R F A C E S . 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. -- -- -- ------------------------------------------------------------------------------ package body Interfaces.C is ----------------------- -- Is_Nul_Terminated -- ----------------------- -- Case of char_array function Is_Nul_Terminated (Item : char_array) return Boolean is begin for J in Item'Range loop if Item (J) = nul then return True; end if; end loop; return False; end Is_Nul_Terminated; -- Case of wchar_array function Is_Nul_Terminated (Item : wchar_array) return Boolean is begin for J in Item'Range loop if Item (J) = wide_nul then return True; end if; end loop; return False; end Is_Nul_Terminated; -- Case of char16_array function Is_Nul_Terminated (Item : char16_array) return Boolean is begin for J in Item'Range loop if Item (J) = char16_nul then return True; end if; end loop; return False; end Is_Nul_Terminated; -- Case of char32_array function Is_Nul_Terminated (Item : char32_array) return Boolean is begin for J in Item'Range loop if Item (J) = char32_nul then return True; end if; end loop; return False; end Is_Nul_Terminated; ------------ -- To_Ada -- ------------ -- Convert char to Character function To_Ada (Item : char) return Character is begin return Character'Val (char'Pos (Item)); end To_Ada; -- Convert char_array to String (function form) function To_Ada (Item : char_array; Trim_Nul : Boolean := True) return String is Count : Natural; From : size_t; begin if Trim_Nul then From := Item'First; loop if From > Item'Last then raise Terminator_Error; elsif Item (From) = nul then exit; else From := From + 1; end if; end loop; Count := Natural (From - Item'First); else Count := Item'Length; end if; declare R : String (1 .. Count); begin for J in R'Range loop R (J) := To_Ada (Item (size_t (J) + (Item'First - 1))); end loop; return R; end; end To_Ada; -- Convert char_array to String (procedure form) procedure To_Ada (Item : char_array; Target : out String; Count : out Natural; Trim_Nul : Boolean := True) is From : size_t; To : Positive; begin if Trim_Nul then From := Item'First; loop if From > Item'Last then raise Terminator_Error; elsif Item (From) = nul then exit; else From := From + 1; end if; end loop; Count := Natural (From - Item'First); else Count := Item'Length; end if; if Count > Target'Length then raise Constraint_Error; else From := Item'First; To := Target'First; for J in 1 .. Count loop Target (To) := Character (Item (From)); From := From + 1; To := To + 1; end loop; end if; end To_Ada; -- Convert wchar_t to Wide_Character function To_Ada (Item : wchar_t) return Wide_Character is begin return Wide_Character (Item); end To_Ada; -- Convert wchar_array to Wide_String (function form) function To_Ada (Item : wchar_array; Trim_Nul : Boolean := True) return Wide_String is Count : Natural; From : size_t; begin if Trim_Nul then From := Item'First; loop if From > Item'Last then raise Terminator_Error; elsif Item (From) = wide_nul then exit; else From := From + 1; end if; end loop; Count := Natural (From - Item'First); else Count := Item'Length; end if; declare R : Wide_String (1 .. Count); begin for J in R'Range loop R (J) := To_Ada (Item (size_t (J) + (Item'First - 1))); end loop; return R; end; end To_Ada; -- Convert wchar_array to Wide_String (procedure form) procedure To_Ada (Item : wchar_array; Target : out Wide_String; Count : out Natural; Trim_Nul : Boolean := True) is From : size_t; To : Positive; begin if Trim_Nul then From := Item'First; loop if From > Item'Last then raise Terminator_Error; elsif Item (From) = wide_nul then exit; else From := From + 1; end if; end loop; Count := Natural (From - Item'First); else Count := Item'Length; end if; if Count > Target'Length then raise Constraint_Error; else From := Item'First; To := Target'First; for J in 1 .. Count loop Target (To) := To_Ada (Item (From)); From := From + 1; To := To + 1; end loop; end if; end To_Ada; -- Convert char16_t to Wide_Character function To_Ada (Item : char16_t) return Wide_Character is begin return Wide_Character'Val (char16_t'Pos (Item)); end To_Ada; -- Convert char16_array to Wide_String (function form) function To_Ada (Item : char16_array; Trim_Nul : Boolean := True) return Wide_String is Count : Natural; From : size_t; begin if Trim_Nul then From := Item'First; loop if From > Item'Last then raise Terminator_Error; elsif Item (From) = char16_t'Val (0) then exit; else From := From + 1; end if; end loop; Count := Natural (From - Item'First); else Count := Item'Length; end if; declare R : Wide_String (1 .. Count); begin for J in R'Range loop R (J) := To_Ada (Item (size_t (J) + (Item'First - 1))); end loop; return R; end; end To_Ada; -- Convert char16_array to Wide_String (procedure form) procedure To_Ada (Item : char16_array; Target : out Wide_String; Count : out Natural; Trim_Nul : Boolean := True) is From : size_t; To : Positive; begin if Trim_Nul then From := Item'First; loop if From > Item'Last then raise Terminator_Error; elsif Item (From) = char16_t'Val (0) then exit; else From := From + 1; end if; end loop; Count := Natural (From - Item'First); else Count := Item'Length; end if; if Count > Target'Length then raise Constraint_Error; else From := Item'First; To := Target'First; for J in 1 .. Count loop Target (To) := To_Ada (Item (From)); From := From + 1; To := To + 1; end loop; end if; end To_Ada; -- Convert char32_t to Wide_Wide_Character function To_Ada (Item : char32_t) return Wide_Wide_Character is begin return Wide_Wide_Character'Val (char32_t'Pos (Item)); end To_Ada; -- Convert char32_array to Wide_Wide_String (function form) function To_Ada (Item : char32_array; Trim_Nul : Boolean := True) return Wide_Wide_String is Count : Natural; From : size_t; begin if Trim_Nul then From := Item'First; loop if From > Item'Last then raise Terminator_Error; elsif Item (From) = char32_t'Val (0) then exit; else From := From + 1; end if; end loop; Count := Natural (From - Item'First); else Count := Item'Length; end if; declare R : Wide_Wide_String (1 .. Count); begin for J in R'Range loop R (J) := To_Ada (Item (size_t (J) + (Item'First - 1))); end loop; return R; end; end To_Ada; -- Convert char32_array to Wide_Wide_String (procedure form) procedure To_Ada (Item : char32_array; Target : out Wide_Wide_String; Count : out Natural; Trim_Nul : Boolean := True) is From : size_t; To : Positive; begin if Trim_Nul then From := Item'First; loop if From > Item'Last then raise Terminator_Error; elsif Item (From) = char32_t'Val (0) then exit; else From := From + 1; end if; end loop; Count := Natural (From - Item'First); else Count := Item'Length; end if; if Count > Target'Length then raise Constraint_Error; else From := Item'First; To := Target'First; for J in 1 .. Count loop Target (To) := To_Ada (Item (From)); From := From + 1; To := To + 1; end loop; end if; end To_Ada; ---------- -- To_C -- ---------- -- Convert Character to char function To_C (Item : Character) return char is begin return char'Val (Character'Pos (Item)); end To_C; -- Convert String to char_array (function form) function To_C (Item : String; Append_Nul : Boolean := True) return char_array is begin if Append_Nul then declare R : char_array (0 .. Item'Length); begin for J in Item'Range loop R (size_t (J - Item'First)) := To_C (Item (J)); end loop; R (R'Last) := nul; return R; end; -- Append_Nul False else -- A nasty case, if the string is null, we must return a null -- char_array. The lower bound of this array is required to be zero -- (RM B.3(50)) but that is of course impossible given that size_t -- is unsigned. According to Ada 2005 AI-258, the result is to raise -- Constraint_Error. This is also the appropriate behavior in Ada 95, -- since nothing else makes sense. if Item'Length = 0 then raise Constraint_Error; -- Normal case else declare R : char_array (0 .. Item'Length - 1); begin for J in Item'Range loop R (size_t (J - Item'First)) := To_C (Item (J)); end loop; return R; end; end if; end if; end To_C; -- Convert String to char_array (procedure form) procedure To_C (Item : String; Target : out char_array; Count : out size_t; Append_Nul : Boolean := True) is To : size_t; begin if Target'Length < Item'Length then raise Constraint_Error; else To := Target'First; for From in Item'Range loop Target (To) := char (Item (From)); To := To + 1; end loop; if Append_Nul then if To > Target'Last then raise Constraint_Error; else Target (To) := nul; Count := Item'Length + 1; end if; else Count := Item'Length; end if; end if; end To_C; -- Convert Wide_Character to wchar_t function To_C (Item : Wide_Character) return wchar_t is begin return wchar_t (Item); end To_C; -- Convert Wide_String to wchar_array (function form) function To_C (Item : Wide_String; Append_Nul : Boolean := True) return wchar_array is begin if Append_Nul then declare R : wchar_array (0 .. Item'Length); begin for J in Item'Range loop R (size_t (J - Item'First)) := To_C (Item (J)); end loop; R (R'Last) := wide_nul; return R; end; else -- A nasty case, if the string is null, we must return a null -- wchar_array. The lower bound of this array is required to be zero -- (RM B.3(50)) but that is of course impossible given that size_t -- is unsigned. According to Ada 2005 AI-258, the result is to raise -- Constraint_Error. This is also the appropriate behavior in Ada 95, -- since nothing else makes sense. if Item'Length = 0 then raise Constraint_Error; else declare R : wchar_array (0 .. Item'Length - 1); begin for J in size_t range 0 .. Item'Length - 1 loop R (J) := To_C (Item (Integer (J) + Item'First)); end loop; return R; end; end if; end if; end To_C; -- Convert Wide_String to wchar_array (procedure form) procedure To_C (Item : Wide_String; Target : out wchar_array; Count : out size_t; Append_Nul : Boolean := True) is To : size_t; begin if Target'Length < Item'Length then raise Constraint_Error; else To := Target'First; for From in Item'Range loop Target (To) := To_C (Item (From)); To := To + 1; end loop; if Append_Nul then if To > Target'Last then raise Constraint_Error; else Target (To) := wide_nul; Count := Item'Length + 1; end if; else Count := Item'Length; end if; end if; end To_C; -- Convert Wide_Character to char16_t function To_C (Item : Wide_Character) return char16_t is begin return char16_t'Val (Wide_Character'Pos (Item)); end To_C; -- Convert Wide_String to char16_array (function form) function To_C (Item : Wide_String; Append_Nul : Boolean := True) return char16_array is begin if Append_Nul then declare R : char16_array (0 .. Item'Length); begin for J in Item'Range loop R (size_t (J - Item'First)) := To_C (Item (J)); end loop; R (R'Last) := char16_t'Val (0); return R; end; else -- A nasty case, if the string is null, we must return a null -- char16_array. The lower bound of this array is required to be zero -- (RM B.3(50)) but that is of course impossible given that size_t -- is unsigned. According to Ada 2005 AI-258, the result is to raise -- Constraint_Error. This is also the appropriate behavior in Ada 95, -- since nothing else makes sense. if Item'Length = 0 then raise Constraint_Error; else declare R : char16_array (0 .. Item'Length - 1); begin for J in size_t range 0 .. Item'Length - 1 loop R (J) := To_C (Item (Integer (J) + Item'First)); end loop; return R; end; end if; end if; end To_C; -- Convert Wide_String to char16_array (procedure form) procedure To_C (Item : Wide_String; Target : out char16_array; Count : out size_t; Append_Nul : Boolean := True) is To : size_t; begin if Target'Length < Item'Length then raise Constraint_Error; else To := Target'First; for From in Item'Range loop Target (To) := To_C (Item (From)); To := To + 1; end loop; if Append_Nul then if To > Target'Last then raise Constraint_Error; else Target (To) := char16_t'Val (0); Count := Item'Length + 1; end if; else Count := Item'Length; end if; end if; end To_C; -- Convert Wide_Character to char32_t function To_C (Item : Wide_Wide_Character) return char32_t is begin return char32_t'Val (Wide_Wide_Character'Pos (Item)); end To_C; -- Convert Wide_Wide_String to char32_array (function form) function To_C (Item : Wide_Wide_String; Append_Nul : Boolean := True) return char32_array is begin if Append_Nul then declare R : char32_array (0 .. Item'Length); begin for J in Item'Range loop R (size_t (J - Item'First)) := To_C (Item (J)); end loop; R (R'Last) := char32_t'Val (0); return R; end; else -- A nasty case, if the string is null, we must return a null -- char32_array. The lower bound of this array is required to be zero -- (RM B.3(50)) but that is of course impossible given that size_t -- is unsigned. According to Ada 2005 AI-258, the result is to raise -- Constraint_Error. if Item'Length = 0 then raise Constraint_Error; else declare R : char32_array (0 .. Item'Length - 1); begin for J in size_t range 0 .. Item'Length - 1 loop R (J) := To_C (Item (Integer (J) + Item'First)); end loop; return R; end; end if; end if; end To_C; -- Convert Wide_Wide_String to char32_array (procedure form) procedure To_C (Item : Wide_Wide_String; Target : out char32_array; Count : out size_t; Append_Nul : Boolean := True) is To : size_t; begin if Target'Length < Item'Length then raise Constraint_Error; else To := Target'First; for From in Item'Range loop Target (To) := To_C (Item (From)); To := To + 1; end loop; if Append_Nul then if To > Target'Last then raise Constraint_Error; else Target (To) := char32_t'Val (0); Count := Item'Length + 1; end if; else Count := Item'Length; end if; end if; end To_C; end Interfaces.C;

25.590085

79

0.493125

1a1911d742d5cc78c163d27ebf14e725856fa501

4,741

adb

Ada

src/world.adb

Fabien-Chouteau/motherlode

a97e3f41d189b9725592873b4ae547850ee3a51c

[ "MIT" ]

2

2020-08-24T15:01:37.000Z

2020-10-16T22:37:07.000Z

src/world.adb

Fabien-Chouteau/motherlode

a97e3f41d189b9725592873b4ae547850ee3a51c

[ "MIT" ]

null

src/world.adb

Fabien-Chouteau/motherlode

a97e3f41d189b9725592873b4ae547850ee3a51c

[ "MIT" ]

1

2021-01-19T12:00:35.000Z

-- Motherlode -- Copyright (c) 2020 Fabien Chouteau with HAL; use HAL; with PyGamer.Time; package body World is Seed : UInt32 := 5323; ---------- -- Rand -- ---------- function Rand return Float is begin Seed := 8253729 * Seed + 2396403; return Float (Seed mod 32767) / 32767.0; end Rand; -------------- -- Get_Cell -- -------------- function Get_Cell (CX, CY : Natural) return Cell_Kind is begin return Ground (CX + CY * Ground_Width); end Get_Cell; ----------------- -- Choose_Cell -- ----------------- function Choose_Cell (CX, CY : Natural) return Cell_Kind is Proba : array (Cell_Kind) of Natural; ---------------- -- From_Proba -- ---------------- function From_Proba return Cell_Kind is Total : Natural := 0; Value : Natural := 0; begin for Elt of Proba loop Total := Total + Elt; end loop; Value := Natural (Float (Total) * Rand); Total := 0; for Kind in Cell_Kind loop if Value in Total .. Total + Proba (Kind) then return Kind; else Total := Total + Proba (Kind); end if; end loop; return Rock; end From_Proba; begin if CY < 3 then return Empty; elsif CY = 3 then return Dirt; else case CY is when 0 .. 10 => Proba := (Empty => 13, Dirt => 70, Coal => 15, Iron => 2, Gold => 0, Diamond => 0, Rock => 0); when 11 .. 50 => Proba := (Empty => 8, Dirt => 67, Coal => 15, Iron => 7, Gold => 0, Diamond => 0, Rock => 3); when 51 .. 100 => Proba := (Empty => 8, Dirt => 50, Coal => 15, Iron => 20, Gold => 10, Diamond => 2, Rock => 5); when 101 .. 200 => Proba := (Empty => 15, Dirt => 40, Coal => 5, Iron => 10, Gold => 15, Diamond => 5, Rock => 10); when 201 .. 350 => Proba := (Empty => 10, Dirt => 35, Coal => 0, Iron => 10, Gold => 15, Diamond => 15, Rock => 15); when others => Proba := (Empty => 0, Dirt => 0, Coal => 0, Iron => 0, Gold => 25, Diamond => 25, Rock => 50); end case; -- Neighboor Bonus if CX > 0 then Proba (Get_Cell (CX - 1, CY)) := Proba (Get_Cell (CX - 1, CY)) + 20; end if; if CY > 0 then Proba (Get_Cell (CX, CY - 1)) := Proba (Get_Cell (CX, CY - 1)) + 20; end if; if CX < Ground_Width - 1 then Proba (Get_Cell (CX + 1, CY)) := Proba (Get_Cell (CX + 1, CY)) + 20; end if; if CY < Ground_Depth - 1 then Proba (Get_Cell (CX, CY - 1)) := Proba (Get_Cell (CX, CY - 1)) + 20; end if; return From_Proba; end if; end Choose_Cell; --------------------- -- Generate_Ground -- --------------------- procedure Generate_Ground is begin Seed := 5000 + UInt32 (PyGamer.Time.Clock mod 323); for X in 0 .. Ground_Width - 1 loop for Y in 0 .. Ground_Depth - 1 loop Ground (X + Y * Ground_Width) := Choose_Cell (X, Y); end loop; end loop; end Generate_Ground; -------------- -- Collides -- -------------- function Collides (X, Y : Integer) return Boolean is begin if X < 0 or else X >= Cell_Size * Ground_Width or else Y < 0 or else Y >= Cell_Size * Ground_Depth then -- Collides when out of bounds return True; end if; return Ground ((X / Cell_Size) + (Y / Cell_Size) * Ground_Width) /= Empty; end Collides; end World;

27.888235

80

0.369753

1a1d9e52ef3e5d5491da61d5c1e3ac9be742edfd

8,310

adb

Ada

arch/ARM/STM32/driver_demos/demo_L3GD20_dataready_int/src/demo_l3gd20.adb

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

2

2018-05-16T03:56:39.000Z

2019-07-31T13:53:56.000Z

arch/ARM/STM32/driver_demos/demo_L3GD20_dataready_int/src/demo_l3gd20.adb

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

null

arch/ARM/STM32/driver_demos/demo_L3GD20_dataready_int/src/demo_l3gd20.adb

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- Copyright (C) 2016, AdaCore -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions are -- -- met: -- -- 1. Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- 2. Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in -- -- the documentation and/or other materials provided with the -- -- distribution. -- -- 3. Neither the name of the copyright holder nor the names of its -- -- contributors may be used to endorse or promote products derived -- -- from this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT -- -- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, -- -- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY -- -- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -- -- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -- -- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- This program demonstrates the on-board gyro provided by the L3GD20 chip -- on the STM32F429 Discovery boards. The pitch, roll, and yaw values are -- continuously displayed on the LCD, as are the adjusted raw values. Move -- the board to see them change. The values will be positive or negative, -- depending on the direction of movement. Note that the values are not -- constant, even when the board is not moving, due to noise. -- This program demonstrates use of interrupts rather than polling. -- NB: You may need to reset the board after downloading. with Last_Chance_Handler; pragma Unreferenced (Last_Chance_Handler); with Gyro_Interrupts; with Output_Utils; use Output_Utils; with Ada.Synchronous_Task_Control; use Ada.Synchronous_Task_Control; with STM32.Device; use STM32.Device; with STM32.Board; use STM32.Board; with LCD_Std_Out; with L3GD20; use L3GD20; with STM32; use STM32; with STM32.GPIO; use STM32.GPIO; with STM32.EXTI; use STM32.EXTI; procedure Demo_L3GD20 is Axes : L3GD20.Angle_Rates; Stable : L3GD20.Angle_Rates; -- the values when the board is motionless Sensitivity : Float; Scaled_X : Float; Scaled_Y : Float; Scaled_Z : Float; procedure Get_Gyro_Offsets (Offsets : out Angle_Rates; Sample_Count : in Long_Integer); -- Computes the averages for the gyro values returned when the board is -- motionless procedure Configure_Gyro; -- Configures the on-board gyro chip procedure Await_Raw_Angle_Rates (Rates : out Angle_Rates); -- Returns the next angle rates available from the gyro, for all three -- axes. Suspends until the gyro generates an interrupt indicating data -- available. The interrupt handler sets a Suspension_Object to allow -- the caller to resume, at which point it gets the raw data from the gyro. procedure Configure_Gyro_Interrupt; -- Configures the gyro's "data ready" interrupt (interrupt #2) on the -- required port/pin for the F429 Discovery board. Enables the interrupt. -- See the F429 Disco User Manual, Table 6, pg 19, for the port/pin. --------------------------- -- Await_Raw_Angle_Rates -- --------------------------- procedure Await_Raw_Angle_Rates (Rates : out Angle_Rates) is begin Suspend_Until_True (Gyro_Interrupts.Data_Available); Get_Raw_Angle_Rates (Gyro, Rates); end Await_Raw_Angle_Rates; -------------------- -- Configure_Gyro -- -------------------- procedure Configure_Gyro is begin -- Init the on-board gyro SPI and GPIO. This is board-specific, not -- every board has a gyro. The F429 Discovery does, for example, but -- the F4 Discovery does not. STM32.Board.Initialize_Gyro_IO; Gyro.Reset; Gyro.Configure (Power_Mode => L3GD20_Mode_Active, Output_Data_Rate => L3GD20_Output_Data_Rate_95Hz, Axes_Enable => L3GD20_Axes_Enable, Bandwidth => L3GD20_Bandwidth_1, BlockData_Update => L3GD20_BlockDataUpdate_Continous, Endianness => L3GD20_Little_Endian, Full_Scale => L3GD20_Fullscale_250); Gyro.Enable_Low_Pass_Filter; end Configure_Gyro; ------------------------------ -- Configure_Gyro_Interrupt -- ------------------------------ procedure Configure_Gyro_Interrupt is Config : GPIO_Port_Configuration; -- This is the required port/pin configuration on STM32F429 Disco -- boards for interrupt 2 on the L3GD20 gyro. See the F429 Disco -- User Manual, Table 6, pg 19. begin Enable_Clock (MEMS_INT2); Config.Mode := Mode_In; Config.Resistors := Floating; Config.Speed := Speed_50MHz; Configure_IO (MEMS_INT2, Config); Configure_Trigger (MEMS_INT2, Interrupt_Rising_Edge); Gyro.Enable_Data_Ready_Interrupt; -- L3GD20 gyro interrupt 2 end Configure_Gyro_Interrupt; ---------------------- -- Get_Gyro_Offsets -- ---------------------- procedure Get_Gyro_Offsets (Offsets : out Angle_Rates; Sample_Count : in Long_Integer) is Sample : Angle_Rates; Total_X : Long_Integer := 0; Total_Y : Long_Integer := 0; Total_Z : Long_Integer := 0; begin for K in 1 .. Sample_Count loop Await_Raw_Angle_Rates (Sample); Total_X := Total_X + Long_Integer (Sample.X); Total_Y := Total_Y + Long_Integer (Sample.Y); Total_Z := Total_Z + Long_Integer (Sample.Z); end loop; Offsets.X := Angle_Rate (Total_X / Sample_Count); Offsets.Y := Angle_Rate (Total_Y / Sample_Count); Offsets.Z := Angle_Rate (Total_Z / Sample_Count); end Get_Gyro_Offsets; begin LCD_Std_Out.Set_Font (Output_Utils.Selected_Font); Configure_Gyro; Configure_Gyro_Interrupt; Sensitivity := Full_Scale_Sensitivity (Gyro); Print (0, 0, "Calibrating"); Get_Gyro_Offsets (Stable, Sample_Count => 100); -- arbitrary count Print_Static_Content (Stable); loop Await_Raw_Angle_Rates (Axes); -- remove the computed stable offsets from the raw values Axes.X := Axes.X - Stable.X; Axes.Y := Axes.Y - Stable.Y; Axes.Z := Axes.Z - Stable.Z; -- print the values after the stable offset is removed Print (Col_Adjusted, Line1_Adjusted, Axes.X'Img & " "); Print (Col_Adjusted, Line2_Adjusted, Axes.Y'Img & " "); Print (Col_Adjusted, Line3_Adjusted, Axes.Z'Img & " "); -- scale the adjusted values Scaled_X := Float (Axes.X) * Sensitivity; Scaled_Y := Float (Axes.Y) * Sensitivity; Scaled_Z := Float (Axes.Z) * Sensitivity; -- print the final values Print (Final_Column, Line1_Final, Scaled_X'Img & " "); Print (Final_Column, Line2_Final, Scaled_Y'Img & " "); Print (Final_Column, Line3_Final, Scaled_Z'Img & " "); end loop; end Demo_L3GD20;

39.383886

79

0.614561

5834c8ffad4d56f68e5f2aa5e5b6641661838bee

829

adb

Ada

build_gnu/binutils/gdb/testsuite/gdb.ada/null_record/bar.adb

jed-frey/e200-gcc

df1421b421a8ec8729d70791129f5283dee5f9ea

[ "BSD-3-Clause" ]

1

2017-05-31T21:42:12.000Z

build_gnu/binutils/gdb/testsuite/gdb.ada/null_record/bar.adb

jed-frey/e200-gcc

df1421b421a8ec8729d70791129f5283dee5f9ea

[ "BSD-3-Clause" ]

null

build_gnu/binutils/gdb/testsuite/gdb.ada/null_record/bar.adb

jed-frey/e200-gcc

df1421b421a8ec8729d70791129f5283dee5f9ea

[ "BSD-3-Clause" ]

1

2019-12-17T22:04:07.000Z

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

34.541667

73

0.727382

1a7d73e634bd07153c8c300cbf64782c11086ad3

6,202

ads

Ada

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

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

2

2018-05-16T03:56:39.000Z

2019-07-31T13:53:56.000Z

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

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

null

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

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

null

-- This spec has been automatically generated from STM32L0x3.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with HAL; with System; package STM32_SVD.Firewall is pragma Preelaborate; --------------- -- Registers -- --------------- subtype FIREWALL_CSSA_ADD_Field is HAL.UInt16; -- Code segment start address type FIREWALL_CSSA_Register is record -- unspecified Reserved_0_7 : HAL.UInt8 := 16#0#; -- code segment start address ADD : FIREWALL_CSSA_ADD_Field := 16#0#; -- unspecified Reserved_24_31 : HAL.UInt8 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for FIREWALL_CSSA_Register use record Reserved_0_7 at 0 range 0 .. 7; ADD at 0 range 8 .. 23; Reserved_24_31 at 0 range 24 .. 31; end record; subtype FIREWALL_CSL_LENG_Field is HAL.UInt14; -- Code segment length type FIREWALL_CSL_Register is record -- unspecified Reserved_0_7 : HAL.UInt8 := 16#0#; -- code segment length LENG : FIREWALL_CSL_LENG_Field := 16#0#; -- unspecified Reserved_22_31 : HAL.UInt10 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for FIREWALL_CSL_Register use record Reserved_0_7 at 0 range 0 .. 7; LENG at 0 range 8 .. 21; Reserved_22_31 at 0 range 22 .. 31; end record; subtype FIREWALL_NVDSSA_ADD_Field is HAL.UInt16; -- Non-volatile data segment start address type FIREWALL_NVDSSA_Register is record -- unspecified Reserved_0_7 : HAL.UInt8 := 16#0#; -- Non-volatile data segment start address ADD : FIREWALL_NVDSSA_ADD_Field := 16#0#; -- unspecified Reserved_24_31 : HAL.UInt8 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for FIREWALL_NVDSSA_Register use record Reserved_0_7 at 0 range 0 .. 7; ADD at 0 range 8 .. 23; Reserved_24_31 at 0 range 24 .. 31; end record; subtype FIREWALL_NVDSL_LENG_Field is HAL.UInt14; -- Non-volatile data segment length type FIREWALL_NVDSL_Register is record -- unspecified Reserved_0_7 : HAL.UInt8 := 16#0#; -- Non-volatile data segment length LENG : FIREWALL_NVDSL_LENG_Field := 16#0#; -- unspecified Reserved_22_31 : HAL.UInt10 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for FIREWALL_NVDSL_Register use record Reserved_0_7 at 0 range 0 .. 7; LENG at 0 range 8 .. 21; Reserved_22_31 at 0 range 22 .. 31; end record; subtype FIREWALL_VDSSA_ADD_Field is HAL.UInt10; -- Volatile data segment start address type FIREWALL_VDSSA_Register is record -- unspecified Reserved_0_5 : HAL.UInt6 := 16#0#; -- Volatile data segment start address ADD : FIREWALL_VDSSA_ADD_Field := 16#0#; -- unspecified Reserved_16_31 : HAL.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for FIREWALL_VDSSA_Register use record Reserved_0_5 at 0 range 0 .. 5; ADD at 0 range 6 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype FIREWALL_VDSL_LENG_Field is HAL.UInt10; -- Volatile data segment length type FIREWALL_VDSL_Register is record -- unspecified Reserved_0_5 : HAL.UInt6 := 16#0#; -- Non-volatile data segment length LENG : FIREWALL_VDSL_LENG_Field := 16#0#; -- unspecified Reserved_16_31 : HAL.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for FIREWALL_VDSL_Register use record Reserved_0_5 at 0 range 0 .. 5; LENG at 0 range 6 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; -- Configuration register type FIREWALL_CR_Register is record -- Firewall pre alarm FPA : Boolean := False; -- Volatile data shared VDS : Boolean := False; -- Volatile data execution VDE : Boolean := False; -- unspecified Reserved_3_31 : HAL.UInt29 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for FIREWALL_CR_Register use record FPA at 0 range 0 .. 0; VDS at 0 range 1 .. 1; VDE at 0 range 2 .. 2; Reserved_3_31 at 0 range 3 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Firewall type Firewall_Peripheral is record -- Code segment start address FIREWALL_CSSA : aliased FIREWALL_CSSA_Register; -- Code segment length FIREWALL_CSL : aliased FIREWALL_CSL_Register; -- Non-volatile data segment start address FIREWALL_NVDSSA : aliased FIREWALL_NVDSSA_Register; -- Non-volatile data segment length FIREWALL_NVDSL : aliased FIREWALL_NVDSL_Register; -- Volatile data segment start address FIREWALL_VDSSA : aliased FIREWALL_VDSSA_Register; -- Volatile data segment length FIREWALL_VDSL : aliased FIREWALL_VDSL_Register; -- Configuration register FIREWALL_CR : aliased FIREWALL_CR_Register; end record with Volatile; for Firewall_Peripheral use record FIREWALL_CSSA at 16#0# range 0 .. 31; FIREWALL_CSL at 16#4# range 0 .. 31; FIREWALL_NVDSSA at 16#8# range 0 .. 31; FIREWALL_NVDSL at 16#C# range 0 .. 31; FIREWALL_VDSSA at 16#10# range 0 .. 31; FIREWALL_VDSL at 16#14# range 0 .. 31; FIREWALL_CR at 16#20# range 0 .. 31; end record; -- Firewall Firewall_Periph : aliased Firewall_Peripheral with Import, Address => System'To_Address (16#40011C00#); end STM32_SVD.Firewall;

31.642857

65

0.62496

ad70fad85fd51fc30868692dd241a28093613c3a

6,623

adb

Ada

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/g-spchge.adb

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

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

null

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/g-spchge.adb

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

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

null

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/g-spchge.adb

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

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

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- G N A T . S P E L L I N G _ C H E C K E R _ G E N E R I C -- -- -- -- B o d y -- -- -- -- Copyright (C) 1998-2019, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ pragma Compiler_Unit_Warning; package body GNAT.Spelling_Checker_Generic is ------------------------ -- Is_Bad_Spelling_Of -- ------------------------ function Is_Bad_Spelling_Of (Found : String_Type; Expect : String_Type) return Boolean is FN : constant Natural := Found'Length; FF : constant Natural := Found'First; FL : constant Natural := Found'Last; EN : constant Natural := Expect'Length; EF : constant Natural := Expect'First; EL : constant Natural := Expect'Last; Letter_o : constant Char_Type := Char_Type'Val (Character'Pos ('o')); Digit_0 : constant Char_Type := Char_Type'Val (Character'Pos ('0')); Digit_9 : constant Char_Type := Char_Type'Val (Character'Pos ('9')); begin -- If both strings null, then we consider this a match, but if one -- is null and the other is not, then we definitely do not match if FN = 0 then return (EN = 0); elsif EN = 0 then return False; -- If first character does not match, then we consider that this is -- definitely not a misspelling. An exception is when we expect a -- letter O and found a zero. elsif Found (FF) /= Expect (EF) and then (Found (FF) /= Digit_0 or else Expect (EF) /= Letter_o) then return False; -- Not a bad spelling if both strings are 1-2 characters long elsif FN < 3 and then EN < 3 then return False; -- Lengths match. Execute loop to check for a single error, single -- transposition or exact match (we only fall through this loop if -- one of these three conditions is found). elsif FN = EN then for J in 1 .. FN - 2 loop if Expect (EF + J) /= Found (FF + J) then -- If both mismatched characters are digits, then we do -- not consider it a misspelling (e.g. B345 is not a -- misspelling of B346, it is something quite different) if Expect (EF + J) in Digit_0 .. Digit_9 and then Found (FF + J) in Digit_0 .. Digit_9 then return False; elsif Expect (EF + J + 1) = Found (FF + J + 1) and then Expect (EF + J + 2 .. EL) = Found (FF + J + 2 .. FL) then return True; elsif Expect (EF + J) = Found (FF + J + 1) and then Expect (EF + J + 1) = Found (FF + J) and then Expect (EF + J + 2 .. EL) = Found (FF + J + 2 .. FL) then return True; else return False; end if; end if; end loop; -- At last character. Test digit case as above, otherwise we -- have a match since at most this last character fails to match. if Expect (EL) in Digit_0 .. Digit_9 and then Found (FL) in Digit_0 .. Digit_9 and then Expect (EL) /= Found (FL) then return False; else return True; end if; -- Length is 1 too short. Execute loop to check for single deletion elsif FN = EN - 1 then for J in 1 .. FN - 1 loop if Found (FF + J) /= Expect (EF + J) then return Found (FF + J .. FL) = Expect (EF + J + 1 .. EL); end if; end loop; -- If we fall through then the last character was missing, which -- we consider to be a match (e.g. found xyz, expected xyza). return True; -- Length is 1 too long. Execute loop to check for single insertion elsif FN = EN + 1 then for J in 1 .. EN - 1 loop if Found (FF + J) /= Expect (EF + J) then return Found (FF + J + 1 .. FL) = Expect (EF + J .. EL); end if; end loop; -- If we fall through then the last character was an additional -- character, which is a match (e.g. found xyza, expected xyz). return True; -- Length is completely wrong else return False; end if; end Is_Bad_Spelling_Of; end GNAT.Spelling_Checker_Generic;

40.882716

78

0.472143