Datasets:
QueenieFi
/
CodeText_dataset

Dataset card Data Studio Files
xet
 Community
1
CombinedText
stringlengths
4
3.42M
------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Web Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2017-2020, Vadim Godunko <vgodunko@gmail.com> -- -- 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: 5703 $ $Date: 2017-01-20 22:17:20 +0300 (Fri, 20 Jan 2017) $ ------------------------------------------------------------------------------ with Web.Core.Connectables.Slots_0.Slots_1; generic package Web.Core.Slots_1 renames Web.Core.Connectables.Slots_0.Slots_1;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . E X C E P T I O N S . L A S T _ C H A N C E _ H A N D L E R -- -- -- -- S p e c -- -- -- -- Copyright (C) 2003-2009, 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. -- -- -- ------------------------------------------------------------------------------ -- Last chance handler. Unhandled exceptions are passed to this routine pragma Warnings (Off); pragma Compiler_Unit; pragma Warnings (On); procedure Ada.Exceptions.Last_Chance_Handler (Except : Exception_Occurrence); pragma Export (C, Last_Chance_Handler, "__gnat_last_chance_handler"); pragma No_Return (Last_Chance_Handler);
<?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>linebuffer</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>in_stream.V.value.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <direction>0</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs class_id="7" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_2"> <Value> <Obj> <type>1</type> <id>2</id> <name>out_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>out_stream.V.value.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>72</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>2</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_3"> <Value> <Obj> <type>0</type> <id>12</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory> <lineNumber>403</lineNumber> <contextFuncName>linebuffer_2D&amp;lt;4, 4, 1, 1, 1, 1, 3, 3, unsigned char&amp;gt;</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/paper_apps_8_shifts/sharpen</first> <second class_id="11" tracking_level="0" version="0"> <count>4</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>linebuffer&amp;lt;4, 4, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned char&amp;gt;</second> </first> <second>530</second> </item> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>linebuffer_2D&amp;lt;4, 4, 1, 1, 1, 1, 3, 3, unsigned char&amp;gt;</second> </first> <second>403</second> </item> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>linebuffer_3D&amp;lt;4, 4, 1, 1, 1, 3, 3, 1, 1, unsigned char&amp;gt;</second> </first> <second>492</second> </item> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>linebuffer_4D&amp;lt;4, 4, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned char&amp;gt;</second> </first> <second>505</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>16</item> <item>17</item> <item>18</item> </oprand_edges> <opcode>call</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_4"> <Value> <Obj> <type>0</type> <id>13</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory> <lineNumber>531</lineNumber> <contextFuncName>linebuffer&amp;lt;4, 4, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned char&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>linebuffer&amp;lt;4, 4, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned char&amp;gt;</second> </first> <second>531</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>0</count> <item_version>0</item_version> </oprand_edges> <opcode>ret</opcode> <m_Display>0</m_Display> </item> </nodes> <consts class_id="15" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_5"> <Value> <Obj> <type>2</type> <id>15</id> <name>call</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> <const_type>6</const_type> <content>&lt;constant:call&gt;</content> </item> </consts> <blocks class_id="17" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="18" tracking_level="1" version="0" object_id="_6"> <Obj> <type>3</type> <id>14</id> <name>linebuffer</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>12</item> <item>13</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>3</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_7"> <id>16</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>12</sink_obj> </item> <item class_id_reference="20" object_id="_8"> <id>17</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>12</sink_obj> </item> <item class_id_reference="20" object_id="_9"> <id>18</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>12</sink_obj> </item> </edges> </cdfg> <cdfg_regions class_id="21" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="22" tracking_level="1" version="0" object_id="_10"> <mId>1</mId> <mTag>linebuffer</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>14</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>33</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>1</mIsDfPipe> <mDfPipe class_id="23" tracking_level="1" version="0" object_id="_11"> <port_list class_id="24" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </port_list> <process_list class_id="25" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="26" tracking_level="1" version="0" object_id="_12"> <type>0</type> <name>call_U0</name> <ssdmobj_id>12</ssdmobj_id> <pins class_id="27" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="28" tracking_level="1" version="0" object_id="_13"> <port class_id="29" tracking_level="1" version="0" object_id="_14"> <name>in_stream_V_value_V</name> <dir>0</dir> <type>0</type> </port> <inst class_id="30" tracking_level="1" version="0" object_id="_15"> <type>0</type> <name>call_U0</name> <ssdmobj_id>12</ssdmobj_id> </inst> </item> <item class_id_reference="28" object_id="_16"> <port class_id_reference="29" object_id="_17"> <name>out_stream_V_value_V</name> <dir>0</dir> <type>1</type> </port> <inst class_id_reference="30" object_id_reference="_15"></inst> </item> </pins> </item> </process_list> <channel_list class_id="31" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </channel_list> <net_list class_id="32" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </net_list> </mDfPipe> </item> </cdfg_regions> <fsm class_id="-1"></fsm> <res class_id="-1"></res> <node_label_latency class_id="35" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="36" tracking_level="0" version="0"> <first>12</first> <second class_id="37" tracking_level="0" version="0"> <first>0</first> <second>1</second> </second> </item> <item> <first>13</first> <second> <first>1</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit 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>14</first> <second class_id="40" tracking_level="0" version="0"> <first>0</first> <second>1</second> </second> </item> </bblk_ent_exit> <regions class_id="41" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="42" tracking_level="1" version="0" object_id="_18"> <region_name>linebuffer</region_name> <basic_blocks> <count>1</count> <item_version>0</item_version> <item>14</item> </basic_blocks> <nodes> <count>11</count> <item_version>0</item_version> <item>3</item> <item>4</item> <item>5</item> <item>6</item> <item>7</item> <item>8</item> <item>9</item> <item>10</item> <item>11</item> <item>12</item> <item>13</item> </nodes> <anchor_node>-1</anchor_node> <region_type>16</region_type> <interval>0</interval> <pipe_depth>0</pipe_depth> </item> </regions> <dp_fu_nodes class_id="43" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_fu_nodes> <dp_fu_nodes_expression class_id="44" 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="45" 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="46" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_port_io_nodes> <port2core class_id="47" 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>
separate (Numerics.Sparse_Matrices) function Zero (N : in Pos) return Sparse_Matrix is Result : Sparse_Matrix; use Ada.Containers; begin Result.Format := CSC; Result.N_Row := N; Result.N_Col := N; Result.X.Reserve_Capacity (0); Result.I.Reserve_Capacity (0); Result.P.Reserve_Capacity (Count_Type (N + 1)); for I in 1 .. N + 1 loop Result.P.Append (1); end loop; return Result; end Zero;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- Copyright (C) 2013-2016, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package contains board-specific definitions. It needs to be adjusted -- before trying to execute on a specific board. -- This version is specific to the SAM G55 Xplained Pro board. package SAM_Board is type SysClock_Selection is (Internal_RC, External_Crystal); SysClock : constant SysClock_Selection := Internal_RC; end SAM_Board;
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="15"> <syndb class_id="0" tracking_level="0" version="0"> <userIPLatency>-1</userIPLatency> <userIPName></userIPName> <cdfg class_id="1" tracking_level="1" version="0" object_id="_0"> <name>response_r</name> <ret_bitwidth>0</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>6</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>respOutput_V_data_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>respOutput.V.data.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <direction>1</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs class_id="7" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_2"> <Value> <Obj> <type>1</type> <id>2</id> <name>respOutput_V_user_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>respOutput.V.user.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>112</bitwidth> </Value> <direction>1</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_3"> <Value> <Obj> <type>1</type> <id>3</id> <name>respOutput_V_keep_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>respOutput.V.keep.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <direction>1</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_4"> <Value> <Obj> <type>1</type> <id>4</id> <name>respOutput_V_last_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>respOutput.V.last.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <direction>1</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_5"> <Value> <Obj> <type>1</type> <id>8</id> <name>metadataBuffer_rf_V_s</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName>FIFO</coreName> </Obj> <bitwidth>248</bitwidth> </Value> <direction>0</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_6"> <Value> <Obj> <type>1</type> <id>12</id> <name>valueBuffer_rf_V_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName>FIFO</coreName> </Obj> <bitwidth>64</bitwidth> </Value> <direction>0</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> </ports> <nodes class_id="8" tracking_level="0" version="0"> <count>221</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_7"> <Value> <Obj> <type>0</type> <id>18</id> <name>br_outWordCounter_lo</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>291</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_8"> <Value> <Obj> <type>0</type> <id>19</id> <name>tmp_58</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>112</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="11" tracking_level="0" version="0"> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second class_id="12" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="13" tracking_level="0" version="0"> <first class_id="14" tracking_level="0" version="0"> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>112</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>292</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_9"> <Value> <Obj> <type>0</type> <id>20</id> <name>tmp_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>112</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>112</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>293</item> <item>295</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.87</m_delay> </item> <item class_id_reference="9" object_id="_10"> <Value> <Obj> <type>0</type> <id>21</id> <name>outOpCode_load</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>121</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>121</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>296</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_11"> <Value> <Obj> <type>0</type> <id>22</id> <name>errorCode_load</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>121</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>121</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>297</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_12"> <Value> <Obj> <type>0</type> <id>23</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>112</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>112</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>298</item> <item>299</item> <item>300</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_13"> <Value> <Obj> <type>0</type> <id>25</id> <name>tmp_i_82</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>120</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>120</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>336</item> <item>338</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.87</m_delay> </item> <item class_id_reference="9" object_id="_14"> <Value> <Obj> <type>0</type> <id>26</id> <name>valueLength_load</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>185</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>185</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>339</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_15"> <Value> <Obj> <type>0</type> <id>27</id> <name>p_Val2_5</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>182</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>182</second> </item> </second> </item> </inlineStackInfo> <originalName>__Val2__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>340</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_16"> <Value> <Obj> <type>0</type> <id>28</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>120</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>120</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>341</item> <item>342</item> <item>343</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_17"> <Value> <Obj> <type>0</type> <id>30</id> <name>tmp_18_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>156</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>156</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>485</item> <item>487</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.87</m_delay> </item> <item class_id_reference="9" object_id="_18"> <Value> <Obj> <type>0</type> <id>31</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>156</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>156</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>488</item> <item>489</item> <item>490</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_19"> <Value> <Obj> <type>0</type> <id>33</id> <name>tmp_24_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>169</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>169</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>565</item> <item>567</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.87</m_delay> </item> <item class_id_reference="9" object_id="_20"> <Value> <Obj> <type>0</type> <id>34</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>169</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>169</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>568</item> <item>569</item> <item>570</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_21"> <Value> <Obj> <type>0</type> <id>36</id> <name>tmp_29_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>180</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>180</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>624</item> <item>626</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.87</m_delay> </item> <item class_id_reference="9" object_id="_22"> <Value> <Obj> <type>0</type> <id>37</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>180</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>180</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>627</item> <item>628</item> <item>629</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_23"> <Value> <Obj> <type>0</type> <id>39</id> <name>tmp_31_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>197</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>197</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>949</item> <item>951</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.87</m_delay> </item> <item class_id_reference="9" object_id="_24"> <Value> <Obj> <type>0</type> <id>40</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>197</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>197</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>952</item> <item>953</item> <item>954</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_25"> <Value> <Obj> <type>0</type> <id>42</id> <name>tmp_35_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>225</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>225</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>1632</item> <item>1634</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.87</m_delay> </item> <item class_id_reference="9" object_id="_26"> <Value> <Obj> <type>0</type> <id>43</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>225</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>225</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>1635</item> <item>1636</item> <item>1637</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_27"> <Value> <Obj> <type>0</type> <id>45</id> <name>tmp_41_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>233</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>233</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>1916</item> <item>1918</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.87</m_delay> </item> <item class_id_reference="9" object_id="_28"> <Value> <Obj> <type>0</type> <id>46</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>233</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>233</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>1919</item> <item>1920</item> <item>1921</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_29"> <Value> <Obj> <type>0</type> <id>48</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>234</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>234</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>1922</item> <item>1923</item> <item>2148</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.20</m_delay> </item> <item class_id_reference="9" object_id="_30"> <Value> <Obj> <type>0</type> <id>49</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>237</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>237</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>9</count> <item_version>0</item_version> <item>1924</item> <item>1925</item> <item>1926</item> <item>1927</item> <item>1928</item> <item>1930</item> <item>1931</item> <item>1932</item> <item>1933</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_31"> <Value> <Obj> <type>0</type> <id>50</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>238</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>238</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>1934</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_32"> <Value> <Obj> <type>0</type> <id>52</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>1935</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_33"> <Value> <Obj> <type>0</type> <id>54</id> <name>tmp_10_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>226</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>226</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>1638</item> <item>1639</item> <item>1640</item> <item>1641</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_34"> <Value> <Obj> <type>0</type> <id>55</id> <name>p_Result_10</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>226</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>226</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1642</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_35"> <Value> <Obj> <type>0</type> <id>56</id> <name>tmp_68</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>227</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>227</second> </item> </second> </item> </inlineStackInfo> <originalName>lengthValue</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1643</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_36"> <Value> <Obj> <type>0</type> <id>57</id> <name>tempOutput_keep_V_5</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>227</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>227</second> </item> </second> </item> </inlineStackInfo> <originalName>tempOutput.keep.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>258</count> <item_version>0</item_version> <item>1644</item> <item>1645</item> <item>1646</item> <item>1647</item> <item>1648</item> <item>1649</item> <item>1650</item> <item>1651</item> <item>1652</item> <item>1653</item> <item>1654</item> <item>1655</item> <item>1656</item> <item>1657</item> <item>1658</item> <item>1659</item> <item>1660</item> <item>1661</item> <item>1662</item> <item>1663</item> <item>1664</item> <item>1665</item> <item>1666</item> <item>1667</item> <item>1668</item> <item>1669</item> <item>1670</item> <item>1671</item> <item>1672</item> <item>1673</item> <item>1674</item> <item>1675</item> <item>1676</item> <item>1677</item> <item>1678</item> <item>1679</item> <item>1680</item> <item>1681</item> <item>1682</item> <item>1683</item> <item>1684</item> <item>1685</item> <item>1686</item> <item>1687</item> <item>1688</item> <item>1689</item> <item>1690</item> <item>1691</item> <item>1692</item> <item>1693</item> <item>1694</item> <item>1695</item> <item>1696</item> <item>1697</item> <item>1698</item> <item>1699</item> <item>1700</item> <item>1701</item> <item>1702</item> <item>1703</item> <item>1704</item> <item>1705</item> <item>1706</item> <item>1707</item> <item>1708</item> <item>1709</item> <item>1710</item> <item>1711</item> <item>1712</item> <item>1713</item> <item>1714</item> <item>1715</item> <item>1716</item> <item>1717</item> <item>1718</item> <item>1719</item> <item>1720</item> <item>1721</item> <item>1722</item> <item>1723</item> <item>1724</item> <item>1725</item> <item>1726</item> <item>1727</item> <item>1728</item> <item>1729</item> <item>1730</item> <item>1731</item> <item>1732</item> <item>1733</item> <item>1734</item> <item>1735</item> <item>1736</item> <item>1737</item> <item>1738</item> <item>1739</item> <item>1740</item> <item>1741</item> <item>1742</item> <item>1743</item> <item>1744</item> <item>1745</item> <item>1746</item> <item>1747</item> <item>1748</item> <item>1749</item> <item>1750</item> <item>1751</item> <item>1752</item> <item>1753</item> <item>1754</item> <item>1755</item> <item>1756</item> <item>1757</item> <item>1758</item> <item>1759</item> <item>1760</item> <item>1761</item> <item>1762</item> <item>1763</item> <item>1764</item> <item>1765</item> <item>1766</item> <item>1767</item> <item>1768</item> <item>1769</item> <item>1770</item> <item>1771</item> <item>1772</item> <item>1773</item> <item>1774</item> <item>1775</item> <item>1776</item> <item>1777</item> <item>1778</item> <item>1779</item> <item>1780</item> <item>1781</item> <item>1782</item> <item>1783</item> <item>1784</item> <item>1785</item> <item>1786</item> <item>1787</item> <item>1788</item> <item>1789</item> <item>1790</item> <item>1791</item> <item>1792</item> <item>1793</item> <item>1794</item> <item>1795</item> <item>1796</item> <item>1797</item> <item>1798</item> <item>1799</item> <item>1800</item> <item>1801</item> <item>1802</item> <item>1803</item> <item>1804</item> <item>1805</item> <item>1806</item> <item>1807</item> <item>1808</item> <item>1809</item> <item>1810</item> <item>1811</item> <item>1812</item> <item>1813</item> <item>1814</item> <item>1815</item> <item>1816</item> <item>1817</item> <item>1818</item> <item>1819</item> <item>1820</item> <item>1821</item> <item>1822</item> <item>1823</item> <item>1824</item> <item>1825</item> <item>1826</item> <item>1827</item> <item>1828</item> <item>1829</item> <item>1830</item> <item>1831</item> <item>1832</item> <item>1833</item> <item>1834</item> <item>1835</item> <item>1836</item> <item>1837</item> <item>1838</item> <item>1839</item> <item>1840</item> <item>1841</item> <item>1842</item> <item>1843</item> <item>1844</item> <item>1845</item> <item>1846</item> <item>1847</item> <item>1848</item> <item>1849</item> <item>1850</item> <item>1851</item> <item>1852</item> <item>1853</item> <item>1854</item> <item>1855</item> <item>1856</item> <item>1857</item> <item>1858</item> <item>1859</item> <item>1860</item> <item>1861</item> <item>1862</item> <item>1863</item> <item>1864</item> <item>1865</item> <item>1866</item> <item>1867</item> <item>1868</item> <item>1869</item> <item>1870</item> <item>1871</item> <item>1872</item> <item>1873</item> <item>1874</item> <item>1875</item> <item>1876</item> <item>1877</item> <item>1878</item> <item>1879</item> <item>1880</item> <item>1881</item> <item>1882</item> <item>1883</item> <item>1884</item> <item>1885</item> <item>1886</item> <item>1887</item> <item>1888</item> <item>1889</item> <item>1890</item> <item>1891</item> <item>1892</item> <item>1893</item> <item>1894</item> <item>1895</item> <item>1896</item> <item>1897</item> <item>1898</item> <item>1899</item> <item>1900</item> <item>1901</item> </oprand_edges> <opcode>mux</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.27</m_delay> </item> <item class_id_reference="9" object_id="_37"> <Value> <Obj> <type>0</type> <id>58</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>228</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>228</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>1902</item> <item>1903</item> <item>2154</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.00</m_delay> </item> <item class_id_reference="9" object_id="_38"> <Value> <Obj> <type>0</type> <id>59</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>230</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>230</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>1904</item> <item>1905</item> <item>2146</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.20</m_delay> </item> <item class_id_reference="9" object_id="_39"> <Value> <Obj> <type>0</type> <id>60</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>231</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>231</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>9</count> <item_version>0</item_version> <item>1906</item> <item>1907</item> <item>1908</item> <item>1909</item> <item>1910</item> <item>1911</item> <item>1912</item> <item>1913</item> <item>1914</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_40"> <Value> <Obj> <type>0</type> <id>61</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>232</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>232</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>1915</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_41"> <Value> <Obj> <type>0</type> <id>63</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>1936</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.92</m_delay> </item> <item class_id_reference="9" object_id="_42"> <Value> <Obj> <type>0</type> <id>65</id> <name>tmp_34_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>198</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>198</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>955</item> <item>957</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.18</m_delay> </item> <item class_id_reference="9" object_id="_43"> <Value> <Obj> <type>0</type> <id>66</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>198</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>198</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>958</item> <item>959</item> <item>960</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_44"> <Value> <Obj> <type>0</type> <id>68</id> <name>tmp_6</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>198</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>198</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>961</item> <item>962</item> <item>963</item> </oprand_edges> <opcode>nbreadreq</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_45"> <Value> <Obj> <type>0</type> <id>69</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>198</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>198</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>964</item> <item>965</item> <item>966</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_46"> <Value> <Obj> <type>0</type> <id>71</id> <name>tmp_39_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>216</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>216</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>1285</item> <item>1286</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.18</m_delay> </item> <item class_id_reference="9" object_id="_47"> <Value> <Obj> <type>0</type> <id>72</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>216</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>216</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>1287</item> <item>1288</item> <item>1289</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_48"> <Value> <Obj> <type>0</type> <id>74</id> <name>tmp_71</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>185</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>185</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1290</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_49"> <Value> <Obj> <type>0</type> <id>75</id> <name>tmp_48_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>6</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1292</item> <item>1293</item> <item>1295</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_50"> <Value> <Obj> <type>0</type> <id>76</id> <name>Hi_assign</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</second> </item> </second> </item> </inlineStackInfo> <originalName>Hi</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>6</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1297</item> <item>1298</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.18</m_delay> </item> <item class_id_reference="9" object_id="_51"> <Value> <Obj> <type>0</type> <id>77</id> <name>Hi_assign_2</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</second> </item> </second> </item> </inlineStackInfo> <originalName>Hi</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>6</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1300</item> <item>1301</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.18</m_delay> </item> <item class_id_reference="9" object_id="_52"> <Value> <Obj> <type>0</type> <id>78</id> <name>tmp_72</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1303</item> <item>1304</item> <item>1306</item> </oprand_edges> <opcode>bitselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_53"> <Value> <Obj> <type>0</type> <id>79</id> <name>rev</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</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>1307</item> <item>1308</item> </oprand_edges> <opcode>xor</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.48</m_delay> </item> <item class_id_reference="9" object_id="_54"> <Value> <Obj> <type>0</type> <id>80</id> <name>tmp_73</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1309</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_55"> <Value> <Obj> <type>0</type> <id>81</id> <name>tmp_74</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</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>1311</item> <item>1312</item> <item>1313</item> <item>1314</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_56"> <Value> <Obj> <type>0</type> <id>82</id> <name>tmp_75</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1316</item> <item>1317</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.27</m_delay> </item> <item class_id_reference="9" object_id="_57"> <Value> <Obj> <type>0</type> <id>83</id> <name>tmp_76</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1319</item> <item>1320</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.18</m_delay> </item> <item class_id_reference="9" object_id="_58"> <Value> <Obj> <type>0</type> <id>84</id> <name>tmp_77</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>1321</item> <item>1322</item> <item>1323</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_59"> <Value> <Obj> <type>0</type> <id>85</id> <name>tmp_78</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</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>1324</item> <item>1325</item> <item>1326</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.62</m_delay> </item> <item class_id_reference="9" object_id="_60"> <Value> <Obj> <type>0</type> <id>86</id> <name>tmp_79</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1328</item> <item>1329</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.27</m_delay> </item> <item class_id_reference="9" object_id="_61"> <Value> <Obj> <type>0</type> <id>87</id> <name>tmp_80</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</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>1330</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_62"> <Value> <Obj> <type>0</type> <id>88</id> <name>st</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>33</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>1332</item> <item>1333</item> <item>1334</item> <item>1335</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_63"> <Value> <Obj> <type>0</type> <id>89</id> <name>tmp_81</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</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>1336</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_64"> <Value> <Obj> <type>0</type> <id>90</id> <name>sf</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>1337</item> <item>1338</item> <item>1339</item> <item>1340</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_65"> <Value> <Obj> <type>0</type> <id>91</id> <name>tmp_82</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</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>1341</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_66"> <Value> <Obj> <type>0</type> <id>92</id> <name>tmp_83</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</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>1342</item> <item>1343</item> <item>1344</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_67"> <Value> <Obj> <type>0</type> <id>93</id> <name>tmp_84</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1346</item> <item>1347</item> </oprand_edges> <opcode>lshr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_68"> <Value> <Obj> <type>0</type> <id>94</id> <name>p_Result_8</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1348</item> <item>1349</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_69"> <Value> <Obj> <type>0</type> <id>95</id> <name>tmp_86</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1350</item> </oprand_edges> <opcode>sext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_70"> <Value> <Obj> <type>0</type> <id>96</id> <name>tmp_87</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1351</item> <item>1352</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.27</m_delay> </item> <item class_id_reference="9" object_id="_71"> <Value> <Obj> <type>0</type> <id>97</id> <name>tmp_88</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</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>1353</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_72"> <Value> <Obj> <type>0</type> <id>98</id> <name>tmp_89</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1354</item> <item>1355</item> </oprand_edges> <opcode>lshr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_73"> <Value> <Obj> <type>0</type> <id>99</id> <name>p_Result_9</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>217</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>217</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1356</item> <item>1357</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.58</m_delay> </item> <item class_id_reference="9" object_id="_74"> <Value> <Obj> <type>0</type> <id>100</id> <name>tmp_91</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>218</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>218</second> </item> </second> </item> </inlineStackInfo> <originalName>lengthValue</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>1358</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_75"> <Value> <Obj> <type>0</type> <id>101</id> <name>tempOutput_keep_V_4</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>218</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>218</second> </item> </second> </item> </inlineStackInfo> <originalName>tempOutput.keep.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>258</count> <item_version>0</item_version> <item>1359</item> <item>1360</item> <item>1361</item> <item>1362</item> <item>1363</item> <item>1364</item> <item>1365</item> <item>1366</item> <item>1367</item> <item>1368</item> <item>1369</item> <item>1370</item> <item>1371</item> <item>1372</item> <item>1373</item> <item>1374</item> <item>1375</item> <item>1376</item> <item>1377</item> <item>1378</item> <item>1379</item> <item>1380</item> <item>1381</item> <item>1382</item> <item>1383</item> <item>1384</item> <item>1385</item> <item>1386</item> <item>1387</item> <item>1388</item> <item>1389</item> <item>1390</item> <item>1391</item> <item>1392</item> <item>1393</item> <item>1394</item> <item>1395</item> <item>1396</item> <item>1397</item> <item>1398</item> <item>1399</item> <item>1400</item> <item>1401</item> <item>1402</item> <item>1403</item> <item>1404</item> <item>1405</item> <item>1406</item> <item>1407</item> <item>1408</item> <item>1409</item> <item>1410</item> <item>1411</item> <item>1412</item> <item>1413</item> <item>1414</item> <item>1415</item> <item>1416</item> <item>1417</item> <item>1418</item> <item>1419</item> <item>1420</item> <item>1421</item> <item>1422</item> <item>1423</item> <item>1424</item> <item>1425</item> <item>1426</item> <item>1427</item> <item>1428</item> <item>1429</item> <item>1430</item> <item>1431</item> <item>1432</item> <item>1433</item> <item>1434</item> <item>1435</item> <item>1436</item> <item>1437</item> <item>1438</item> <item>1439</item> <item>1440</item> <item>1441</item> <item>1442</item> <item>1443</item> <item>1444</item> <item>1445</item> <item>1446</item> <item>1447</item> <item>1448</item> <item>1449</item> <item>1450</item> <item>1451</item> <item>1452</item> <item>1453</item> <item>1454</item> <item>1455</item> <item>1456</item> <item>1457</item> <item>1458</item> <item>1459</item> <item>1460</item> <item>1461</item> <item>1462</item> <item>1463</item> <item>1464</item> <item>1465</item> <item>1466</item> <item>1467</item> <item>1468</item> <item>1469</item> <item>1470</item> <item>1471</item> <item>1472</item> <item>1473</item> <item>1474</item> <item>1475</item> <item>1476</item> <item>1477</item> <item>1478</item> <item>1479</item> <item>1480</item> <item>1481</item> <item>1482</item> <item>1483</item> <item>1484</item> <item>1485</item> <item>1486</item> <item>1487</item> <item>1488</item> <item>1489</item> <item>1490</item> <item>1491</item> <item>1492</item> <item>1493</item> <item>1494</item> <item>1495</item> <item>1496</item> <item>1497</item> <item>1498</item> <item>1499</item> <item>1500</item> <item>1501</item> <item>1502</item> <item>1503</item> <item>1504</item> <item>1505</item> <item>1506</item> <item>1507</item> <item>1508</item> <item>1509</item> <item>1510</item> <item>1511</item> <item>1512</item> <item>1513</item> <item>1514</item> <item>1515</item> <item>1516</item> <item>1517</item> <item>1518</item> <item>1519</item> <item>1520</item> <item>1521</item> <item>1522</item> <item>1523</item> <item>1524</item> <item>1525</item> <item>1526</item> <item>1527</item> <item>1528</item> <item>1529</item> <item>1530</item> <item>1531</item> <item>1532</item> <item>1533</item> <item>1534</item> <item>1535</item> <item>1536</item> <item>1537</item> <item>1538</item> <item>1539</item> <item>1540</item> <item>1541</item> <item>1542</item> <item>1543</item> <item>1544</item> <item>1545</item> <item>1546</item> <item>1547</item> <item>1548</item> <item>1549</item> <item>1550</item> <item>1551</item> <item>1552</item> <item>1553</item> <item>1554</item> <item>1555</item> <item>1556</item> <item>1557</item> <item>1558</item> <item>1559</item> <item>1560</item> <item>1561</item> <item>1562</item> <item>1563</item> <item>1564</item> <item>1565</item> <item>1566</item> <item>1567</item> <item>1568</item> <item>1569</item> <item>1570</item> <item>1571</item> <item>1572</item> <item>1573</item> <item>1574</item> <item>1575</item> <item>1576</item> <item>1577</item> <item>1578</item> <item>1579</item> <item>1580</item> <item>1581</item> <item>1582</item> <item>1583</item> <item>1584</item> <item>1585</item> <item>1586</item> <item>1587</item> <item>1588</item> <item>1589</item> <item>1590</item> <item>1591</item> <item>1592</item> <item>1593</item> <item>1594</item> <item>1595</item> <item>1596</item> <item>1597</item> <item>1598</item> <item>1599</item> <item>1600</item> <item>1601</item> <item>1602</item> <item>1603</item> <item>1604</item> <item>1605</item> <item>1606</item> <item>1607</item> <item>1608</item> <item>1609</item> <item>1610</item> <item>1611</item> <item>1612</item> <item>1613</item> <item>1614</item> <item>1615</item> <item>1616</item> </oprand_edges> <opcode>mux</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.27</m_delay> </item> <item class_id_reference="9" object_id="_76"> <Value> <Obj> <type>0</type> <id>102</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>219</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>219</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>1617</item> <item>1618</item> <item>2156</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.00</m_delay> </item> <item class_id_reference="9" object_id="_77"> <Value> <Obj> <type>0</type> <id>103</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>221</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>221</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>1619</item> <item>1620</item> <item>2147</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.20</m_delay> </item> <item class_id_reference="9" object_id="_78"> <Value> <Obj> <type>0</type> <id>104</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>222</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>222</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>9</count> <item_version>0</item_version> <item>1621</item> <item>1622</item> <item>1623</item> <item>1624</item> <item>1625</item> <item>1626</item> <item>1627</item> <item>1628</item> <item>1629</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_79"> <Value> <Obj> <type>0</type> <id>105</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>223</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>223</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>1630</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_80"> <Value> <Obj> <type>0</type> <id>107</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>1631</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.92</m_delay> </item> <item class_id_reference="9" object_id="_81"> <Value> <Obj> <type>0</type> <id>109</id> <name>p_Result_15_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>201</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>201</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>968</item> <item>969</item> <item>971</item> <item>972</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_82"> <Value> <Obj> <type>0</type> <id>110</id> <name>tmp_V_5</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>202</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>202</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>973</item> <item>974</item> <item>2157</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.39</m_delay> </item> <item class_id_reference="9" object_id="_83"> <Value> <Obj> <type>0</type> <id>111</id> <name>tmp_69</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>203</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>203</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>975</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_84"> <Value> <Obj> <type>0</type> <id>112</id> <name>p_Result_7</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>203</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>203</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>976</item> <item>977</item> <item>978</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_85"> <Value> <Obj> <type>0</type> <id>113</id> <name>tmp_70</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>205</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>205</second> </item> </second> </item> </inlineStackInfo> <originalName>lengthValue</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>979</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_86"> <Value> <Obj> <type>0</type> <id>114</id> <name>tempKeep_V</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>205</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>205</second> </item> </second> </item> </inlineStackInfo> <originalName>tempKeep.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>258</count> <item_version>0</item_version> <item>980</item> <item>981</item> <item>982</item> <item>983</item> <item>984</item> <item>985</item> <item>986</item> <item>987</item> <item>988</item> <item>989</item> <item>990</item> <item>991</item> <item>992</item> <item>993</item> <item>994</item> <item>995</item> <item>996</item> <item>997</item> <item>998</item> <item>999</item> <item>1000</item> <item>1001</item> <item>1002</item> <item>1003</item> <item>1004</item> <item>1005</item> <item>1006</item> <item>1007</item> <item>1008</item> <item>1009</item> <item>1010</item> <item>1011</item> <item>1012</item> <item>1013</item> <item>1014</item> <item>1015</item> <item>1016</item> <item>1017</item> <item>1018</item> <item>1019</item> <item>1020</item> <item>1021</item> <item>1022</item> <item>1023</item> <item>1024</item> <item>1025</item> <item>1026</item> <item>1027</item> <item>1028</item> <item>1029</item> <item>1030</item> <item>1031</item> <item>1032</item> <item>1033</item> <item>1034</item> <item>1035</item> <item>1036</item> <item>1037</item> <item>1038</item> <item>1039</item> <item>1040</item> <item>1041</item> <item>1042</item> <item>1043</item> <item>1044</item> <item>1045</item> <item>1046</item> <item>1047</item> <item>1048</item> <item>1049</item> <item>1050</item> <item>1051</item> <item>1052</item> <item>1053</item> <item>1054</item> <item>1055</item> <item>1056</item> <item>1057</item> <item>1058</item> <item>1059</item> <item>1060</item> <item>1061</item> <item>1062</item> <item>1063</item> <item>1064</item> <item>1065</item> <item>1066</item> <item>1067</item> <item>1068</item> <item>1069</item> <item>1070</item> <item>1071</item> <item>1072</item> <item>1073</item> <item>1074</item> <item>1075</item> <item>1076</item> <item>1077</item> <item>1078</item> <item>1079</item> <item>1080</item> <item>1081</item> <item>1082</item> <item>1083</item> <item>1084</item> <item>1085</item> <item>1086</item> <item>1087</item> <item>1088</item> <item>1089</item> <item>1090</item> <item>1091</item> <item>1092</item> <item>1093</item> <item>1094</item> <item>1095</item> <item>1096</item> <item>1097</item> <item>1098</item> <item>1099</item> <item>1100</item> <item>1101</item> <item>1102</item> <item>1103</item> <item>1104</item> <item>1105</item> <item>1106</item> <item>1107</item> <item>1108</item> <item>1109</item> <item>1110</item> <item>1111</item> <item>1112</item> <item>1113</item> <item>1114</item> <item>1115</item> <item>1116</item> <item>1117</item> <item>1118</item> <item>1119</item> <item>1120</item> <item>1121</item> <item>1122</item> <item>1123</item> <item>1124</item> <item>1125</item> <item>1126</item> <item>1127</item> <item>1128</item> <item>1129</item> <item>1130</item> <item>1131</item> <item>1132</item> <item>1133</item> <item>1134</item> <item>1135</item> <item>1136</item> <item>1137</item> <item>1138</item> <item>1139</item> <item>1140</item> <item>1141</item> <item>1142</item> <item>1143</item> <item>1144</item> <item>1145</item> <item>1146</item> <item>1147</item> <item>1148</item> <item>1149</item> <item>1150</item> <item>1151</item> <item>1152</item> <item>1153</item> <item>1154</item> <item>1155</item> <item>1156</item> <item>1157</item> <item>1158</item> <item>1159</item> <item>1160</item> <item>1161</item> <item>1162</item> <item>1163</item> <item>1164</item> <item>1165</item> <item>1166</item> <item>1167</item> <item>1168</item> <item>1169</item> <item>1170</item> <item>1171</item> <item>1172</item> <item>1173</item> <item>1174</item> <item>1175</item> <item>1176</item> <item>1177</item> <item>1178</item> <item>1179</item> <item>1180</item> <item>1181</item> <item>1182</item> <item>1183</item> <item>1184</item> <item>1185</item> <item>1186</item> <item>1187</item> <item>1188</item> <item>1189</item> <item>1190</item> <item>1191</item> <item>1192</item> <item>1193</item> <item>1194</item> <item>1195</item> <item>1196</item> <item>1197</item> <item>1198</item> <item>1199</item> <item>1200</item> <item>1201</item> <item>1202</item> <item>1203</item> <item>1204</item> <item>1205</item> <item>1206</item> <item>1207</item> <item>1208</item> <item>1209</item> <item>1210</item> <item>1211</item> <item>1212</item> <item>1213</item> <item>1214</item> <item>1215</item> <item>1216</item> <item>1217</item> <item>1218</item> <item>1219</item> <item>1220</item> <item>1221</item> <item>1222</item> <item>1223</item> <item>1224</item> <item>1225</item> <item>1226</item> <item>1227</item> <item>1228</item> <item>1229</item> <item>1230</item> <item>1231</item> <item>1232</item> <item>1233</item> <item>1234</item> <item>1235</item> <item>1236</item> <item>1237</item> </oprand_edges> <opcode>mux</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.27</m_delay> </item> <item class_id_reference="9" object_id="_87"> <Value> <Obj> <type>0</type> <id>115</id> <name>tmp_43_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>206</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>206</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>1238</item> <item>1240</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.18</m_delay> </item> <item class_id_reference="9" object_id="_88"> <Value> <Obj> <type>0</type> <id>116</id> <name>tmp_44_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>206</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>206</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>1241</item> <item>1242</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.30</m_delay> </item> <item class_id_reference="9" object_id="_89"> <Value> <Obj> <type>0</type> <id>117</id> <name>tmp_45_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>206</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>206</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>1243</item> <item>1244</item> <item>1246</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.47</m_delay> </item> <item class_id_reference="9" object_id="_90"> <Value> <Obj> <type>0</type> <id>118</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>206</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>206</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>1247</item> <item>1248</item> <item>2155</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.00</m_delay> </item> <item class_id_reference="9" object_id="_91"> <Value> <Obj> <type>0</type> <id>119</id> <name>tmp_46_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>207</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>207</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>1249</item> <item>1250</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.18</m_delay> </item> <item class_id_reference="9" object_id="_92"> <Value> <Obj> <type>0</type> <id>120</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>207</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</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>1251</item> <item>1252</item> <item>1253</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_93"> <Value> <Obj> <type>0</type> <id>122</id> <name>tmp_50_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>212</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>212</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>1257</item> <item>1258</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.18</m_delay> </item> <item class_id_reference="9" object_id="_94"> <Value> <Obj> <type>0</type> <id>123</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>212</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>212</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>1259</item> <item>1260</item> <item>1261</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_95"> <Value> <Obj> <type>0</type> <id>125</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>213</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>213</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>1263</item> <item>1264</item> <item>2150</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.20</m_delay> </item> <item class_id_reference="9" object_id="_96"> <Value> <Obj> <type>0</type> <id>126</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>213</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>213</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>1265</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_97"> <Value> <Obj> <type>0</type> <id>128</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>1266</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_98"> <Value> <Obj> <type>0</type> <id>130</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>209</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>209</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>1254</item> <item>1255</item> <item>2149</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.20</m_delay> </item> <item class_id_reference="9" object_id="_99"> <Value> <Obj> <type>0</type> <id>131</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>211</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>211</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>1256</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_100"> <Value> <Obj> <type>0</type> <id>133</id> <name>tmp_last_V_2</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>tmp.last.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>1267</item> <item>1268</item> <item>1269</item> <item>1270</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_101"> <Value> <Obj> <type>0</type> <id>134</id> <name>tmp_keep_V_3</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>tempOutput.keep.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>1271</item> <item>1272</item> <item>1273</item> <item>1274</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_102"> <Value> <Obj> <type>0</type> <id>135</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>214</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>214</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>9</count> <item_version>0</item_version> <item>1275</item> <item>1276</item> <item>1277</item> <item>1278</item> <item>1279</item> <item>1280</item> <item>1281</item> <item>1282</item> <item>1283</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_103"> <Value> <Obj> <type>0</type> <id>136</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>215</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>215</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>1284</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.92</m_delay> </item> <item class_id_reference="9" object_id="_104"> <Value> <Obj> <type>0</type> <id>138</id> <name>tmp_5</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>181</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>181</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>630</item> <item>631</item> <item>632</item> </oprand_edges> <opcode>nbreadreq</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_105"> <Value> <Obj> <type>0</type> <id>139</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>181</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>181</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>633</item> <item>634</item> <item>635</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.92</m_delay> </item> <item class_id_reference="9" object_id="_106"> <Value> <Obj> <type>0</type> <id>141</id> <name>tmp_65</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>182</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>182</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>636</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_107"> <Value> <Obj> <type>0</type> <id>142</id> <name>tmp_V_4</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>183</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>183</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>637</item> <item>638</item> <item>2158</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.39</m_delay> </item> <item class_id_reference="9" object_id="_108"> <Value> <Obj> <type>0</type> <id>143</id> <name>tmp_66</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>184</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>184</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>639</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_109"> <Value> <Obj> <type>0</type> <id>144</id> <name>p_Result_6</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>184</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>184</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>641</item> <item>642</item> <item>643</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_110"> <Value> <Obj> <type>0</type> <id>145</id> <name>tmp_33_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>185</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>185</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>644</item> <item>646</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.18</m_delay> </item> <item class_id_reference="9" object_id="_111"> <Value> <Obj> <type>0</type> <id>146</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>185</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>185</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>647</item> <item>648</item> <item>649</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_112"> <Value> <Obj> <type>0</type> <id>148</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>191</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>191</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>923</item> <item>924</item> <item>2145</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.20</m_delay> </item> <item class_id_reference="9" object_id="_113"> <Value> <Obj> <type>0</type> <id>149</id> <name>tmp_38_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>192</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>192</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>925</item> <item>927</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.30</m_delay> </item> <item class_id_reference="9" object_id="_114"> <Value> <Obj> <type>0</type> <id>150</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>192</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>192</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>928</item> <item>929</item> <item>2153</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.00</m_delay> </item> <item class_id_reference="9" object_id="_115"> <Value> <Obj> <type>0</type> <id>151</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>930</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_116"> <Value> <Obj> <type>0</type> <id>153</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>186</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>186</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>650</item> <item>651</item> <item>2144</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.20</m_delay> </item> <item class_id_reference="9" object_id="_117"> <Value> <Obj> <type>0</type> <id>154</id> <name>tmp_67</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>188</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>188</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>652</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_118"> <Value> <Obj> <type>0</type> <id>155</id> <name>lengthValue_assign</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>188</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>188</second> </item> </second> </item> </inlineStackInfo> <originalName>lengthValue</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>653</item> <item>654</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.01</m_delay> </item> <item class_id_reference="9" object_id="_119"> <Value> <Obj> <type>0</type> <id>156</id> <name>tmp_37_cast_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>188</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>188</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>655</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_120"> <Value> <Obj> <type>0</type> <id>157</id> <name>tempOutput_keep_V</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>188</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>188</second> </item> </second> </item> </inlineStackInfo> <originalName>tempOutput.keep.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>258</count> <item_version>0</item_version> <item>657</item> <item>658</item> <item>659</item> <item>661</item> <item>663</item> <item>665</item> <item>667</item> <item>669</item> <item>671</item> <item>672</item> <item>673</item> <item>674</item> <item>675</item> <item>676</item> <item>677</item> <item>678</item> <item>679</item> <item>680</item> <item>681</item> <item>682</item> <item>683</item> <item>684</item> <item>685</item> <item>686</item> <item>687</item> <item>688</item> <item>689</item> <item>690</item> <item>691</item> <item>692</item> <item>693</item> <item>694</item> <item>695</item> <item>696</item> <item>697</item> <item>698</item> <item>699</item> <item>700</item> <item>701</item> <item>702</item> <item>703</item> <item>704</item> <item>705</item> <item>706</item> <item>707</item> <item>708</item> <item>709</item> <item>710</item> <item>711</item> <item>712</item> <item>713</item> <item>714</item> <item>715</item> <item>716</item> <item>717</item> <item>718</item> <item>719</item> <item>720</item> <item>721</item> <item>722</item> <item>723</item> <item>724</item> <item>725</item> <item>726</item> <item>727</item> <item>728</item> <item>729</item> <item>730</item> <item>731</item> <item>732</item> <item>733</item> <item>734</item> <item>735</item> <item>736</item> <item>737</item> <item>738</item> <item>739</item> <item>740</item> <item>741</item> <item>742</item> <item>743</item> <item>744</item> <item>745</item> <item>746</item> <item>747</item> <item>748</item> <item>749</item> <item>750</item> <item>751</item> <item>752</item> <item>753</item> <item>754</item> <item>755</item> <item>756</item> <item>757</item> <item>758</item> <item>759</item> <item>760</item> <item>761</item> <item>762</item> <item>763</item> <item>764</item> <item>765</item> <item>766</item> <item>767</item> <item>768</item> <item>769</item> <item>770</item> <item>771</item> <item>772</item> <item>773</item> <item>774</item> <item>775</item> <item>776</item> <item>777</item> <item>778</item> <item>779</item> <item>780</item> <item>781</item> <item>782</item> <item>783</item> <item>784</item> <item>785</item> <item>786</item> <item>787</item> <item>788</item> <item>789</item> <item>790</item> <item>791</item> <item>792</item> <item>793</item> <item>794</item> <item>795</item> <item>796</item> <item>797</item> <item>798</item> <item>799</item> <item>800</item> <item>801</item> <item>802</item> <item>803</item> <item>804</item> <item>805</item> <item>806</item> <item>807</item> <item>808</item> <item>809</item> <item>810</item> <item>811</item> <item>812</item> <item>813</item> <item>814</item> <item>815</item> <item>816</item> <item>817</item> <item>818</item> <item>819</item> <item>820</item> <item>821</item> <item>822</item> <item>823</item> <item>824</item> <item>825</item> <item>826</item> <item>827</item> <item>828</item> <item>829</item> <item>830</item> <item>831</item> <item>832</item> <item>833</item> <item>834</item> <item>835</item> <item>836</item> <item>837</item> <item>838</item> <item>839</item> <item>840</item> <item>841</item> <item>842</item> <item>843</item> <item>844</item> <item>845</item> <item>846</item> <item>847</item> <item>848</item> <item>849</item> <item>850</item> <item>851</item> <item>852</item> <item>853</item> <item>854</item> <item>855</item> <item>856</item> <item>857</item> <item>858</item> <item>859</item> <item>860</item> <item>861</item> <item>862</item> <item>863</item> <item>864</item> <item>865</item> <item>866</item> <item>867</item> <item>868</item> <item>869</item> <item>870</item> <item>871</item> <item>872</item> <item>873</item> <item>874</item> <item>875</item> <item>876</item> <item>877</item> <item>878</item> <item>879</item> <item>880</item> <item>881</item> <item>882</item> <item>883</item> <item>884</item> <item>885</item> <item>886</item> <item>887</item> <item>888</item> <item>889</item> <item>890</item> <item>891</item> <item>892</item> <item>893</item> <item>894</item> <item>895</item> <item>896</item> <item>897</item> <item>898</item> <item>899</item> <item>900</item> <item>901</item> <item>902</item> <item>903</item> <item>904</item> <item>905</item> <item>906</item> <item>907</item> <item>908</item> <item>909</item> <item>910</item> <item>911</item> <item>912</item> <item>913</item> <item>914</item> <item>915</item> <item>916</item> <item>917</item> <item>918</item> <item>919</item> <item>920</item> </oprand_edges> <opcode>mux</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.27</m_delay> </item> <item class_id_reference="9" object_id="_121"> <Value> <Obj> <type>0</type> <id>158</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>189</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>189</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>921</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_122"> <Value> <Obj> <type>0</type> <id>160</id> <name>tmp_last_V_1</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>tmp.last.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>931</item> <item>932</item> <item>933</item> <item>934</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_123"> <Value> <Obj> <type>0</type> <id>161</id> <name>tmp_keep_V_1</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>tempOutput.keep.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>935</item> <item>936</item> <item>937</item> <item>938</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_124"> <Value> <Obj> <type>0</type> <id>162</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>194</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>194</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>9</count> <item_version>0</item_version> <item>939</item> <item>940</item> <item>941</item> <item>942</item> <item>943</item> <item>944</item> <item>945</item> <item>946</item> <item>947</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_125"> <Value> <Obj> <type>0</type> <id>163</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>195</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>195</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>948</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.92</m_delay> </item> <item class_id_reference="9" object_id="_126"> <Value> <Obj> <type>0</type> <id>165</id> <name>tmp_28_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>170</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>170</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>571</item> <item>572</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_127"> <Value> <Obj> <type>0</type> <id>166</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>170</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>170</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>573</item> <item>574</item> <item>575</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_128"> <Value> <Obj> <type>0</type> <id>168</id> <name>tmp_60</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>121</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>121</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>580</item> <item>582</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_129"> <Value> <Obj> <type>0</type> <id>169</id> <name>tmp_61</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>121</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>121</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>583</item> <item>584</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_130"> <Value> <Obj> <type>0</type> <id>170</id> <name>tmp_62</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>121</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>121</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>585</item> <item>586</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_131"> <Value> <Obj> <type>0</type> <id>171</id> <name>tmp_63</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>121</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>121</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>587</item> <item>588</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_132"> <Value> <Obj> <type>0</type> <id>172</id> <name>tmp_64</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>121</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>121</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>589</item> <item>590</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.48</m_delay> </item> <item class_id_reference="9" object_id="_133"> <Value> <Obj> <type>0</type> <id>173</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>121</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>121</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>591</item> <item>592</item> <item>593</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_134"> <Value> <Obj> <type>0</type> <id>175</id> <name>tmp_32_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>176</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>176</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>598</item> <item>599</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_135"> <Value> <Obj> <type>0</type> <id>176</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>176</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>176</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>600</item> <item>601</item> <item>602</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_136"> <Value> <Obj> <type>0</type> <id>178</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>177</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</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>604</item> <item>605</item> <item>2143</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.20</m_delay> </item> <item class_id_reference="9" object_id="_137"> <Value> <Obj> <type>0</type> <id>179</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>177</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</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>606</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_138"> <Value> <Obj> <type>0</type> <id>181</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>607</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_139"> <Value> <Obj> <type>0</type> <id>183</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>173</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>173</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>595</item> <item>596</item> <item>2142</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.20</m_delay> </item> <item class_id_reference="9" object_id="_140"> <Value> <Obj> <type>0</type> <id>184</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>175</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>175</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>597</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_141"> <Value> <Obj> <type>0</type> <id>186</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>171</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>171</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>577</item> <item>578</item> <item>2141</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.20</m_delay> </item> <item class_id_reference="9" object_id="_142"> <Value> <Obj> <type>0</type> <id>187</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>171</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>171</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>579</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_143"> <Value> <Obj> <type>0</type> <id>189</id> <name>tmp_last_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>tmp.last.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>6</count> <item_version>0</item_version> <item>608</item> <item>609</item> <item>610</item> <item>611</item> <item>612</item> <item>613</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_144"> <Value> <Obj> <type>0</type> <id>190</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>178</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>178</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>9</count> <item_version>0</item_version> <item>614</item> <item>615</item> <item>616</item> <item>617</item> <item>618</item> <item>619</item> <item>620</item> <item>621</item> <item>622</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_145"> <Value> <Obj> <type>0</type> <id>191</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>179</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</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>623</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.92</m_delay> </item> <item class_id_reference="9" object_id="_146"> <Value> <Obj> <type>0</type> <id>193</id> <name>tmp_22_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>157</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>157</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>491</item> <item>492</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_147"> <Value> <Obj> <type>0</type> <id>194</id> <name>tmp_23_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>157</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>157</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>493</item> <item>494</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_148"> <Value> <Obj> <type>0</type> <id>195</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>157</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>157</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>495</item> <item>496</item> <item>497</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_149"> <Value> <Obj> <type>0</type> <id>197</id> <name>tmp_25_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>161</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>161</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>529</item> <item>530</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_150"> <Value> <Obj> <type>0</type> <id>198</id> <name>tmp_26_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>161</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>161</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>531</item> <item>533</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_151"> <Value> <Obj> <type>0</type> <id>199</id> <name>or_cond3_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>161</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>161</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>534</item> <item>535</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_152"> <Value> <Obj> <type>0</type> <id>200</id> <name>tmp_27_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>161</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>161</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>536</item> <item>537</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_153"> <Value> <Obj> <type>0</type> <id>201</id> <name>or_cond4_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>161</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>161</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>538</item> <item>539</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_154"> <Value> <Obj> <type>0</type> <id>202</id> <name>p_1_cast_i_cast_cast</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>161</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>161</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>540</item> <item>542</item> <item>544</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.82</m_delay> </item> <item class_id_reference="9" object_id="_155"> <Value> <Obj> <type>0</type> <id>203</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>161</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>161</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>545</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_156"> <Value> <Obj> <type>0</type> <id>205</id> <name>resp_ValueConvertTem_1</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>158</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>498</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_157"> <Value> <Obj> <type>0</type> <id>206</id> <name>p_Val2_4</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName>__Val2__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>500</item> <item>501</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.51</m_delay> </item> <item class_id_reference="9" object_id="_158"> <Value> <Obj> <type>0</type> <id>207</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>158</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>502</item> <item>503</item> <item>2135</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_159"> <Value> <Obj> <type>0</type> <id>208</id> <name>p_Result_i_i</name> <fileName>sources/globals.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>127</lineNumber> <contextFuncName>byteSwap32</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>sources/globals.cpp</first> <second>byteSwap32</second> </first> <second>127</second> </item> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>159</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>505</item> <item>506</item> <item>508</item> <item>510</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_160"> <Value> <Obj> <type>0</type> <id>209</id> <name>p_Result_i_i_84</name> <fileName>sources/globals.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>127</lineNumber> <contextFuncName>byteSwap32</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>sources/globals.cpp</first> <second>byteSwap32</second> </first> <second>127</second> </item> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>159</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>511</item> <item>512</item> <item>514</item> <item>515</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_161"> <Value> <Obj> <type>0</type> <id>210</id> <name>p_Result_56_i_i</name> <fileName>sources/globals.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>127</lineNumber> <contextFuncName>byteSwap32</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>sources/globals.cpp</first> <second>byteSwap32</second> </first> <second>127</second> </item> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>159</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>516</item> <item>517</item> <item>518</item> <item>520</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_162"> <Value> <Obj> <type>0</type> <id>211</id> <name>tmp_59</name> <fileName>sources/globals.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>127</lineNumber> <contextFuncName>byteSwap32</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>sources/globals.cpp</first> <second>byteSwap32</second> </first> <second>127</second> </item> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>159</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>521</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_163"> <Value> <Obj> <type>0</type> <id>212</id> <name>tmp_i_i</name> <fileName>sources/globals.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>127</lineNumber> <contextFuncName>byteSwap32</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>sources/globals.cpp</first> <second>byteSwap32</second> </first> <second>127</second> </item> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>159</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>5</count> <item_version>0</item_version> <item>523</item> <item>524</item> <item>525</item> <item>526</item> <item>527</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_164"> <Value> <Obj> <type>0</type> <id>213</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>160</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>160</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>528</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_165"> <Value> <Obj> <type>0</type> <id>215</id> <name>tmp_data_V_1</name> <fileName>sources/globals.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>127</lineNumber> <contextFuncName>byteSwap32</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>sources/globals.cpp</first> <second>byteSwap32</second> </first> <second>127</second> </item> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>159</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>546</item> <item>547</item> <item>548</item> <item>549</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_166"> <Value> <Obj> <type>0</type> <id>216</id> <name>tmp_data_V_2</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>166</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>166</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>550</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_167"> <Value> <Obj> <type>0</type> <id>217</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>166</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>166</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>552</item> <item>553</item> <item>2140</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.20</m_delay> </item> <item class_id_reference="9" object_id="_168"> <Value> <Obj> <type>0</type> <id>218</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>167</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>167</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>9</count> <item_version>0</item_version> <item>554</item> <item>555</item> <item>556</item> <item>557</item> <item>558</item> <item>559</item> <item>561</item> <item>562</item> <item>563</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_169"> <Value> <Obj> <type>0</type> <id>219</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>168</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>168</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>564</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.92</m_delay> </item> <item class_id_reference="9" object_id="_170"> <Value> <Obj> <type>0</type> <id>221</id> <name>tmp_4</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>121</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>121</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>345</item> <item>346</item> <item>347</item> </oprand_edges> <opcode>nbreadreq</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_171"> <Value> <Obj> <type>0</type> <id>222</id> <name>tmp_16_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>121</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>121</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>348</item> <item>350</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_172"> <Value> <Obj> <type>0</type> <id>223</id> <name>p_not_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>121</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>121</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>351</item> <item>353</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_173"> <Value> <Obj> <type>0</type> <id>224</id> <name>tmp1</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>121</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>121</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>354</item> <item>355</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_174"> <Value> <Obj> <type>0</type> <id>225</id> <name>or_cond913_not_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>121</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>121</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>356</item> <item>357</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_175"> <Value> <Obj> <type>0</type> <id>226</id> <name>tmp_17_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>121</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>121</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>358</item> <item>359</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_176"> <Value> <Obj> <type>0</type> <id>227</id> <name>or_cond1_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>121</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>121</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>360</item> <item>361</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_177"> <Value> <Obj> <type>0</type> <id>228</id> <name>or_cond915_not_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>121</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>121</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>362</item> <item>364</item> </oprand_edges> <opcode>xor</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_178"> <Value> <Obj> <type>0</type> <id>229</id> <name>or_cond2_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>121</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>121</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>365</item> <item>366</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.48</m_delay> </item> <item class_id_reference="9" object_id="_179"> <Value> <Obj> <type>0</type> <id>230</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>121</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>121</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>367</item> <item>368</item> <item>369</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.92</m_delay> </item> <item class_id_reference="9" object_id="_180"> <Value> <Obj> <type>0</type> <id>232</id> <name>p_Val2_1</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>123</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>123</second> </item> </second> </item> </inlineStackInfo> <originalName>__Val2__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>248</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>370</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_181"> <Value> <Obj> <type>0</type> <id>233</id> <name>p_Result_i_83</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>123</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>123</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>372</item> <item>373</item> <item>375</item> <item>377</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_182"> <Value> <Obj> <type>0</type> <id>234</id> <name>tempVar_V</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>123</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>123</second> </item> </second> </item> </inlineStackInfo> <originalName>tempVar.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>379</item> <item>380</item> <item>381</item> <item>383</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_183"> <Value> <Obj> <type>0</type> <id>235</id> <name>tmp_19_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>124</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>124</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>384</item> <item>386</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.51</m_delay> </item> <item class_id_reference="9" object_id="_184"> <Value> <Obj> <type>0</type> <id>236</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>124</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>124</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>387</item> <item>388</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_185"> <Value> <Obj> <type>0</type> <id>237</id> <name>tmp_20_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>125</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>125</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>389</item> <item>391</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.30</m_delay> </item> <item class_id_reference="9" object_id="_186"> <Value> <Obj> <type>0</type> <id>238</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>125</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>125</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>392</item> <item>393</item> <item>2151</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.00</m_delay> </item> <item class_id_reference="9" object_id="_187"> <Value> <Obj> <type>0</type> <id>239</id> <name>p_Result_1_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>126</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>126</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>96</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>395</item> <item>396</item> <item>398</item> <item>400</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_188"> <Value> <Obj> <type>0</type> <id>240</id> <name>p_Result_2_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>130</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>130</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>401</item> <item>402</item> <item>403</item> <item>404</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_189"> <Value> <Obj> <type>0</type> <id>241</id> <name>p_Result_s</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>132</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>132</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>406</item> <item>408</item> <item>409</item> <item>411</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_190"> <Value> <Obj> <type>0</type> <id>242</id> <name>p_Result_3</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>134</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>134</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>412</item> <item>414</item> <item>415</item> <item>416</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_191"> <Value> <Obj> <type>0</type> <id>243</id> <name>tmp_7</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>121</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>121</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>417</item> <item>418</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_192"> <Value> <Obj> <type>0</type> <id>244</id> <name>tmp_8</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>121</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>121</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>419</item> <item>420</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_193"> <Value> <Obj> <type>0</type> <id>245</id> <name>tempOutput_data_V</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>137</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>137</second> </item> </second> </item> </inlineStackInfo> <originalName>tempOutput.data.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>421</item> <item>422</item> <item>423</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.62</m_delay> </item> <item class_id_reference="9" object_id="_194"> <Value> <Obj> <type>0</type> <id>246</id> <name>p_Result_8_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>137</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>137</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>424</item> <item>425</item> <item>426</item> <item>427</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_195"> <Value> <Obj> <type>0</type> <id>247</id> <name>p_Result_4</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>137</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>137</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>5</count> <item_version>0</item_version> <item>429</item> <item>430</item> <item>431</item> <item>433</item> <item>435</item> </oprand_edges> <opcode>partset</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_196"> <Value> <Obj> <type>0</type> <id>248</id> <name>tmp_30_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>138</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>138</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>436</item> <item>437</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_197"> <Value> <Obj> <type>0</type> <id>249</id> <name>or_cond5_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>138</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>138</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>438</item> <item>439</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.48</m_delay> </item> <item class_id_reference="9" object_id="_198"> <Value> <Obj> <type>0</type> <id>250</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>138</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>138</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>440</item> <item>441</item> <item>442</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_199"> <Value> <Obj> <type>0</type> <id>252</id> <name>tmp_V</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>139</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>139</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>444</item> <item>445</item> <item>2159</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.39</m_delay> </item> <item class_id_reference="9" object_id="_200"> <Value> <Obj> <type>0</type> <id>253</id> <name>br_valueLengthTemp_V</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>145</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>145</second> </item> </second> </item> </inlineStackInfo> <originalName>br_valueLengthTemp.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>446</item> <item>448</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.30</m_delay> </item> <item class_id_reference="9" object_id="_201"> <Value> <Obj> <type>0</type> <id>254</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>146</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>146</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>449</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_202"> <Value> <Obj> <type>0</type> <id>256</id> <name>p_cast_i_cast_cast</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>147</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>147</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>450</item> <item>452</item> <item>454</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.51</m_delay> </item> <item class_id_reference="9" object_id="_203"> <Value> <Obj> <type>0</type> <id>257</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>455</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_204"> <Value> <Obj> <type>0</type> <id>259</id> <name>xtrasBuffer_V_new_i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>tmp.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>457</item> <item>458</item> <item>459</item> <item>460</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_205"> <Value> <Obj> <type>0</type> <id>260</id> <name>p_0492_1_i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>br_valueLengthTemp.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>461</item> <item>462</item> <item>463</item> <item>464</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_206"> <Value> <Obj> <type>0</type> <id>261</id> <name>p_Result_5</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>149</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>149</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>112</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>466</item> <item>467</item> <item>468</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_207"> <Value> <Obj> <type>0</type> <id>262</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>152</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>152</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>470</item> <item>471</item> <item>2139</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.20</m_delay> </item> <item class_id_reference="9" object_id="_208"> <Value> <Obj> <type>0</type> <id>263</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>153</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>153</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>9</count> <item_version>0</item_version> <item>473</item> <item>474</item> <item>475</item> <item>476</item> <item>477</item> <item>478</item> <item>479</item> <item>481</item> <item>483</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_209"> <Value> <Obj> <type>0</type> <id>264</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>154</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>484</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.92</m_delay> </item> <item class_id_reference="9" object_id="_210"> <Value> <Obj> <type>0</type> <id>266</id> <name>xtrasBuffer_V_flag_8</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>18</count> <item_version>0</item_version> <item>1937</item> <item>1938</item> <item>1939</item> <item>1940</item> <item>1941</item> <item>1942</item> <item>1943</item> <item>1944</item> <item>1945</item> <item>1946</item> <item>1947</item> <item>1948</item> <item>1949</item> <item>1950</item> <item>1951</item> <item>1952</item> <item>1953</item> <item>1954</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_211"> <Value> <Obj> <type>0</type> <id>267</id> <name>xtrasBuffer_V_new_8_s</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>tmp.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>18</count> <item_version>0</item_version> <item>1956</item> <item>1957</item> <item>1958</item> <item>1959</item> <item>1960</item> <item>1961</item> <item>1962</item> <item>1963</item> <item>1964</item> <item>1965</item> <item>1966</item> <item>1967</item> <item>1968</item> <item>1969</item> <item>1970</item> <item>1971</item> <item>1972</item> <item>1973</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_212"> <Value> <Obj> <type>0</type> <id>268</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>1974</item> <item>1975</item> <item>1976</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_213"> <Value> <Obj> <type>0</type> <id>270</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>128</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>128</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>1977</item> <item>1978</item> <item>2152</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_214"> <Value> <Obj> <type>0</type> <id>271</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>1979</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_215"> <Value> <Obj> <type>0</type> <id>273</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>1980</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_216"> <Value> <Obj> <type>0</type> <id>275</id> <name>tmp</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>113</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>113</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>302</item> <item>303</item> <item>305</item> </oprand_edges> <opcode>nbreadreq</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_217"> <Value> <Obj> <type>0</type> <id>276</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>113</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>113</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>306</item> <item>307</item> <item>308</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_218"> <Value> <Obj> <type>0</type> <id>278</id> <name>tmp_V_3</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>114</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>114</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>248</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>310</item> <item>311</item> <item>2160</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.39</m_delay> </item> <item class_id_reference="9" object_id="_219"> <Value> <Obj> <type>0</type> <id>279</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>114</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>114</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>312</item> <item>313</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_220"> <Value> <Obj> <type>0</type> <id>280</id> <name>p_Result_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>115</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>115</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>315</item> <item>316</item> <item>318</item> <item>320</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_221"> <Value> <Obj> <type>0</type> <id>281</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>115</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>115</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>321</item> <item>322</item> <item>2137</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_222"> <Value> <Obj> <type>0</type> <id>282</id> <name>p_Result_3_i</name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>116</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>116</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>323</item> <item>324</item> <item>326</item> <item>328</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_223"> <Value> <Obj> <type>0</type> <id>283</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>116</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>116</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>329</item> <item>330</item> <item>2138</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_224"> <Value> <Obj> <type>0</type> <id>284</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>117</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>117</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>332</item> <item>333</item> <item>2136</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.20</m_delay> </item> <item class_id_reference="9" object_id="_225"> <Value> <Obj> <type>0</type> <id>285</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>118</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>118</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>334</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_226"> <Value> <Obj> <type>0</type> <id>287</id> <name></name> <fileName>sources/responseFormatter/binResponse.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>119</lineNumber> <contextFuncName>response_r</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/responseFormatter/binResponse.cpp</first> <second>response_r</second> </first> <second>119</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>335</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_227"> <Value> <Obj> <type>0</type> <id>289</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> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> </nodes> <consts class_id="15" tracking_level="0" version="0"> <count>74</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_228"> <Value> <Obj> <type>2</type> <id>294</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_229"> <Value> <Obj> <type>2</type> <id>304</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="_230"> <Value> <Obj> <type>2</type> <id>317</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>104</content> </item> <item class_id_reference="16" object_id="_231"> <Value> <Obj> <type>2</type> <id>319</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>111</content> </item> <item class_id_reference="16" object_id="_232"> <Value> <Obj> <type>2</type> <id>325</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>112</content> </item> <item class_id_reference="16" object_id="_233"> <Value> <Obj> <type>2</type> <id>327</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>119</content> </item> <item class_id_reference="16" object_id="_234"> <Value> <Obj> <type>2</type> <id>331</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_235"> <Value> <Obj> <type>2</type> <id>337</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_236"> <Value> <Obj> <type>2</type> <id>349</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="_237"> <Value> <Obj> <type>2</type> <id>352</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>1</content> </item> <item class_id_reference="16" object_id="_238"> <Value> <Obj> <type>2</type> <id>363</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_239"> <Value> <Obj> <type>2</type> <id>374</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>8</content> </item> <item class_id_reference="16" object_id="_240"> <Value> <Obj> <type>2</type> <id>376</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>39</content> </item> <item class_id_reference="16" object_id="_241"> <Value> <Obj> <type>2</type> <id>382</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>23</content> </item> <item class_id_reference="16" object_id="_242"> <Value> <Obj> <type>2</type> <id>385</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>4294967288</content> </item> <item class_id_reference="16" object_id="_243"> <Value> <Obj> <type>2</type> <id>390</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>65528</content> </item> <item class_id_reference="16" object_id="_244"> <Value> <Obj> <type>2</type> <id>397</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>124</content> </item> <item class_id_reference="16" object_id="_245"> <Value> <Obj> <type>2</type> <id>399</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>219</content> </item> <item class_id_reference="16" object_id="_246"> <Value> <Obj> <type>2</type> <id>407</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>48</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_247"> <Value> <Obj> <type>2</type> <id>410</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>129</content> </item> <item class_id_reference="16" object_id="_248"> <Value> <Obj> <type>2</type> <id>413</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>48</bitwidth> </Value> <const_type>0</const_type> <content>262144</content> </item> <item class_id_reference="16" object_id="_249"> <Value> <Obj> <type>2</type> <id>432</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>56</content> </item> <item class_id_reference="16" object_id="_250"> <Value> <Obj> <type>2</type> <id>434</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="_251"> <Value> <Obj> <type>2</type> <id>447</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>20</content> </item> <item class_id_reference="16" object_id="_252"> <Value> <Obj> <type>2</type> <id>451</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>32</content> </item> <item class_id_reference="16" object_id="_253"> <Value> <Obj> <type>2</type> <id>453</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>24</content> </item> <item class_id_reference="16" object_id="_254"> <Value> <Obj> <type>2</type> <id>456</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="_255"> <Value> <Obj> <type>2</type> <id>469</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <const_type>0</const_type> <content>2</content> </item> <item class_id_reference="16" object_id="_256"> <Value> <Obj> <type>2</type> <id>480</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <const_type>0</const_type> <content>255</content> </item> <item class_id_reference="16" object_id="_257"> <Value> <Obj> <type>2</type> <id>482</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_258"> <Value> <Obj> <type>2</type> <id>486</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <const_type>0</const_type> <content>2</content> </item> <item class_id_reference="16" object_id="_259"> <Value> <Obj> <type>2</type> <id>499</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>4</content> </item> <item class_id_reference="16" object_id="_260"> <Value> <Obj> <type>2</type> <id>507</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>24</content> </item> <item class_id_reference="16" object_id="_261"> <Value> <Obj> <type>2</type> <id>509</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>31</content> </item> <item class_id_reference="16" object_id="_262"> <Value> <Obj> <type>2</type> <id>513</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>16</content> </item> <item class_id_reference="16" object_id="_263"> <Value> <Obj> <type>2</type> <id>519</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>15</content> </item> <item class_id_reference="16" object_id="_264"> <Value> <Obj> <type>2</type> <id>532</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>4</content> </item> <item class_id_reference="16" object_id="_265"> <Value> <Obj> <type>2</type> <id>541</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>134217728</content> </item> <item class_id_reference="16" object_id="_266"> <Value> <Obj> <type>2</type> <id>543</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="_267"> <Value> <Obj> <type>2</type> <id>551</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <const_type>0</const_type> <content>3</content> </item> <item class_id_reference="16" object_id="_268"> <Value> <Obj> <type>2</type> <id>560</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>112</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_269"> <Value> <Obj> <type>2</type> <id>566</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <const_type>0</const_type> <content>3</content> </item> <item class_id_reference="16" object_id="_270"> <Value> <Obj> <type>2</type> <id>576</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <const_type>0</const_type> <content>7</content> </item> <item class_id_reference="16" object_id="_271"> <Value> <Obj> <type>2</type> <id>581</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>8</content> </item> <item class_id_reference="16" object_id="_272"> <Value> <Obj> <type>2</type> <id>594</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_273"> <Value> <Obj> <type>2</type> <id>603</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <const_type>0</const_type> <content>4</content> </item> <item class_id_reference="16" object_id="_274"> <Value> <Obj> <type>2</type> <id>625</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <const_type>0</const_type> <content>4</content> </item> <item class_id_reference="16" object_id="_275"> <Value> <Obj> <type>2</type> <id>645</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>5</content> </item> <item class_id_reference="16" object_id="_276"> <Value> <Obj> <type>2</type> <id>660</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>3</content> </item> <item class_id_reference="16" object_id="_277"> <Value> <Obj> <type>2</type> <id>662</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>7</content> </item> <item class_id_reference="16" object_id="_278"> <Value> <Obj> <type>2</type> <id>664</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>15</content> </item> <item class_id_reference="16" object_id="_279"> <Value> <Obj> <type>2</type> <id>666</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>31</content> </item> <item class_id_reference="16" object_id="_280"> <Value> <Obj> <type>2</type> <id>668</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>63</content> </item> <item class_id_reference="16" object_id="_281"> <Value> <Obj> <type>2</type> <id>670</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <const_type>0</const_type> <content>127</content> </item> <item class_id_reference="16" object_id="_282"> <Value> <Obj> <type>2</type> <id>922</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <const_type>0</const_type> <content>5</content> </item> <item class_id_reference="16" object_id="_283"> <Value> <Obj> <type>2</type> <id>926</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>65532</content> </item> <item class_id_reference="16" object_id="_284"> <Value> <Obj> <type>2</type> <id>950</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <const_type>0</const_type> <content>5</content> </item> <item class_id_reference="16" object_id="_285"> <Value> <Obj> <type>2</type> <id>956</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>4</content> </item> <item class_id_reference="16" object_id="_286"> <Value> <Obj> <type>2</type> <id>970</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>32</content> </item> <item class_id_reference="16" object_id="_287"> <Value> <Obj> <type>2</type> <id>1239</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>8</content> </item> <item class_id_reference="16" object_id="_288"> <Value> <Obj> <type>2</type> <id>1245</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="_289"> <Value> <Obj> <type>2</type> <id>1262</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <const_type>0</const_type> <content>6</content> </item> <item class_id_reference="16" object_id="_290"> <Value> <Obj> <type>2</type> <id>1294</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>3</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_291"> <Value> <Obj> <type>2</type> <id>1296</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>6</bitwidth> </Value> <const_type>0</const_type> <content>63</content> </item> <item class_id_reference="16" object_id="_292"> <Value> <Obj> <type>2</type> <id>1299</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>6</bitwidth> </Value> <const_type>0</const_type> <content>31</content> </item> <item class_id_reference="16" object_id="_293"> <Value> <Obj> <type>2</type> <id>1305</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>5</content> </item> <item class_id_reference="16" object_id="_294"> <Value> <Obj> <type>2</type> <id>1315</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>7</bitwidth> </Value> <const_type>0</const_type> <content>32</content> </item> <item class_id_reference="16" object_id="_295"> <Value> <Obj> <type>2</type> <id>1318</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>7</bitwidth> </Value> <const_type>0</const_type> <content>96</content> </item> <item class_id_reference="16" object_id="_296"> <Value> <Obj> <type>2</type> <id>1327</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>7</bitwidth> </Value> <const_type>0</const_type> <content>63</content> </item> <item class_id_reference="16" object_id="_297"> <Value> <Obj> <type>2</type> <id>1345</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>18446744073709551615</content> </item> <item class_id_reference="16" object_id="_298"> <Value> <Obj> <type>2</type> <id>1633</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <const_type>0</const_type> <content>6</content> </item> <item class_id_reference="16" object_id="_299"> <Value> <Obj> <type>2</type> <id>1917</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <const_type>0</const_type> <content>7</content> </item> <item class_id_reference="16" object_id="_300"> <Value> <Obj> <type>2</type> <id>1929</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>3544368444630782533</content> </item> <item class_id_reference="16" object_id="_301"> <Value> <Obj> <type>2</type> <id>1955</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>4</const_type> <content>0</content> </item> </consts> <blocks class_id="17" tracking_level="0" version="0"> <count>52</count> <item_version>0</item_version> <item class_id="18" tracking_level="1" version="0" object_id="_302"> <Obj> <type>3</type> <id>24</id> <name>entry</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>6</count> <item_version>0</item_version> <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="_303"> <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>4</count> <item_version>0</item_version> <item>25</item> <item>26</item> <item>27</item> <item>28</item> </node_objs> </item> <item class_id_reference="18" object_id="_304"> <Obj> <type>3</type> <id>32</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>30</item> <item>31</item> </node_objs> </item> <item class_id_reference="18" object_id="_305"> <Obj> <type>3</type> <id>35</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>33</item> <item>34</item> </node_objs> </item> <item class_id_reference="18" object_id="_306"> <Obj> <type>3</type> <id>38</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>36</item> <item>37</item> </node_objs> </item> <item class_id_reference="18" object_id="_307"> <Obj> <type>3</type> <id>41</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>39</item> <item>40</item> </node_objs> </item> <item class_id_reference="18" object_id="_308"> <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>2</count> <item_version>0</item_version> <item>42</item> <item>43</item> </node_objs> </item> <item class_id_reference="18" object_id="_309"> <Obj> <type>3</type> <id>47</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>45</item> <item>46</item> </node_objs> </item> <item class_id_reference="18" object_id="_310"> <Obj> <type>3</type> <id>51</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>48</item> <item>49</item> <item>50</item> </node_objs> </item> <item class_id_reference="18" object_id="_311"> <Obj> <type>3</type> <id>53</id> <name>._crit_edge17.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>52</item> </node_objs> </item> <item class_id_reference="18" object_id="_312"> <Obj> <type>3</type> <id>62</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>8</count> <item_version>0</item_version> <item>54</item> <item>55</item> <item>56</item> <item>57</item> <item>58</item> <item>59</item> <item>60</item> <item>61</item> </node_objs> </item> <item class_id_reference="18" object_id="_313"> <Obj> <type>3</type> <id>64</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>1</count> <item_version>0</item_version> <item>63</item> </node_objs> </item> <item class_id_reference="18" object_id="_314"> <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>65</item> <item>66</item> </node_objs> </item> <item class_id_reference="18" object_id="_315"> <Obj> <type>3</type> <id>70</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>68</item> <item>69</item> </node_objs> </item> <item class_id_reference="18" object_id="_316"> <Obj> <type>3</type> <id>73</id> <name>._crit_edge12.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>71</item> <item>72</item> </node_objs> </item> <item class_id_reference="18" object_id="_317"> <Obj> <type>3</type> <id>106</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>32</count> <item_version>0</item_version> <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> </node_objs> </item> <item class_id_reference="18" object_id="_318"> <Obj> <type>3</type> <id>108</id> <name>._crit_edge16.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>107</item> </node_objs> </item> <item class_id_reference="18" object_id="_319"> <Obj> <type>3</type> <id>121</id> <name>._crit_edge14.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>12</count> <item_version>0</item_version> <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> </node_objs> </item> <item class_id_reference="18" object_id="_320"> <Obj> <type>3</type> <id>124</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>122</item> <item>123</item> </node_objs> </item> <item class_id_reference="18" object_id="_321"> <Obj> <type>3</type> <id>127</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>125</item> <item>126</item> </node_objs> </item> <item class_id_reference="18" object_id="_322"> <Obj> <type>3</type> <id>129</id> <name>._crit_edge15.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>128</item> </node_objs> </item> <item class_id_reference="18" object_id="_323"> <Obj> <type>3</type> <id>132</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>130</item> <item>131</item> </node_objs> </item> <item class_id_reference="18" object_id="_324"> <Obj> <type>3</type> <id>137</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>4</count> <item_version>0</item_version> <item>133</item> <item>134</item> <item>135</item> <item>136</item> </node_objs> </item> <item class_id_reference="18" object_id="_325"> <Obj> <type>3</type> <id>140</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>138</item> <item>139</item> </node_objs> </item> <item class_id_reference="18" object_id="_326"> <Obj> <type>3</type> <id>147</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>141</item> <item>142</item> <item>143</item> <item>144</item> <item>145</item> <item>146</item> </node_objs> </item> <item class_id_reference="18" object_id="_327"> <Obj> <type>3</type> <id>152</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>4</count> <item_version>0</item_version> <item>148</item> <item>149</item> <item>150</item> <item>151</item> </node_objs> </item> <item class_id_reference="18" object_id="_328"> <Obj> <type>3</type> <id>159</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>153</item> <item>154</item> <item>155</item> <item>156</item> <item>157</item> <item>158</item> </node_objs> </item> <item class_id_reference="18" object_id="_329"> <Obj> <type>3</type> <id>164</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>4</count> <item_version>0</item_version> <item>160</item> <item>161</item> <item>162</item> <item>163</item> </node_objs> </item> <item class_id_reference="18" object_id="_330"> <Obj> <type>3</type> <id>167</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>165</item> <item>166</item> </node_objs> </item> <item class_id_reference="18" object_id="_331"> <Obj> <type>3</type> <id>174</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>168</item> <item>169</item> <item>170</item> <item>171</item> <item>172</item> <item>173</item> </node_objs> </item> <item class_id_reference="18" object_id="_332"> <Obj> <type>3</type> <id>177</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>175</item> <item>176</item> </node_objs> </item> <item class_id_reference="18" object_id="_333"> <Obj> <type>3</type> <id>180</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>178</item> <item>179</item> </node_objs> </item> <item class_id_reference="18" object_id="_334"> <Obj> <type>3</type> <id>182</id> <name>._crit_edge10.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>181</item> </node_objs> </item> <item class_id_reference="18" object_id="_335"> <Obj> <type>3</type> <id>185</id> <name>._crit_edge9.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>183</item> <item>184</item> </node_objs> </item> <item class_id_reference="18" object_id="_336"> <Obj> <type>3</type> <id>188</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>186</item> <item>187</item> </node_objs> </item> <item class_id_reference="18" object_id="_337"> <Obj> <type>3</type> <id>192</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>189</item> <item>190</item> <item>191</item> </node_objs> </item> <item class_id_reference="18" object_id="_338"> <Obj> <type>3</type> <id>196</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>193</item> <item>194</item> <item>195</item> </node_objs> </item> <item class_id_reference="18" object_id="_339"> <Obj> <type>3</type> <id>204</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>7</count> <item_version>0</item_version> <item>197</item> <item>198</item> <item>199</item> <item>200</item> <item>201</item> <item>202</item> <item>203</item> </node_objs> </item> <item class_id_reference="18" object_id="_340"> <Obj> <type>3</type> <id>214</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>9</count> <item_version>0</item_version> <item>205</item> <item>206</item> <item>207</item> <item>208</item> <item>209</item> <item>210</item> <item>211</item> <item>212</item> <item>213</item> </node_objs> </item> <item class_id_reference="18" object_id="_341"> <Obj> <type>3</type> <id>220</id> <name>._crit_edge6.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>5</count> <item_version>0</item_version> <item>215</item> <item>216</item> <item>217</item> <item>218</item> <item>219</item> </node_objs> </item> <item class_id_reference="18" object_id="_342"> <Obj> <type>3</type> <id>231</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>10</count> <item_version>0</item_version> <item>221</item> <item>222</item> <item>223</item> <item>224</item> <item>225</item> <item>226</item> <item>227</item> <item>228</item> <item>229</item> <item>230</item> </node_objs> </item> <item class_id_reference="18" object_id="_343"> <Obj> <type>3</type> <id>251</id> <name>_ifconv</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>19</count> <item_version>0</item_version> <item>232</item> <item>233</item> <item>234</item> <item>235</item> <item>236</item> <item>237</item> <item>238</item> <item>239</item> <item>240</item> <item>241</item> <item>242</item> <item>243</item> <item>244</item> <item>245</item> <item>246</item> <item>247</item> <item>248</item> <item>249</item> <item>250</item> </node_objs> </item> <item class_id_reference="18" object_id="_344"> <Obj> <type>3</type> <id>255</id> <name>._crit_edge5.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>252</item> <item>253</item> <item>254</item> </node_objs> </item> <item class_id_reference="18" object_id="_345"> <Obj> <type>3</type> <id>258</id> <name>.critedge.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>256</item> <item>257</item> </node_objs> </item> <item class_id_reference="18" object_id="_346"> <Obj> <type>3</type> <id>265</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>259</item> <item>260</item> <item>261</item> <item>262</item> <item>263</item> <item>264</item> </node_objs> </item> <item class_id_reference="18" object_id="_347"> <Obj> <type>3</type> <id>269</id> <name>._crit_edge4.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>266</item> <item>267</item> <item>268</item> </node_objs> </item> <item class_id_reference="18" object_id="_348"> <Obj> <type>3</type> <id>272</id> <name>mergeST.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>270</item> <item>271</item> </node_objs> </item> <item class_id_reference="18" object_id="_349"> <Obj> <type>3</type> <id>274</id> <name>.new.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>273</item> </node_objs> </item> <item class_id_reference="18" object_id="_350"> <Obj> <type>3</type> <id>277</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>275</item> <item>276</item> </node_objs> </item> <item class_id_reference="18" object_id="_351"> <Obj> <type>3</type> <id>286</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>8</count> <item_version>0</item_version> <item>278</item> <item>279</item> <item>280</item> <item>281</item> <item>282</item> <item>283</item> <item>284</item> <item>285</item> </node_objs> </item> <item class_id_reference="18" object_id="_352"> <Obj> <type>3</type> <id>288</id> <name>._crit_edge3.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>287</item> </node_objs> </item> <item class_id_reference="18" object_id="_353"> <Obj> <type>3</type> <id>290</id> <name>response_r.exit</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>289</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>1651</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_354"> <id>291</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>18</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_355"> <id>292</id> <edge_type>1</edge_type> <source_obj>18</source_obj> <sink_obj>19</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_356"> <id>293</id> <edge_type>1</edge_type> <source_obj>19</source_obj> <sink_obj>20</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_357"> <id>295</id> <edge_type>1</edge_type> <source_obj>294</source_obj> <sink_obj>20</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_358"> <id>296</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>21</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_359"> <id>297</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>22</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_360"> <id>298</id> <edge_type>1</edge_type> <source_obj>20</source_obj> <sink_obj>23</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_361"> <id>299</id> <edge_type>2</edge_type> <source_obj>29</source_obj> <sink_obj>23</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_362"> <id>300</id> <edge_type>2</edge_type> <source_obj>277</source_obj> <sink_obj>23</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_363"> <id>303</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>275</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_364"> <id>305</id> <edge_type>1</edge_type> <source_obj>304</source_obj> <sink_obj>275</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_365"> <id>306</id> <edge_type>1</edge_type> <source_obj>275</source_obj> <sink_obj>276</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_366"> <id>307</id> <edge_type>2</edge_type> <source_obj>288</source_obj> <sink_obj>276</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_367"> <id>308</id> <edge_type>2</edge_type> <source_obj>286</source_obj> <sink_obj>276</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_368"> <id>311</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>278</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_369"> <id>312</id> <edge_type>1</edge_type> <source_obj>278</source_obj> <sink_obj>279</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_370"> <id>313</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>279</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_371"> <id>316</id> <edge_type>1</edge_type> <source_obj>278</source_obj> <sink_obj>280</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_372"> <id>318</id> <edge_type>1</edge_type> <source_obj>317</source_obj> <sink_obj>280</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_373"> <id>320</id> <edge_type>1</edge_type> <source_obj>319</source_obj> <sink_obj>280</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_374"> <id>321</id> <edge_type>1</edge_type> <source_obj>280</source_obj> <sink_obj>281</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_375"> <id>322</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>281</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_376"> <id>324</id> <edge_type>1</edge_type> <source_obj>278</source_obj> <sink_obj>282</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_377"> <id>326</id> <edge_type>1</edge_type> <source_obj>325</source_obj> <sink_obj>282</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_378"> <id>328</id> <edge_type>1</edge_type> <source_obj>327</source_obj> <sink_obj>282</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_379"> <id>329</id> <edge_type>1</edge_type> <source_obj>282</source_obj> <sink_obj>283</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_380"> <id>330</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>283</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_381"> <id>332</id> <edge_type>1</edge_type> <source_obj>331</source_obj> <sink_obj>284</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_382"> <id>333</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>284</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_383"> <id>334</id> <edge_type>2</edge_type> <source_obj>288</source_obj> <sink_obj>285</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_384"> <id>335</id> <edge_type>2</edge_type> <source_obj>290</source_obj> <sink_obj>287</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_385"> <id>336</id> <edge_type>1</edge_type> <source_obj>19</source_obj> <sink_obj>25</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_386"> <id>338</id> <edge_type>1</edge_type> <source_obj>337</source_obj> <sink_obj>25</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_387"> <id>339</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>26</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_388"> <id>340</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>27</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_389"> <id>341</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>28</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_390"> <id>342</id> <edge_type>2</edge_type> <source_obj>32</source_obj> <sink_obj>28</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_391"> <id>343</id> <edge_type>2</edge_type> <source_obj>231</source_obj> <sink_obj>28</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_392"> <id>346</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>221</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_393"> <id>347</id> <edge_type>1</edge_type> <source_obj>304</source_obj> <sink_obj>221</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_394"> <id>348</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>222</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_395"> <id>350</id> <edge_type>1</edge_type> <source_obj>349</source_obj> <sink_obj>222</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_396"> <id>351</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>223</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_397"> <id>353</id> <edge_type>1</edge_type> <source_obj>352</source_obj> <sink_obj>223</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_398"> <id>354</id> <edge_type>1</edge_type> <source_obj>222</source_obj> <sink_obj>224</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_399"> <id>355</id> <edge_type>1</edge_type> <source_obj>223</source_obj> <sink_obj>224</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_400"> <id>356</id> <edge_type>1</edge_type> <source_obj>224</source_obj> <sink_obj>225</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_401"> <id>357</id> <edge_type>1</edge_type> <source_obj>221</source_obj> <sink_obj>225</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_402"> <id>358</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>226</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_403"> <id>359</id> <edge_type>1</edge_type> <source_obj>352</source_obj> <sink_obj>226</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_404"> <id>360</id> <edge_type>1</edge_type> <source_obj>225</source_obj> <sink_obj>227</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_405"> <id>361</id> <edge_type>1</edge_type> <source_obj>226</source_obj> <sink_obj>227</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_406"> <id>362</id> <edge_type>1</edge_type> <source_obj>227</source_obj> <sink_obj>228</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_407"> <id>364</id> <edge_type>1</edge_type> <source_obj>363</source_obj> <sink_obj>228</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_408"> <id>365</id> <edge_type>1</edge_type> <source_obj>222</source_obj> <sink_obj>229</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_409"> <id>366</id> <edge_type>1</edge_type> <source_obj>228</source_obj> <sink_obj>229</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_410"> <id>367</id> <edge_type>1</edge_type> <source_obj>229</source_obj> <sink_obj>230</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_411"> <id>368</id> <edge_type>2</edge_type> <source_obj>251</source_obj> <sink_obj>230</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_412"> <id>369</id> <edge_type>2</edge_type> <source_obj>269</source_obj> <sink_obj>230</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_413"> <id>370</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>232</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_414"> <id>373</id> <edge_type>1</edge_type> <source_obj>232</source_obj> <sink_obj>233</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_415"> <id>375</id> <edge_type>1</edge_type> <source_obj>374</source_obj> <sink_obj>233</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_416"> <id>377</id> <edge_type>1</edge_type> <source_obj>376</source_obj> <sink_obj>233</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_417"> <id>380</id> <edge_type>1</edge_type> <source_obj>232</source_obj> <sink_obj>234</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_418"> <id>381</id> <edge_type>1</edge_type> <source_obj>374</source_obj> <sink_obj>234</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_419"> <id>383</id> <edge_type>1</edge_type> <source_obj>382</source_obj> <sink_obj>234</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_420"> <id>384</id> <edge_type>1</edge_type> <source_obj>233</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_421"> <id>386</id> <edge_type>1</edge_type> <source_obj>385</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_422"> <id>387</id> <edge_type>1</edge_type> <source_obj>235</source_obj> <sink_obj>236</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_423"> <id>388</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>236</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_424"> <id>389</id> <edge_type>1</edge_type> <source_obj>234</source_obj> <sink_obj>237</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_425"> <id>391</id> <edge_type>1</edge_type> <source_obj>390</source_obj> <sink_obj>237</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_426"> <id>392</id> <edge_type>1</edge_type> <source_obj>237</source_obj> <sink_obj>238</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_427"> <id>393</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>238</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_428"> <id>396</id> <edge_type>1</edge_type> <source_obj>232</source_obj> <sink_obj>239</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_429"> <id>398</id> <edge_type>1</edge_type> <source_obj>397</source_obj> <sink_obj>239</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_430"> <id>400</id> <edge_type>1</edge_type> <source_obj>399</source_obj> <sink_obj>239</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_431"> <id>402</id> <edge_type>1</edge_type> <source_obj>232</source_obj> <sink_obj>240</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_432"> <id>403</id> <edge_type>1</edge_type> <source_obj>317</source_obj> <sink_obj>240</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_433"> <id>404</id> <edge_type>1</edge_type> <source_obj>319</source_obj> <sink_obj>240</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_434"> <id>408</id> <edge_type>1</edge_type> <source_obj>407</source_obj> <sink_obj>241</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_435"> <id>409</id> <edge_type>1</edge_type> <source_obj>240</source_obj> <sink_obj>241</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_436"> <id>411</id> <edge_type>1</edge_type> <source_obj>410</source_obj> <sink_obj>241</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_437"> <id>414</id> <edge_type>1</edge_type> <source_obj>413</source_obj> <sink_obj>242</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_438"> <id>415</id> <edge_type>1</edge_type> <source_obj>240</source_obj> <sink_obj>242</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_439"> <id>416</id> <edge_type>1</edge_type> <source_obj>410</source_obj> <sink_obj>242</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_440"> <id>417</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>243</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_441"> <id>418</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>243</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_442"> <id>419</id> <edge_type>1</edge_type> <source_obj>243</source_obj> <sink_obj>244</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_443"> <id>420</id> <edge_type>1</edge_type> <source_obj>349</source_obj> <sink_obj>244</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_444"> <id>421</id> <edge_type>1</edge_type> <source_obj>244</source_obj> <sink_obj>245</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_445"> <id>422</id> <edge_type>1</edge_type> <source_obj>242</source_obj> <sink_obj>245</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_446"> <id>423</id> <edge_type>1</edge_type> <source_obj>241</source_obj> <sink_obj>245</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_447"> <id>425</id> <edge_type>1</edge_type> <source_obj>232</source_obj> <sink_obj>246</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_448"> <id>426</id> <edge_type>1</edge_type> <source_obj>325</source_obj> <sink_obj>246</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_449"> <id>427</id> <edge_type>1</edge_type> <source_obj>327</source_obj> <sink_obj>246</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_450"> <id>430</id> <edge_type>1</edge_type> <source_obj>245</source_obj> <sink_obj>247</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_451"> <id>431</id> <edge_type>1</edge_type> <source_obj>246</source_obj> <sink_obj>247</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_452"> <id>433</id> <edge_type>1</edge_type> <source_obj>432</source_obj> <sink_obj>247</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_453"> <id>435</id> <edge_type>1</edge_type> <source_obj>434</source_obj> <sink_obj>247</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_454"> <id>436</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>248</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_455"> <id>437</id> <edge_type>1</edge_type> <source_obj>349</source_obj> <sink_obj>248</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_456"> <id>438</id> <edge_type>1</edge_type> <source_obj>248</source_obj> <sink_obj>249</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_457"> <id>439</id> <edge_type>1</edge_type> <source_obj>226</source_obj> <sink_obj>249</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_458"> <id>440</id> <edge_type>1</edge_type> <source_obj>249</source_obj> <sink_obj>250</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_459"> <id>441</id> <edge_type>2</edge_type> <source_obj>255</source_obj> <sink_obj>250</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_460"> <id>442</id> <edge_type>2</edge_type> <source_obj>258</source_obj> <sink_obj>250</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_461"> <id>445</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>252</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_462"> <id>446</id> <edge_type>1</edge_type> <source_obj>234</source_obj> <sink_obj>253</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_463"> <id>448</id> <edge_type>1</edge_type> <source_obj>447</source_obj> <sink_obj>253</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_464"> <id>449</id> <edge_type>2</edge_type> <source_obj>265</source_obj> <sink_obj>254</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_465"> <id>450</id> <edge_type>1</edge_type> <source_obj>226</source_obj> <sink_obj>256</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_466"> <id>452</id> <edge_type>1</edge_type> <source_obj>451</source_obj> <sink_obj>256</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_467"> <id>454</id> <edge_type>1</edge_type> <source_obj>453</source_obj> <sink_obj>256</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_468"> <id>455</id> <edge_type>2</edge_type> <source_obj>265</source_obj> <sink_obj>257</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_469"> <id>457</id> <edge_type>1</edge_type> <source_obj>456</source_obj> <sink_obj>259</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_470"> <id>458</id> <edge_type>2</edge_type> <source_obj>258</source_obj> <sink_obj>259</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_471"> <id>459</id> <edge_type>1</edge_type> <source_obj>252</source_obj> <sink_obj>259</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_472"> <id>460</id> <edge_type>2</edge_type> <source_obj>255</source_obj> <sink_obj>259</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_473"> <id>461</id> <edge_type>1</edge_type> <source_obj>256</source_obj> <sink_obj>260</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_474"> <id>462</id> <edge_type>2</edge_type> <source_obj>258</source_obj> <sink_obj>260</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_475"> <id>463</id> <edge_type>1</edge_type> <source_obj>253</source_obj> <sink_obj>260</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_476"> <id>464</id> <edge_type>2</edge_type> <source_obj>255</source_obj> <sink_obj>260</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_477"> <id>467</id> <edge_type>1</edge_type> <source_obj>260</source_obj> <sink_obj>261</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_478"> <id>468</id> <edge_type>1</edge_type> <source_obj>239</source_obj> <sink_obj>261</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_479"> <id>470</id> <edge_type>1</edge_type> <source_obj>469</source_obj> <sink_obj>262</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_480"> <id>471</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>262</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_481"> <id>474</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>263</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_482"> <id>475</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>263</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_483"> <id>476</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>263</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_484"> <id>477</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>263</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_485"> <id>478</id> <edge_type>1</edge_type> <source_obj>247</source_obj> <sink_obj>263</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_486"> <id>479</id> <edge_type>1</edge_type> <source_obj>261</source_obj> <sink_obj>263</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_487"> <id>481</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>263</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_488"> <id>483</id> <edge_type>1</edge_type> <source_obj>482</source_obj> <sink_obj>263</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_489"> <id>484</id> <edge_type>2</edge_type> <source_obj>269</source_obj> <sink_obj>264</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_490"> <id>485</id> <edge_type>1</edge_type> <source_obj>19</source_obj> <sink_obj>30</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_491"> <id>487</id> <edge_type>1</edge_type> <source_obj>486</source_obj> <sink_obj>30</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_492"> <id>488</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>31</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_493"> <id>489</id> <edge_type>2</edge_type> <source_obj>35</source_obj> <sink_obj>31</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_494"> <id>490</id> <edge_type>2</edge_type> <source_obj>196</source_obj> <sink_obj>31</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_495"> <id>491</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>193</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_496"> <id>492</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>193</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_497"> <id>493</id> <edge_type>1</edge_type> <source_obj>193</source_obj> <sink_obj>194</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_498"> <id>494</id> <edge_type>1</edge_type> <source_obj>349</source_obj> <sink_obj>194</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_499"> <id>495</id> <edge_type>1</edge_type> <source_obj>194</source_obj> <sink_obj>195</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_500"> <id>496</id> <edge_type>2</edge_type> <source_obj>204</source_obj> <sink_obj>195</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_501"> <id>497</id> <edge_type>2</edge_type> <source_obj>214</source_obj> <sink_obj>195</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_502"> <id>498</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>205</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_503"> <id>500</id> <edge_type>1</edge_type> <source_obj>499</source_obj> <sink_obj>206</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_504"> <id>501</id> <edge_type>1</edge_type> <source_obj>205</source_obj> <sink_obj>206</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_505"> <id>502</id> <edge_type>1</edge_type> <source_obj>206</source_obj> <sink_obj>207</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_506"> <id>503</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>207</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_507"> <id>506</id> <edge_type>1</edge_type> <source_obj>206</source_obj> <sink_obj>208</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_508"> <id>508</id> <edge_type>1</edge_type> <source_obj>507</source_obj> <sink_obj>208</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_509"> <id>510</id> <edge_type>1</edge_type> <source_obj>509</source_obj> <sink_obj>208</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_510"> <id>512</id> <edge_type>1</edge_type> <source_obj>206</source_obj> <sink_obj>209</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_511"> <id>514</id> <edge_type>1</edge_type> <source_obj>513</source_obj> <sink_obj>209</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_512"> <id>515</id> <edge_type>1</edge_type> <source_obj>382</source_obj> <sink_obj>209</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_513"> <id>517</id> <edge_type>1</edge_type> <source_obj>206</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_514"> <id>518</id> <edge_type>1</edge_type> <source_obj>374</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_515"> <id>520</id> <edge_type>1</edge_type> <source_obj>519</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_516"> <id>521</id> <edge_type>1</edge_type> <source_obj>206</source_obj> <sink_obj>211</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_517"> <id>524</id> <edge_type>1</edge_type> <source_obj>211</source_obj> <sink_obj>212</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_518"> <id>525</id> <edge_type>1</edge_type> <source_obj>210</source_obj> <sink_obj>212</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_519"> <id>526</id> <edge_type>1</edge_type> <source_obj>209</source_obj> <sink_obj>212</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_520"> <id>527</id> <edge_type>1</edge_type> <source_obj>208</source_obj> <sink_obj>212</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_521"> <id>528</id> <edge_type>2</edge_type> <source_obj>220</source_obj> <sink_obj>213</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_522"> <id>529</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>197</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_523"> <id>530</id> <edge_type>1</edge_type> <source_obj>349</source_obj> <sink_obj>197</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_524"> <id>531</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_525"> <id>533</id> <edge_type>1</edge_type> <source_obj>532</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_526"> <id>534</id> <edge_type>1</edge_type> <source_obj>197</source_obj> <sink_obj>199</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_527"> <id>535</id> <edge_type>1</edge_type> <source_obj>198</source_obj> <sink_obj>199</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_528"> <id>536</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>200</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_529"> <id>537</id> <edge_type>1</edge_type> <source_obj>352</source_obj> <sink_obj>200</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_530"> <id>538</id> <edge_type>1</edge_type> <source_obj>199</source_obj> <sink_obj>201</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_531"> <id>539</id> <edge_type>1</edge_type> <source_obj>200</source_obj> <sink_obj>201</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_532"> <id>540</id> <edge_type>1</edge_type> <source_obj>201</source_obj> <sink_obj>202</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_533"> <id>542</id> <edge_type>1</edge_type> <source_obj>541</source_obj> <sink_obj>202</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_534"> <id>544</id> <edge_type>1</edge_type> <source_obj>543</source_obj> <sink_obj>202</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_535"> <id>545</id> <edge_type>2</edge_type> <source_obj>220</source_obj> <sink_obj>203</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_536"> <id>546</id> <edge_type>1</edge_type> <source_obj>212</source_obj> <sink_obj>215</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_537"> <id>547</id> <edge_type>2</edge_type> <source_obj>214</source_obj> <sink_obj>215</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_538"> <id>548</id> <edge_type>1</edge_type> <source_obj>202</source_obj> <sink_obj>215</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_539"> <id>549</id> <edge_type>2</edge_type> <source_obj>204</source_obj> <sink_obj>215</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_540"> <id>550</id> <edge_type>1</edge_type> <source_obj>215</source_obj> <sink_obj>216</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_541"> <id>552</id> <edge_type>1</edge_type> <source_obj>551</source_obj> <sink_obj>217</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_542"> <id>553</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>217</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_543"> <id>555</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>218</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_544"> <id>556</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>218</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_545"> <id>557</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>218</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_546"> <id>558</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>218</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_547"> <id>559</id> <edge_type>1</edge_type> <source_obj>216</source_obj> <sink_obj>218</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_548"> <id>561</id> <edge_type>1</edge_type> <source_obj>560</source_obj> <sink_obj>218</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_549"> <id>562</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>218</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_550"> <id>563</id> <edge_type>1</edge_type> <source_obj>482</source_obj> <sink_obj>218</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_551"> <id>564</id> <edge_type>2</edge_type> <source_obj>269</source_obj> <sink_obj>219</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_552"> <id>565</id> <edge_type>1</edge_type> <source_obj>19</source_obj> <sink_obj>33</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_553"> <id>567</id> <edge_type>1</edge_type> <source_obj>566</source_obj> <sink_obj>33</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_554"> <id>568</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>34</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_555"> <id>569</id> <edge_type>2</edge_type> <source_obj>38</source_obj> <sink_obj>34</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_556"> <id>570</id> <edge_type>2</edge_type> <source_obj>167</source_obj> <sink_obj>34</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_557"> <id>571</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_558"> <id>572</id> <edge_type>1</edge_type> <source_obj>352</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_559"> <id>573</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>166</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_560"> <id>574</id> <edge_type>2</edge_type> <source_obj>174</source_obj> <sink_obj>166</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_561"> <id>575</id> <edge_type>2</edge_type> <source_obj>188</source_obj> <sink_obj>166</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_562"> <id>577</id> <edge_type>1</edge_type> <source_obj>576</source_obj> <sink_obj>186</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_563"> <id>578</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>186</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_564"> <id>579</id> <edge_type>2</edge_type> <source_obj>192</source_obj> <sink_obj>187</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_565"> <id>580</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>168</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_566"> <id>582</id> <edge_type>1</edge_type> <source_obj>581</source_obj> <sink_obj>168</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_567"> <id>583</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>169</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_568"> <id>584</id> <edge_type>1</edge_type> <source_obj>532</source_obj> <sink_obj>169</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_569"> <id>585</id> <edge_type>1</edge_type> <source_obj>169</source_obj> <sink_obj>170</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_570"> <id>586</id> <edge_type>1</edge_type> <source_obj>168</source_obj> <sink_obj>170</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_571"> <id>587</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>171</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_572"> <id>588</id> <edge_type>1</edge_type> <source_obj>352</source_obj> <sink_obj>171</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_573"> <id>589</id> <edge_type>1</edge_type> <source_obj>171</source_obj> <sink_obj>172</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_574"> <id>590</id> <edge_type>1</edge_type> <source_obj>170</source_obj> <sink_obj>172</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_575"> <id>591</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>173</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_576"> <id>592</id> <edge_type>2</edge_type> <source_obj>177</source_obj> <sink_obj>173</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_577"> <id>593</id> <edge_type>2</edge_type> <source_obj>185</source_obj> <sink_obj>173</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_578"> <id>595</id> <edge_type>1</edge_type> <source_obj>594</source_obj> <sink_obj>183</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_579"> <id>596</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>183</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_580"> <id>597</id> <edge_type>2</edge_type> <source_obj>192</source_obj> <sink_obj>184</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_581"> <id>598</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>175</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_582"> <id>599</id> <edge_type>1</edge_type> <source_obj>349</source_obj> <sink_obj>175</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_583"> <id>600</id> <edge_type>1</edge_type> <source_obj>175</source_obj> <sink_obj>176</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_584"> <id>601</id> <edge_type>2</edge_type> <source_obj>182</source_obj> <sink_obj>176</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_585"> <id>602</id> <edge_type>2</edge_type> <source_obj>180</source_obj> <sink_obj>176</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_586"> <id>604</id> <edge_type>1</edge_type> <source_obj>603</source_obj> <sink_obj>178</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_587"> <id>605</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>178</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_588"> <id>606</id> <edge_type>2</edge_type> <source_obj>182</source_obj> <sink_obj>179</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_589"> <id>607</id> <edge_type>2</edge_type> <source_obj>192</source_obj> <sink_obj>181</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_590"> <id>608</id> <edge_type>1</edge_type> <source_obj>482</source_obj> <sink_obj>189</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_591"> <id>609</id> <edge_type>2</edge_type> <source_obj>188</source_obj> <sink_obj>189</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_592"> <id>610</id> <edge_type>1</edge_type> <source_obj>363</source_obj> <sink_obj>189</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_593"> <id>611</id> <edge_type>2</edge_type> <source_obj>185</source_obj> <sink_obj>189</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_594"> <id>612</id> <edge_type>1</edge_type> <source_obj>482</source_obj> <sink_obj>189</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_595"> <id>613</id> <edge_type>2</edge_type> <source_obj>182</source_obj> <sink_obj>189</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_596"> <id>615</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>190</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_597"> <id>616</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>190</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_598"> <id>617</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>190</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_599"> <id>618</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>190</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_600"> <id>619</id> <edge_type>1</edge_type> <source_obj>456</source_obj> <sink_obj>190</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_601"> <id>620</id> <edge_type>1</edge_type> <source_obj>560</source_obj> <sink_obj>190</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_602"> <id>621</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>190</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_603"> <id>622</id> <edge_type>1</edge_type> <source_obj>189</source_obj> <sink_obj>190</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_604"> <id>623</id> <edge_type>2</edge_type> <source_obj>269</source_obj> <sink_obj>191</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_605"> <id>624</id> <edge_type>1</edge_type> <source_obj>19</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_606"> <id>626</id> <edge_type>1</edge_type> <source_obj>625</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_607"> <id>627</id> <edge_type>1</edge_type> <source_obj>36</source_obj> <sink_obj>37</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_608"> <id>628</id> <edge_type>2</edge_type> <source_obj>41</source_obj> <sink_obj>37</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_609"> <id>629</id> <edge_type>2</edge_type> <source_obj>140</source_obj> <sink_obj>37</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_610"> <id>631</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>138</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_611"> <id>632</id> <edge_type>1</edge_type> <source_obj>304</source_obj> <sink_obj>138</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_612"> <id>633</id> <edge_type>1</edge_type> <source_obj>138</source_obj> <sink_obj>139</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_613"> <id>634</id> <edge_type>2</edge_type> <source_obj>269</source_obj> <sink_obj>139</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_614"> <id>635</id> <edge_type>2</edge_type> <source_obj>147</source_obj> <sink_obj>139</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_615"> <id>636</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>141</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_616"> <id>638</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>142</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_617"> <id>639</id> <edge_type>1</edge_type> <source_obj>142</source_obj> <sink_obj>143</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_618"> <id>642</id> <edge_type>1</edge_type> <source_obj>143</source_obj> <sink_obj>144</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_619"> <id>643</id> <edge_type>1</edge_type> <source_obj>141</source_obj> <sink_obj>144</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_620"> <id>644</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>145</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_621"> <id>646</id> <edge_type>1</edge_type> <source_obj>645</source_obj> <sink_obj>145</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_622"> <id>647</id> <edge_type>1</edge_type> <source_obj>145</source_obj> <sink_obj>146</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_623"> <id>648</id> <edge_type>2</edge_type> <source_obj>152</source_obj> <sink_obj>146</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_624"> <id>649</id> <edge_type>2</edge_type> <source_obj>159</source_obj> <sink_obj>146</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_625"> <id>650</id> <edge_type>1</edge_type> <source_obj>594</source_obj> <sink_obj>153</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_626"> <id>651</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>153</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_627"> <id>652</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>154</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_628"> <id>653</id> <edge_type>1</edge_type> <source_obj>625</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_629"> <id>654</id> <edge_type>1</edge_type> <source_obj>154</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_630"> <id>655</id> <edge_type>1</edge_type> <source_obj>155</source_obj> <sink_obj>156</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_631"> <id>658</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_632"> <id>659</id> <edge_type>1</edge_type> <source_obj>352</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_633"> <id>661</id> <edge_type>1</edge_type> <source_obj>660</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_634"> <id>663</id> <edge_type>1</edge_type> <source_obj>662</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_635"> <id>665</id> <edge_type>1</edge_type> <source_obj>664</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_636"> <id>667</id> <edge_type>1</edge_type> <source_obj>666</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_637"> <id>669</id> <edge_type>1</edge_type> <source_obj>668</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_638"> <id>671</id> <edge_type>1</edge_type> <source_obj>670</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_639"> <id>672</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_640"> <id>673</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_641"> <id>674</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_642"> <id>675</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_643"> <id>676</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_644"> <id>677</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_645"> <id>678</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_646"> <id>679</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_647"> <id>680</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_648"> <id>681</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_649"> <id>682</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_650"> <id>683</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_651"> <id>684</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_652"> <id>685</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_653"> <id>686</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_654"> <id>687</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_655"> <id>688</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_656"> <id>689</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_657"> <id>690</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_658"> <id>691</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_659"> <id>692</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_660"> <id>693</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_661"> <id>694</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_662"> <id>695</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_663"> <id>696</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_664"> <id>697</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_665"> <id>698</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_666"> <id>699</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_667"> <id>700</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_668"> <id>701</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_669"> <id>702</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_670"> <id>703</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_671"> <id>704</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_672"> <id>705</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_673"> <id>706</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_674"> <id>707</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_675"> <id>708</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_676"> <id>709</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_677"> <id>710</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_678"> <id>711</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_679"> <id>712</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_680"> <id>713</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_681"> <id>714</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_682"> <id>715</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_683"> <id>716</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_684"> <id>717</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_685"> <id>718</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_686"> <id>719</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_687"> <id>720</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_688"> <id>721</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_689"> <id>722</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_690"> <id>723</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_691"> <id>724</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_692"> <id>725</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_693"> <id>726</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_694"> <id>727</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_695"> <id>728</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_696"> <id>729</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_697"> <id>730</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_698"> <id>731</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_699"> <id>732</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_700"> <id>733</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_701"> <id>734</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_702"> <id>735</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_703"> <id>736</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_704"> <id>737</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_705"> <id>738</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_706"> <id>739</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_707"> <id>740</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_708"> <id>741</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_709"> <id>742</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_710"> <id>743</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_711"> <id>744</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_712"> <id>745</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_713"> <id>746</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_714"> <id>747</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_715"> <id>748</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_716"> <id>749</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_717"> <id>750</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_718"> <id>751</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_719"> <id>752</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_720"> <id>753</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_721"> <id>754</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_722"> <id>755</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_723"> <id>756</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_724"> <id>757</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_725"> <id>758</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_726"> <id>759</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_727"> <id>760</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_728"> <id>761</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_729"> <id>762</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_730"> <id>763</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_731"> <id>764</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_732"> <id>765</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_733"> <id>766</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_734"> <id>767</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_735"> <id>768</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_736"> <id>769</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_737"> <id>770</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_738"> <id>771</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_739"> <id>772</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_740"> <id>773</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_741"> <id>774</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_742"> <id>775</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_743"> <id>776</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_744"> <id>777</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_745"> <id>778</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_746"> <id>779</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_747"> <id>780</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_748"> <id>781</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_749"> <id>782</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_750"> <id>783</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_751"> <id>784</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_752"> <id>785</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_753"> <id>786</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_754"> <id>787</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_755"> <id>788</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_756"> <id>789</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_757"> <id>790</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_758"> <id>791</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_759"> <id>792</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_760"> <id>793</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_761"> <id>794</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_762"> <id>795</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_763"> <id>796</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_764"> <id>797</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_765"> <id>798</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_766"> <id>799</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_767"> <id>800</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_768"> <id>801</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_769"> <id>802</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_770"> <id>803</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_771"> <id>804</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_772"> <id>805</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_773"> <id>806</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_774"> <id>807</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_775"> <id>808</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_776"> <id>809</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_777"> <id>810</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_778"> <id>811</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_779"> <id>812</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_780"> <id>813</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_781"> <id>814</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_782"> <id>815</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_783"> <id>816</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_784"> <id>817</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_785"> <id>818</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_786"> <id>819</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_787"> <id>820</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_788"> <id>821</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_789"> <id>822</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_790"> <id>823</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_791"> <id>824</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_792"> <id>825</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_793"> <id>826</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_794"> <id>827</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_795"> <id>828</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_796"> <id>829</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_797"> <id>830</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_798"> <id>831</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_799"> <id>832</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_800"> <id>833</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_801"> <id>834</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_802"> <id>835</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_803"> <id>836</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_804"> <id>837</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_805"> <id>838</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_806"> <id>839</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_807"> <id>840</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_808"> <id>841</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_809"> <id>842</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_810"> <id>843</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_811"> <id>844</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_812"> <id>845</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_813"> <id>846</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_814"> <id>847</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_815"> <id>848</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_816"> <id>849</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_817"> <id>850</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_818"> <id>851</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_819"> <id>852</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_820"> <id>853</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_821"> <id>854</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_822"> <id>855</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_823"> <id>856</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_824"> <id>857</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_825"> <id>858</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_826"> <id>859</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_827"> <id>860</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_828"> <id>861</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_829"> <id>862</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_830"> <id>863</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_831"> <id>864</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_832"> <id>865</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_833"> <id>866</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_834"> <id>867</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_835"> <id>868</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_836"> <id>869</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_837"> <id>870</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_838"> <id>871</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_839"> <id>872</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_840"> <id>873</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_841"> <id>874</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_842"> <id>875</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_843"> <id>876</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_844"> <id>877</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_845"> <id>878</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_846"> <id>879</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_847"> <id>880</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_848"> <id>881</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_849"> <id>882</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_850"> <id>883</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_851"> <id>884</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_852"> <id>885</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_853"> <id>886</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_854"> <id>887</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_855"> <id>888</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_856"> <id>889</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_857"> <id>890</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_858"> <id>891</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_859"> <id>892</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_860"> <id>893</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_861"> <id>894</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_862"> <id>895</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_863"> <id>896</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_864"> <id>897</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_865"> <id>898</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_866"> <id>899</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_867"> <id>900</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_868"> <id>901</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_869"> <id>902</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_870"> <id>903</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_871"> <id>904</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_872"> <id>905</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_873"> <id>906</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_874"> <id>907</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_875"> <id>908</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_876"> <id>909</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_877"> <id>910</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_878"> <id>911</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_879"> <id>912</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_880"> <id>913</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_881"> <id>914</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_882"> <id>915</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_883"> <id>916</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_884"> <id>917</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_885"> <id>918</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_886"> <id>919</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_887"> <id>920</id> <edge_type>1</edge_type> <source_obj>156</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_888"> <id>921</id> <edge_type>2</edge_type> <source_obj>164</source_obj> <sink_obj>158</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_889"> <id>923</id> <edge_type>1</edge_type> <source_obj>922</source_obj> <sink_obj>148</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_890"> <id>924</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>148</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_891"> <id>925</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>149</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_892"> <id>927</id> <edge_type>1</edge_type> <source_obj>926</source_obj> <sink_obj>149</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_893"> <id>928</id> <edge_type>1</edge_type> <source_obj>149</source_obj> <sink_obj>150</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_894"> <id>929</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>150</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_895"> <id>930</id> <edge_type>2</edge_type> <source_obj>164</source_obj> <sink_obj>151</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_896"> <id>931</id> <edge_type>1</edge_type> <source_obj>363</source_obj> <sink_obj>160</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_897"> <id>932</id> <edge_type>2</edge_type> <source_obj>159</source_obj> <sink_obj>160</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_898"> <id>933</id> <edge_type>1</edge_type> <source_obj>482</source_obj> <sink_obj>160</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_899"> <id>934</id> <edge_type>2</edge_type> <source_obj>152</source_obj> <sink_obj>160</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_900"> <id>935</id> <edge_type>1</edge_type> <source_obj>157</source_obj> <sink_obj>161</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_901"> <id>936</id> <edge_type>2</edge_type> <source_obj>159</source_obj> <sink_obj>161</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_902"> <id>937</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>161</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_903"> <id>938</id> <edge_type>2</edge_type> <source_obj>152</source_obj> <sink_obj>161</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_904"> <id>940</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>162</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_905"> <id>941</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>162</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_906"> <id>942</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>162</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_907"> <id>943</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>162</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_908"> <id>944</id> <edge_type>1</edge_type> <source_obj>144</source_obj> <sink_obj>162</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_909"> <id>945</id> <edge_type>1</edge_type> <source_obj>560</source_obj> <sink_obj>162</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_910"> <id>946</id> <edge_type>1</edge_type> <source_obj>161</source_obj> <sink_obj>162</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_911"> <id>947</id> <edge_type>1</edge_type> <source_obj>160</source_obj> <sink_obj>162</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_912"> <id>948</id> <edge_type>2</edge_type> <source_obj>269</source_obj> <sink_obj>163</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_913"> <id>949</id> <edge_type>1</edge_type> <source_obj>19</source_obj> <sink_obj>39</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_914"> <id>951</id> <edge_type>1</edge_type> <source_obj>950</source_obj> <sink_obj>39</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_915"> <id>952</id> <edge_type>1</edge_type> <source_obj>39</source_obj> <sink_obj>40</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_916"> <id>953</id> <edge_type>2</edge_type> <source_obj>44</source_obj> <sink_obj>40</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_917"> <id>954</id> <edge_type>2</edge_type> <source_obj>67</source_obj> <sink_obj>40</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_918"> <id>955</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>65</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_919"> <id>957</id> <edge_type>1</edge_type> <source_obj>956</source_obj> <sink_obj>65</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_920"> <id>958</id> <edge_type>1</edge_type> <source_obj>65</source_obj> <sink_obj>66</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_921"> <id>959</id> <edge_type>2</edge_type> <source_obj>73</source_obj> <sink_obj>66</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_922"> <id>960</id> <edge_type>2</edge_type> <source_obj>70</source_obj> <sink_obj>66</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_923"> <id>962</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>68</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_924"> <id>963</id> <edge_type>1</edge_type> <source_obj>304</source_obj> <sink_obj>68</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_925"> <id>964</id> <edge_type>1</edge_type> <source_obj>68</source_obj> <sink_obj>69</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_926"> <id>965</id> <edge_type>2</edge_type> <source_obj>73</source_obj> <sink_obj>69</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_927"> <id>966</id> <edge_type>2</edge_type> <source_obj>121</source_obj> <sink_obj>69</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_928"> <id>969</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>109</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_929"> <id>971</id> <edge_type>1</edge_type> <source_obj>970</source_obj> <sink_obj>109</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_930"> <id>972</id> <edge_type>1</edge_type> <source_obj>434</source_obj> <sink_obj>109</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_931"> <id>974</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>110</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_932"> <id>975</id> <edge_type>1</edge_type> <source_obj>110</source_obj> <sink_obj>111</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_933"> <id>977</id> <edge_type>1</edge_type> <source_obj>111</source_obj> <sink_obj>112</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_934"> <id>978</id> <edge_type>1</edge_type> <source_obj>109</source_obj> <sink_obj>112</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_935"> <id>979</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>113</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_936"> <id>981</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_937"> <id>982</id> <edge_type>1</edge_type> <source_obj>352</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_938"> <id>983</id> <edge_type>1</edge_type> <source_obj>660</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_939"> <id>984</id> <edge_type>1</edge_type> <source_obj>662</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_940"> <id>985</id> <edge_type>1</edge_type> <source_obj>664</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_941"> <id>986</id> <edge_type>1</edge_type> <source_obj>666</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_942"> <id>987</id> <edge_type>1</edge_type> <source_obj>668</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_943"> <id>988</id> <edge_type>1</edge_type> <source_obj>670</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_944"> <id>989</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_945"> <id>990</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_946"> <id>991</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_947"> <id>992</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_948"> <id>993</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_949"> <id>994</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_950"> <id>995</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_951"> <id>996</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_952"> <id>997</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_953"> <id>998</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_954"> <id>999</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_955"> <id>1000</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_956"> <id>1001</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_957"> <id>1002</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_958"> <id>1003</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_959"> <id>1004</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_960"> <id>1005</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_961"> <id>1006</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_962"> <id>1007</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_963"> <id>1008</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_964"> <id>1009</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_965"> <id>1010</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_966"> <id>1011</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_967"> <id>1012</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_968"> <id>1013</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_969"> <id>1014</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_970"> <id>1015</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_971"> <id>1016</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_972"> <id>1017</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_973"> <id>1018</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_974"> <id>1019</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_975"> <id>1020</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_976"> <id>1021</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_977"> <id>1022</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_978"> <id>1023</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_979"> <id>1024</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_980"> <id>1025</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_981"> <id>1026</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_982"> <id>1027</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_983"> <id>1028</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_984"> <id>1029</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_985"> <id>1030</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_986"> <id>1031</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_987"> <id>1032</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_988"> <id>1033</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_989"> <id>1034</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_990"> <id>1035</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_991"> <id>1036</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_992"> <id>1037</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_993"> <id>1038</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_994"> <id>1039</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_995"> <id>1040</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_996"> <id>1041</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_997"> <id>1042</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_998"> <id>1043</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_999"> <id>1044</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1000"> <id>1045</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1001"> <id>1046</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1002"> <id>1047</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1003"> <id>1048</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1004"> <id>1049</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1005"> <id>1050</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1006"> <id>1051</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1007"> <id>1052</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1008"> <id>1053</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1009"> <id>1054</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1010"> <id>1055</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1011"> <id>1056</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1012"> <id>1057</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1013"> <id>1058</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1014"> <id>1059</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1015"> <id>1060</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1016"> <id>1061</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1017"> <id>1062</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1018"> <id>1063</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1019"> <id>1064</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1020"> <id>1065</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1021"> <id>1066</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1022"> <id>1067</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1023"> <id>1068</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1024"> <id>1069</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1025"> <id>1070</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1026"> <id>1071</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1027"> <id>1072</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1028"> <id>1073</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1029"> <id>1074</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1030"> <id>1075</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1031"> <id>1076</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1032"> <id>1077</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1033"> <id>1078</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1034"> <id>1079</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1035"> <id>1080</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1036"> <id>1081</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1037"> <id>1082</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1038"> <id>1083</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1039"> <id>1084</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1040"> <id>1085</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1041"> <id>1086</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1042"> <id>1087</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1043"> <id>1088</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1044"> <id>1089</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1045"> <id>1090</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1046"> <id>1091</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1047"> <id>1092</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1048"> <id>1093</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1049"> <id>1094</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1050"> <id>1095</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1051"> <id>1096</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1052"> <id>1097</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1053"> <id>1098</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1054"> <id>1099</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1055"> <id>1100</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1056"> <id>1101</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1057"> <id>1102</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1058"> <id>1103</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1059"> <id>1104</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1060"> <id>1105</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1061"> <id>1106</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1062"> <id>1107</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1063"> <id>1108</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1064"> <id>1109</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1065"> <id>1110</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1066"> <id>1111</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1067"> <id>1112</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1068"> <id>1113</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1069"> <id>1114</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1070"> <id>1115</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1071"> <id>1116</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1072"> <id>1117</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1073"> <id>1118</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1074"> <id>1119</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1075"> <id>1120</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1076"> <id>1121</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1077"> <id>1122</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1078"> <id>1123</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1079"> <id>1124</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1080"> <id>1125</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1081"> <id>1126</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1082"> <id>1127</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1083"> <id>1128</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1084"> <id>1129</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1085"> <id>1130</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1086"> <id>1131</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1087"> <id>1132</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1088"> <id>1133</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1089"> <id>1134</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1090"> <id>1135</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1091"> <id>1136</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1092"> <id>1137</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1093"> <id>1138</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1094"> <id>1139</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1095"> <id>1140</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1096"> <id>1141</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1097"> <id>1142</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1098"> <id>1143</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1099"> <id>1144</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1100"> <id>1145</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1101"> <id>1146</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1102"> <id>1147</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1103"> <id>1148</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1104"> <id>1149</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1105"> <id>1150</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1106"> <id>1151</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1107"> <id>1152</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1108"> <id>1153</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1109"> <id>1154</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1110"> <id>1155</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1111"> <id>1156</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1112"> <id>1157</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1113"> <id>1158</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1114"> <id>1159</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1115"> <id>1160</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1116"> <id>1161</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1117"> <id>1162</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1118"> <id>1163</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1119"> <id>1164</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1120"> <id>1165</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1121"> <id>1166</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1122"> <id>1167</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1123"> <id>1168</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1124"> <id>1169</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1125"> <id>1170</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1126"> <id>1171</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1127"> <id>1172</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1128"> <id>1173</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1129"> <id>1174</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1130"> <id>1175</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1131"> <id>1176</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1132"> <id>1177</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1133"> <id>1178</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1134"> <id>1179</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1135"> <id>1180</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1136"> <id>1181</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1137"> <id>1182</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1138"> <id>1183</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1139"> <id>1184</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1140"> <id>1185</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1141"> <id>1186</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1142"> <id>1187</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1143"> <id>1188</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1144"> <id>1189</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1145"> <id>1190</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1146"> <id>1191</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1147"> <id>1192</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1148"> <id>1193</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1149"> <id>1194</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1150"> <id>1195</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1151"> <id>1196</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1152"> <id>1197</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1153"> <id>1198</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1154"> <id>1199</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1155"> <id>1200</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1156"> <id>1201</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1157"> <id>1202</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1158"> <id>1203</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1159"> <id>1204</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1160"> <id>1205</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1161"> <id>1206</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1162"> <id>1207</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1163"> <id>1208</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1164"> <id>1209</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1165"> <id>1210</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1166"> <id>1211</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1167"> <id>1212</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1168"> <id>1213</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1169"> <id>1214</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1170"> <id>1215</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1171"> <id>1216</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1172"> <id>1217</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1173"> <id>1218</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1174"> <id>1219</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1175"> <id>1220</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1176"> <id>1221</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1177"> <id>1222</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1178"> <id>1223</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1179"> <id>1224</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1180"> <id>1225</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1181"> <id>1226</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1182"> <id>1227</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1183"> <id>1228</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1184"> <id>1229</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1185"> <id>1230</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1186"> <id>1231</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1187"> <id>1232</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1188"> <id>1233</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1189"> <id>1234</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1190"> <id>1235</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1191"> <id>1236</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1192"> <id>1237</id> <edge_type>1</edge_type> <source_obj>113</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1193"> <id>1238</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>115</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1194"> <id>1240</id> <edge_type>1</edge_type> <source_obj>1239</source_obj> <sink_obj>115</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1195"> <id>1241</id> <edge_type>1</edge_type> <source_obj>390</source_obj> <sink_obj>116</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1196"> <id>1242</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>116</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1197"> <id>1243</id> <edge_type>1</edge_type> <source_obj>115</source_obj> <sink_obj>117</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1198"> <id>1244</id> <edge_type>1</edge_type> <source_obj>116</source_obj> <sink_obj>117</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1199"> <id>1246</id> <edge_type>1</edge_type> <source_obj>1245</source_obj> <sink_obj>117</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1200"> <id>1247</id> <edge_type>1</edge_type> <source_obj>117</source_obj> <sink_obj>118</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1201"> <id>1248</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>118</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1202"> <id>1249</id> <edge_type>1</edge_type> <source_obj>117</source_obj> <sink_obj>119</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1203"> <id>1250</id> <edge_type>1</edge_type> <source_obj>1245</source_obj> <sink_obj>119</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1204"> <id>1251</id> <edge_type>1</edge_type> <source_obj>119</source_obj> <sink_obj>120</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1205"> <id>1252</id> <edge_type>2</edge_type> <source_obj>124</source_obj> <sink_obj>120</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1206"> <id>1253</id> <edge_type>2</edge_type> <source_obj>132</source_obj> <sink_obj>120</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1207"> <id>1254</id> <edge_type>1</edge_type> <source_obj>594</source_obj> <sink_obj>130</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1208"> <id>1255</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>130</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1209"> <id>1256</id> <edge_type>2</edge_type> <source_obj>137</source_obj> <sink_obj>131</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1210"> <id>1257</id> <edge_type>1</edge_type> <source_obj>117</source_obj> <sink_obj>122</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1211"> <id>1258</id> <edge_type>1</edge_type> <source_obj>645</source_obj> <sink_obj>122</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1212"> <id>1259</id> <edge_type>1</edge_type> <source_obj>122</source_obj> <sink_obj>123</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1213"> <id>1260</id> <edge_type>2</edge_type> <source_obj>129</source_obj> <sink_obj>123</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1214"> <id>1261</id> <edge_type>2</edge_type> <source_obj>127</source_obj> <sink_obj>123</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1215"> <id>1263</id> <edge_type>1</edge_type> <source_obj>1262</source_obj> <sink_obj>125</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1216"> <id>1264</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>125</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1217"> <id>1265</id> <edge_type>2</edge_type> <source_obj>129</source_obj> <sink_obj>126</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1218"> <id>1266</id> <edge_type>2</edge_type> <source_obj>137</source_obj> <sink_obj>128</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1219"> <id>1267</id> <edge_type>1</edge_type> <source_obj>363</source_obj> <sink_obj>133</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1220"> <id>1268</id> <edge_type>2</edge_type> <source_obj>132</source_obj> <sink_obj>133</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1221"> <id>1269</id> <edge_type>1</edge_type> <source_obj>482</source_obj> <sink_obj>133</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1222"> <id>1270</id> <edge_type>2</edge_type> <source_obj>129</source_obj> <sink_obj>133</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1223"> <id>1271</id> <edge_type>1</edge_type> <source_obj>114</source_obj> <sink_obj>134</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1224"> <id>1272</id> <edge_type>2</edge_type> <source_obj>132</source_obj> <sink_obj>134</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1225"> <id>1273</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>134</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1226"> <id>1274</id> <edge_type>2</edge_type> <source_obj>129</source_obj> <sink_obj>134</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1227"> <id>1276</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>135</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1228"> <id>1277</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>135</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1229"> <id>1278</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>135</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1230"> <id>1279</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>135</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1231"> <id>1280</id> <edge_type>1</edge_type> <source_obj>112</source_obj> <sink_obj>135</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1232"> <id>1281</id> <edge_type>1</edge_type> <source_obj>560</source_obj> <sink_obj>135</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1233"> <id>1282</id> <edge_type>1</edge_type> <source_obj>134</source_obj> <sink_obj>135</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1234"> <id>1283</id> <edge_type>1</edge_type> <source_obj>133</source_obj> <sink_obj>135</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1235"> <id>1284</id> <edge_type>2</edge_type> <source_obj>269</source_obj> <sink_obj>136</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1236"> <id>1285</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>71</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1237"> <id>1286</id> <edge_type>1</edge_type> <source_obj>645</source_obj> <sink_obj>71</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1238"> <id>1287</id> <edge_type>1</edge_type> <source_obj>71</source_obj> <sink_obj>72</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1239"> <id>1288</id> <edge_type>2</edge_type> <source_obj>108</source_obj> <sink_obj>72</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1240"> <id>1289</id> <edge_type>2</edge_type> <source_obj>106</source_obj> <sink_obj>72</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1241"> <id>1290</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>74</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1242"> <id>1293</id> <edge_type>1</edge_type> <source_obj>74</source_obj> <sink_obj>75</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1243"> <id>1295</id> <edge_type>1</edge_type> <source_obj>1294</source_obj> <sink_obj>75</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1244"> <id>1297</id> <edge_type>1</edge_type> <source_obj>1296</source_obj> <sink_obj>76</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1245"> <id>1298</id> <edge_type>1</edge_type> <source_obj>75</source_obj> <sink_obj>76</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1246"> <id>1300</id> <edge_type>1</edge_type> <source_obj>1299</source_obj> <sink_obj>77</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1247"> <id>1301</id> <edge_type>1</edge_type> <source_obj>75</source_obj> <sink_obj>77</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1248"> <id>1304</id> <edge_type>1</edge_type> <source_obj>77</source_obj> <sink_obj>78</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1249"> <id>1306</id> <edge_type>1</edge_type> <source_obj>1305</source_obj> <sink_obj>78</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1250"> <id>1307</id> <edge_type>1</edge_type> <source_obj>78</source_obj> <sink_obj>79</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1251"> <id>1308</id> <edge_type>1</edge_type> <source_obj>363</source_obj> <sink_obj>79</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1252"> <id>1309</id> <edge_type>1</edge_type> <source_obj>77</source_obj> <sink_obj>80</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1253"> <id>1312</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>81</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1254"> <id>1313</id> <edge_type>1</edge_type> <source_obj>434</source_obj> <sink_obj>81</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1255"> <id>1314</id> <edge_type>1</edge_type> <source_obj>543</source_obj> <sink_obj>81</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1256"> <id>1316</id> <edge_type>1</edge_type> <source_obj>1315</source_obj> <sink_obj>82</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1257"> <id>1317</id> <edge_type>1</edge_type> <source_obj>80</source_obj> <sink_obj>82</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1258"> <id>1319</id> <edge_type>1</edge_type> <source_obj>1318</source_obj> <sink_obj>83</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1259"> <id>1320</id> <edge_type>1</edge_type> <source_obj>80</source_obj> <sink_obj>83</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1260"> <id>1321</id> <edge_type>1</edge_type> <source_obj>79</source_obj> <sink_obj>84</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1261"> <id>1322</id> <edge_type>1</edge_type> <source_obj>82</source_obj> <sink_obj>84</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1262"> <id>1323</id> <edge_type>1</edge_type> <source_obj>83</source_obj> <sink_obj>84</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1263"> <id>1324</id> <edge_type>1</edge_type> <source_obj>79</source_obj> <sink_obj>85</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1264"> <id>1325</id> <edge_type>1</edge_type> <source_obj>81</source_obj> <sink_obj>85</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1265"> <id>1326</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>85</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1266"> <id>1328</id> <edge_type>1</edge_type> <source_obj>1327</source_obj> <sink_obj>86</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1267"> <id>1329</id> <edge_type>1</edge_type> <source_obj>84</source_obj> <sink_obj>86</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1268"> <id>1330</id> <edge_type>1</edge_type> <source_obj>86</source_obj> <sink_obj>87</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1269"> <id>1333</id> <edge_type>1</edge_type> <source_obj>85</source_obj> <sink_obj>88</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1270"> <id>1334</id> <edge_type>1</edge_type> <source_obj>509</source_obj> <sink_obj>88</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1271"> <id>1335</id> <edge_type>1</edge_type> <source_obj>434</source_obj> <sink_obj>88</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1272"> <id>1336</id> <edge_type>1</edge_type> <source_obj>88</source_obj> <sink_obj>89</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1273"> <id>1338</id> <edge_type>1</edge_type> <source_obj>85</source_obj> <sink_obj>90</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1274"> <id>1339</id> <edge_type>1</edge_type> <source_obj>970</source_obj> <sink_obj>90</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1275"> <id>1340</id> <edge_type>1</edge_type> <source_obj>434</source_obj> <sink_obj>90</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1276"> <id>1341</id> <edge_type>1</edge_type> <source_obj>90</source_obj> <sink_obj>91</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1277"> <id>1342</id> <edge_type>1</edge_type> <source_obj>79</source_obj> <sink_obj>92</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1278"> <id>1343</id> <edge_type>1</edge_type> <source_obj>89</source_obj> <sink_obj>92</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1279"> <id>1344</id> <edge_type>1</edge_type> <source_obj>91</source_obj> <sink_obj>92</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1280"> <id>1346</id> <edge_type>1</edge_type> <source_obj>1345</source_obj> <sink_obj>93</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1281"> <id>1347</id> <edge_type>1</edge_type> <source_obj>87</source_obj> <sink_obj>93</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1282"> <id>1348</id> <edge_type>1</edge_type> <source_obj>92</source_obj> <sink_obj>94</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1283"> <id>1349</id> <edge_type>1</edge_type> <source_obj>93</source_obj> <sink_obj>94</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1284"> <id>1350</id> <edge_type>1</edge_type> <source_obj>76</source_obj> <sink_obj>95</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1285"> <id>1351</id> <edge_type>1</edge_type> <source_obj>1327</source_obj> <sink_obj>96</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1286"> <id>1352</id> <edge_type>1</edge_type> <source_obj>95</source_obj> <sink_obj>96</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1287"> <id>1353</id> <edge_type>1</edge_type> <source_obj>96</source_obj> <sink_obj>97</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1288"> <id>1354</id> <edge_type>1</edge_type> <source_obj>1345</source_obj> <sink_obj>98</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1289"> <id>1355</id> <edge_type>1</edge_type> <source_obj>97</source_obj> <sink_obj>98</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1290"> <id>1356</id> <edge_type>1</edge_type> <source_obj>94</source_obj> <sink_obj>99</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1291"> <id>1357</id> <edge_type>1</edge_type> <source_obj>98</source_obj> <sink_obj>99</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1292"> <id>1358</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>100</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1293"> <id>1360</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1294"> <id>1361</id> <edge_type>1</edge_type> <source_obj>352</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1295"> <id>1362</id> <edge_type>1</edge_type> <source_obj>660</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1296"> <id>1363</id> <edge_type>1</edge_type> <source_obj>662</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1297"> <id>1364</id> <edge_type>1</edge_type> <source_obj>664</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1298"> <id>1365</id> <edge_type>1</edge_type> <source_obj>666</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1299"> <id>1366</id> <edge_type>1</edge_type> <source_obj>668</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1300"> <id>1367</id> <edge_type>1</edge_type> <source_obj>670</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1301"> <id>1368</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1302"> <id>1369</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1303"> <id>1370</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1304"> <id>1371</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1305"> <id>1372</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1306"> <id>1373</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1307"> <id>1374</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1308"> <id>1375</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1309"> <id>1376</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1310"> <id>1377</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1311"> <id>1378</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1312"> <id>1379</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1313"> <id>1380</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1314"> <id>1381</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1315"> <id>1382</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1316"> <id>1383</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1317"> <id>1384</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1318"> <id>1385</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1319"> <id>1386</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1320"> <id>1387</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1321"> <id>1388</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1322"> <id>1389</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1323"> <id>1390</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1324"> <id>1391</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1325"> <id>1392</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1326"> <id>1393</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1327"> <id>1394</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1328"> <id>1395</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1329"> <id>1396</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1330"> <id>1397</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1331"> <id>1398</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1332"> <id>1399</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1333"> <id>1400</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1334"> <id>1401</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1335"> <id>1402</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1336"> <id>1403</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1337"> <id>1404</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1338"> <id>1405</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1339"> <id>1406</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1340"> <id>1407</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1341"> <id>1408</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1342"> <id>1409</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1343"> <id>1410</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1344"> <id>1411</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1345"> <id>1412</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1346"> <id>1413</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1347"> <id>1414</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1348"> <id>1415</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1349"> <id>1416</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1350"> <id>1417</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1351"> <id>1418</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1352"> <id>1419</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1353"> <id>1420</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1354"> <id>1421</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1355"> <id>1422</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1356"> <id>1423</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1357"> <id>1424</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1358"> <id>1425</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1359"> <id>1426</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1360"> <id>1427</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1361"> <id>1428</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1362"> <id>1429</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1363"> <id>1430</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1364"> <id>1431</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1365"> <id>1432</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1366"> <id>1433</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1367"> <id>1434</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1368"> <id>1435</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1369"> <id>1436</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1370"> <id>1437</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1371"> <id>1438</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1372"> <id>1439</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1373"> <id>1440</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1374"> <id>1441</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1375"> <id>1442</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1376"> <id>1443</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1377"> <id>1444</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1378"> <id>1445</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1379"> <id>1446</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1380"> <id>1447</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1381"> <id>1448</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1382"> <id>1449</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1383"> <id>1450</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1384"> <id>1451</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1385"> <id>1452</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1386"> <id>1453</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1387"> <id>1454</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1388"> <id>1455</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1389"> <id>1456</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1390"> <id>1457</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1391"> <id>1458</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1392"> <id>1459</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1393"> <id>1460</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1394"> <id>1461</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1395"> <id>1462</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1396"> <id>1463</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1397"> <id>1464</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1398"> <id>1465</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1399"> <id>1466</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1400"> <id>1467</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1401"> <id>1468</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1402"> <id>1469</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1403"> <id>1470</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1404"> <id>1471</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1405"> <id>1472</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1406"> <id>1473</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1407"> <id>1474</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1408"> <id>1475</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1409"> <id>1476</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1410"> <id>1477</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1411"> <id>1478</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1412"> <id>1479</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1413"> <id>1480</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1414"> <id>1481</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1415"> <id>1482</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1416"> <id>1483</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1417"> <id>1484</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1418"> <id>1485</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1419"> <id>1486</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1420"> <id>1487</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1421"> <id>1488</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1422"> <id>1489</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1423"> <id>1490</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1424"> <id>1491</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1425"> <id>1492</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1426"> <id>1493</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1427"> <id>1494</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1428"> <id>1495</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1429"> <id>1496</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1430"> <id>1497</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1431"> <id>1498</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1432"> <id>1499</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1433"> <id>1500</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1434"> <id>1501</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1435"> <id>1502</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1436"> <id>1503</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1437"> <id>1504</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1438"> <id>1505</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1439"> <id>1506</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1440"> <id>1507</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1441"> <id>1508</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1442"> <id>1509</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1443"> <id>1510</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1444"> <id>1511</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1445"> <id>1512</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1446"> <id>1513</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1447"> <id>1514</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1448"> <id>1515</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1449"> <id>1516</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1450"> <id>1517</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1451"> <id>1518</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1452"> <id>1519</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1453"> <id>1520</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1454"> <id>1521</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1455"> <id>1522</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1456"> <id>1523</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1457"> <id>1524</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1458"> <id>1525</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1459"> <id>1526</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1460"> <id>1527</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1461"> <id>1528</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1462"> <id>1529</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1463"> <id>1530</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1464"> <id>1531</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1465"> <id>1532</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1466"> <id>1533</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1467"> <id>1534</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1468"> <id>1535</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1469"> <id>1536</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1470"> <id>1537</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1471"> <id>1538</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1472"> <id>1539</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1473"> <id>1540</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1474"> <id>1541</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1475"> <id>1542</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1476"> <id>1543</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1477"> <id>1544</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1478"> <id>1545</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1479"> <id>1546</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1480"> <id>1547</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1481"> <id>1548</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1482"> <id>1549</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1483"> <id>1550</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1484"> <id>1551</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1485"> <id>1552</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1486"> <id>1553</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1487"> <id>1554</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1488"> <id>1555</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1489"> <id>1556</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1490"> <id>1557</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1491"> <id>1558</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1492"> <id>1559</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1493"> <id>1560</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1494"> <id>1561</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1495"> <id>1562</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1496"> <id>1563</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1497"> <id>1564</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1498"> <id>1565</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1499"> <id>1566</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1500"> <id>1567</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1501"> <id>1568</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1502"> <id>1569</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1503"> <id>1570</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1504"> <id>1571</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1505"> <id>1572</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1506"> <id>1573</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1507"> <id>1574</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1508"> <id>1575</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1509"> <id>1576</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1510"> <id>1577</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1511"> <id>1578</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1512"> <id>1579</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1513"> <id>1580</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1514"> <id>1581</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1515"> <id>1582</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1516"> <id>1583</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1517"> <id>1584</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1518"> <id>1585</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1519"> <id>1586</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1520"> <id>1587</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1521"> <id>1588</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1522"> <id>1589</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1523"> <id>1590</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1524"> <id>1591</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1525"> <id>1592</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1526"> <id>1593</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1527"> <id>1594</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1528"> <id>1595</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1529"> <id>1596</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1530"> <id>1597</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1531"> <id>1598</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1532"> <id>1599</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1533"> <id>1600</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1534"> <id>1601</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1535"> <id>1602</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1536"> <id>1603</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1537"> <id>1604</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1538"> <id>1605</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1539"> <id>1606</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1540"> <id>1607</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1541"> <id>1608</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1542"> <id>1609</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1543"> <id>1610</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1544"> <id>1611</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1545"> <id>1612</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1546"> <id>1613</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1547"> <id>1614</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1548"> <id>1615</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1549"> <id>1616</id> <edge_type>1</edge_type> <source_obj>100</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1550"> <id>1617</id> <edge_type>1</edge_type> <source_obj>1245</source_obj> <sink_obj>102</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1551"> <id>1618</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>102</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1552"> <id>1619</id> <edge_type>1</edge_type> <source_obj>594</source_obj> <sink_obj>103</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1553"> <id>1620</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>103</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1554"> <id>1622</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>104</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1555"> <id>1623</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>104</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1556"> <id>1624</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>104</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1557"> <id>1625</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>104</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1558"> <id>1626</id> <edge_type>1</edge_type> <source_obj>99</source_obj> <sink_obj>104</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1559"> <id>1627</id> <edge_type>1</edge_type> <source_obj>560</source_obj> <sink_obj>104</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1560"> <id>1628</id> <edge_type>1</edge_type> <source_obj>101</source_obj> <sink_obj>104</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1561"> <id>1629</id> <edge_type>1</edge_type> <source_obj>363</source_obj> <sink_obj>104</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1562"> <id>1630</id> <edge_type>2</edge_type> <source_obj>108</source_obj> <sink_obj>105</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1563"> <id>1631</id> <edge_type>2</edge_type> <source_obj>269</source_obj> <sink_obj>107</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1564"> <id>1632</id> <edge_type>1</edge_type> <source_obj>19</source_obj> <sink_obj>42</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1565"> <id>1634</id> <edge_type>1</edge_type> <source_obj>1633</source_obj> <sink_obj>42</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1566"> <id>1635</id> <edge_type>1</edge_type> <source_obj>42</source_obj> <sink_obj>43</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1567"> <id>1636</id> <edge_type>2</edge_type> <source_obj>47</source_obj> <sink_obj>43</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1568"> <id>1637</id> <edge_type>2</edge_type> <source_obj>62</source_obj> <sink_obj>43</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1569"> <id>1639</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>54</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1570"> <id>1640</id> <edge_type>1</edge_type> <source_obj>970</source_obj> <sink_obj>54</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1571"> <id>1641</id> <edge_type>1</edge_type> <source_obj>434</source_obj> <sink_obj>54</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1572"> <id>1642</id> <edge_type>1</edge_type> <source_obj>54</source_obj> <sink_obj>55</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1573"> <id>1643</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>56</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1574"> <id>1645</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1575"> <id>1646</id> <edge_type>1</edge_type> <source_obj>352</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1576"> <id>1647</id> <edge_type>1</edge_type> <source_obj>660</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1577"> <id>1648</id> <edge_type>1</edge_type> <source_obj>662</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1578"> <id>1649</id> <edge_type>1</edge_type> <source_obj>664</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1579"> <id>1650</id> <edge_type>1</edge_type> <source_obj>666</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1580"> <id>1651</id> <edge_type>1</edge_type> <source_obj>668</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1581"> <id>1652</id> <edge_type>1</edge_type> <source_obj>670</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1582"> <id>1653</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1583"> <id>1654</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1584"> <id>1655</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1585"> <id>1656</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1586"> <id>1657</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1587"> <id>1658</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1588"> <id>1659</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1589"> <id>1660</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1590"> <id>1661</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1591"> <id>1662</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1592"> <id>1663</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1593"> <id>1664</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1594"> <id>1665</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1595"> <id>1666</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1596"> <id>1667</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1597"> <id>1668</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1598"> <id>1669</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1599"> <id>1670</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1600"> <id>1671</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1601"> <id>1672</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1602"> <id>1673</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1603"> <id>1674</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1604"> <id>1675</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1605"> <id>1676</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1606"> <id>1677</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1607"> <id>1678</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1608"> <id>1679</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1609"> <id>1680</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1610"> <id>1681</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1611"> <id>1682</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1612"> <id>1683</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1613"> <id>1684</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1614"> <id>1685</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1615"> <id>1686</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1616"> <id>1687</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1617"> <id>1688</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1618"> <id>1689</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1619"> <id>1690</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1620"> <id>1691</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1621"> <id>1692</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1622"> <id>1693</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1623"> <id>1694</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1624"> <id>1695</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1625"> <id>1696</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1626"> <id>1697</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1627"> <id>1698</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1628"> <id>1699</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1629"> <id>1700</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1630"> <id>1701</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1631"> <id>1702</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1632"> <id>1703</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1633"> <id>1704</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1634"> <id>1705</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1635"> <id>1706</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1636"> <id>1707</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1637"> <id>1708</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1638"> <id>1709</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1639"> <id>1710</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1640"> <id>1711</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1641"> <id>1712</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1642"> <id>1713</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1643"> <id>1714</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1644"> <id>1715</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1645"> <id>1716</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1646"> <id>1717</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1647"> <id>1718</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1648"> <id>1719</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1649"> <id>1720</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1650"> <id>1721</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1651"> <id>1722</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1652"> <id>1723</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1653"> <id>1724</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1654"> <id>1725</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1655"> <id>1726</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1656"> <id>1727</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1657"> <id>1728</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1658"> <id>1729</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1659"> <id>1730</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1660"> <id>1731</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1661"> <id>1732</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1662"> <id>1733</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1663"> <id>1734</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1664"> <id>1735</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1665"> <id>1736</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1666"> <id>1737</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1667"> <id>1738</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1668"> <id>1739</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1669"> <id>1740</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1670"> <id>1741</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1671"> <id>1742</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1672"> <id>1743</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1673"> <id>1744</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1674"> <id>1745</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1675"> <id>1746</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1676"> <id>1747</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1677"> <id>1748</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1678"> <id>1749</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1679"> <id>1750</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1680"> <id>1751</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1681"> <id>1752</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1682"> <id>1753</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1683"> <id>1754</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1684"> <id>1755</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1685"> <id>1756</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1686"> <id>1757</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1687"> <id>1758</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1688"> <id>1759</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1689"> <id>1760</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1690"> <id>1761</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1691"> <id>1762</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1692"> <id>1763</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1693"> <id>1764</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1694"> <id>1765</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1695"> <id>1766</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1696"> <id>1767</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1697"> <id>1768</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1698"> <id>1769</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1699"> <id>1770</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1700"> <id>1771</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1701"> <id>1772</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1702"> <id>1773</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1703"> <id>1774</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1704"> <id>1775</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1705"> <id>1776</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1706"> <id>1777</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1707"> <id>1778</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1708"> <id>1779</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1709"> <id>1780</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1710"> <id>1781</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1711"> <id>1782</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1712"> <id>1783</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1713"> <id>1784</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1714"> <id>1785</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1715"> <id>1786</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1716"> <id>1787</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1717"> <id>1788</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1718"> <id>1789</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1719"> <id>1790</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1720"> <id>1791</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1721"> <id>1792</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1722"> <id>1793</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1723"> <id>1794</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1724"> <id>1795</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1725"> <id>1796</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1726"> <id>1797</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1727"> <id>1798</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1728"> <id>1799</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1729"> <id>1800</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1730"> <id>1801</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1731"> <id>1802</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1732"> <id>1803</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1733"> <id>1804</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1734"> <id>1805</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1735"> <id>1806</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1736"> <id>1807</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1737"> <id>1808</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1738"> <id>1809</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1739"> <id>1810</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1740"> <id>1811</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1741"> <id>1812</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1742"> <id>1813</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1743"> <id>1814</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1744"> <id>1815</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1745"> <id>1816</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1746"> <id>1817</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1747"> <id>1818</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1748"> <id>1819</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1749"> <id>1820</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1750"> <id>1821</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1751"> <id>1822</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1752"> <id>1823</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1753"> <id>1824</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1754"> <id>1825</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1755"> <id>1826</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1756"> <id>1827</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1757"> <id>1828</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1758"> <id>1829</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1759"> <id>1830</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1760"> <id>1831</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1761"> <id>1832</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1762"> <id>1833</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1763"> <id>1834</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1764"> <id>1835</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1765"> <id>1836</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1766"> <id>1837</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1767"> <id>1838</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1768"> <id>1839</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1769"> <id>1840</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1770"> <id>1841</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1771"> <id>1842</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1772"> <id>1843</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1773"> <id>1844</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1774"> <id>1845</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1775"> <id>1846</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1776"> <id>1847</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1777"> <id>1848</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1778"> <id>1849</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1779"> <id>1850</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1780"> <id>1851</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1781"> <id>1852</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1782"> <id>1853</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1783"> <id>1854</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1784"> <id>1855</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1785"> <id>1856</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1786"> <id>1857</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1787"> <id>1858</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1788"> <id>1859</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1789"> <id>1860</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1790"> <id>1861</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1791"> <id>1862</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1792"> <id>1863</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1793"> <id>1864</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1794"> <id>1865</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1795"> <id>1866</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1796"> <id>1867</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1797"> <id>1868</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1798"> <id>1869</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1799"> <id>1870</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1800"> <id>1871</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1801"> <id>1872</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1802"> <id>1873</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1803"> <id>1874</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1804"> <id>1875</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1805"> <id>1876</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1806"> <id>1877</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1807"> <id>1878</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1808"> <id>1879</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1809"> <id>1880</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1810"> <id>1881</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1811"> <id>1882</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1812"> <id>1883</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1813"> <id>1884</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1814"> <id>1885</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1815"> <id>1886</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1816"> <id>1887</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1817"> <id>1888</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1818"> <id>1889</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1819"> <id>1890</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1820"> <id>1891</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1821"> <id>1892</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1822"> <id>1893</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1823"> <id>1894</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1824"> <id>1895</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1825"> <id>1896</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1826"> <id>1897</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1827"> <id>1898</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1828"> <id>1899</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1829"> <id>1900</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1830"> <id>1901</id> <edge_type>1</edge_type> <source_obj>56</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1831"> <id>1902</id> <edge_type>1</edge_type> <source_obj>1245</source_obj> <sink_obj>58</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1832"> <id>1903</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>58</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1833"> <id>1904</id> <edge_type>1</edge_type> <source_obj>594</source_obj> <sink_obj>59</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1834"> <id>1905</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>59</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1835"> <id>1907</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>60</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1836"> <id>1908</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>60</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1837"> <id>1909</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>60</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1838"> <id>1910</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>60</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1839"> <id>1911</id> <edge_type>1</edge_type> <source_obj>55</source_obj> <sink_obj>60</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1840"> <id>1912</id> <edge_type>1</edge_type> <source_obj>560</source_obj> <sink_obj>60</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1841"> <id>1913</id> <edge_type>1</edge_type> <source_obj>57</source_obj> <sink_obj>60</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1842"> <id>1914</id> <edge_type>1</edge_type> <source_obj>363</source_obj> <sink_obj>60</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1843"> <id>1915</id> <edge_type>2</edge_type> <source_obj>64</source_obj> <sink_obj>61</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1844"> <id>1916</id> <edge_type>1</edge_type> <source_obj>19</source_obj> <sink_obj>45</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1845"> <id>1918</id> <edge_type>1</edge_type> <source_obj>1917</source_obj> <sink_obj>45</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1846"> <id>1919</id> <edge_type>1</edge_type> <source_obj>45</source_obj> <sink_obj>46</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1847"> <id>1920</id> <edge_type>2</edge_type> <source_obj>53</source_obj> <sink_obj>46</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1848"> <id>1921</id> <edge_type>2</edge_type> <source_obj>51</source_obj> <sink_obj>46</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1849"> <id>1922</id> <edge_type>1</edge_type> <source_obj>594</source_obj> <sink_obj>48</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1850"> <id>1923</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>48</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1851"> <id>1925</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1852"> <id>1926</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1853"> <id>1927</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1854"> <id>1928</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1855"> <id>1930</id> <edge_type>1</edge_type> <source_obj>1929</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1856"> <id>1931</id> <edge_type>1</edge_type> <source_obj>560</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1857"> <id>1932</id> <edge_type>1</edge_type> <source_obj>480</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1858"> <id>1933</id> <edge_type>1</edge_type> <source_obj>363</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1859"> <id>1934</id> <edge_type>2</edge_type> <source_obj>53</source_obj> <sink_obj>50</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1860"> <id>1935</id> <edge_type>2</edge_type> <source_obj>64</source_obj> <sink_obj>52</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1861"> <id>1936</id> <edge_type>2</edge_type> <source_obj>269</source_obj> <sink_obj>63</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1862"> <id>1937</id> <edge_type>1</edge_type> <source_obj>482</source_obj> <sink_obj>266</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1863"> <id>1938</id> <edge_type>2</edge_type> <source_obj>231</source_obj> <sink_obj>266</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1864"> <id>1939</id> <edge_type>1</edge_type> <source_obj>363</source_obj> <sink_obj>266</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1865"> <id>1940</id> <edge_type>2</edge_type> <source_obj>265</source_obj> <sink_obj>266</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1866"> <id>1941</id> <edge_type>1</edge_type> <source_obj>482</source_obj> <sink_obj>266</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1867"> <id>1942</id> <edge_type>2</edge_type> <source_obj>220</source_obj> <sink_obj>266</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1868"> <id>1943</id> <edge_type>1</edge_type> <source_obj>482</source_obj> <sink_obj>266</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1869"> <id>1944</id> <edge_type>2</edge_type> <source_obj>192</source_obj> <sink_obj>266</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1870"> <id>1945</id> <edge_type>1</edge_type> <source_obj>363</source_obj> <sink_obj>266</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1871"> <id>1946</id> <edge_type>2</edge_type> <source_obj>164</source_obj> <sink_obj>266</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1872"> <id>1947</id> <edge_type>1</edge_type> <source_obj>482</source_obj> <sink_obj>266</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1873"> <id>1948</id> <edge_type>2</edge_type> <source_obj>140</source_obj> <sink_obj>266</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1874"> <id>1949</id> <edge_type>1</edge_type> <source_obj>482</source_obj> <sink_obj>266</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1875"> <id>1950</id> <edge_type>2</edge_type> <source_obj>64</source_obj> <sink_obj>266</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1876"> <id>1951</id> <edge_type>1</edge_type> <source_obj>363</source_obj> <sink_obj>266</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1877"> <id>1952</id> <edge_type>2</edge_type> <source_obj>137</source_obj> <sink_obj>266</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1878"> <id>1953</id> <edge_type>1</edge_type> <source_obj>482</source_obj> <sink_obj>266</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1879"> <id>1954</id> <edge_type>2</edge_type> <source_obj>108</source_obj> <sink_obj>266</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1880"> <id>1956</id> <edge_type>1</edge_type> <source_obj>1955</source_obj> <sink_obj>267</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1881"> <id>1957</id> <edge_type>2</edge_type> <source_obj>231</source_obj> <sink_obj>267</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1882"> <id>1958</id> <edge_type>1</edge_type> <source_obj>259</source_obj> <sink_obj>267</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1883"> <id>1959</id> <edge_type>2</edge_type> <source_obj>265</source_obj> <sink_obj>267</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1884"> <id>1960</id> <edge_type>1</edge_type> <source_obj>1955</source_obj> <sink_obj>267</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1885"> <id>1961</id> <edge_type>2</edge_type> <source_obj>220</source_obj> <sink_obj>267</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1886"> <id>1962</id> <edge_type>1</edge_type> <source_obj>1955</source_obj> <sink_obj>267</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1887"> <id>1963</id> <edge_type>2</edge_type> <source_obj>192</source_obj> <sink_obj>267</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1888"> <id>1964</id> <edge_type>1</edge_type> <source_obj>142</source_obj> <sink_obj>267</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1889"> <id>1965</id> <edge_type>2</edge_type> <source_obj>164</source_obj> <sink_obj>267</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1890"> <id>1966</id> <edge_type>1</edge_type> <source_obj>1955</source_obj> <sink_obj>267</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1891"> <id>1967</id> <edge_type>2</edge_type> <source_obj>140</source_obj> <sink_obj>267</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1892"> <id>1968</id> <edge_type>1</edge_type> <source_obj>1955</source_obj> <sink_obj>267</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1893"> <id>1969</id> <edge_type>2</edge_type> <source_obj>64</source_obj> <sink_obj>267</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1894"> <id>1970</id> <edge_type>1</edge_type> <source_obj>110</source_obj> <sink_obj>267</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1895"> <id>1971</id> <edge_type>2</edge_type> <source_obj>137</source_obj> <sink_obj>267</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1896"> <id>1972</id> <edge_type>1</edge_type> <source_obj>1955</source_obj> <sink_obj>267</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1897"> <id>1973</id> <edge_type>2</edge_type> <source_obj>108</source_obj> <sink_obj>267</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1898"> <id>1974</id> <edge_type>1</edge_type> <source_obj>266</source_obj> <sink_obj>268</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1899"> <id>1975</id> <edge_type>2</edge_type> <source_obj>274</source_obj> <sink_obj>268</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1900"> <id>1976</id> <edge_type>2</edge_type> <source_obj>272</source_obj> <sink_obj>268</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1901"> <id>1977</id> <edge_type>1</edge_type> <source_obj>267</source_obj> <sink_obj>270</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1902"> <id>1978</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>270</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1903"> <id>1979</id> <edge_type>2</edge_type> <source_obj>274</source_obj> <sink_obj>271</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1904"> <id>1980</id> <edge_type>2</edge_type> <source_obj>290</source_obj> <sink_obj>273</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1905"> <id>2061</id> <edge_type>2</edge_type> <source_obj>24</source_obj> <sink_obj>277</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1906"> <id>2062</id> <edge_type>2</edge_type> <source_obj>24</source_obj> <sink_obj>29</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1907"> <id>2063</id> <edge_type>2</edge_type> <source_obj>29</source_obj> <sink_obj>231</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1908"> <id>2064</id> <edge_type>2</edge_type> <source_obj>29</source_obj> <sink_obj>32</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1909"> <id>2065</id> <edge_type>2</edge_type> <source_obj>32</source_obj> <sink_obj>196</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1910"> <id>2066</id> <edge_type>2</edge_type> <source_obj>32</source_obj> <sink_obj>35</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1911"> <id>2067</id> <edge_type>2</edge_type> <source_obj>35</source_obj> <sink_obj>167</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1912"> <id>2068</id> <edge_type>2</edge_type> <source_obj>35</source_obj> <sink_obj>38</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1913"> <id>2069</id> <edge_type>2</edge_type> <source_obj>38</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1914"> <id>2070</id> <edge_type>2</edge_type> <source_obj>38</source_obj> <sink_obj>41</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1915"> <id>2071</id> <edge_type>2</edge_type> <source_obj>41</source_obj> <sink_obj>67</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1916"> <id>2072</id> <edge_type>2</edge_type> <source_obj>41</source_obj> <sink_obj>44</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1917"> <id>2073</id> <edge_type>2</edge_type> <source_obj>44</source_obj> <sink_obj>62</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1918"> <id>2074</id> <edge_type>2</edge_type> <source_obj>44</source_obj> <sink_obj>47</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1919"> <id>2075</id> <edge_type>2</edge_type> <source_obj>47</source_obj> <sink_obj>51</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1920"> <id>2076</id> <edge_type>2</edge_type> <source_obj>47</source_obj> <sink_obj>53</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1921"> <id>2077</id> <edge_type>2</edge_type> <source_obj>51</source_obj> <sink_obj>53</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1922"> <id>2078</id> <edge_type>2</edge_type> <source_obj>53</source_obj> <sink_obj>64</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1923"> <id>2079</id> <edge_type>2</edge_type> <source_obj>62</source_obj> <sink_obj>64</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1924"> <id>2080</id> <edge_type>2</edge_type> <source_obj>64</source_obj> <sink_obj>269</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1925"> <id>2081</id> <edge_type>2</edge_type> <source_obj>67</source_obj> <sink_obj>70</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1926"> <id>2082</id> <edge_type>2</edge_type> <source_obj>67</source_obj> <sink_obj>73</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1927"> <id>2083</id> <edge_type>2</edge_type> <source_obj>70</source_obj> <sink_obj>121</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1928"> <id>2084</id> <edge_type>2</edge_type> <source_obj>70</source_obj> <sink_obj>73</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1929"> <id>2085</id> <edge_type>2</edge_type> <source_obj>73</source_obj> <sink_obj>106</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1930"> <id>2086</id> <edge_type>2</edge_type> <source_obj>73</source_obj> <sink_obj>108</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1931"> <id>2087</id> <edge_type>2</edge_type> <source_obj>106</source_obj> <sink_obj>108</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1932"> <id>2088</id> <edge_type>2</edge_type> <source_obj>108</source_obj> <sink_obj>269</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1933"> <id>2089</id> <edge_type>2</edge_type> <source_obj>121</source_obj> <sink_obj>132</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1934"> <id>2090</id> <edge_type>2</edge_type> <source_obj>121</source_obj> <sink_obj>124</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1935"> <id>2091</id> <edge_type>2</edge_type> <source_obj>124</source_obj> <sink_obj>127</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1936"> <id>2092</id> <edge_type>2</edge_type> <source_obj>124</source_obj> <sink_obj>129</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1937"> <id>2093</id> <edge_type>2</edge_type> <source_obj>127</source_obj> <sink_obj>129</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1938"> <id>2094</id> <edge_type>2</edge_type> <source_obj>129</source_obj> <sink_obj>137</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1939"> <id>2095</id> <edge_type>2</edge_type> <source_obj>132</source_obj> <sink_obj>137</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1940"> <id>2096</id> <edge_type>2</edge_type> <source_obj>137</source_obj> <sink_obj>269</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1941"> <id>2097</id> <edge_type>2</edge_type> <source_obj>140</source_obj> <sink_obj>147</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1942"> <id>2098</id> <edge_type>2</edge_type> <source_obj>140</source_obj> <sink_obj>269</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1943"> <id>2099</id> <edge_type>2</edge_type> <source_obj>147</source_obj> <sink_obj>159</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1944"> <id>2100</id> <edge_type>2</edge_type> <source_obj>147</source_obj> <sink_obj>152</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1945"> <id>2101</id> <edge_type>2</edge_type> <source_obj>152</source_obj> <sink_obj>164</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1946"> <id>2102</id> <edge_type>2</edge_type> <source_obj>159</source_obj> <sink_obj>164</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1947"> <id>2103</id> <edge_type>2</edge_type> <source_obj>164</source_obj> <sink_obj>269</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1948"> <id>2104</id> <edge_type>2</edge_type> <source_obj>167</source_obj> <sink_obj>188</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1949"> <id>2105</id> <edge_type>2</edge_type> <source_obj>167</source_obj> <sink_obj>174</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1950"> <id>2106</id> <edge_type>2</edge_type> <source_obj>174</source_obj> <sink_obj>185</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1951"> <id>2107</id> <edge_type>2</edge_type> <source_obj>174</source_obj> <sink_obj>177</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1952"> <id>2108</id> <edge_type>2</edge_type> <source_obj>177</source_obj> <sink_obj>180</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1953"> <id>2109</id> <edge_type>2</edge_type> <source_obj>177</source_obj> <sink_obj>182</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1954"> <id>2110</id> <edge_type>2</edge_type> <source_obj>180</source_obj> <sink_obj>182</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1955"> <id>2111</id> <edge_type>2</edge_type> <source_obj>182</source_obj> <sink_obj>192</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1956"> <id>2112</id> <edge_type>2</edge_type> <source_obj>185</source_obj> <sink_obj>192</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1957"> <id>2113</id> <edge_type>2</edge_type> <source_obj>188</source_obj> <sink_obj>192</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1958"> <id>2114</id> <edge_type>2</edge_type> <source_obj>192</source_obj> <sink_obj>269</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1959"> <id>2115</id> <edge_type>2</edge_type> <source_obj>196</source_obj> <sink_obj>214</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1960"> <id>2116</id> <edge_type>2</edge_type> <source_obj>196</source_obj> <sink_obj>204</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1961"> <id>2117</id> <edge_type>2</edge_type> <source_obj>204</source_obj> <sink_obj>220</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1962"> <id>2118</id> <edge_type>2</edge_type> <source_obj>214</source_obj> <sink_obj>220</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1963"> <id>2119</id> <edge_type>2</edge_type> <source_obj>220</source_obj> <sink_obj>269</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1964"> <id>2120</id> <edge_type>2</edge_type> <source_obj>231</source_obj> <sink_obj>269</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1965"> <id>2121</id> <edge_type>2</edge_type> <source_obj>231</source_obj> <sink_obj>251</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1966"> <id>2122</id> <edge_type>2</edge_type> <source_obj>251</source_obj> <sink_obj>258</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1967"> <id>2123</id> <edge_type>2</edge_type> <source_obj>251</source_obj> <sink_obj>255</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1968"> <id>2124</id> <edge_type>2</edge_type> <source_obj>255</source_obj> <sink_obj>265</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1969"> <id>2125</id> <edge_type>2</edge_type> <source_obj>258</source_obj> <sink_obj>265</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1970"> <id>2126</id> <edge_type>2</edge_type> <source_obj>265</source_obj> <sink_obj>269</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1971"> <id>2127</id> <edge_type>2</edge_type> <source_obj>269</source_obj> <sink_obj>272</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1972"> <id>2128</id> <edge_type>2</edge_type> <source_obj>269</source_obj> <sink_obj>274</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1973"> <id>2129</id> <edge_type>2</edge_type> <source_obj>272</source_obj> <sink_obj>274</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1974"> <id>2130</id> <edge_type>2</edge_type> <source_obj>274</source_obj> <sink_obj>290</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1975"> <id>2131</id> <edge_type>2</edge_type> <source_obj>277</source_obj> <sink_obj>286</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1976"> <id>2132</id> <edge_type>2</edge_type> <source_obj>277</source_obj> <sink_obj>288</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1977"> <id>2133</id> <edge_type>2</edge_type> <source_obj>286</source_obj> <sink_obj>288</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1978"> <id>2134</id> <edge_type>2</edge_type> <source_obj>288</source_obj> <sink_obj>290</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1979"> <id>2135</id> <edge_type>4</edge_type> <source_obj>205</source_obj> <sink_obj>207</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1980"> <id>2136</id> <edge_type>4</edge_type> <source_obj>18</source_obj> <sink_obj>284</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1981"> <id>2137</id> <edge_type>4</edge_type> <source_obj>21</source_obj> <sink_obj>281</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1982"> <id>2138</id> <edge_type>4</edge_type> <source_obj>22</source_obj> <sink_obj>283</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1983"> <id>2139</id> <edge_type>4</edge_type> <source_obj>18</source_obj> <sink_obj>262</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1984"> <id>2140</id> <edge_type>4</edge_type> <source_obj>18</source_obj> <sink_obj>217</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1985"> <id>2141</id> <edge_type>4</edge_type> <source_obj>18</source_obj> <sink_obj>186</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1986"> <id>2142</id> <edge_type>4</edge_type> <source_obj>18</source_obj> <sink_obj>183</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1987"> <id>2143</id> <edge_type>4</edge_type> <source_obj>18</source_obj> <sink_obj>178</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1988"> <id>2144</id> <edge_type>4</edge_type> <source_obj>18</source_obj> <sink_obj>153</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1989"> <id>2145</id> <edge_type>4</edge_type> <source_obj>18</source_obj> <sink_obj>148</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1990"> <id>2146</id> <edge_type>4</edge_type> <source_obj>18</source_obj> <sink_obj>59</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1991"> <id>2147</id> <edge_type>4</edge_type> <source_obj>18</source_obj> <sink_obj>103</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1992"> <id>2148</id> <edge_type>4</edge_type> <source_obj>18</source_obj> <sink_obj>48</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1993"> <id>2149</id> <edge_type>4</edge_type> <source_obj>18</source_obj> <sink_obj>130</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1994"> <id>2150</id> <edge_type>4</edge_type> <source_obj>18</source_obj> <sink_obj>125</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1995"> <id>2151</id> <edge_type>4</edge_type> <source_obj>26</source_obj> <sink_obj>238</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1996"> <id>2152</id> <edge_type>4</edge_type> <source_obj>27</source_obj> <sink_obj>270</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1997"> <id>2153</id> <edge_type>4</edge_type> <source_obj>26</source_obj> <sink_obj>150</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1998"> <id>2154</id> <edge_type>4</edge_type> <source_obj>26</source_obj> <sink_obj>58</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_1999"> <id>2155</id> <edge_type>4</edge_type> <source_obj>26</source_obj> <sink_obj>118</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_2000"> <id>2156</id> <edge_type>4</edge_type> <source_obj>26</source_obj> <sink_obj>102</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_2001"> <id>2157</id> <edge_type>4</edge_type> <source_obj>68</source_obj> <sink_obj>110</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_2002"> <id>2158</id> <edge_type>4</edge_type> <source_obj>138</source_obj> <sink_obj>142</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_2003"> <id>2159</id> <edge_type>4</edge_type> <source_obj>221</source_obj> <sink_obj>252</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_2004"> <id>2160</id> <edge_type>4</edge_type> <source_obj>275</source_obj> <sink_obj>278</sink_obj> <is_back_edge>0</is_back_edge> </item> </edges> </cdfg> <cdfg_regions class_id="21" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="22" tracking_level="1" version="0" object_id="_2005"> <mId>1</mId> <mTag>response_r</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>52</count> <item_version>0</item_version> <item>24</item> <item>29</item> <item>32</item> <item>35</item> <item>38</item> <item>41</item> <item>44</item> <item>47</item> <item>51</item> <item>53</item> <item>62</item> <item>64</item> <item>67</item> <item>70</item> <item>73</item> <item>106</item> <item>108</item> <item>121</item> <item>124</item> <item>127</item> <item>129</item> <item>132</item> <item>137</item> <item>140</item> <item>147</item> <item>152</item> <item>159</item> <item>164</item> <item>167</item> <item>174</item> <item>177</item> <item>180</item> <item>182</item> <item>185</item> <item>188</item> <item>192</item> <item>196</item> <item>204</item> <item>214</item> <item>220</item> <item>231</item> <item>251</item> <item>255</item> <item>258</item> <item>265</item> <item>269</item> <item>272</item> <item>274</item> <item>277</item> <item>286</item> <item>288</item> <item>290</item> </basic_blocks> <mII>1</mII> <mDepth>3</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>2</mMinLatency> <mMaxLatency>2</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> </cdfg_regions> <fsm class_id="24" tracking_level="1" version="0" object_id="_2006"> <states class_id="25" tracking_level="0" version="0"> <count>3</count> <item_version>0</item_version> <item class_id="26" tracking_level="1" version="0" object_id="_2007"> <id>1</id> <operations class_id="27" tracking_level="0" version="0"> <count>145</count> <item_version>0</item_version> <item class_id="28" tracking_level="1" version="0" object_id="_2008"> <id>18</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2009"> <id>19</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2010"> <id>20</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2011"> <id>21</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2012"> <id>22</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2013"> <id>23</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2014"> <id>25</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2015"> <id>26</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2016"> <id>28</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2017"> <id>30</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2018"> <id>31</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2019"> <id>33</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2020"> <id>34</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2021"> <id>36</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2022"> <id>37</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2023"> <id>39</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2024"> <id>40</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2025"> <id>42</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2026"> <id>43</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2027"> <id>45</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2028"> <id>46</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2029"> <id>48</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2030"> <id>58</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2031"> <id>59</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2032"> <id>63</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2033"> <id>65</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2034"> <id>66</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2035"> <id>68</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2036"> <id>71</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2037"> <id>72</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2038"> <id>102</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2039"> <id>103</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2040"> <id>107</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2041"> <id>110</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2042"> <id>111</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2043"> <id>113</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2044"> <id>114</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2045"> <id>115</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2046"> <id>116</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2047"> <id>117</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2048"> <id>118</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2049"> <id>119</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2050"> <id>120</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2051"> <id>122</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2052"> <id>123</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2053"> <id>125</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2054"> <id>128</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2055"> <id>130</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2056"> <id>131</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2057"> <id>136</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2058"> <id>138</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2059"> <id>139</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2060"> <id>142</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2061"> <id>143</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2062"> <id>145</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2063"> <id>146</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2064"> <id>148</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2065"> <id>149</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2066"> <id>150</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2067"> <id>151</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2068"> <id>153</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2069"> <id>154</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2070"> <id>155</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2071"> <id>156</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2072"> <id>157</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2073"> <id>158</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2074"> <id>163</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2075"> <id>165</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2076"> <id>166</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2077"> <id>168</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2078"> <id>169</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2079"> <id>170</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2080"> <id>171</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2081"> <id>172</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2082"> <id>173</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2083"> <id>175</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2084"> <id>176</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2085"> <id>178</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2086"> <id>181</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2087"> <id>183</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2088"> <id>184</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2089"> <id>186</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2090"> <id>187</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2091"> <id>191</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2092"> <id>193</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2093"> <id>194</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2094"> <id>195</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2095"> <id>197</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2096"> <id>198</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2097"> <id>199</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2098"> <id>200</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2099"> <id>201</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2100"> <id>202</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2101"> <id>203</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2102"> <id>205</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2103"> <id>206</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2104"> <id>207</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2105"> <id>208</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2106"> <id>209</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2107"> <id>210</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2108"> <id>211</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2109"> <id>212</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2110"> <id>213</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2111"> <id>217</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2112"> <id>219</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2113"> <id>221</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2114"> <id>222</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2115"> <id>223</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2116"> <id>224</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2117"> <id>225</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2118"> <id>226</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2119"> <id>227</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2120"> <id>228</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2121"> <id>229</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2122"> <id>230</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2123"> <id>232</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2124"> <id>233</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2125"> <id>234</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2126"> <id>235</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2127"> <id>236</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2128"> <id>237</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2129"> <id>238</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2130"> <id>239</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2131"> <id>240</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2132"> <id>243</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2133"> <id>244</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2134"> <id>246</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2135"> <id>248</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2136"> <id>249</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2137"> <id>250</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2138"> <id>252</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2139"> <id>253</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2140"> <id>254</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2141"> <id>256</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2142"> <id>257</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2143"> <id>262</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2144"> <id>275</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2145"> <id>276</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2146"> <id>278</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2147"> <id>279</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2148"> <id>280</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2149"> <id>281</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2150"> <id>282</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2151"> <id>283</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2152"> <id>284</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_2153"> <id>2</id> <operations> <count>65</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_2154"> <id>27</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2155"> <id>49</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_2156"> <id>54</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2157"> <id>55</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2158"> <id>56</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2159"> <id>57</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2160"> <id>60</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_2161"> <id>69</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2162"> <id>74</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2163"> <id>75</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2164"> <id>76</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2165"> <id>77</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2166"> <id>78</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2167"> <id>79</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2168"> <id>80</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2169"> <id>81</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2170"> <id>82</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2171"> <id>83</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2172"> <id>84</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2173"> <id>85</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2174"> <id>86</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2175"> <id>87</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2176"> <id>88</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2177"> <id>89</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2178"> <id>90</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2179"> <id>91</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2180"> <id>92</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2181"> <id>93</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2182"> <id>94</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2183"> <id>95</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2184"> <id>96</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2185"> <id>97</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2186"> <id>98</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2187"> <id>99</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2188"> <id>100</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2189"> <id>101</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2190"> <id>104</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_2191"> <id>109</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2192"> <id>112</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2193"> <id>133</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2194"> <id>134</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2195"> <id>135</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_2196"> <id>141</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2197"> <id>144</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2198"> <id>160</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2199"> <id>161</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2200"> <id>162</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_2201"> <id>189</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2202"> <id>190</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_2203"> <id>215</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2204"> <id>216</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2205"> <id>218</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_2206"> <id>241</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2207"> <id>242</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2208"> <id>245</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2209"> <id>247</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2210"> <id>259</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2211"> <id>260</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2212"> <id>261</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2213"> <id>263</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_2214"> <id>264</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2215"> <id>266</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2216"> <id>267</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2217"> <id>268</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2218"> <id>270</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_2219"> <id>3</id> <operations> <count>23</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_2220"> <id>14</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2221"> <id>15</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2222"> <id>16</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2223"> <id>17</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2224"> <id>49</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_2225"> <id>50</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2226"> <id>52</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2227"> <id>60</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_2228"> <id>61</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2229"> <id>104</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_2230"> <id>105</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2231"> <id>126</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2232"> <id>135</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_2233"> <id>162</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_2234"> <id>179</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2235"> <id>190</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_2236"> <id>218</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_2237"> <id>263</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_2238"> <id>271</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2239"> <id>273</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2240"> <id>285</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2241"> <id>287</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_2242"> <id>289</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> </states> <transitions class_id="29" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="30" tracking_level="1" version="0" object_id="_2243"> <inState>1</inState> <outState>2</outState> <condition class_id="31" tracking_level="0" version="0"> <id>276</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="_2244"> <inState>2</inState> <outState>3</outState> <condition> <id>277</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> </transitions> </fsm> <res class_id="-1"></res> <node_label_latency class_id="35" tracking_level="0" version="0"> <count>221</count> <item_version>0</item_version> <item class_id="36" tracking_level="0" version="0"> <first>18</first> <second class_id="37" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>19</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>20</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>21</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>22</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>23</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>25</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>26</first> <second> <first>0</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>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>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>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>39</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>40</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>42</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>43</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>45</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>46</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>48</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>49</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>50</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>52</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>54</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>55</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>56</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>57</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>58</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>59</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>60</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>61</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>63</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>65</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>66</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>68</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>69</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>71</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>72</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>74</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>75</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>76</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>77</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>78</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>79</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>80</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>81</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>82</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>83</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>84</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>85</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>86</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>87</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>88</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>89</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>90</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>91</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>92</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>93</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>94</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>95</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>96</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>97</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>98</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>99</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>100</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>101</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>102</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>103</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>104</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>105</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>107</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>109</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>110</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>111</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>112</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>113</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>114</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>115</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>116</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>117</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>118</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>119</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>120</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>122</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>123</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>125</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>126</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>128</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>130</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>131</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>133</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>134</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>135</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>136</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>138</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>139</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>141</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>142</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>143</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>144</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>145</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>146</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>148</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>149</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>150</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>151</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>153</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>154</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>155</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>156</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>157</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>158</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>160</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>161</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>162</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>163</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>165</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>166</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>168</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>169</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>170</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>171</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>172</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>173</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>175</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>176</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>178</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>179</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>181</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>183</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>184</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>186</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>187</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>189</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>190</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>191</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>193</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>194</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>195</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>197</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>198</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>199</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>200</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>201</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>202</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>203</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>205</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>206</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>207</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>208</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>209</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>210</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>211</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>212</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>213</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>215</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>216</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>217</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>218</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>219</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>221</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>222</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>223</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>224</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>225</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>226</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>227</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>228</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>229</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>230</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>232</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>233</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>234</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>235</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>236</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>237</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>238</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>239</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>240</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>241</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>242</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>243</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>244</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>245</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>246</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>247</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>248</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>249</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>250</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>252</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>253</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>254</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>256</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>257</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>259</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>260</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>261</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>262</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>263</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>264</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>266</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>267</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>268</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>270</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>271</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>273</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>275</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>276</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>278</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>279</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>280</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>281</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>282</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>283</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>284</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>285</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>287</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>289</first> <second> <first>2</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="38" tracking_level="0" version="0"> <count>52</count> <item_version>0</item_version> <item class_id="39" tracking_level="0" version="0"> <first>24</first> <second class_id="40" tracking_level="0" version="0"> <first>0</first> <second>2</second> </second> </item> <item> <first>29</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>32</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>38</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>41</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>44</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>47</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>51</first> <second> <first>0</first> <second>2</second> </second> </item> <item> <first>53</first> <second> <first>2</first> <second>2</second> </second> </item> <item> <first>62</first> <second> <first>0</first> <second>2</second> </second> </item> <item> <first>64</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>67</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>70</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>73</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>106</first> <second> <first>0</first> <second>2</second> </second> </item> <item> <first>108</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>121</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>124</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>127</first> <second> <first>0</first> <second>2</second> </second> </item> <item> <first>129</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>132</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>137</first> <second> <first>0</first> <second>2</second> </second> </item> <item> <first>140</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>147</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>152</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>159</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>164</first> <second> <first>0</first> <second>2</second> </second> </item> <item> <first>167</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>174</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>177</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>180</first> <second> <first>0</first> <second>2</second> </second> </item> <item> <first>182</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>185</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>188</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>192</first> <second> <first>0</first> <second>2</second> </second> </item> <item> <first>196</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>204</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>214</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>220</first> <second> <first>0</first> <second>2</second> </second> </item> <item> <first>231</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>251</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>255</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>258</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>265</first> <second> <first>0</first> <second>2</second> </second> </item> <item> <first>269</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>272</first> <second> <first>1</first> <second>2</second> </second> </item> <item> <first>274</first> <second> <first>2</first> <second>2</second> </second> </item> <item> <first>277</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>286</first> <second> <first>0</first> <second>2</second> </second> </item> <item> <first>288</first> <second> <first>2</first> <second>2</second> </second> </item> <item> <first>290</first> <second> <first>2</first> <second>2</second> </second> </item> </bblk_ent_exit> <regions class_id="41" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="42" tracking_level="1" version="0" object_id="_2245"> <region_name>response_r</region_name> <basic_blocks> <count>52</count> <item_version>0</item_version> <item>24</item> <item>29</item> <item>32</item> <item>35</item> <item>38</item> <item>41</item> <item>44</item> <item>47</item> <item>51</item> <item>53</item> <item>62</item> <item>64</item> <item>67</item> <item>70</item> <item>73</item> <item>106</item> <item>108</item> <item>121</item> <item>124</item> <item>127</item> <item>129</item> <item>132</item> <item>137</item> <item>140</item> <item>147</item> <item>152</item> <item>159</item> <item>164</item> <item>167</item> <item>174</item> <item>177</item> <item>180</item> <item>182</item> <item>185</item> <item>188</item> <item>192</item> <item>196</item> <item>204</item> <item>214</item> <item>220</item> <item>231</item> <item>251</item> <item>255</item> <item>258</item> <item>265</item> <item>269</item> <item>272</item> <item>274</item> <item>277</item> <item>286</item> <item>288</item> <item>290</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="43" tracking_level="0" version="0"> <count>146</count> <item_version>0</item_version> <item class_id="44" tracking_level="0" version="0"> <first>256</first> <second> <count>3</count> <item_version>0</item_version> <item>68</item> <item>138</item> <item>221</item> </second> </item> <item> <first>264</first> <second> <count>3</count> <item_version>0</item_version> <item>110</item> <item>142</item> <item>252</item> </second> </item> <item> <first>270</first> <second> <count>1</count> <item_version>0</item_version> <item>275</item> </second> </item> <item> <first>278</first> <second> <count>1</count> <item_version>0</item_version> <item>278</item> </second> </item> <item> <first>284</first> <second> <count>16</count> <item_version>0</item_version> <item>49</item> <item>49</item> <item>60</item> <item>60</item> <item>104</item> <item>104</item> <item>135</item> <item>135</item> <item>162</item> <item>162</item> <item>190</item> <item>190</item> <item>218</item> <item>218</item> <item>263</item> <item>263</item> </second> </item> <item> <first>312</first> <second> <count>1</count> <item_version>0</item_version> <item>133</item> </second> </item> <item> <first>327</first> <second> <count>1</count> <item_version>0</item_version> <item>134</item> </second> </item> <item> <first>342</first> <second> <count>1</count> <item_version>0</item_version> <item>160</item> </second> </item> <item> <first>357</first> <second> <count>1</count> <item_version>0</item_version> <item>161</item> </second> </item> <item> <first>372</first> <second> <count>1</count> <item_version>0</item_version> <item>189</item> </second> </item> <item> <first>388</first> <second> <count>1</count> <item_version>0</item_version> <item>215</item> </second> </item> <item> <first>398</first> <second> <count>1</count> <item_version>0</item_version> <item>259</item> </second> </item> <item> <first>408</first> <second> <count>1</count> <item_version>0</item_version> <item>260</item> </second> </item> <item> <first>419</first> <second> <count>1</count> <item_version>0</item_version> <item>266</item> </second> </item> <item> <first>453</first> <second> <count>1</count> <item_version>0</item_version> <item>267</item> </second> </item> <item> <first>480</first> <second> <count>6</count> <item_version>0</item_version> <item>48</item> <item>59</item> <item>103</item> <item>130</item> <item>153</item> <item>183</item> </second> </item> <item> <first>486</first> <second> <count>2</count> <item_version>0</item_version> <item>58</item> <item>102</item> </second> </item> <item> <first>492</first> <second> <count>2</count> <item_version>0</item_version> <item>71</item> <item>145</item> </second> </item> <item> <first>497</first> <second> <count>1</count> <item_version>0</item_version> <item>165</item> </second> </item> <item> <first>502</first> <second> <count>2</count> <item_version>0</item_version> <item>200</item> <item>226</item> </second> </item> <item> <first>507</first> <second> <count>2</count> <item_version>0</item_version> <item>169</item> <item>198</item> </second> </item> <item> <first>512</first> <second> <count>3</count> <item_version>0</item_version> <item>175</item> <item>197</item> <item>222</item> </second> </item> <item> <first>517</first> <second> <count>2</count> <item_version>0</item_version> <item>54</item> <item>109</item> </second> </item> <item> <first>533</first> <second> <count>1</count> <item_version>0</item_version> <item>18</item> </second> </item> <item> <first>537</first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> <item> <first>541</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>547</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>553</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>559</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>565</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>570</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>576</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>582</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>588</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> <item> <first>594</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>600</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>606</first> <second> <count>1</count> <item_version>0</item_version> <item>65</item> </second> </item> <item> <first>612</first> <second> <count>1</count> <item_version>0</item_version> <item>111</item> </second> </item> <item> <first>616</first> <second> <count>1</count> <item_version>0</item_version> <item>113</item> </second> </item> <item> <first>620</first> <second> <count>1</count> <item_version>0</item_version> <item>114</item> </second> </item> <item> <first>1138</first> <second> <count>1</count> <item_version>0</item_version> <item>115</item> </second> </item> <item> <first>1144</first> <second> <count>1</count> <item_version>0</item_version> <item>116</item> </second> </item> <item> <first>1150</first> <second> <count>1</count> <item_version>0</item_version> <item>117</item> </second> </item> <item> <first>1158</first> <second> <count>1</count> <item_version>0</item_version> <item>118</item> </second> </item> <item> <first>1164</first> <second> <count>1</count> <item_version>0</item_version> <item>119</item> </second> </item> <item> <first>1170</first> <second> <count>1</count> <item_version>0</item_version> <item>122</item> </second> </item> <item> <first>1176</first> <second> <count>1</count> <item_version>0</item_version> <item>125</item> </second> </item> <item> <first>1182</first> <second> <count>1</count> <item_version>0</item_version> <item>143</item> </second> </item> <item> <first>1186</first> <second> <count>1</count> <item_version>0</item_version> <item>148</item> </second> </item> <item> <first>1192</first> <second> <count>1</count> <item_version>0</item_version> <item>149</item> </second> </item> <item> <first>1198</first> <second> <count>1</count> <item_version>0</item_version> <item>150</item> </second> </item> <item> <first>1204</first> <second> <count>1</count> <item_version>0</item_version> <item>154</item> </second> </item> <item> <first>1208</first> <second> <count>1</count> <item_version>0</item_version> <item>155</item> </second> </item> <item> <first>1214</first> <second> <count>1</count> <item_version>0</item_version> <item>156</item> </second> </item> <item> <first>1218</first> <second> <count>1</count> <item_version>0</item_version> <item>157</item> </second> </item> <item> <first>1736</first> <second> <count>1</count> <item_version>0</item_version> <item>168</item> </second> </item> <item> <first>1742</first> <second> <count>1</count> <item_version>0</item_version> <item>170</item> </second> </item> <item> <first>1748</first> <second> <count>1</count> <item_version>0</item_version> <item>171</item> </second> </item> <item> <first>1754</first> <second> <count>1</count> <item_version>0</item_version> <item>172</item> </second> </item> <item> <first>1760</first> <second> <count>1</count> <item_version>0</item_version> <item>178</item> </second> </item> <item> <first>1766</first> <second> <count>1</count> <item_version>0</item_version> <item>186</item> </second> </item> <item> <first>1772</first> <second> <count>1</count> <item_version>0</item_version> <item>193</item> </second> </item> <item> <first>1778</first> <second> <count>1</count> <item_version>0</item_version> <item>194</item> </second> </item> <item> <first>1784</first> <second> <count>1</count> <item_version>0</item_version> <item>199</item> </second> </item> <item> <first>1790</first> <second> <count>1</count> <item_version>0</item_version> <item>201</item> </second> </item> <item> <first>1796</first> <second> <count>1</count> <item_version>0</item_version> <item>202</item> </second> </item> <item> <first>1804</first> <second> <count>1</count> <item_version>0</item_version> <item>205</item> </second> </item> <item> <first>1808</first> <second> <count>1</count> <item_version>0</item_version> <item>206</item> </second> </item> <item> <first>1814</first> <second> <count>1</count> <item_version>0</item_version> <item>207</item> </second> </item> <item> <first>1820</first> <second> <count>1</count> <item_version>0</item_version> <item>208</item> </second> </item> <item> <first>1830</first> <second> <count>1</count> <item_version>0</item_version> <item>209</item> </second> </item> <item> <first>1840</first> <second> <count>1</count> <item_version>0</item_version> <item>210</item> </second> </item> <item> <first>1850</first> <second> <count>1</count> <item_version>0</item_version> <item>211</item> </second> </item> <item> <first>1854</first> <second> <count>1</count> <item_version>0</item_version> <item>212</item> </second> </item> <item> <first>1866</first> <second> <count>1</count> <item_version>0</item_version> <item>217</item> </second> </item> <item> <first>1872</first> <second> <count>1</count> <item_version>0</item_version> <item>223</item> </second> </item> <item> <first>1878</first> <second> <count>1</count> <item_version>0</item_version> <item>224</item> </second> </item> <item> <first>1884</first> <second> <count>1</count> <item_version>0</item_version> <item>225</item> </second> </item> <item> <first>1890</first> <second> <count>1</count> <item_version>0</item_version> <item>227</item> </second> </item> <item> <first>1896</first> <second> <count>1</count> <item_version>0</item_version> <item>228</item> </second> </item> <item> <first>1902</first> <second> <count>1</count> <item_version>0</item_version> <item>229</item> </second> </item> <item> <first>1908</first> <second> <count>1</count> <item_version>0</item_version> <item>232</item> </second> </item> <item> <first>1912</first> <second> <count>1</count> <item_version>0</item_version> <item>233</item> </second> </item> <item> <first>1922</first> <second> <count>1</count> <item_version>0</item_version> <item>234</item> </second> </item> <item> <first>1932</first> <second> <count>1</count> <item_version>0</item_version> <item>235</item> </second> </item> <item> <first>1938</first> <second> <count>1</count> <item_version>0</item_version> <item>236</item> </second> </item> <item> <first>1944</first> <second> <count>1</count> <item_version>0</item_version> <item>237</item> </second> </item> <item> <first>1950</first> <second> <count>1</count> <item_version>0</item_version> <item>238</item> </second> </item> <item> <first>1956</first> <second> <count>1</count> <item_version>0</item_version> <item>239</item> </second> </item> <item> <first>1966</first> <second> <count>1</count> <item_version>0</item_version> <item>240</item> </second> </item> <item> <first>1976</first> <second> <count>1</count> <item_version>0</item_version> <item>243</item> </second> </item> <item> <first>1982</first> <second> <count>1</count> <item_version>0</item_version> <item>244</item> </second> </item> <item> <first>1988</first> <second> <count>1</count> <item_version>0</item_version> <item>246</item> </second> </item> <item> <first>1998</first> <second> <count>1</count> <item_version>0</item_version> <item>248</item> </second> </item> <item> <first>2004</first> <second> <count>1</count> <item_version>0</item_version> <item>249</item> </second> </item> <item> <first>2010</first> <second> <count>1</count> <item_version>0</item_version> <item>253</item> </second> </item> <item> <first>2016</first> <second> <count>1</count> <item_version>0</item_version> <item>256</item> </second> </item> <item> <first>2024</first> <second> <count>1</count> <item_version>0</item_version> <item>262</item> </second> </item> <item> <first>2030</first> <second> <count>1</count> <item_version>0</item_version> <item>279</item> </second> </item> <item> <first>2036</first> <second> <count>1</count> <item_version>0</item_version> <item>280</item> </second> </item> <item> <first>2046</first> <second> <count>1</count> <item_version>0</item_version> <item>281</item> </second> </item> <item> <first>2052</first> <second> <count>1</count> <item_version>0</item_version> <item>282</item> </second> </item> <item> <first>2062</first> <second> <count>1</count> <item_version>0</item_version> <item>283</item> </second> </item> <item> <first>2068</first> <second> <count>1</count> <item_version>0</item_version> <item>284</item> </second> </item> <item> <first>2074</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> <item> <first>2079</first> <second> <count>1</count> <item_version>0</item_version> <item>55</item> </second> </item> <item> <first>2084</first> <second> <count>1</count> <item_version>0</item_version> <item>56</item> </second> </item> <item> <first>2087</first> <second> <count>1</count> <item_version>0</item_version> <item>57</item> </second> </item> <item> <first>2606</first> <second> <count>1</count> <item_version>0</item_version> <item>74</item> </second> </item> <item> <first>2609</first> <second> <count>1</count> <item_version>0</item_version> <item>75</item> </second> </item> <item> <first>2617</first> <second> <count>1</count> <item_version>0</item_version> <item>76</item> </second> </item> <item> <first>2623</first> <second> <count>1</count> <item_version>0</item_version> <item>77</item> </second> </item> <item> <first>2629</first> <second> <count>1</count> <item_version>0</item_version> <item>78</item> </second> </item> <item> <first>2637</first> <second> <count>1</count> <item_version>0</item_version> <item>79</item> </second> </item> <item> <first>2643</first> <second> <count>1</count> <item_version>0</item_version> <item>80</item> </second> </item> <item> <first>2647</first> <second> <count>1</count> <item_version>0</item_version> <item>81</item> </second> </item> <item> <first>2657</first> <second> <count>1</count> <item_version>0</item_version> <item>82</item> </second> </item> <item> <first>2663</first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>2669</first> <second> <count>1</count> <item_version>0</item_version> <item>84</item> </second> </item> <item> <first>2677</first> <second> <count>1</count> <item_version>0</item_version> <item>85</item> </second> </item> <item> <first>2685</first> <second> <count>1</count> <item_version>0</item_version> <item>86</item> </second> </item> <item> <first>2691</first> <second> <count>1</count> <item_version>0</item_version> <item>87</item> </second> </item> <item> <first>2695</first> <second> <count>1</count> <item_version>0</item_version> <item>88</item> </second> </item> <item> <first>2705</first> <second> <count>1</count> <item_version>0</item_version> <item>89</item> </second> </item> <item> <first>2709</first> <second> <count>1</count> <item_version>0</item_version> <item>90</item> </second> </item> <item> <first>2719</first> <second> <count>1</count> <item_version>0</item_version> <item>91</item> </second> </item> <item> <first>2723</first> <second> <count>1</count> <item_version>0</item_version> <item>92</item> </second> </item> <item> <first>2731</first> <second> <count>1</count> <item_version>0</item_version> <item>93</item> </second> </item> <item> <first>2737</first> <second> <count>1</count> <item_version>0</item_version> <item>94</item> </second> </item> <item> <first>2743</first> <second> <count>1</count> <item_version>0</item_version> <item>95</item> </second> </item> <item> <first>2747</first> <second> <count>1</count> <item_version>0</item_version> <item>96</item> </second> </item> <item> <first>2753</first> <second> <count>1</count> <item_version>0</item_version> <item>97</item> </second> </item> <item> <first>2757</first> <second> <count>1</count> <item_version>0</item_version> <item>98</item> </second> </item> <item> <first>2763</first> <second> <count>1</count> <item_version>0</item_version> <item>99</item> </second> </item> <item> <first>2770</first> <second> <count>1</count> <item_version>0</item_version> <item>100</item> </second> </item> <item> <first>2773</first> <second> <count>1</count> <item_version>0</item_version> <item>101</item> </second> </item> <item> <first>3292</first> <second> <count>1</count> <item_version>0</item_version> <item>112</item> </second> </item> <item> <first>3300</first> <second> <count>1</count> <item_version>0</item_version> <item>141</item> </second> </item> <item> <first>3304</first> <second> <count>1</count> <item_version>0</item_version> <item>144</item> </second> </item> <item> <first>3312</first> <second> <count>1</count> <item_version>0</item_version> <item>216</item> </second> </item> <item> <first>3317</first> <second> <count>1</count> <item_version>0</item_version> <item>241</item> </second> </item> <item> <first>3326</first> <second> <count>1</count> <item_version>0</item_version> <item>242</item> </second> </item> <item> <first>3335</first> <second> <count>1</count> <item_version>0</item_version> <item>245</item> </second> </item> <item> <first>3342</first> <second> <count>1</count> <item_version>0</item_version> <item>247</item> </second> </item> <item> <first>3354</first> <second> <count>1</count> <item_version>0</item_version> <item>261</item> </second> </item> <item> <first>3362</first> <second> <count>1</count> <item_version>0</item_version> <item>270</item> </second> </item> </dp_fu_nodes> <dp_fu_nodes_expression class_id="46" tracking_level="0" version="0"> <count>116</count> <item_version>0</item_version> <item class_id="47" tracking_level="0" version="0"> <first>Hi_assign_2_fu_2623</first> <second> <count>1</count> <item_version>0</item_version> <item>77</item> </second> </item> <item> <first>Hi_assign_fu_2617</first> <second> <count>1</count> <item_version>0</item_version> <item>76</item> </second> </item> <item> <first>br_valueLengthTemp_V_fu_2010</first> <second> <count>1</count> <item_version>0</item_version> <item>253</item> </second> </item> <item> <first>grp_fu_492</first> <second> <count>2</count> <item_version>0</item_version> <item>71</item> <item>145</item> </second> </item> <item> <first>grp_fu_502</first> <second> <count>2</count> <item_version>0</item_version> <item>200</item> <item>226</item> </second> </item> <item> <first>grp_fu_507</first> <second> <count>2</count> <item_version>0</item_version> <item>169</item> <item>198</item> </second> </item> <item> <first>grp_fu_512</first> <second> <count>3</count> <item_version>0</item_version> <item>175</item> <item>197</item> <item>222</item> </second> </item> <item> <first>grp_fu_517</first> <second> <count>2</count> <item_version>0</item_version> <item>54</item> <item>109</item> </second> </item> <item> <first>lengthValue_assign_fu_1208</first> <second> <count>1</count> <item_version>0</item_version> <item>155</item> </second> </item> <item> <first>or_cond1_i_fu_1890</first> <second> <count>1</count> <item_version>0</item_version> <item>227</item> </second> </item> <item> <first>or_cond2_i_fu_1902</first> <second> <count>1</count> <item_version>0</item_version> <item>229</item> </second> </item> <item> <first>or_cond3_i_fu_1784</first> <second> <count>1</count> <item_version>0</item_version> <item>199</item> </second> </item> <item> <first>or_cond4_i_fu_1790</first> <second> <count>1</count> <item_version>0</item_version> <item>201</item> </second> </item> <item> <first>or_cond5_i_fu_2004</first> <second> <count>1</count> <item_version>0</item_version> <item>249</item> </second> </item> <item> <first>or_cond913_not_i_fu_1884</first> <second> <count>1</count> <item_version>0</item_version> <item>225</item> </second> </item> <item> <first>or_cond915_not_i_fu_1896</first> <second> <count>1</count> <item_version>0</item_version> <item>228</item> </second> </item> <item> <first>p_0492_1_i_phi_fu_408</first> <second> <count>1</count> <item_version>0</item_version> <item>260</item> </second> </item> <item> <first>p_1_cast_i_cast_cast_fu_1796</first> <second> <count>1</count> <item_version>0</item_version> <item>202</item> </second> </item> <item> <first>p_Result_10_fu_2079</first> <second> <count>1</count> <item_version>0</item_version> <item>55</item> </second> </item> <item> <first>p_Result_1_i_fu_1956</first> <second> <count>1</count> <item_version>0</item_version> <item>239</item> </second> </item> <item> <first>p_Result_2_i_fu_1966</first> <second> <count>1</count> <item_version>0</item_version> <item>240</item> </second> </item> <item> <first>p_Result_3_fu_3326</first> <second> <count>1</count> <item_version>0</item_version> <item>242</item> </second> </item> <item> <first>p_Result_3_i_fu_2052</first> <second> <count>1</count> <item_version>0</item_version> <item>282</item> </second> </item> <item> <first>p_Result_4_fu_3342</first> <second> <count>1</count> <item_version>0</item_version> <item>247</item> </second> </item> <item> <first>p_Result_56_i_i_fu_1840</first> <second> <count>1</count> <item_version>0</item_version> <item>210</item> </second> </item> <item> <first>p_Result_5_fu_3354</first> <second> <count>1</count> <item_version>0</item_version> <item>261</item> </second> </item> <item> <first>p_Result_6_fu_3304</first> <second> <count>1</count> <item_version>0</item_version> <item>144</item> </second> </item> <item> <first>p_Result_7_fu_3292</first> <second> <count>1</count> <item_version>0</item_version> <item>112</item> </second> </item> <item> <first>p_Result_8_fu_2737</first> <second> <count>1</count> <item_version>0</item_version> <item>94</item> </second> </item> <item> <first>p_Result_8_i_fu_1988</first> <second> <count>1</count> <item_version>0</item_version> <item>246</item> </second> </item> <item> <first>p_Result_9_fu_2763</first> <second> <count>1</count> <item_version>0</item_version> <item>99</item> </second> </item> <item> <first>p_Result_i_83_fu_1912</first> <second> <count>1</count> <item_version>0</item_version> <item>233</item> </second> </item> <item> <first>p_Result_i_fu_2036</first> <second> <count>1</count> <item_version>0</item_version> <item>280</item> </second> </item> <item> <first>p_Result_i_i_84_fu_1830</first> <second> <count>1</count> <item_version>0</item_version> <item>209</item> </second> </item> <item> <first>p_Result_i_i_fu_1820</first> <second> <count>1</count> <item_version>0</item_version> <item>208</item> </second> </item> <item> <first>p_Result_s_fu_3317</first> <second> <count>1</count> <item_version>0</item_version> <item>241</item> </second> </item> <item> <first>p_Val2_4_fu_1808</first> <second> <count>1</count> <item_version>0</item_version> <item>206</item> </second> </item> <item> <first>p_cast_i_cast_cast_fu_2016</first> <second> <count>1</count> <item_version>0</item_version> <item>256</item> </second> </item> <item> <first>p_not_i_fu_1872</first> <second> <count>1</count> <item_version>0</item_version> <item>223</item> </second> </item> <item> <first>rev_fu_2637</first> <second> <count>1</count> <item_version>0</item_version> <item>79</item> </second> </item> <item> <first>sf_fu_2709</first> <second> <count>1</count> <item_version>0</item_version> <item>90</item> </second> </item> <item> <first>st_fu_2695</first> <second> <count>1</count> <item_version>0</item_version> <item>88</item> </second> </item> <item> <first>tempKeep_V_fu_620</first> <second> <count>1</count> <item_version>0</item_version> <item>114</item> </second> </item> <item> <first>tempOutput_data_V_fu_3335</first> <second> <count>1</count> <item_version>0</item_version> <item>245</item> </second> </item> <item> <first>tempOutput_keep_V_4_fu_2773</first> <second> <count>1</count> <item_version>0</item_version> <item>101</item> </second> </item> <item> <first>tempOutput_keep_V_5_fu_2087</first> <second> <count>1</count> <item_version>0</item_version> <item>57</item> </second> </item> <item> <first>tempOutput_keep_V_fu_1218</first> <second> <count>1</count> <item_version>0</item_version> <item>157</item> </second> </item> <item> <first>tempVar_V_fu_1922</first> <second> <count>1</count> <item_version>0</item_version> <item>234</item> </second> </item> <item> <first>tmp1_fu_1878</first> <second> <count>1</count> <item_version>0</item_version> <item>224</item> </second> </item> <item> <first>tmp_18_i_fu_570</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>tmp_19_i_fu_1932</first> <second> <count>1</count> <item_version>0</item_version> <item>235</item> </second> </item> <item> <first>tmp_20_i_fu_1944</first> <second> <count>1</count> <item_version>0</item_version> <item>237</item> </second> </item> <item> <first>tmp_22_i_fu_1772</first> <second> <count>1</count> <item_version>0</item_version> <item>193</item> </second> </item> <item> <first>tmp_23_i_fu_1778</first> <second> <count>1</count> <item_version>0</item_version> <item>194</item> </second> </item> <item> <first>tmp_24_i_fu_576</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>tmp_28_i_fu_497</first> <second> <count>1</count> <item_version>0</item_version> <item>165</item> </second> </item> <item> <first>tmp_29_i_fu_582</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>tmp_30_i_fu_1998</first> <second> <count>1</count> <item_version>0</item_version> <item>248</item> </second> </item> <item> <first>tmp_31_i_fu_588</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> <item> <first>tmp_34_i_fu_606</first> <second> <count>1</count> <item_version>0</item_version> <item>65</item> </second> </item> <item> <first>tmp_35_i_fu_594</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>tmp_37_cast_i_fu_1214</first> <second> <count>1</count> <item_version>0</item_version> <item>156</item> </second> </item> <item> <first>tmp_38_i_fu_1192</first> <second> <count>1</count> <item_version>0</item_version> <item>149</item> </second> </item> <item> <first>tmp_41_i_fu_600</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>tmp_43_i_fu_1138</first> <second> <count>1</count> <item_version>0</item_version> <item>115</item> </second> </item> <item> <first>tmp_44_i_fu_1144</first> <second> <count>1</count> <item_version>0</item_version> <item>116</item> </second> </item> <item> <first>tmp_45_i_fu_1150</first> <second> <count>1</count> <item_version>0</item_version> <item>117</item> </second> </item> <item> <first>tmp_46_i_fu_1164</first> <second> <count>1</count> <item_version>0</item_version> <item>119</item> </second> </item> <item> <first>tmp_48_i_fu_2609</first> <second> <count>1</count> <item_version>0</item_version> <item>75</item> </second> </item> <item> <first>tmp_50_i_fu_1170</first> <second> <count>1</count> <item_version>0</item_version> <item>122</item> </second> </item> <item> <first>tmp_58_fu_537</first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> <item> <first>tmp_59_fu_1850</first> <second> <count>1</count> <item_version>0</item_version> <item>211</item> </second> </item> <item> <first>tmp_60_fu_1736</first> <second> <count>1</count> <item_version>0</item_version> <item>168</item> </second> </item> <item> <first>tmp_62_fu_1742</first> <second> <count>1</count> <item_version>0</item_version> <item>170</item> </second> </item> <item> <first>tmp_63_fu_1748</first> <second> <count>1</count> <item_version>0</item_version> <item>171</item> </second> </item> <item> <first>tmp_64_fu_1754</first> <second> <count>1</count> <item_version>0</item_version> <item>172</item> </second> </item> <item> <first>tmp_65_fu_3300</first> <second> <count>1</count> <item_version>0</item_version> <item>141</item> </second> </item> <item> <first>tmp_66_fu_1182</first> <second> <count>1</count> <item_version>0</item_version> <item>143</item> </second> </item> <item> <first>tmp_67_fu_1204</first> <second> <count>1</count> <item_version>0</item_version> <item>154</item> </second> </item> <item> <first>tmp_68_fu_2084</first> <second> <count>1</count> <item_version>0</item_version> <item>56</item> </second> </item> <item> <first>tmp_69_fu_612</first> <second> <count>1</count> <item_version>0</item_version> <item>111</item> </second> </item> <item> <first>tmp_70_fu_616</first> <second> <count>1</count> <item_version>0</item_version> <item>113</item> </second> </item> <item> <first>tmp_71_fu_2606</first> <second> <count>1</count> <item_version>0</item_version> <item>74</item> </second> </item> <item> <first>tmp_72_fu_2629</first> <second> <count>1</count> <item_version>0</item_version> <item>78</item> </second> </item> <item> <first>tmp_73_fu_2643</first> <second> <count>1</count> <item_version>0</item_version> <item>80</item> </second> </item> <item> <first>tmp_74_fu_2647</first> <second> <count>1</count> <item_version>0</item_version> <item>81</item> </second> </item> <item> <first>tmp_75_fu_2657</first> <second> <count>1</count> <item_version>0</item_version> <item>82</item> </second> </item> <item> <first>tmp_76_fu_2663</first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>tmp_77_fu_2669</first> <second> <count>1</count> <item_version>0</item_version> <item>84</item> </second> </item> <item> <first>tmp_78_fu_2677</first> <second> <count>1</count> <item_version>0</item_version> <item>85</item> </second> </item> <item> <first>tmp_79_fu_2685</first> <second> <count>1</count> <item_version>0</item_version> <item>86</item> </second> </item> <item> <first>tmp_7_fu_1976</first> <second> <count>1</count> <item_version>0</item_version> <item>243</item> </second> </item> <item> <first>tmp_80_fu_2691</first> <second> <count>1</count> <item_version>0</item_version> <item>87</item> </second> </item> <item> <first>tmp_81_fu_2705</first> <second> <count>1</count> <item_version>0</item_version> <item>89</item> </second> </item> <item> <first>tmp_82_fu_2719</first> <second> <count>1</count> <item_version>0</item_version> <item>91</item> </second> </item> <item> <first>tmp_83_fu_2723</first> <second> <count>1</count> <item_version>0</item_version> <item>92</item> </second> </item> <item> <first>tmp_84_fu_2731</first> <second> <count>1</count> <item_version>0</item_version> <item>93</item> </second> </item> <item> <first>tmp_86_fu_2743</first> <second> <count>1</count> <item_version>0</item_version> <item>95</item> </second> </item> <item> <first>tmp_87_fu_2747</first> <second> <count>1</count> <item_version>0</item_version> <item>96</item> </second> </item> <item> <first>tmp_88_fu_2753</first> <second> <count>1</count> <item_version>0</item_version> <item>97</item> </second> </item> <item> <first>tmp_89_fu_2757</first> <second> <count>1</count> <item_version>0</item_version> <item>98</item> </second> </item> <item> <first>tmp_8_fu_1982</first> <second> <count>1</count> <item_version>0</item_version> <item>244</item> </second> </item> <item> <first>tmp_91_fu_2770</first> <second> <count>1</count> <item_version>0</item_version> <item>100</item> </second> </item> <item> <first>tmp_data_V_1_phi_fu_388</first> <second> <count>1</count> <item_version>0</item_version> <item>215</item> </second> </item> <item> <first>tmp_data_V_2_fu_3312</first> <second> <count>1</count> <item_version>0</item_version> <item>216</item> </second> </item> <item> <first>tmp_i_82_fu_559</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>tmp_i_fu_541</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>tmp_i_i_fu_1854</first> <second> <count>1</count> <item_version>0</item_version> <item>212</item> </second> </item> <item> <first>tmp_keep_V_1_phi_fu_357</first> <second> <count>1</count> <item_version>0</item_version> <item>161</item> </second> </item> <item> <first>tmp_keep_V_3_phi_fu_327</first> <second> <count>1</count> <item_version>0</item_version> <item>134</item> </second> </item> <item> <first>tmp_last_V_1_phi_fu_342</first> <second> <count>1</count> <item_version>0</item_version> <item>160</item> </second> </item> <item> <first>tmp_last_V_2_phi_fu_312</first> <second> <count>1</count> <item_version>0</item_version> <item>133</item> </second> </item> <item> <first>tmp_last_V_phi_fu_372</first> <second> <count>1</count> <item_version>0</item_version> <item>189</item> </second> </item> <item> <first>xtrasBuffer_V_flag_8_phi_fu_419</first> <second> <count>1</count> <item_version>0</item_version> <item>266</item> </second> </item> <item> <first>xtrasBuffer_V_new_8_s_phi_fu_453</first> <second> <count>1</count> <item_version>0</item_version> <item>267</item> </second> </item> <item> <first>xtrasBuffer_V_new_i_phi_fu_398</first> <second> <count>1</count> <item_version>0</item_version> <item>259</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>30</count> <item_version>0</item_version> <item> <first>StgValue_100_store_fu_1814</first> <second> <count>1</count> <item_version>0</item_version> <item>207</item> </second> </item> <item> <first>StgValue_107_store_fu_1866</first> <second> <count>1</count> <item_version>0</item_version> <item>217</item> </second> </item> <item> <first>StgValue_123_store_fu_1938</first> <second> <count>1</count> <item_version>0</item_version> <item>236</item> </second> </item> <item> <first>StgValue_125_store_fu_1950</first> <second> <count>1</count> <item_version>0</item_version> <item>238</item> </second> </item> <item> <first>StgValue_139_store_fu_2024</first> <second> <count>1</count> <item_version>0</item_version> <item>262</item> </second> </item> <item> <first>StgValue_143_store_fu_2030</first> <second> <count>1</count> <item_version>0</item_version> <item>279</item> </second> </item> <item> <first>StgValue_145_store_fu_2046</first> <second> <count>1</count> <item_version>0</item_version> <item>281</item> </second> </item> <item> <first>StgValue_147_store_fu_2062</first> <second> <count>1</count> <item_version>0</item_version> <item>283</item> </second> </item> <item> <first>StgValue_148_store_fu_2068</first> <second> <count>1</count> <item_version>0</item_version> <item>284</item> </second> </item> <item> <first>StgValue_213_store_fu_3362</first> <second> <count>1</count> <item_version>0</item_version> <item>270</item> </second> </item> <item> <first>StgValue_44_store_fu_1158</first> <second> <count>1</count> <item_version>0</item_version> <item>118</item> </second> </item> <item> <first>StgValue_49_store_fu_1176</first> <second> <count>1</count> <item_version>0</item_version> <item>125</item> </second> </item> <item> <first>StgValue_60_store_fu_1186</first> <second> <count>1</count> <item_version>0</item_version> <item>148</item> </second> </item> <item> <first>StgValue_62_store_fu_1198</first> <second> <count>1</count> <item_version>0</item_version> <item>150</item> </second> </item> <item> <first>StgValue_81_store_fu_1760</first> <second> <count>1</count> <item_version>0</item_version> <item>178</item> </second> </item> <item> <first>StgValue_85_store_fu_1766</first> <second> <count>1</count> <item_version>0</item_version> <item>186</item> </second> </item> <item> <first>br_outWordCounter_lo_load_fu_533</first> <second> <count>1</count> <item_version>0</item_version> <item>18</item> </second> </item> <item> <first>errorCode_load_load_fu_553</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>grp_nbreadreq_fu_256</first> <second> <count>3</count> <item_version>0</item_version> <item>68</item> <item>138</item> <item>221</item> </second> </item> <item> <first>grp_read_fu_264</first> <second> <count>3</count> <item_version>0</item_version> <item>110</item> <item>142</item> <item>252</item> </second> </item> <item> <first>grp_store_fu_480</first> <second> <count>6</count> <item_version>0</item_version> <item>48</item> <item>59</item> <item>103</item> <item>130</item> <item>153</item> <item>183</item> </second> </item> <item> <first>grp_store_fu_486</first> <second> <count>2</count> <item_version>0</item_version> <item>58</item> <item>102</item> </second> </item> <item> <first>grp_write_fu_284</first> <second> <count>16</count> <item_version>0</item_version> <item>49</item> <item>49</item> <item>60</item> <item>60</item> <item>104</item> <item>104</item> <item>135</item> <item>135</item> <item>162</item> <item>162</item> <item>190</item> <item>190</item> <item>218</item> <item>218</item> <item>263</item> <item>263</item> </second> </item> <item> <first>outOpCode_load_load_fu_547</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>p_Val2_1_load_fu_1908</first> <second> <count>1</count> <item_version>0</item_version> <item>232</item> </second> </item> <item> <first>p_Val2_5_load_fu_2074</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> <item> <first>resp_ValueConvertTem_1_load_fu_1804</first> <second> <count>1</count> <item_version>0</item_version> <item>205</item> </second> </item> <item> <first>tmp_V_3_read_fu_278</first> <second> <count>1</count> <item_version>0</item_version> <item>278</item> </second> </item> <item> <first>tmp_nbreadreq_fu_270</first> <second> <count>1</count> <item_version>0</item_version> <item>275</item> </second> </item> <item> <first>valueLength_load_load_fu_565</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> </dp_fu_nodes_io> <return_ports> <count>0</count> <item_version>0</item_version> </return_ports> <dp_mem_port_nodes class_id="48" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_mem_port_nodes> <dp_reg_nodes> <count>52</count> <item_version>0</item_version> <item> <first>306</first> <second> <count>1</count> <item_version>0</item_version> <item>133</item> </second> </item> <item> <first>322</first> <second> <count>1</count> <item_version>0</item_version> <item>134</item> </second> </item> <item> <first>336</first> <second> <count>1</count> <item_version>0</item_version> <item>160</item> </second> </item> <item> <first>352</first> <second> <count>1</count> <item_version>0</item_version> <item>161</item> </second> </item> <item> <first>366</first> <second> <count>1</count> <item_version>0</item_version> <item>189</item> </second> </item> <item> <first>385</first> <second> <count>1</count> <item_version>0</item_version> <item>215</item> </second> </item> <item> <first>394</first> <second> <count>1</count> <item_version>0</item_version> <item>259</item> </second> </item> <item> <first>405</first> <second> <count>1</count> <item_version>0</item_version> <item>260</item> </second> </item> <item> <first>414</first> <second> <count>1</count> <item_version>0</item_version> <item>266</item> </second> </item> <item> <first>449</first> <second> <count>1</count> <item_version>0</item_version> <item>267</item> </second> </item> <item> <first>526</first> <second> <count>3</count> <item_version>0</item_version> <item>110</item> <item>142</item> <item>252</item> </second> </item> <item> <first>3368</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>3372</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>3376</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>3383</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>3387</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>3391</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>3395</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> <item> <first>3399</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>3403</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>3407</first> <second> <count>1</count> <item_version>0</item_version> <item>65</item> </second> </item> <item> <first>3411</first> <second> <count>1</count> <item_version>0</item_version> <item>68</item> </second> </item> <item> <first>3415</first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>3419</first> <second> <count>1</count> <item_version>0</item_version> <item>111</item> </second> </item> <item> <first>3424</first> <second> <count>1</count> <item_version>0</item_version> <item>114</item> </second> </item> <item> <first>3429</first> <second> <count>1</count> <item_version>0</item_version> <item>119</item> </second> </item> <item> <first>3433</first> <second> <count>1</count> <item_version>0</item_version> <item>122</item> </second> </item> <item> <first>3437</first> <second> <count>1</count> <item_version>0</item_version> <item>138</item> </second> </item> <item> <first>3441</first> <second> <count>1</count> <item_version>0</item_version> <item>143</item> </second> </item> <item> <first>3449</first> <second> <count>1</count> <item_version>0</item_version> <item>157</item> </second> </item> <item> <first>3454</first> <second> <count>1</count> <item_version>0</item_version> <item>165</item> </second> </item> <item> <first>3458</first> <second> <count>1</count> <item_version>0</item_version> <item>172</item> </second> </item> <item> <first>3462</first> <second> <count>1</count> <item_version>0</item_version> <item>175</item> </second> </item> <item> <first>3469</first> <second> <count>1</count> <item_version>0</item_version> <item>202</item> </second> </item> <item> <first>3474</first> <second> <count>1</count> <item_version>0</item_version> <item>212</item> </second> </item> <item> <first>3479</first> <second> <count>1</count> <item_version>0</item_version> <item>229</item> </second> </item> <item> <first>3483</first> <second> <count>1</count> <item_version>0</item_version> <item>239</item> </second> </item> <item> <first>3488</first> <second> <count>1</count> <item_version>0</item_version> <item>240</item> </second> </item> <item> <first>3494</first> <second> <count>1</count> <item_version>0</item_version> <item>244</item> </second> </item> <item> <first>3499</first> <second> <count>1</count> <item_version>0</item_version> <item>246</item> </second> </item> <item> <first>3507</first> <second> <count>1</count> <item_version>0</item_version> <item>253</item> </second> </item> <item> <first>3512</first> <second> <count>1</count> <item_version>0</item_version> <item>256</item> </second> </item> <item> <first>3517</first> <second> <count>1</count> <item_version>0</item_version> <item>275</item> </second> </item> <item> <first>3521</first> <second> <count>1</count> <item_version>0</item_version> <item>55</item> </second> </item> <item> <first>3526</first> <second> <count>1</count> <item_version>0</item_version> <item>57</item> </second> </item> <item> <first>3531</first> <second> <count>1</count> <item_version>0</item_version> <item>99</item> </second> </item> <item> <first>3536</first> <second> <count>1</count> <item_version>0</item_version> <item>101</item> </second> </item> <item> <first>3541</first> <second> <count>1</count> <item_version>0</item_version> <item>112</item> </second> </item> <item> <first>3546</first> <second> <count>1</count> <item_version>0</item_version> <item>144</item> </second> </item> <item> <first>3551</first> <second> <count>1</count> <item_version>0</item_version> <item>216</item> </second> </item> <item> <first>3556</first> <second> <count>1</count> <item_version>0</item_version> <item>247</item> </second> </item> <item> <first>3561</first> <second> <count>1</count> <item_version>0</item_version> <item>261</item> </second> </item> </dp_reg_nodes> <dp_regname_nodes> <count>52</count> <item_version>0</item_version> <item> <first>br_valueLengthTemp_V_reg_3507</first> <second> <count>1</count> <item_version>0</item_version> <item>253</item> </second> </item> <item> <first>or_cond2_i_reg_3479</first> <second> <count>1</count> <item_version>0</item_version> <item>229</item> </second> </item> <item> <first>p_0492_1_i_reg_405</first> <second> <count>1</count> <item_version>0</item_version> <item>260</item> </second> </item> <item> <first>p_1_cast_i_cast_cast_reg_3469</first> <second> <count>1</count> <item_version>0</item_version> <item>202</item> </second> </item> <item> <first>p_Result_10_reg_3521</first> <second> <count>1</count> <item_version>0</item_version> <item>55</item> </second> </item> <item> <first>p_Result_1_i_reg_3483</first> <second> <count>1</count> <item_version>0</item_version> <item>239</item> </second> </item> <item> <first>p_Result_2_i_reg_3488</first> <second> <count>1</count> <item_version>0</item_version> <item>240</item> </second> </item> <item> <first>p_Result_4_reg_3556</first> <second> <count>1</count> <item_version>0</item_version> <item>247</item> </second> </item> <item> <first>p_Result_5_reg_3561</first> <second> <count>1</count> <item_version>0</item_version> <item>261</item> </second> </item> <item> <first>p_Result_6_reg_3546</first> <second> <count>1</count> <item_version>0</item_version> <item>144</item> </second> </item> <item> <first>p_Result_7_reg_3541</first> <second> <count>1</count> <item_version>0</item_version> <item>112</item> </second> </item> <item> <first>p_Result_8_i_reg_3499</first> <second> <count>1</count> <item_version>0</item_version> <item>246</item> </second> </item> <item> <first>p_Result_9_reg_3531</first> <second> <count>1</count> <item_version>0</item_version> <item>99</item> </second> </item> <item> <first>p_cast_i_cast_cast_reg_3512</first> <second> <count>1</count> <item_version>0</item_version> <item>256</item> </second> </item> <item> <first>reg_526</first> <second> <count>3</count> <item_version>0</item_version> <item>110</item> <item>142</item> <item>252</item> </second> </item> <item> <first>tempKeep_V_reg_3424</first> <second> <count>1</count> <item_version>0</item_version> <item>114</item> </second> </item> <item> <first>tempOutput_keep_V_4_reg_3536</first> <second> <count>1</count> <item_version>0</item_version> <item>101</item> </second> </item> <item> <first>tempOutput_keep_V_5_reg_3526</first> <second> <count>1</count> <item_version>0</item_version> <item>57</item> </second> </item> <item> <first>tempOutput_keep_V_reg_3449</first> <second> <count>1</count> <item_version>0</item_version> <item>157</item> </second> </item> <item> <first>tmp_18_i_reg_3383</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>tmp_24_i_reg_3387</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>tmp_28_i_reg_3454</first> <second> <count>1</count> <item_version>0</item_version> <item>165</item> </second> </item> <item> <first>tmp_29_i_reg_3391</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>tmp_31_i_reg_3395</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> <item> <first>tmp_32_i_reg_3462</first> <second> <count>1</count> <item_version>0</item_version> <item>175</item> </second> </item> <item> <first>tmp_34_i_reg_3407</first> <second> <count>1</count> <item_version>0</item_version> <item>65</item> </second> </item> <item> <first>tmp_35_i_reg_3399</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>tmp_39_i_reg_3415</first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>tmp_41_i_reg_3403</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>tmp_46_i_reg_3429</first> <second> <count>1</count> <item_version>0</item_version> <item>119</item> </second> </item> <item> <first>tmp_50_i_reg_3433</first> <second> <count>1</count> <item_version>0</item_version> <item>122</item> </second> </item> <item> <first>tmp_5_reg_3437</first> <second> <count>1</count> <item_version>0</item_version> <item>138</item> </second> </item> <item> <first>tmp_64_reg_3458</first> <second> <count>1</count> <item_version>0</item_version> <item>172</item> </second> </item> <item> <first>tmp_66_reg_3441</first> <second> <count>1</count> <item_version>0</item_version> <item>143</item> </second> </item> <item> <first>tmp_69_reg_3419</first> <second> <count>1</count> <item_version>0</item_version> <item>111</item> </second> </item> <item> <first>tmp_6_reg_3411</first> <second> <count>1</count> <item_version>0</item_version> <item>68</item> </second> </item> <item> <first>tmp_8_reg_3494</first> <second> <count>1</count> <item_version>0</item_version> <item>244</item> </second> </item> <item> <first>tmp_data_V_1_reg_385</first> <second> <count>1</count> <item_version>0</item_version> <item>215</item> </second> </item> <item> <first>tmp_data_V_2_reg_3551</first> <second> <count>1</count> <item_version>0</item_version> <item>216</item> </second> </item> <item> <first>tmp_i_82_reg_3372</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>tmp_i_i_reg_3474</first> <second> <count>1</count> <item_version>0</item_version> <item>212</item> </second> </item> <item> <first>tmp_i_reg_3368</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>tmp_keep_V_1_reg_352</first> <second> <count>1</count> <item_version>0</item_version> <item>161</item> </second> </item> <item> <first>tmp_keep_V_3_reg_322</first> <second> <count>1</count> <item_version>0</item_version> <item>134</item> </second> </item> <item> <first>tmp_last_V_1_reg_336</first> <second> <count>1</count> <item_version>0</item_version> <item>160</item> </second> </item> <item> <first>tmp_last_V_2_reg_306</first> <second> <count>1</count> <item_version>0</item_version> <item>133</item> </second> </item> <item> <first>tmp_last_V_reg_366</first> <second> <count>1</count> <item_version>0</item_version> <item>189</item> </second> </item> <item> <first>tmp_reg_3517</first> <second> <count>1</count> <item_version>0</item_version> <item>275</item> </second> </item> <item> <first>valueLength_load_reg_3376</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> <item> <first>xtrasBuffer_V_flag_8_reg_414</first> <second> <count>1</count> <item_version>0</item_version> <item>266</item> </second> </item> <item> <first>xtrasBuffer_V_new_8_s_reg_449</first> <second> <count>1</count> <item_version>0</item_version> <item>267</item> </second> </item> <item> <first>xtrasBuffer_V_new_i_reg_394</first> <second> <count>1</count> <item_version>0</item_version> <item>259</item> </second> </item> </dp_regname_nodes> <dp_reg_phi> <count>10</count> <item_version>0</item_version> <item> <first>306</first> <second> <count>1</count> <item_version>0</item_version> <item>133</item> </second> </item> <item> <first>322</first> <second> <count>1</count> <item_version>0</item_version> <item>134</item> </second> </item> <item> <first>336</first> <second> <count>1</count> <item_version>0</item_version> <item>160</item> </second> </item> <item> <first>352</first> <second> <count>1</count> <item_version>0</item_version> <item>161</item> </second> </item> <item> <first>366</first> <second> <count>1</count> <item_version>0</item_version> <item>189</item> </second> </item> <item> <first>385</first> <second> <count>1</count> <item_version>0</item_version> <item>215</item> </second> </item> <item> <first>394</first> <second> <count>1</count> <item_version>0</item_version> <item>259</item> </second> </item> <item> <first>405</first> <second> <count>1</count> <item_version>0</item_version> <item>260</item> </second> </item> <item> <first>414</first> <second> <count>1</count> <item_version>0</item_version> <item>266</item> </second> </item> <item> <first>449</first> <second> <count>1</count> <item_version>0</item_version> <item>267</item> </second> </item> </dp_reg_phi> <dp_regname_phi> <count>10</count> <item_version>0</item_version> <item> <first>p_0492_1_i_reg_405</first> <second> <count>1</count> <item_version>0</item_version> <item>260</item> </second> </item> <item> <first>tmp_data_V_1_reg_385</first> <second> <count>1</count> <item_version>0</item_version> <item>215</item> </second> </item> <item> <first>tmp_keep_V_1_reg_352</first> <second> <count>1</count> <item_version>0</item_version> <item>161</item> </second> </item> <item> <first>tmp_keep_V_3_reg_322</first> <second> <count>1</count> <item_version>0</item_version> <item>134</item> </second> </item> <item> <first>tmp_last_V_1_reg_336</first> <second> <count>1</count> <item_version>0</item_version> <item>160</item> </second> </item> <item> <first>tmp_last_V_2_reg_306</first> <second> <count>1</count> <item_version>0</item_version> <item>133</item> </second> </item> <item> <first>tmp_last_V_reg_366</first> <second> <count>1</count> <item_version>0</item_version> <item>189</item> </second> </item> <item> <first>xtrasBuffer_V_flag_8_reg_414</first> <second> <count>1</count> <item_version>0</item_version> <item>266</item> </second> </item> <item> <first>xtrasBuffer_V_new_8_s_reg_449</first> <second> <count>1</count> <item_version>0</item_version> <item>267</item> </second> </item> <item> <first>xtrasBuffer_V_new_i_reg_394</first> <second> <count>1</count> <item_version>0</item_version> <item>259</item> </second> </item> </dp_regname_phi> <dp_port_io_nodes class_id="49" tracking_level="0" version="0"> <count>6</count> <item_version>0</item_version> <item class_id="50" tracking_level="0" version="0"> <first>metadataBuffer_rf_V_s</first> <second> <count>2</count> <item_version>0</item_version> <item> <first>nbreadreq</first> <second> <count>1</count> <item_version>0</item_version> <item>275</item> </second> </item> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>278</item> </second> </item> </second> </item> <item> <first>respOutput_V_data_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>8</count> <item_version>0</item_version> <item>263</item> <item>218</item> <item>190</item> <item>162</item> <item>135</item> <item>104</item> <item>60</item> <item>49</item> </second> </item> </second> </item> <item> <first>respOutput_V_keep_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>8</count> <item_version>0</item_version> <item>263</item> <item>218</item> <item>190</item> <item>162</item> <item>135</item> <item>104</item> <item>60</item> <item>49</item> </second> </item> </second> </item> <item> <first>respOutput_V_last_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>8</count> <item_version>0</item_version> <item>263</item> <item>218</item> <item>190</item> <item>162</item> <item>135</item> <item>104</item> <item>60</item> <item>49</item> </second> </item> </second> </item> <item> <first>respOutput_V_user_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>8</count> <item_version>0</item_version> <item>263</item> <item>218</item> <item>190</item> <item>162</item> <item>135</item> <item>104</item> <item>60</item> <item>49</item> </second> </item> </second> </item> <item> <first>valueBuffer_rf_V_V</first> <second> <count>2</count> <item_version>0</item_version> <item> <first>nbreadreq</first> <second> <count>3</count> <item_version>0</item_version> <item>221</item> <item>138</item> <item>68</item> </second> </item> <item> <first>read</first> <second> <count>3</count> <item_version>0</item_version> <item>252</item> <item>142</item> <item>110</item> </second> </item> </second> </item> </dp_port_io_nodes> <port2core class_id="51" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="52" tracking_level="0" version="0"> <first>8</first> <second>FIFO</second> </item> <item> <first>12</first> <second>FIFO</second> </item> </port2core> <node2core> <count>0</count> <item_version>0</item_version> </node2core> </syndb> </boost_serialization>
------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2012, Vadim Godunko <vgodunko@gmail.com> -- -- 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.Internals.Utp_Elements; with AMF.UML.Read_Structural_Feature_Actions; with AMF.Utp.Get_Timezone_Actions; with AMF.Visitors; package AMF.Internals.Utp_Get_Timezone_Actions is type Utp_Get_Timezone_Action_Proxy is limited new AMF.Internals.Utp_Elements.Utp_Element_Proxy and AMF.Utp.Get_Timezone_Actions.Utp_Get_Timezone_Action with null record; overriding function Get_Base_Read_Structural_Feature_Action (Self : not null access constant Utp_Get_Timezone_Action_Proxy) return AMF.UML.Read_Structural_Feature_Actions.UML_Read_Structural_Feature_Action_Access; -- Getter of GetTimezoneAction::base_ReadStructuralFeatureAction. -- overriding procedure Set_Base_Read_Structural_Feature_Action (Self : not null access Utp_Get_Timezone_Action_Proxy; To : AMF.UML.Read_Structural_Feature_Actions.UML_Read_Structural_Feature_Action_Access); -- Setter of GetTimezoneAction::base_ReadStructuralFeatureAction. -- overriding procedure Enter_Element (Self : not null access constant Utp_Get_Timezone_Action_Proxy; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control); overriding procedure Leave_Element (Self : not null access constant Utp_Get_Timezone_Action_Proxy; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control); overriding procedure Visit_Element (Self : not null access constant Utp_Get_Timezone_Action_Proxy; Iterator : in out AMF.Visitors.Abstract_Iterator'Class; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control); end AMF.Internals.Utp_Get_Timezone_Actions;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . T R A C E B A C K _ E N T R I E S -- -- -- -- S p e c -- -- -- -- Copyright (C) 2003-2005 Free Software Foundation, Inc. -- -- -- -- This specification is derived from the Ada Reference Manual for use with -- -- GNAT. The copyright notice above, and the license provisions that follow -- -- apply solely to the contents of the part following the private keyword. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package offers an abstraction of what is stored in traceback arrays -- for call-chain computation purposes. By default, as defined in this -- version of the package, an entry is a mere code location representing the -- address of a call instruction part of the call-chain. package System.Traceback_Entries is pragma Preelaborate; subtype Traceback_Entry is System.Address; -- This subtype defines what each traceback array entry contains Null_TB_Entry : constant Traceback_Entry := System.Null_Address; -- This is the value to be used when initializing an entry function PC_For (TB_Entry : Traceback_Entry) return System.Address; pragma Inline (PC_For); -- Returns the address of the call instruction associated with the -- provided entry. function TB_Entry_For (PC : System.Address) return Traceback_Entry; pragma Inline (TB_Entry_For); -- Returns an entry representing a frame for a call instruction at PC end System.Traceback_Entries;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . A T O M I C _ C O U N T E R S -- -- -- -- 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. -- -- -- ------------------------------------------------------------------------------ -- This package implements Atomic_Counter and Atomic_Unsigned operations -- for platforms where GCC supports __sync_add_and_fetch_4 and -- __sync_sub_and_fetch_4 builtins. package body System.Atomic_Counters is procedure Sync_Add_And_Fetch (Ptr : access Atomic_Unsigned; Value : Atomic_Unsigned); pragma Import (Intrinsic, Sync_Add_And_Fetch, "__sync_add_and_fetch_4"); function Sync_Sub_And_Fetch (Ptr : access Atomic_Unsigned; Value : Atomic_Unsigned) return Atomic_Unsigned; pragma Import (Intrinsic, Sync_Sub_And_Fetch, "__sync_sub_and_fetch_4"); --------------- -- Decrement -- --------------- procedure Decrement (Item : aliased in out Atomic_Unsigned) is begin if Sync_Sub_And_Fetch (Item'Unrestricted_Access, 1) = 0 then null; end if; end Decrement; function Decrement (Item : aliased in out Atomic_Unsigned) return Boolean is begin return Sync_Sub_And_Fetch (Item'Unrestricted_Access, 1) = 0; end Decrement; function Decrement (Item : in out Atomic_Counter) return Boolean is begin -- Note: the use of Unrestricted_Access here is required because we -- are obtaining an access-to-volatile pointer to a non-volatile object. -- This is not allowed for [Unchecked_]Access, but is safe in this case -- because we know that no aliases are being created. return Sync_Sub_And_Fetch (Item.Value'Unrestricted_Access, 1) = 0; end Decrement; --------------- -- Increment -- --------------- procedure Increment (Item : aliased in out Atomic_Unsigned) is begin Sync_Add_And_Fetch (Item'Unrestricted_Access, 1); end Increment; procedure Increment (Item : in out Atomic_Counter) is begin -- Note: the use of Unrestricted_Access here is required because we are -- obtaining an access-to-volatile pointer to a non-volatile object. -- This is not allowed for [Unchecked_]Access, but is safe in this case -- because we know that no aliases are being created. Sync_Add_And_Fetch (Item.Value'Unrestricted_Access, 1); end Increment; ---------------- -- Initialize -- ---------------- procedure Initialize (Item : out Atomic_Counter) is begin Item.Value := 1; end Initialize; ------------ -- Is_One -- ------------ function Is_One (Item : Atomic_Counter) return Boolean is begin return Item.Value = 1; end Is_One; end System.Atomic_Counters;
-- This spec has been automatically generated from STM32WL5x_CM4.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with HAL; with System; package STM32_SVD.MPU is pragma Preelaborate; --------------- -- Registers -- --------------- subtype MPU_TYPER_DREGION_Field is HAL.UInt8; subtype MPU_TYPER_IREGION_Field is HAL.UInt8; -- MPU type register type MPU_TYPER_Register is record -- Read-only. Separate flag SEPARATE_k : Boolean; -- unspecified Reserved_1_7 : HAL.UInt7; -- Read-only. Number of MPU data regions DREGION : MPU_TYPER_DREGION_Field; -- Read-only. Number of MPU instruction regions IREGION : MPU_TYPER_IREGION_Field; -- unspecified Reserved_24_31 : HAL.UInt8; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for MPU_TYPER_Register use record SEPARATE_k at 0 range 0 .. 0; Reserved_1_7 at 0 range 1 .. 7; DREGION at 0 range 8 .. 15; IREGION at 0 range 16 .. 23; Reserved_24_31 at 0 range 24 .. 31; end record; -- MPU control register type MPU_CTRL_Register is record -- Read-only. Enables the MPU ENABLE : Boolean; -- Read-only. Enables the operation of MPU during hard fault HFNMIENA : Boolean; -- Read-only. Enable priviliged software access to default memory map PRIVDEFENA : Boolean; -- unspecified Reserved_3_31 : HAL.UInt29; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for MPU_CTRL_Register use record ENABLE at 0 range 0 .. 0; HFNMIENA at 0 range 1 .. 1; PRIVDEFENA at 0 range 2 .. 2; Reserved_3_31 at 0 range 3 .. 31; end record; subtype MPU_RNR_REGION_Field is HAL.UInt8; -- MPU region number register type MPU_RNR_Register is record -- MPU region REGION : MPU_RNR_REGION_Field := 16#0#; -- unspecified Reserved_8_31 : HAL.UInt24 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for MPU_RNR_Register use record REGION at 0 range 0 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; subtype MPU_RBAR_REGION_Field is HAL.UInt4; subtype MPU_RBAR_ADDR_Field is HAL.UInt27; -- MPU region base address register type MPU_RBAR_Register is record -- MPU region field REGION : MPU_RBAR_REGION_Field := 16#0#; -- MPU region number valid VALID : Boolean := False; -- Region base address field ADDR : MPU_RBAR_ADDR_Field := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for MPU_RBAR_Register use record REGION at 0 range 0 .. 3; VALID at 0 range 4 .. 4; ADDR at 0 range 5 .. 31; end record; subtype MPU_RASR_SIZE_Field is HAL.UInt5; subtype MPU_RASR_SRD_Field is HAL.UInt8; subtype MPU_RASR_TEX_Field is HAL.UInt3; subtype MPU_RASR_AP_Field is HAL.UInt3; -- MPU region attribute and size register type MPU_RASR_Register is record -- Region enable bit. ENABLE : Boolean := False; -- Size of the MPU protection region SIZE : MPU_RASR_SIZE_Field := 16#0#; -- unspecified Reserved_6_7 : HAL.UInt2 := 16#0#; -- Subregion disable bits SRD : MPU_RASR_SRD_Field := 16#0#; -- memory attribute B : Boolean := False; -- memory attribute C : Boolean := False; -- Shareable memory attribute S : Boolean := False; -- memory attribute TEX : MPU_RASR_TEX_Field := 16#0#; -- unspecified Reserved_22_23 : HAL.UInt2 := 16#0#; -- Access permission AP : MPU_RASR_AP_Field := 16#0#; -- unspecified Reserved_27_27 : HAL.Bit := 16#0#; -- Instruction access disable bit XN : Boolean := False; -- unspecified Reserved_29_31 : HAL.UInt3 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for MPU_RASR_Register use record ENABLE at 0 range 0 .. 0; SIZE at 0 range 1 .. 5; Reserved_6_7 at 0 range 6 .. 7; SRD at 0 range 8 .. 15; B at 0 range 16 .. 16; C at 0 range 17 .. 17; S at 0 range 18 .. 18; TEX at 0 range 19 .. 21; Reserved_22_23 at 0 range 22 .. 23; AP at 0 range 24 .. 26; Reserved_27_27 at 0 range 27 .. 27; XN at 0 range 28 .. 28; Reserved_29_31 at 0 range 29 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Memory protection unit type MPU_Peripheral is record -- MPU type register MPU_TYPER : aliased MPU_TYPER_Register; -- MPU control register MPU_CTRL : aliased MPU_CTRL_Register; -- MPU region number register MPU_RNR : aliased MPU_RNR_Register; -- MPU region base address register MPU_RBAR : aliased MPU_RBAR_Register; -- MPU region attribute and size register MPU_RASR : aliased MPU_RASR_Register; end record with Volatile; for MPU_Peripheral use record MPU_TYPER at 16#0# range 0 .. 31; MPU_CTRL at 16#4# range 0 .. 31; MPU_RNR at 16#8# range 0 .. 31; MPU_RBAR at 16#C# range 0 .. 31; MPU_RASR at 16#10# range 0 .. 31; end record; -- Memory protection unit MPU_Periph : aliased MPU_Peripheral with Import, Address => MPU_Base; end STM32_SVD.MPU;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . T E X T _ I O . D E C I M A L _ A U X -- -- -- -- S p e c -- -- -- -- $Revision$ -- -- -- Copyright (C) 1992-1997 Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package contains the routines for Ada.Text_IO.Decimal_IO that are -- shared among separate instantiations of this package. The routines in -- the package are identical semantically to those declared in Text_IO, -- except that default values have been supplied by the generic, and the -- Num parameter has been replaced by Integer or Long_Long_Integer, with -- an additional Scale parameter giving the value of Num'Scale. In addition -- the Get routines return the value rather than store it in an Out parameter. private package Ada.Text_IO.Decimal_Aux is function Get_Dec (File : in File_Type; Width : in Field; Scale : Integer) return Integer; function Get_LLD (File : in File_Type; Width : in Field; Scale : Integer) return Long_Long_Integer; procedure Put_Dec (File : File_Type; Item : Integer; Fore : in Field; Aft : in Field; Exp : in Field; Scale : Integer); procedure Put_LLD (File : in File_Type; Item : in Long_Long_Integer; Fore : in Field; Aft : in Field; Exp : in Field; Scale : Integer); function Gets_Dec (From : in String; Last : access Positive; Scale : Integer) return Integer; function Gets_LLD (From : in String; Last : access Positive; Scale : Integer) return Long_Long_Integer; procedure Puts_Dec (To : out String; Item : in Integer; Aft : in Field; Exp : in Field; Scale : Integer); procedure Puts_LLD (To : out String; Item : in Long_Long_Integer; Aft : in Field; Exp : in Field; Scale : Integer); end Ada.Text_IO.Decimal_Aux;
----------------------------------------------------------------------- -- keystore-repository-data -- Data access and management for the keystore -- Copyright (C) 2019, 2020 Stephane Carrez -- Written by Stephane Carrez (Stephane.Carrez@gmail.com) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Interfaces; with Util.Log.Loggers; with Util.Encoders.SHA256; with Util.Encoders.HMAC.SHA256; with Ada.IO_Exceptions; with Keystore.Logs; with Keystore.Buffers; with Keystore.Marshallers; with Keystore.Repository.Data; package body Keystore.Repository.Workers is use type Interfaces.Unsigned_16; use type Interfaces.Unsigned_32; procedure Check_Raise_Error (Status : in Status_Type) with Inline; Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("Keystore.Repository.Workers"); procedure Check_Raise_Error (Status : in Status_Type) is begin case Status is when DATA_CORRUPTION => raise Keystore.Corrupted; when PENDING | SUCCESS => null; when others => raise Keystore.Invalid_Block; end case; end Check_Raise_Error; procedure Initialize_Queue (Manager : in out Wallet_Repository) is begin Manager.Workers.Sequence := 0; Manager.Workers.Data_Queue.Reset_Sequence; end Initialize_Queue; procedure Queue_Decipher_Work (Manager : in out Wallet_Repository; Work : in Data_Work_Access; Queued : out Boolean) is Status : Status_Type; begin if Manager.Workers.Work_Manager /= null then Manager.Workers.Sequence := Manager.Workers.Sequence + 1; Manager.Workers.Work_Manager.Execute (Work.all'Access); Queued := True; else Work.Do_Decipher_Data; Status := Work.Status; Workers.Put_Work (Manager.Workers.all, Work); Check_Raise_Error (Status); Queued := False; end if; end Queue_Decipher_Work; procedure Queue_Cipher_Work (Manager : in out Wallet_Repository; Work : in Data_Work_Access) is Status : Status_Type; begin if Manager.Workers.Work_Manager /= null then Manager.Workers.Sequence := Manager.Workers.Sequence + 1; Manager.Workers.Work_Manager.Execute (Work.all'Access); else Work.Do_Cipher_Data; Status := Work.Status; Workers.Put_Work (Manager.Workers.all, Work); Check_Raise_Error (Status); end if; end Queue_Cipher_Work; procedure Queue_Delete_Work (Manager : in out Wallet_Repository; Work : in Data_Work_Access) is Status : Status_Type; begin if Manager.Workers.Work_Manager /= null then Manager.Workers.Sequence := Manager.Workers.Sequence + 1; Manager.Workers.Work_Manager.Execute (Work.all'Access); else Work.Do_Delete_Data; Status := Work.Status; Workers.Put_Work (Manager.Workers.all, Work); Check_Raise_Error (Status); end if; end Queue_Delete_Work; procedure Fill (Work : in out Data_Work; Input : in out Util.Streams.Input_Stream'Class; Space : in Buffer_Offset; Data_Size : out Buffers.Buffer_Size) is Pos : Buffer_Offset := Work.Data'First; Limit : constant Buffer_Offset := Pos + Space - 1; Last : Stream_Element_Offset; begin Work.Buffer_Pos := 1; loop Input.Read (Work.Data (Pos .. Limit), Last); -- Reached end of buffer. if Last >= Limit then Work.Last_Pos := Limit; Data_Size := Last; return; end if; -- Reached end of stream. if Last < Pos then if Last >= Work.Data'First then Work.Last_Pos := Last; Data_Size := Last; else Data_Size := 0; end if; return; end if; Pos := Last + 1; end loop; end Fill; procedure Fill (Work : in out Data_Work; Input : in Ada.Streams.Stream_Element_Array; Input_Pos : in Ada.Streams.Stream_Element_Offset; Data_Size : out Buffers.Buffer_Size) is Size : Stream_Element_Offset; begin Size := Input'Last - Input_Pos + 1; if Size > DATA_MAX_SIZE then Size := DATA_MAX_SIZE; end if; Data_Size := Size; Work.Last_Pos := Size; Work.Data (1 .. Size) := Input (Input_Pos .. Input_Pos + Size - 1); end Fill; procedure Put_Work (Worker : in out Wallet_Worker; Work : in Data_Work_Access) is begin Worker.Pool_Count := Worker.Pool_Count + 1; Worker.Work_Pool (Worker.Pool_Count) := Work; end Put_Work; function Get_Work (Worker : in out Wallet_Worker) return Data_Work_Access is begin if Worker.Pool_Count = 0 then return null; else Worker.Pool_Count := Worker.Pool_Count - 1; return Worker.Work_Pool (Worker.Pool_Count + 1); end if; end Get_Work; procedure Allocate_Work (Manager : in out Wallet_Repository; Kind : in Data_Work_Type; Process : access procedure (Work : in Data_Work_Access); Iterator : in Keys.Data_Key_Iterator; Work : out Data_Work_Access) is Workers : constant access Wallet_Worker := Manager.Workers; Seq : Natural; Status : Status_Type; begin loop Work := Get_Work (Workers.all); exit when Work /= null; Workers.Data_Queue.Dequeue (Work, Seq); if Process /= null then Process (Work); end if; Status := Work.Status; Put_Work (Workers.all, Work); Check_Raise_Error (Status); end loop; Work.Kind := Kind; Work.Buffer_Pos := Work.Data'First; if Kind = DATA_DECRYPT then Work.Last_Pos := Work.Data'First + Iterator.Data_Size - 1; end if; Work.Entry_Id := Iterator.Entry_Id; Work.Key_Pos := Iterator.Key_Pos; Work.Key_Block.Buffer := Iterator.Current.Buffer; Work.Data_Block := Iterator.Data_Block; Work.Data_Need_Setup := False; Work.Data_Offset := Iterator.Current_Offset; Work.Sequence := Workers.Sequence; Work.Status := PENDING; end Allocate_Work; procedure Flush_Queue (Manager : in out Wallet_Repository; Process : access procedure (Work : in Data_Work_Access)) is Workers : constant access Wallet_Worker := Manager.Workers; Seq : Natural; Work : Data_Work_Access; Status : Status_Type := SUCCESS; begin if Workers /= null then while Workers.Pool_Count < Workers.Work_Count loop Workers.Data_Queue.Dequeue (Work, Seq); if Status = SUCCESS then Status := Work.Status; end if; if Process /= null and Status = SUCCESS then Process (Work); end if; Put_Work (Workers.all, Work); end loop; Check_Raise_Error (Status); end if; end Flush_Queue; -- ------------------------------ -- Load the data block in the wallet manager buffer. Extract the data descriptors -- the first time the data block is read. -- ------------------------------ procedure Load_Data (Work : in out Data_Work; Data_Block : in out IO.Marshaller) is Btype : Interfaces.Unsigned_16; Wid : Interfaces.Unsigned_32; Size : IO.Block_Index; begin Logs.Debug (Log, "Load data block{0} and key block{1}", Work.Data_Block, Work.Key_Block.Buffer.Block); Data_Block.Buffer := Buffers.Allocate (Work.Data_Block); if Work.Data_Need_Setup then Work.Fragment_Count := 1; Work.Fragment_Pos := 1; Size := Work.Last_Pos - Work.Buffer_Pos + 1; Work.Start_Data := IO.Block_Index'Last - AES_Align (Size) + 1; Work.End_Aligned_Data := IO.Block_Index'Last; Work.End_Data := Work.Start_Data + Size - 1; Marshallers.Set_Header (Into => Data_Block, Tag => IO.BT_WALLET_DATA, Id => Work.Manager.Id); return; end if; -- Read wallet data block. Keystore.Keys.Set_IV (Work.Info_Cryptor, Work.Data_Block.Block); Work.Stream.Read (Decipher => Work.Info_Cryptor.Decipher, Sign => Work.Info_Cryptor.Sign, Decrypt_Size => Size, Into => Data_Block.Buffer); -- Check block type. Btype := Marshallers.Get_Header_16 (Data_Block); if Btype /= IO.BT_WALLET_DATA then Logs.Error (Log, "Block{0} invalid block type", Data_Block.Buffer.Block); Work.Status := DATA_CORRUPTION; return; end if; Marshallers.Skip (Data_Block, 2); -- Check that this is a block for the current wallet. Wid := Marshallers.Get_Unsigned_32 (Data_Block); if Wid /= Interfaces.Unsigned_32 (Work.Manager.Id) then Logs.Error (Log, "Block{0} invalid block wallet identifier", Work.Data_Block); Work.Status := DATA_CORRUPTION; return; end if; Marshallers.Skip (Data_Block, 8); declare Index : Wallet_Entry_Index; Slot_Size : IO.Buffer_Size; Data_Pos : IO.Block_Index; Fragment_Pos : Natural := 0; begin Data_Pos := IO.Block_Index'Last; Work.Fragment_Count := Natural (Size / DATA_ENTRY_SIZE); while Data_Block.Pos < IO.BT_DATA_START + Size loop Index := Wallet_Entry_Index (Marshallers.Get_Unsigned_32 (Data_Block)); Slot_Size := Marshallers.Get_Buffer_Size (Data_Block); if Index = Work.Entry_Id then Work.Fragment_Pos := Fragment_Pos + 1; Work.End_Aligned_Data := Data_Pos; Data_Pos := Data_Pos - AES_Align (Slot_Size) + 1; Work.Start_Data := Data_Pos; Work.End_Data := Data_Pos + Slot_Size - 1; Marshallers.Skip (Data_Block, 2); Work.Data_Offset := Marshallers.Get_Unsigned_64 (Data_Block); if Work.Kind = DATA_ENCRYPT then Size := Work.Last_Pos - Work.Buffer_Pos + 1; Work.Start_Data := Work.End_Aligned_Data - AES_Align (Size) + 1; Work.End_Data := Work.Start_Data + Size - 1; end if; return; end if; Fragment_Pos := Fragment_Pos + 1; Data_Pos := Data_Pos - AES_Align (Slot_Size); Marshallers.Skip (Data_Block, DATA_ENTRY_SIZE - 4 - 2); end loop; Logs.Error (Log, "Block{0} does not contain expected data entry", Work.Data_Block); Work.Status := DATA_CORRUPTION; end; exception when Ada.IO_Exceptions.End_Error | Ada.IO_Exceptions.Data_Error => Logs.Error (Log, "Block{0} cannot be read", Work.Data_Block); Work.Status := DATA_CORRUPTION; end Load_Data; procedure Do_Decipher_Data (Work : in out Data_Work) is Data_Block : IO.Marshaller; Last : Stream_Element_Offset; Encoded : Stream_Element_Offset; Secret : Secret_Key (Length => Util.Encoders.AES.AES_256_Length); IV : Secret_Key (Length => IO.SIZE_IV); begin if Log.Get_Level >= Util.Log.INFO_LEVEL then Log.Info ("Decipher {3} bytes data block{0} with key block{1}@{2}", Buffers.To_String (Work.Data_Block), Buffers.To_String (Work.Key_Block.Buffer.Block), Buffers.Image (Work.Key_Pos), Buffers.Image (Work.Last_Pos - Work.Buffer_Pos + 1)); end if; -- Read the encrypted data block. Load_Data (Work, Data_Block); if Work.Status /= PENDING then return; end if; declare Buf : constant Buffers.Buffer_Accessor := Data_Block.Buffer.Data.Value; Last_Pos : constant IO.Block_Index := Work.Buffer_Pos + Work.End_Data - Work.Start_Data; HMAC : Util.Encoders.SHA256.Hash_Array; begin Work.Key_Block.Pos := Work.Key_Pos; Marshallers.Get_Secret (Work.Key_Block, IV, Work.Manager.Config.Key.Key, Work.Manager.Config.Key.IV); Marshallers.Get_Secret (Work.Key_Block, Secret, Work.Manager.Config.Key.Key, Work.Manager.Config.Key.IV); Work.Data_Decipher.Set_IV (IV); Work.Data_Decipher.Set_Key (Secret, Util.Encoders.AES.CBC); Work.Data_Decipher.Set_Padding (Util.Encoders.AES.ZERO_PADDING); Work.Data_Decipher.Transform (Data => Buf.Data (Work.Start_Data .. Work.End_Aligned_Data), Into => Work.Data (Work.Buffer_Pos .. Last_Pos), Last => Last, Encoded => Encoded); Work.Data_Decipher.Finish (Into => Work.Data (Last + 1 .. Last_Pos), Last => Last); Util.Encoders.HMAC.SHA256.Sign (Key => Work.Info_Cryptor.Sign, Data => Work.Data (Work.Buffer_Pos .. Last), Result => HMAC); if HMAC /= Buf.Data (Data_Block.Pos + 1 .. Data_Block.Pos + IO.SIZE_HMAC) then Log.Error ("Data fragment hmac does not match in block {0}", Buffers.To_String (Work.Data_Block)); Work.Status := DATA_CORRUPTION; else Work.Status := SUCCESS; end if; if Log.Get_Level >= Util.Log.DEBUG_LEVEL then Log.Debug ("Key pos for decrypt at {0}", Buffers.Image (Work.Key_Pos)); Log.Debug ("Current pos {0}", Buffers.Image (Work.Key_Block.Pos)); Log.Debug ("Dump encrypted data:"); Logs.Dump (Log, Buf.Data (Work.Start_Data .. Work.End_Aligned_Data)); Log.Debug ("Dump data:"); Logs.Dump (Log, Work.Data (Work.Buffer_Pos .. Last_Pos)); end if; end; exception when others => Work.Status := DATA_CORRUPTION; end Do_Decipher_Data; procedure Do_Cipher_Data (Work : in out Data_Work) is Data_Block : IO.Marshaller; Encoded : Stream_Element_Offset; Start_Pos : constant Stream_Element_Offset := Work.Buffer_Pos; Last_Pos : constant Stream_Element_Offset := Work.Last_Pos; Write_Pos : Stream_Element_Offset; Secret : Secret_Key (Length => Util.Encoders.AES.AES_256_Length); IV : Secret_Key (Length => 16); begin if Log.Get_Level >= Util.Log.INFO_LEVEL then Log.Info ("Cipher {3} bytes data block{0} with key block{1}@{2}", Buffers.To_String (Work.Data_Block), Buffers.To_String (Work.Key_Block.Buffer.Block), Buffers.Image (Work.Key_Pos), Buffers.Image (Work.Last_Pos - Work.Buffer_Pos + 1)); end if; -- Read the encrypted data block. Load_Data (Work, Data_Block); if Work.Status /= PENDING then return; end if; -- Generate a new IV and key. Work.Random.Generate (IV); Work.Random.Generate (Secret); Work.Key_Block.Pos := Work.Key_Pos; Marshallers.Put_Secret (Work.Key_Block, IV, Work.Manager.Config.Key.Key, Work.Manager.Config.Key.IV); Marshallers.Put_Secret (Work.Key_Block, Secret, Work.Manager.Config.Key.Key, Work.Manager.Config.Key.IV); -- Encrypt the data content using the item encryption key and IV. Work.Data_Cipher.Set_IV (IV); Work.Data_Cipher.Set_Key (Secret, Util.Encoders.AES.CBC); Work.Data_Cipher.Set_Padding (Util.Encoders.AES.ZERO_PADDING); Data_Block.Pos := Data.Data_Entry_Offset (Work.Fragment_Pos); Marshallers.Put_Unsigned_32 (Data_Block, Interfaces.Unsigned_32 (Work.Entry_Id)); Marshallers.Put_Unsigned_16 (Data_Block, Interfaces.Unsigned_16 (Last_Pos - Start_Pos + 1)); Marshallers.Put_Unsigned_16 (Data_Block, 0); Marshallers.Put_Unsigned_64 (Data_Block, Work.Data_Offset); -- Make HMAC-SHA256 signature of the data content before encryption. Marshallers.Put_HMAC_SHA256 (Into => Data_Block, Key => Work.Info_Cryptor.Sign, Content => Work.Data (Start_Pos .. Last_Pos)); declare Buf : constant Buffers.Buffer_Accessor := Data_Block.Buffer.Data.Value; End_Pos : constant IO.Block_Index := Work.End_Aligned_Data; Encrypt_Size : IO.Block_Index; begin -- This is a new block, fill empty area with zero or random values. if Work.Data_Need_Setup and Data_Block.Pos < Work.Start_Data then if Work.Manager.Config.Randomize then Work.Random.Generate (Buf.Data (Data_Block.Pos + 1 .. Work.Start_Data - 1)); else Buf.Data (Data_Block.Pos + 1 .. Work.Start_Data - 1) := (others => 0); end if; end if; Encrypt_Size := IO.Block_Index (Work.Fragment_Count * DATA_ENTRY_SIZE); Work.Data_Cipher.Transform (Data => Work.Data (Start_Pos .. Last_Pos), Into => Buf.Data (Work.Start_Data .. End_Pos), Last => Write_Pos, Encoded => Encoded); if Write_Pos < End_Pos then Work.Data_Cipher.Finish (Into => Buf.Data (Write_Pos + 1 .. End_Pos), Last => Write_Pos); end if; -- Write the encrypted data block. Keystore.Keys.Set_IV (Work.Info_Cryptor, Work.Data_Block.Block); Work.Stream.Write (Encrypt_Size => Encrypt_Size, Cipher => Work.Info_Cryptor.Cipher, Sign => Work.Info_Cryptor.Sign, From => Data_Block.Buffer); if Log.Get_Level >= Util.Log.DEBUG_LEVEL then Log.Debug ("Key pos for encryption at {0}", Buffers.Image (Work.Key_Pos)); Log.Debug ("Current pos {0}", Buffers.Image (Work.Key_Block.Pos)); Log.Debug ("Dump clear data:"); Logs.Dump (Log, Work.Data (Start_Pos .. Last_Pos)); Log.Debug ("Dump encrypted data:"); Logs.Dump (Log, Buf.Data (Work.Start_Data .. Work.End_Aligned_Data)); end if; Work.Status := SUCCESS; end; exception when others => Work.Status := DATA_CORRUPTION; end Do_Cipher_Data; procedure Do_Delete_Data (Work : in out Data_Work) is Data_Block : IO.Marshaller; begin if Log.Get_Level >= Util.Log.INFO_LEVEL then Log.Info ("Delete data block{0}", Buffers.To_String (Work.Data_Block)); end if; -- Read the encrypted data block to release the data fragment or the full data block. Load_Data (Work, Data_Block); if Work.Status /= PENDING then return; end if; if Work.Fragment_Count > 1 then -- The data block looks like: -- +-----+-----------------------------+-----+----------------------------------------+ -- | HDR | Ent1 | ... | Enti | ... EntN| 0 0 | xxx | FragN | .. | Fragi | ... | Frag1 | -- +-----+-----------------------------+-----+----------------------------------------+ -- -- When we remove entry I, we also remove the fragment I. -- +-----+------------------+------------------------------------+--------------------+ -- | HDR | Ent1 | ... | EntN| 0 0 | xxx | FragN | .. | Frag1 | -- +-----+------------------+------------------------------------+--------------------+ -- declare Buf : constant Buffers.Buffer_Accessor := Data_Block.Buffer.Data.Value; Start_Entry : IO.Block_Index; Last_Entry : IO.Block_Index; Start_Pos : IO.Block_Index; Slot_Size : IO.Buffer_Size; Data_Size : constant IO.Block_Index := Work.End_Aligned_Data - Work.Start_Data; Encrypt_Size : constant IO.Block_Index := Data.Data_Entry_Offset (Work.Fragment_Count); begin Last_Entry := Data.Data_Entry_Offset (Work.Fragment_Count) + DATA_ENTRY_SIZE - 1; -- Move the data entry to the beginning. if Work.Fragment_Pos /= Work.Fragment_Count then Start_Entry := Data.Data_Entry_Offset (Work.Fragment_Pos); Buf.Data (Start_Entry .. Last_Entry - DATA_ENTRY_SIZE) := Buf.Data (Start_Entry + DATA_ENTRY_SIZE .. Last_Entry); end if; Buf.Data (Last_Entry - DATA_ENTRY_SIZE + 1 .. Last_Entry) := (others => 0); Start_Pos := Work.Start_Data; Data_Block.Pos := Start_Entry + 4; while Data_Block.Pos < Last_Entry - DATA_ENTRY_SIZE loop Slot_Size := Marshallers.Get_Buffer_Size (Data_Block); Start_Pos := Start_Pos - AES_Align (Slot_Size); Marshallers.Skip (Data_Block, DATA_ENTRY_SIZE - 2); end loop; -- Move the data before the slot being removed. if Work.Start_Data /= Start_Pos then Buf.Data (Start_Pos + Data_Size .. Work.Start_Data - 1) := Buf.Data (Start_Pos .. Work.End_Aligned_Data); end if; -- Erase the content that was dropped. Buf.Data (Start_Pos .. Start_Pos + Data_Size - 1) := (others => 0); -- Write the data block. Work.Stream.Write (Encrypt_Size => Encrypt_Size, Cipher => Work.Info_Cryptor.Cipher, Sign => Work.Info_Cryptor.Sign, From => Data_Block.Buffer); end; else Work.Stream.Release (Block => Work.Data_Block); end if; Work.Status := SUCCESS; end Do_Delete_Data; overriding procedure Execute (Work : in out Data_Work) is begin begin case Work.Kind is when DATA_ENCRYPT => Work.Do_Cipher_Data; when DATA_DECRYPT => Work.Do_Decipher_Data; when DATA_RELEASE => Work.Do_Delete_Data; end case; exception when E : others => Log.Error ("Unexpected exception", E); Work.Status := DATA_CORRUPTION; end; Work.Queue.Enqueue (Work'Unchecked_Access, Work.Sequence); end Execute; -- ------------------------------ -- Create the wallet encryption and decryption work manager. -- ------------------------------ function Create (Manager : access Wallet_Repository; Work_Manager : in Keystore.Task_Manager_Access; Count : in Positive) return Wallet_Worker_Access is Result : Wallet_Worker_Access := new Wallet_Worker (Count); Work : Data_Work_Access; begin Result.Work_Manager := Work_Manager; Result.Data_Queue.Set_Size (Capacity => Count); for I in 1 .. Count loop Work := Result.Work_Slots (I)'Access; Work.Stream := Manager.Stream; Keystore.Keys.Set_Key (Work.Info_Cryptor, Manager.Config.Data); Result.Work_Pool (I) := Work; Result.Work_Slots (I).Queue := Result.Data_Queue'Access; Result.Work_Slots (I).Manager := Manager; end loop; Result.Pool_Count := Count; return Result; end Create; end Keystore.Repository.Workers;
with Ada.Text_IO; with Interfaces.C; use Interfaces.C; with Interfaces.C.Strings; with System; use System; with System.Address_Image; with System.Address_To_Access_Conversions; with Ada.Environment_Variables; with opencl_api_spec; with dl_loader; package body opencl is use opencl_api_spec; type C_Address_Array is array (Interfaces.C.size_t range 1 .. 64) of aliased Raw_Address; type C_Char_Buffer is array (Interfaces.C.size_t range 1 .. 1024) of aliased Interfaces.C.char; type C_SizeT_Array is array (Interfaces.C.size_t range 1 .. 64) of aliased Interfaces.C.size_t; type Context_Property is new Long_Long_Integer; pragma Convention (Convention => C, Entity => C_Address_Array); pragma Convention (Convention => C, Entity => C_Char_Buffer); package C_Addr_Arr_Conv is new System.Address_To_Access_Conversions(Object => C_Address_Array); package C_Char_Buff_Conv is new System.Address_To_Access_Conversions(Object => C_Char_Buffer); package C_SizeT_Arr_Conv is new System.Address_To_Access_Conversions(Object => C_SizeT_Array); function Convert(code: in Interfaces.C.int) return Status is result: Status; begin begin if code = -9999 then Ada.Text_IO.Put_Line("CODE 9999!"); return opencl.INVALID_VALUE; end if; result := Status'Enum_Val(code); exception when E: Constraint_Error => Ada.Text_IO.Put_Line("Status code not recognized: " & code'Image); raise; end; return result; end Convert; function Convert(code: in cl_int) return Status is begin return Convert(Interfaces.C.int(code)); end Convert; cl_lib_handle: dl_loader.Handle; function To_Ada(s: in C_Char_Buffer; size: Interfaces.C.size_t) return String is result: String(1 .. Integer(size)) := (others => ASCII.NUL); begin for idx in 1 .. size loop result(Integer(idx)) := Interfaces.C.To_Ada(s(idx)); end loop; return result; end To_Ada; function Convert(event_list: in Events) return C_Address_Array is result: C_Address_Array := (others => 0); begin for i in 1 .. event_list'Length loop result(Interfaces.C.size_t(i)) := Raw_Address(event_list(i)); end loop; return result; end Convert; --TODO better check function Get_OpenCL_Path(arch: Arch_Type) return String is is_linux: constant Boolean := Ada.Environment_Variables.Exists("HOME"); begin if is_linux then return "TODO"; else return (if arch = ARCH_64 then "C:/Windows/SysWOW64/OpenCL.dll" else "C:/Windows/System32/OpenCL.dll"); end if; end Get_OpenCL_Path; function Init(path: String) return Status is result: Boolean; begin result := dl_loader.Open(path, cl_lib_handle); if result then result := opencl_api_spec.Load_From(cl_lib_handle); end if; return (if result then SUCCESS else INVALID_VALUE); end Init; function Get_Platforms(result_status: out Status) return Platforms is function Impl(num_entries_p: Interfaces.C.unsigned; platforms_ptr_p: System.Address; num_platforms_p: access Interfaces.C.unsigned) return Interfaces.C.int with Import, Address => clGetPlatformIDs, Convention => C; num_platforms: aliased Interfaces.C.unsigned := 0; platforms_ptr: aliased C_Address_Array := (others => 0); cl_code: Interfaces.C.int; current_index: Interfaces.C.size_t := 1; null_platforms: constant Platforms(1 .. 0) := (others => 0); begin if clGetPlatformIDs = System.Null_Address then result_status := INVALID_PLATFORM; return null_platforms; end if; cl_code := Impl(platforms_ptr'Length, C_Addr_Arr_Conv.To_Address(platforms_ptr'Unchecked_Access), num_platforms'Access); result_status := Convert(cl_code); if result_status = SUCCESS then return result: Platforms(1 .. Integer(num_platforms)) do for ptr of result loop if current_index <= Interfaces.C.size_t(num_platforms) then ptr := Platform_ID(platforms_ptr(current_index)); else ptr := Platform_ID(0); end if; current_index := current_index + 1; end loop; end return; end if; return null_platforms; end Get_Platforms; function Get_Platform_Info(id: in Platform_ID; info: Platform_Info; result_status: out Status) return String is function Impl(p: Raw_Address; info: Interfaces.C.unsigned; val_size: Interfaces.C.size_t; val: System.Address; val_size_ret: access Interfaces.C.size_t) return Interfaces.C.int with Import, Address => clGetPlatformInfo, Convention => C; cl_code: Interfaces.C.Int; size_ret: aliased Interfaces.C.size_t; string_ret: aliased C_Char_Buffer; begin cl_code := Impl(Raw_Address(id), Platform_Info'Enum_Rep(info), string_ret'Length, C_Char_Buff_Conv.To_Address(string_ret'Unchecked_Access), size_ret'Access); result_status := Convert(cl_code); return To_Ada(string_ret, size_ret - 1); end Get_Platform_Info; function Get_Devices(id: in Platform_ID; dev_type: in Device_Type; result_status: out Status) return Devices is null_devices: constant Devices(1 .. 0) := (others => 0); function Impl(p: Raw_Address; dev_t: Interfaces.C.unsigned; num_entries: Interfaces.C.unsigned; out_devices: System.Address; num_devs: access Interfaces.C.unsigned) return Interfaces.C.int with Import, Address => clGetDeviceIDs, Convention => C; num_devices: aliased Interfaces.C.unsigned := 0; device_ids: aliased C_Address_Array := (others => 0); cl_res: Interfaces.C.int; begin cl_res := Impl(p => Raw_Address(id), dev_t => Device_Type'Enum_Rep(dev_type), num_entries => device_ids'Length, out_devices => C_Addr_Arr_Conv.To_Address(device_ids'Unchecked_Access), num_devs => num_devices'Access); result_status := Convert(cl_res); if result_status = SUCCESS then return devs: Devices(1 .. Integer(num_devices)) do for idx in 1 .. num_devices loop devs(Integer(idx)) := Device_ID(device_ids(Interfaces.C.size_t(idx))); end loop; end return; end if; return null_devices; end Get_Devices; function Get_Device_Info(id: in Device_ID; info: in Device_Info_Bool; result_status: out Status) return Boolean is function Impl(p: Raw_Address; dev_i: Interfaces.C.unsigned; res_size: Interfaces.C.size_t; out_info: access Interfaces.C.unsigned; info_len: System.Address) return Interfaces.C.int with Import, Address => clGetDeviceInfo, Convention => C; flag_value: aliased Interfaces.C.unsigned := 0; cl_status: Interfaces.C.int := 0; begin cl_status := Impl(p => Raw_Address(id), dev_i => Device_Info_Bool'Enum_Rep(info), res_size => Interfaces.C.unsigned'Size, out_info => flag_value'Access, info_len => System.Null_Address); result_status := Convert(cl_status); return (if flag_value = 0 then False else True); end Get_Device_Info; function Get_Device_Info(id: in Device_ID; info: in Device_Info_String; result_status: out Status) return String is function Impl(p: Raw_Address; dev_i: Interfaces.C.unsigned; res_size: Interfaces.C.size_t; out_info: System.Address; info_len: access Interfaces.C.size_t) return Interfaces.C.int with Import, Address => clGetDeviceInfo, Convention => C; null_string: constant String(1 .. 0) := (others => ' '); cl_status: Interfaces.C.int := 0; buffer: aliased C_Char_Buffer; actual_length: aliased Interfaces.C.size_t := 0; begin cl_status := Impl(p => Raw_Address(id), dev_i => Device_Info_String'Enum_Rep(info), res_size => buffer'Length, out_info => C_Char_Buff_Conv.To_Address(buffer'Unchecked_Access), info_len => actual_length'Access); result_status := Convert(cl_status); if result_status = SUCCESS then return To_Ada(buffer, actual_length - 1); end if; return null_string; end Get_Device_Info; function Create_Context(context_platform: in Platform_ID; context_device: in Device_ID; result_status: out Status) return Context_ID is function Impl(ctx_props: System.Address; num_devs: Interfaces.C.unsigned; devs: System.Address; cb: System.Address; user_data: System.Address; err_code: access Interfaces.C.int) return Raw_Address with Import, Address => clCreateContext, Convention => C; properties: aliased C_Address_Array := (others => 0); dev_ids: aliased C_Address_Array := (others => 0); err_code: aliased Interfaces.C.int := 0; ctx_id: Raw_Address := 0; begin dev_ids(1) := Raw_Address(context_device); properties(1) := Raw_Address(Context_Properties'Enum_Rep(CONTEXT_PROP_PLATFORM)); properties(2) := Raw_Address(context_platform); ctx_id := Impl(ctx_props => C_Addr_Arr_Conv.To_Address(properties'Unchecked_Access), num_devs => 1, devs => C_Addr_Arr_Conv.To_Address(dev_ids'Unchecked_Access), cb => System.Null_Address, user_data => System.Null_Address, err_code => err_code'Access); result_status := Convert(err_code); return Context_ID(ctx_id); end Create_Context; function Release_Context(id: in Context_ID) return Status is function Impl(p: Raw_Address) return Interfaces.C.int with Import, Address => clReleaseContext, Convention => C; cl_code: Interfaces.C.int := 0; begin cl_code := Impl(Raw_Address(id)); return Convert(cl_code); end Release_Context; function Create_Program(ctx: in Context_ID; source: in String; result_status: out Status) return Program_ID is function Impl(ctx: Raw_Address; count: Interfaces.C.unsigned; strs: access Interfaces.C.Strings.chars_ptr; lengths: System.Address; err_code: access Interfaces.C.int) return Raw_Address with Import, Address => clCreateProgramWithSource, Convention => C; prog_id: Raw_Address := 0; err_code: aliased Interfaces.C.int := 0; lengths: aliased C_SizeT_Array := (others => 0); source_ptr: aliased Interfaces.C.Strings.chars_ptr; begin lengths(1) := source'Length; source_ptr := Interfaces.C.Strings.New_String(Str => source); prog_id := Impl(ctx => Raw_Address(ctx), count => 1, strs => source_ptr'Access, lengths => C_SizeT_Arr_Conv.To_Address(lengths'Unchecked_Access), err_code => err_code'Access); result_status := Convert(err_code); Interfaces.C.Strings.Free(Item => source_ptr); return Program_ID(prog_id); end Create_Program; function Build_Program(id: in Program_ID; device: in Device_ID; options: in String) return Status is function Impl(p_id: Raw_Address; num_devices: Interfaces.C.unsigned; device_list: System.Address; options: Interfaces.C.Strings.char_array_access; user_cb: System.Address; user_data: System.Address) return Interfaces.C.int with Import, Address => clBuildProgram, Convention => C; cl_code: Interfaces.C.int := 0; device_array: aliased C_Address_Array := (others => 0); opts: aliased Interfaces.C.char_array := Interfaces.C.To_C(options); begin device_array(1) := Raw_Address(device); cl_code := Impl(p_id => Raw_Address(id), num_devices => 1, device_list => C_Addr_Arr_Conv.To_Address(device_array'Unchecked_Access), options => opts'Unchecked_Access, user_cb => System.Null_Address, user_data => System.Null_Address); return Convert(cl_code); end Build_Program; function Get_Program_Build_Log(id: in Program_ID; device: in Device_ID; result_status: out Status) return String is function Impl(prog: Raw_Address; dev: Raw_Address; info: Interfaces.C.unsigned; available_size: Interfaces.C.size_t; ptr: System.Address; ret_size: access Interfaces.C.size_t) return Interfaces.C.int with Import, Address => clGetProgramBuildInfo, Convention => C; build_log_size: aliased Interfaces.C.size_t; cl_code: Interfaces.C.int := 0; begin cl_code := Impl(prog => Raw_Address(id), dev => Raw_Address(device), info => Program_Build_Info_String'Enum_Rep(PROGRAM_BUILD_LOG), available_size => 0, ptr => System.Null_Address, ret_size => build_log_size'Access); declare type C_Char_Buff is new Interfaces.C.char_array(1 .. build_log_size); build_log_buffer: aliased C_Char_Buff := (1 .. build_log_size => Interfaces.C.To_C(ASCII.NUL)); package Char_Arr_Addr_Conv is new System.Address_To_Access_Conversions(Object => C_Char_Buff); begin cl_code := Impl(prog => Raw_Address(id), dev => Raw_Address(device), info => Program_Build_Info_String'Enum_Rep(PROGRAM_BUILD_LOG), available_size => build_log_size, ptr => Char_Arr_Addr_Conv.To_Address(build_log_buffer'Unchecked_Access), ret_size => build_log_size'Access); result_status := Convert(cl_code); return Interfaces.C.To_Ada(Interfaces.C.char_array(build_log_buffer)); end; end Get_Program_Build_Log; function Release_Program(id: in Program_ID) return Status is function Impl(p: Raw_Address) return Interfaces.C.int with Import, Address => clReleaseProgram, Convention => C; cl_code: Interfaces.C.int := 0; begin cl_code := Impl(Raw_Address(id)); return Convert(cl_code); end Release_Program; function Create_Kernel(program: in Program_ID; name: in String; result_status: out Status) return Kernel_ID is function Impl(prog: Raw_Address; name_str: Interfaces.C.Strings.char_array_access; err_c: access Interfaces.C.int) return Raw_Address with Import, Address => clCreateKernel, Convention => C; cl_code: aliased Interfaces.C.int := 0; str_ptr: aliased Interfaces.C.char_array := Interfaces.C.To_C(name); result: Raw_Address := 0; begin result := Impl(prog => Raw_Address(program), name_str => str_ptr'Unchecked_Access, err_c => cl_code'Access); result_status := Convert(cl_code); return Kernel_ID(result); end Create_Kernel; function Release_Kernel(id: in Kernel_ID) return Status is function Impl(p: Raw_Address) return Interfaces.C.int with Import, Address => clReleaseKernel, Convention => C; cl_code: Interfaces.C.int := 0; begin cl_code := Impl(Raw_Address(id)); return Convert(cl_code); end Release_Kernel; function Set_Kernel_Arg(id: in Kernel_ID; index: Natural; size: Positive; address: System.Address) return Status is function Impl(k_id: Raw_Address; arg_index: Interfaces.C.unsigned; arg_size: Interfaces.C.size_t; arg_addr: System.Address) return Interfaces.C.int with Import, Address => clSetKernelArg, Convention => C; cl_code: Interfaces.C.int; arg_index: constant Interfaces.C.unsigned := Interfaces.C.unsigned(index); arg_size: constant Interfaces.C.size_t := Interfaces.C.size_t(size); begin cl_code := Impl(k_id => Raw_Address(id), arg_index => arg_index, arg_size => arg_size, arg_addr => address); return Convert(cl_code); end Set_Kernel_Arg; function Enqueue_Kernel(queue: in Command_Queue; kernel: in Kernel_ID; global_offset: in Offsets; global_work_size, local_work_size: in Dimensions; event_wait_list: in Events; event: out Event_ID) return Status is function Impl(q_id, k_id: Raw_Address; dims: Interfaces.C.unsigned; glob_off, glob_ws, local_ws: access C_SizeT_Array; num_wait_events: Interfaces.C.unsigned; event_wait: System.Address; event_res: access Raw_Address) return Interfaces.C.int with Import, Address => clEnqueueNDRangeKernel, Convention => C; event_result: aliased Raw_Address; result: Interfaces.C.int := 0; global_ws_array: aliased C_SizeT_Array := (others => 0); local_ws_array: aliased C_SizeT_Array := (others => 0); global_off_array: aliased C_SizeT_Array := (others => 0); event_wait_array: aliased C_Address_Array := Convert(event_wait_list); begin for i in 1 .. global_offset'Length loop global_off_array(Interfaces.C.size_t(i)) := Interfaces.C.size_t(global_offset(i)); end loop; for i in 1 .. global_work_size'Length loop global_ws_array(Interfaces.C.size_t(i)) := Interfaces.C.size_t(global_work_size(i)); end loop; for i in 1 .. local_work_size'Length loop local_ws_array(Interfaces.C.size_t(i)) := Interfaces.C.size_t(local_work_size(i)); end loop; result := Impl(q_id => Raw_Address(queue), k_id => Raw_Address(kernel), dims => global_work_size'Length, glob_off => global_off_array'Access, glob_ws => global_ws_array'Access, local_ws => local_ws_array'Access, num_wait_events => event_wait_list'Length, event_wait => (if event_wait_list'Length = 0 then System.Null_Address else C_Addr_Arr_Conv.To_Address(event_wait_array'Unchecked_Access)), event_res => event_result'Access); event := Event_ID(event_result); return Convert(result); end Enqueue_Kernel; function Create_Command_Queue(ctx: in Context_ID; dev: in Device_ID; result_status: out Status) return Command_Queue is function Impl(ctx_id: Raw_Address; dev_id: Raw_Address; props: System.Address; err_c: access Interfaces.C.int) return Raw_Address with Import, Address => clCreateCommandQueueWithProperties, Convention => C; cl_code: aliased Interfaces.C.int := 0; result: Raw_Address := 0; begin result := Impl(ctx_id => Raw_Address(ctx), dev_id => Raw_Address(dev), props => System.Null_Address, err_c => cl_code'Access); result_status := Convert(cl_code); return Command_Queue(result); end Create_Command_Queue; function Release_Command_Queue(id: in Command_Queue) return Status is function Impl(p: Raw_Address) return Interfaces.C.int with Import, Address => clReleaseCommandQueue, Convention => C; cl_code: Interfaces.C.int := 0; begin cl_code := Impl(Raw_Address(id)); return Convert(cl_code); end Release_Command_Queue; function Wait_For_Events(ev_list: Events) return Status is function Impl(num_events: Interfaces.C.unsigned; event_arr: access C_Address_Array) return Interfaces.C.int with Import, Address => clWaitForEvents, Convention => C; cl_code: Interfaces.C.int := 0; event_arr: aliased C_Address_Array := (others => 0); begin for i in 1 .. ev_list'Length loop event_arr(Interfaces.C.size_t(i)) := Raw_Address(ev_list(i)); end loop; cl_code := Impl(num_events => ev_list'Length, event_arr => event_arr'Access); return Convert(cl_code); end Wait_For_Events; function Release_Event(ev: in Event_ID) return Status is function Impl(p: Raw_Address) return cl_int with Import, Address => clReleaseEvent, Convention => C; cl_code: cl_int := 0; begin cl_code := Impl(Raw_Address(ev)); return Convert(cl_code); end Release_Event; function Retain_Event(ev: in Event_ID) return Status is function Impl(p: Raw_Address) return cl_int with Import, Address => clRetainEvent, Convention => C; cl_code: cl_int := 0; begin cl_code := Impl(Raw_Address(ev)); return Convert(cl_code); end Retain_Event; function Finish(queue: in Command_Queue) return Status is function Impl(p: Raw_Address) return Interfaces.C.int with Import, Address => clFinish, Convention => C; cl_code: Interfaces.C.int := 0; begin cl_code := Impl(Raw_Address(queue)); return Convert(cl_code); end Finish; function Convert(flags: in Mem_Flags) return cl_mem_flags is result: cl_mem_flags := 0; current_flag: cl_mem_flags := 0; begin for i in flags'Range loop if flags(i) then current_flag := cl_mem_flags(Mem_Flag'Enum_Rep(i)); result := result or current_flag; end if; end loop; return result; end Convert; function Create_Buffer(ctx: in Context_ID; flags: in Mem_Flags; size: Positive; host_ptr: System.Address; result_status: out Status) return Mem_ID is function Impl(ctx: Raw_Address; flags: cl_mem_flags; size: Interfaces.C.size_t; host_ptr: System.Address; result_code: access cl_int) return Raw_Address with Import, Address => clCreateBuffer, Convention => C; cl_code: aliased cl_int; size_p: constant Interfaces.C.size_t := Interfaces.C.size_t(size); raw_mem_id: Raw_Address; begin raw_mem_id := Impl(ctx => Raw_Address(ctx), flags => Convert(flags), size => size_p, host_ptr => host_ptr, result_code => cl_code'Access); result_status := Convert(cl_code); return Mem_ID(raw_mem_id); end Create_Buffer; function Enqueue_Read(queue: in Command_Queue; mem_ob: in Mem_ID; block_read: Boolean; offset: Natural; size: Positive; ptr: System.Address; events_to_wait_for: in Events; event: out Event_ID) return Status is function Impl(q: Raw_Address; mem: Raw_Address; block_read: cl_bool; offset, size: Interfaces.C.size_t; ptr: System.Address; num_wait_events: Interfaces.C.unsigned; event_wait: System.Address; event_res: access Raw_Address) return cl_int with Import, Address => clEnqueueReadBuffer, Convention => C; event_list: aliased C_Address_Array := Convert(events_to_wait_for); event_result: aliased Raw_Address; cl_code: cl_int; begin cl_code := Impl(q => Raw_Address(queue), mem => Raw_Address(mem_ob), block_read => cl_bool(if block_read then 1 else 0), offset => Interfaces.C.size_t(offset), size => Interfaces.C.size_t(size), ptr => ptr, num_wait_events => events_to_wait_for'Length, event_wait => (if events_to_wait_for'Length = 0 then System.Null_Address else C_Addr_Arr_Conv.To_Address(event_list'Unchecked_Access)), event_res => event_result'Access); event := Event_ID(event_result); return Convert(cl_code); end Enqueue_Read; function Enqueue_Write(queue: in Command_Queue; mem_ob: in Mem_ID; block_write: Boolean; offset: Natural; size: Positive; ptr: System.Address; events_to_wait_for: in Events; event: out Event_ID) return Status is function Impl(q: Raw_Address; mem: Raw_Address; block_write: cl_bool; offset, size: Interfaces.C.size_t; ptr: System.Address; num_wait_events: Interfaces.C.unsigned; event_wait: System.Address; event_res: access Raw_Address) return cl_int with Import, Address => clEnqueueWriteBuffer, Convention => C; event_list: aliased C_Address_Array := Convert(events_to_wait_for); event_result: aliased Raw_Address; cl_code: cl_int; begin cl_code := Impl(q => Raw_Address(queue), mem => Raw_Address(mem_ob), block_write => cl_bool(if block_write then 1 else 0), offset => Interfaces.C.size_t(offset), size => Interfaces.C.size_t(size), ptr => ptr, num_wait_events => events_to_wait_for'Length, event_wait => (if events_to_wait_for'Length = 0 then System.Null_Address else C_Addr_Arr_Conv.To_Address(event_list'Unchecked_Access)), event_res => event_result'Access); event := Event_ID(event_result); return Convert(cl_code); end Enqueue_Write; function Release(mem_ob: in Mem_ID) return Status is function Impl(id: Raw_Address) return Interfaces.C.int with Import, Address => clReleaseMemObject, Convention => C; cl_code: Interfaces.C.int; begin cl_code := Impl(Raw_Address(mem_ob)); return Convert(cl_code); end Release; function Get_Local_Work_Size(width, height: in Positive) return opencl.Dimensions is result: opencl.Dimensions := (1 => 1, 2 => 1); preferred_multiples: constant opencl.Dimensions := (32, 16, 8, 4, 2); begin for m of preferred_multiples loop if width rem m = 0 then result(1) := m; exit; end if; end loop; for m of preferred_multiples loop if height rem m = 0 then result(2) := m; exit; end if; end loop; return result; end Get_Local_Work_Size; end opencl;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- E X P _ C H 4 -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2016, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING3. If not, go to -- -- http://www.gnu.org/licenses for a complete copy of the license. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Atree; use Atree; with Checks; use Checks; with Debug; use Debug; with Einfo; use Einfo; with Elists; use Elists; with Errout; use Errout; with Exp_Aggr; use Exp_Aggr; with Exp_Atag; use Exp_Atag; with Exp_Ch2; use Exp_Ch2; with Exp_Ch3; use Exp_Ch3; with Exp_Ch6; use Exp_Ch6; with Exp_Ch7; use Exp_Ch7; with Exp_Ch9; use Exp_Ch9; with Exp_Disp; use Exp_Disp; with Exp_Fixd; use Exp_Fixd; with Exp_Intr; use Exp_Intr; with Exp_Pakd; use Exp_Pakd; with Exp_Tss; use Exp_Tss; with Exp_Util; use Exp_Util; with Freeze; use Freeze; with Inline; use Inline; with Namet; use Namet; with Nlists; use Nlists; with Nmake; use Nmake; with Opt; use Opt; with Par_SCO; use Par_SCO; with Restrict; use Restrict; with Rident; use Rident; with Rtsfind; use Rtsfind; with Sem; use Sem; with Sem_Aux; use Sem_Aux; with Sem_Cat; use Sem_Cat; with Sem_Ch3; use Sem_Ch3; with Sem_Ch13; use Sem_Ch13; with Sem_Eval; use Sem_Eval; with Sem_Res; use Sem_Res; with Sem_Type; use Sem_Type; with Sem_Util; use Sem_Util; with Sem_Warn; use Sem_Warn; with Sinfo; use Sinfo; with Snames; use Snames; with Stand; use Stand; with SCIL_LL; use SCIL_LL; with Targparm; use Targparm; with Tbuild; use Tbuild; with Ttypes; use Ttypes; with Uintp; use Uintp; with Urealp; use Urealp; with Validsw; use Validsw; package body Exp_Ch4 is ----------------------- -- Local Subprograms -- ----------------------- procedure Binary_Op_Validity_Checks (N : Node_Id); pragma Inline (Binary_Op_Validity_Checks); -- Performs validity checks for a binary operator procedure Build_Boolean_Array_Proc_Call (N : Node_Id; Op1 : Node_Id; Op2 : Node_Id); -- If a boolean array assignment can be done in place, build call to -- corresponding library procedure. procedure Displace_Allocator_Pointer (N : Node_Id); -- Ada 2005 (AI-251): Subsidiary procedure to Expand_N_Allocator and -- Expand_Allocator_Expression. Allocating class-wide interface objects -- this routine displaces the pointer to the allocated object to reference -- the component referencing the corresponding secondary dispatch table. procedure Expand_Allocator_Expression (N : Node_Id); -- Subsidiary to Expand_N_Allocator, for the case when the expression -- is a qualified expression or an aggregate. procedure Expand_Array_Comparison (N : Node_Id); -- This routine handles expansion of the comparison operators (N_Op_Lt, -- N_Op_Le, N_Op_Gt, N_Op_Ge) when operating on an array type. The basic -- code for these operators is similar, differing only in the details of -- the actual comparison call that is made. Special processing (call a -- run-time routine) function Expand_Array_Equality (Nod : Node_Id; Lhs : Node_Id; Rhs : Node_Id; Bodies : List_Id; Typ : Entity_Id) return Node_Id; -- Expand an array equality into a call to a function implementing this -- equality, and a call to it. Loc is the location for the generated nodes. -- Lhs and Rhs are the array expressions to be compared. Bodies is a list -- on which to attach bodies of local functions that are created in the -- process. It is the responsibility of the caller to insert those bodies -- at the right place. Nod provides the Sloc value for the generated code. -- Normally the types used for the generated equality routine are taken -- from Lhs and Rhs. However, in some situations of generated code, the -- Etype fields of Lhs and Rhs are not set yet. In such cases, Typ supplies -- the type to be used for the formal parameters. procedure Expand_Boolean_Operator (N : Node_Id); -- Common expansion processing for Boolean operators (And, Or, Xor) for the -- case of array type arguments. procedure Expand_Short_Circuit_Operator (N : Node_Id); -- Common expansion processing for short-circuit boolean operators procedure Expand_Compare_Minimize_Eliminate_Overflow (N : Node_Id); -- Deal with comparison in MINIMIZED/ELIMINATED overflow mode. This is -- where we allow comparison of "out of range" values. function Expand_Composite_Equality (Nod : Node_Id; Typ : Entity_Id; Lhs : Node_Id; Rhs : Node_Id; Bodies : List_Id) return Node_Id; -- Local recursive function used to expand equality for nested composite -- types. Used by Expand_Record/Array_Equality, Bodies is a list on which -- to attach bodies of local functions that are created in the process. It -- is the responsibility of the caller to insert those bodies at the right -- place. Nod provides the Sloc value for generated code. Lhs and Rhs are -- the left and right sides for the comparison, and Typ is the type of the -- objects to compare. procedure Expand_Concatenate (Cnode : Node_Id; Opnds : List_Id); -- Routine to expand concatenation of a sequence of two or more operands -- (in the list Operands) and replace node Cnode with the result of the -- concatenation. The operands can be of any appropriate type, and can -- include both arrays and singleton elements. procedure Expand_Membership_Minimize_Eliminate_Overflow (N : Node_Id); -- N is an N_In membership test mode, with the overflow check mode set to -- MINIMIZED or ELIMINATED, and the type of the left operand is a signed -- integer type. This is a case where top level processing is required to -- handle overflow checks in subtrees. procedure Fixup_Universal_Fixed_Operation (N : Node_Id); -- N is a N_Op_Divide or N_Op_Multiply node whose result is universal -- fixed. We do not have such a type at runtime, so the purpose of this -- routine is to find the real type by looking up the tree. We also -- determine if the operation must be rounded. function Has_Inferable_Discriminants (N : Node_Id) return Boolean; -- Ada 2005 (AI-216): A view of an Unchecked_Union object has inferable -- discriminants if it has a constrained nominal type, unless the object -- is a component of an enclosing Unchecked_Union object that is subject -- to a per-object constraint and the enclosing object lacks inferable -- discriminants. -- -- An expression of an Unchecked_Union type has inferable discriminants -- if it is either a name of an object with inferable discriminants or a -- qualified expression whose subtype mark denotes a constrained subtype. procedure Insert_Dereference_Action (N : Node_Id); -- N is an expression whose type is an access. When the type of the -- associated storage pool is derived from Checked_Pool, generate a -- call to the 'Dereference' primitive operation. function Make_Array_Comparison_Op (Typ : Entity_Id; Nod : Node_Id) return Node_Id; -- Comparisons between arrays are expanded in line. This function produces -- the body of the implementation of (a > b), where a and b are one- -- dimensional arrays of some discrete type. The original node is then -- expanded into the appropriate call to this function. Nod provides the -- Sloc value for the generated code. function Make_Boolean_Array_Op (Typ : Entity_Id; N : Node_Id) return Node_Id; -- Boolean operations on boolean arrays are expanded in line. This function -- produce the body for the node N, which is (a and b), (a or b), or (a xor -- b). It is used only the normal case and not the packed case. The type -- involved, Typ, is the Boolean array type, and the logical operations in -- the body are simple boolean operations. Note that Typ is always a -- constrained type (the caller has ensured this by using -- Convert_To_Actual_Subtype if necessary). function Minimized_Eliminated_Overflow_Check (N : Node_Id) return Boolean; -- For signed arithmetic operations when the current overflow mode is -- MINIMIZED or ELIMINATED, we must call Apply_Arithmetic_Overflow_Checks -- as the first thing we do. We then return. We count on the recursive -- apparatus for overflow checks to call us back with an equivalent -- operation that is in CHECKED mode, avoiding a recursive entry into this -- routine, and that is when we will proceed with the expansion of the -- operator (e.g. converting X+0 to X, or X**2 to X*X). We cannot do -- these optimizations without first making this check, since there may be -- operands further down the tree that are relying on the recursive calls -- triggered by the top level nodes to properly process overflow checking -- and remaining expansion on these nodes. Note that this call back may be -- skipped if the operation is done in Bignum mode but that's fine, since -- the Bignum call takes care of everything. procedure Optimize_Length_Comparison (N : Node_Id); -- Given an expression, if it is of the form X'Length op N (or the other -- way round), where N is known at compile time to be 0 or 1, and X is a -- simple entity, and op is a comparison operator, optimizes it into a -- comparison of First and Last. procedure Process_If_Case_Statements (N : Node_Id; Stmts : List_Id); -- Inspect and process statement list Stmt of if or case expression N for -- transient objects. If such objects are found, the routine generates code -- to clean them up when the context of the expression is evaluated. procedure Process_Transient_In_Expression (Obj_Decl : Node_Id; Expr : Node_Id; Stmts : List_Id); -- Subsidiary routine to the expansion of expression_with_actions, if and -- case expressions. Generate all necessary code to finalize a transient -- object when the enclosing context is elaborated or evaluated. Obj_Decl -- denotes the declaration of the transient object, which is usually the -- result of a controlled function call. Expr denotes the expression with -- actions, if expression, or case expression node. Stmts denotes the -- statement list which contains Decl, either at the top level or within a -- nested construct. procedure Rewrite_Comparison (N : Node_Id); -- If N is the node for a comparison whose outcome can be determined at -- compile time, then the node N can be rewritten with True or False. If -- the outcome cannot be determined at compile time, the call has no -- effect. If N is a type conversion, then this processing is applied to -- its expression. If N is neither comparison nor a type conversion, the -- call has no effect. procedure Tagged_Membership (N : Node_Id; SCIL_Node : out Node_Id; Result : out Node_Id); -- Construct the expression corresponding to the tagged membership test. -- Deals with a second operand being (or not) a class-wide type. function Safe_In_Place_Array_Op (Lhs : Node_Id; Op1 : Node_Id; Op2 : Node_Id) return Boolean; -- In the context of an assignment, where the right-hand side is a boolean -- operation on arrays, check whether operation can be performed in place. procedure Unary_Op_Validity_Checks (N : Node_Id); pragma Inline (Unary_Op_Validity_Checks); -- Performs validity checks for a unary operator ------------------------------- -- Binary_Op_Validity_Checks -- ------------------------------- procedure Binary_Op_Validity_Checks (N : Node_Id) is begin if Validity_Checks_On and Validity_Check_Operands then Ensure_Valid (Left_Opnd (N)); Ensure_Valid (Right_Opnd (N)); end if; end Binary_Op_Validity_Checks; ------------------------------------ -- Build_Boolean_Array_Proc_Call -- ------------------------------------ procedure Build_Boolean_Array_Proc_Call (N : Node_Id; Op1 : Node_Id; Op2 : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Kind : constant Node_Kind := Nkind (Expression (N)); Target : constant Node_Id := Make_Attribute_Reference (Loc, Prefix => Name (N), Attribute_Name => Name_Address); Arg1 : Node_Id := Op1; Arg2 : Node_Id := Op2; Call_Node : Node_Id; Proc_Name : Entity_Id; begin if Kind = N_Op_Not then if Nkind (Op1) in N_Binary_Op then -- Use negated version of the binary operators if Nkind (Op1) = N_Op_And then Proc_Name := RTE (RE_Vector_Nand); elsif Nkind (Op1) = N_Op_Or then Proc_Name := RTE (RE_Vector_Nor); else pragma Assert (Nkind (Op1) = N_Op_Xor); Proc_Name := RTE (RE_Vector_Xor); end if; Call_Node := Make_Procedure_Call_Statement (Loc, Name => New_Occurrence_Of (Proc_Name, Loc), Parameter_Associations => New_List ( Target, Make_Attribute_Reference (Loc, Prefix => Left_Opnd (Op1), Attribute_Name => Name_Address), Make_Attribute_Reference (Loc, Prefix => Right_Opnd (Op1), Attribute_Name => Name_Address), Make_Attribute_Reference (Loc, Prefix => Left_Opnd (Op1), Attribute_Name => Name_Length))); else Proc_Name := RTE (RE_Vector_Not); Call_Node := Make_Procedure_Call_Statement (Loc, Name => New_Occurrence_Of (Proc_Name, Loc), Parameter_Associations => New_List ( Target, Make_Attribute_Reference (Loc, Prefix => Op1, Attribute_Name => Name_Address), Make_Attribute_Reference (Loc, Prefix => Op1, Attribute_Name => Name_Length))); end if; else -- We use the following equivalences: -- (not X) or (not Y) = not (X and Y) = Nand (X, Y) -- (not X) and (not Y) = not (X or Y) = Nor (X, Y) -- (not X) xor (not Y) = X xor Y -- X xor (not Y) = not (X xor Y) = Nxor (X, Y) if Nkind (Op1) = N_Op_Not then Arg1 := Right_Opnd (Op1); Arg2 := Right_Opnd (Op2); if Kind = N_Op_And then Proc_Name := RTE (RE_Vector_Nor); elsif Kind = N_Op_Or then Proc_Name := RTE (RE_Vector_Nand); else Proc_Name := RTE (RE_Vector_Xor); end if; else if Kind = N_Op_And then Proc_Name := RTE (RE_Vector_And); elsif Kind = N_Op_Or then Proc_Name := RTE (RE_Vector_Or); elsif Nkind (Op2) = N_Op_Not then Proc_Name := RTE (RE_Vector_Nxor); Arg2 := Right_Opnd (Op2); else Proc_Name := RTE (RE_Vector_Xor); end if; end if; Call_Node := Make_Procedure_Call_Statement (Loc, Name => New_Occurrence_Of (Proc_Name, Loc), Parameter_Associations => New_List ( Target, Make_Attribute_Reference (Loc, Prefix => Arg1, Attribute_Name => Name_Address), Make_Attribute_Reference (Loc, Prefix => Arg2, Attribute_Name => Name_Address), Make_Attribute_Reference (Loc, Prefix => Arg1, Attribute_Name => Name_Length))); end if; Rewrite (N, Call_Node); Analyze (N); exception when RE_Not_Available => return; end Build_Boolean_Array_Proc_Call; -------------------------------- -- Displace_Allocator_Pointer -- -------------------------------- procedure Displace_Allocator_Pointer (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Orig_Node : constant Node_Id := Original_Node (N); Dtyp : Entity_Id; Etyp : Entity_Id; PtrT : Entity_Id; begin -- Do nothing in case of VM targets: the virtual machine will handle -- interfaces directly. if not Tagged_Type_Expansion then return; end if; pragma Assert (Nkind (N) = N_Identifier and then Nkind (Orig_Node) = N_Allocator); PtrT := Etype (Orig_Node); Dtyp := Available_View (Designated_Type (PtrT)); Etyp := Etype (Expression (Orig_Node)); if Is_Class_Wide_Type (Dtyp) and then Is_Interface (Dtyp) then -- If the type of the allocator expression is not an interface type -- we can generate code to reference the record component containing -- the pointer to the secondary dispatch table. if not Is_Interface (Etyp) then declare Saved_Typ : constant Entity_Id := Etype (Orig_Node); begin -- 1) Get access to the allocated object Rewrite (N, Make_Explicit_Dereference (Loc, Relocate_Node (N))); Set_Etype (N, Etyp); Set_Analyzed (N); -- 2) Add the conversion to displace the pointer to reference -- the secondary dispatch table. Rewrite (N, Convert_To (Dtyp, Relocate_Node (N))); Analyze_And_Resolve (N, Dtyp); -- 3) The 'access to the secondary dispatch table will be used -- as the value returned by the allocator. Rewrite (N, Make_Attribute_Reference (Loc, Prefix => Relocate_Node (N), Attribute_Name => Name_Access)); Set_Etype (N, Saved_Typ); Set_Analyzed (N); end; -- If the type of the allocator expression is an interface type we -- generate a run-time call to displace "this" to reference the -- component containing the pointer to the secondary dispatch table -- or else raise Constraint_Error if the actual object does not -- implement the target interface. This case corresponds to the -- following example: -- function Op (Obj : Iface_1'Class) return access Iface_2'Class is -- begin -- return new Iface_2'Class'(Obj); -- end Op; else Rewrite (N, Unchecked_Convert_To (PtrT, Make_Function_Call (Loc, Name => New_Occurrence_Of (RTE (RE_Displace), Loc), Parameter_Associations => New_List ( Unchecked_Convert_To (RTE (RE_Address), Relocate_Node (N)), New_Occurrence_Of (Elists.Node (First_Elmt (Access_Disp_Table (Etype (Base_Type (Dtyp))))), Loc))))); Analyze_And_Resolve (N, PtrT); end if; end if; end Displace_Allocator_Pointer; --------------------------------- -- Expand_Allocator_Expression -- --------------------------------- procedure Expand_Allocator_Expression (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Exp : constant Node_Id := Expression (Expression (N)); PtrT : constant Entity_Id := Etype (N); DesigT : constant Entity_Id := Designated_Type (PtrT); procedure Apply_Accessibility_Check (Ref : Node_Id; Built_In_Place : Boolean := False); -- Ada 2005 (AI-344): For an allocator with a class-wide designated -- type, generate an accessibility check to verify that the level of the -- type of the created object is not deeper than the level of the access -- type. If the type of the qualified expression is class-wide, then -- always generate the check (except in the case where it is known to be -- unnecessary, see comment below). Otherwise, only generate the check -- if the level of the qualified expression type is statically deeper -- than the access type. -- -- Although the static accessibility will generally have been performed -- as a legality check, it won't have been done in cases where the -- allocator appears in generic body, so a run-time check is needed in -- general. One special case is when the access type is declared in the -- same scope as the class-wide allocator, in which case the check can -- never fail, so it need not be generated. -- -- As an open issue, there seem to be cases where the static level -- associated with the class-wide object's underlying type is not -- sufficient to perform the proper accessibility check, such as for -- allocators in nested subprograms or accept statements initialized by -- class-wide formals when the actual originates outside at a deeper -- static level. The nested subprogram case might require passing -- accessibility levels along with class-wide parameters, and the task -- case seems to be an actual gap in the language rules that needs to -- be fixed by the ARG. ??? ------------------------------- -- Apply_Accessibility_Check -- ------------------------------- procedure Apply_Accessibility_Check (Ref : Node_Id; Built_In_Place : Boolean := False) is Pool_Id : constant Entity_Id := Associated_Storage_Pool (PtrT); Cond : Node_Id; Fin_Call : Node_Id; Free_Stmt : Node_Id; Obj_Ref : Node_Id; Stmts : List_Id; begin if Ada_Version >= Ada_2005 and then Is_Class_Wide_Type (DesigT) and then Tagged_Type_Expansion and then not Scope_Suppress.Suppress (Accessibility_Check) and then (Type_Access_Level (Etype (Exp)) > Type_Access_Level (PtrT) or else (Is_Class_Wide_Type (Etype (Exp)) and then Scope (PtrT) /= Current_Scope)) then -- If the allocator was built in place, Ref is already a reference -- to the access object initialized to the result of the allocator -- (see Exp_Ch6.Make_Build_In_Place_Call_In_Allocator). We call -- Remove_Side_Effects for cases where the build-in-place call may -- still be the prefix of the reference (to avoid generating -- duplicate calls). Otherwise, it is the entity associated with -- the object containing the address of the allocated object. if Built_In_Place then Remove_Side_Effects (Ref); Obj_Ref := New_Copy_Tree (Ref); else Obj_Ref := New_Occurrence_Of (Ref, Loc); end if; -- For access to interface types we must generate code to displace -- the pointer to the base of the object since the subsequent code -- references components located in the TSD of the object (which -- is associated with the primary dispatch table --see a-tags.ads) -- and also generates code invoking Free, which requires also a -- reference to the base of the unallocated object. if Is_Interface (DesigT) and then Tagged_Type_Expansion then Obj_Ref := Unchecked_Convert_To (Etype (Obj_Ref), Make_Function_Call (Loc, Name => New_Occurrence_Of (RTE (RE_Base_Address), Loc), Parameter_Associations => New_List ( Unchecked_Convert_To (RTE (RE_Address), New_Copy_Tree (Obj_Ref))))); end if; -- Step 1: Create the object clean up code Stmts := New_List; -- Deallocate the object if the accessibility check fails. This -- is done only on targets or profiles that support deallocation. -- Free (Obj_Ref); if RTE_Available (RE_Free) then Free_Stmt := Make_Free_Statement (Loc, New_Copy_Tree (Obj_Ref)); Set_Storage_Pool (Free_Stmt, Pool_Id); Append_To (Stmts, Free_Stmt); -- The target or profile cannot deallocate objects else Free_Stmt := Empty; end if; -- Finalize the object if applicable. Generate: -- [Deep_]Finalize (Obj_Ref.all); if Needs_Finalization (DesigT) then Fin_Call := Make_Final_Call (Obj_Ref => Make_Explicit_Dereference (Loc, New_Copy (Obj_Ref)), Typ => DesigT); -- Guard against a missing [Deep_]Finalize when the designated -- type was not properly frozen. if No (Fin_Call) then Fin_Call := Make_Null_Statement (Loc); end if; -- When the target or profile supports deallocation, wrap the -- finalization call in a block to ensure proper deallocation -- even if finalization fails. Generate: -- begin -- <Fin_Call> -- exception -- when others => -- <Free_Stmt> -- raise; -- end; if Present (Free_Stmt) then Fin_Call := Make_Block_Statement (Loc, Handled_Statement_Sequence => Make_Handled_Sequence_Of_Statements (Loc, Statements => New_List (Fin_Call), Exception_Handlers => New_List ( Make_Exception_Handler (Loc, Exception_Choices => New_List ( Make_Others_Choice (Loc)), Statements => New_List ( New_Copy_Tree (Free_Stmt), Make_Raise_Statement (Loc)))))); end if; Prepend_To (Stmts, Fin_Call); end if; -- Signal the accessibility failure through a Program_Error Append_To (Stmts, Make_Raise_Program_Error (Loc, Condition => New_Occurrence_Of (Standard_True, Loc), Reason => PE_Accessibility_Check_Failed)); -- Step 2: Create the accessibility comparison -- Generate: -- Ref'Tag Obj_Ref := Make_Attribute_Reference (Loc, Prefix => Obj_Ref, Attribute_Name => Name_Tag); -- For tagged types, determine the accessibility level by looking -- at the type specific data of the dispatch table. Generate: -- Type_Specific_Data (Address (Ref'Tag)).Access_Level if Tagged_Type_Expansion then Cond := Build_Get_Access_Level (Loc, Obj_Ref); -- Use a runtime call to determine the accessibility level when -- compiling on virtual machine targets. Generate: -- Get_Access_Level (Ref'Tag) else Cond := Make_Function_Call (Loc, Name => New_Occurrence_Of (RTE (RE_Get_Access_Level), Loc), Parameter_Associations => New_List (Obj_Ref)); end if; Cond := Make_Op_Gt (Loc, Left_Opnd => Cond, Right_Opnd => Make_Integer_Literal (Loc, Type_Access_Level (PtrT))); -- Due to the complexity and side effects of the check, utilize an -- if statement instead of the regular Program_Error circuitry. Insert_Action (N, Make_Implicit_If_Statement (N, Condition => Cond, Then_Statements => Stmts)); end if; end Apply_Accessibility_Check; -- Local variables Aggr_In_Place : constant Boolean := Is_Delayed_Aggregate (Exp); Indic : constant Node_Id := Subtype_Mark (Expression (N)); T : constant Entity_Id := Entity (Indic); Adj_Call : Node_Id; Node : Node_Id; Tag_Assign : Node_Id; Temp : Entity_Id; Temp_Decl : Node_Id; TagT : Entity_Id := Empty; -- Type used as source for tag assignment TagR : Node_Id := Empty; -- Target reference for tag assignment -- Start of processing for Expand_Allocator_Expression begin -- Handle call to C++ constructor if Is_CPP_Constructor_Call (Exp) then Make_CPP_Constructor_Call_In_Allocator (Allocator => N, Function_Call => Exp); return; end if; -- In the case of an Ada 2012 allocator whose initial value comes from a -- function call, pass "the accessibility level determined by the point -- of call" (AI05-0234) to the function. Conceptually, this belongs in -- Expand_Call but it couldn't be done there (because the Etype of the -- allocator wasn't set then) so we generate the parameter here. See -- the Boolean variable Defer in (a block within) Expand_Call. if Ada_Version >= Ada_2012 and then Nkind (Exp) = N_Function_Call then declare Subp : Entity_Id; begin if Nkind (Name (Exp)) = N_Explicit_Dereference then Subp := Designated_Type (Etype (Prefix (Name (Exp)))); else Subp := Entity (Name (Exp)); end if; Subp := Ultimate_Alias (Subp); if Present (Extra_Accessibility_Of_Result (Subp)) then Add_Extra_Actual_To_Call (Subprogram_Call => Exp, Extra_Formal => Extra_Accessibility_Of_Result (Subp), Extra_Actual => Dynamic_Accessibility_Level (PtrT)); end if; end; end if; -- Case of tagged type or type requiring finalization if Is_Tagged_Type (T) or else Needs_Finalization (T) then -- Ada 2005 (AI-318-02): If the initialization expression is a call -- to a build-in-place function, then access to the allocated object -- must be passed to the function. Currently we limit such functions -- to those with constrained limited result subtypes, but eventually -- we plan to expand the allowed forms of functions that are treated -- as build-in-place. if Ada_Version >= Ada_2005 and then Is_Build_In_Place_Function_Call (Exp) then Make_Build_In_Place_Call_In_Allocator (N, Exp); Apply_Accessibility_Check (N, Built_In_Place => True); return; end if; -- Actions inserted before: -- Temp : constant ptr_T := new T'(Expression); -- Temp._tag = T'tag; -- when not class-wide -- [Deep_]Adjust (Temp.all); -- We analyze by hand the new internal allocator to avoid any -- recursion and inappropriate call to Initialize. -- We don't want to remove side effects when the expression must be -- built in place. In the case of a build-in-place function call, -- that could lead to a duplication of the call, which was already -- substituted for the allocator. if not Aggr_In_Place then Remove_Side_Effects (Exp); end if; Temp := Make_Temporary (Loc, 'P', N); -- For a class wide allocation generate the following code: -- type Equiv_Record is record ... end record; -- implicit subtype CW is <Class_Wide_Subytpe>; -- temp : PtrT := new CW'(CW!(expr)); if Is_Class_Wide_Type (T) then Expand_Subtype_From_Expr (Empty, T, Indic, Exp); -- Ada 2005 (AI-251): If the expression is a class-wide interface -- object we generate code to move up "this" to reference the -- base of the object before allocating the new object. -- Note that Exp'Address is recursively expanded into a call -- to Base_Address (Exp.Tag) if Is_Class_Wide_Type (Etype (Exp)) and then Is_Interface (Etype (Exp)) and then Tagged_Type_Expansion then Set_Expression (Expression (N), Unchecked_Convert_To (Entity (Indic), Make_Explicit_Dereference (Loc, Unchecked_Convert_To (RTE (RE_Tag_Ptr), Make_Attribute_Reference (Loc, Prefix => Exp, Attribute_Name => Name_Address))))); else Set_Expression (Expression (N), Unchecked_Convert_To (Entity (Indic), Exp)); end if; Analyze_And_Resolve (Expression (N), Entity (Indic)); end if; -- Processing for allocators returning non-interface types if not Is_Interface (Directly_Designated_Type (PtrT)) then if Aggr_In_Place then Temp_Decl := Make_Object_Declaration (Loc, Defining_Identifier => Temp, Object_Definition => New_Occurrence_Of (PtrT, Loc), Expression => Make_Allocator (Loc, Expression => New_Occurrence_Of (Etype (Exp), Loc))); -- Copy the Comes_From_Source flag for the allocator we just -- built, since logically this allocator is a replacement of -- the original allocator node. This is for proper handling of -- restriction No_Implicit_Heap_Allocations. Set_Comes_From_Source (Expression (Temp_Decl), Comes_From_Source (N)); Set_No_Initialization (Expression (Temp_Decl)); Insert_Action (N, Temp_Decl); Build_Allocate_Deallocate_Proc (Temp_Decl, True); Convert_Aggr_In_Allocator (N, Temp_Decl, Exp); else Node := Relocate_Node (N); Set_Analyzed (Node); Temp_Decl := Make_Object_Declaration (Loc, Defining_Identifier => Temp, Constant_Present => True, Object_Definition => New_Occurrence_Of (PtrT, Loc), Expression => Node); Insert_Action (N, Temp_Decl); Build_Allocate_Deallocate_Proc (Temp_Decl, True); end if; -- Ada 2005 (AI-251): Handle allocators whose designated type is an -- interface type. In this case we use the type of the qualified -- expression to allocate the object. else declare Def_Id : constant Entity_Id := Make_Temporary (Loc, 'T'); New_Decl : Node_Id; begin New_Decl := Make_Full_Type_Declaration (Loc, Defining_Identifier => Def_Id, Type_Definition => Make_Access_To_Object_Definition (Loc, All_Present => True, Null_Exclusion_Present => False, Constant_Present => Is_Access_Constant (Etype (N)), Subtype_Indication => New_Occurrence_Of (Etype (Exp), Loc))); Insert_Action (N, New_Decl); -- Inherit the allocation-related attributes from the original -- access type. Set_Finalization_Master (Def_Id, Finalization_Master (PtrT)); Set_Associated_Storage_Pool (Def_Id, Associated_Storage_Pool (PtrT)); -- Declare the object using the previous type declaration if Aggr_In_Place then Temp_Decl := Make_Object_Declaration (Loc, Defining_Identifier => Temp, Object_Definition => New_Occurrence_Of (Def_Id, Loc), Expression => Make_Allocator (Loc, New_Occurrence_Of (Etype (Exp), Loc))); -- Copy the Comes_From_Source flag for the allocator we just -- built, since logically this allocator is a replacement of -- the original allocator node. This is for proper handling -- of restriction No_Implicit_Heap_Allocations. Set_Comes_From_Source (Expression (Temp_Decl), Comes_From_Source (N)); Set_No_Initialization (Expression (Temp_Decl)); Insert_Action (N, Temp_Decl); Build_Allocate_Deallocate_Proc (Temp_Decl, True); Convert_Aggr_In_Allocator (N, Temp_Decl, Exp); else Node := Relocate_Node (N); Set_Analyzed (Node); Temp_Decl := Make_Object_Declaration (Loc, Defining_Identifier => Temp, Constant_Present => True, Object_Definition => New_Occurrence_Of (Def_Id, Loc), Expression => Node); Insert_Action (N, Temp_Decl); Build_Allocate_Deallocate_Proc (Temp_Decl, True); end if; -- Generate an additional object containing the address of the -- returned object. The type of this second object declaration -- is the correct type required for the common processing that -- is still performed by this subprogram. The displacement of -- this pointer to reference the component associated with the -- interface type will be done at the end of common processing. New_Decl := Make_Object_Declaration (Loc, Defining_Identifier => Make_Temporary (Loc, 'P'), Object_Definition => New_Occurrence_Of (PtrT, Loc), Expression => Unchecked_Convert_To (PtrT, New_Occurrence_Of (Temp, Loc))); Insert_Action (N, New_Decl); Temp_Decl := New_Decl; Temp := Defining_Identifier (New_Decl); end; end if; -- Generate the tag assignment -- Suppress the tag assignment for VM targets because VM tags are -- represented implicitly in objects. if not Tagged_Type_Expansion then null; -- Ada 2005 (AI-251): Suppress the tag assignment with class-wide -- interface objects because in this case the tag does not change. elsif Is_Interface (Directly_Designated_Type (Etype (N))) then pragma Assert (Is_Class_Wide_Type (Directly_Designated_Type (Etype (N)))); null; elsif Is_Tagged_Type (T) and then not Is_Class_Wide_Type (T) then TagT := T; TagR := New_Occurrence_Of (Temp, Loc); elsif Is_Private_Type (T) and then Is_Tagged_Type (Underlying_Type (T)) then TagT := Underlying_Type (T); TagR := Unchecked_Convert_To (Underlying_Type (T), Make_Explicit_Dereference (Loc, Prefix => New_Occurrence_Of (Temp, Loc))); end if; if Present (TagT) then declare Full_T : constant Entity_Id := Underlying_Type (TagT); begin Tag_Assign := Make_Assignment_Statement (Loc, Name => Make_Selected_Component (Loc, Prefix => TagR, Selector_Name => New_Occurrence_Of (First_Tag_Component (Full_T), Loc)), Expression => Unchecked_Convert_To (RTE (RE_Tag), New_Occurrence_Of (Elists.Node (First_Elmt (Access_Disp_Table (Full_T))), Loc))); end; -- The previous assignment has to be done in any case Set_Assignment_OK (Name (Tag_Assign)); Insert_Action (N, Tag_Assign); end if; -- Generate an Adjust call if the object will be moved. In Ada 2005, -- the object may be inherently limited, in which case there is no -- Adjust procedure, and the object is built in place. In Ada 95, the -- object can be limited but not inherently limited if this allocator -- came from a return statement (we're allocating the result on the -- secondary stack). In that case, the object will be moved, so we do -- want to Adjust. if Needs_Finalization (DesigT) and then Needs_Finalization (T) and then not Aggr_In_Place and then not Is_Limited_View (T) then -- An unchecked conversion is needed in the classwide case because -- the designated type can be an ancestor of the subtype mark of -- the allocator. Adj_Call := Make_Adjust_Call (Obj_Ref => Unchecked_Convert_To (T, Make_Explicit_Dereference (Loc, Prefix => New_Occurrence_Of (Temp, Loc))), Typ => T); if Present (Adj_Call) then Insert_Action (N, Adj_Call); end if; end if; -- Note: the accessibility check must be inserted after the call to -- [Deep_]Adjust to ensure proper completion of the assignment. Apply_Accessibility_Check (Temp); Rewrite (N, New_Occurrence_Of (Temp, Loc)); Analyze_And_Resolve (N, PtrT); -- Ada 2005 (AI-251): Displace the pointer to reference the record -- component containing the secondary dispatch table of the interface -- type. if Is_Interface (Directly_Designated_Type (PtrT)) then Displace_Allocator_Pointer (N); end if; -- Always force the generation of a temporary for aggregates when -- generating C code, to simplify the work in the code generator. elsif Aggr_In_Place or else (Modify_Tree_For_C and then Nkind (Exp) = N_Aggregate) then Temp := Make_Temporary (Loc, 'P', N); Temp_Decl := Make_Object_Declaration (Loc, Defining_Identifier => Temp, Object_Definition => New_Occurrence_Of (PtrT, Loc), Expression => Make_Allocator (Loc, Expression => New_Occurrence_Of (Etype (Exp), Loc))); -- Copy the Comes_From_Source flag for the allocator we just built, -- since logically this allocator is a replacement of the original -- allocator node. This is for proper handling of restriction -- No_Implicit_Heap_Allocations. Set_Comes_From_Source (Expression (Temp_Decl), Comes_From_Source (N)); Set_No_Initialization (Expression (Temp_Decl)); Insert_Action (N, Temp_Decl); Build_Allocate_Deallocate_Proc (Temp_Decl, True); Convert_Aggr_In_Allocator (N, Temp_Decl, Exp); Rewrite (N, New_Occurrence_Of (Temp, Loc)); Analyze_And_Resolve (N, PtrT); elsif Is_Access_Type (T) and then Can_Never_Be_Null (T) then Install_Null_Excluding_Check (Exp); elsif Is_Access_Type (DesigT) and then Nkind (Exp) = N_Allocator and then Nkind (Expression (Exp)) /= N_Qualified_Expression then -- Apply constraint to designated subtype indication Apply_Constraint_Check (Expression (Exp), Designated_Type (DesigT), No_Sliding => True); if Nkind (Expression (Exp)) = N_Raise_Constraint_Error then -- Propagate constraint_error to enclosing allocator Rewrite (Exp, New_Copy (Expression (Exp))); end if; else Build_Allocate_Deallocate_Proc (N, True); -- If we have: -- type A is access T1; -- X : A := new T2'(...); -- T1 and T2 can be different subtypes, and we might need to check -- both constraints. First check against the type of the qualified -- expression. Apply_Constraint_Check (Exp, T, No_Sliding => True); if Do_Range_Check (Exp) then Generate_Range_Check (Exp, DesigT, CE_Range_Check_Failed); end if; -- A check is also needed in cases where the designated subtype is -- constrained and differs from the subtype given in the qualified -- expression. Note that the check on the qualified expression does -- not allow sliding, but this check does (a relaxation from Ada 83). if Is_Constrained (DesigT) and then not Subtypes_Statically_Match (T, DesigT) then Apply_Constraint_Check (Exp, DesigT, No_Sliding => False); if Do_Range_Check (Exp) then Generate_Range_Check (Exp, DesigT, CE_Range_Check_Failed); end if; end if; -- For an access to unconstrained packed array, GIGI needs to see an -- expression with a constrained subtype in order to compute the -- proper size for the allocator. if Is_Array_Type (T) and then not Is_Constrained (T) and then Is_Packed (T) then declare ConstrT : constant Entity_Id := Make_Temporary (Loc, 'A'); Internal_Exp : constant Node_Id := Relocate_Node (Exp); begin Insert_Action (Exp, Make_Subtype_Declaration (Loc, Defining_Identifier => ConstrT, Subtype_Indication => Make_Subtype_From_Expr (Internal_Exp, T))); Freeze_Itype (ConstrT, Exp); Rewrite (Exp, OK_Convert_To (ConstrT, Internal_Exp)); end; end if; -- Ada 2005 (AI-318-02): If the initialization expression is a call -- to a build-in-place function, then access to the allocated object -- must be passed to the function. Currently we limit such functions -- to those with constrained limited result subtypes, but eventually -- we plan to expand the allowed forms of functions that are treated -- as build-in-place. if Ada_Version >= Ada_2005 and then Is_Build_In_Place_Function_Call (Exp) then Make_Build_In_Place_Call_In_Allocator (N, Exp); end if; end if; exception when RE_Not_Available => return; end Expand_Allocator_Expression; ----------------------------- -- Expand_Array_Comparison -- ----------------------------- -- Expansion is only required in the case of array types. For the unpacked -- case, an appropriate runtime routine is called. For packed cases, and -- also in some other cases where a runtime routine cannot be called, the -- form of the expansion is: -- [body for greater_nn; boolean_expression] -- The body is built by Make_Array_Comparison_Op, and the form of the -- Boolean expression depends on the operator involved. procedure Expand_Array_Comparison (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Op1 : Node_Id := Left_Opnd (N); Op2 : Node_Id := Right_Opnd (N); Typ1 : constant Entity_Id := Base_Type (Etype (Op1)); Ctyp : constant Entity_Id := Component_Type (Typ1); Expr : Node_Id; Func_Body : Node_Id; Func_Name : Entity_Id; Comp : RE_Id; Byte_Addressable : constant Boolean := System_Storage_Unit = Byte'Size; -- True for byte addressable target function Length_Less_Than_4 (Opnd : Node_Id) return Boolean; -- Returns True if the length of the given operand is known to be less -- than 4. Returns False if this length is known to be four or greater -- or is not known at compile time. ------------------------ -- Length_Less_Than_4 -- ------------------------ function Length_Less_Than_4 (Opnd : Node_Id) return Boolean is Otyp : constant Entity_Id := Etype (Opnd); begin if Ekind (Otyp) = E_String_Literal_Subtype then return String_Literal_Length (Otyp) < 4; else declare Ityp : constant Entity_Id := Etype (First_Index (Otyp)); Lo : constant Node_Id := Type_Low_Bound (Ityp); Hi : constant Node_Id := Type_High_Bound (Ityp); Lov : Uint; Hiv : Uint; begin if Compile_Time_Known_Value (Lo) then Lov := Expr_Value (Lo); else return False; end if; if Compile_Time_Known_Value (Hi) then Hiv := Expr_Value (Hi); else return False; end if; return Hiv < Lov + 3; end; end if; end Length_Less_Than_4; -- Start of processing for Expand_Array_Comparison begin -- Deal first with unpacked case, where we can call a runtime routine -- except that we avoid this for targets for which are not addressable -- by bytes. if not Is_Bit_Packed_Array (Typ1) and then Byte_Addressable then -- The call we generate is: -- Compare_Array_xn[_Unaligned] -- (left'address, right'address, left'length, right'length) <op> 0 -- x = U for unsigned, S for signed -- n = 8,16,32,64 for component size -- Add _Unaligned if length < 4 and component size is 8. -- <op> is the standard comparison operator if Component_Size (Typ1) = 8 then if Length_Less_Than_4 (Op1) or else Length_Less_Than_4 (Op2) then if Is_Unsigned_Type (Ctyp) then Comp := RE_Compare_Array_U8_Unaligned; else Comp := RE_Compare_Array_S8_Unaligned; end if; else if Is_Unsigned_Type (Ctyp) then Comp := RE_Compare_Array_U8; else Comp := RE_Compare_Array_S8; end if; end if; elsif Component_Size (Typ1) = 16 then if Is_Unsigned_Type (Ctyp) then Comp := RE_Compare_Array_U16; else Comp := RE_Compare_Array_S16; end if; elsif Component_Size (Typ1) = 32 then if Is_Unsigned_Type (Ctyp) then Comp := RE_Compare_Array_U32; else Comp := RE_Compare_Array_S32; end if; else pragma Assert (Component_Size (Typ1) = 64); if Is_Unsigned_Type (Ctyp) then Comp := RE_Compare_Array_U64; else Comp := RE_Compare_Array_S64; end if; end if; if RTE_Available (Comp) then -- Expand to a call only if the runtime function is available, -- otherwise fall back to inline code. Remove_Side_Effects (Op1, Name_Req => True); Remove_Side_Effects (Op2, Name_Req => True); Rewrite (Op1, Make_Function_Call (Sloc (Op1), Name => New_Occurrence_Of (RTE (Comp), Loc), Parameter_Associations => New_List ( Make_Attribute_Reference (Loc, Prefix => Relocate_Node (Op1), Attribute_Name => Name_Address), Make_Attribute_Reference (Loc, Prefix => Relocate_Node (Op2), Attribute_Name => Name_Address), Make_Attribute_Reference (Loc, Prefix => Relocate_Node (Op1), Attribute_Name => Name_Length), Make_Attribute_Reference (Loc, Prefix => Relocate_Node (Op2), Attribute_Name => Name_Length)))); Rewrite (Op2, Make_Integer_Literal (Sloc (Op2), Intval => Uint_0)); Analyze_And_Resolve (Op1, Standard_Integer); Analyze_And_Resolve (Op2, Standard_Integer); return; end if; end if; -- Cases where we cannot make runtime call -- For (a <= b) we convert to not (a > b) if Chars (N) = Name_Op_Le then Rewrite (N, Make_Op_Not (Loc, Right_Opnd => Make_Op_Gt (Loc, Left_Opnd => Op1, Right_Opnd => Op2))); Analyze_And_Resolve (N, Standard_Boolean); return; -- For < the Boolean expression is -- greater__nn (op2, op1) elsif Chars (N) = Name_Op_Lt then Func_Body := Make_Array_Comparison_Op (Typ1, N); -- Switch operands Op1 := Right_Opnd (N); Op2 := Left_Opnd (N); -- For (a >= b) we convert to not (a < b) elsif Chars (N) = Name_Op_Ge then Rewrite (N, Make_Op_Not (Loc, Right_Opnd => Make_Op_Lt (Loc, Left_Opnd => Op1, Right_Opnd => Op2))); Analyze_And_Resolve (N, Standard_Boolean); return; -- For > the Boolean expression is -- greater__nn (op1, op2) else pragma Assert (Chars (N) = Name_Op_Gt); Func_Body := Make_Array_Comparison_Op (Typ1, N); end if; Func_Name := Defining_Unit_Name (Specification (Func_Body)); Expr := Make_Function_Call (Loc, Name => New_Occurrence_Of (Func_Name, Loc), Parameter_Associations => New_List (Op1, Op2)); Insert_Action (N, Func_Body); Rewrite (N, Expr); Analyze_And_Resolve (N, Standard_Boolean); end Expand_Array_Comparison; --------------------------- -- Expand_Array_Equality -- --------------------------- -- Expand an equality function for multi-dimensional arrays. Here is an -- example of such a function for Nb_Dimension = 2 -- function Enn (A : atyp; B : btyp) return boolean is -- begin -- if (A'length (1) = 0 or else A'length (2) = 0) -- and then -- (B'length (1) = 0 or else B'length (2) = 0) -- then -- return True; -- RM 4.5.2(22) -- end if; -- if A'length (1) /= B'length (1) -- or else -- A'length (2) /= B'length (2) -- then -- return False; -- RM 4.5.2(23) -- end if; -- declare -- A1 : Index_T1 := A'first (1); -- B1 : Index_T1 := B'first (1); -- begin -- loop -- declare -- A2 : Index_T2 := A'first (2); -- B2 : Index_T2 := B'first (2); -- begin -- loop -- if A (A1, A2) /= B (B1, B2) then -- return False; -- end if; -- exit when A2 = A'last (2); -- A2 := Index_T2'succ (A2); -- B2 := Index_T2'succ (B2); -- end loop; -- end; -- exit when A1 = A'last (1); -- A1 := Index_T1'succ (A1); -- B1 := Index_T1'succ (B1); -- end loop; -- end; -- return true; -- end Enn; -- Note on the formal types used (atyp and btyp). If either of the arrays -- is of a private type, we use the underlying type, and do an unchecked -- conversion of the actual. If either of the arrays has a bound depending -- on a discriminant, then we use the base type since otherwise we have an -- escaped discriminant in the function. -- If both arrays are constrained and have the same bounds, we can generate -- a loop with an explicit iteration scheme using a 'Range attribute over -- the first array. function Expand_Array_Equality (Nod : Node_Id; Lhs : Node_Id; Rhs : Node_Id; Bodies : List_Id; Typ : Entity_Id) return Node_Id is Loc : constant Source_Ptr := Sloc (Nod); Decls : constant List_Id := New_List; Index_List1 : constant List_Id := New_List; Index_List2 : constant List_Id := New_List; Actuals : List_Id; Formals : List_Id; Func_Name : Entity_Id; Func_Body : Node_Id; A : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uA); B : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uB); Ltyp : Entity_Id; Rtyp : Entity_Id; -- The parameter types to be used for the formals function Arr_Attr (Arr : Entity_Id; Nam : Name_Id; Num : Int) return Node_Id; -- This builds the attribute reference Arr'Nam (Expr) function Component_Equality (Typ : Entity_Id) return Node_Id; -- Create one statement to compare corresponding components, designated -- by a full set of indexes. function Get_Arg_Type (N : Node_Id) return Entity_Id; -- Given one of the arguments, computes the appropriate type to be used -- for that argument in the corresponding function formal function Handle_One_Dimension (N : Int; Index : Node_Id) return Node_Id; -- This procedure returns the following code -- -- declare -- Bn : Index_T := B'First (N); -- begin -- loop -- xxx -- exit when An = A'Last (N); -- An := Index_T'Succ (An) -- Bn := Index_T'Succ (Bn) -- end loop; -- end; -- -- If both indexes are constrained and identical, the procedure -- returns a simpler loop: -- -- for An in A'Range (N) loop -- xxx -- end loop -- -- N is the dimension for which we are generating a loop. Index is the -- N'th index node, whose Etype is Index_Type_n in the above code. The -- xxx statement is either the loop or declare for the next dimension -- or if this is the last dimension the comparison of corresponding -- components of the arrays. -- -- The actual way the code works is to return the comparison of -- corresponding components for the N+1 call. That's neater. function Test_Empty_Arrays return Node_Id; -- This function constructs the test for both arrays being empty -- (A'length (1) = 0 or else A'length (2) = 0 or else ...) -- and then -- (B'length (1) = 0 or else B'length (2) = 0 or else ...) function Test_Lengths_Correspond return Node_Id; -- This function constructs the test for arrays having different lengths -- in at least one index position, in which case the resulting code is: -- A'length (1) /= B'length (1) -- or else -- A'length (2) /= B'length (2) -- or else -- ... -------------- -- Arr_Attr -- -------------- function Arr_Attr (Arr : Entity_Id; Nam : Name_Id; Num : Int) return Node_Id is begin return Make_Attribute_Reference (Loc, Attribute_Name => Nam, Prefix => New_Occurrence_Of (Arr, Loc), Expressions => New_List (Make_Integer_Literal (Loc, Num))); end Arr_Attr; ------------------------ -- Component_Equality -- ------------------------ function Component_Equality (Typ : Entity_Id) return Node_Id is Test : Node_Id; L, R : Node_Id; begin -- if a(i1...) /= b(j1...) then return false; end if; L := Make_Indexed_Component (Loc, Prefix => Make_Identifier (Loc, Chars (A)), Expressions => Index_List1); R := Make_Indexed_Component (Loc, Prefix => Make_Identifier (Loc, Chars (B)), Expressions => Index_List2); Test := Expand_Composite_Equality (Nod, Component_Type (Typ), L, R, Decls); -- If some (sub)component is an unchecked_union, the whole operation -- will raise program error. if Nkind (Test) = N_Raise_Program_Error then -- This node is going to be inserted at a location where a -- statement is expected: clear its Etype so analysis will set -- it to the expected Standard_Void_Type. Set_Etype (Test, Empty); return Test; else return Make_Implicit_If_Statement (Nod, Condition => Make_Op_Not (Loc, Right_Opnd => Test), Then_Statements => New_List ( Make_Simple_Return_Statement (Loc, Expression => New_Occurrence_Of (Standard_False, Loc)))); end if; end Component_Equality; ------------------ -- Get_Arg_Type -- ------------------ function Get_Arg_Type (N : Node_Id) return Entity_Id is T : Entity_Id; X : Node_Id; begin T := Etype (N); if No (T) then return Typ; else T := Underlying_Type (T); X := First_Index (T); while Present (X) loop if Denotes_Discriminant (Type_Low_Bound (Etype (X))) or else Denotes_Discriminant (Type_High_Bound (Etype (X))) then T := Base_Type (T); exit; end if; Next_Index (X); end loop; return T; end if; end Get_Arg_Type; -------------------------- -- Handle_One_Dimension -- --------------------------- function Handle_One_Dimension (N : Int; Index : Node_Id) return Node_Id is Need_Separate_Indexes : constant Boolean := Ltyp /= Rtyp or else not Is_Constrained (Ltyp); -- If the index types are identical, and we are working with -- constrained types, then we can use the same index for both -- of the arrays. An : constant Entity_Id := Make_Temporary (Loc, 'A'); Bn : Entity_Id; Index_T : Entity_Id; Stm_List : List_Id; Loop_Stm : Node_Id; begin if N > Number_Dimensions (Ltyp) then return Component_Equality (Ltyp); end if; -- Case where we generate a loop Index_T := Base_Type (Etype (Index)); if Need_Separate_Indexes then Bn := Make_Temporary (Loc, 'B'); else Bn := An; end if; Append (New_Occurrence_Of (An, Loc), Index_List1); Append (New_Occurrence_Of (Bn, Loc), Index_List2); Stm_List := New_List ( Handle_One_Dimension (N + 1, Next_Index (Index))); if Need_Separate_Indexes then -- Generate guard for loop, followed by increments of indexes Append_To (Stm_List, Make_Exit_Statement (Loc, Condition => Make_Op_Eq (Loc, Left_Opnd => New_Occurrence_Of (An, Loc), Right_Opnd => Arr_Attr (A, Name_Last, N)))); Append_To (Stm_List, Make_Assignment_Statement (Loc, Name => New_Occurrence_Of (An, Loc), Expression => Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Index_T, Loc), Attribute_Name => Name_Succ, Expressions => New_List ( New_Occurrence_Of (An, Loc))))); Append_To (Stm_List, Make_Assignment_Statement (Loc, Name => New_Occurrence_Of (Bn, Loc), Expression => Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Index_T, Loc), Attribute_Name => Name_Succ, Expressions => New_List ( New_Occurrence_Of (Bn, Loc))))); end if; -- If separate indexes, we need a declare block for An and Bn, and a -- loop without an iteration scheme. if Need_Separate_Indexes then Loop_Stm := Make_Implicit_Loop_Statement (Nod, Statements => Stm_List); return Make_Block_Statement (Loc, Declarations => New_List ( Make_Object_Declaration (Loc, Defining_Identifier => An, Object_Definition => New_Occurrence_Of (Index_T, Loc), Expression => Arr_Attr (A, Name_First, N)), Make_Object_Declaration (Loc, Defining_Identifier => Bn, Object_Definition => New_Occurrence_Of (Index_T, Loc), Expression => Arr_Attr (B, Name_First, N))), Handled_Statement_Sequence => Make_Handled_Sequence_Of_Statements (Loc, Statements => New_List (Loop_Stm))); -- If no separate indexes, return loop statement with explicit -- iteration scheme on its own else Loop_Stm := Make_Implicit_Loop_Statement (Nod, Statements => Stm_List, Iteration_Scheme => Make_Iteration_Scheme (Loc, Loop_Parameter_Specification => Make_Loop_Parameter_Specification (Loc, Defining_Identifier => An, Discrete_Subtype_Definition => Arr_Attr (A, Name_Range, N)))); return Loop_Stm; end if; end Handle_One_Dimension; ----------------------- -- Test_Empty_Arrays -- ----------------------- function Test_Empty_Arrays return Node_Id is Alist : Node_Id; Blist : Node_Id; Atest : Node_Id; Btest : Node_Id; begin Alist := Empty; Blist := Empty; for J in 1 .. Number_Dimensions (Ltyp) loop Atest := Make_Op_Eq (Loc, Left_Opnd => Arr_Attr (A, Name_Length, J), Right_Opnd => Make_Integer_Literal (Loc, 0)); Btest := Make_Op_Eq (Loc, Left_Opnd => Arr_Attr (B, Name_Length, J), Right_Opnd => Make_Integer_Literal (Loc, 0)); if No (Alist) then Alist := Atest; Blist := Btest; else Alist := Make_Or_Else (Loc, Left_Opnd => Relocate_Node (Alist), Right_Opnd => Atest); Blist := Make_Or_Else (Loc, Left_Opnd => Relocate_Node (Blist), Right_Opnd => Btest); end if; end loop; return Make_And_Then (Loc, Left_Opnd => Alist, Right_Opnd => Blist); end Test_Empty_Arrays; ----------------------------- -- Test_Lengths_Correspond -- ----------------------------- function Test_Lengths_Correspond return Node_Id is Result : Node_Id; Rtest : Node_Id; begin Result := Empty; for J in 1 .. Number_Dimensions (Ltyp) loop Rtest := Make_Op_Ne (Loc, Left_Opnd => Arr_Attr (A, Name_Length, J), Right_Opnd => Arr_Attr (B, Name_Length, J)); if No (Result) then Result := Rtest; else Result := Make_Or_Else (Loc, Left_Opnd => Relocate_Node (Result), Right_Opnd => Rtest); end if; end loop; return Result; end Test_Lengths_Correspond; -- Start of processing for Expand_Array_Equality begin Ltyp := Get_Arg_Type (Lhs); Rtyp := Get_Arg_Type (Rhs); -- For now, if the argument types are not the same, go to the base type, -- since the code assumes that the formals have the same type. This is -- fixable in future ??? if Ltyp /= Rtyp then Ltyp := Base_Type (Ltyp); Rtyp := Base_Type (Rtyp); pragma Assert (Ltyp = Rtyp); end if; -- Build list of formals for function Formals := New_List ( Make_Parameter_Specification (Loc, Defining_Identifier => A, Parameter_Type => New_Occurrence_Of (Ltyp, Loc)), Make_Parameter_Specification (Loc, Defining_Identifier => B, Parameter_Type => New_Occurrence_Of (Rtyp, Loc))); Func_Name := Make_Temporary (Loc, 'E'); -- Build statement sequence for function Func_Body := Make_Subprogram_Body (Loc, Specification => Make_Function_Specification (Loc, Defining_Unit_Name => Func_Name, Parameter_Specifications => Formals, Result_Definition => New_Occurrence_Of (Standard_Boolean, Loc)), Declarations => Decls, Handled_Statement_Sequence => Make_Handled_Sequence_Of_Statements (Loc, Statements => New_List ( Make_Implicit_If_Statement (Nod, Condition => Test_Empty_Arrays, Then_Statements => New_List ( Make_Simple_Return_Statement (Loc, Expression => New_Occurrence_Of (Standard_True, Loc)))), Make_Implicit_If_Statement (Nod, Condition => Test_Lengths_Correspond, Then_Statements => New_List ( Make_Simple_Return_Statement (Loc, Expression => New_Occurrence_Of (Standard_False, Loc)))), Handle_One_Dimension (1, First_Index (Ltyp)), Make_Simple_Return_Statement (Loc, Expression => New_Occurrence_Of (Standard_True, Loc))))); Set_Has_Completion (Func_Name, True); Set_Is_Inlined (Func_Name); -- If the array type is distinct from the type of the arguments, it -- is the full view of a private type. Apply an unchecked conversion -- to insure that analysis of the call succeeds. declare L, R : Node_Id; begin L := Lhs; R := Rhs; if No (Etype (Lhs)) or else Base_Type (Etype (Lhs)) /= Base_Type (Ltyp) then L := OK_Convert_To (Ltyp, Lhs); end if; if No (Etype (Rhs)) or else Base_Type (Etype (Rhs)) /= Base_Type (Rtyp) then R := OK_Convert_To (Rtyp, Rhs); end if; Actuals := New_List (L, R); end; Append_To (Bodies, Func_Body); return Make_Function_Call (Loc, Name => New_Occurrence_Of (Func_Name, Loc), Parameter_Associations => Actuals); end Expand_Array_Equality; ----------------------------- -- Expand_Boolean_Operator -- ----------------------------- -- Note that we first get the actual subtypes of the operands, since we -- always want to deal with types that have bounds. procedure Expand_Boolean_Operator (N : Node_Id) is Typ : constant Entity_Id := Etype (N); begin -- Special case of bit packed array where both operands are known to be -- properly aligned. In this case we use an efficient run time routine -- to carry out the operation (see System.Bit_Ops). if Is_Bit_Packed_Array (Typ) and then not Is_Possibly_Unaligned_Object (Left_Opnd (N)) and then not Is_Possibly_Unaligned_Object (Right_Opnd (N)) then Expand_Packed_Boolean_Operator (N); return; end if; -- For the normal non-packed case, the general expansion is to build -- function for carrying out the comparison (use Make_Boolean_Array_Op) -- and then inserting it into the tree. The original operator node is -- then rewritten as a call to this function. We also use this in the -- packed case if either operand is a possibly unaligned object. declare Loc : constant Source_Ptr := Sloc (N); L : constant Node_Id := Relocate_Node (Left_Opnd (N)); R : constant Node_Id := Relocate_Node (Right_Opnd (N)); Func_Body : Node_Id; Func_Name : Entity_Id; begin Convert_To_Actual_Subtype (L); Convert_To_Actual_Subtype (R); Ensure_Defined (Etype (L), N); Ensure_Defined (Etype (R), N); Apply_Length_Check (R, Etype (L)); if Nkind (N) = N_Op_Xor then Silly_Boolean_Array_Xor_Test (N, Etype (L)); end if; if Nkind (Parent (N)) = N_Assignment_Statement and then Safe_In_Place_Array_Op (Name (Parent (N)), L, R) then Build_Boolean_Array_Proc_Call (Parent (N), L, R); elsif Nkind (Parent (N)) = N_Op_Not and then Nkind (N) = N_Op_And and then Nkind (Parent (Parent (N))) = N_Assignment_Statement and then Safe_In_Place_Array_Op (Name (Parent (Parent (N))), L, R) then return; else Func_Body := Make_Boolean_Array_Op (Etype (L), N); Func_Name := Defining_Unit_Name (Specification (Func_Body)); Insert_Action (N, Func_Body); -- Now rewrite the expression with a call Rewrite (N, Make_Function_Call (Loc, Name => New_Occurrence_Of (Func_Name, Loc), Parameter_Associations => New_List ( L, Make_Type_Conversion (Loc, New_Occurrence_Of (Etype (L), Loc), R)))); Analyze_And_Resolve (N, Typ); end if; end; end Expand_Boolean_Operator; ------------------------------------------------ -- Expand_Compare_Minimize_Eliminate_Overflow -- ------------------------------------------------ procedure Expand_Compare_Minimize_Eliminate_Overflow (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Result_Type : constant Entity_Id := Etype (N); -- Capture result type (could be a derived boolean type) Llo, Lhi : Uint; Rlo, Rhi : Uint; LLIB : constant Entity_Id := Base_Type (Standard_Long_Long_Integer); -- Entity for Long_Long_Integer'Base Check : constant Overflow_Mode_Type := Overflow_Check_Mode; -- Current overflow checking mode procedure Set_True; procedure Set_False; -- These procedures rewrite N with an occurrence of Standard_True or -- Standard_False, and then makes a call to Warn_On_Known_Condition. --------------- -- Set_False -- --------------- procedure Set_False is begin Rewrite (N, New_Occurrence_Of (Standard_False, Loc)); Warn_On_Known_Condition (N); end Set_False; -------------- -- Set_True -- -------------- procedure Set_True is begin Rewrite (N, New_Occurrence_Of (Standard_True, Loc)); Warn_On_Known_Condition (N); end Set_True; -- Start of processing for Expand_Compare_Minimize_Eliminate_Overflow begin -- Nothing to do unless we have a comparison operator with operands -- that are signed integer types, and we are operating in either -- MINIMIZED or ELIMINATED overflow checking mode. if Nkind (N) not in N_Op_Compare or else Check not in Minimized_Or_Eliminated or else not Is_Signed_Integer_Type (Etype (Left_Opnd (N))) then return; end if; -- OK, this is the case we are interested in. First step is to process -- our operands using the Minimize_Eliminate circuitry which applies -- this processing to the two operand subtrees. Minimize_Eliminate_Overflows (Left_Opnd (N), Llo, Lhi, Top_Level => False); Minimize_Eliminate_Overflows (Right_Opnd (N), Rlo, Rhi, Top_Level => False); -- See if the range information decides the result of the comparison. -- We can only do this if we in fact have full range information (which -- won't be the case if either operand is bignum at this stage). if Llo /= No_Uint and then Rlo /= No_Uint then case N_Op_Compare (Nkind (N)) is when N_Op_Eq => if Llo = Lhi and then Rlo = Rhi and then Llo = Rlo then Set_True; elsif Llo > Rhi or else Lhi < Rlo then Set_False; end if; when N_Op_Ge => if Llo >= Rhi then Set_True; elsif Lhi < Rlo then Set_False; end if; when N_Op_Gt => if Llo > Rhi then Set_True; elsif Lhi <= Rlo then Set_False; end if; when N_Op_Le => if Llo > Rhi then Set_False; elsif Lhi <= Rlo then Set_True; end if; when N_Op_Lt => if Llo >= Rhi then Set_False; elsif Lhi < Rlo then Set_True; end if; when N_Op_Ne => if Llo = Lhi and then Rlo = Rhi and then Llo = Rlo then Set_False; elsif Llo > Rhi or else Lhi < Rlo then Set_True; end if; end case; -- All done if we did the rewrite if Nkind (N) not in N_Op_Compare then return; end if; end if; -- Otherwise, time to do the comparison declare Ltype : constant Entity_Id := Etype (Left_Opnd (N)); Rtype : constant Entity_Id := Etype (Right_Opnd (N)); begin -- If the two operands have the same signed integer type we are -- all set, nothing more to do. This is the case where either -- both operands were unchanged, or we rewrote both of them to -- be Long_Long_Integer. -- Note: Entity for the comparison may be wrong, but it's not worth -- the effort to change it, since the back end does not use it. if Is_Signed_Integer_Type (Ltype) and then Base_Type (Ltype) = Base_Type (Rtype) then return; -- Here if bignums are involved (can only happen in ELIMINATED mode) elsif Is_RTE (Ltype, RE_Bignum) or else Is_RTE (Rtype, RE_Bignum) then declare Left : Node_Id := Left_Opnd (N); Right : Node_Id := Right_Opnd (N); -- Bignum references for left and right operands begin if not Is_RTE (Ltype, RE_Bignum) then Left := Convert_To_Bignum (Left); elsif not Is_RTE (Rtype, RE_Bignum) then Right := Convert_To_Bignum (Right); end if; -- We rewrite our node with: -- do -- Bnn : Result_Type; -- declare -- M : Mark_Id := SS_Mark; -- begin -- Bnn := Big_xx (Left, Right); (xx = EQ, NT etc) -- SS_Release (M); -- end; -- in -- Bnn -- end declare Blk : constant Node_Id := Make_Bignum_Block (Loc); Bnn : constant Entity_Id := Make_Temporary (Loc, 'B', N); Ent : RE_Id; begin case N_Op_Compare (Nkind (N)) is when N_Op_Eq => Ent := RE_Big_EQ; when N_Op_Ge => Ent := RE_Big_GE; when N_Op_Gt => Ent := RE_Big_GT; when N_Op_Le => Ent := RE_Big_LE; when N_Op_Lt => Ent := RE_Big_LT; when N_Op_Ne => Ent := RE_Big_NE; end case; -- Insert assignment to Bnn into the bignum block Insert_Before (First (Statements (Handled_Statement_Sequence (Blk))), Make_Assignment_Statement (Loc, Name => New_Occurrence_Of (Bnn, Loc), Expression => Make_Function_Call (Loc, Name => New_Occurrence_Of (RTE (Ent), Loc), Parameter_Associations => New_List (Left, Right)))); -- Now do the rewrite with expression actions Rewrite (N, Make_Expression_With_Actions (Loc, Actions => New_List ( Make_Object_Declaration (Loc, Defining_Identifier => Bnn, Object_Definition => New_Occurrence_Of (Result_Type, Loc)), Blk), Expression => New_Occurrence_Of (Bnn, Loc))); Analyze_And_Resolve (N, Result_Type); end; end; -- No bignums involved, but types are different, so we must have -- rewritten one of the operands as a Long_Long_Integer but not -- the other one. -- If left operand is Long_Long_Integer, convert right operand -- and we are done (with a comparison of two Long_Long_Integers). elsif Ltype = LLIB then Convert_To_And_Rewrite (LLIB, Right_Opnd (N)); Analyze_And_Resolve (Right_Opnd (N), LLIB, Suppress => All_Checks); return; -- If right operand is Long_Long_Integer, convert left operand -- and we are done (with a comparison of two Long_Long_Integers). -- This is the only remaining possibility else pragma Assert (Rtype = LLIB); Convert_To_And_Rewrite (LLIB, Left_Opnd (N)); Analyze_And_Resolve (Left_Opnd (N), LLIB, Suppress => All_Checks); return; end if; end; end Expand_Compare_Minimize_Eliminate_Overflow; ------------------------------- -- Expand_Composite_Equality -- ------------------------------- -- This function is only called for comparing internal fields of composite -- types when these fields are themselves composites. This is a special -- case because it is not possible to respect normal Ada visibility rules. function Expand_Composite_Equality (Nod : Node_Id; Typ : Entity_Id; Lhs : Node_Id; Rhs : Node_Id; Bodies : List_Id) return Node_Id is Loc : constant Source_Ptr := Sloc (Nod); Full_Type : Entity_Id; Prim : Elmt_Id; Eq_Op : Entity_Id; function Find_Primitive_Eq return Node_Id; -- AI05-0123: Locate primitive equality for type if it exists, and -- build the corresponding call. If operation is abstract, replace -- call with an explicit raise. Return Empty if there is no primitive. ----------------------- -- Find_Primitive_Eq -- ----------------------- function Find_Primitive_Eq return Node_Id is Prim_E : Elmt_Id; Prim : Node_Id; begin Prim_E := First_Elmt (Collect_Primitive_Operations (Typ)); while Present (Prim_E) loop Prim := Node (Prim_E); -- Locate primitive equality with the right signature if Chars (Prim) = Name_Op_Eq and then Etype (First_Formal (Prim)) = Etype (Next_Formal (First_Formal (Prim))) and then Etype (Prim) = Standard_Boolean then if Is_Abstract_Subprogram (Prim) then return Make_Raise_Program_Error (Loc, Reason => PE_Explicit_Raise); else return Make_Function_Call (Loc, Name => New_Occurrence_Of (Prim, Loc), Parameter_Associations => New_List (Lhs, Rhs)); end if; end if; Next_Elmt (Prim_E); end loop; -- If not found, predefined operation will be used return Empty; end Find_Primitive_Eq; -- Start of processing for Expand_Composite_Equality begin if Is_Private_Type (Typ) then Full_Type := Underlying_Type (Typ); else Full_Type := Typ; end if; -- If the private type has no completion the context may be the -- expansion of a composite equality for a composite type with some -- still incomplete components. The expression will not be analyzed -- until the enclosing type is completed, at which point this will be -- properly expanded, unless there is a bona fide completion error. if No (Full_Type) then return Make_Op_Eq (Loc, Left_Opnd => Lhs, Right_Opnd => Rhs); end if; Full_Type := Base_Type (Full_Type); -- When the base type itself is private, use the full view to expand -- the composite equality. if Is_Private_Type (Full_Type) then Full_Type := Underlying_Type (Full_Type); end if; -- Case of array types if Is_Array_Type (Full_Type) then -- If the operand is an elementary type other than a floating-point -- type, then we can simply use the built-in block bitwise equality, -- since the predefined equality operators always apply and bitwise -- equality is fine for all these cases. if Is_Elementary_Type (Component_Type (Full_Type)) and then not Is_Floating_Point_Type (Component_Type (Full_Type)) then return Make_Op_Eq (Loc, Left_Opnd => Lhs, Right_Opnd => Rhs); -- For composite component types, and floating-point types, use the -- expansion. This deals with tagged component types (where we use -- the applicable equality routine) and floating-point, (where we -- need to worry about negative zeroes), and also the case of any -- composite type recursively containing such fields. else return Expand_Array_Equality (Nod, Lhs, Rhs, Bodies, Full_Type); end if; -- Case of tagged record types elsif Is_Tagged_Type (Full_Type) then -- Call the primitive operation "=" of this type if Is_Class_Wide_Type (Full_Type) then Full_Type := Root_Type (Full_Type); end if; -- If this is derived from an untagged private type completed with a -- tagged type, it does not have a full view, so we use the primitive -- operations of the private type. This check should no longer be -- necessary when these types receive their full views ??? if Is_Private_Type (Typ) and then not Is_Tagged_Type (Typ) and then not Is_Controlled (Typ) and then Is_Derived_Type (Typ) and then No (Full_View (Typ)) then Prim := First_Elmt (Collect_Primitive_Operations (Typ)); else Prim := First_Elmt (Primitive_Operations (Full_Type)); end if; loop Eq_Op := Node (Prim); exit when Chars (Eq_Op) = Name_Op_Eq and then Etype (First_Formal (Eq_Op)) = Etype (Next_Formal (First_Formal (Eq_Op))) and then Base_Type (Etype (Eq_Op)) = Standard_Boolean; Next_Elmt (Prim); pragma Assert (Present (Prim)); end loop; Eq_Op := Node (Prim); return Make_Function_Call (Loc, Name => New_Occurrence_Of (Eq_Op, Loc), Parameter_Associations => New_List (Unchecked_Convert_To (Etype (First_Formal (Eq_Op)), Lhs), Unchecked_Convert_To (Etype (First_Formal (Eq_Op)), Rhs))); -- Case of untagged record types elsif Is_Record_Type (Full_Type) then Eq_Op := TSS (Full_Type, TSS_Composite_Equality); if Present (Eq_Op) then if Etype (First_Formal (Eq_Op)) /= Full_Type then -- Inherited equality from parent type. Convert the actuals to -- match signature of operation. declare T : constant Entity_Id := Etype (First_Formal (Eq_Op)); begin return Make_Function_Call (Loc, Name => New_Occurrence_Of (Eq_Op, Loc), Parameter_Associations => New_List ( OK_Convert_To (T, Lhs), OK_Convert_To (T, Rhs))); end; else -- Comparison between Unchecked_Union components if Is_Unchecked_Union (Full_Type) then declare Lhs_Type : Node_Id := Full_Type; Rhs_Type : Node_Id := Full_Type; Lhs_Discr_Val : Node_Id; Rhs_Discr_Val : Node_Id; begin -- Lhs subtype if Nkind (Lhs) = N_Selected_Component then Lhs_Type := Etype (Entity (Selector_Name (Lhs))); end if; -- Rhs subtype if Nkind (Rhs) = N_Selected_Component then Rhs_Type := Etype (Entity (Selector_Name (Rhs))); end if; -- Lhs of the composite equality if Is_Constrained (Lhs_Type) then -- Since the enclosing record type can never be an -- Unchecked_Union (this code is executed for records -- that do not have variants), we may reference its -- discriminant(s). if Nkind (Lhs) = N_Selected_Component and then Has_Per_Object_Constraint (Entity (Selector_Name (Lhs))) then Lhs_Discr_Val := Make_Selected_Component (Loc, Prefix => Prefix (Lhs), Selector_Name => New_Copy (Get_Discriminant_Value (First_Discriminant (Lhs_Type), Lhs_Type, Stored_Constraint (Lhs_Type)))); else Lhs_Discr_Val := New_Copy (Get_Discriminant_Value (First_Discriminant (Lhs_Type), Lhs_Type, Stored_Constraint (Lhs_Type))); end if; else -- It is not possible to infer the discriminant since -- the subtype is not constrained. return Make_Raise_Program_Error (Loc, Reason => PE_Unchecked_Union_Restriction); end if; -- Rhs of the composite equality if Is_Constrained (Rhs_Type) then if Nkind (Rhs) = N_Selected_Component and then Has_Per_Object_Constraint (Entity (Selector_Name (Rhs))) then Rhs_Discr_Val := Make_Selected_Component (Loc, Prefix => Prefix (Rhs), Selector_Name => New_Copy (Get_Discriminant_Value (First_Discriminant (Rhs_Type), Rhs_Type, Stored_Constraint (Rhs_Type)))); else Rhs_Discr_Val := New_Copy (Get_Discriminant_Value (First_Discriminant (Rhs_Type), Rhs_Type, Stored_Constraint (Rhs_Type))); end if; else return Make_Raise_Program_Error (Loc, Reason => PE_Unchecked_Union_Restriction); end if; -- Call the TSS equality function with the inferred -- discriminant values. return Make_Function_Call (Loc, Name => New_Occurrence_Of (Eq_Op, Loc), Parameter_Associations => New_List ( Lhs, Rhs, Lhs_Discr_Val, Rhs_Discr_Val)); end; -- All cases other than comparing Unchecked_Union types else declare T : constant Entity_Id := Etype (First_Formal (Eq_Op)); begin return Make_Function_Call (Loc, Name => New_Occurrence_Of (Eq_Op, Loc), Parameter_Associations => New_List ( OK_Convert_To (T, Lhs), OK_Convert_To (T, Rhs))); end; end if; end if; -- Equality composes in Ada 2012 for untagged record types. It also -- composes for bounded strings, because they are part of the -- predefined environment. We could make it compose for bounded -- strings by making them tagged, or by making sure all subcomponents -- are set to the same value, even when not used. Instead, we have -- this special case in the compiler, because it's more efficient. elsif Ada_Version >= Ada_2012 or else Is_Bounded_String (Typ) then -- If no TSS has been created for the type, check whether there is -- a primitive equality declared for it. declare Op : constant Node_Id := Find_Primitive_Eq; begin -- Use user-defined primitive if it exists, otherwise use -- predefined equality. if Present (Op) then return Op; else return Make_Op_Eq (Loc, Lhs, Rhs); end if; end; else return Expand_Record_Equality (Nod, Full_Type, Lhs, Rhs, Bodies); end if; -- Non-composite types (always use predefined equality) else return Make_Op_Eq (Loc, Left_Opnd => Lhs, Right_Opnd => Rhs); end if; end Expand_Composite_Equality; ------------------------ -- Expand_Concatenate -- ------------------------ procedure Expand_Concatenate (Cnode : Node_Id; Opnds : List_Id) is Loc : constant Source_Ptr := Sloc (Cnode); Atyp : constant Entity_Id := Base_Type (Etype (Cnode)); -- Result type of concatenation Ctyp : constant Entity_Id := Base_Type (Component_Type (Etype (Cnode))); -- Component type. Elements of this component type can appear as one -- of the operands of concatenation as well as arrays. Istyp : constant Entity_Id := Etype (First_Index (Atyp)); -- Index subtype Ityp : constant Entity_Id := Base_Type (Istyp); -- Index type. This is the base type of the index subtype, and is used -- for all computed bounds (which may be out of range of Istyp in the -- case of null ranges). Artyp : Entity_Id; -- This is the type we use to do arithmetic to compute the bounds and -- lengths of operands. The choice of this type is a little subtle and -- is discussed in a separate section at the start of the body code. Concatenation_Error : exception; -- Raised if concatenation is sure to raise a CE Result_May_Be_Null : Boolean := True; -- Reset to False if at least one operand is encountered which is known -- at compile time to be non-null. Used for handling the special case -- of setting the high bound to the last operand high bound for a null -- result, thus ensuring a proper high bound in the super-flat case. N : constant Nat := List_Length (Opnds); -- Number of concatenation operands including possibly null operands NN : Nat := 0; -- Number of operands excluding any known to be null, except that the -- last operand is always retained, in case it provides the bounds for -- a null result. Opnd : Node_Id; -- Current operand being processed in the loop through operands. After -- this loop is complete, always contains the last operand (which is not -- the same as Operands (NN), since null operands are skipped). -- Arrays describing the operands, only the first NN entries of each -- array are set (NN < N when we exclude known null operands). Is_Fixed_Length : array (1 .. N) of Boolean; -- True if length of corresponding operand known at compile time Operands : array (1 .. N) of Node_Id; -- Set to the corresponding entry in the Opnds list (but note that null -- operands are excluded, so not all entries in the list are stored). Fixed_Length : array (1 .. N) of Uint; -- Set to length of operand. Entries in this array are set only if the -- corresponding entry in Is_Fixed_Length is True. Opnd_Low_Bound : array (1 .. N) of Node_Id; -- Set to lower bound of operand. Either an integer literal in the case -- where the bound is known at compile time, else actual lower bound. -- The operand low bound is of type Ityp. Var_Length : array (1 .. N) of Entity_Id; -- Set to an entity of type Natural that contains the length of an -- operand whose length is not known at compile time. Entries in this -- array are set only if the corresponding entry in Is_Fixed_Length -- is False. The entity is of type Artyp. Aggr_Length : array (0 .. N) of Node_Id; -- The J'th entry in an expression node that represents the total length -- of operands 1 through J. It is either an integer literal node, or a -- reference to a constant entity with the right value, so it is fine -- to just do a Copy_Node to get an appropriate copy. The extra zero'th -- entry always is set to zero. The length is of type Artyp. Low_Bound : Node_Id; -- A tree node representing the low bound of the result (of type Ityp). -- This is either an integer literal node, or an identifier reference to -- a constant entity initialized to the appropriate value. Last_Opnd_Low_Bound : Node_Id; -- A tree node representing the low bound of the last operand. This -- need only be set if the result could be null. It is used for the -- special case of setting the right low bound for a null result. -- This is of type Ityp. Last_Opnd_High_Bound : Node_Id; -- A tree node representing the high bound of the last operand. This -- need only be set if the result could be null. It is used for the -- special case of setting the right high bound for a null result. -- This is of type Ityp. High_Bound : Node_Id; -- A tree node representing the high bound of the result (of type Ityp) Result : Node_Id; -- Result of the concatenation (of type Ityp) Actions : constant List_Id := New_List; -- Collect actions to be inserted Known_Non_Null_Operand_Seen : Boolean; -- Set True during generation of the assignments of operands into -- result once an operand known to be non-null has been seen. function Make_Artyp_Literal (Val : Nat) return Node_Id; -- This function makes an N_Integer_Literal node that is returned in -- analyzed form with the type set to Artyp. Importantly this literal -- is not flagged as static, so that if we do computations with it that -- result in statically detected out of range conditions, we will not -- generate error messages but instead warning messages. function To_Artyp (X : Node_Id) return Node_Id; -- Given a node of type Ityp, returns the corresponding value of type -- Artyp. For non-enumeration types, this is a plain integer conversion. -- For enum types, the Pos of the value is returned. function To_Ityp (X : Node_Id) return Node_Id; -- The inverse function (uses Val in the case of enumeration types) ------------------------ -- Make_Artyp_Literal -- ------------------------ function Make_Artyp_Literal (Val : Nat) return Node_Id is Result : constant Node_Id := Make_Integer_Literal (Loc, Val); begin Set_Etype (Result, Artyp); Set_Analyzed (Result, True); Set_Is_Static_Expression (Result, False); return Result; end Make_Artyp_Literal; -------------- -- To_Artyp -- -------------- function To_Artyp (X : Node_Id) return Node_Id is begin if Ityp = Base_Type (Artyp) then return X; elsif Is_Enumeration_Type (Ityp) then return Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Ityp, Loc), Attribute_Name => Name_Pos, Expressions => New_List (X)); else return Convert_To (Artyp, X); end if; end To_Artyp; ------------- -- To_Ityp -- ------------- function To_Ityp (X : Node_Id) return Node_Id is begin if Is_Enumeration_Type (Ityp) then return Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Ityp, Loc), Attribute_Name => Name_Val, Expressions => New_List (X)); -- Case where we will do a type conversion else if Ityp = Base_Type (Artyp) then return X; else return Convert_To (Ityp, X); end if; end if; end To_Ityp; -- Local Declarations Lib_Level_Target : constant Boolean := Nkind (Parent (Cnode)) = N_Object_Declaration and then Is_Library_Level_Entity (Defining_Identifier (Parent (Cnode))); -- If the concatenation declares a library level entity, we call the -- built-in concatenation routines to prevent code bloat, regardless -- of optimization level. This is space-efficient, and prevent linking -- problems when units are compiled with different optimizations. Opnd_Typ : Entity_Id; Ent : Entity_Id; Len : Uint; J : Nat; Clen : Node_Id; Set : Boolean; -- Start of processing for Expand_Concatenate begin -- Choose an appropriate computational type -- We will be doing calculations of lengths and bounds in this routine -- and computing one from the other in some cases, e.g. getting the high -- bound by adding the length-1 to the low bound. -- We can't just use the index type, or even its base type for this -- purpose for two reasons. First it might be an enumeration type which -- is not suitable for computations of any kind, and second it may -- simply not have enough range. For example if the index type is -- -128..+127 then lengths can be up to 256, which is out of range of -- the type. -- For enumeration types, we can simply use Standard_Integer, this is -- sufficient since the actual number of enumeration literals cannot -- possibly exceed the range of integer (remember we will be doing the -- arithmetic with POS values, not representation values). if Is_Enumeration_Type (Ityp) then Artyp := Standard_Integer; -- If index type is Positive, we use the standard unsigned type, to give -- more room on the top of the range, obviating the need for an overflow -- check when creating the upper bound. This is needed to avoid junk -- overflow checks in the common case of String types. -- ??? Disabled for now -- elsif Istyp = Standard_Positive then -- Artyp := Standard_Unsigned; -- For modular types, we use a 32-bit modular type for types whose size -- is in the range 1-31 bits. For 32-bit unsigned types, we use the -- identity type, and for larger unsigned types we use 64-bits. elsif Is_Modular_Integer_Type (Ityp) then if RM_Size (Ityp) < RM_Size (Standard_Unsigned) then Artyp := Standard_Unsigned; elsif RM_Size (Ityp) = RM_Size (Standard_Unsigned) then Artyp := Ityp; else Artyp := RTE (RE_Long_Long_Unsigned); end if; -- Similar treatment for signed types else if RM_Size (Ityp) < RM_Size (Standard_Integer) then Artyp := Standard_Integer; elsif RM_Size (Ityp) = RM_Size (Standard_Integer) then Artyp := Ityp; else Artyp := Standard_Long_Long_Integer; end if; end if; -- Supply dummy entry at start of length array Aggr_Length (0) := Make_Artyp_Literal (0); -- Go through operands setting up the above arrays J := 1; while J <= N loop Opnd := Remove_Head (Opnds); Opnd_Typ := Etype (Opnd); -- The parent got messed up when we put the operands in a list, -- so now put back the proper parent for the saved operand, that -- is to say the concatenation node, to make sure that each operand -- is seen as a subexpression, e.g. if actions must be inserted. Set_Parent (Opnd, Cnode); -- Set will be True when we have setup one entry in the array Set := False; -- Singleton element (or character literal) case if Base_Type (Opnd_Typ) = Ctyp then NN := NN + 1; Operands (NN) := Opnd; Is_Fixed_Length (NN) := True; Fixed_Length (NN) := Uint_1; Result_May_Be_Null := False; -- Set low bound of operand (no need to set Last_Opnd_High_Bound -- since we know that the result cannot be null). Opnd_Low_Bound (NN) := Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Istyp, Loc), Attribute_Name => Name_First); Set := True; -- String literal case (can only occur for strings of course) elsif Nkind (Opnd) = N_String_Literal then Len := String_Literal_Length (Opnd_Typ); if Len /= 0 then Result_May_Be_Null := False; end if; -- Capture last operand low and high bound if result could be null if J = N and then Result_May_Be_Null then Last_Opnd_Low_Bound := New_Copy_Tree (String_Literal_Low_Bound (Opnd_Typ)); Last_Opnd_High_Bound := Make_Op_Subtract (Loc, Left_Opnd => New_Copy_Tree (String_Literal_Low_Bound (Opnd_Typ)), Right_Opnd => Make_Integer_Literal (Loc, 1)); end if; -- Skip null string literal if J < N and then Len = 0 then goto Continue; end if; NN := NN + 1; Operands (NN) := Opnd; Is_Fixed_Length (NN) := True; -- Set length and bounds Fixed_Length (NN) := Len; Opnd_Low_Bound (NN) := New_Copy_Tree (String_Literal_Low_Bound (Opnd_Typ)); Set := True; -- All other cases else -- Check constrained case with known bounds if Is_Constrained (Opnd_Typ) then declare Index : constant Node_Id := First_Index (Opnd_Typ); Indx_Typ : constant Entity_Id := Etype (Index); Lo : constant Node_Id := Type_Low_Bound (Indx_Typ); Hi : constant Node_Id := Type_High_Bound (Indx_Typ); begin -- Fixed length constrained array type with known at compile -- time bounds is last case of fixed length operand. if Compile_Time_Known_Value (Lo) and then Compile_Time_Known_Value (Hi) then declare Loval : constant Uint := Expr_Value (Lo); Hival : constant Uint := Expr_Value (Hi); Len : constant Uint := UI_Max (Hival - Loval + 1, Uint_0); begin if Len > 0 then Result_May_Be_Null := False; end if; -- Capture last operand bounds if result could be null if J = N and then Result_May_Be_Null then Last_Opnd_Low_Bound := Convert_To (Ityp, Make_Integer_Literal (Loc, Expr_Value (Lo))); Last_Opnd_High_Bound := Convert_To (Ityp, Make_Integer_Literal (Loc, Expr_Value (Hi))); end if; -- Exclude null length case unless last operand if J < N and then Len = 0 then goto Continue; end if; NN := NN + 1; Operands (NN) := Opnd; Is_Fixed_Length (NN) := True; Fixed_Length (NN) := Len; Opnd_Low_Bound (NN) := To_Ityp (Make_Integer_Literal (Loc, Expr_Value (Lo))); Set := True; end; end if; end; end if; -- All cases where the length is not known at compile time, or the -- special case of an operand which is known to be null but has a -- lower bound other than 1 or is other than a string type. if not Set then NN := NN + 1; -- Capture operand bounds Opnd_Low_Bound (NN) := Make_Attribute_Reference (Loc, Prefix => Duplicate_Subexpr (Opnd, Name_Req => True), Attribute_Name => Name_First); -- Capture last operand bounds if result could be null if J = N and Result_May_Be_Null then Last_Opnd_Low_Bound := Convert_To (Ityp, Make_Attribute_Reference (Loc, Prefix => Duplicate_Subexpr (Opnd, Name_Req => True), Attribute_Name => Name_First)); Last_Opnd_High_Bound := Convert_To (Ityp, Make_Attribute_Reference (Loc, Prefix => Duplicate_Subexpr (Opnd, Name_Req => True), Attribute_Name => Name_Last)); end if; -- Capture length of operand in entity Operands (NN) := Opnd; Is_Fixed_Length (NN) := False; Var_Length (NN) := Make_Temporary (Loc, 'L'); Append_To (Actions, Make_Object_Declaration (Loc, Defining_Identifier => Var_Length (NN), Constant_Present => True, Object_Definition => New_Occurrence_Of (Artyp, Loc), Expression => Make_Attribute_Reference (Loc, Prefix => Duplicate_Subexpr (Opnd, Name_Req => True), Attribute_Name => Name_Length))); end if; end if; -- Set next entry in aggregate length array -- For first entry, make either integer literal for fixed length -- or a reference to the saved length for variable length. if NN = 1 then if Is_Fixed_Length (1) then Aggr_Length (1) := Make_Integer_Literal (Loc, Fixed_Length (1)); else Aggr_Length (1) := New_Occurrence_Of (Var_Length (1), Loc); end if; -- If entry is fixed length and only fixed lengths so far, make -- appropriate new integer literal adding new length. elsif Is_Fixed_Length (NN) and then Nkind (Aggr_Length (NN - 1)) = N_Integer_Literal then Aggr_Length (NN) := Make_Integer_Literal (Loc, Intval => Fixed_Length (NN) + Intval (Aggr_Length (NN - 1))); -- All other cases, construct an addition node for the length and -- create an entity initialized to this length. else Ent := Make_Temporary (Loc, 'L'); if Is_Fixed_Length (NN) then Clen := Make_Integer_Literal (Loc, Fixed_Length (NN)); else Clen := New_Occurrence_Of (Var_Length (NN), Loc); end if; Append_To (Actions, Make_Object_Declaration (Loc, Defining_Identifier => Ent, Constant_Present => True, Object_Definition => New_Occurrence_Of (Artyp, Loc), Expression => Make_Op_Add (Loc, Left_Opnd => New_Copy (Aggr_Length (NN - 1)), Right_Opnd => Clen))); Aggr_Length (NN) := Make_Identifier (Loc, Chars => Chars (Ent)); end if; <<Continue>> J := J + 1; end loop; -- If we have only skipped null operands, return the last operand if NN = 0 then Result := Opnd; goto Done; end if; -- If we have only one non-null operand, return it and we are done. -- There is one case in which this cannot be done, and that is when -- the sole operand is of the element type, in which case it must be -- converted to an array, and the easiest way of doing that is to go -- through the normal general circuit. if NN = 1 and then Base_Type (Etype (Operands (1))) /= Ctyp then Result := Operands (1); goto Done; end if; -- Cases where we have a real concatenation -- Next step is to find the low bound for the result array that we -- will allocate. The rules for this are in (RM 4.5.6(5-7)). -- If the ultimate ancestor of the index subtype is a constrained array -- definition, then the lower bound is that of the index subtype as -- specified by (RM 4.5.3(6)). -- The right test here is to go to the root type, and then the ultimate -- ancestor is the first subtype of this root type. if Is_Constrained (First_Subtype (Root_Type (Atyp))) then Low_Bound := Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (First_Subtype (Root_Type (Atyp)), Loc), Attribute_Name => Name_First); -- If the first operand in the list has known length we know that -- the lower bound of the result is the lower bound of this operand. elsif Is_Fixed_Length (1) then Low_Bound := Opnd_Low_Bound (1); -- OK, we don't know the lower bound, we have to build a horrible -- if expression node of the form -- if Cond1'Length /= 0 then -- Opnd1 low bound -- else -- if Opnd2'Length /= 0 then -- Opnd2 low bound -- else -- ... -- The nesting ends either when we hit an operand whose length is known -- at compile time, or on reaching the last operand, whose low bound we -- take unconditionally whether or not it is null. It's easiest to do -- this with a recursive procedure: else declare function Get_Known_Bound (J : Nat) return Node_Id; -- Returns the lower bound determined by operands J .. NN --------------------- -- Get_Known_Bound -- --------------------- function Get_Known_Bound (J : Nat) return Node_Id is begin if Is_Fixed_Length (J) or else J = NN then return New_Copy (Opnd_Low_Bound (J)); else return Make_If_Expression (Loc, Expressions => New_List ( Make_Op_Ne (Loc, Left_Opnd => New_Occurrence_Of (Var_Length (J), Loc), Right_Opnd => Make_Integer_Literal (Loc, 0)), New_Copy (Opnd_Low_Bound (J)), Get_Known_Bound (J + 1))); end if; end Get_Known_Bound; begin Ent := Make_Temporary (Loc, 'L'); Append_To (Actions, Make_Object_Declaration (Loc, Defining_Identifier => Ent, Constant_Present => True, Object_Definition => New_Occurrence_Of (Ityp, Loc), Expression => Get_Known_Bound (1))); Low_Bound := New_Occurrence_Of (Ent, Loc); end; end if; -- Now we can safely compute the upper bound, normally -- Low_Bound + Length - 1. High_Bound := To_Ityp (Make_Op_Add (Loc, Left_Opnd => To_Artyp (New_Copy (Low_Bound)), Right_Opnd => Make_Op_Subtract (Loc, Left_Opnd => New_Copy (Aggr_Length (NN)), Right_Opnd => Make_Artyp_Literal (1)))); -- Note that calculation of the high bound may cause overflow in some -- very weird cases, so in the general case we need an overflow check on -- the high bound. We can avoid this for the common case of string types -- and other types whose index is Positive, since we chose a wider range -- for the arithmetic type. If checks are suppressed we do not set the -- flag, and possibly superfluous warnings will be omitted. if Istyp /= Standard_Positive and then not Overflow_Checks_Suppressed (Istyp) then Activate_Overflow_Check (High_Bound); end if; -- Handle the exceptional case where the result is null, in which case -- case the bounds come from the last operand (so that we get the proper -- bounds if the last operand is super-flat). if Result_May_Be_Null then Low_Bound := Make_If_Expression (Loc, Expressions => New_List ( Make_Op_Eq (Loc, Left_Opnd => New_Copy (Aggr_Length (NN)), Right_Opnd => Make_Artyp_Literal (0)), Last_Opnd_Low_Bound, Low_Bound)); High_Bound := Make_If_Expression (Loc, Expressions => New_List ( Make_Op_Eq (Loc, Left_Opnd => New_Copy (Aggr_Length (NN)), Right_Opnd => Make_Artyp_Literal (0)), Last_Opnd_High_Bound, High_Bound)); end if; -- Here is where we insert the saved up actions Insert_Actions (Cnode, Actions, Suppress => All_Checks); -- Now we construct an array object with appropriate bounds. We mark -- the target as internal to prevent useless initialization when -- Initialize_Scalars is enabled. Also since this is the actual result -- entity, we make sure we have debug information for the result. Ent := Make_Temporary (Loc, 'S'); Set_Is_Internal (Ent); Set_Needs_Debug_Info (Ent); -- If the bound is statically known to be out of range, we do not want -- to abort, we want a warning and a runtime constraint error. Note that -- we have arranged that the result will not be treated as a static -- constant, so we won't get an illegality during this insertion. Insert_Action (Cnode, Make_Object_Declaration (Loc, Defining_Identifier => Ent, Object_Definition => Make_Subtype_Indication (Loc, Subtype_Mark => New_Occurrence_Of (Atyp, Loc), Constraint => Make_Index_Or_Discriminant_Constraint (Loc, Constraints => New_List ( Make_Range (Loc, Low_Bound => Low_Bound, High_Bound => High_Bound))))), Suppress => All_Checks); -- If the result of the concatenation appears as the initializing -- expression of an object declaration, we can just rename the -- result, rather than copying it. Set_OK_To_Rename (Ent); -- Catch the static out of range case now if Raises_Constraint_Error (High_Bound) then raise Concatenation_Error; end if; -- Now we will generate the assignments to do the actual concatenation -- There is one case in which we will not do this, namely when all the -- following conditions are met: -- The result type is Standard.String -- There are nine or fewer retained (non-null) operands -- The optimization level is -O0 -- The corresponding System.Concat_n.Str_Concat_n routine is -- available in the run time. -- The debug flag gnatd.c is not set -- If all these conditions are met then we generate a call to the -- relevant concatenation routine. The purpose of this is to avoid -- undesirable code bloat at -O0. if Atyp = Standard_String and then NN in 2 .. 9 and then (Lib_Level_Target or else ((Optimization_Level = 0 or else Debug_Flag_Dot_CC) and then not Debug_Flag_Dot_C)) then declare RR : constant array (Nat range 2 .. 9) of RE_Id := (RE_Str_Concat_2, RE_Str_Concat_3, RE_Str_Concat_4, RE_Str_Concat_5, RE_Str_Concat_6, RE_Str_Concat_7, RE_Str_Concat_8, RE_Str_Concat_9); begin if RTE_Available (RR (NN)) then declare Opnds : constant List_Id := New_List (New_Occurrence_Of (Ent, Loc)); begin for J in 1 .. NN loop if Is_List_Member (Operands (J)) then Remove (Operands (J)); end if; if Base_Type (Etype (Operands (J))) = Ctyp then Append_To (Opnds, Make_Aggregate (Loc, Component_Associations => New_List ( Make_Component_Association (Loc, Choices => New_List ( Make_Integer_Literal (Loc, 1)), Expression => Operands (J))))); else Append_To (Opnds, Operands (J)); end if; end loop; Insert_Action (Cnode, Make_Procedure_Call_Statement (Loc, Name => New_Occurrence_Of (RTE (RR (NN)), Loc), Parameter_Associations => Opnds)); Result := New_Occurrence_Of (Ent, Loc); goto Done; end; end if; end; end if; -- Not special case so generate the assignments Known_Non_Null_Operand_Seen := False; for J in 1 .. NN loop declare Lo : constant Node_Id := Make_Op_Add (Loc, Left_Opnd => To_Artyp (New_Copy (Low_Bound)), Right_Opnd => Aggr_Length (J - 1)); Hi : constant Node_Id := Make_Op_Add (Loc, Left_Opnd => To_Artyp (New_Copy (Low_Bound)), Right_Opnd => Make_Op_Subtract (Loc, Left_Opnd => Aggr_Length (J), Right_Opnd => Make_Artyp_Literal (1))); begin -- Singleton case, simple assignment if Base_Type (Etype (Operands (J))) = Ctyp then Known_Non_Null_Operand_Seen := True; Insert_Action (Cnode, Make_Assignment_Statement (Loc, Name => Make_Indexed_Component (Loc, Prefix => New_Occurrence_Of (Ent, Loc), Expressions => New_List (To_Ityp (Lo))), Expression => Operands (J)), Suppress => All_Checks); -- Array case, slice assignment, skipped when argument is fixed -- length and known to be null. elsif (not Is_Fixed_Length (J)) or else (Fixed_Length (J) > 0) then declare Assign : Node_Id := Make_Assignment_Statement (Loc, Name => Make_Slice (Loc, Prefix => New_Occurrence_Of (Ent, Loc), Discrete_Range => Make_Range (Loc, Low_Bound => To_Ityp (Lo), High_Bound => To_Ityp (Hi))), Expression => Operands (J)); begin if Is_Fixed_Length (J) then Known_Non_Null_Operand_Seen := True; elsif not Known_Non_Null_Operand_Seen then -- Here if operand length is not statically known and no -- operand known to be non-null has been processed yet. -- If operand length is 0, we do not need to perform the -- assignment, and we must avoid the evaluation of the -- high bound of the slice, since it may underflow if the -- low bound is Ityp'First. Assign := Make_Implicit_If_Statement (Cnode, Condition => Make_Op_Ne (Loc, Left_Opnd => New_Occurrence_Of (Var_Length (J), Loc), Right_Opnd => Make_Integer_Literal (Loc, 0)), Then_Statements => New_List (Assign)); end if; Insert_Action (Cnode, Assign, Suppress => All_Checks); end; end if; end; end loop; -- Finally we build the result, which is a reference to the array object Result := New_Occurrence_Of (Ent, Loc); <<Done>> Rewrite (Cnode, Result); Analyze_And_Resolve (Cnode, Atyp); exception when Concatenation_Error => -- Kill warning generated for the declaration of the static out of -- range high bound, and instead generate a Constraint_Error with -- an appropriate specific message. Kill_Dead_Code (Declaration_Node (Entity (High_Bound))); Apply_Compile_Time_Constraint_Error (N => Cnode, Msg => "concatenation result upper bound out of range??", Reason => CE_Range_Check_Failed); end Expand_Concatenate; --------------------------------------------------- -- Expand_Membership_Minimize_Eliminate_Overflow -- --------------------------------------------------- procedure Expand_Membership_Minimize_Eliminate_Overflow (N : Node_Id) is pragma Assert (Nkind (N) = N_In); -- Despite the name, this routine applies only to N_In, not to -- N_Not_In. The latter is always rewritten as not (X in Y). Result_Type : constant Entity_Id := Etype (N); -- Capture result type, may be a derived boolean type Loc : constant Source_Ptr := Sloc (N); Lop : constant Node_Id := Left_Opnd (N); Rop : constant Node_Id := Right_Opnd (N); -- Note: there are many referencs to Etype (Lop) and Etype (Rop). It -- is thus tempting to capture these values, but due to the rewrites -- that occur as a result of overflow checking, these values change -- as we go along, and it is safe just to always use Etype explicitly. Restype : constant Entity_Id := Etype (N); -- Save result type Lo, Hi : Uint; -- Bounds in Minimize calls, not used currently LLIB : constant Entity_Id := Base_Type (Standard_Long_Long_Integer); -- Entity for Long_Long_Integer'Base (Standard should export this???) begin Minimize_Eliminate_Overflows (Lop, Lo, Hi, Top_Level => False); -- If right operand is a subtype name, and the subtype name has no -- predicate, then we can just replace the right operand with an -- explicit range T'First .. T'Last, and use the explicit range code. if Nkind (Rop) /= N_Range and then No (Predicate_Function (Etype (Rop))) then declare Rtyp : constant Entity_Id := Etype (Rop); begin Rewrite (Rop, Make_Range (Loc, Low_Bound => Make_Attribute_Reference (Loc, Attribute_Name => Name_First, Prefix => New_Occurrence_Of (Rtyp, Loc)), High_Bound => Make_Attribute_Reference (Loc, Attribute_Name => Name_Last, Prefix => New_Occurrence_Of (Rtyp, Loc)))); Analyze_And_Resolve (Rop, Rtyp, Suppress => All_Checks); end; end if; -- Here for the explicit range case. Note that the bounds of the range -- have not been processed for minimized or eliminated checks. if Nkind (Rop) = N_Range then Minimize_Eliminate_Overflows (Low_Bound (Rop), Lo, Hi, Top_Level => False); Minimize_Eliminate_Overflows (High_Bound (Rop), Lo, Hi, Top_Level => False); -- We have A in B .. C, treated as A >= B and then A <= C -- Bignum case if Is_RTE (Etype (Lop), RE_Bignum) or else Is_RTE (Etype (Low_Bound (Rop)), RE_Bignum) or else Is_RTE (Etype (High_Bound (Rop)), RE_Bignum) then declare Blk : constant Node_Id := Make_Bignum_Block (Loc); Bnn : constant Entity_Id := Make_Temporary (Loc, 'B', N); L : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uL); Lopnd : constant Node_Id := Convert_To_Bignum (Lop); Lbound : constant Node_Id := Convert_To_Bignum (Low_Bound (Rop)); Hbound : constant Node_Id := Convert_To_Bignum (High_Bound (Rop)); -- Now we rewrite the membership test node to look like -- do -- Bnn : Result_Type; -- declare -- M : Mark_Id := SS_Mark; -- L : Bignum := Lopnd; -- begin -- Bnn := Big_GE (L, Lbound) and then Big_LE (L, Hbound) -- SS_Release (M); -- end; -- in -- Bnn -- end begin -- Insert declaration of L into declarations of bignum block Insert_After (Last (Declarations (Blk)), Make_Object_Declaration (Loc, Defining_Identifier => L, Object_Definition => New_Occurrence_Of (RTE (RE_Bignum), Loc), Expression => Lopnd)); -- Insert assignment to Bnn into expressions of bignum block Insert_Before (First (Statements (Handled_Statement_Sequence (Blk))), Make_Assignment_Statement (Loc, Name => New_Occurrence_Of (Bnn, Loc), Expression => Make_And_Then (Loc, Left_Opnd => Make_Function_Call (Loc, Name => New_Occurrence_Of (RTE (RE_Big_GE), Loc), Parameter_Associations => New_List ( New_Occurrence_Of (L, Loc), Lbound)), Right_Opnd => Make_Function_Call (Loc, Name => New_Occurrence_Of (RTE (RE_Big_LE), Loc), Parameter_Associations => New_List ( New_Occurrence_Of (L, Loc), Hbound))))); -- Now rewrite the node Rewrite (N, Make_Expression_With_Actions (Loc, Actions => New_List ( Make_Object_Declaration (Loc, Defining_Identifier => Bnn, Object_Definition => New_Occurrence_Of (Result_Type, Loc)), Blk), Expression => New_Occurrence_Of (Bnn, Loc))); Analyze_And_Resolve (N, Result_Type); return; end; -- Here if no bignums around else -- Case where types are all the same if Base_Type (Etype (Lop)) = Base_Type (Etype (Low_Bound (Rop))) and then Base_Type (Etype (Lop)) = Base_Type (Etype (High_Bound (Rop))) then null; -- If types are not all the same, it means that we have rewritten -- at least one of them to be of type Long_Long_Integer, and we -- will convert the other operands to Long_Long_Integer. else Convert_To_And_Rewrite (LLIB, Lop); Set_Analyzed (Lop, False); Analyze_And_Resolve (Lop, LLIB); -- For the right operand, avoid unnecessary recursion into -- this routine, we know that overflow is not possible. Convert_To_And_Rewrite (LLIB, Low_Bound (Rop)); Convert_To_And_Rewrite (LLIB, High_Bound (Rop)); Set_Analyzed (Rop, False); Analyze_And_Resolve (Rop, LLIB, Suppress => Overflow_Check); end if; -- Now the three operands are of the same signed integer type, -- so we can use the normal expansion routine for membership, -- setting the flag to prevent recursion into this procedure. Set_No_Minimize_Eliminate (N); Expand_N_In (N); end if; -- Right operand is a subtype name and the subtype has a predicate. We -- have to make sure the predicate is checked, and for that we need to -- use the standard N_In circuitry with appropriate types. else pragma Assert (Present (Predicate_Function (Etype (Rop)))); -- If types are "right", just call Expand_N_In preventing recursion if Base_Type (Etype (Lop)) = Base_Type (Etype (Rop)) then Set_No_Minimize_Eliminate (N); Expand_N_In (N); -- Bignum case elsif Is_RTE (Etype (Lop), RE_Bignum) then -- For X in T, we want to rewrite our node as -- do -- Bnn : Result_Type; -- declare -- M : Mark_Id := SS_Mark; -- Lnn : Long_Long_Integer'Base -- Nnn : Bignum; -- begin -- Nnn := X; -- if not Bignum_In_LLI_Range (Nnn) then -- Bnn := False; -- else -- Lnn := From_Bignum (Nnn); -- Bnn := -- Lnn in LLIB (T'Base'First) .. LLIB (T'Base'Last) -- and then T'Base (Lnn) in T; -- end if; -- SS_Release (M); -- end -- in -- Bnn -- end -- A bit gruesome, but there doesn't seem to be a simpler way declare Blk : constant Node_Id := Make_Bignum_Block (Loc); Bnn : constant Entity_Id := Make_Temporary (Loc, 'B', N); Lnn : constant Entity_Id := Make_Temporary (Loc, 'L', N); Nnn : constant Entity_Id := Make_Temporary (Loc, 'N', N); T : constant Entity_Id := Etype (Rop); TB : constant Entity_Id := Base_Type (T); Nin : Node_Id; begin -- Mark the last membership operation to prevent recursion Nin := Make_In (Loc, Left_Opnd => Convert_To (TB, New_Occurrence_Of (Lnn, Loc)), Right_Opnd => New_Occurrence_Of (T, Loc)); Set_No_Minimize_Eliminate (Nin); -- Now decorate the block Insert_After (Last (Declarations (Blk)), Make_Object_Declaration (Loc, Defining_Identifier => Lnn, Object_Definition => New_Occurrence_Of (LLIB, Loc))); Insert_After (Last (Declarations (Blk)), Make_Object_Declaration (Loc, Defining_Identifier => Nnn, Object_Definition => New_Occurrence_Of (RTE (RE_Bignum), Loc))); Insert_List_Before (First (Statements (Handled_Statement_Sequence (Blk))), New_List ( Make_Assignment_Statement (Loc, Name => New_Occurrence_Of (Nnn, Loc), Expression => Relocate_Node (Lop)), Make_Implicit_If_Statement (N, Condition => Make_Op_Not (Loc, Right_Opnd => Make_Function_Call (Loc, Name => New_Occurrence_Of (RTE (RE_Bignum_In_LLI_Range), Loc), Parameter_Associations => New_List ( New_Occurrence_Of (Nnn, Loc)))), Then_Statements => New_List ( Make_Assignment_Statement (Loc, Name => New_Occurrence_Of (Bnn, Loc), Expression => New_Occurrence_Of (Standard_False, Loc))), Else_Statements => New_List ( Make_Assignment_Statement (Loc, Name => New_Occurrence_Of (Lnn, Loc), Expression => Make_Function_Call (Loc, Name => New_Occurrence_Of (RTE (RE_From_Bignum), Loc), Parameter_Associations => New_List ( New_Occurrence_Of (Nnn, Loc)))), Make_Assignment_Statement (Loc, Name => New_Occurrence_Of (Bnn, Loc), Expression => Make_And_Then (Loc, Left_Opnd => Make_In (Loc, Left_Opnd => New_Occurrence_Of (Lnn, Loc), Right_Opnd => Make_Range (Loc, Low_Bound => Convert_To (LLIB, Make_Attribute_Reference (Loc, Attribute_Name => Name_First, Prefix => New_Occurrence_Of (TB, Loc))), High_Bound => Convert_To (LLIB, Make_Attribute_Reference (Loc, Attribute_Name => Name_Last, Prefix => New_Occurrence_Of (TB, Loc))))), Right_Opnd => Nin)))))); -- Now we can do the rewrite Rewrite (N, Make_Expression_With_Actions (Loc, Actions => New_List ( Make_Object_Declaration (Loc, Defining_Identifier => Bnn, Object_Definition => New_Occurrence_Of (Result_Type, Loc)), Blk), Expression => New_Occurrence_Of (Bnn, Loc))); Analyze_And_Resolve (N, Result_Type); return; end; -- Not bignum case, but types don't match (this means we rewrote the -- left operand to be Long_Long_Integer). else pragma Assert (Base_Type (Etype (Lop)) = LLIB); -- We rewrite the membership test as (where T is the type with -- the predicate, i.e. the type of the right operand) -- Lop in LLIB (T'Base'First) .. LLIB (T'Base'Last) -- and then T'Base (Lop) in T declare T : constant Entity_Id := Etype (Rop); TB : constant Entity_Id := Base_Type (T); Nin : Node_Id; begin -- The last membership test is marked to prevent recursion Nin := Make_In (Loc, Left_Opnd => Convert_To (TB, Duplicate_Subexpr (Lop)), Right_Opnd => New_Occurrence_Of (T, Loc)); Set_No_Minimize_Eliminate (Nin); -- Now do the rewrite Rewrite (N, Make_And_Then (Loc, Left_Opnd => Make_In (Loc, Left_Opnd => Lop, Right_Opnd => Make_Range (Loc, Low_Bound => Convert_To (LLIB, Make_Attribute_Reference (Loc, Attribute_Name => Name_First, Prefix => New_Occurrence_Of (TB, Loc))), High_Bound => Convert_To (LLIB, Make_Attribute_Reference (Loc, Attribute_Name => Name_Last, Prefix => New_Occurrence_Of (TB, Loc))))), Right_Opnd => Nin)); Set_Analyzed (N, False); Analyze_And_Resolve (N, Restype); end; end if; end if; end Expand_Membership_Minimize_Eliminate_Overflow; ------------------------ -- Expand_N_Allocator -- ------------------------ procedure Expand_N_Allocator (N : Node_Id) is Etyp : constant Entity_Id := Etype (Expression (N)); Loc : constant Source_Ptr := Sloc (N); PtrT : constant Entity_Id := Etype (N); procedure Rewrite_Coextension (N : Node_Id); -- Static coextensions have the same lifetime as the entity they -- constrain. Such occurrences can be rewritten as aliased objects -- and their unrestricted access used instead of the coextension. function Size_In_Storage_Elements (E : Entity_Id) return Node_Id; -- Given a constrained array type E, returns a node representing the -- code to compute the size in storage elements for the given type. -- This is done without using the attribute (which malfunctions for -- large sizes ???) ------------------------- -- Rewrite_Coextension -- ------------------------- procedure Rewrite_Coextension (N : Node_Id) is Temp_Id : constant Node_Id := Make_Temporary (Loc, 'C'); Temp_Decl : Node_Id; begin -- Generate: -- Cnn : aliased Etyp; Temp_Decl := Make_Object_Declaration (Loc, Defining_Identifier => Temp_Id, Aliased_Present => True, Object_Definition => New_Occurrence_Of (Etyp, Loc)); if Nkind (Expression (N)) = N_Qualified_Expression then Set_Expression (Temp_Decl, Expression (Expression (N))); end if; Insert_Action (N, Temp_Decl); Rewrite (N, Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Temp_Id, Loc), Attribute_Name => Name_Unrestricted_Access)); Analyze_And_Resolve (N, PtrT); end Rewrite_Coextension; ------------------------------ -- Size_In_Storage_Elements -- ------------------------------ function Size_In_Storage_Elements (E : Entity_Id) return Node_Id is begin -- Logically this just returns E'Max_Size_In_Storage_Elements. -- However, the reason for the existence of this function is -- to construct a test for sizes too large, which means near the -- 32-bit limit on a 32-bit machine, and precisely the trouble -- is that we get overflows when sizes are greater than 2**31. -- So what we end up doing for array types is to use the expression: -- number-of-elements * component_type'Max_Size_In_Storage_Elements -- which avoids this problem. All this is a bit bogus, but it does -- mean we catch common cases of trying to allocate arrays that -- are too large, and which in the absence of a check results in -- undetected chaos ??? -- Note in particular that this is a pessimistic estimate in the -- case of packed array types, where an array element might occupy -- just a fraction of a storage element??? declare Len : Node_Id; Res : Node_Id; begin for J in 1 .. Number_Dimensions (E) loop Len := Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (E, Loc), Attribute_Name => Name_Length, Expressions => New_List (Make_Integer_Literal (Loc, J))); if J = 1 then Res := Len; else Res := Make_Op_Multiply (Loc, Left_Opnd => Res, Right_Opnd => Len); end if; end loop; return Make_Op_Multiply (Loc, Left_Opnd => Len, Right_Opnd => Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Component_Type (E), Loc), Attribute_Name => Name_Max_Size_In_Storage_Elements)); end; end Size_In_Storage_Elements; -- Local variables Dtyp : constant Entity_Id := Available_View (Designated_Type (PtrT)); Desig : Entity_Id; Nod : Node_Id; Pool : Entity_Id; Rel_Typ : Entity_Id; Temp : Entity_Id; -- Start of processing for Expand_N_Allocator begin -- RM E.2.3(22). We enforce that the expected type of an allocator -- shall not be a remote access-to-class-wide-limited-private type -- Why is this being done at expansion time, seems clearly wrong ??? Validate_Remote_Access_To_Class_Wide_Type (N); -- Processing for anonymous access-to-controlled types. These access -- types receive a special finalization master which appears in the -- declarations of the enclosing semantic unit. This expansion is done -- now to ensure that any additional types generated by this routine or -- Expand_Allocator_Expression inherit the proper type attributes. if (Ekind (PtrT) = E_Anonymous_Access_Type or else (Is_Itype (PtrT) and then No (Finalization_Master (PtrT)))) and then Needs_Finalization (Dtyp) then -- Detect the allocation of an anonymous controlled object where the -- type of the context is named. For example: -- procedure Proc (Ptr : Named_Access_Typ); -- Proc (new Designated_Typ); -- Regardless of the anonymous-to-named access type conversion, the -- lifetime of the object must be associated with the named access -- type. Use the finalization-related attributes of this type. if Nkind_In (Parent (N), N_Type_Conversion, N_Unchecked_Type_Conversion) and then Ekind_In (Etype (Parent (N)), E_Access_Subtype, E_Access_Type, E_General_Access_Type) then Rel_Typ := Etype (Parent (N)); else Rel_Typ := Empty; end if; -- Anonymous access-to-controlled types allocate on the global pool. -- Note that this is a "root type only" attribute. if No (Associated_Storage_Pool (PtrT)) then if Present (Rel_Typ) then Set_Associated_Storage_Pool (Root_Type (PtrT), Associated_Storage_Pool (Rel_Typ)); else Set_Associated_Storage_Pool (Root_Type (PtrT), RTE (RE_Global_Pool_Object)); end if; end if; -- The finalization master must be inserted and analyzed as part of -- the current semantic unit. Note that the master is updated when -- analysis changes current units. Note that this is a "root type -- only" attribute. if Present (Rel_Typ) then Set_Finalization_Master (Root_Type (PtrT), Finalization_Master (Rel_Typ)); else Build_Anonymous_Master (Root_Type (PtrT)); end if; end if; -- Set the storage pool and find the appropriate version of Allocate to -- call. Do not overwrite the storage pool if it is already set, which -- can happen for build-in-place function returns (see -- Exp_Ch4.Expand_N_Extended_Return_Statement). if No (Storage_Pool (N)) then Pool := Associated_Storage_Pool (Root_Type (PtrT)); if Present (Pool) then Set_Storage_Pool (N, Pool); if Is_RTE (Pool, RE_SS_Pool) then Set_Procedure_To_Call (N, RTE (RE_SS_Allocate)); -- In the case of an allocator for a simple storage pool, locate -- and save a reference to the pool type's Allocate routine. elsif Present (Get_Rep_Pragma (Etype (Pool), Name_Simple_Storage_Pool_Type)) then declare Pool_Type : constant Entity_Id := Base_Type (Etype (Pool)); Alloc_Op : Entity_Id; begin Alloc_Op := Get_Name_Entity_Id (Name_Allocate); while Present (Alloc_Op) loop if Scope (Alloc_Op) = Scope (Pool_Type) and then Present (First_Formal (Alloc_Op)) and then Etype (First_Formal (Alloc_Op)) = Pool_Type then Set_Procedure_To_Call (N, Alloc_Op); exit; else Alloc_Op := Homonym (Alloc_Op); end if; end loop; end; elsif Is_Class_Wide_Type (Etype (Pool)) then Set_Procedure_To_Call (N, RTE (RE_Allocate_Any)); else Set_Procedure_To_Call (N, Find_Prim_Op (Etype (Pool), Name_Allocate)); end if; end if; end if; -- Under certain circumstances we can replace an allocator by an access -- to statically allocated storage. The conditions, as noted in AARM -- 3.10 (10c) are as follows: -- Size and initial value is known at compile time -- Access type is access-to-constant -- The allocator is not part of a constraint on a record component, -- because in that case the inserted actions are delayed until the -- record declaration is fully analyzed, which is too late for the -- analysis of the rewritten allocator. if Is_Access_Constant (PtrT) and then Nkind (Expression (N)) = N_Qualified_Expression and then Compile_Time_Known_Value (Expression (Expression (N))) and then Size_Known_At_Compile_Time (Etype (Expression (Expression (N)))) and then not Is_Record_Type (Current_Scope) then -- Here we can do the optimization. For the allocator -- new x'(y) -- We insert an object declaration -- Tnn : aliased x := y; -- and replace the allocator by Tnn'Unrestricted_Access. Tnn is -- marked as requiring static allocation. Temp := Make_Temporary (Loc, 'T', Expression (Expression (N))); Desig := Subtype_Mark (Expression (N)); -- If context is constrained, use constrained subtype directly, -- so that the constant is not labelled as having a nominally -- unconstrained subtype. if Entity (Desig) = Base_Type (Dtyp) then Desig := New_Occurrence_Of (Dtyp, Loc); end if; Insert_Action (N, Make_Object_Declaration (Loc, Defining_Identifier => Temp, Aliased_Present => True, Constant_Present => Is_Access_Constant (PtrT), Object_Definition => Desig, Expression => Expression (Expression (N)))); Rewrite (N, Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Temp, Loc), Attribute_Name => Name_Unrestricted_Access)); Analyze_And_Resolve (N, PtrT); -- We set the variable as statically allocated, since we don't want -- it going on the stack of the current procedure. Set_Is_Statically_Allocated (Temp); return; end if; -- Same if the allocator is an access discriminant for a local object: -- instead of an allocator we create a local value and constrain the -- enclosing object with the corresponding access attribute. if Is_Static_Coextension (N) then Rewrite_Coextension (N); return; end if; -- Check for size too large, we do this because the back end misses -- proper checks here and can generate rubbish allocation calls when -- we are near the limit. We only do this for the 32-bit address case -- since that is from a practical point of view where we see a problem. if System_Address_Size = 32 and then not Storage_Checks_Suppressed (PtrT) and then not Storage_Checks_Suppressed (Dtyp) and then not Storage_Checks_Suppressed (Etyp) then -- The check we want to generate should look like -- if Etyp'Max_Size_In_Storage_Elements > 3.5 gigabytes then -- raise Storage_Error; -- end if; -- where 3.5 gigabytes is a constant large enough to accommodate any -- reasonable request for. But we can't do it this way because at -- least at the moment we don't compute this attribute right, and -- can silently give wrong results when the result gets large. Since -- this is all about large results, that's bad, so instead we only -- apply the check for constrained arrays, and manually compute the -- value of the attribute ??? if Is_Array_Type (Etyp) and then Is_Constrained (Etyp) then Insert_Action (N, Make_Raise_Storage_Error (Loc, Condition => Make_Op_Gt (Loc, Left_Opnd => Size_In_Storage_Elements (Etyp), Right_Opnd => Make_Integer_Literal (Loc, Uint_7 * (Uint_2 ** 29))), Reason => SE_Object_Too_Large)); end if; end if; -- If no storage pool has been specified and we have the restriction -- No_Standard_Allocators_After_Elaboration is present, then generate -- a call to Elaboration_Allocators.Check_Standard_Allocator. if Nkind (N) = N_Allocator and then No (Storage_Pool (N)) and then Restriction_Active (No_Standard_Allocators_After_Elaboration) then Insert_Action (N, Make_Procedure_Call_Statement (Loc, Name => New_Occurrence_Of (RTE (RE_Check_Standard_Allocator), Loc))); end if; -- Handle case of qualified expression (other than optimization above) -- First apply constraint checks, because the bounds or discriminants -- in the aggregate might not match the subtype mark in the allocator. if Nkind (Expression (N)) = N_Qualified_Expression then declare Exp : constant Node_Id := Expression (Expression (N)); Typ : constant Entity_Id := Etype (Expression (N)); begin Apply_Constraint_Check (Exp, Typ); Apply_Predicate_Check (Exp, Typ); end; Expand_Allocator_Expression (N); return; end if; -- If the allocator is for a type which requires initialization, and -- there is no initial value (i.e. operand is a subtype indication -- rather than a qualified expression), then we must generate a call to -- the initialization routine using an expressions action node: -- [Pnnn : constant ptr_T := new (T); Init (Pnnn.all,...); Pnnn] -- Here ptr_T is the pointer type for the allocator, and T is the -- subtype of the allocator. A special case arises if the designated -- type of the access type is a task or contains tasks. In this case -- the call to Init (Temp.all ...) is replaced by code that ensures -- that tasks get activated (see Exp_Ch9.Build_Task_Allocate_Block -- for details). In addition, if the type T is a task type, then the -- first argument to Init must be converted to the task record type. declare T : constant Entity_Id := Entity (Expression (N)); Args : List_Id; Decls : List_Id; Decl : Node_Id; Discr : Elmt_Id; Init : Entity_Id; Init_Arg1 : Node_Id; Init_Call : Node_Id; Temp_Decl : Node_Id; Temp_Type : Entity_Id; begin if No_Initialization (N) then -- Even though this might be a simple allocation, create a custom -- Allocate if the context requires it. if Present (Finalization_Master (PtrT)) then Build_Allocate_Deallocate_Proc (N => N, Is_Allocate => True); end if; -- Case of no initialization procedure present elsif not Has_Non_Null_Base_Init_Proc (T) then -- Case of simple initialization required if Needs_Simple_Initialization (T) then Check_Restriction (No_Default_Initialization, N); Rewrite (Expression (N), Make_Qualified_Expression (Loc, Subtype_Mark => New_Occurrence_Of (T, Loc), Expression => Get_Simple_Init_Val (T, N))); Analyze_And_Resolve (Expression (Expression (N)), T); Analyze_And_Resolve (Expression (N), T); Set_Paren_Count (Expression (Expression (N)), 1); Expand_N_Allocator (N); -- No initialization required else null; end if; -- Case of initialization procedure present, must be called else Check_Restriction (No_Default_Initialization, N); if not Restriction_Active (No_Default_Initialization) then Init := Base_Init_Proc (T); Nod := N; Temp := Make_Temporary (Loc, 'P'); -- Construct argument list for the initialization routine call Init_Arg1 := Make_Explicit_Dereference (Loc, Prefix => New_Occurrence_Of (Temp, Loc)); Set_Assignment_OK (Init_Arg1); Temp_Type := PtrT; -- The initialization procedure expects a specific type. if the -- context is access to class wide, indicate that the object -- being allocated has the right specific type. if Is_Class_Wide_Type (Dtyp) then Init_Arg1 := Unchecked_Convert_To (T, Init_Arg1); end if; -- If designated type is a concurrent type or if it is private -- type whose definition is a concurrent type, the first -- argument in the Init routine has to be unchecked conversion -- to the corresponding record type. If the designated type is -- a derived type, also convert the argument to its root type. if Is_Concurrent_Type (T) then Init_Arg1 := Unchecked_Convert_To ( Corresponding_Record_Type (T), Init_Arg1); elsif Is_Private_Type (T) and then Present (Full_View (T)) and then Is_Concurrent_Type (Full_View (T)) then Init_Arg1 := Unchecked_Convert_To (Corresponding_Record_Type (Full_View (T)), Init_Arg1); elsif Etype (First_Formal (Init)) /= Base_Type (T) then declare Ftyp : constant Entity_Id := Etype (First_Formal (Init)); begin Init_Arg1 := OK_Convert_To (Etype (Ftyp), Init_Arg1); Set_Etype (Init_Arg1, Ftyp); end; end if; Args := New_List (Init_Arg1); -- For the task case, pass the Master_Id of the access type as -- the value of the _Master parameter, and _Chain as the value -- of the _Chain parameter (_Chain will be defined as part of -- the generated code for the allocator). -- In Ada 2005, the context may be a function that returns an -- anonymous access type. In that case the Master_Id has been -- created when expanding the function declaration. if Has_Task (T) then if No (Master_Id (Base_Type (PtrT))) then -- The designated type was an incomplete type, and the -- access type did not get expanded. Salvage it now. if not Restriction_Active (No_Task_Hierarchy) then if Present (Parent (Base_Type (PtrT))) then Expand_N_Full_Type_Declaration (Parent (Base_Type (PtrT))); -- The only other possibility is an itype. For this -- case, the master must exist in the context. This is -- the case when the allocator initializes an access -- component in an init-proc. else pragma Assert (Is_Itype (PtrT)); Build_Master_Renaming (PtrT, N); end if; end if; end if; -- If the context of the allocator is a declaration or an -- assignment, we can generate a meaningful image for it, -- even though subsequent assignments might remove the -- connection between task and entity. We build this image -- when the left-hand side is a simple variable, a simple -- indexed assignment or a simple selected component. if Nkind (Parent (N)) = N_Assignment_Statement then declare Nam : constant Node_Id := Name (Parent (N)); begin if Is_Entity_Name (Nam) then Decls := Build_Task_Image_Decls (Loc, New_Occurrence_Of (Entity (Nam), Sloc (Nam)), T); elsif Nkind_In (Nam, N_Indexed_Component, N_Selected_Component) and then Is_Entity_Name (Prefix (Nam)) then Decls := Build_Task_Image_Decls (Loc, Nam, Etype (Prefix (Nam))); else Decls := Build_Task_Image_Decls (Loc, T, T); end if; end; elsif Nkind (Parent (N)) = N_Object_Declaration then Decls := Build_Task_Image_Decls (Loc, Defining_Identifier (Parent (N)), T); else Decls := Build_Task_Image_Decls (Loc, T, T); end if; if Restriction_Active (No_Task_Hierarchy) then Append_To (Args, New_Occurrence_Of (RTE (RE_Library_Task_Level), Loc)); else Append_To (Args, New_Occurrence_Of (Master_Id (Base_Type (Root_Type (PtrT))), Loc)); end if; Append_To (Args, Make_Identifier (Loc, Name_uChain)); Decl := Last (Decls); Append_To (Args, New_Occurrence_Of (Defining_Identifier (Decl), Loc)); -- Has_Task is false, Decls not used else Decls := No_List; end if; -- Add discriminants if discriminated type declare Dis : Boolean := False; Typ : Entity_Id; begin if Has_Discriminants (T) then Dis := True; Typ := T; -- Type may be a private type with no visible discriminants -- in which case check full view if in scope, or the -- underlying_full_view if dealing with a type whose full -- view may be derived from a private type whose own full -- view has discriminants. elsif Is_Private_Type (T) then if Present (Full_View (T)) and then Has_Discriminants (Full_View (T)) then Dis := True; Typ := Full_View (T); elsif Present (Underlying_Full_View (T)) and then Has_Discriminants (Underlying_Full_View (T)) then Dis := True; Typ := Underlying_Full_View (T); end if; end if; if Dis then -- If the allocated object will be constrained by the -- default values for discriminants, then build a subtype -- with those defaults, and change the allocated subtype -- to that. Note that this happens in fewer cases in Ada -- 2005 (AI-363). if not Is_Constrained (Typ) and then Present (Discriminant_Default_Value (First_Discriminant (Typ))) and then (Ada_Version < Ada_2005 or else not Object_Type_Has_Constrained_Partial_View (Typ, Current_Scope)) then Typ := Build_Default_Subtype (Typ, N); Set_Expression (N, New_Occurrence_Of (Typ, Loc)); end if; Discr := First_Elmt (Discriminant_Constraint (Typ)); while Present (Discr) loop Nod := Node (Discr); Append (New_Copy_Tree (Node (Discr)), Args); -- AI-416: when the discriminant constraint is an -- anonymous access type make sure an accessibility -- check is inserted if necessary (3.10.2(22.q/2)) if Ada_Version >= Ada_2005 and then Ekind (Etype (Nod)) = E_Anonymous_Access_Type then Apply_Accessibility_Check (Nod, Typ, Insert_Node => Nod); end if; Next_Elmt (Discr); end loop; end if; end; -- We set the allocator as analyzed so that when we analyze -- the if expression node, we do not get an unwanted recursive -- expansion of the allocator expression. Set_Analyzed (N, True); Nod := Relocate_Node (N); -- Here is the transformation: -- input: new Ctrl_Typ -- output: Temp : constant Ctrl_Typ_Ptr := new Ctrl_Typ; -- Ctrl_TypIP (Temp.all, ...); -- [Deep_]Initialize (Temp.all); -- Here Ctrl_Typ_Ptr is the pointer type for the allocator, and -- is the subtype of the allocator. Temp_Decl := Make_Object_Declaration (Loc, Defining_Identifier => Temp, Constant_Present => True, Object_Definition => New_Occurrence_Of (Temp_Type, Loc), Expression => Nod); Set_Assignment_OK (Temp_Decl); Insert_Action (N, Temp_Decl, Suppress => All_Checks); Build_Allocate_Deallocate_Proc (Temp_Decl, True); -- If the designated type is a task type or contains tasks, -- create block to activate created tasks, and insert -- declaration for Task_Image variable ahead of call. if Has_Task (T) then declare L : constant List_Id := New_List; Blk : Node_Id; begin Build_Task_Allocate_Block (L, Nod, Args); Blk := Last (L); Insert_List_Before (First (Declarations (Blk)), Decls); Insert_Actions (N, L); end; else Insert_Action (N, Make_Procedure_Call_Statement (Loc, Name => New_Occurrence_Of (Init, Loc), Parameter_Associations => Args)); end if; if Needs_Finalization (T) then -- Generate: -- [Deep_]Initialize (Init_Arg1); Init_Call := Make_Init_Call (Obj_Ref => New_Copy_Tree (Init_Arg1), Typ => T); -- Guard against a missing [Deep_]Initialize when the -- designated type was not properly frozen. if Present (Init_Call) then Insert_Action (N, Init_Call); end if; end if; Rewrite (N, New_Occurrence_Of (Temp, Loc)); Analyze_And_Resolve (N, PtrT); end if; end if; end; -- Ada 2005 (AI-251): If the allocator is for a class-wide interface -- object that has been rewritten as a reference, we displace "this" -- to reference properly its secondary dispatch table. if Nkind (N) = N_Identifier and then Is_Interface (Dtyp) then Displace_Allocator_Pointer (N); end if; exception when RE_Not_Available => return; end Expand_N_Allocator; ----------------------- -- Expand_N_And_Then -- ----------------------- procedure Expand_N_And_Then (N : Node_Id) renames Expand_Short_Circuit_Operator; ------------------------------ -- Expand_N_Case_Expression -- ------------------------------ procedure Expand_N_Case_Expression (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Par : constant Node_Id := Parent (N); Typ : constant Entity_Id := Etype (N); Acts : List_Id; Alt : Node_Id; Case_Stmt : Node_Id; Decl : Node_Id; Expr : Node_Id; Target : Entity_Id; Target_Typ : Entity_Id; In_Predicate : Boolean := False; -- Flag set when the case expression appears within a predicate Optimize_Return_Stmt : Boolean := False; -- Flag set when the case expression can be optimized in the context of -- a simple return statement. begin -- Check for MINIMIZED/ELIMINATED overflow mode if Minimized_Eliminated_Overflow_Check (N) then Apply_Arithmetic_Overflow_Check (N); return; end if; -- If the case expression is a predicate specification, and the type -- to which it applies has a static predicate aspect, do not expand, -- because it will be converted to the proper predicate form later. if Ekind_In (Current_Scope, E_Function, E_Procedure) and then Is_Predicate_Function (Current_Scope) then In_Predicate := True; if Has_Static_Predicate_Aspect (Etype (First_Entity (Current_Scope))) then return; end if; end if; -- When the type of the case expression is elementary, expand -- (case X is when A => AX, when B => BX ...) -- into -- do -- Target : Typ; -- case X is -- when A => -- Target := AX; -- when B => -- Target := BX; -- ... -- end case; -- in Target end; -- In all other cases expand into -- do -- type Ptr_Typ is access all Typ; -- Target : Ptr_Typ; -- case X is -- when A => -- Target := AX'Unrestricted_Access; -- when B => -- Target := BX'Unrestricted_Access; -- ... -- end case; -- in Target.all end; -- This approach avoids extra copies of potentially large objects. It -- also allows handling of values of limited or unconstrained types. -- Small optimization: when the case expression appears in the context -- of a simple return statement, expand into -- case X is -- when A => -- return AX; -- when B => -- return BX; -- ... -- end case; Case_Stmt := Make_Case_Statement (Loc, Expression => Expression (N), Alternatives => New_List); -- Preserve the original context for which the case statement is being -- generated. This is needed by the finalization machinery to prevent -- the premature finalization of controlled objects found within the -- case statement. Set_From_Conditional_Expression (Case_Stmt); Acts := New_List; -- Scalar case if Is_Elementary_Type (Typ) then Target_Typ := Typ; -- ??? Do not perform the optimization when the return statement is -- within a predicate function as this causes supurious errors. Could -- this be a possible mismatch in handling this case somewhere else -- in semantic analysis? Optimize_Return_Stmt := Nkind (Par) = N_Simple_Return_Statement and then not In_Predicate; -- Otherwise create an access type to handle the general case using -- 'Unrestricted_Access. -- Generate: -- type Ptr_Typ is access all Typ; else Target_Typ := Make_Temporary (Loc, 'P'); Append_To (Acts, Make_Full_Type_Declaration (Loc, Defining_Identifier => Target_Typ, Type_Definition => Make_Access_To_Object_Definition (Loc, All_Present => True, Subtype_Indication => New_Occurrence_Of (Typ, Loc)))); end if; -- Create the declaration of the target which captures the value of the -- expression. -- Generate: -- Target : [Ptr_]Typ; if not Optimize_Return_Stmt then Target := Make_Temporary (Loc, 'T'); Decl := Make_Object_Declaration (Loc, Defining_Identifier => Target, Object_Definition => New_Occurrence_Of (Target_Typ, Loc)); Set_No_Initialization (Decl); Append_To (Acts, Decl); end if; -- Process the alternatives Alt := First (Alternatives (N)); while Present (Alt) loop declare Alt_Expr : Node_Id := Expression (Alt); Alt_Loc : constant Source_Ptr := Sloc (Alt_Expr); Stmts : List_Id; begin -- Take the unrestricted access of the expression value for non- -- scalar types. This approach avoids big copies and covers the -- limited and unconstrained cases. -- Generate: -- AX'Unrestricted_Access if not Is_Elementary_Type (Typ) then Alt_Expr := Make_Attribute_Reference (Alt_Loc, Prefix => Relocate_Node (Alt_Expr), Attribute_Name => Name_Unrestricted_Access); end if; -- Generate: -- return AX['Unrestricted_Access]; if Optimize_Return_Stmt then Stmts := New_List ( Make_Simple_Return_Statement (Alt_Loc, Expression => Alt_Expr)); -- Generate: -- Target := AX['Unrestricted_Access]; else Stmts := New_List ( Make_Assignment_Statement (Alt_Loc, Name => New_Occurrence_Of (Target, Loc), Expression => Alt_Expr)); end if; -- Propagate declarations inserted in the node by Insert_Actions -- (for example, temporaries generated to remove side effects). -- These actions must remain attached to the alternative, given -- that they are generated by the corresponding expression. if Present (Actions (Alt)) then Prepend_List (Actions (Alt), Stmts); end if; -- Finalize any transient objects on exit from the alternative. -- This is done only in the return optimization case because -- otherwise the case expression is converted into an expression -- with actions which already contains this form of processing. if Optimize_Return_Stmt then Process_If_Case_Statements (N, Stmts); end if; Append_To (Alternatives (Case_Stmt), Make_Case_Statement_Alternative (Sloc (Alt), Discrete_Choices => Discrete_Choices (Alt), Statements => Stmts)); end; Next (Alt); end loop; -- Rewrite the parent return statement as a case statement if Optimize_Return_Stmt then Rewrite (Par, Case_Stmt); Analyze (Par); -- Otherwise convert the case expression into an expression with actions else Append_To (Acts, Case_Stmt); if Is_Elementary_Type (Typ) then Expr := New_Occurrence_Of (Target, Loc); else Expr := Make_Explicit_Dereference (Loc, Prefix => New_Occurrence_Of (Target, Loc)); end if; -- Generate: -- do -- ... -- in Target[.all] end; Rewrite (N, Make_Expression_With_Actions (Loc, Expression => Expr, Actions => Acts)); Analyze_And_Resolve (N, Typ); end if; end Expand_N_Case_Expression; ----------------------------------- -- Expand_N_Explicit_Dereference -- ----------------------------------- procedure Expand_N_Explicit_Dereference (N : Node_Id) is begin -- Insert explicit dereference call for the checked storage pool case Insert_Dereference_Action (Prefix (N)); -- If the type is an Atomic type for which Atomic_Sync is enabled, then -- we set the atomic sync flag. if Is_Atomic (Etype (N)) and then not Atomic_Synchronization_Disabled (Etype (N)) then Activate_Atomic_Synchronization (N); end if; end Expand_N_Explicit_Dereference; -------------------------------------- -- Expand_N_Expression_With_Actions -- -------------------------------------- procedure Expand_N_Expression_With_Actions (N : Node_Id) is Acts : constant List_Id := Actions (N); procedure Force_Boolean_Evaluation (Expr : Node_Id); -- Force the evaluation of Boolean expression Expr function Process_Action (Act : Node_Id) return Traverse_Result; -- Inspect and process a single action of an expression_with_actions for -- transient objects. If such objects are found, the routine generates -- code to clean them up when the context of the expression is evaluated -- or elaborated. ------------------------------ -- Force_Boolean_Evaluation -- ------------------------------ procedure Force_Boolean_Evaluation (Expr : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Flag_Decl : Node_Id; Flag_Id : Entity_Id; begin -- Relocate the expression to the actions list by capturing its value -- in a Boolean flag. Generate: -- Flag : constant Boolean := Expr; Flag_Id := Make_Temporary (Loc, 'F'); Flag_Decl := Make_Object_Declaration (Loc, Defining_Identifier => Flag_Id, Constant_Present => True, Object_Definition => New_Occurrence_Of (Standard_Boolean, Loc), Expression => Relocate_Node (Expr)); Append (Flag_Decl, Acts); Analyze (Flag_Decl); -- Replace the expression with a reference to the flag Rewrite (Expression (N), New_Occurrence_Of (Flag_Id, Loc)); Analyze (Expression (N)); end Force_Boolean_Evaluation; -------------------- -- Process_Action -- -------------------- function Process_Action (Act : Node_Id) return Traverse_Result is begin if Nkind (Act) = N_Object_Declaration and then Is_Finalizable_Transient (Act, N) then Process_Transient_In_Expression (Act, N, Acts); return Abandon; -- Avoid processing temporary function results multiple times when -- dealing with nested expression_with_actions. elsif Nkind (Act) = N_Expression_With_Actions then return Abandon; -- Do not process temporary function results in loops. This is done -- by Expand_N_Loop_Statement and Build_Finalizer. elsif Nkind (Act) = N_Loop_Statement then return Abandon; end if; return OK; end Process_Action; procedure Process_Single_Action is new Traverse_Proc (Process_Action); -- Local variables Act : Node_Id; -- Start of processing for Expand_N_Expression_With_Actions begin -- Do not evaluate the expression when it denotes an entity because the -- expression_with_actions node will be replaced by the reference. if Is_Entity_Name (Expression (N)) then null; -- Do not evaluate the expression when there are no actions because the -- expression_with_actions node will be replaced by the expression. elsif No (Acts) or else Is_Empty_List (Acts) then null; -- Force the evaluation of the expression by capturing its value in a -- temporary. This ensures that aliases of transient objects do not leak -- to the expression of the expression_with_actions node: -- do -- Trans_Id : Ctrl_Typ := ...; -- Alias : ... := Trans_Id; -- in ... Alias ... end; -- In the example above, Trans_Id cannot be finalized at the end of the -- actions list because this may affect the alias and the final value of -- the expression_with_actions. Forcing the evaluation encapsulates the -- reference to the Alias within the actions list: -- do -- Trans_Id : Ctrl_Typ := ...; -- Alias : ... := Trans_Id; -- Val : constant Boolean := ... Alias ...; -- <finalize Trans_Id> -- in Val end; -- Once this transformation is performed, it is safe to finalize the -- transient object at the end of the actions list. -- Note that Force_Evaluation does not remove side effects in operators -- because it assumes that all operands are evaluated and side effect -- free. This is not the case when an operand depends implicitly on the -- transient object through the use of access types. elsif Is_Boolean_Type (Etype (Expression (N))) then Force_Boolean_Evaluation (Expression (N)); -- The expression of an expression_with_actions node may not necessarily -- be Boolean when the node appears in an if expression. In this case do -- the usual forced evaluation to encapsulate potential aliasing. else Force_Evaluation (Expression (N)); end if; -- Process all transient objects found within the actions of the EWA -- node. Act := First (Acts); while Present (Act) loop Process_Single_Action (Act); Next (Act); end loop; -- Deal with case where there are no actions. In this case we simply -- rewrite the node with its expression since we don't need the actions -- and the specification of this node does not allow a null action list. -- Note: we use Rewrite instead of Replace, because Codepeer is using -- the expanded tree and relying on being able to retrieve the original -- tree in cases like this. This raises a whole lot of issues of whether -- we have problems elsewhere, which will be addressed in the future??? if Is_Empty_List (Acts) then Rewrite (N, Relocate_Node (Expression (N))); end if; end Expand_N_Expression_With_Actions; ---------------------------- -- Expand_N_If_Expression -- ---------------------------- -- Deal with limited types and condition actions procedure Expand_N_If_Expression (N : Node_Id) is Cond : constant Node_Id := First (Expressions (N)); Loc : constant Source_Ptr := Sloc (N); Thenx : constant Node_Id := Next (Cond); Elsex : constant Node_Id := Next (Thenx); Typ : constant Entity_Id := Etype (N); Actions : List_Id; Cnn : Entity_Id; Decl : Node_Id; Expr : Node_Id; New_If : Node_Id; New_N : Node_Id; Ptr_Typ : Entity_Id; begin -- Check for MINIMIZED/ELIMINATED overflow mode if Minimized_Eliminated_Overflow_Check (N) then Apply_Arithmetic_Overflow_Check (N); return; end if; -- Fold at compile time if condition known. We have already folded -- static if expressions, but it is possible to fold any case in which -- the condition is known at compile time, even though the result is -- non-static. -- Note that we don't do the fold of such cases in Sem_Elab because -- it can cause infinite loops with the expander adding a conditional -- expression, and Sem_Elab circuitry removing it repeatedly. if Compile_Time_Known_Value (Cond) then declare function Fold_Known_Value (Cond : Node_Id) return Boolean; -- Fold at compile time. Assumes condition known. Return True if -- folding occurred, meaning we're done. ---------------------- -- Fold_Known_Value -- ---------------------- function Fold_Known_Value (Cond : Node_Id) return Boolean is begin if Is_True (Expr_Value (Cond)) then Expr := Thenx; Actions := Then_Actions (N); else Expr := Elsex; Actions := Else_Actions (N); end if; Remove (Expr); if Present (Actions) then -- To minimize the use of Expression_With_Actions, just skip -- the optimization as it is not critical for correctness. if Minimize_Expression_With_Actions then return False; end if; Rewrite (N, Make_Expression_With_Actions (Loc, Expression => Relocate_Node (Expr), Actions => Actions)); Analyze_And_Resolve (N, Typ); else Rewrite (N, Relocate_Node (Expr)); end if; -- Note that the result is never static (legitimate cases of -- static if expressions were folded in Sem_Eval). Set_Is_Static_Expression (N, False); return True; end Fold_Known_Value; begin if Fold_Known_Value (Cond) then return; end if; end; end if; -- If the type is limited, and the back end does not handle limited -- types, then we expand as follows to avoid the possibility of -- improper copying. -- type Ptr is access all Typ; -- Cnn : Ptr; -- if cond then -- <<then actions>> -- Cnn := then-expr'Unrestricted_Access; -- else -- <<else actions>> -- Cnn := else-expr'Unrestricted_Access; -- end if; -- and replace the if expression by a reference to Cnn.all. -- This special case can be skipped if the back end handles limited -- types properly and ensures that no incorrect copies are made. if Is_By_Reference_Type (Typ) and then not Back_End_Handles_Limited_Types then -- When the "then" or "else" expressions involve controlled function -- calls, generated temporaries are chained on the corresponding list -- of actions. These temporaries need to be finalized after the if -- expression is evaluated. Process_If_Case_Statements (N, Then_Actions (N)); Process_If_Case_Statements (N, Else_Actions (N)); -- Generate: -- type Ann is access all Typ; Ptr_Typ := Make_Temporary (Loc, 'A'); Insert_Action (N, Make_Full_Type_Declaration (Loc, Defining_Identifier => Ptr_Typ, Type_Definition => Make_Access_To_Object_Definition (Loc, All_Present => True, Subtype_Indication => New_Occurrence_Of (Typ, Loc)))); -- Generate: -- Cnn : Ann; Cnn := Make_Temporary (Loc, 'C', N); Decl := Make_Object_Declaration (Loc, Defining_Identifier => Cnn, Object_Definition => New_Occurrence_Of (Ptr_Typ, Loc)); -- Generate: -- if Cond then -- Cnn := <Thenx>'Unrestricted_Access; -- else -- Cnn := <Elsex>'Unrestricted_Access; -- end if; New_If := Make_Implicit_If_Statement (N, Condition => Relocate_Node (Cond), Then_Statements => New_List ( Make_Assignment_Statement (Sloc (Thenx), Name => New_Occurrence_Of (Cnn, Sloc (Thenx)), Expression => Make_Attribute_Reference (Loc, Prefix => Relocate_Node (Thenx), Attribute_Name => Name_Unrestricted_Access))), Else_Statements => New_List ( Make_Assignment_Statement (Sloc (Elsex), Name => New_Occurrence_Of (Cnn, Sloc (Elsex)), Expression => Make_Attribute_Reference (Loc, Prefix => Relocate_Node (Elsex), Attribute_Name => Name_Unrestricted_Access)))); -- Preserve the original context for which the if statement is being -- generated. This is needed by the finalization machinery to prevent -- the premature finalization of controlled objects found within the -- if statement. Set_From_Conditional_Expression (New_If); New_N := Make_Explicit_Dereference (Loc, Prefix => New_Occurrence_Of (Cnn, Loc)); -- If the result is an unconstrained array and the if expression is in a -- context other than the initializing expression of the declaration of -- an object, then we pull out the if expression as follows: -- Cnn : constant typ := if-expression -- and then replace the if expression with an occurrence of Cnn. This -- avoids the need in the back end to create on-the-fly variable length -- temporaries (which it cannot do!) -- Note that the test for being in an object declaration avoids doing an -- unnecessary expansion, and also avoids infinite recursion. elsif Is_Array_Type (Typ) and then not Is_Constrained (Typ) and then (Nkind (Parent (N)) /= N_Object_Declaration or else Expression (Parent (N)) /= N) then declare Cnn : constant Node_Id := Make_Temporary (Loc, 'C', N); begin Insert_Action (N, Make_Object_Declaration (Loc, Defining_Identifier => Cnn, Constant_Present => True, Object_Definition => New_Occurrence_Of (Typ, Loc), Expression => Relocate_Node (N), Has_Init_Expression => True)); Rewrite (N, New_Occurrence_Of (Cnn, Loc)); return; end; -- For other types, we only need to expand if there are other actions -- associated with either branch. elsif Present (Then_Actions (N)) or else Present (Else_Actions (N)) then -- We now wrap the actions into the appropriate expression if Minimize_Expression_With_Actions and then (Is_Elementary_Type (Underlying_Type (Typ)) or else Is_Constrained (Underlying_Type (Typ))) then -- If we can't use N_Expression_With_Actions nodes, then we insert -- the following sequence of actions (using Insert_Actions): -- Cnn : typ; -- if cond then -- <<then actions>> -- Cnn := then-expr; -- else -- <<else actions>> -- Cnn := else-expr -- end if; -- and replace the if expression by a reference to Cnn Cnn := Make_Temporary (Loc, 'C', N); Decl := Make_Object_Declaration (Loc, Defining_Identifier => Cnn, Object_Definition => New_Occurrence_Of (Typ, Loc)); New_If := Make_Implicit_If_Statement (N, Condition => Relocate_Node (Cond), Then_Statements => New_List ( Make_Assignment_Statement (Sloc (Thenx), Name => New_Occurrence_Of (Cnn, Sloc (Thenx)), Expression => Relocate_Node (Thenx))), Else_Statements => New_List ( Make_Assignment_Statement (Sloc (Elsex), Name => New_Occurrence_Of (Cnn, Sloc (Elsex)), Expression => Relocate_Node (Elsex)))); Set_Assignment_OK (Name (First (Then_Statements (New_If)))); Set_Assignment_OK (Name (First (Else_Statements (New_If)))); New_N := New_Occurrence_Of (Cnn, Loc); -- Regular path using Expression_With_Actions else if Present (Then_Actions (N)) then Rewrite (Thenx, Make_Expression_With_Actions (Sloc (Thenx), Actions => Then_Actions (N), Expression => Relocate_Node (Thenx))); Set_Then_Actions (N, No_List); Analyze_And_Resolve (Thenx, Typ); end if; if Present (Else_Actions (N)) then Rewrite (Elsex, Make_Expression_With_Actions (Sloc (Elsex), Actions => Else_Actions (N), Expression => Relocate_Node (Elsex))); Set_Else_Actions (N, No_List); Analyze_And_Resolve (Elsex, Typ); end if; return; end if; -- If no actions then no expansion needed, gigi will handle it using the -- same approach as a C conditional expression. else return; end if; -- Fall through here for either the limited expansion, or the case of -- inserting actions for non-limited types. In both these cases, we must -- move the SLOC of the parent If statement to the newly created one and -- change it to the SLOC of the expression which, after expansion, will -- correspond to what is being evaluated. if Present (Parent (N)) and then Nkind (Parent (N)) = N_If_Statement then Set_Sloc (New_If, Sloc (Parent (N))); Set_Sloc (Parent (N), Loc); end if; -- Make sure Then_Actions and Else_Actions are appropriately moved -- to the new if statement. if Present (Then_Actions (N)) then Insert_List_Before (First (Then_Statements (New_If)), Then_Actions (N)); end if; if Present (Else_Actions (N)) then Insert_List_Before (First (Else_Statements (New_If)), Else_Actions (N)); end if; Insert_Action (N, Decl); Insert_Action (N, New_If); Rewrite (N, New_N); Analyze_And_Resolve (N, Typ); end Expand_N_If_Expression; ----------------- -- Expand_N_In -- ----------------- procedure Expand_N_In (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Restyp : constant Entity_Id := Etype (N); Lop : constant Node_Id := Left_Opnd (N); Rop : constant Node_Id := Right_Opnd (N); Static : constant Boolean := Is_OK_Static_Expression (N); procedure Substitute_Valid_Check; -- Replaces node N by Lop'Valid. This is done when we have an explicit -- test for the left operand being in range of its subtype. ---------------------------- -- Substitute_Valid_Check -- ---------------------------- procedure Substitute_Valid_Check is function Is_OK_Object_Reference (Nod : Node_Id) return Boolean; -- Determine whether arbitrary node Nod denotes a source object that -- may safely act as prefix of attribute 'Valid. ---------------------------- -- Is_OK_Object_Reference -- ---------------------------- function Is_OK_Object_Reference (Nod : Node_Id) return Boolean is Obj_Ref : Node_Id; begin -- Inspect the original operand Obj_Ref := Original_Node (Nod); -- The object reference must be a source construct, otherwise the -- codefix suggestion may refer to nonexistent code from a user -- perspective. if Comes_From_Source (Obj_Ref) then -- Recover the actual object reference. There may be more cases -- to consider??? loop if Nkind_In (Obj_Ref, N_Type_Conversion, N_Unchecked_Type_Conversion) then Obj_Ref := Expression (Obj_Ref); else exit; end if; end loop; return Is_Object_Reference (Obj_Ref); end if; return False; end Is_OK_Object_Reference; -- Start of processing for Substitute_Valid_Check begin Rewrite (N, Make_Attribute_Reference (Loc, Prefix => Relocate_Node (Lop), Attribute_Name => Name_Valid)); Analyze_And_Resolve (N, Restyp); -- Emit a warning when the left-hand operand of the membership test -- is a source object, otherwise the use of attribute 'Valid would be -- illegal. The warning is not given when overflow checking is either -- MINIMIZED or ELIMINATED, as the danger of optimization has been -- eliminated above. if Is_OK_Object_Reference (Lop) and then Overflow_Check_Mode not in Minimized_Or_Eliminated then Error_Msg_N ("??explicit membership test may be optimized away", N); Error_Msg_N -- CODEFIX ("\??use ''Valid attribute instead", N); end if; end Substitute_Valid_Check; -- Local variables Ltyp : Entity_Id; Rtyp : Entity_Id; -- Start of processing for Expand_N_In begin -- If set membership case, expand with separate procedure if Present (Alternatives (N)) then Expand_Set_Membership (N); return; end if; -- Not set membership, proceed with expansion Ltyp := Etype (Left_Opnd (N)); Rtyp := Etype (Right_Opnd (N)); -- If MINIMIZED/ELIMINATED overflow mode and type is a signed integer -- type, then expand with a separate procedure. Note the use of the -- flag No_Minimize_Eliminate to prevent infinite recursion. if Overflow_Check_Mode in Minimized_Or_Eliminated and then Is_Signed_Integer_Type (Ltyp) and then not No_Minimize_Eliminate (N) then Expand_Membership_Minimize_Eliminate_Overflow (N); return; end if; -- Check case of explicit test for an expression in range of its -- subtype. This is suspicious usage and we replace it with a 'Valid -- test and give a warning for scalar types. if Is_Scalar_Type (Ltyp) -- Only relevant for source comparisons and then Comes_From_Source (N) -- In floating-point this is a standard way to check for finite values -- and using 'Valid would typically be a pessimization. and then not Is_Floating_Point_Type (Ltyp) -- Don't give the message unless right operand is a type entity and -- the type of the left operand matches this type. Note that this -- eliminates the cases where MINIMIZED/ELIMINATED mode overflow -- checks have changed the type of the left operand. and then Nkind (Rop) in N_Has_Entity and then Ltyp = Entity (Rop) -- Skip this for predicated types, where such expressions are a -- reasonable way of testing if something meets the predicate. and then not Present (Predicate_Function (Ltyp)) then Substitute_Valid_Check; return; end if; -- Do validity check on operands if Validity_Checks_On and Validity_Check_Operands then Ensure_Valid (Left_Opnd (N)); Validity_Check_Range (Right_Opnd (N)); end if; -- Case of explicit range if Nkind (Rop) = N_Range then declare Lo : constant Node_Id := Low_Bound (Rop); Hi : constant Node_Id := High_Bound (Rop); Lo_Orig : constant Node_Id := Original_Node (Lo); Hi_Orig : constant Node_Id := Original_Node (Hi); Lcheck : Compare_Result; Ucheck : Compare_Result; Warn1 : constant Boolean := Constant_Condition_Warnings and then Comes_From_Source (N) and then not In_Instance; -- This must be true for any of the optimization warnings, we -- clearly want to give them only for source with the flag on. We -- also skip these warnings in an instance since it may be the -- case that different instantiations have different ranges. Warn2 : constant Boolean := Warn1 and then Nkind (Original_Node (Rop)) = N_Range and then Is_Integer_Type (Etype (Lo)); -- For the case where only one bound warning is elided, we also -- insist on an explicit range and an integer type. The reason is -- that the use of enumeration ranges including an end point is -- common, as is the use of a subtype name, one of whose bounds is -- the same as the type of the expression. begin -- If test is explicit x'First .. x'Last, replace by valid check -- Could use some individual comments for this complex test ??? if Is_Scalar_Type (Ltyp) -- And left operand is X'First where X matches left operand -- type (this eliminates cases of type mismatch, including -- the cases where ELIMINATED/MINIMIZED mode has changed the -- type of the left operand. and then Nkind (Lo_Orig) = N_Attribute_Reference and then Attribute_Name (Lo_Orig) = Name_First and then Nkind (Prefix (Lo_Orig)) in N_Has_Entity and then Entity (Prefix (Lo_Orig)) = Ltyp -- Same tests for right operand and then Nkind (Hi_Orig) = N_Attribute_Reference and then Attribute_Name (Hi_Orig) = Name_Last and then Nkind (Prefix (Hi_Orig)) in N_Has_Entity and then Entity (Prefix (Hi_Orig)) = Ltyp -- Relevant only for source cases and then Comes_From_Source (N) then Substitute_Valid_Check; goto Leave; end if; -- If bounds of type are known at compile time, and the end points -- are known at compile time and identical, this is another case -- for substituting a valid test. We only do this for discrete -- types, since it won't arise in practice for float types. if Comes_From_Source (N) and then Is_Discrete_Type (Ltyp) and then Compile_Time_Known_Value (Type_High_Bound (Ltyp)) and then Compile_Time_Known_Value (Type_Low_Bound (Ltyp)) and then Compile_Time_Known_Value (Lo) and then Compile_Time_Known_Value (Hi) and then Expr_Value (Type_High_Bound (Ltyp)) = Expr_Value (Hi) and then Expr_Value (Type_Low_Bound (Ltyp)) = Expr_Value (Lo) -- Kill warnings in instances, since they may be cases where we -- have a test in the generic that makes sense with some types -- and not with other types. and then not In_Instance then Substitute_Valid_Check; goto Leave; end if; -- If we have an explicit range, do a bit of optimization based on -- range analysis (we may be able to kill one or both checks). Lcheck := Compile_Time_Compare (Lop, Lo, Assume_Valid => False); Ucheck := Compile_Time_Compare (Lop, Hi, Assume_Valid => False); -- If either check is known to fail, replace result by False since -- the other check does not matter. Preserve the static flag for -- legality checks, because we are constant-folding beyond RM 4.9. if Lcheck = LT or else Ucheck = GT then if Warn1 then Error_Msg_N ("?c?range test optimized away", N); Error_Msg_N ("\?c?value is known to be out of range", N); end if; Rewrite (N, New_Occurrence_Of (Standard_False, Loc)); Analyze_And_Resolve (N, Restyp); Set_Is_Static_Expression (N, Static); goto Leave; -- If both checks are known to succeed, replace result by True, -- since we know we are in range. elsif Lcheck in Compare_GE and then Ucheck in Compare_LE then if Warn1 then Error_Msg_N ("?c?range test optimized away", N); Error_Msg_N ("\?c?value is known to be in range", N); end if; Rewrite (N, New_Occurrence_Of (Standard_True, Loc)); Analyze_And_Resolve (N, Restyp); Set_Is_Static_Expression (N, Static); goto Leave; -- If lower bound check succeeds and upper bound check is not -- known to succeed or fail, then replace the range check with -- a comparison against the upper bound. elsif Lcheck in Compare_GE then if Warn2 and then not In_Instance then Error_Msg_N ("??lower bound test optimized away", Lo); Error_Msg_N ("\??value is known to be in range", Lo); end if; Rewrite (N, Make_Op_Le (Loc, Left_Opnd => Lop, Right_Opnd => High_Bound (Rop))); Analyze_And_Resolve (N, Restyp); goto Leave; -- If upper bound check succeeds and lower bound check is not -- known to succeed or fail, then replace the range check with -- a comparison against the lower bound. elsif Ucheck in Compare_LE then if Warn2 and then not In_Instance then Error_Msg_N ("??upper bound test optimized away", Hi); Error_Msg_N ("\??value is known to be in range", Hi); end if; Rewrite (N, Make_Op_Ge (Loc, Left_Opnd => Lop, Right_Opnd => Low_Bound (Rop))); Analyze_And_Resolve (N, Restyp); goto Leave; end if; -- We couldn't optimize away the range check, but there is one -- more issue. If we are checking constant conditionals, then we -- see if we can determine the outcome assuming everything is -- valid, and if so give an appropriate warning. if Warn1 and then not Assume_No_Invalid_Values then Lcheck := Compile_Time_Compare (Lop, Lo, Assume_Valid => True); Ucheck := Compile_Time_Compare (Lop, Hi, Assume_Valid => True); -- Result is out of range for valid value if Lcheck = LT or else Ucheck = GT then Error_Msg_N ("?c?value can only be in range if it is invalid", N); -- Result is in range for valid value elsif Lcheck in Compare_GE and then Ucheck in Compare_LE then Error_Msg_N ("?c?value can only be out of range if it is invalid", N); -- Lower bound check succeeds if value is valid elsif Warn2 and then Lcheck in Compare_GE then Error_Msg_N ("?c?lower bound check only fails if it is invalid", Lo); -- Upper bound check succeeds if value is valid elsif Warn2 and then Ucheck in Compare_LE then Error_Msg_N ("?c?upper bound check only fails for invalid values", Hi); end if; end if; end; -- For all other cases of an explicit range, nothing to be done goto Leave; -- Here right operand is a subtype mark else declare Typ : Entity_Id := Etype (Rop); Is_Acc : constant Boolean := Is_Access_Type (Typ); Cond : Node_Id := Empty; New_N : Node_Id; Obj : Node_Id := Lop; SCIL_Node : Node_Id; begin Remove_Side_Effects (Obj); -- For tagged type, do tagged membership operation if Is_Tagged_Type (Typ) then -- No expansion will be performed for VM targets, as the VM -- back-ends will handle the membership tests directly. if Tagged_Type_Expansion then Tagged_Membership (N, SCIL_Node, New_N); Rewrite (N, New_N); Analyze_And_Resolve (N, Restyp); -- Update decoration of relocated node referenced by the -- SCIL node. if Generate_SCIL and then Present (SCIL_Node) then Set_SCIL_Node (N, SCIL_Node); end if; end if; goto Leave; -- If type is scalar type, rewrite as x in t'First .. t'Last. -- This reason we do this is that the bounds may have the wrong -- type if they come from the original type definition. Also this -- way we get all the processing above for an explicit range. -- Don't do this for predicated types, since in this case we -- want to check the predicate. elsif Is_Scalar_Type (Typ) then if No (Predicate_Function (Typ)) then Rewrite (Rop, Make_Range (Loc, Low_Bound => Make_Attribute_Reference (Loc, Attribute_Name => Name_First, Prefix => New_Occurrence_Of (Typ, Loc)), High_Bound => Make_Attribute_Reference (Loc, Attribute_Name => Name_Last, Prefix => New_Occurrence_Of (Typ, Loc)))); Analyze_And_Resolve (N, Restyp); end if; goto Leave; -- Ada 2005 (AI-216): Program_Error is raised when evaluating -- a membership test if the subtype mark denotes a constrained -- Unchecked_Union subtype and the expression lacks inferable -- discriminants. elsif Is_Unchecked_Union (Base_Type (Typ)) and then Is_Constrained (Typ) and then not Has_Inferable_Discriminants (Lop) then Insert_Action (N, Make_Raise_Program_Error (Loc, Reason => PE_Unchecked_Union_Restriction)); -- Prevent Gigi from generating incorrect code by rewriting the -- test as False. What is this undocumented thing about ??? Rewrite (N, New_Occurrence_Of (Standard_False, Loc)); goto Leave; end if; -- Here we have a non-scalar type if Is_Acc then Typ := Designated_Type (Typ); end if; if not Is_Constrained (Typ) then Rewrite (N, New_Occurrence_Of (Standard_True, Loc)); Analyze_And_Resolve (N, Restyp); -- For the constrained array case, we have to check the subscripts -- for an exact match if the lengths are non-zero (the lengths -- must match in any case). elsif Is_Array_Type (Typ) then Check_Subscripts : declare function Build_Attribute_Reference (E : Node_Id; Nam : Name_Id; Dim : Nat) return Node_Id; -- Build attribute reference E'Nam (Dim) ------------------------------- -- Build_Attribute_Reference -- ------------------------------- function Build_Attribute_Reference (E : Node_Id; Nam : Name_Id; Dim : Nat) return Node_Id is begin return Make_Attribute_Reference (Loc, Prefix => E, Attribute_Name => Nam, Expressions => New_List ( Make_Integer_Literal (Loc, Dim))); end Build_Attribute_Reference; -- Start of processing for Check_Subscripts begin for J in 1 .. Number_Dimensions (Typ) loop Evolve_And_Then (Cond, Make_Op_Eq (Loc, Left_Opnd => Build_Attribute_Reference (Duplicate_Subexpr_No_Checks (Obj), Name_First, J), Right_Opnd => Build_Attribute_Reference (New_Occurrence_Of (Typ, Loc), Name_First, J))); Evolve_And_Then (Cond, Make_Op_Eq (Loc, Left_Opnd => Build_Attribute_Reference (Duplicate_Subexpr_No_Checks (Obj), Name_Last, J), Right_Opnd => Build_Attribute_Reference (New_Occurrence_Of (Typ, Loc), Name_Last, J))); end loop; if Is_Acc then Cond := Make_Or_Else (Loc, Left_Opnd => Make_Op_Eq (Loc, Left_Opnd => Obj, Right_Opnd => Make_Null (Loc)), Right_Opnd => Cond); end if; Rewrite (N, Cond); Analyze_And_Resolve (N, Restyp); end Check_Subscripts; -- These are the cases where constraint checks may be required, -- e.g. records with possible discriminants else -- Expand the test into a series of discriminant comparisons. -- The expression that is built is the negation of the one that -- is used for checking discriminant constraints. Obj := Relocate_Node (Left_Opnd (N)); if Has_Discriminants (Typ) then Cond := Make_Op_Not (Loc, Right_Opnd => Build_Discriminant_Checks (Obj, Typ)); if Is_Acc then Cond := Make_Or_Else (Loc, Left_Opnd => Make_Op_Eq (Loc, Left_Opnd => Obj, Right_Opnd => Make_Null (Loc)), Right_Opnd => Cond); end if; else Cond := New_Occurrence_Of (Standard_True, Loc); end if; Rewrite (N, Cond); Analyze_And_Resolve (N, Restyp); end if; -- Ada 2012 (AI05-0149): Handle membership tests applied to an -- expression of an anonymous access type. This can involve an -- accessibility test and a tagged type membership test in the -- case of tagged designated types. if Ada_Version >= Ada_2012 and then Is_Acc and then Ekind (Ltyp) = E_Anonymous_Access_Type then declare Expr_Entity : Entity_Id := Empty; New_N : Node_Id; Param_Level : Node_Id; Type_Level : Node_Id; begin if Is_Entity_Name (Lop) then Expr_Entity := Param_Entity (Lop); if not Present (Expr_Entity) then Expr_Entity := Entity (Lop); end if; end if; -- If a conversion of the anonymous access value to the -- tested type would be illegal, then the result is False. if not Valid_Conversion (Lop, Rtyp, Lop, Report_Errs => False) then Rewrite (N, New_Occurrence_Of (Standard_False, Loc)); Analyze_And_Resolve (N, Restyp); -- Apply an accessibility check if the access object has an -- associated access level and when the level of the type is -- less deep than the level of the access parameter. This -- only occur for access parameters and stand-alone objects -- of an anonymous access type. else if Present (Expr_Entity) and then Present (Effective_Extra_Accessibility (Expr_Entity)) and then UI_Gt (Object_Access_Level (Lop), Type_Access_Level (Rtyp)) then Param_Level := New_Occurrence_Of (Effective_Extra_Accessibility (Expr_Entity), Loc); Type_Level := Make_Integer_Literal (Loc, Type_Access_Level (Rtyp)); -- Return True only if the accessibility level of the -- expression entity is not deeper than the level of -- the tested access type. Rewrite (N, Make_And_Then (Loc, Left_Opnd => Relocate_Node (N), Right_Opnd => Make_Op_Le (Loc, Left_Opnd => Param_Level, Right_Opnd => Type_Level))); Analyze_And_Resolve (N); end if; -- If the designated type is tagged, do tagged membership -- operation. -- *** NOTE: we have to check not null before doing the -- tagged membership test (but maybe that can be done -- inside Tagged_Membership?). if Is_Tagged_Type (Typ) then Rewrite (N, Make_And_Then (Loc, Left_Opnd => Relocate_Node (N), Right_Opnd => Make_Op_Ne (Loc, Left_Opnd => Obj, Right_Opnd => Make_Null (Loc)))); -- No expansion will be performed for VM targets, as -- the VM back-ends will handle the membership tests -- directly. if Tagged_Type_Expansion then -- Note that we have to pass Original_Node, because -- the membership test might already have been -- rewritten by earlier parts of membership test. Tagged_Membership (Original_Node (N), SCIL_Node, New_N); -- Update decoration of relocated node referenced -- by the SCIL node. if Generate_SCIL and then Present (SCIL_Node) then Set_SCIL_Node (New_N, SCIL_Node); end if; Rewrite (N, Make_And_Then (Loc, Left_Opnd => Relocate_Node (N), Right_Opnd => New_N)); Analyze_And_Resolve (N, Restyp); end if; end if; end if; end; end if; end; end if; -- At this point, we have done the processing required for the basic -- membership test, but not yet dealt with the predicate. <<Leave>> -- If a predicate is present, then we do the predicate test, but we -- most certainly want to omit this if we are within the predicate -- function itself, since otherwise we have an infinite recursion. -- The check should also not be emitted when testing against a range -- (the check is only done when the right operand is a subtype; see -- RM12-4.5.2 (28.1/3-30/3)). Predicate_Check : declare function In_Range_Check return Boolean; -- Within an expanded range check that may raise Constraint_Error do -- not generate a predicate check as well. It is redundant because -- the context will add an explicit predicate check, and it will -- raise the wrong exception if it fails. -------------------- -- In_Range_Check -- -------------------- function In_Range_Check return Boolean is P : Node_Id; begin P := Parent (N); while Present (P) loop if Nkind (P) = N_Raise_Constraint_Error then return True; elsif Nkind (P) in N_Statement_Other_Than_Procedure_Call or else Nkind (P) = N_Procedure_Call_Statement or else Nkind (P) in N_Declaration then return False; end if; P := Parent (P); end loop; return False; end In_Range_Check; -- Local variables PFunc : constant Entity_Id := Predicate_Function (Rtyp); R_Op : Node_Id; -- Start of processing for Predicate_Check begin if Present (PFunc) and then Current_Scope /= PFunc and then Nkind (Rop) /= N_Range then if not In_Range_Check then R_Op := Make_Predicate_Call (Rtyp, Lop, Mem => True); else R_Op := New_Occurrence_Of (Standard_True, Loc); end if; Rewrite (N, Make_And_Then (Loc, Left_Opnd => Relocate_Node (N), Right_Opnd => R_Op)); -- Analyze new expression, mark left operand as analyzed to -- avoid infinite recursion adding predicate calls. Similarly, -- suppress further range checks on the call. Set_Analyzed (Left_Opnd (N)); Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks); -- All done, skip attempt at compile time determination of result return; end if; end Predicate_Check; end Expand_N_In; -------------------------------- -- Expand_N_Indexed_Component -- -------------------------------- procedure Expand_N_Indexed_Component (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Typ : constant Entity_Id := Etype (N); P : constant Node_Id := Prefix (N); T : constant Entity_Id := Etype (P); Atp : Entity_Id; begin -- A special optimization, if we have an indexed component that is -- selecting from a slice, then we can eliminate the slice, since, for -- example, x (i .. j)(k) is identical to x(k). The only difference is -- the range check required by the slice. The range check for the slice -- itself has already been generated. The range check for the -- subscripting operation is ensured by converting the subject to -- the subtype of the slice. -- This optimization not only generates better code, avoiding slice -- messing especially in the packed case, but more importantly bypasses -- some problems in handling this peculiar case, for example, the issue -- of dealing specially with object renamings. if Nkind (P) = N_Slice -- This optimization is disabled for CodePeer because it can transform -- an index-check constraint_error into a range-check constraint_error -- and CodePeer cares about that distinction. and then not CodePeer_Mode then Rewrite (N, Make_Indexed_Component (Loc, Prefix => Prefix (P), Expressions => New_List ( Convert_To (Etype (First_Index (Etype (P))), First (Expressions (N)))))); Analyze_And_Resolve (N, Typ); return; end if; -- Ada 2005 (AI-318-02): If the prefix is a call to a build-in-place -- function, then additional actuals must be passed. if Ada_Version >= Ada_2005 and then Is_Build_In_Place_Function_Call (P) then Make_Build_In_Place_Call_In_Anonymous_Context (P); end if; -- If the prefix is an access type, then we unconditionally rewrite if -- as an explicit dereference. This simplifies processing for several -- cases, including packed array cases and certain cases in which checks -- must be generated. We used to try to do this only when it was -- necessary, but it cleans up the code to do it all the time. if Is_Access_Type (T) then Insert_Explicit_Dereference (P); Analyze_And_Resolve (P, Designated_Type (T)); Atp := Designated_Type (T); else Atp := T; end if; -- Generate index and validity checks Generate_Index_Checks (N); if Validity_Checks_On and then Validity_Check_Subscripts then Apply_Subscript_Validity_Checks (N); end if; -- If selecting from an array with atomic components, and atomic sync -- is not suppressed for this array type, set atomic sync flag. if (Has_Atomic_Components (Atp) and then not Atomic_Synchronization_Disabled (Atp)) or else (Is_Atomic (Typ) and then not Atomic_Synchronization_Disabled (Typ)) or else (Is_Entity_Name (P) and then Has_Atomic_Components (Entity (P)) and then not Atomic_Synchronization_Disabled (Entity (P))) then Activate_Atomic_Synchronization (N); end if; -- All done if the prefix is not a packed array implemented specially if not (Is_Packed (Etype (Prefix (N))) and then Present (Packed_Array_Impl_Type (Etype (Prefix (N))))) then return; end if; -- For packed arrays that are not bit-packed (i.e. the case of an array -- with one or more index types with a non-contiguous enumeration type), -- we can always use the normal packed element get circuit. if not Is_Bit_Packed_Array (Etype (Prefix (N))) then Expand_Packed_Element_Reference (N); return; end if; -- For a reference to a component of a bit packed array, we convert it -- to a reference to the corresponding Packed_Array_Impl_Type. We only -- want to do this for simple references, and not for: -- Left side of assignment, or prefix of left side of assignment, or -- prefix of the prefix, to handle packed arrays of packed arrays, -- This case is handled in Exp_Ch5.Expand_N_Assignment_Statement -- Renaming objects in renaming associations -- This case is handled when a use of the renamed variable occurs -- Actual parameters for a procedure call -- This case is handled in Exp_Ch6.Expand_Actuals -- The second expression in a 'Read attribute reference -- The prefix of an address or bit or size attribute reference -- The following circuit detects these exceptions. Note that we need to -- deal with implicit dereferences when climbing up the parent chain, -- with the additional difficulty that the type of parents may have yet -- to be resolved since prefixes are usually resolved first. declare Child : Node_Id := N; Parnt : Node_Id := Parent (N); begin loop if Nkind (Parnt) = N_Unchecked_Expression then null; elsif Nkind_In (Parnt, N_Object_Renaming_Declaration, N_Procedure_Call_Statement) or else (Nkind (Parnt) = N_Parameter_Association and then Nkind (Parent (Parnt)) = N_Procedure_Call_Statement) then return; elsif Nkind (Parnt) = N_Attribute_Reference and then Nam_In (Attribute_Name (Parnt), Name_Address, Name_Bit, Name_Size) and then Prefix (Parnt) = Child then return; elsif Nkind (Parnt) = N_Assignment_Statement and then Name (Parnt) = Child then return; -- If the expression is an index of an indexed component, it must -- be expanded regardless of context. elsif Nkind (Parnt) = N_Indexed_Component and then Child /= Prefix (Parnt) then Expand_Packed_Element_Reference (N); return; elsif Nkind (Parent (Parnt)) = N_Assignment_Statement and then Name (Parent (Parnt)) = Parnt then return; elsif Nkind (Parnt) = N_Attribute_Reference and then Attribute_Name (Parnt) = Name_Read and then Next (First (Expressions (Parnt))) = Child then return; elsif Nkind (Parnt) = N_Indexed_Component and then Prefix (Parnt) = Child then null; elsif Nkind (Parnt) = N_Selected_Component and then Prefix (Parnt) = Child and then not (Present (Etype (Selector_Name (Parnt))) and then Is_Access_Type (Etype (Selector_Name (Parnt)))) then null; -- If the parent is a dereference, either implicit or explicit, -- then the packed reference needs to be expanded. else Expand_Packed_Element_Reference (N); return; end if; -- Keep looking up tree for unchecked expression, or if we are the -- prefix of a possible assignment left side. Child := Parnt; Parnt := Parent (Child); end loop; end; end Expand_N_Indexed_Component; --------------------- -- Expand_N_Not_In -- --------------------- -- Replace a not in b by not (a in b) so that the expansions for (a in b) -- can be done. This avoids needing to duplicate this expansion code. procedure Expand_N_Not_In (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Typ : constant Entity_Id := Etype (N); Cfs : constant Boolean := Comes_From_Source (N); begin Rewrite (N, Make_Op_Not (Loc, Right_Opnd => Make_In (Loc, Left_Opnd => Left_Opnd (N), Right_Opnd => Right_Opnd (N)))); -- If this is a set membership, preserve list of alternatives Set_Alternatives (Right_Opnd (N), Alternatives (Original_Node (N))); -- We want this to appear as coming from source if original does (see -- transformations in Expand_N_In). Set_Comes_From_Source (N, Cfs); Set_Comes_From_Source (Right_Opnd (N), Cfs); -- Now analyze transformed node Analyze_And_Resolve (N, Typ); end Expand_N_Not_In; ------------------- -- Expand_N_Null -- ------------------- -- The only replacement required is for the case of a null of a type that -- is an access to protected subprogram, or a subtype thereof. We represent -- such access values as a record, and so we must replace the occurrence of -- null by the equivalent record (with a null address and a null pointer in -- it), so that the backend creates the proper value. procedure Expand_N_Null (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Typ : constant Entity_Id := Base_Type (Etype (N)); Agg : Node_Id; begin if Is_Access_Protected_Subprogram_Type (Typ) then Agg := Make_Aggregate (Loc, Expressions => New_List ( New_Occurrence_Of (RTE (RE_Null_Address), Loc), Make_Null (Loc))); Rewrite (N, Agg); Analyze_And_Resolve (N, Equivalent_Type (Typ)); -- For subsequent semantic analysis, the node must retain its type. -- Gigi in any case replaces this type by the corresponding record -- type before processing the node. Set_Etype (N, Typ); end if; exception when RE_Not_Available => return; end Expand_N_Null; --------------------- -- Expand_N_Op_Abs -- --------------------- procedure Expand_N_Op_Abs (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Expr : constant Node_Id := Right_Opnd (N); begin Unary_Op_Validity_Checks (N); -- Check for MINIMIZED/ELIMINATED overflow mode if Minimized_Eliminated_Overflow_Check (N) then Apply_Arithmetic_Overflow_Check (N); return; end if; -- Deal with software overflow checking if not Backend_Overflow_Checks_On_Target and then Is_Signed_Integer_Type (Etype (N)) and then Do_Overflow_Check (N) then -- The only case to worry about is when the argument is equal to the -- largest negative number, so what we do is to insert the check: -- [constraint_error when Expr = typ'Base'First] -- with the usual Duplicate_Subexpr use coding for expr Insert_Action (N, Make_Raise_Constraint_Error (Loc, Condition => Make_Op_Eq (Loc, Left_Opnd => Duplicate_Subexpr (Expr), Right_Opnd => Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Base_Type (Etype (Expr)), Loc), Attribute_Name => Name_First)), Reason => CE_Overflow_Check_Failed)); end if; end Expand_N_Op_Abs; --------------------- -- Expand_N_Op_Add -- --------------------- procedure Expand_N_Op_Add (N : Node_Id) is Typ : constant Entity_Id := Etype (N); begin Binary_Op_Validity_Checks (N); -- Check for MINIMIZED/ELIMINATED overflow mode if Minimized_Eliminated_Overflow_Check (N) then Apply_Arithmetic_Overflow_Check (N); return; end if; -- N + 0 = 0 + N = N for integer types if Is_Integer_Type (Typ) then if Compile_Time_Known_Value (Right_Opnd (N)) and then Expr_Value (Right_Opnd (N)) = Uint_0 then Rewrite (N, Left_Opnd (N)); return; elsif Compile_Time_Known_Value (Left_Opnd (N)) and then Expr_Value (Left_Opnd (N)) = Uint_0 then Rewrite (N, Right_Opnd (N)); return; end if; end if; -- Arithmetic overflow checks for signed integer/fixed point types if Is_Signed_Integer_Type (Typ) or else Is_Fixed_Point_Type (Typ) then Apply_Arithmetic_Overflow_Check (N); return; end if; -- Overflow checks for floating-point if -gnateF mode active Check_Float_Op_Overflow (N); end Expand_N_Op_Add; --------------------- -- Expand_N_Op_And -- --------------------- procedure Expand_N_Op_And (N : Node_Id) is Typ : constant Entity_Id := Etype (N); begin Binary_Op_Validity_Checks (N); if Is_Array_Type (Etype (N)) then Expand_Boolean_Operator (N); elsif Is_Boolean_Type (Etype (N)) then Adjust_Condition (Left_Opnd (N)); Adjust_Condition (Right_Opnd (N)); Set_Etype (N, Standard_Boolean); Adjust_Result_Type (N, Typ); elsif Is_Intrinsic_Subprogram (Entity (N)) then Expand_Intrinsic_Call (N, Entity (N)); end if; end Expand_N_Op_And; ------------------------ -- Expand_N_Op_Concat -- ------------------------ procedure Expand_N_Op_Concat (N : Node_Id) is Opnds : List_Id; -- List of operands to be concatenated Cnode : Node_Id; -- Node which is to be replaced by the result of concatenating the nodes -- in the list Opnds. begin -- Ensure validity of both operands Binary_Op_Validity_Checks (N); -- If we are the left operand of a concatenation higher up the tree, -- then do nothing for now, since we want to deal with a series of -- concatenations as a unit. if Nkind (Parent (N)) = N_Op_Concat and then N = Left_Opnd (Parent (N)) then return; end if; -- We get here with a concatenation whose left operand may be a -- concatenation itself with a consistent type. We need to process -- these concatenation operands from left to right, which means -- from the deepest node in the tree to the highest node. Cnode := N; while Nkind (Left_Opnd (Cnode)) = N_Op_Concat loop Cnode := Left_Opnd (Cnode); end loop; -- Now Cnode is the deepest concatenation, and its parents are the -- concatenation nodes above, so now we process bottom up, doing the -- operands. -- The outer loop runs more than once if more than one concatenation -- type is involved. Outer : loop Opnds := New_List (Left_Opnd (Cnode), Right_Opnd (Cnode)); Set_Parent (Opnds, N); -- The inner loop gathers concatenation operands Inner : while Cnode /= N and then Base_Type (Etype (Cnode)) = Base_Type (Etype (Parent (Cnode))) loop Cnode := Parent (Cnode); Append (Right_Opnd (Cnode), Opnds); end loop Inner; -- Note: The following code is a temporary workaround for N731-034 -- and N829-028 and will be kept until the general issue of internal -- symbol serialization is addressed. The workaround is kept under a -- debug switch to avoid permiating into the general case. -- Wrap the node to concatenate into an expression actions node to -- keep it nicely packaged. This is useful in the case of an assert -- pragma with a concatenation where we want to be able to delete -- the concatenation and all its expansion stuff. if Debug_Flag_Dot_H then declare Cnod : constant Node_Id := Relocate_Node (Cnode); Typ : constant Entity_Id := Base_Type (Etype (Cnode)); begin -- Note: use Rewrite rather than Replace here, so that for -- example Why_Not_Static can find the original concatenation -- node OK! Rewrite (Cnode, Make_Expression_With_Actions (Sloc (Cnode), Actions => New_List (Make_Null_Statement (Sloc (Cnode))), Expression => Cnod)); Expand_Concatenate (Cnod, Opnds); Analyze_And_Resolve (Cnode, Typ); end; -- Default case else Expand_Concatenate (Cnode, Opnds); end if; exit Outer when Cnode = N; Cnode := Parent (Cnode); end loop Outer; end Expand_N_Op_Concat; ------------------------ -- Expand_N_Op_Divide -- ------------------------ procedure Expand_N_Op_Divide (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Lopnd : constant Node_Id := Left_Opnd (N); Ropnd : constant Node_Id := Right_Opnd (N); Ltyp : constant Entity_Id := Etype (Lopnd); Rtyp : constant Entity_Id := Etype (Ropnd); Typ : Entity_Id := Etype (N); Rknow : constant Boolean := Is_Integer_Type (Typ) and then Compile_Time_Known_Value (Ropnd); Rval : Uint; begin Binary_Op_Validity_Checks (N); -- Check for MINIMIZED/ELIMINATED overflow mode if Minimized_Eliminated_Overflow_Check (N) then Apply_Arithmetic_Overflow_Check (N); return; end if; -- Otherwise proceed with expansion of division if Rknow then Rval := Expr_Value (Ropnd); end if; -- N / 1 = N for integer types if Rknow and then Rval = Uint_1 then Rewrite (N, Lopnd); return; end if; -- Convert x / 2 ** y to Shift_Right (x, y). Note that the fact that -- Is_Power_Of_2_For_Shift is set means that we know that our left -- operand is an unsigned integer, as required for this to work. if Nkind (Ropnd) = N_Op_Expon and then Is_Power_Of_2_For_Shift (Ropnd) -- We cannot do this transformation in configurable run time mode if we -- have 64-bit integers and long shifts are not available. and then (Esize (Ltyp) <= 32 or else Support_Long_Shifts_On_Target) then Rewrite (N, Make_Op_Shift_Right (Loc, Left_Opnd => Lopnd, Right_Opnd => Convert_To (Standard_Natural, Right_Opnd (Ropnd)))); Analyze_And_Resolve (N, Typ); return; end if; -- Do required fixup of universal fixed operation if Typ = Universal_Fixed then Fixup_Universal_Fixed_Operation (N); Typ := Etype (N); end if; -- Divisions with fixed-point results if Is_Fixed_Point_Type (Typ) then -- Deal with divide-by-zero check if back end cannot handle them -- and the flag is set indicating that we need such a check. Note -- that we don't need to bother here with the case of mixed-mode -- (Right operand an integer type), since these will be rewritten -- with conversions to a divide with a fixed-point right operand. if Do_Division_Check (N) and then not Backend_Divide_Checks_On_Target and then not Is_Integer_Type (Rtyp) then Set_Do_Division_Check (N, False); Insert_Action (N, Make_Raise_Constraint_Error (Loc, Condition => Make_Op_Eq (Loc, Left_Opnd => Duplicate_Subexpr_Move_Checks (Ropnd), Right_Opnd => Make_Real_Literal (Loc, Ureal_0)), Reason => CE_Divide_By_Zero)); end if; -- No special processing if Treat_Fixed_As_Integer is set, since -- from a semantic point of view such operations are simply integer -- operations and will be treated that way. if not Treat_Fixed_As_Integer (N) then if Is_Integer_Type (Rtyp) then Expand_Divide_Fixed_By_Integer_Giving_Fixed (N); else Expand_Divide_Fixed_By_Fixed_Giving_Fixed (N); end if; end if; -- Other cases of division of fixed-point operands. Again we exclude the -- case where Treat_Fixed_As_Integer is set. elsif (Is_Fixed_Point_Type (Ltyp) or else Is_Fixed_Point_Type (Rtyp)) and then not Treat_Fixed_As_Integer (N) then if Is_Integer_Type (Typ) then Expand_Divide_Fixed_By_Fixed_Giving_Integer (N); else pragma Assert (Is_Floating_Point_Type (Typ)); Expand_Divide_Fixed_By_Fixed_Giving_Float (N); end if; -- Mixed-mode operations can appear in a non-static universal context, -- in which case the integer argument must be converted explicitly. elsif Typ = Universal_Real and then Is_Integer_Type (Rtyp) then Rewrite (Ropnd, Convert_To (Universal_Real, Relocate_Node (Ropnd))); Analyze_And_Resolve (Ropnd, Universal_Real); elsif Typ = Universal_Real and then Is_Integer_Type (Ltyp) then Rewrite (Lopnd, Convert_To (Universal_Real, Relocate_Node (Lopnd))); Analyze_And_Resolve (Lopnd, Universal_Real); -- Non-fixed point cases, do integer zero divide and overflow checks elsif Is_Integer_Type (Typ) then Apply_Divide_Checks (N); end if; -- Overflow checks for floating-point if -gnateF mode active Check_Float_Op_Overflow (N); end Expand_N_Op_Divide; -------------------- -- Expand_N_Op_Eq -- -------------------- procedure Expand_N_Op_Eq (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Typ : constant Entity_Id := Etype (N); Lhs : constant Node_Id := Left_Opnd (N); Rhs : constant Node_Id := Right_Opnd (N); Bodies : constant List_Id := New_List; A_Typ : constant Entity_Id := Etype (Lhs); Typl : Entity_Id := A_Typ; Op_Name : Entity_Id; Prim : Elmt_Id; procedure Build_Equality_Call (Eq : Entity_Id); -- If a constructed equality exists for the type or for its parent, -- build and analyze call, adding conversions if the operation is -- inherited. function Has_Unconstrained_UU_Component (Typ : Node_Id) return Boolean; -- Determines whether a type has a subcomponent of an unconstrained -- Unchecked_Union subtype. Typ is a record type. ------------------------- -- Build_Equality_Call -- ------------------------- procedure Build_Equality_Call (Eq : Entity_Id) is Op_Type : constant Entity_Id := Etype (First_Formal (Eq)); L_Exp : Node_Id := Relocate_Node (Lhs); R_Exp : Node_Id := Relocate_Node (Rhs); begin -- Adjust operands if necessary to comparison type if Base_Type (Op_Type) /= Base_Type (A_Typ) and then not Is_Class_Wide_Type (A_Typ) then L_Exp := OK_Convert_To (Op_Type, L_Exp); R_Exp := OK_Convert_To (Op_Type, R_Exp); end if; -- If we have an Unchecked_Union, we need to add the inferred -- discriminant values as actuals in the function call. At this -- point, the expansion has determined that both operands have -- inferable discriminants. if Is_Unchecked_Union (Op_Type) then declare Lhs_Type : constant Node_Id := Etype (L_Exp); Rhs_Type : constant Node_Id := Etype (R_Exp); Lhs_Discr_Vals : Elist_Id; -- List of inferred discriminant values for left operand. Rhs_Discr_Vals : Elist_Id; -- List of inferred discriminant values for right operand. Discr : Entity_Id; begin Lhs_Discr_Vals := New_Elmt_List; Rhs_Discr_Vals := New_Elmt_List; -- Per-object constrained selected components require special -- attention. If the enclosing scope of the component is an -- Unchecked_Union, we cannot reference its discriminants -- directly. This is why we use the extra parameters of the -- equality function of the enclosing Unchecked_Union. -- type UU_Type (Discr : Integer := 0) is -- . . . -- end record; -- pragma Unchecked_Union (UU_Type); -- 1. Unchecked_Union enclosing record: -- type Enclosing_UU_Type (Discr : Integer := 0) is record -- . . . -- Comp : UU_Type (Discr); -- . . . -- end Enclosing_UU_Type; -- pragma Unchecked_Union (Enclosing_UU_Type); -- Obj1 : Enclosing_UU_Type; -- Obj2 : Enclosing_UU_Type (1); -- [. . .] Obj1 = Obj2 [. . .] -- Generated code: -- if not (uu_typeEQ (obj1.comp, obj2.comp, a, b)) then -- A and B are the formal parameters of the equality function -- of Enclosing_UU_Type. The function always has two extra -- formals to capture the inferred discriminant values for -- each discriminant of the type. -- 2. Non-Unchecked_Union enclosing record: -- type -- Enclosing_Non_UU_Type (Discr : Integer := 0) -- is record -- . . . -- Comp : UU_Type (Discr); -- . . . -- end Enclosing_Non_UU_Type; -- Obj1 : Enclosing_Non_UU_Type; -- Obj2 : Enclosing_Non_UU_Type (1); -- ... Obj1 = Obj2 ... -- Generated code: -- if not (uu_typeEQ (obj1.comp, obj2.comp, -- obj1.discr, obj2.discr)) then -- In this case we can directly reference the discriminants of -- the enclosing record. -- Process left operand of equality if Nkind (Lhs) = N_Selected_Component and then Has_Per_Object_Constraint (Entity (Selector_Name (Lhs))) then -- If enclosing record is an Unchecked_Union, use formals -- corresponding to each discriminant. The name of the -- formal is that of the discriminant, with added suffix, -- see Exp_Ch3.Build_Record_Equality for details. if Is_Unchecked_Union (Scope (Entity (Selector_Name (Lhs)))) then Discr := First_Discriminant (Scope (Entity (Selector_Name (Lhs)))); while Present (Discr) loop Append_Elmt (Make_Identifier (Loc, Chars => New_External_Name (Chars (Discr), 'A')), To => Lhs_Discr_Vals); Next_Discriminant (Discr); end loop; -- If enclosing record is of a non-Unchecked_Union type, it -- is possible to reference its discriminants directly. else Discr := First_Discriminant (Lhs_Type); while Present (Discr) loop Append_Elmt (Make_Selected_Component (Loc, Prefix => Prefix (Lhs), Selector_Name => New_Copy (Get_Discriminant_Value (Discr, Lhs_Type, Stored_Constraint (Lhs_Type)))), To => Lhs_Discr_Vals); Next_Discriminant (Discr); end loop; end if; -- Otherwise operand is on object with a constrained type. -- Infer the discriminant values from the constraint. else Discr := First_Discriminant (Lhs_Type); while Present (Discr) loop Append_Elmt (New_Copy (Get_Discriminant_Value (Discr, Lhs_Type, Stored_Constraint (Lhs_Type))), To => Lhs_Discr_Vals); Next_Discriminant (Discr); end loop; end if; -- Similar processing for right operand of equality if Nkind (Rhs) = N_Selected_Component and then Has_Per_Object_Constraint (Entity (Selector_Name (Rhs))) then if Is_Unchecked_Union (Scope (Entity (Selector_Name (Rhs)))) then Discr := First_Discriminant (Scope (Entity (Selector_Name (Rhs)))); while Present (Discr) loop Append_Elmt (Make_Identifier (Loc, Chars => New_External_Name (Chars (Discr), 'B')), To => Rhs_Discr_Vals); Next_Discriminant (Discr); end loop; else Discr := First_Discriminant (Rhs_Type); while Present (Discr) loop Append_Elmt (Make_Selected_Component (Loc, Prefix => Prefix (Rhs), Selector_Name => New_Copy (Get_Discriminant_Value (Discr, Rhs_Type, Stored_Constraint (Rhs_Type)))), To => Rhs_Discr_Vals); Next_Discriminant (Discr); end loop; end if; else Discr := First_Discriminant (Rhs_Type); while Present (Discr) loop Append_Elmt (New_Copy (Get_Discriminant_Value (Discr, Rhs_Type, Stored_Constraint (Rhs_Type))), To => Rhs_Discr_Vals); Next_Discriminant (Discr); end loop; end if; -- Now merge the list of discriminant values so that values -- of corresponding discriminants are adjacent. declare Params : List_Id; L_Elmt : Elmt_Id; R_Elmt : Elmt_Id; begin Params := New_List (L_Exp, R_Exp); L_Elmt := First_Elmt (Lhs_Discr_Vals); R_Elmt := First_Elmt (Rhs_Discr_Vals); while Present (L_Elmt) loop Append_To (Params, Node (L_Elmt)); Append_To (Params, Node (R_Elmt)); Next_Elmt (L_Elmt); Next_Elmt (R_Elmt); end loop; Rewrite (N, Make_Function_Call (Loc, Name => New_Occurrence_Of (Eq, Loc), Parameter_Associations => Params)); end; end; -- Normal case, not an unchecked union else Rewrite (N, Make_Function_Call (Loc, Name => New_Occurrence_Of (Eq, Loc), Parameter_Associations => New_List (L_Exp, R_Exp))); end if; Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks); end Build_Equality_Call; ------------------------------------ -- Has_Unconstrained_UU_Component -- ------------------------------------ function Has_Unconstrained_UU_Component (Typ : Node_Id) return Boolean is Tdef : constant Node_Id := Type_Definition (Declaration_Node (Base_Type (Typ))); Clist : Node_Id; Vpart : Node_Id; function Component_Is_Unconstrained_UU (Comp : Node_Id) return Boolean; -- Determines whether the subtype of the component is an -- unconstrained Unchecked_Union. function Variant_Is_Unconstrained_UU (Variant : Node_Id) return Boolean; -- Determines whether a component of the variant has an unconstrained -- Unchecked_Union subtype. ----------------------------------- -- Component_Is_Unconstrained_UU -- ----------------------------------- function Component_Is_Unconstrained_UU (Comp : Node_Id) return Boolean is begin if Nkind (Comp) /= N_Component_Declaration then return False; end if; declare Sindic : constant Node_Id := Subtype_Indication (Component_Definition (Comp)); begin -- Unconstrained nominal type. In the case of a constraint -- present, the node kind would have been N_Subtype_Indication. if Nkind (Sindic) = N_Identifier then return Is_Unchecked_Union (Base_Type (Etype (Sindic))); end if; return False; end; end Component_Is_Unconstrained_UU; --------------------------------- -- Variant_Is_Unconstrained_UU -- --------------------------------- function Variant_Is_Unconstrained_UU (Variant : Node_Id) return Boolean is Clist : constant Node_Id := Component_List (Variant); begin if Is_Empty_List (Component_Items (Clist)) then return False; end if; -- We only need to test one component declare Comp : Node_Id := First (Component_Items (Clist)); begin while Present (Comp) loop if Component_Is_Unconstrained_UU (Comp) then return True; end if; Next (Comp); end loop; end; -- None of the components withing the variant were of -- unconstrained Unchecked_Union type. return False; end Variant_Is_Unconstrained_UU; -- Start of processing for Has_Unconstrained_UU_Component begin if Null_Present (Tdef) then return False; end if; Clist := Component_List (Tdef); Vpart := Variant_Part (Clist); -- Inspect available components if Present (Component_Items (Clist)) then declare Comp : Node_Id := First (Component_Items (Clist)); begin while Present (Comp) loop -- One component is sufficient if Component_Is_Unconstrained_UU (Comp) then return True; end if; Next (Comp); end loop; end; end if; -- Inspect available components withing variants if Present (Vpart) then declare Variant : Node_Id := First (Variants (Vpart)); begin while Present (Variant) loop -- One component within a variant is sufficient if Variant_Is_Unconstrained_UU (Variant) then return True; end if; Next (Variant); end loop; end; end if; -- Neither the available components, nor the components inside the -- variant parts were of an unconstrained Unchecked_Union subtype. return False; end Has_Unconstrained_UU_Component; -- Start of processing for Expand_N_Op_Eq begin Binary_Op_Validity_Checks (N); -- Deal with private types if Ekind (Typl) = E_Private_Type then Typl := Underlying_Type (Typl); elsif Ekind (Typl) = E_Private_Subtype then Typl := Underlying_Type (Base_Type (Typl)); else null; end if; -- It may happen in error situations that the underlying type is not -- set. The error will be detected later, here we just defend the -- expander code. if No (Typl) then return; end if; -- Now get the implementation base type (note that plain Base_Type here -- might lead us back to the private type, which is not what we want!) Typl := Implementation_Base_Type (Typl); -- Equality between variant records results in a call to a routine -- that has conditional tests of the discriminant value(s), and hence -- violates the No_Implicit_Conditionals restriction. if Has_Variant_Part (Typl) then declare Msg : Boolean; begin Check_Restriction (Msg, No_Implicit_Conditionals, N); if Msg then Error_Msg_N ("\comparison of variant records tests discriminants", N); return; end if; end; end if; -- Deal with overflow checks in MINIMIZED/ELIMINATED mode and if that -- means we no longer have a comparison operation, we are all done. Expand_Compare_Minimize_Eliminate_Overflow (N); if Nkind (N) /= N_Op_Eq then return; end if; -- Boolean types (requiring handling of non-standard case) if Is_Boolean_Type (Typl) then Adjust_Condition (Left_Opnd (N)); Adjust_Condition (Right_Opnd (N)); Set_Etype (N, Standard_Boolean); Adjust_Result_Type (N, Typ); -- Array types elsif Is_Array_Type (Typl) then -- If we are doing full validity checking, and it is possible for the -- array elements to be invalid then expand out array comparisons to -- make sure that we check the array elements. if Validity_Check_Operands and then not Is_Known_Valid (Component_Type (Typl)) then declare Save_Force_Validity_Checks : constant Boolean := Force_Validity_Checks; begin Force_Validity_Checks := True; Rewrite (N, Expand_Array_Equality (N, Relocate_Node (Lhs), Relocate_Node (Rhs), Bodies, Typl)); Insert_Actions (N, Bodies); Analyze_And_Resolve (N, Standard_Boolean); Force_Validity_Checks := Save_Force_Validity_Checks; end; -- Packed case where both operands are known aligned elsif Is_Bit_Packed_Array (Typl) and then not Is_Possibly_Unaligned_Object (Lhs) and then not Is_Possibly_Unaligned_Object (Rhs) then Expand_Packed_Eq (N); -- Where the component type is elementary we can use a block bit -- comparison (if supported on the target) exception in the case -- of floating-point (negative zero issues require element by -- element comparison), and atomic/VFA types (where we must be sure -- to load elements independently) and possibly unaligned arrays. elsif Is_Elementary_Type (Component_Type (Typl)) and then not Is_Floating_Point_Type (Component_Type (Typl)) and then not Is_Atomic_Or_VFA (Component_Type (Typl)) and then not Is_Possibly_Unaligned_Object (Lhs) and then not Is_Possibly_Unaligned_Object (Rhs) and then Support_Composite_Compare_On_Target then null; -- For composite and floating-point cases, expand equality loop to -- make sure of using proper comparisons for tagged types, and -- correctly handling the floating-point case. else Rewrite (N, Expand_Array_Equality (N, Relocate_Node (Lhs), Relocate_Node (Rhs), Bodies, Typl)); Insert_Actions (N, Bodies, Suppress => All_Checks); Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks); end if; -- Record Types elsif Is_Record_Type (Typl) then -- For tagged types, use the primitive "=" if Is_Tagged_Type (Typl) then -- No need to do anything else compiling under restriction -- No_Dispatching_Calls. During the semantic analysis we -- already notified such violation. if Restriction_Active (No_Dispatching_Calls) then return; end if; -- If this is derived from an untagged private type completed with -- a tagged type, it does not have a full view, so we use the -- primitive operations of the private type. This check should no -- longer be necessary when these types get their full views??? if Is_Private_Type (A_Typ) and then not Is_Tagged_Type (A_Typ) and then Is_Derived_Type (A_Typ) and then No (Full_View (A_Typ)) then -- Search for equality operation, checking that the operands -- have the same type. Note that we must find a matching entry, -- or something is very wrong. Prim := First_Elmt (Collect_Primitive_Operations (A_Typ)); while Present (Prim) loop exit when Chars (Node (Prim)) = Name_Op_Eq and then Etype (First_Formal (Node (Prim))) = Etype (Next_Formal (First_Formal (Node (Prim)))) and then Base_Type (Etype (Node (Prim))) = Standard_Boolean; Next_Elmt (Prim); end loop; pragma Assert (Present (Prim)); Op_Name := Node (Prim); -- Find the type's predefined equality or an overriding -- user-defined equality. The reason for not simply calling -- Find_Prim_Op here is that there may be a user-defined -- overloaded equality op that precedes the equality that we -- want, so we have to explicitly search (e.g., there could be -- an equality with two different parameter types). else if Is_Class_Wide_Type (Typl) then Typl := Find_Specific_Type (Typl); end if; Prim := First_Elmt (Primitive_Operations (Typl)); while Present (Prim) loop exit when Chars (Node (Prim)) = Name_Op_Eq and then Etype (First_Formal (Node (Prim))) = Etype (Next_Formal (First_Formal (Node (Prim)))) and then Base_Type (Etype (Node (Prim))) = Standard_Boolean; Next_Elmt (Prim); end loop; pragma Assert (Present (Prim)); Op_Name := Node (Prim); end if; Build_Equality_Call (Op_Name); -- Ada 2005 (AI-216): Program_Error is raised when evaluating the -- predefined equality operator for a type which has a subcomponent -- of an Unchecked_Union type whose nominal subtype is unconstrained. elsif Has_Unconstrained_UU_Component (Typl) then Insert_Action (N, Make_Raise_Program_Error (Loc, Reason => PE_Unchecked_Union_Restriction)); -- Prevent Gigi from generating incorrect code by rewriting the -- equality as a standard False. (is this documented somewhere???) Rewrite (N, New_Occurrence_Of (Standard_False, Loc)); elsif Is_Unchecked_Union (Typl) then -- If we can infer the discriminants of the operands, we make a -- call to the TSS equality function. if Has_Inferable_Discriminants (Lhs) and then Has_Inferable_Discriminants (Rhs) then Build_Equality_Call (TSS (Root_Type (Typl), TSS_Composite_Equality)); else -- Ada 2005 (AI-216): Program_Error is raised when evaluating -- the predefined equality operator for an Unchecked_Union type -- if either of the operands lack inferable discriminants. Insert_Action (N, Make_Raise_Program_Error (Loc, Reason => PE_Unchecked_Union_Restriction)); -- Emit a warning on source equalities only, otherwise the -- message may appear out of place due to internal use. The -- warning is unconditional because it is required by the -- language. if Comes_From_Source (N) then Error_Msg_N ("Unchecked_Union discriminants cannot be determined??", N); Error_Msg_N ("\Program_Error will be raised for equality operation??", N); end if; -- Prevent Gigi from generating incorrect code by rewriting -- the equality as a standard False (documented where???). Rewrite (N, New_Occurrence_Of (Standard_False, Loc)); end if; -- If a type support function is present (for complex cases), use it elsif Present (TSS (Root_Type (Typl), TSS_Composite_Equality)) then Build_Equality_Call (TSS (Root_Type (Typl), TSS_Composite_Equality)); -- When comparing two Bounded_Strings, use the primitive equality of -- the root Super_String type. elsif Is_Bounded_String (Typl) then Prim := First_Elmt (Collect_Primitive_Operations (Root_Type (Typl))); while Present (Prim) loop exit when Chars (Node (Prim)) = Name_Op_Eq and then Etype (First_Formal (Node (Prim))) = Etype (Next_Formal (First_Formal (Node (Prim)))) and then Base_Type (Etype (Node (Prim))) = Standard_Boolean; Next_Elmt (Prim); end loop; -- A Super_String type should always have a primitive equality pragma Assert (Present (Prim)); Build_Equality_Call (Node (Prim)); -- Otherwise expand the component by component equality. Note that -- we never use block-bit comparisons for records, because of the -- problems with gaps. The backend will often be able to recombine -- the separate comparisons that we generate here. else Remove_Side_Effects (Lhs); Remove_Side_Effects (Rhs); Rewrite (N, Expand_Record_Equality (N, Typl, Lhs, Rhs, Bodies)); Insert_Actions (N, Bodies, Suppress => All_Checks); Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks); end if; end if; -- Test if result is known at compile time Rewrite_Comparison (N); -- Special optimization of length comparison Optimize_Length_Comparison (N); -- One more special case: if we have a comparison of X'Result = expr -- in floating-point, then if not already there, change expr to be -- f'Machine (expr) to eliminate surprise from extra precision. if Is_Floating_Point_Type (Typl) and then Nkind (Original_Node (Lhs)) = N_Attribute_Reference and then Attribute_Name (Original_Node (Lhs)) = Name_Result then -- Stick in the Typ'Machine call if not already there if Nkind (Rhs) /= N_Attribute_Reference or else Attribute_Name (Rhs) /= Name_Machine then Rewrite (Rhs, Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Typl, Loc), Attribute_Name => Name_Machine, Expressions => New_List (Relocate_Node (Rhs)))); Analyze_And_Resolve (Rhs, Typl); end if; end if; end Expand_N_Op_Eq; ----------------------- -- Expand_N_Op_Expon -- ----------------------- procedure Expand_N_Op_Expon (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Typ : constant Entity_Id := Etype (N); Rtyp : constant Entity_Id := Root_Type (Typ); Base : constant Node_Id := Relocate_Node (Left_Opnd (N)); Bastyp : constant Node_Id := Etype (Base); Exp : constant Node_Id := Relocate_Node (Right_Opnd (N)); Exptyp : constant Entity_Id := Etype (Exp); Ovflo : constant Boolean := Do_Overflow_Check (N); Expv : Uint; Temp : Node_Id; Rent : RE_Id; Ent : Entity_Id; Etyp : Entity_Id; Xnode : Node_Id; function Wrap_MA (Exp : Node_Id) return Node_Id; -- Given an expression Exp, if the root type is Float or Long_Float, -- then wrap the expression in a call of Bastyp'Machine, to stop any -- extra precision. This is done to ensure that X**A = X**B when A is -- a static constant and B is a variable with the same value. For any -- other type, the node Exp is returned unchanged. ------------- -- Wrap_MA -- ------------- function Wrap_MA (Exp : Node_Id) return Node_Id is Loc : constant Source_Ptr := Sloc (Exp); begin if Rtyp = Standard_Float or else Rtyp = Standard_Long_Float then return Make_Attribute_Reference (Loc, Attribute_Name => Name_Machine, Prefix => New_Occurrence_Of (Bastyp, Loc), Expressions => New_List (Relocate_Node (Exp))); else return Exp; end if; end Wrap_MA; -- Start of processing for Expand_N_Op begin Binary_Op_Validity_Checks (N); -- CodePeer wants to see the unexpanded N_Op_Expon node if CodePeer_Mode then return; end if; -- If either operand is of a private type, then we have the use of an -- intrinsic operator, and we get rid of the privateness, by using root -- types of underlying types for the actual operation. Otherwise the -- private types will cause trouble if we expand multiplications or -- shifts etc. We also do this transformation if the result type is -- different from the base type. if Is_Private_Type (Etype (Base)) or else Is_Private_Type (Typ) or else Is_Private_Type (Exptyp) or else Rtyp /= Root_Type (Bastyp) then declare Bt : constant Entity_Id := Root_Type (Underlying_Type (Bastyp)); Et : constant Entity_Id := Root_Type (Underlying_Type (Exptyp)); begin Rewrite (N, Unchecked_Convert_To (Typ, Make_Op_Expon (Loc, Left_Opnd => Unchecked_Convert_To (Bt, Base), Right_Opnd => Unchecked_Convert_To (Et, Exp)))); Analyze_And_Resolve (N, Typ); return; end; end if; -- Check for MINIMIZED/ELIMINATED overflow mode if Minimized_Eliminated_Overflow_Check (N) then Apply_Arithmetic_Overflow_Check (N); return; end if; -- Test for case of known right argument where we can replace the -- exponentiation by an equivalent expression using multiplication. -- Note: use CRT_Safe version of Compile_Time_Known_Value because in -- configurable run-time mode, we may not have the exponentiation -- routine available, and we don't want the legality of the program -- to depend on how clever the compiler is in knowing values. if CRT_Safe_Compile_Time_Known_Value (Exp) then Expv := Expr_Value (Exp); -- We only fold small non-negative exponents. You might think we -- could fold small negative exponents for the real case, but we -- can't because we are required to raise Constraint_Error for -- the case of 0.0 ** (negative) even if Machine_Overflows = False. -- See ACVC test C4A012B, and it is not worth generating the test. -- For small negative exponents, we return the reciprocal of -- the folding of the exponentiation for the opposite (positive) -- exponent, as required by Ada RM 4.5.6(11/3). if abs Expv <= 4 then -- X ** 0 = 1 (or 1.0) if Expv = 0 then -- Call Remove_Side_Effects to ensure that any side effects -- in the ignored left operand (in particular function calls -- to user defined functions) are properly executed. Remove_Side_Effects (Base); if Ekind (Typ) in Integer_Kind then Xnode := Make_Integer_Literal (Loc, Intval => 1); else Xnode := Make_Real_Literal (Loc, Ureal_1); end if; -- X ** 1 = X elsif Expv = 1 then Xnode := Base; -- X ** 2 = X * X elsif Expv = 2 then Xnode := Wrap_MA ( Make_Op_Multiply (Loc, Left_Opnd => Duplicate_Subexpr (Base), Right_Opnd => Duplicate_Subexpr_No_Checks (Base))); -- X ** 3 = X * X * X elsif Expv = 3 then Xnode := Wrap_MA ( Make_Op_Multiply (Loc, Left_Opnd => Make_Op_Multiply (Loc, Left_Opnd => Duplicate_Subexpr (Base), Right_Opnd => Duplicate_Subexpr_No_Checks (Base)), Right_Opnd => Duplicate_Subexpr_No_Checks (Base))); -- X ** 4 -> -- do -- En : constant base'type := base * base; -- in -- En * En elsif Expv = 4 then Temp := Make_Temporary (Loc, 'E', Base); Xnode := Make_Expression_With_Actions (Loc, Actions => New_List ( Make_Object_Declaration (Loc, Defining_Identifier => Temp, Constant_Present => True, Object_Definition => New_Occurrence_Of (Typ, Loc), Expression => Wrap_MA ( Make_Op_Multiply (Loc, Left_Opnd => Duplicate_Subexpr (Base), Right_Opnd => Duplicate_Subexpr_No_Checks (Base))))), Expression => Wrap_MA ( Make_Op_Multiply (Loc, Left_Opnd => New_Occurrence_Of (Temp, Loc), Right_Opnd => New_Occurrence_Of (Temp, Loc)))); -- X ** N = 1.0 / X ** (-N) -- N in -4 .. -1 else pragma Assert (Expv = -1 or Expv = -2 or Expv = -3 or Expv = -4); Xnode := Make_Op_Divide (Loc, Left_Opnd => Make_Float_Literal (Loc, Radix => Uint_1, Significand => Uint_1, Exponent => Uint_0), Right_Opnd => Make_Op_Expon (Loc, Left_Opnd => Duplicate_Subexpr (Base), Right_Opnd => Make_Integer_Literal (Loc, Intval => -Expv))); end if; Rewrite (N, Xnode); Analyze_And_Resolve (N, Typ); return; end if; end if; -- Deal with optimizing 2 ** expression to shift where possible -- Note: we used to check that Exptyp was an unsigned type. But that is -- an unnecessary check, since if Exp is negative, we have a run-time -- error that is either caught (so we get the right result) or we have -- suppressed the check, in which case the code is erroneous anyway. if Is_Integer_Type (Rtyp) -- The base value must be "safe compile-time known", and exactly 2 and then Nkind (Base) = N_Integer_Literal and then CRT_Safe_Compile_Time_Known_Value (Base) and then Expr_Value (Base) = Uint_2 -- We only handle cases where the right type is a integer and then Is_Integer_Type (Root_Type (Exptyp)) and then Esize (Root_Type (Exptyp)) <= Esize (Standard_Integer) -- This transformation is not applicable for a modular type with a -- nonbinary modulus because we do not handle modular reduction in -- a correct manner if we attempt this transformation in this case. and then not Non_Binary_Modulus (Typ) then -- Handle the cases where our parent is a division or multiplication -- specially. In these cases we can convert to using a shift at the -- parent level if we are not doing overflow checking, since it is -- too tricky to combine the overflow check at the parent level. if not Ovflo and then Nkind_In (Parent (N), N_Op_Divide, N_Op_Multiply) then declare P : constant Node_Id := Parent (N); L : constant Node_Id := Left_Opnd (P); R : constant Node_Id := Right_Opnd (P); begin if (Nkind (P) = N_Op_Multiply and then ((Is_Integer_Type (Etype (L)) and then R = N) or else (Is_Integer_Type (Etype (R)) and then L = N)) and then not Do_Overflow_Check (P)) or else (Nkind (P) = N_Op_Divide and then Is_Integer_Type (Etype (L)) and then Is_Unsigned_Type (Etype (L)) and then R = N and then not Do_Overflow_Check (P)) then Set_Is_Power_Of_2_For_Shift (N); return; end if; end; -- Here we just have 2 ** N on its own, so we can convert this to a -- shift node. We are prepared to deal with overflow here, and we -- also have to handle proper modular reduction for binary modular. else declare OK : Boolean; Lo : Uint; Hi : Uint; MaxS : Uint; -- Maximum shift count with no overflow TestS : Boolean; -- Set True if we must test the shift count Test_Gt : Node_Id; -- Node for test against TestS begin -- Compute maximum shift based on the underlying size. For a -- modular type this is one less than the size. if Is_Modular_Integer_Type (Typ) then -- For modular integer types, this is the size of the value -- being shifted minus one. Any larger values will cause -- modular reduction to a result of zero. Note that we do -- want the RM_Size here (e.g. mod 2 ** 7, we want a result -- of 6, since 2**7 should be reduced to zero). MaxS := RM_Size (Rtyp) - 1; -- For signed integer types, we use the size of the value -- being shifted minus 2. Larger values cause overflow. else MaxS := Esize (Rtyp) - 2; end if; -- Determine range to see if it can be larger than MaxS Determine_Range (Right_Opnd (N), OK, Lo, Hi, Assume_Valid => True); TestS := (not OK) or else Hi > MaxS; -- Signed integer case if Is_Signed_Integer_Type (Typ) then -- Generate overflow check if overflow is active. Note that -- we can simply ignore the possibility of overflow if the -- flag is not set (means that overflow cannot happen or -- that overflow checks are suppressed). if Ovflo and TestS then Insert_Action (N, Make_Raise_Constraint_Error (Loc, Condition => Make_Op_Gt (Loc, Left_Opnd => Duplicate_Subexpr (Right_Opnd (N)), Right_Opnd => Make_Integer_Literal (Loc, MaxS)), Reason => CE_Overflow_Check_Failed)); end if; -- Now rewrite node as Shift_Left (1, right-operand) Rewrite (N, Make_Op_Shift_Left (Loc, Left_Opnd => Make_Integer_Literal (Loc, Uint_1), Right_Opnd => Right_Opnd (N))); -- Modular integer case else pragma Assert (Is_Modular_Integer_Type (Typ)); -- If shift count can be greater than MaxS, we need to wrap -- the shift in a test that will reduce the result value to -- zero if this shift count is exceeded. if TestS then -- Note: build node for the comparison first, before we -- reuse the Right_Opnd, so that we have proper parents -- in place for the Duplicate_Subexpr call. Test_Gt := Make_Op_Gt (Loc, Left_Opnd => Duplicate_Subexpr (Right_Opnd (N)), Right_Opnd => Make_Integer_Literal (Loc, MaxS)); Rewrite (N, Make_If_Expression (Loc, Expressions => New_List ( Test_Gt, Make_Integer_Literal (Loc, Uint_0), Make_Op_Shift_Left (Loc, Left_Opnd => Make_Integer_Literal (Loc, Uint_1), Right_Opnd => Right_Opnd (N))))); -- If we know shift count cannot be greater than MaxS, then -- it is safe to just rewrite as a shift with no test. else Rewrite (N, Make_Op_Shift_Left (Loc, Left_Opnd => Make_Integer_Literal (Loc, Uint_1), Right_Opnd => Right_Opnd (N))); end if; end if; Analyze_And_Resolve (N, Typ); return; end; end if; end if; -- Fall through if exponentiation must be done using a runtime routine -- First deal with modular case if Is_Modular_Integer_Type (Rtyp) then -- Nonbinary modular case, we call the special exponentiation -- routine for the nonbinary case, converting the argument to -- Long_Long_Integer and passing the modulus value. Then the -- result is converted back to the base type. if Non_Binary_Modulus (Rtyp) then Rewrite (N, Convert_To (Typ, Make_Function_Call (Loc, Name => New_Occurrence_Of (RTE (RE_Exp_Modular), Loc), Parameter_Associations => New_List ( Convert_To (RTE (RE_Unsigned), Base), Make_Integer_Literal (Loc, Modulus (Rtyp)), Exp)))); -- Binary modular case, in this case, we call one of two routines, -- either the unsigned integer case, or the unsigned long long -- integer case, with a final "and" operation to do the required mod. else if UI_To_Int (Esize (Rtyp)) <= Standard_Integer_Size then Ent := RTE (RE_Exp_Unsigned); else Ent := RTE (RE_Exp_Long_Long_Unsigned); end if; Rewrite (N, Convert_To (Typ, Make_Op_And (Loc, Left_Opnd => Make_Function_Call (Loc, Name => New_Occurrence_Of (Ent, Loc), Parameter_Associations => New_List ( Convert_To (Etype (First_Formal (Ent)), Base), Exp)), Right_Opnd => Make_Integer_Literal (Loc, Modulus (Rtyp) - 1)))); end if; -- Common exit point for modular type case Analyze_And_Resolve (N, Typ); return; -- Signed integer cases, done using either Integer or Long_Long_Integer. -- It is not worth having routines for Short_[Short_]Integer, since for -- most machines it would not help, and it would generate more code that -- might need certification when a certified run time is required. -- In the integer cases, we have two routines, one for when overflow -- checks are required, and one when they are not required, since there -- is a real gain in omitting checks on many machines. elsif Rtyp = Base_Type (Standard_Long_Long_Integer) or else (Rtyp = Base_Type (Standard_Long_Integer) and then Esize (Standard_Long_Integer) > Esize (Standard_Integer)) or else Rtyp = Universal_Integer then Etyp := Standard_Long_Long_Integer; if Ovflo then Rent := RE_Exp_Long_Long_Integer; else Rent := RE_Exn_Long_Long_Integer; end if; elsif Is_Signed_Integer_Type (Rtyp) then Etyp := Standard_Integer; if Ovflo then Rent := RE_Exp_Integer; else Rent := RE_Exn_Integer; end if; -- Floating-point cases. We do not need separate routines for the -- overflow case here, since in the case of floating-point, we generate -- infinities anyway as a rule (either that or we automatically trap -- overflow), and if there is an infinity generated and a range check -- is required, the check will fail anyway. -- Historical note: we used to convert everything to Long_Long_Float -- and call a single common routine, but this had the undesirable effect -- of giving different results for small static exponent values and the -- same dynamic values. else pragma Assert (Is_Floating_Point_Type (Rtyp)); if Rtyp = Standard_Float then Etyp := Standard_Float; Rent := RE_Exn_Float; elsif Rtyp = Standard_Long_Float then Etyp := Standard_Long_Float; Rent := RE_Exn_Long_Float; else Etyp := Standard_Long_Long_Float; Rent := RE_Exn_Long_Long_Float; end if; end if; -- Common processing for integer cases and floating-point cases. -- If we are in the right type, we can call runtime routine directly if Typ = Etyp and then Rtyp /= Universal_Integer and then Rtyp /= Universal_Real then Rewrite (N, Wrap_MA ( Make_Function_Call (Loc, Name => New_Occurrence_Of (RTE (Rent), Loc), Parameter_Associations => New_List (Base, Exp)))); -- Otherwise we have to introduce conversions (conversions are also -- required in the universal cases, since the runtime routine is -- typed using one of the standard types). else Rewrite (N, Convert_To (Typ, Make_Function_Call (Loc, Name => New_Occurrence_Of (RTE (Rent), Loc), Parameter_Associations => New_List ( Convert_To (Etyp, Base), Exp)))); end if; Analyze_And_Resolve (N, Typ); return; exception when RE_Not_Available => return; end Expand_N_Op_Expon; -------------------- -- Expand_N_Op_Ge -- -------------------- procedure Expand_N_Op_Ge (N : Node_Id) is Typ : constant Entity_Id := Etype (N); Op1 : constant Node_Id := Left_Opnd (N); Op2 : constant Node_Id := Right_Opnd (N); Typ1 : constant Entity_Id := Base_Type (Etype (Op1)); begin Binary_Op_Validity_Checks (N); -- Deal with overflow checks in MINIMIZED/ELIMINATED mode and if that -- means we no longer have a comparison operation, we are all done. Expand_Compare_Minimize_Eliminate_Overflow (N); if Nkind (N) /= N_Op_Ge then return; end if; -- Array type case if Is_Array_Type (Typ1) then Expand_Array_Comparison (N); return; end if; -- Deal with boolean operands if Is_Boolean_Type (Typ1) then Adjust_Condition (Op1); Adjust_Condition (Op2); Set_Etype (N, Standard_Boolean); Adjust_Result_Type (N, Typ); end if; Rewrite_Comparison (N); Optimize_Length_Comparison (N); end Expand_N_Op_Ge; -------------------- -- Expand_N_Op_Gt -- -------------------- procedure Expand_N_Op_Gt (N : Node_Id) is Typ : constant Entity_Id := Etype (N); Op1 : constant Node_Id := Left_Opnd (N); Op2 : constant Node_Id := Right_Opnd (N); Typ1 : constant Entity_Id := Base_Type (Etype (Op1)); begin Binary_Op_Validity_Checks (N); -- Deal with overflow checks in MINIMIZED/ELIMINATED mode and if that -- means we no longer have a comparison operation, we are all done. Expand_Compare_Minimize_Eliminate_Overflow (N); if Nkind (N) /= N_Op_Gt then return; end if; -- Deal with array type operands if Is_Array_Type (Typ1) then Expand_Array_Comparison (N); return; end if; -- Deal with boolean type operands if Is_Boolean_Type (Typ1) then Adjust_Condition (Op1); Adjust_Condition (Op2); Set_Etype (N, Standard_Boolean); Adjust_Result_Type (N, Typ); end if; Rewrite_Comparison (N); Optimize_Length_Comparison (N); end Expand_N_Op_Gt; -------------------- -- Expand_N_Op_Le -- -------------------- procedure Expand_N_Op_Le (N : Node_Id) is Typ : constant Entity_Id := Etype (N); Op1 : constant Node_Id := Left_Opnd (N); Op2 : constant Node_Id := Right_Opnd (N); Typ1 : constant Entity_Id := Base_Type (Etype (Op1)); begin Binary_Op_Validity_Checks (N); -- Deal with overflow checks in MINIMIZED/ELIMINATED mode and if that -- means we no longer have a comparison operation, we are all done. Expand_Compare_Minimize_Eliminate_Overflow (N); if Nkind (N) /= N_Op_Le then return; end if; -- Deal with array type operands if Is_Array_Type (Typ1) then Expand_Array_Comparison (N); return; end if; -- Deal with Boolean type operands if Is_Boolean_Type (Typ1) then Adjust_Condition (Op1); Adjust_Condition (Op2); Set_Etype (N, Standard_Boolean); Adjust_Result_Type (N, Typ); end if; Rewrite_Comparison (N); Optimize_Length_Comparison (N); end Expand_N_Op_Le; -------------------- -- Expand_N_Op_Lt -- -------------------- procedure Expand_N_Op_Lt (N : Node_Id) is Typ : constant Entity_Id := Etype (N); Op1 : constant Node_Id := Left_Opnd (N); Op2 : constant Node_Id := Right_Opnd (N); Typ1 : constant Entity_Id := Base_Type (Etype (Op1)); begin Binary_Op_Validity_Checks (N); -- Deal with overflow checks in MINIMIZED/ELIMINATED mode and if that -- means we no longer have a comparison operation, we are all done. Expand_Compare_Minimize_Eliminate_Overflow (N); if Nkind (N) /= N_Op_Lt then return; end if; -- Deal with array type operands if Is_Array_Type (Typ1) then Expand_Array_Comparison (N); return; end if; -- Deal with Boolean type operands if Is_Boolean_Type (Typ1) then Adjust_Condition (Op1); Adjust_Condition (Op2); Set_Etype (N, Standard_Boolean); Adjust_Result_Type (N, Typ); end if; Rewrite_Comparison (N); Optimize_Length_Comparison (N); end Expand_N_Op_Lt; ----------------------- -- Expand_N_Op_Minus -- ----------------------- procedure Expand_N_Op_Minus (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Typ : constant Entity_Id := Etype (N); begin Unary_Op_Validity_Checks (N); -- Check for MINIMIZED/ELIMINATED overflow mode if Minimized_Eliminated_Overflow_Check (N) then Apply_Arithmetic_Overflow_Check (N); return; end if; if not Backend_Overflow_Checks_On_Target and then Is_Signed_Integer_Type (Etype (N)) and then Do_Overflow_Check (N) then -- Software overflow checking expands -expr into (0 - expr) Rewrite (N, Make_Op_Subtract (Loc, Left_Opnd => Make_Integer_Literal (Loc, 0), Right_Opnd => Right_Opnd (N))); Analyze_And_Resolve (N, Typ); end if; end Expand_N_Op_Minus; --------------------- -- Expand_N_Op_Mod -- --------------------- procedure Expand_N_Op_Mod (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Typ : constant Entity_Id := Etype (N); DDC : constant Boolean := Do_Division_Check (N); Left : Node_Id; Right : Node_Id; LLB : Uint; Llo : Uint; Lhi : Uint; LOK : Boolean; Rlo : Uint; Rhi : Uint; ROK : Boolean; pragma Warnings (Off, Lhi); begin Binary_Op_Validity_Checks (N); -- Check for MINIMIZED/ELIMINATED overflow mode if Minimized_Eliminated_Overflow_Check (N) then Apply_Arithmetic_Overflow_Check (N); return; end if; if Is_Integer_Type (Etype (N)) then Apply_Divide_Checks (N); -- All done if we don't have a MOD any more, which can happen as a -- result of overflow expansion in MINIMIZED or ELIMINATED modes. if Nkind (N) /= N_Op_Mod then return; end if; end if; -- Proceed with expansion of mod operator Left := Left_Opnd (N); Right := Right_Opnd (N); Determine_Range (Right, ROK, Rlo, Rhi, Assume_Valid => True); Determine_Range (Left, LOK, Llo, Lhi, Assume_Valid => True); -- Convert mod to rem if operands are both known to be non-negative, or -- both known to be non-positive (these are the cases in which rem and -- mod are the same, see (RM 4.5.5(28-30)). We do this since it is quite -- likely that this will improve the quality of code, (the operation now -- corresponds to the hardware remainder), and it does not seem likely -- that it could be harmful. It also avoids some cases of the elaborate -- expansion in Modify_Tree_For_C mode below (since Ada rem = C %). if (LOK and ROK) and then ((Llo >= 0 and then Rlo >= 0) or else (Lhi <= 0 and then Rhi <= 0)) then Rewrite (N, Make_Op_Rem (Sloc (N), Left_Opnd => Left_Opnd (N), Right_Opnd => Right_Opnd (N))); -- Instead of reanalyzing the node we do the analysis manually. This -- avoids anomalies when the replacement is done in an instance and -- is epsilon more efficient. Set_Entity (N, Standard_Entity (S_Op_Rem)); Set_Etype (N, Typ); Set_Do_Division_Check (N, DDC); Expand_N_Op_Rem (N); Set_Analyzed (N); return; -- Otherwise, normal mod processing else -- Apply optimization x mod 1 = 0. We don't really need that with -- gcc, but it is useful with other back ends and is certainly -- harmless. if Is_Integer_Type (Etype (N)) and then Compile_Time_Known_Value (Right) and then Expr_Value (Right) = Uint_1 then -- Call Remove_Side_Effects to ensure that any side effects in -- the ignored left operand (in particular function calls to -- user defined functions) are properly executed. Remove_Side_Effects (Left); Rewrite (N, Make_Integer_Literal (Loc, 0)); Analyze_And_Resolve (N, Typ); return; end if; -- If we still have a mod operator and we are in Modify_Tree_For_C -- mode, and we have a signed integer type, then here is where we do -- the rewrite in terms of Rem. Note this rewrite bypasses the need -- for the special handling of the annoying case of largest negative -- number mod minus one. if Nkind (N) = N_Op_Mod and then Is_Signed_Integer_Type (Typ) and then Modify_Tree_For_C then -- In the general case, we expand A mod B as -- Tnn : constant typ := A rem B; -- .. -- (if (A >= 0) = (B >= 0) then Tnn -- elsif Tnn = 0 then 0 -- else Tnn + B) -- The comparison can be written simply as A >= 0 if we know that -- B >= 0 which is a very common case. -- An important optimization is when B is known at compile time -- to be 2**K for some constant. In this case we can simply AND -- the left operand with the bit string 2**K-1 (i.e. K 1-bits) -- and that works for both the positive and negative cases. declare P2 : constant Nat := Power_Of_Two (Right); begin if P2 /= 0 then Rewrite (N, Unchecked_Convert_To (Typ, Make_Op_And (Loc, Left_Opnd => Unchecked_Convert_To (Corresponding_Unsigned_Type (Typ), Left), Right_Opnd => Make_Integer_Literal (Loc, 2 ** P2 - 1)))); Analyze_And_Resolve (N, Typ); return; end if; end; -- Here for the full rewrite declare Tnn : constant Entity_Id := Make_Temporary (Sloc (N), 'T', N); Cmp : Node_Id; begin Cmp := Make_Op_Ge (Loc, Left_Opnd => Duplicate_Subexpr_No_Checks (Left), Right_Opnd => Make_Integer_Literal (Loc, 0)); if not LOK or else Rlo < 0 then Cmp := Make_Op_Eq (Loc, Left_Opnd => Cmp, Right_Opnd => Make_Op_Ge (Loc, Left_Opnd => Duplicate_Subexpr_No_Checks (Right), Right_Opnd => Make_Integer_Literal (Loc, 0))); end if; Insert_Action (N, Make_Object_Declaration (Loc, Defining_Identifier => Tnn, Constant_Present => True, Object_Definition => New_Occurrence_Of (Typ, Loc), Expression => Make_Op_Rem (Loc, Left_Opnd => Left, Right_Opnd => Right))); Rewrite (N, Make_If_Expression (Loc, Expressions => New_List ( Cmp, New_Occurrence_Of (Tnn, Loc), Make_If_Expression (Loc, Is_Elsif => True, Expressions => New_List ( Make_Op_Eq (Loc, Left_Opnd => New_Occurrence_Of (Tnn, Loc), Right_Opnd => Make_Integer_Literal (Loc, 0)), Make_Integer_Literal (Loc, 0), Make_Op_Add (Loc, Left_Opnd => New_Occurrence_Of (Tnn, Loc), Right_Opnd => Duplicate_Subexpr_No_Checks (Right))))))); Analyze_And_Resolve (N, Typ); return; end; end if; -- Deal with annoying case of largest negative number mod minus one. -- Gigi may not handle this case correctly, because on some targets, -- the mod value is computed using a divide instruction which gives -- an overflow trap for this case. -- It would be a bit more efficient to figure out which targets -- this is really needed for, but in practice it is reasonable -- to do the following special check in all cases, since it means -- we get a clearer message, and also the overhead is minimal given -- that division is expensive in any case. -- In fact the check is quite easy, if the right operand is -1, then -- the mod value is always 0, and we can just ignore the left operand -- completely in this case. -- This only applies if we still have a mod operator. Skip if we -- have already rewritten this (e.g. in the case of eliminated -- overflow checks which have driven us into bignum mode). if Nkind (N) = N_Op_Mod then -- The operand type may be private (e.g. in the expansion of an -- intrinsic operation) so we must use the underlying type to get -- the bounds, and convert the literals explicitly. LLB := Expr_Value (Type_Low_Bound (Base_Type (Underlying_Type (Etype (Left))))); if ((not ROK) or else (Rlo <= (-1) and then (-1) <= Rhi)) and then ((not LOK) or else (Llo = LLB)) then Rewrite (N, Make_If_Expression (Loc, Expressions => New_List ( Make_Op_Eq (Loc, Left_Opnd => Duplicate_Subexpr (Right), Right_Opnd => Unchecked_Convert_To (Typ, Make_Integer_Literal (Loc, -1))), Unchecked_Convert_To (Typ, Make_Integer_Literal (Loc, Uint_0)), Relocate_Node (N)))); Set_Analyzed (Next (Next (First (Expressions (N))))); Analyze_And_Resolve (N, Typ); end if; end if; end if; end Expand_N_Op_Mod; -------------------------- -- Expand_N_Op_Multiply -- -------------------------- procedure Expand_N_Op_Multiply (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Lop : constant Node_Id := Left_Opnd (N); Rop : constant Node_Id := Right_Opnd (N); Lp2 : constant Boolean := Nkind (Lop) = N_Op_Expon and then Is_Power_Of_2_For_Shift (Lop); Rp2 : constant Boolean := Nkind (Rop) = N_Op_Expon and then Is_Power_Of_2_For_Shift (Rop); Ltyp : constant Entity_Id := Etype (Lop); Rtyp : constant Entity_Id := Etype (Rop); Typ : Entity_Id := Etype (N); begin Binary_Op_Validity_Checks (N); -- Check for MINIMIZED/ELIMINATED overflow mode if Minimized_Eliminated_Overflow_Check (N) then Apply_Arithmetic_Overflow_Check (N); return; end if; -- Special optimizations for integer types if Is_Integer_Type (Typ) then -- N * 0 = 0 for integer types if Compile_Time_Known_Value (Rop) and then Expr_Value (Rop) = Uint_0 then -- Call Remove_Side_Effects to ensure that any side effects in -- the ignored left operand (in particular function calls to -- user defined functions) are properly executed. Remove_Side_Effects (Lop); Rewrite (N, Make_Integer_Literal (Loc, Uint_0)); Analyze_And_Resolve (N, Typ); return; end if; -- Similar handling for 0 * N = 0 if Compile_Time_Known_Value (Lop) and then Expr_Value (Lop) = Uint_0 then Remove_Side_Effects (Rop); Rewrite (N, Make_Integer_Literal (Loc, Uint_0)); Analyze_And_Resolve (N, Typ); return; end if; -- N * 1 = 1 * N = N for integer types -- This optimisation is not done if we are going to -- rewrite the product 1 * 2 ** N to a shift. if Compile_Time_Known_Value (Rop) and then Expr_Value (Rop) = Uint_1 and then not Lp2 then Rewrite (N, Lop); return; elsif Compile_Time_Known_Value (Lop) and then Expr_Value (Lop) = Uint_1 and then not Rp2 then Rewrite (N, Rop); return; end if; end if; -- Convert x * 2 ** y to Shift_Left (x, y). Note that the fact that -- Is_Power_Of_2_For_Shift is set means that we know that our left -- operand is an integer, as required for this to work. if Rp2 then if Lp2 then -- Convert 2 ** A * 2 ** B into 2 ** (A + B) Rewrite (N, Make_Op_Expon (Loc, Left_Opnd => Make_Integer_Literal (Loc, 2), Right_Opnd => Make_Op_Add (Loc, Left_Opnd => Right_Opnd (Lop), Right_Opnd => Right_Opnd (Rop)))); Analyze_And_Resolve (N, Typ); return; else -- If the result is modular, perform the reduction of the result -- appropriately. if Is_Modular_Integer_Type (Typ) and then not Non_Binary_Modulus (Typ) then Rewrite (N, Make_Op_And (Loc, Left_Opnd => Make_Op_Shift_Left (Loc, Left_Opnd => Lop, Right_Opnd => Convert_To (Standard_Natural, Right_Opnd (Rop))), Right_Opnd => Make_Integer_Literal (Loc, Modulus (Typ) - 1))); else Rewrite (N, Make_Op_Shift_Left (Loc, Left_Opnd => Lop, Right_Opnd => Convert_To (Standard_Natural, Right_Opnd (Rop)))); end if; Analyze_And_Resolve (N, Typ); return; end if; -- Same processing for the operands the other way round elsif Lp2 then if Is_Modular_Integer_Type (Typ) and then not Non_Binary_Modulus (Typ) then Rewrite (N, Make_Op_And (Loc, Left_Opnd => Make_Op_Shift_Left (Loc, Left_Opnd => Rop, Right_Opnd => Convert_To (Standard_Natural, Right_Opnd (Lop))), Right_Opnd => Make_Integer_Literal (Loc, Modulus (Typ) - 1))); else Rewrite (N, Make_Op_Shift_Left (Loc, Left_Opnd => Rop, Right_Opnd => Convert_To (Standard_Natural, Right_Opnd (Lop)))); end if; Analyze_And_Resolve (N, Typ); return; end if; -- Do required fixup of universal fixed operation if Typ = Universal_Fixed then Fixup_Universal_Fixed_Operation (N); Typ := Etype (N); end if; -- Multiplications with fixed-point results if Is_Fixed_Point_Type (Typ) then -- No special processing if Treat_Fixed_As_Integer is set, since from -- a semantic point of view such operations are simply integer -- operations and will be treated that way. if not Treat_Fixed_As_Integer (N) then -- Case of fixed * integer => fixed if Is_Integer_Type (Rtyp) then Expand_Multiply_Fixed_By_Integer_Giving_Fixed (N); -- Case of integer * fixed => fixed elsif Is_Integer_Type (Ltyp) then Expand_Multiply_Integer_By_Fixed_Giving_Fixed (N); -- Case of fixed * fixed => fixed else Expand_Multiply_Fixed_By_Fixed_Giving_Fixed (N); end if; end if; -- Other cases of multiplication of fixed-point operands. Again we -- exclude the cases where Treat_Fixed_As_Integer flag is set. elsif (Is_Fixed_Point_Type (Ltyp) or else Is_Fixed_Point_Type (Rtyp)) and then not Treat_Fixed_As_Integer (N) then if Is_Integer_Type (Typ) then Expand_Multiply_Fixed_By_Fixed_Giving_Integer (N); else pragma Assert (Is_Floating_Point_Type (Typ)); Expand_Multiply_Fixed_By_Fixed_Giving_Float (N); end if; -- Mixed-mode operations can appear in a non-static universal context, -- in which case the integer argument must be converted explicitly. elsif Typ = Universal_Real and then Is_Integer_Type (Rtyp) then Rewrite (Rop, Convert_To (Universal_Real, Relocate_Node (Rop))); Analyze_And_Resolve (Rop, Universal_Real); elsif Typ = Universal_Real and then Is_Integer_Type (Ltyp) then Rewrite (Lop, Convert_To (Universal_Real, Relocate_Node (Lop))); Analyze_And_Resolve (Lop, Universal_Real); -- Non-fixed point cases, check software overflow checking required elsif Is_Signed_Integer_Type (Etype (N)) then Apply_Arithmetic_Overflow_Check (N); end if; -- Overflow checks for floating-point if -gnateF mode active Check_Float_Op_Overflow (N); end Expand_N_Op_Multiply; -------------------- -- Expand_N_Op_Ne -- -------------------- procedure Expand_N_Op_Ne (N : Node_Id) is Typ : constant Entity_Id := Etype (Left_Opnd (N)); begin -- Case of elementary type with standard operator if Is_Elementary_Type (Typ) and then Sloc (Entity (N)) = Standard_Location then Binary_Op_Validity_Checks (N); -- Deal with overflow checks in MINIMIZED/ELIMINATED mode and if -- means we no longer have a /= operation, we are all done. Expand_Compare_Minimize_Eliminate_Overflow (N); if Nkind (N) /= N_Op_Ne then return; end if; -- Boolean types (requiring handling of non-standard case) if Is_Boolean_Type (Typ) then Adjust_Condition (Left_Opnd (N)); Adjust_Condition (Right_Opnd (N)); Set_Etype (N, Standard_Boolean); Adjust_Result_Type (N, Typ); end if; Rewrite_Comparison (N); -- For all cases other than elementary types, we rewrite node as the -- negation of an equality operation, and reanalyze. The equality to be -- used is defined in the same scope and has the same signature. This -- signature must be set explicitly since in an instance it may not have -- the same visibility as in the generic unit. This avoids duplicating -- or factoring the complex code for record/array equality tests etc. else declare Loc : constant Source_Ptr := Sloc (N); Neg : Node_Id; Ne : constant Entity_Id := Entity (N); begin Binary_Op_Validity_Checks (N); Neg := Make_Op_Not (Loc, Right_Opnd => Make_Op_Eq (Loc, Left_Opnd => Left_Opnd (N), Right_Opnd => Right_Opnd (N))); Set_Paren_Count (Right_Opnd (Neg), 1); if Scope (Ne) /= Standard_Standard then Set_Entity (Right_Opnd (Neg), Corresponding_Equality (Ne)); end if; -- For navigation purposes, we want to treat the inequality as an -- implicit reference to the corresponding equality. Preserve the -- Comes_From_ source flag to generate proper Xref entries. Preserve_Comes_From_Source (Neg, N); Preserve_Comes_From_Source (Right_Opnd (Neg), N); Rewrite (N, Neg); Analyze_And_Resolve (N, Standard_Boolean); end; end if; Optimize_Length_Comparison (N); end Expand_N_Op_Ne; --------------------- -- Expand_N_Op_Not -- --------------------- -- If the argument is other than a Boolean array type, there is no special -- expansion required, except for dealing with validity checks, and non- -- standard boolean representations. -- For the packed array case, we call the special routine in Exp_Pakd, -- except that if the component size is greater than one, we use the -- standard routine generating a gruesome loop (it is so peculiar to have -- packed arrays with non-standard Boolean representations anyway, so it -- does not matter that we do not handle this case efficiently). -- For the unpacked array case (and for the special packed case where we -- have non standard Booleans, as discussed above), we generate and insert -- into the tree the following function definition: -- function Nnnn (A : arr) is -- B : arr; -- begin -- for J in a'range loop -- B (J) := not A (J); -- end loop; -- return B; -- end Nnnn; -- Here arr is the actual subtype of the parameter (and hence always -- constrained). Then we replace the not with a call to this function. procedure Expand_N_Op_Not (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Typ : constant Entity_Id := Etype (N); Opnd : Node_Id; Arr : Entity_Id; A : Entity_Id; B : Entity_Id; J : Entity_Id; A_J : Node_Id; B_J : Node_Id; Func_Name : Entity_Id; Loop_Statement : Node_Id; begin Unary_Op_Validity_Checks (N); -- For boolean operand, deal with non-standard booleans if Is_Boolean_Type (Typ) then Adjust_Condition (Right_Opnd (N)); Set_Etype (N, Standard_Boolean); Adjust_Result_Type (N, Typ); return; end if; -- Only array types need any other processing if not Is_Array_Type (Typ) then return; end if; -- Case of array operand. If bit packed with a component size of 1, -- handle it in Exp_Pakd if the operand is known to be aligned. if Is_Bit_Packed_Array (Typ) and then Component_Size (Typ) = 1 and then not Is_Possibly_Unaligned_Object (Right_Opnd (N)) then Expand_Packed_Not (N); return; end if; -- Case of array operand which is not bit-packed. If the context is -- a safe assignment, call in-place operation, If context is a larger -- boolean expression in the context of a safe assignment, expansion is -- done by enclosing operation. Opnd := Relocate_Node (Right_Opnd (N)); Convert_To_Actual_Subtype (Opnd); Arr := Etype (Opnd); Ensure_Defined (Arr, N); Silly_Boolean_Array_Not_Test (N, Arr); if Nkind (Parent (N)) = N_Assignment_Statement then if Safe_In_Place_Array_Op (Name (Parent (N)), N, Empty) then Build_Boolean_Array_Proc_Call (Parent (N), Opnd, Empty); return; -- Special case the negation of a binary operation elsif Nkind_In (Opnd, N_Op_And, N_Op_Or, N_Op_Xor) and then Safe_In_Place_Array_Op (Name (Parent (N)), Left_Opnd (Opnd), Right_Opnd (Opnd)) then Build_Boolean_Array_Proc_Call (Parent (N), Opnd, Empty); return; end if; elsif Nkind (Parent (N)) in N_Binary_Op and then Nkind (Parent (Parent (N))) = N_Assignment_Statement then declare Op1 : constant Node_Id := Left_Opnd (Parent (N)); Op2 : constant Node_Id := Right_Opnd (Parent (N)); Lhs : constant Node_Id := Name (Parent (Parent (N))); begin if Safe_In_Place_Array_Op (Lhs, Op1, Op2) then -- (not A) op (not B) can be reduced to a single call if N = Op1 and then Nkind (Op2) = N_Op_Not then return; elsif N = Op2 and then Nkind (Op1) = N_Op_Not then return; -- A xor (not B) can also be special-cased elsif N = Op2 and then Nkind (Parent (N)) = N_Op_Xor then return; end if; end if; end; end if; A := Make_Defining_Identifier (Loc, Name_uA); B := Make_Defining_Identifier (Loc, Name_uB); J := Make_Defining_Identifier (Loc, Name_uJ); A_J := Make_Indexed_Component (Loc, Prefix => New_Occurrence_Of (A, Loc), Expressions => New_List (New_Occurrence_Of (J, Loc))); B_J := Make_Indexed_Component (Loc, Prefix => New_Occurrence_Of (B, Loc), Expressions => New_List (New_Occurrence_Of (J, Loc))); Loop_Statement := Make_Implicit_Loop_Statement (N, Identifier => Empty, Iteration_Scheme => Make_Iteration_Scheme (Loc, Loop_Parameter_Specification => Make_Loop_Parameter_Specification (Loc, Defining_Identifier => J, Discrete_Subtype_Definition => Make_Attribute_Reference (Loc, Prefix => Make_Identifier (Loc, Chars (A)), Attribute_Name => Name_Range))), Statements => New_List ( Make_Assignment_Statement (Loc, Name => B_J, Expression => Make_Op_Not (Loc, A_J)))); Func_Name := Make_Temporary (Loc, 'N'); Set_Is_Inlined (Func_Name); Insert_Action (N, Make_Subprogram_Body (Loc, Specification => Make_Function_Specification (Loc, Defining_Unit_Name => Func_Name, Parameter_Specifications => New_List ( Make_Parameter_Specification (Loc, Defining_Identifier => A, Parameter_Type => New_Occurrence_Of (Typ, Loc))), Result_Definition => New_Occurrence_Of (Typ, Loc)), Declarations => New_List ( Make_Object_Declaration (Loc, Defining_Identifier => B, Object_Definition => New_Occurrence_Of (Arr, Loc))), Handled_Statement_Sequence => Make_Handled_Sequence_Of_Statements (Loc, Statements => New_List ( Loop_Statement, Make_Simple_Return_Statement (Loc, Expression => Make_Identifier (Loc, Chars (B))))))); Rewrite (N, Make_Function_Call (Loc, Name => New_Occurrence_Of (Func_Name, Loc), Parameter_Associations => New_List (Opnd))); Analyze_And_Resolve (N, Typ); end Expand_N_Op_Not; -------------------- -- Expand_N_Op_Or -- -------------------- procedure Expand_N_Op_Or (N : Node_Id) is Typ : constant Entity_Id := Etype (N); begin Binary_Op_Validity_Checks (N); if Is_Array_Type (Etype (N)) then Expand_Boolean_Operator (N); elsif Is_Boolean_Type (Etype (N)) then Adjust_Condition (Left_Opnd (N)); Adjust_Condition (Right_Opnd (N)); Set_Etype (N, Standard_Boolean); Adjust_Result_Type (N, Typ); elsif Is_Intrinsic_Subprogram (Entity (N)) then Expand_Intrinsic_Call (N, Entity (N)); end if; end Expand_N_Op_Or; ---------------------- -- Expand_N_Op_Plus -- ---------------------- procedure Expand_N_Op_Plus (N : Node_Id) is begin Unary_Op_Validity_Checks (N); -- Check for MINIMIZED/ELIMINATED overflow mode if Minimized_Eliminated_Overflow_Check (N) then Apply_Arithmetic_Overflow_Check (N); return; end if; end Expand_N_Op_Plus; --------------------- -- Expand_N_Op_Rem -- --------------------- procedure Expand_N_Op_Rem (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Typ : constant Entity_Id := Etype (N); Left : Node_Id; Right : Node_Id; Lo : Uint; Hi : Uint; OK : Boolean; Lneg : Boolean; Rneg : Boolean; -- Set if corresponding operand can be negative pragma Unreferenced (Hi); begin Binary_Op_Validity_Checks (N); -- Check for MINIMIZED/ELIMINATED overflow mode if Minimized_Eliminated_Overflow_Check (N) then Apply_Arithmetic_Overflow_Check (N); return; end if; if Is_Integer_Type (Etype (N)) then Apply_Divide_Checks (N); -- All done if we don't have a REM any more, which can happen as a -- result of overflow expansion in MINIMIZED or ELIMINATED modes. if Nkind (N) /= N_Op_Rem then return; end if; end if; -- Proceed with expansion of REM Left := Left_Opnd (N); Right := Right_Opnd (N); -- Apply optimization x rem 1 = 0. We don't really need that with gcc, -- but it is useful with other back ends, and is certainly harmless. if Is_Integer_Type (Etype (N)) and then Compile_Time_Known_Value (Right) and then Expr_Value (Right) = Uint_1 then -- Call Remove_Side_Effects to ensure that any side effects in the -- ignored left operand (in particular function calls to user defined -- functions) are properly executed. Remove_Side_Effects (Left); Rewrite (N, Make_Integer_Literal (Loc, 0)); Analyze_And_Resolve (N, Typ); return; end if; -- Deal with annoying case of largest negative number remainder minus -- one. Gigi may not handle this case correctly, because on some -- targets, the mod value is computed using a divide instruction -- which gives an overflow trap for this case. -- It would be a bit more efficient to figure out which targets this -- is really needed for, but in practice it is reasonable to do the -- following special check in all cases, since it means we get a clearer -- message, and also the overhead is minimal given that division is -- expensive in any case. -- In fact the check is quite easy, if the right operand is -1, then -- the remainder is always 0, and we can just ignore the left operand -- completely in this case. Determine_Range (Right, OK, Lo, Hi, Assume_Valid => True); Lneg := (not OK) or else Lo < 0; Determine_Range (Left, OK, Lo, Hi, Assume_Valid => True); Rneg := (not OK) or else Lo < 0; -- We won't mess with trying to find out if the left operand can really -- be the largest negative number (that's a pain in the case of private -- types and this is really marginal). We will just assume that we need -- the test if the left operand can be negative at all. if Lneg and Rneg then Rewrite (N, Make_If_Expression (Loc, Expressions => New_List ( Make_Op_Eq (Loc, Left_Opnd => Duplicate_Subexpr (Right), Right_Opnd => Unchecked_Convert_To (Typ, Make_Integer_Literal (Loc, -1))), Unchecked_Convert_To (Typ, Make_Integer_Literal (Loc, Uint_0)), Relocate_Node (N)))); Set_Analyzed (Next (Next (First (Expressions (N))))); Analyze_And_Resolve (N, Typ); end if; end Expand_N_Op_Rem; ----------------------------- -- Expand_N_Op_Rotate_Left -- ----------------------------- procedure Expand_N_Op_Rotate_Left (N : Node_Id) is begin Binary_Op_Validity_Checks (N); -- If we are in Modify_Tree_For_C mode, there is no rotate left in C, -- so we rewrite in terms of logical shifts -- Shift_Left (Num, Bits) or Shift_Right (num, Esize - Bits) -- where Bits is the shift count mod Esize (the mod operation here -- deals with ludicrous large shift counts, which are apparently OK). -- What about nonbinary modulus ??? declare Loc : constant Source_Ptr := Sloc (N); Rtp : constant Entity_Id := Etype (Right_Opnd (N)); Typ : constant Entity_Id := Etype (N); begin if Modify_Tree_For_C then Rewrite (Right_Opnd (N), Make_Op_Rem (Loc, Left_Opnd => Relocate_Node (Right_Opnd (N)), Right_Opnd => Make_Integer_Literal (Loc, Esize (Typ)))); Analyze_And_Resolve (Right_Opnd (N), Rtp); Rewrite (N, Make_Op_Or (Loc, Left_Opnd => Make_Op_Shift_Left (Loc, Left_Opnd => Left_Opnd (N), Right_Opnd => Right_Opnd (N)), Right_Opnd => Make_Op_Shift_Right (Loc, Left_Opnd => Duplicate_Subexpr_No_Checks (Left_Opnd (N)), Right_Opnd => Make_Op_Subtract (Loc, Left_Opnd => Make_Integer_Literal (Loc, Esize (Typ)), Right_Opnd => Duplicate_Subexpr_No_Checks (Right_Opnd (N)))))); Analyze_And_Resolve (N, Typ); end if; end; end Expand_N_Op_Rotate_Left; ------------------------------ -- Expand_N_Op_Rotate_Right -- ------------------------------ procedure Expand_N_Op_Rotate_Right (N : Node_Id) is begin Binary_Op_Validity_Checks (N); -- If we are in Modify_Tree_For_C mode, there is no rotate right in C, -- so we rewrite in terms of logical shifts -- Shift_Right (Num, Bits) or Shift_Left (num, Esize - Bits) -- where Bits is the shift count mod Esize (the mod operation here -- deals with ludicrous large shift counts, which are apparently OK). -- What about nonbinary modulus ??? declare Loc : constant Source_Ptr := Sloc (N); Rtp : constant Entity_Id := Etype (Right_Opnd (N)); Typ : constant Entity_Id := Etype (N); begin Rewrite (Right_Opnd (N), Make_Op_Rem (Loc, Left_Opnd => Relocate_Node (Right_Opnd (N)), Right_Opnd => Make_Integer_Literal (Loc, Esize (Typ)))); Analyze_And_Resolve (Right_Opnd (N), Rtp); if Modify_Tree_For_C then Rewrite (N, Make_Op_Or (Loc, Left_Opnd => Make_Op_Shift_Right (Loc, Left_Opnd => Left_Opnd (N), Right_Opnd => Right_Opnd (N)), Right_Opnd => Make_Op_Shift_Left (Loc, Left_Opnd => Duplicate_Subexpr_No_Checks (Left_Opnd (N)), Right_Opnd => Make_Op_Subtract (Loc, Left_Opnd => Make_Integer_Literal (Loc, Esize (Typ)), Right_Opnd => Duplicate_Subexpr_No_Checks (Right_Opnd (N)))))); Analyze_And_Resolve (N, Typ); end if; end; end Expand_N_Op_Rotate_Right; ---------------------------- -- Expand_N_Op_Shift_Left -- ---------------------------- -- Note: nothing in this routine depends on left as opposed to right shifts -- so we share the routine for expanding shift right operations. procedure Expand_N_Op_Shift_Left (N : Node_Id) is begin Binary_Op_Validity_Checks (N); -- If we are in Modify_Tree_For_C mode, then ensure that the right -- operand is not greater than the word size (since that would not -- be defined properly by the corresponding C shift operator). if Modify_Tree_For_C then declare Right : constant Node_Id := Right_Opnd (N); Loc : constant Source_Ptr := Sloc (Right); Typ : constant Entity_Id := Etype (N); Siz : constant Uint := Esize (Typ); Orig : Node_Id; OK : Boolean; Lo : Uint; Hi : Uint; begin if Compile_Time_Known_Value (Right) then if Expr_Value (Right) >= Siz then Rewrite (N, Make_Integer_Literal (Loc, 0)); Analyze_And_Resolve (N, Typ); end if; -- Not compile time known, find range else Determine_Range (Right, OK, Lo, Hi, Assume_Valid => True); -- Nothing to do if known to be OK range, otherwise expand if not OK or else Hi >= Siz then -- Prevent recursion on copy of shift node Orig := Relocate_Node (N); Set_Analyzed (Orig); -- Now do the rewrite Rewrite (N, Make_If_Expression (Loc, Expressions => New_List ( Make_Op_Ge (Loc, Left_Opnd => Duplicate_Subexpr_Move_Checks (Right), Right_Opnd => Make_Integer_Literal (Loc, Siz)), Make_Integer_Literal (Loc, 0), Orig))); Analyze_And_Resolve (N, Typ); end if; end if; end; end if; end Expand_N_Op_Shift_Left; ----------------------------- -- Expand_N_Op_Shift_Right -- ----------------------------- procedure Expand_N_Op_Shift_Right (N : Node_Id) is begin -- Share shift left circuit Expand_N_Op_Shift_Left (N); end Expand_N_Op_Shift_Right; ---------------------------------------- -- Expand_N_Op_Shift_Right_Arithmetic -- ---------------------------------------- procedure Expand_N_Op_Shift_Right_Arithmetic (N : Node_Id) is begin Binary_Op_Validity_Checks (N); -- If we are in Modify_Tree_For_C mode, there is no shift right -- arithmetic in C, so we rewrite in terms of logical shifts. -- Shift_Right (Num, Bits) or -- (if Num >= Sign -- then not (Shift_Right (Mask, bits)) -- else 0) -- Here Mask is all 1 bits (2**size - 1), and Sign is 2**(size - 1) -- Note: in almost all C compilers it would work to just shift a -- signed integer right, but it's undefined and we cannot rely on it. -- Note: the above works fine for shift counts greater than or equal -- to the word size, since in this case (not (Shift_Right (Mask, bits))) -- generates all 1'bits. -- What about nonbinary modulus ??? declare Loc : constant Source_Ptr := Sloc (N); Typ : constant Entity_Id := Etype (N); Sign : constant Uint := 2 ** (Esize (Typ) - 1); Mask : constant Uint := (2 ** Esize (Typ)) - 1; Left : constant Node_Id := Left_Opnd (N); Right : constant Node_Id := Right_Opnd (N); Maskx : Node_Id; begin if Modify_Tree_For_C then -- Here if not (Shift_Right (Mask, bits)) can be computed at -- compile time as a single constant. if Compile_Time_Known_Value (Right) then declare Val : constant Uint := Expr_Value (Right); begin if Val >= Esize (Typ) then Maskx := Make_Integer_Literal (Loc, Mask); else Maskx := Make_Integer_Literal (Loc, Intval => Mask - (Mask / (2 ** Expr_Value (Right)))); end if; end; else Maskx := Make_Op_Not (Loc, Right_Opnd => Make_Op_Shift_Right (Loc, Left_Opnd => Make_Integer_Literal (Loc, Mask), Right_Opnd => Duplicate_Subexpr_No_Checks (Right))); end if; -- Now do the rewrite Rewrite (N, Make_Op_Or (Loc, Left_Opnd => Make_Op_Shift_Right (Loc, Left_Opnd => Left, Right_Opnd => Right), Right_Opnd => Make_If_Expression (Loc, Expressions => New_List ( Make_Op_Ge (Loc, Left_Opnd => Duplicate_Subexpr_No_Checks (Left), Right_Opnd => Make_Integer_Literal (Loc, Sign)), Maskx, Make_Integer_Literal (Loc, 0))))); Analyze_And_Resolve (N, Typ); end if; end; end Expand_N_Op_Shift_Right_Arithmetic; -------------------------- -- Expand_N_Op_Subtract -- -------------------------- procedure Expand_N_Op_Subtract (N : Node_Id) is Typ : constant Entity_Id := Etype (N); begin Binary_Op_Validity_Checks (N); -- Check for MINIMIZED/ELIMINATED overflow mode if Minimized_Eliminated_Overflow_Check (N) then Apply_Arithmetic_Overflow_Check (N); return; end if; -- N - 0 = N for integer types if Is_Integer_Type (Typ) and then Compile_Time_Known_Value (Right_Opnd (N)) and then Expr_Value (Right_Opnd (N)) = 0 then Rewrite (N, Left_Opnd (N)); return; end if; -- Arithmetic overflow checks for signed integer/fixed point types if Is_Signed_Integer_Type (Typ) or else Is_Fixed_Point_Type (Typ) then Apply_Arithmetic_Overflow_Check (N); end if; -- Overflow checks for floating-point if -gnateF mode active Check_Float_Op_Overflow (N); end Expand_N_Op_Subtract; --------------------- -- Expand_N_Op_Xor -- --------------------- procedure Expand_N_Op_Xor (N : Node_Id) is Typ : constant Entity_Id := Etype (N); begin Binary_Op_Validity_Checks (N); if Is_Array_Type (Etype (N)) then Expand_Boolean_Operator (N); elsif Is_Boolean_Type (Etype (N)) then Adjust_Condition (Left_Opnd (N)); Adjust_Condition (Right_Opnd (N)); Set_Etype (N, Standard_Boolean); Adjust_Result_Type (N, Typ); elsif Is_Intrinsic_Subprogram (Entity (N)) then Expand_Intrinsic_Call (N, Entity (N)); end if; end Expand_N_Op_Xor; ---------------------- -- Expand_N_Or_Else -- ---------------------- procedure Expand_N_Or_Else (N : Node_Id) renames Expand_Short_Circuit_Operator; ----------------------------------- -- Expand_N_Qualified_Expression -- ----------------------------------- procedure Expand_N_Qualified_Expression (N : Node_Id) is Operand : constant Node_Id := Expression (N); Target_Type : constant Entity_Id := Entity (Subtype_Mark (N)); begin -- Do validity check if validity checking operands if Validity_Checks_On and Validity_Check_Operands then Ensure_Valid (Operand); end if; -- Apply possible constraint check Apply_Constraint_Check (Operand, Target_Type, No_Sliding => True); if Do_Range_Check (Operand) then Set_Do_Range_Check (Operand, False); Generate_Range_Check (Operand, Target_Type, CE_Range_Check_Failed); end if; end Expand_N_Qualified_Expression; ------------------------------------ -- Expand_N_Quantified_Expression -- ------------------------------------ -- We expand: -- for all X in range => Cond -- into: -- T := True; -- for X in range loop -- if not Cond then -- T := False; -- exit; -- end if; -- end loop; -- Similarly, an existentially quantified expression: -- for some X in range => Cond -- becomes: -- T := False; -- for X in range loop -- if Cond then -- T := True; -- exit; -- end if; -- end loop; -- In both cases, the iteration may be over a container in which case it is -- given by an iterator specification, not a loop parameter specification. procedure Expand_N_Quantified_Expression (N : Node_Id) is Actions : constant List_Id := New_List; For_All : constant Boolean := All_Present (N); Iter_Spec : constant Node_Id := Iterator_Specification (N); Loc : constant Source_Ptr := Sloc (N); Loop_Spec : constant Node_Id := Loop_Parameter_Specification (N); Cond : Node_Id; Flag : Entity_Id; Scheme : Node_Id; Stmts : List_Id; begin -- Create the declaration of the flag which tracks the status of the -- quantified expression. Generate: -- Flag : Boolean := (True | False); Flag := Make_Temporary (Loc, 'T', N); Append_To (Actions, Make_Object_Declaration (Loc, Defining_Identifier => Flag, Object_Definition => New_Occurrence_Of (Standard_Boolean, Loc), Expression => New_Occurrence_Of (Boolean_Literals (For_All), Loc))); -- Construct the circuitry which tracks the status of the quantified -- expression. Generate: -- if [not] Cond then -- Flag := (False | True); -- exit; -- end if; Cond := Relocate_Node (Condition (N)); if For_All then Cond := Make_Op_Not (Loc, Cond); end if; Stmts := New_List ( Make_Implicit_If_Statement (N, Condition => Cond, Then_Statements => New_List ( Make_Assignment_Statement (Loc, Name => New_Occurrence_Of (Flag, Loc), Expression => New_Occurrence_Of (Boolean_Literals (not For_All), Loc)), Make_Exit_Statement (Loc)))); -- Build the loop equivalent of the quantified expression if Present (Iter_Spec) then Scheme := Make_Iteration_Scheme (Loc, Iterator_Specification => Iter_Spec); else Scheme := Make_Iteration_Scheme (Loc, Loop_Parameter_Specification => Loop_Spec); end if; Append_To (Actions, Make_Loop_Statement (Loc, Iteration_Scheme => Scheme, Statements => Stmts, End_Label => Empty)); -- Transform the quantified expression Rewrite (N, Make_Expression_With_Actions (Loc, Expression => New_Occurrence_Of (Flag, Loc), Actions => Actions)); Analyze_And_Resolve (N, Standard_Boolean); end Expand_N_Quantified_Expression; --------------------------------- -- Expand_N_Selected_Component -- --------------------------------- procedure Expand_N_Selected_Component (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Par : constant Node_Id := Parent (N); P : constant Node_Id := Prefix (N); S : constant Node_Id := Selector_Name (N); Ptyp : Entity_Id := Underlying_Type (Etype (P)); Disc : Entity_Id; New_N : Node_Id; Dcon : Elmt_Id; Dval : Node_Id; function In_Left_Hand_Side (Comp : Node_Id) return Boolean; -- Gigi needs a temporary for prefixes that depend on a discriminant, -- unless the context of an assignment can provide size information. -- Don't we have a general routine that does this??? function Is_Subtype_Declaration return Boolean; -- The replacement of a discriminant reference by its value is required -- if this is part of the initialization of an temporary generated by a -- change of representation. This shows up as the construction of a -- discriminant constraint for a subtype declared at the same point as -- the entity in the prefix of the selected component. We recognize this -- case when the context of the reference is: -- subtype ST is T(Obj.D); -- where the entity for Obj comes from source, and ST has the same sloc. ----------------------- -- In_Left_Hand_Side -- ----------------------- function In_Left_Hand_Side (Comp : Node_Id) return Boolean is begin return (Nkind (Parent (Comp)) = N_Assignment_Statement and then Comp = Name (Parent (Comp))) or else (Present (Parent (Comp)) and then Nkind (Parent (Comp)) in N_Subexpr and then In_Left_Hand_Side (Parent (Comp))); end In_Left_Hand_Side; ----------------------------- -- Is_Subtype_Declaration -- ----------------------------- function Is_Subtype_Declaration return Boolean is Par : constant Node_Id := Parent (N); begin return Nkind (Par) = N_Index_Or_Discriminant_Constraint and then Nkind (Parent (Parent (Par))) = N_Subtype_Declaration and then Comes_From_Source (Entity (Prefix (N))) and then Sloc (Par) = Sloc (Entity (Prefix (N))); end Is_Subtype_Declaration; -- Start of processing for Expand_N_Selected_Component begin -- Insert explicit dereference if required if Is_Access_Type (Ptyp) then -- First set prefix type to proper access type, in case it currently -- has a private (non-access) view of this type. Set_Etype (P, Ptyp); Insert_Explicit_Dereference (P); Analyze_And_Resolve (P, Designated_Type (Ptyp)); if Ekind (Etype (P)) = E_Private_Subtype and then Is_For_Access_Subtype (Etype (P)) then Set_Etype (P, Base_Type (Etype (P))); end if; Ptyp := Etype (P); end if; -- Deal with discriminant check required if Do_Discriminant_Check (N) then if Present (Discriminant_Checking_Func (Original_Record_Component (Entity (S)))) then -- Present the discriminant checking function to the backend, so -- that it can inline the call to the function. Add_Inlined_Body (Discriminant_Checking_Func (Original_Record_Component (Entity (S))), N); -- Now reset the flag and generate the call Set_Do_Discriminant_Check (N, False); Generate_Discriminant_Check (N); -- In the case of Unchecked_Union, no discriminant checking is -- actually performed. else Set_Do_Discriminant_Check (N, False); end if; end if; -- Ada 2005 (AI-318-02): If the prefix is a call to a build-in-place -- function, then additional actuals must be passed. if Ada_Version >= Ada_2005 and then Is_Build_In_Place_Function_Call (P) then Make_Build_In_Place_Call_In_Anonymous_Context (P); end if; -- Gigi cannot handle unchecked conversions that are the prefix of a -- selected component with discriminants. This must be checked during -- expansion, because during analysis the type of the selector is not -- known at the point the prefix is analyzed. If the conversion is the -- target of an assignment, then we cannot force the evaluation. if Nkind (Prefix (N)) = N_Unchecked_Type_Conversion and then Has_Discriminants (Etype (N)) and then not In_Left_Hand_Side (N) then Force_Evaluation (Prefix (N)); end if; -- Remaining processing applies only if selector is a discriminant if Ekind (Entity (Selector_Name (N))) = E_Discriminant then -- If the selector is a discriminant of a constrained record type, -- we may be able to rewrite the expression with the actual value -- of the discriminant, a useful optimization in some cases. if Is_Record_Type (Ptyp) and then Has_Discriminants (Ptyp) and then Is_Constrained (Ptyp) then -- Do this optimization for discrete types only, and not for -- access types (access discriminants get us into trouble). if not Is_Discrete_Type (Etype (N)) then null; -- Don't do this on the left-hand side of an assignment statement. -- Normally one would think that references like this would not -- occur, but they do in generated code, and mean that we really -- do want to assign the discriminant. elsif Nkind (Par) = N_Assignment_Statement and then Name (Par) = N then null; -- Don't do this optimization for the prefix of an attribute or -- the name of an object renaming declaration since these are -- contexts where we do not want the value anyway. elsif (Nkind (Par) = N_Attribute_Reference and then Prefix (Par) = N) or else Is_Renamed_Object (N) then null; -- Don't do this optimization if we are within the code for a -- discriminant check, since the whole point of such a check may -- be to verify the condition on which the code below depends. elsif Is_In_Discriminant_Check (N) then null; -- Green light to see if we can do the optimization. There is -- still one condition that inhibits the optimization below but -- now is the time to check the particular discriminant. else -- Loop through discriminants to find the matching discriminant -- constraint to see if we can copy it. Disc := First_Discriminant (Ptyp); Dcon := First_Elmt (Discriminant_Constraint (Ptyp)); Discr_Loop : while Present (Dcon) loop Dval := Node (Dcon); -- Check if this is the matching discriminant and if the -- discriminant value is simple enough to make sense to -- copy. We don't want to copy complex expressions, and -- indeed to do so can cause trouble (before we put in -- this guard, a discriminant expression containing an -- AND THEN was copied, causing problems for coverage -- analysis tools). -- However, if the reference is part of the initialization -- code generated for an object declaration, we must use -- the discriminant value from the subtype constraint, -- because the selected component may be a reference to the -- object being initialized, whose discriminant is not yet -- set. This only happens in complex cases involving changes -- or representation. if Disc = Entity (Selector_Name (N)) and then (Is_Entity_Name (Dval) or else Compile_Time_Known_Value (Dval) or else Is_Subtype_Declaration) then -- Here we have the matching discriminant. Check for -- the case of a discriminant of a component that is -- constrained by an outer discriminant, which cannot -- be optimized away. if Denotes_Discriminant (Dval, Check_Concurrent => True) then exit Discr_Loop; elsif Nkind (Original_Node (Dval)) = N_Selected_Component and then Denotes_Discriminant (Selector_Name (Original_Node (Dval)), True) then exit Discr_Loop; -- Do not retrieve value if constraint is not static. It -- is generally not useful, and the constraint may be a -- rewritten outer discriminant in which case it is in -- fact incorrect. elsif Is_Entity_Name (Dval) and then Nkind (Parent (Entity (Dval))) = N_Object_Declaration and then Present (Expression (Parent (Entity (Dval)))) and then not Is_OK_Static_Expression (Expression (Parent (Entity (Dval)))) then exit Discr_Loop; -- In the context of a case statement, the expression may -- have the base type of the discriminant, and we need to -- preserve the constraint to avoid spurious errors on -- missing cases. elsif Nkind (Parent (N)) = N_Case_Statement and then Etype (Dval) /= Etype (Disc) then Rewrite (N, Make_Qualified_Expression (Loc, Subtype_Mark => New_Occurrence_Of (Etype (Disc), Loc), Expression => New_Copy_Tree (Dval))); Analyze_And_Resolve (N, Etype (Disc)); -- In case that comes out as a static expression, -- reset it (a selected component is never static). Set_Is_Static_Expression (N, False); return; -- Otherwise we can just copy the constraint, but the -- result is certainly not static. In some cases the -- discriminant constraint has been analyzed in the -- context of the original subtype indication, but for -- itypes the constraint might not have been analyzed -- yet, and this must be done now. else Rewrite (N, New_Copy_Tree (Dval)); Analyze_And_Resolve (N); Set_Is_Static_Expression (N, False); return; end if; end if; Next_Elmt (Dcon); Next_Discriminant (Disc); end loop Discr_Loop; -- Note: the above loop should always find a matching -- discriminant, but if it does not, we just missed an -- optimization due to some glitch (perhaps a previous -- error), so ignore. end if; end if; -- The only remaining processing is in the case of a discriminant of -- a concurrent object, where we rewrite the prefix to denote the -- corresponding record type. If the type is derived and has renamed -- discriminants, use corresponding discriminant, which is the one -- that appears in the corresponding record. if not Is_Concurrent_Type (Ptyp) then return; end if; Disc := Entity (Selector_Name (N)); if Is_Derived_Type (Ptyp) and then Present (Corresponding_Discriminant (Disc)) then Disc := Corresponding_Discriminant (Disc); end if; New_N := Make_Selected_Component (Loc, Prefix => Unchecked_Convert_To (Corresponding_Record_Type (Ptyp), New_Copy_Tree (P)), Selector_Name => Make_Identifier (Loc, Chars (Disc))); Rewrite (N, New_N); Analyze (N); end if; -- Set Atomic_Sync_Required if necessary for atomic component if Nkind (N) = N_Selected_Component then declare E : constant Entity_Id := Entity (Selector_Name (N)); Set : Boolean; begin -- If component is atomic, but type is not, setting depends on -- disable/enable state for the component. if Is_Atomic (E) and then not Is_Atomic (Etype (E)) then Set := not Atomic_Synchronization_Disabled (E); -- If component is not atomic, but its type is atomic, setting -- depends on disable/enable state for the type. elsif not Is_Atomic (E) and then Is_Atomic (Etype (E)) then Set := not Atomic_Synchronization_Disabled (Etype (E)); -- If both component and type are atomic, we disable if either -- component or its type have sync disabled. elsif Is_Atomic (E) and then Is_Atomic (Etype (E)) then Set := (not Atomic_Synchronization_Disabled (E)) and then (not Atomic_Synchronization_Disabled (Etype (E))); else Set := False; end if; -- Set flag if required if Set then Activate_Atomic_Synchronization (N); end if; end; end if; end Expand_N_Selected_Component; -------------------- -- Expand_N_Slice -- -------------------- procedure Expand_N_Slice (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Typ : constant Entity_Id := Etype (N); function Is_Procedure_Actual (N : Node_Id) return Boolean; -- Check whether the argument is an actual for a procedure call, in -- which case the expansion of a bit-packed slice is deferred until the -- call itself is expanded. The reason this is required is that we might -- have an IN OUT or OUT parameter, and the copy out is essential, and -- that copy out would be missed if we created a temporary here in -- Expand_N_Slice. Note that we don't bother to test specifically for an -- IN OUT or OUT mode parameter, since it is a bit tricky to do, and it -- is harmless to defer expansion in the IN case, since the call -- processing will still generate the appropriate copy in operation, -- which will take care of the slice. procedure Make_Temporary_For_Slice; -- Create a named variable for the value of the slice, in cases where -- the back-end cannot handle it properly, e.g. when packed types or -- unaligned slices are involved. ------------------------- -- Is_Procedure_Actual -- ------------------------- function Is_Procedure_Actual (N : Node_Id) return Boolean is Par : Node_Id := Parent (N); begin loop -- If our parent is a procedure call we can return if Nkind (Par) = N_Procedure_Call_Statement then return True; -- If our parent is a type conversion, keep climbing the tree, -- since a type conversion can be a procedure actual. Also keep -- climbing if parameter association or a qualified expression, -- since these are additional cases that do can appear on -- procedure actuals. elsif Nkind_In (Par, N_Type_Conversion, N_Parameter_Association, N_Qualified_Expression) then Par := Parent (Par); -- Any other case is not what we are looking for else return False; end if; end loop; end Is_Procedure_Actual; ------------------------------ -- Make_Temporary_For_Slice -- ------------------------------ procedure Make_Temporary_For_Slice is Ent : constant Entity_Id := Make_Temporary (Loc, 'T', N); Decl : Node_Id; begin Decl := Make_Object_Declaration (Loc, Defining_Identifier => Ent, Object_Definition => New_Occurrence_Of (Typ, Loc)); Set_No_Initialization (Decl); Insert_Actions (N, New_List ( Decl, Make_Assignment_Statement (Loc, Name => New_Occurrence_Of (Ent, Loc), Expression => Relocate_Node (N)))); Rewrite (N, New_Occurrence_Of (Ent, Loc)); Analyze_And_Resolve (N, Typ); end Make_Temporary_For_Slice; -- Local variables Pref : constant Node_Id := Prefix (N); Pref_Typ : Entity_Id := Etype (Pref); -- Start of processing for Expand_N_Slice begin -- Special handling for access types if Is_Access_Type (Pref_Typ) then Pref_Typ := Designated_Type (Pref_Typ); Rewrite (Pref, Make_Explicit_Dereference (Sloc (N), Prefix => Relocate_Node (Pref))); Analyze_And_Resolve (Pref, Pref_Typ); end if; -- Ada 2005 (AI-318-02): If the prefix is a call to a build-in-place -- function, then additional actuals must be passed. if Ada_Version >= Ada_2005 and then Is_Build_In_Place_Function_Call (Pref) then Make_Build_In_Place_Call_In_Anonymous_Context (Pref); end if; -- The remaining case to be handled is packed slices. We can leave -- packed slices as they are in the following situations: -- 1. Right or left side of an assignment (we can handle this -- situation correctly in the assignment statement expansion). -- 2. Prefix of indexed component (the slide is optimized away in this -- case, see the start of Expand_N_Slice.) -- 3. Object renaming declaration, since we want the name of the -- slice, not the value. -- 4. Argument to procedure call, since copy-in/copy-out handling may -- be required, and this is handled in the expansion of call -- itself. -- 5. Prefix of an address attribute (this is an error which is caught -- elsewhere, and the expansion would interfere with generating the -- error message). if not Is_Packed (Typ) then -- Apply transformation for actuals of a function call, where -- Expand_Actuals is not used. if Nkind (Parent (N)) = N_Function_Call and then Is_Possibly_Unaligned_Slice (N) then Make_Temporary_For_Slice; end if; elsif Nkind (Parent (N)) = N_Assignment_Statement or else (Nkind (Parent (Parent (N))) = N_Assignment_Statement and then Parent (N) = Name (Parent (Parent (N)))) then return; elsif Nkind (Parent (N)) = N_Indexed_Component or else Is_Renamed_Object (N) or else Is_Procedure_Actual (N) then return; elsif Nkind (Parent (N)) = N_Attribute_Reference and then Attribute_Name (Parent (N)) = Name_Address then return; else Make_Temporary_For_Slice; end if; end Expand_N_Slice; ------------------------------ -- Expand_N_Type_Conversion -- ------------------------------ procedure Expand_N_Type_Conversion (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Operand : constant Node_Id := Expression (N); Target_Type : constant Entity_Id := Etype (N); Operand_Type : Entity_Id := Etype (Operand); procedure Handle_Changed_Representation; -- This is called in the case of record and array type conversions to -- see if there is a change of representation to be handled. Change of -- representation is actually handled at the assignment statement level, -- and what this procedure does is rewrite node N conversion as an -- assignment to temporary. If there is no change of representation, -- then the conversion node is unchanged. procedure Raise_Accessibility_Error; -- Called when we know that an accessibility check will fail. Rewrites -- node N to an appropriate raise statement and outputs warning msgs. -- The Etype of the raise node is set to Target_Type. Note that in this -- case the rest of the processing should be skipped (i.e. the call to -- this procedure will be followed by "goto Done"). procedure Real_Range_Check; -- Handles generation of range check for real target value function Has_Extra_Accessibility (Id : Entity_Id) return Boolean; -- True iff Present (Effective_Extra_Accessibility (Id)) successfully -- evaluates to True. ----------------------------------- -- Handle_Changed_Representation -- ----------------------------------- procedure Handle_Changed_Representation is Temp : Entity_Id; Decl : Node_Id; Odef : Node_Id; Disc : Node_Id; N_Ix : Node_Id; Cons : List_Id; begin -- Nothing else to do if no change of representation if Same_Representation (Operand_Type, Target_Type) then return; -- The real change of representation work is done by the assignment -- statement processing. So if this type conversion is appearing as -- the expression of an assignment statement, nothing needs to be -- done to the conversion. elsif Nkind (Parent (N)) = N_Assignment_Statement then return; -- Otherwise we need to generate a temporary variable, and do the -- change of representation assignment into that temporary variable. -- The conversion is then replaced by a reference to this variable. else Cons := No_List; -- If type is unconstrained we have to add a constraint, copied -- from the actual value of the left-hand side. if not Is_Constrained (Target_Type) then if Has_Discriminants (Operand_Type) then Disc := First_Discriminant (Operand_Type); if Disc /= First_Stored_Discriminant (Operand_Type) then Disc := First_Stored_Discriminant (Operand_Type); end if; Cons := New_List; while Present (Disc) loop Append_To (Cons, Make_Selected_Component (Loc, Prefix => Duplicate_Subexpr_Move_Checks (Operand), Selector_Name => Make_Identifier (Loc, Chars (Disc)))); Next_Discriminant (Disc); end loop; elsif Is_Array_Type (Operand_Type) then N_Ix := First_Index (Target_Type); Cons := New_List; for J in 1 .. Number_Dimensions (Operand_Type) loop -- We convert the bounds explicitly. We use an unchecked -- conversion because bounds checks are done elsewhere. Append_To (Cons, Make_Range (Loc, Low_Bound => Unchecked_Convert_To (Etype (N_Ix), Make_Attribute_Reference (Loc, Prefix => Duplicate_Subexpr_No_Checks (Operand, Name_Req => True), Attribute_Name => Name_First, Expressions => New_List ( Make_Integer_Literal (Loc, J)))), High_Bound => Unchecked_Convert_To (Etype (N_Ix), Make_Attribute_Reference (Loc, Prefix => Duplicate_Subexpr_No_Checks (Operand, Name_Req => True), Attribute_Name => Name_Last, Expressions => New_List ( Make_Integer_Literal (Loc, J)))))); Next_Index (N_Ix); end loop; end if; end if; Odef := New_Occurrence_Of (Target_Type, Loc); if Present (Cons) then Odef := Make_Subtype_Indication (Loc, Subtype_Mark => Odef, Constraint => Make_Index_Or_Discriminant_Constraint (Loc, Constraints => Cons)); end if; Temp := Make_Temporary (Loc, 'C'); Decl := Make_Object_Declaration (Loc, Defining_Identifier => Temp, Object_Definition => Odef); Set_No_Initialization (Decl, True); -- Insert required actions. It is essential to suppress checks -- since we have suppressed default initialization, which means -- that the variable we create may have no discriminants. Insert_Actions (N, New_List ( Decl, Make_Assignment_Statement (Loc, Name => New_Occurrence_Of (Temp, Loc), Expression => Relocate_Node (N))), Suppress => All_Checks); Rewrite (N, New_Occurrence_Of (Temp, Loc)); return; end if; end Handle_Changed_Representation; ------------------------------- -- Raise_Accessibility_Error -- ------------------------------- procedure Raise_Accessibility_Error is begin Error_Msg_Warn := SPARK_Mode /= On; Rewrite (N, Make_Raise_Program_Error (Sloc (N), Reason => PE_Accessibility_Check_Failed)); Set_Etype (N, Target_Type); Error_Msg_N ("<<accessibility check failure", N); Error_Msg_NE ("\<<& [", N, Standard_Program_Error); end Raise_Accessibility_Error; ---------------------- -- Real_Range_Check -- ---------------------- -- Case of conversions to floating-point or fixed-point. If range checks -- are enabled and the target type has a range constraint, we convert: -- typ (x) -- to -- Tnn : typ'Base := typ'Base (x); -- [constraint_error when Tnn < typ'First or else Tnn > typ'Last] -- Tnn -- This is necessary when there is a conversion of integer to float or -- to fixed-point to ensure that the correct checks are made. It is not -- necessary for float to float where it is enough to simply set the -- Do_Range_Check flag. procedure Real_Range_Check is Btyp : constant Entity_Id := Base_Type (Target_Type); Lo : constant Node_Id := Type_Low_Bound (Target_Type); Hi : constant Node_Id := Type_High_Bound (Target_Type); Xtyp : constant Entity_Id := Etype (Operand); Conv : Node_Id; Tnn : Entity_Id; begin -- Nothing to do if conversion was rewritten if Nkind (N) /= N_Type_Conversion then return; end if; -- Nothing to do if range checks suppressed, or target has the same -- range as the base type (or is the base type). if Range_Checks_Suppressed (Target_Type) or else (Lo = Type_Low_Bound (Btyp) and then Hi = Type_High_Bound (Btyp)) then return; end if; -- Nothing to do if expression is an entity on which checks have been -- suppressed. if Is_Entity_Name (Operand) and then Range_Checks_Suppressed (Entity (Operand)) then return; end if; -- Nothing to do if bounds are all static and we can tell that the -- expression is within the bounds of the target. Note that if the -- operand is of an unconstrained floating-point type, then we do -- not trust it to be in range (might be infinite) declare S_Lo : constant Node_Id := Type_Low_Bound (Xtyp); S_Hi : constant Node_Id := Type_High_Bound (Xtyp); begin if (not Is_Floating_Point_Type (Xtyp) or else Is_Constrained (Xtyp)) and then Compile_Time_Known_Value (S_Lo) and then Compile_Time_Known_Value (S_Hi) and then Compile_Time_Known_Value (Hi) and then Compile_Time_Known_Value (Lo) then declare D_Lov : constant Ureal := Expr_Value_R (Lo); D_Hiv : constant Ureal := Expr_Value_R (Hi); S_Lov : Ureal; S_Hiv : Ureal; begin if Is_Real_Type (Xtyp) then S_Lov := Expr_Value_R (S_Lo); S_Hiv := Expr_Value_R (S_Hi); else S_Lov := UR_From_Uint (Expr_Value (S_Lo)); S_Hiv := UR_From_Uint (Expr_Value (S_Hi)); end if; if D_Hiv > D_Lov and then S_Lov >= D_Lov and then S_Hiv <= D_Hiv then -- Unset the range check flag on the current value of -- Expression (N), since the captured Operand may have -- been rewritten (such as for the case of a conversion -- to a fixed-point type). Set_Do_Range_Check (Expression (N), False); return; end if; end; end if; end; -- For float to float conversions, we are done if Is_Floating_Point_Type (Xtyp) and then Is_Floating_Point_Type (Btyp) then return; end if; -- Otherwise rewrite the conversion as described above Conv := Relocate_Node (N); Rewrite (Subtype_Mark (Conv), New_Occurrence_Of (Btyp, Loc)); Set_Etype (Conv, Btyp); -- Enable overflow except for case of integer to float conversions, -- where it is never required, since we can never have overflow in -- this case. if not Is_Integer_Type (Etype (Operand)) then Enable_Overflow_Check (Conv); end if; Tnn := Make_Temporary (Loc, 'T', Conv); Insert_Actions (N, New_List ( Make_Object_Declaration (Loc, Defining_Identifier => Tnn, Object_Definition => New_Occurrence_Of (Btyp, Loc), Constant_Present => True, Expression => Conv), Make_Raise_Constraint_Error (Loc, Condition => Make_Or_Else (Loc, Left_Opnd => Make_Op_Lt (Loc, Left_Opnd => New_Occurrence_Of (Tnn, Loc), Right_Opnd => Make_Attribute_Reference (Loc, Attribute_Name => Name_First, Prefix => New_Occurrence_Of (Target_Type, Loc))), Right_Opnd => Make_Op_Gt (Loc, Left_Opnd => New_Occurrence_Of (Tnn, Loc), Right_Opnd => Make_Attribute_Reference (Loc, Attribute_Name => Name_Last, Prefix => New_Occurrence_Of (Target_Type, Loc)))), Reason => CE_Range_Check_Failed))); Rewrite (N, New_Occurrence_Of (Tnn, Loc)); Analyze_And_Resolve (N, Btyp); end Real_Range_Check; ----------------------------- -- Has_Extra_Accessibility -- ----------------------------- -- Returns true for a formal of an anonymous access type or for -- an Ada 2012-style stand-alone object of an anonymous access type. function Has_Extra_Accessibility (Id : Entity_Id) return Boolean is begin if Is_Formal (Id) or else Ekind_In (Id, E_Constant, E_Variable) then return Present (Effective_Extra_Accessibility (Id)); else return False; end if; end Has_Extra_Accessibility; -- Start of processing for Expand_N_Type_Conversion begin -- First remove check marks put by the semantic analysis on the type -- conversion between array types. We need these checks, and they will -- be generated by this expansion routine, but we do not depend on these -- flags being set, and since we do intend to expand the checks in the -- front end, we don't want them on the tree passed to the back end. if Is_Array_Type (Target_Type) then if Is_Constrained (Target_Type) then Set_Do_Length_Check (N, False); else Set_Do_Range_Check (Operand, False); end if; end if; -- Nothing at all to do if conversion is to the identical type so remove -- the conversion completely, it is useless, except that it may carry -- an Assignment_OK attribute, which must be propagated to the operand. if Operand_Type = Target_Type then if Assignment_OK (N) then Set_Assignment_OK (Operand); end if; Rewrite (N, Relocate_Node (Operand)); goto Done; end if; -- Nothing to do if this is the second argument of read. This is a -- "backwards" conversion that will be handled by the specialized code -- in attribute processing. if Nkind (Parent (N)) = N_Attribute_Reference and then Attribute_Name (Parent (N)) = Name_Read and then Next (First (Expressions (Parent (N)))) = N then goto Done; end if; -- Check for case of converting to a type that has an invariant -- associated with it. This requires an invariant check. We insert -- a call: -- invariant_check (typ (expr)) -- in the code, after removing side effects from the expression. -- This is clearer than replacing the conversion into an expression -- with actions, because the context may impose additional actions -- (tag checks, membership tests, etc.) that conflict with this -- rewriting (used previously). -- Note: the Comes_From_Source check, and then the resetting of this -- flag prevents what would otherwise be an infinite recursion. if Has_Invariants (Target_Type) and then Present (Invariant_Procedure (Target_Type)) and then Comes_From_Source (N) then Set_Comes_From_Source (N, False); Remove_Side_Effects (N); Insert_Action (N, Make_Invariant_Call (Duplicate_Subexpr (N))); goto Done; end if; -- Here if we may need to expand conversion -- If the operand of the type conversion is an arithmetic operation on -- signed integers, and the based type of the signed integer type in -- question is smaller than Standard.Integer, we promote both of the -- operands to type Integer. -- For example, if we have -- target-type (opnd1 + opnd2) -- and opnd1 and opnd2 are of type short integer, then we rewrite -- this as: -- target-type (integer(opnd1) + integer(opnd2)) -- We do this because we are always allowed to compute in a larger type -- if we do the right thing with the result, and in this case we are -- going to do a conversion which will do an appropriate check to make -- sure that things are in range of the target type in any case. This -- avoids some unnecessary intermediate overflows. -- We might consider a similar transformation in the case where the -- target is a real type or a 64-bit integer type, and the operand -- is an arithmetic operation using a 32-bit integer type. However, -- we do not bother with this case, because it could cause significant -- inefficiencies on 32-bit machines. On a 64-bit machine it would be -- much cheaper, but we don't want different behavior on 32-bit and -- 64-bit machines. Note that the exclusion of the 64-bit case also -- handles the configurable run-time cases where 64-bit arithmetic -- may simply be unavailable. -- Note: this circuit is partially redundant with respect to the circuit -- in Checks.Apply_Arithmetic_Overflow_Check, but we catch more cases in -- the processing here. Also we still need the Checks circuit, since we -- have to be sure not to generate junk overflow checks in the first -- place, since it would be trick to remove them here. if Integer_Promotion_Possible (N) then -- All conditions met, go ahead with transformation declare Opnd : Node_Id; L, R : Node_Id; begin R := Make_Type_Conversion (Loc, Subtype_Mark => New_Occurrence_Of (Standard_Integer, Loc), Expression => Relocate_Node (Right_Opnd (Operand))); Opnd := New_Op_Node (Nkind (Operand), Loc); Set_Right_Opnd (Opnd, R); if Nkind (Operand) in N_Binary_Op then L := Make_Type_Conversion (Loc, Subtype_Mark => New_Occurrence_Of (Standard_Integer, Loc), Expression => Relocate_Node (Left_Opnd (Operand))); Set_Left_Opnd (Opnd, L); end if; Rewrite (N, Make_Type_Conversion (Loc, Subtype_Mark => Relocate_Node (Subtype_Mark (N)), Expression => Opnd)); Analyze_And_Resolve (N, Target_Type); goto Done; end; end if; -- Do validity check if validity checking operands if Validity_Checks_On and Validity_Check_Operands then Ensure_Valid (Operand); end if; -- Special case of converting from non-standard boolean type if Is_Boolean_Type (Operand_Type) and then (Nonzero_Is_True (Operand_Type)) then Adjust_Condition (Operand); Set_Etype (Operand, Standard_Boolean); Operand_Type := Standard_Boolean; end if; -- Case of converting to an access type if Is_Access_Type (Target_Type) then -- Apply an accessibility check when the conversion operand is an -- access parameter (or a renaming thereof), unless conversion was -- expanded from an Unchecked_ or Unrestricted_Access attribute. -- Note that other checks may still need to be applied below (such -- as tagged type checks). if Is_Entity_Name (Operand) and then Has_Extra_Accessibility (Entity (Operand)) and then Ekind (Etype (Operand)) = E_Anonymous_Access_Type and then (Nkind (Original_Node (N)) /= N_Attribute_Reference or else Attribute_Name (Original_Node (N)) = Name_Access) then Apply_Accessibility_Check (Operand, Target_Type, Insert_Node => Operand); -- If the level of the operand type is statically deeper than the -- level of the target type, then force Program_Error. Note that this -- can only occur for cases where the attribute is within the body of -- an instantiation, otherwise the conversion will already have been -- rejected as illegal. -- Note: warnings are issued by the analyzer for the instance cases elsif In_Instance_Body -- The case where the target type is an anonymous access type of -- a discriminant is excluded, because the level of such a type -- depends on the context and currently the level returned for such -- types is zero, resulting in warnings about about check failures -- in certain legal cases involving class-wide interfaces as the -- designated type (some cases, such as return statements, are -- checked at run time, but not clear if these are handled right -- in general, see 3.10.2(12/2-12.5/3) ???). and then not (Ekind (Target_Type) = E_Anonymous_Access_Type and then Present (Associated_Node_For_Itype (Target_Type)) and then Nkind (Associated_Node_For_Itype (Target_Type)) = N_Discriminant_Specification) and then Type_Access_Level (Operand_Type) > Type_Access_Level (Target_Type) then Raise_Accessibility_Error; goto Done; -- 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. Force Program_Error for this case as well -- (this accessibility violation can only happen if within the body -- of an instantiation). elsif In_Instance_Body and then Ekind (Operand_Type) = E_Anonymous_Access_Type and then Nkind (Operand) = N_Selected_Component and then Object_Access_Level (Operand) > Type_Access_Level (Target_Type) then Raise_Accessibility_Error; goto Done; end if; end if; -- Case of conversions of tagged types and access to tagged types -- When needed, that is to say when the expression is class-wide, Add -- runtime a tag check for (strict) downward conversion by using the -- membership test, generating: -- [constraint_error when Operand not in Target_Type'Class] -- or in the access type case -- [constraint_error -- when Operand /= null -- and then Operand.all not in -- Designated_Type (Target_Type)'Class] if (Is_Access_Type (Target_Type) and then Is_Tagged_Type (Designated_Type (Target_Type))) or else Is_Tagged_Type (Target_Type) then -- Do not do any expansion in the access type case if the parent is a -- renaming, since this is an error situation which will be caught by -- Sem_Ch8, and the expansion can interfere with this error check. if Is_Access_Type (Target_Type) and then Is_Renamed_Object (N) then goto Done; end if; -- Otherwise, proceed with processing tagged conversion Tagged_Conversion : declare Actual_Op_Typ : Entity_Id; Actual_Targ_Typ : Entity_Id; Make_Conversion : Boolean := False; Root_Op_Typ : Entity_Id; procedure Make_Tag_Check (Targ_Typ : Entity_Id); -- Create a membership check to test whether Operand is a member -- of Targ_Typ. If the original Target_Type is an access, include -- a test for null value. The check is inserted at N. -------------------- -- Make_Tag_Check -- -------------------- procedure Make_Tag_Check (Targ_Typ : Entity_Id) is Cond : Node_Id; begin -- Generate: -- [Constraint_Error -- when Operand /= null -- and then Operand.all not in Targ_Typ] if Is_Access_Type (Target_Type) then Cond := Make_And_Then (Loc, Left_Opnd => Make_Op_Ne (Loc, Left_Opnd => Duplicate_Subexpr_No_Checks (Operand), Right_Opnd => Make_Null (Loc)), Right_Opnd => Make_Not_In (Loc, Left_Opnd => Make_Explicit_Dereference (Loc, Prefix => Duplicate_Subexpr_No_Checks (Operand)), Right_Opnd => New_Occurrence_Of (Targ_Typ, Loc))); -- Generate: -- [Constraint_Error when Operand not in Targ_Typ] else Cond := Make_Not_In (Loc, Left_Opnd => Duplicate_Subexpr_No_Checks (Operand), Right_Opnd => New_Occurrence_Of (Targ_Typ, Loc)); end if; Insert_Action (N, Make_Raise_Constraint_Error (Loc, Condition => Cond, Reason => CE_Tag_Check_Failed)); end Make_Tag_Check; -- Start of processing for Tagged_Conversion begin -- Handle entities from the limited view if Is_Access_Type (Operand_Type) then Actual_Op_Typ := Available_View (Designated_Type (Operand_Type)); else Actual_Op_Typ := Operand_Type; end if; if Is_Access_Type (Target_Type) then Actual_Targ_Typ := Available_View (Designated_Type (Target_Type)); else Actual_Targ_Typ := Target_Type; end if; Root_Op_Typ := Root_Type (Actual_Op_Typ); -- Ada 2005 (AI-251): Handle interface type conversion if Is_Interface (Actual_Op_Typ) or else Is_Interface (Actual_Targ_Typ) then Expand_Interface_Conversion (N); goto Done; end if; if not Tag_Checks_Suppressed (Actual_Targ_Typ) then -- Create a runtime tag check for a downward class-wide type -- conversion. if Is_Class_Wide_Type (Actual_Op_Typ) and then Actual_Op_Typ /= Actual_Targ_Typ and then Root_Op_Typ /= Actual_Targ_Typ and then Is_Ancestor (Root_Op_Typ, Actual_Targ_Typ, Use_Full_View => True) then Make_Tag_Check (Class_Wide_Type (Actual_Targ_Typ)); Make_Conversion := True; end if; -- AI05-0073: If the result subtype of the function is defined -- by an access_definition designating a specific tagged type -- T, a check is made that the result value is null or the tag -- of the object designated by the result value identifies T. -- Constraint_Error is raised if this check fails. if Nkind (Parent (N)) = N_Simple_Return_Statement then declare Func : Entity_Id; Func_Typ : Entity_Id; begin -- Climb scope stack looking for the enclosing function Func := Current_Scope; while Present (Func) and then Ekind (Func) /= E_Function loop Func := Scope (Func); end loop; -- The function's return subtype must be defined using -- an access definition. if Nkind (Result_Definition (Parent (Func))) = N_Access_Definition then Func_Typ := Directly_Designated_Type (Etype (Func)); -- The return subtype denotes a specific tagged type, -- in other words, a non class-wide type. if Is_Tagged_Type (Func_Typ) and then not Is_Class_Wide_Type (Func_Typ) then Make_Tag_Check (Actual_Targ_Typ); Make_Conversion := True; end if; end if; end; end if; -- We have generated a tag check for either a class-wide type -- conversion or for AI05-0073. if Make_Conversion then declare Conv : Node_Id; begin Conv := Make_Unchecked_Type_Conversion (Loc, Subtype_Mark => New_Occurrence_Of (Target_Type, Loc), Expression => Relocate_Node (Expression (N))); Rewrite (N, Conv); Analyze_And_Resolve (N, Target_Type); end; end if; end if; end Tagged_Conversion; -- Case of other access type conversions elsif Is_Access_Type (Target_Type) then Apply_Constraint_Check (Operand, Target_Type); -- Case of conversions from a fixed-point type -- These conversions require special expansion and processing, found in -- the Exp_Fixd package. We ignore cases where Conversion_OK is set, -- since from a semantic point of view, these are simple integer -- conversions, which do not need further processing. elsif Is_Fixed_Point_Type (Operand_Type) and then not Conversion_OK (N) then -- We should never see universal fixed at this case, since the -- expansion of the constituent divide or multiply should have -- eliminated the explicit mention of universal fixed. pragma Assert (Operand_Type /= Universal_Fixed); -- Check for special case of the conversion to universal real that -- occurs as a result of the use of a round attribute. In this case, -- the real type for the conversion is taken from the target type of -- the Round attribute and the result must be marked as rounded. if Target_Type = Universal_Real and then Nkind (Parent (N)) = N_Attribute_Reference and then Attribute_Name (Parent (N)) = Name_Round then Set_Rounded_Result (N); Set_Etype (N, Etype (Parent (N))); end if; -- Otherwise do correct fixed-conversion, but skip these if the -- Conversion_OK flag is set, because from a semantic point of view -- these are simple integer conversions needing no further processing -- (the backend will simply treat them as integers). if not Conversion_OK (N) then if Is_Fixed_Point_Type (Etype (N)) then Expand_Convert_Fixed_To_Fixed (N); Real_Range_Check; elsif Is_Integer_Type (Etype (N)) then Expand_Convert_Fixed_To_Integer (N); else pragma Assert (Is_Floating_Point_Type (Etype (N))); Expand_Convert_Fixed_To_Float (N); Real_Range_Check; end if; end if; -- Case of conversions to a fixed-point type -- These conversions require special expansion and processing, found in -- the Exp_Fixd package. Again, ignore cases where Conversion_OK is set, -- since from a semantic point of view, these are simple integer -- conversions, which do not need further processing. elsif Is_Fixed_Point_Type (Target_Type) and then not Conversion_OK (N) then if Is_Integer_Type (Operand_Type) then Expand_Convert_Integer_To_Fixed (N); Real_Range_Check; else pragma Assert (Is_Floating_Point_Type (Operand_Type)); Expand_Convert_Float_To_Fixed (N); Real_Range_Check; end if; -- Case of float-to-integer conversions -- We also handle float-to-fixed conversions with Conversion_OK set -- since semantically the fixed-point target is treated as though it -- were an integer in such cases. elsif Is_Floating_Point_Type (Operand_Type) and then (Is_Integer_Type (Target_Type) or else (Is_Fixed_Point_Type (Target_Type) and then Conversion_OK (N))) then -- One more check here, gcc is still not able to do conversions of -- this type with proper overflow checking, and so gigi is doing an -- approximation of what is required by doing floating-point compares -- with the end-point. But that can lose precision in some cases, and -- give a wrong result. Converting the operand to Universal_Real is -- helpful, but still does not catch all cases with 64-bit integers -- on targets with only 64-bit floats. -- The above comment seems obsoleted by Apply_Float_Conversion_Check -- Can this code be removed ??? if Do_Range_Check (Operand) then Rewrite (Operand, Make_Type_Conversion (Loc, Subtype_Mark => New_Occurrence_Of (Universal_Real, Loc), Expression => Relocate_Node (Operand))); Set_Etype (Operand, Universal_Real); Enable_Range_Check (Operand); Set_Do_Range_Check (Expression (Operand), False); end if; -- Case of array conversions -- Expansion of array conversions, add required length/range checks but -- only do this if there is no change of representation. For handling of -- this case, see Handle_Changed_Representation. elsif Is_Array_Type (Target_Type) then if Is_Constrained (Target_Type) then Apply_Length_Check (Operand, Target_Type); else Apply_Range_Check (Operand, Target_Type); end if; Handle_Changed_Representation; -- Case of conversions of discriminated types -- Add required discriminant checks if target is constrained. Again this -- change is skipped if we have a change of representation. elsif Has_Discriminants (Target_Type) and then Is_Constrained (Target_Type) then Apply_Discriminant_Check (Operand, Target_Type); Handle_Changed_Representation; -- Case of all other record conversions. The only processing required -- is to check for a change of representation requiring the special -- assignment processing. elsif Is_Record_Type (Target_Type) then -- Ada 2005 (AI-216): Program_Error is raised when converting from -- a derived Unchecked_Union type to an unconstrained type that is -- not Unchecked_Union if the operand lacks inferable discriminants. if Is_Derived_Type (Operand_Type) and then Is_Unchecked_Union (Base_Type (Operand_Type)) and then not Is_Constrained (Target_Type) and then not Is_Unchecked_Union (Base_Type (Target_Type)) and then not Has_Inferable_Discriminants (Operand) then -- To prevent Gigi from generating illegal code, we generate a -- Program_Error node, but we give it the target type of the -- conversion (is this requirement documented somewhere ???) declare PE : constant Node_Id := Make_Raise_Program_Error (Loc, Reason => PE_Unchecked_Union_Restriction); begin Set_Etype (PE, Target_Type); Rewrite (N, PE); end; else Handle_Changed_Representation; end if; -- Case of conversions of enumeration types elsif Is_Enumeration_Type (Target_Type) then -- Special processing is required if there is a change of -- representation (from enumeration representation clauses). if not Same_Representation (Target_Type, Operand_Type) then -- Convert: x(y) to x'val (ytyp'val (y)) Rewrite (N, Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Target_Type, Loc), Attribute_Name => Name_Val, Expressions => New_List ( Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Operand_Type, Loc), Attribute_Name => Name_Pos, Expressions => New_List (Operand))))); Analyze_And_Resolve (N, Target_Type); end if; -- Case of conversions to floating-point elsif Is_Floating_Point_Type (Target_Type) then Real_Range_Check; end if; -- At this stage, either the conversion node has been transformed into -- some other equivalent expression, or left as a conversion that can be -- handled by Gigi, in the following cases: -- Conversions with no change of representation or type -- Numeric conversions involving integer, floating- and fixed-point -- values. Fixed-point values are allowed only if Conversion_OK is -- set, i.e. if the fixed-point values are to be treated as integers. -- No other conversions should be passed to Gigi -- Check: are these rules stated in sinfo??? if so, why restate here??? -- The only remaining step is to generate a range check if we still have -- a type conversion at this stage and Do_Range_Check is set. For now we -- do this only for conversions of discrete types and for float-to-float -- conversions. if Nkind (N) = N_Type_Conversion then -- For now we only support floating-point cases where both source -- and target are floating-point types. Conversions where the source -- and target involve integer or fixed-point types are still TBD, -- though not clear whether those can even happen at this point, due -- to transformations above. ??? if Is_Floating_Point_Type (Etype (N)) and then Is_Floating_Point_Type (Etype (Expression (N))) then if Do_Range_Check (Expression (N)) and then Is_Floating_Point_Type (Target_Type) then Generate_Range_Check (Expression (N), Target_Type, CE_Range_Check_Failed); end if; -- Discrete-to-discrete conversions elsif Is_Discrete_Type (Etype (N)) then declare Expr : constant Node_Id := Expression (N); Ftyp : Entity_Id; Ityp : Entity_Id; begin if Do_Range_Check (Expr) and then Is_Discrete_Type (Etype (Expr)) then Set_Do_Range_Check (Expr, False); -- Before we do a range check, we have to deal with treating -- a fixed-point operand as an integer. The way we do this -- is simply to do an unchecked conversion to an appropriate -- integer type large enough to hold the result. -- This code is not active yet, because we are only dealing -- with discrete types so far ??? if Nkind (Expr) in N_Has_Treat_Fixed_As_Integer and then Treat_Fixed_As_Integer (Expr) then Ftyp := Base_Type (Etype (Expr)); if Esize (Ftyp) >= Esize (Standard_Integer) then Ityp := Standard_Long_Long_Integer; else Ityp := Standard_Integer; end if; Rewrite (Expr, Unchecked_Convert_To (Ityp, Expr)); end if; -- Reset overflow flag, since the range check will include -- dealing with possible overflow, and generate the check. -- If Address is either a source type or target type, -- suppress range check to avoid typing anomalies when -- it is a visible integer type. Set_Do_Overflow_Check (N, False); if not Is_Descendant_Of_Address (Etype (Expr)) and then not Is_Descendant_Of_Address (Target_Type) then Generate_Range_Check (Expr, Target_Type, CE_Range_Check_Failed); end if; end if; end; end if; end if; -- Here at end of processing <<Done>> -- Apply predicate check if required. Note that we can't just call -- Apply_Predicate_Check here, because the type looks right after -- the conversion and it would omit the check. The Comes_From_Source -- guard is necessary to prevent infinite recursions when we generate -- internal conversions for the purpose of checking predicates. if Present (Predicate_Function (Target_Type)) and then not Predicates_Ignored (Target_Type) and then Target_Type /= Operand_Type and then Comes_From_Source (N) then declare New_Expr : constant Node_Id := Duplicate_Subexpr (N); begin -- Avoid infinite recursion on the subsequent expansion of -- of the copy of the original type conversion. Set_Comes_From_Source (New_Expr, False); Insert_Action (N, Make_Predicate_Check (Target_Type, New_Expr)); end; end if; end Expand_N_Type_Conversion; ----------------------------------- -- Expand_N_Unchecked_Expression -- ----------------------------------- -- Remove the unchecked expression node from the tree. Its job was simply -- to make sure that its constituent expression was handled with checks -- off, and now that that is done, we can remove it from the tree, and -- indeed must, since Gigi does not expect to see these nodes. procedure Expand_N_Unchecked_Expression (N : Node_Id) is Exp : constant Node_Id := Expression (N); begin Set_Assignment_OK (Exp, Assignment_OK (N) or else Assignment_OK (Exp)); Rewrite (N, Exp); end Expand_N_Unchecked_Expression; ---------------------------------------- -- Expand_N_Unchecked_Type_Conversion -- ---------------------------------------- -- If this cannot be handled by Gigi and we haven't already made a -- temporary for it, do it now. procedure Expand_N_Unchecked_Type_Conversion (N : Node_Id) is Target_Type : constant Entity_Id := Etype (N); Operand : constant Node_Id := Expression (N); Operand_Type : constant Entity_Id := Etype (Operand); begin -- Nothing at all to do if conversion is to the identical type so remove -- the conversion completely, it is useless, except that it may carry -- an Assignment_OK indication which must be propagated to the operand. if Operand_Type = Target_Type then -- Code duplicates Expand_N_Unchecked_Expression above, factor??? if Assignment_OK (N) then Set_Assignment_OK (Operand); end if; Rewrite (N, Relocate_Node (Operand)); return; end if; -- If we have a conversion of a compile time known value to a target -- type and the value is in range of the target type, then we can simply -- replace the construct by an integer literal of the correct type. We -- only apply this to integer types being converted. Possibly it may -- apply in other cases, but it is too much trouble to worry about. -- Note that we do not do this transformation if the Kill_Range_Check -- flag is set, since then the value may be outside the expected range. -- This happens in the Normalize_Scalars case. -- We also skip this if either the target or operand type is biased -- because in this case, the unchecked conversion is supposed to -- preserve the bit pattern, not the integer value. if Is_Integer_Type (Target_Type) and then not Has_Biased_Representation (Target_Type) and then Is_Integer_Type (Operand_Type) and then not Has_Biased_Representation (Operand_Type) and then Compile_Time_Known_Value (Operand) and then not Kill_Range_Check (N) then declare Val : constant Uint := Expr_Value (Operand); begin if Compile_Time_Known_Value (Type_Low_Bound (Target_Type)) and then Compile_Time_Known_Value (Type_High_Bound (Target_Type)) and then Val >= Expr_Value (Type_Low_Bound (Target_Type)) and then Val <= Expr_Value (Type_High_Bound (Target_Type)) then Rewrite (N, Make_Integer_Literal (Sloc (N), Val)); -- If Address is the target type, just set the type to avoid a -- spurious type error on the literal when Address is a visible -- integer type. if Is_Descendant_Of_Address (Target_Type) then Set_Etype (N, Target_Type); else Analyze_And_Resolve (N, Target_Type); end if; return; end if; end; end if; -- Nothing to do if conversion is safe if Safe_Unchecked_Type_Conversion (N) then return; end if; -- Otherwise force evaluation unless Assignment_OK flag is set (this -- flag indicates ??? More comments needed here) if Assignment_OK (N) then null; else Force_Evaluation (N); end if; end Expand_N_Unchecked_Type_Conversion; ---------------------------- -- Expand_Record_Equality -- ---------------------------- -- For non-variant records, Equality is expanded when needed into: -- and then Lhs.Discr1 = Rhs.Discr1 -- and then ... -- and then Lhs.Discrn = Rhs.Discrn -- and then Lhs.Cmp1 = Rhs.Cmp1 -- and then ... -- and then Lhs.Cmpn = Rhs.Cmpn -- The expression is folded by the back-end for adjacent fields. This -- function is called for tagged record in only one occasion: for imple- -- menting predefined primitive equality (see Predefined_Primitives_Bodies) -- otherwise the primitive "=" is used directly. function Expand_Record_Equality (Nod : Node_Id; Typ : Entity_Id; Lhs : Node_Id; Rhs : Node_Id; Bodies : List_Id) return Node_Id is Loc : constant Source_Ptr := Sloc (Nod); Result : Node_Id; C : Entity_Id; First_Time : Boolean := True; function Element_To_Compare (C : Entity_Id) return Entity_Id; -- Return the next discriminant or component to compare, starting with -- C, skipping inherited components. ------------------------ -- Element_To_Compare -- ------------------------ function Element_To_Compare (C : Entity_Id) return Entity_Id is Comp : Entity_Id; begin Comp := C; loop -- Exit loop when the next element to be compared is found, or -- there is no more such element. exit when No (Comp); exit when Ekind_In (Comp, E_Discriminant, E_Component) and then not ( -- Skip inherited components -- Note: for a tagged type, we always generate the "=" primitive -- for the base type (not on the first subtype), so the test for -- Comp /= Original_Record_Component (Comp) is True for -- inherited components only. (Is_Tagged_Type (Typ) and then Comp /= Original_Record_Component (Comp)) -- Skip _Tag or else Chars (Comp) = Name_uTag -- Skip interface elements (secondary tags???) or else Is_Interface (Etype (Comp))); Next_Entity (Comp); end loop; return Comp; end Element_To_Compare; -- Start of processing for Expand_Record_Equality begin -- Generates the following code: (assuming that Typ has one Discr and -- component C2 is also a record) -- True -- and then Lhs.Discr1 = Rhs.Discr1 -- and then Lhs.C1 = Rhs.C1 -- and then Lhs.C2.C1=Rhs.C2.C1 and then ... Lhs.C2.Cn=Rhs.C2.Cn -- and then ... -- and then Lhs.Cmpn = Rhs.Cmpn Result := New_Occurrence_Of (Standard_True, Loc); C := Element_To_Compare (First_Entity (Typ)); while Present (C) loop declare New_Lhs : Node_Id; New_Rhs : Node_Id; Check : Node_Id; begin if First_Time then First_Time := False; New_Lhs := Lhs; New_Rhs := Rhs; else New_Lhs := New_Copy_Tree (Lhs); New_Rhs := New_Copy_Tree (Rhs); end if; Check := Expand_Composite_Equality (Nod, Etype (C), Lhs => Make_Selected_Component (Loc, Prefix => New_Lhs, Selector_Name => New_Occurrence_Of (C, Loc)), Rhs => Make_Selected_Component (Loc, Prefix => New_Rhs, Selector_Name => New_Occurrence_Of (C, Loc)), Bodies => Bodies); -- If some (sub)component is an unchecked_union, the whole -- operation will raise program error. if Nkind (Check) = N_Raise_Program_Error then Result := Check; Set_Etype (Result, Standard_Boolean); exit; else Result := Make_And_Then (Loc, Left_Opnd => Result, Right_Opnd => Check); end if; end; C := Element_To_Compare (Next_Entity (C)); end loop; return Result; end Expand_Record_Equality; --------------------------- -- Expand_Set_Membership -- --------------------------- procedure Expand_Set_Membership (N : Node_Id) is Lop : constant Node_Id := Left_Opnd (N); Alt : Node_Id; Res : Node_Id; function Make_Cond (Alt : Node_Id) return Node_Id; -- If the alternative is a subtype mark, create a simple membership -- test. Otherwise create an equality test for it. --------------- -- Make_Cond -- --------------- function Make_Cond (Alt : Node_Id) return Node_Id is Cond : Node_Id; L : constant Node_Id := New_Copy (Lop); R : constant Node_Id := Relocate_Node (Alt); begin if (Is_Entity_Name (Alt) and then Is_Type (Entity (Alt))) or else Nkind (Alt) = N_Range then Cond := Make_In (Sloc (Alt), Left_Opnd => L, Right_Opnd => R); else Cond := Make_Op_Eq (Sloc (Alt), Left_Opnd => L, Right_Opnd => R); end if; return Cond; end Make_Cond; -- Start of processing for Expand_Set_Membership begin Remove_Side_Effects (Lop); Alt := Last (Alternatives (N)); Res := Make_Cond (Alt); Prev (Alt); while Present (Alt) loop Res := Make_Or_Else (Sloc (Alt), Left_Opnd => Make_Cond (Alt), Right_Opnd => Res); Prev (Alt); end loop; Rewrite (N, Res); Analyze_And_Resolve (N, Standard_Boolean); end Expand_Set_Membership; ----------------------------------- -- Expand_Short_Circuit_Operator -- ----------------------------------- -- Deal with special expansion if actions are present for the right operand -- and deal with optimizing case of arguments being True or False. We also -- deal with the special case of non-standard boolean values. procedure Expand_Short_Circuit_Operator (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Typ : constant Entity_Id := Etype (N); Left : constant Node_Id := Left_Opnd (N); Right : constant Node_Id := Right_Opnd (N); LocR : constant Source_Ptr := Sloc (Right); Actlist : List_Id; Shortcut_Value : constant Boolean := Nkind (N) = N_Or_Else; Shortcut_Ent : constant Entity_Id := Boolean_Literals (Shortcut_Value); -- If Left = Shortcut_Value then Right need not be evaluated function Make_Test_Expr (Opnd : Node_Id) return Node_Id; -- For Opnd a boolean expression, return a Boolean expression equivalent -- to Opnd /= Shortcut_Value. -------------------- -- Make_Test_Expr -- -------------------- function Make_Test_Expr (Opnd : Node_Id) return Node_Id is begin if Shortcut_Value then return Make_Op_Not (Sloc (Opnd), Opnd); else return Opnd; end if; end Make_Test_Expr; -- Local variables Op_Var : Entity_Id; -- Entity for a temporary variable holding the value of the operator, -- used for expansion in the case where actions are present. -- Start of processing for Expand_Short_Circuit_Operator begin -- Deal with non-standard booleans if Is_Boolean_Type (Typ) then Adjust_Condition (Left); Adjust_Condition (Right); Set_Etype (N, Standard_Boolean); end if; -- Check for cases where left argument is known to be True or False if Compile_Time_Known_Value (Left) then -- Mark SCO for left condition as compile time known if Generate_SCO and then Comes_From_Source (Left) then Set_SCO_Condition (Left, Expr_Value_E (Left) = Standard_True); end if; -- Rewrite True AND THEN Right / False OR ELSE Right to Right. -- Any actions associated with Right will be executed unconditionally -- and can thus be inserted into the tree unconditionally. if Expr_Value_E (Left) /= Shortcut_Ent then if Present (Actions (N)) then Insert_Actions (N, Actions (N)); end if; Rewrite (N, Right); -- Rewrite False AND THEN Right / True OR ELSE Right to Left. -- In this case we can forget the actions associated with Right, -- since they will never be executed. else Kill_Dead_Code (Right); Kill_Dead_Code (Actions (N)); Rewrite (N, New_Occurrence_Of (Shortcut_Ent, Loc)); end if; Adjust_Result_Type (N, Typ); return; end if; -- If Actions are present for the right operand, we have to do some -- special processing. We can't just let these actions filter back into -- code preceding the short circuit (which is what would have happened -- if we had not trapped them in the short-circuit form), since they -- must only be executed if the right operand of the short circuit is -- executed and not otherwise. if Present (Actions (N)) then Actlist := Actions (N); -- The old approach is to expand: -- left AND THEN right -- into -- C : Boolean := False; -- IF left THEN -- Actions; -- IF right THEN -- C := True; -- END IF; -- END IF; -- and finally rewrite the operator into a reference to C. Similarly -- for left OR ELSE right, with negated values. Note that this -- rewrite causes some difficulties for coverage analysis because -- of the introduction of the new variable C, which obscures the -- structure of the test. -- We use this "old approach" if Minimize_Expression_With_Actions -- is True. if Minimize_Expression_With_Actions then Op_Var := Make_Temporary (Loc, 'C', Related_Node => N); Insert_Action (N, Make_Object_Declaration (Loc, Defining_Identifier => Op_Var, Object_Definition => New_Occurrence_Of (Standard_Boolean, Loc), Expression => New_Occurrence_Of (Shortcut_Ent, Loc))); Append_To (Actlist, Make_Implicit_If_Statement (Right, Condition => Make_Test_Expr (Right), Then_Statements => New_List ( Make_Assignment_Statement (LocR, Name => New_Occurrence_Of (Op_Var, LocR), Expression => New_Occurrence_Of (Boolean_Literals (not Shortcut_Value), LocR))))); Insert_Action (N, Make_Implicit_If_Statement (Left, Condition => Make_Test_Expr (Left), Then_Statements => Actlist)); Rewrite (N, New_Occurrence_Of (Op_Var, Loc)); Analyze_And_Resolve (N, Standard_Boolean); -- The new approach (the default) is to use an -- Expression_With_Actions node for the right operand of the -- short-circuit form. Note that this solves the traceability -- problems for coverage analysis. else Rewrite (Right, Make_Expression_With_Actions (LocR, Expression => Relocate_Node (Right), Actions => Actlist)); Set_Actions (N, No_List); Analyze_And_Resolve (Right, Standard_Boolean); end if; Adjust_Result_Type (N, Typ); return; end if; -- No actions present, check for cases of right argument True/False if Compile_Time_Known_Value (Right) then -- Mark SCO for left condition as compile time known if Generate_SCO and then Comes_From_Source (Right) then Set_SCO_Condition (Right, Expr_Value_E (Right) = Standard_True); end if; -- Change (Left and then True), (Left or else False) to Left. Note -- that we know there are no actions associated with the right -- operand, since we just checked for this case above. if Expr_Value_E (Right) /= Shortcut_Ent then Rewrite (N, Left); -- Change (Left and then False), (Left or else True) to Right, -- making sure to preserve any side effects associated with the Left -- operand. else Remove_Side_Effects (Left); Rewrite (N, New_Occurrence_Of (Shortcut_Ent, Loc)); end if; end if; Adjust_Result_Type (N, Typ); end Expand_Short_Circuit_Operator; ------------------------------------- -- Fixup_Universal_Fixed_Operation -- ------------------------------------- procedure Fixup_Universal_Fixed_Operation (N : Node_Id) is Conv : constant Node_Id := Parent (N); begin -- We must have a type conversion immediately above us pragma Assert (Nkind (Conv) = N_Type_Conversion); -- Normally the type conversion gives our target type. The exception -- occurs in the case of the Round attribute, where the conversion -- will be to universal real, and our real type comes from the Round -- attribute (as well as an indication that we must round the result) if Nkind (Parent (Conv)) = N_Attribute_Reference and then Attribute_Name (Parent (Conv)) = Name_Round then Set_Etype (N, Etype (Parent (Conv))); Set_Rounded_Result (N); -- Normal case where type comes from conversion above us else Set_Etype (N, Etype (Conv)); end if; end Fixup_Universal_Fixed_Operation; --------------------------------- -- Has_Inferable_Discriminants -- --------------------------------- function Has_Inferable_Discriminants (N : Node_Id) return Boolean is function Prefix_Is_Formal_Parameter (N : Node_Id) return Boolean; -- Determines whether the left-most prefix of a selected component is a -- formal parameter in a subprogram. Assumes N is a selected component. -------------------------------- -- Prefix_Is_Formal_Parameter -- -------------------------------- function Prefix_Is_Formal_Parameter (N : Node_Id) return Boolean is Sel_Comp : Node_Id; begin -- Move to the left-most prefix by climbing up the tree Sel_Comp := N; while Present (Parent (Sel_Comp)) and then Nkind (Parent (Sel_Comp)) = N_Selected_Component loop Sel_Comp := Parent (Sel_Comp); end loop; return Ekind (Entity (Prefix (Sel_Comp))) in Formal_Kind; end Prefix_Is_Formal_Parameter; -- Start of processing for Has_Inferable_Discriminants begin -- For selected components, the subtype of the selector must be a -- constrained Unchecked_Union. If the component is subject to a -- per-object constraint, then the enclosing object must have inferable -- discriminants. if Nkind (N) = N_Selected_Component then if Has_Per_Object_Constraint (Entity (Selector_Name (N))) then -- A small hack. If we have a per-object constrained selected -- component of a formal parameter, return True since we do not -- know the actual parameter association yet. if Prefix_Is_Formal_Parameter (N) then return True; -- Otherwise, check the enclosing object and the selector else return Has_Inferable_Discriminants (Prefix (N)) and then Has_Inferable_Discriminants (Selector_Name (N)); end if; -- The call to Has_Inferable_Discriminants will determine whether -- the selector has a constrained Unchecked_Union nominal type. else return Has_Inferable_Discriminants (Selector_Name (N)); end if; -- A qualified expression has inferable discriminants if its subtype -- mark is a constrained Unchecked_Union subtype. elsif Nkind (N) = N_Qualified_Expression then return Is_Unchecked_Union (Etype (Subtype_Mark (N))) and then Is_Constrained (Etype (Subtype_Mark (N))); -- For all other names, it is sufficient to have a constrained -- Unchecked_Union nominal subtype. else return Is_Unchecked_Union (Base_Type (Etype (N))) and then Is_Constrained (Etype (N)); end if; end Has_Inferable_Discriminants; ------------------------------- -- Insert_Dereference_Action -- ------------------------------- procedure Insert_Dereference_Action (N : Node_Id) is function Is_Checked_Storage_Pool (P : Entity_Id) return Boolean; -- Return true if type of P is derived from Checked_Pool; ----------------------------- -- Is_Checked_Storage_Pool -- ----------------------------- function Is_Checked_Storage_Pool (P : Entity_Id) return Boolean is T : Entity_Id; begin if No (P) then return False; end if; T := Etype (P); while T /= Etype (T) loop if Is_RTE (T, RE_Checked_Pool) then return True; else T := Etype (T); end if; end loop; return False; end Is_Checked_Storage_Pool; -- Local variables Typ : constant Entity_Id := Etype (N); Desig : constant Entity_Id := Available_View (Designated_Type (Typ)); Loc : constant Source_Ptr := Sloc (N); Pool : constant Entity_Id := Associated_Storage_Pool (Typ); Pnod : constant Node_Id := Parent (N); Addr : Entity_Id; Alig : Entity_Id; Deref : Node_Id; Size : Entity_Id; Size_Bits : Node_Id; Stmt : Node_Id; -- Start of processing for Insert_Dereference_Action begin pragma Assert (Nkind (Pnod) = N_Explicit_Dereference); -- Do not re-expand a dereference which has already been processed by -- this routine. if Has_Dereference_Action (Pnod) then return; -- Do not perform this type of expansion for internally-generated -- dereferences. elsif not Comes_From_Source (Original_Node (Pnod)) then return; -- A dereference action is only applicable to objects which have been -- allocated on a checked pool. elsif not Is_Checked_Storage_Pool (Pool) then return; end if; -- Extract the address of the dereferenced object. Generate: -- Addr : System.Address := <N>'Pool_Address; Addr := Make_Temporary (Loc, 'P'); Insert_Action (N, Make_Object_Declaration (Loc, Defining_Identifier => Addr, Object_Definition => New_Occurrence_Of (RTE (RE_Address), Loc), Expression => Make_Attribute_Reference (Loc, Prefix => Duplicate_Subexpr_Move_Checks (N), Attribute_Name => Name_Pool_Address))); -- Calculate the size of the dereferenced object. Generate: -- Size : Storage_Count := <N>.all'Size / Storage_Unit; Deref := Make_Explicit_Dereference (Loc, Prefix => Duplicate_Subexpr_Move_Checks (N)); Set_Has_Dereference_Action (Deref); Size_Bits := Make_Attribute_Reference (Loc, Prefix => Deref, Attribute_Name => Name_Size); -- Special case of an unconstrained array: need to add descriptor size if Is_Array_Type (Desig) and then not Is_Constrained (First_Subtype (Desig)) then Size_Bits := Make_Op_Add (Loc, Left_Opnd => Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (First_Subtype (Desig), Loc), Attribute_Name => Name_Descriptor_Size), Right_Opnd => Size_Bits); end if; Size := Make_Temporary (Loc, 'S'); Insert_Action (N, Make_Object_Declaration (Loc, Defining_Identifier => Size, Object_Definition => New_Occurrence_Of (RTE (RE_Storage_Count), Loc), Expression => Make_Op_Divide (Loc, Left_Opnd => Size_Bits, Right_Opnd => Make_Integer_Literal (Loc, System_Storage_Unit)))); -- Calculate the alignment of the dereferenced object. Generate: -- Alig : constant Storage_Count := <N>.all'Alignment; Deref := Make_Explicit_Dereference (Loc, Prefix => Duplicate_Subexpr_Move_Checks (N)); Set_Has_Dereference_Action (Deref); Alig := Make_Temporary (Loc, 'A'); Insert_Action (N, Make_Object_Declaration (Loc, Defining_Identifier => Alig, Object_Definition => New_Occurrence_Of (RTE (RE_Storage_Count), Loc), Expression => Make_Attribute_Reference (Loc, Prefix => Deref, Attribute_Name => Name_Alignment))); -- A dereference of a controlled object requires special processing. The -- finalization machinery requests additional space from the underlying -- pool to allocate and hide two pointers. As a result, a checked pool -- may mark the wrong memory as valid. Since checked pools do not have -- knowledge of hidden pointers, we have to bring the two pointers back -- in view in order to restore the original state of the object. if Needs_Finalization (Desig) then -- Adjust the address and size of the dereferenced object. Generate: -- Adjust_Controlled_Dereference (Addr, Size, Alig); Stmt := Make_Procedure_Call_Statement (Loc, Name => New_Occurrence_Of (RTE (RE_Adjust_Controlled_Dereference), Loc), Parameter_Associations => New_List ( New_Occurrence_Of (Addr, Loc), New_Occurrence_Of (Size, Loc), New_Occurrence_Of (Alig, Loc))); -- Class-wide types complicate things because we cannot determine -- statically whether the actual object is truly controlled. We must -- generate a runtime check to detect this property. Generate: -- -- if Needs_Finalization (<N>.all'Tag) then -- <Stmt>; -- end if; if Is_Class_Wide_Type (Desig) then Deref := Make_Explicit_Dereference (Loc, Prefix => Duplicate_Subexpr_Move_Checks (N)); Set_Has_Dereference_Action (Deref); Stmt := Make_Implicit_If_Statement (N, Condition => Make_Function_Call (Loc, Name => New_Occurrence_Of (RTE (RE_Needs_Finalization), Loc), Parameter_Associations => New_List ( Make_Attribute_Reference (Loc, Prefix => Deref, Attribute_Name => Name_Tag))), Then_Statements => New_List (Stmt)); end if; Insert_Action (N, Stmt); end if; -- Generate: -- Dereference (Pool, Addr, Size, Alig); Insert_Action (N, Make_Procedure_Call_Statement (Loc, Name => New_Occurrence_Of (Find_Prim_Op (Etype (Pool), Name_Dereference), Loc), Parameter_Associations => New_List ( New_Occurrence_Of (Pool, Loc), New_Occurrence_Of (Addr, Loc), New_Occurrence_Of (Size, Loc), New_Occurrence_Of (Alig, Loc)))); -- Mark the explicit dereference as processed to avoid potential -- infinite expansion. Set_Has_Dereference_Action (Pnod); exception when RE_Not_Available => return; end Insert_Dereference_Action; -------------------------------- -- Integer_Promotion_Possible -- -------------------------------- function Integer_Promotion_Possible (N : Node_Id) return Boolean is Operand : constant Node_Id := Expression (N); Operand_Type : constant Entity_Id := Etype (Operand); Root_Operand_Type : constant Entity_Id := Root_Type (Operand_Type); begin pragma Assert (Nkind (N) = N_Type_Conversion); return -- We only do the transformation for source constructs. We assume -- that the expander knows what it is doing when it generates code. Comes_From_Source (N) -- If the operand type is Short_Integer or Short_Short_Integer, -- then we will promote to Integer, which is available on all -- targets, and is sufficient to ensure no intermediate overflow. -- Furthermore it is likely to be as efficient or more efficient -- than using the smaller type for the computation so we do this -- unconditionally. and then (Root_Operand_Type = Base_Type (Standard_Short_Integer) or else Root_Operand_Type = Base_Type (Standard_Short_Short_Integer)) -- Test for interesting operation, which includes addition, -- division, exponentiation, multiplication, subtraction, absolute -- value and unary negation. Unary "+" is omitted since it is a -- no-op and thus can't overflow. and then Nkind_In (Operand, N_Op_Abs, N_Op_Add, N_Op_Divide, N_Op_Expon, N_Op_Minus, N_Op_Multiply, N_Op_Subtract); end Integer_Promotion_Possible; ------------------------------ -- Make_Array_Comparison_Op -- ------------------------------ -- This is a hand-coded expansion of the following generic function: -- generic -- type elem is (<>); -- type index is (<>); -- type a is array (index range <>) of elem; -- function Gnnn (X : a; Y: a) return boolean is -- J : index := Y'first; -- begin -- if X'length = 0 then -- return false; -- elsif Y'length = 0 then -- return true; -- else -- for I in X'range loop -- if X (I) = Y (J) then -- if J = Y'last then -- exit; -- else -- J := index'succ (J); -- end if; -- else -- return X (I) > Y (J); -- end if; -- end loop; -- return X'length > Y'length; -- end if; -- end Gnnn; -- Note that since we are essentially doing this expansion by hand, we -- do not need to generate an actual or formal generic part, just the -- instantiated function itself. -- Perhaps we could have the actual generic available in the run-time, -- obtained by rtsfind, and actually expand a real instantiation ??? function Make_Array_Comparison_Op (Typ : Entity_Id; Nod : Node_Id) return Node_Id is Loc : constant Source_Ptr := Sloc (Nod); X : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uX); Y : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uY); I : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uI); J : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uJ); Index : constant Entity_Id := Base_Type (Etype (First_Index (Typ))); Loop_Statement : Node_Id; Loop_Body : Node_Id; If_Stat : Node_Id; Inner_If : Node_Id; Final_Expr : Node_Id; Func_Body : Node_Id; Func_Name : Entity_Id; Formals : List_Id; Length1 : Node_Id; Length2 : Node_Id; begin -- if J = Y'last then -- exit; -- else -- J := index'succ (J); -- end if; Inner_If := Make_Implicit_If_Statement (Nod, Condition => Make_Op_Eq (Loc, Left_Opnd => New_Occurrence_Of (J, Loc), Right_Opnd => Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Y, Loc), Attribute_Name => Name_Last)), Then_Statements => New_List ( Make_Exit_Statement (Loc)), Else_Statements => New_List ( Make_Assignment_Statement (Loc, Name => New_Occurrence_Of (J, Loc), Expression => Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Index, Loc), Attribute_Name => Name_Succ, Expressions => New_List (New_Occurrence_Of (J, Loc)))))); -- if X (I) = Y (J) then -- if ... end if; -- else -- return X (I) > Y (J); -- end if; Loop_Body := Make_Implicit_If_Statement (Nod, Condition => Make_Op_Eq (Loc, Left_Opnd => Make_Indexed_Component (Loc, Prefix => New_Occurrence_Of (X, Loc), Expressions => New_List (New_Occurrence_Of (I, Loc))), Right_Opnd => Make_Indexed_Component (Loc, Prefix => New_Occurrence_Of (Y, Loc), Expressions => New_List (New_Occurrence_Of (J, Loc)))), Then_Statements => New_List (Inner_If), Else_Statements => New_List ( Make_Simple_Return_Statement (Loc, Expression => Make_Op_Gt (Loc, Left_Opnd => Make_Indexed_Component (Loc, Prefix => New_Occurrence_Of (X, Loc), Expressions => New_List (New_Occurrence_Of (I, Loc))), Right_Opnd => Make_Indexed_Component (Loc, Prefix => New_Occurrence_Of (Y, Loc), Expressions => New_List ( New_Occurrence_Of (J, Loc))))))); -- for I in X'range loop -- if ... end if; -- end loop; Loop_Statement := Make_Implicit_Loop_Statement (Nod, Identifier => Empty, Iteration_Scheme => Make_Iteration_Scheme (Loc, Loop_Parameter_Specification => Make_Loop_Parameter_Specification (Loc, Defining_Identifier => I, Discrete_Subtype_Definition => Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (X, Loc), Attribute_Name => Name_Range))), Statements => New_List (Loop_Body)); -- if X'length = 0 then -- return false; -- elsif Y'length = 0 then -- return true; -- else -- for ... loop ... end loop; -- return X'length > Y'length; -- end if; Length1 := Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (X, Loc), Attribute_Name => Name_Length); Length2 := Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Y, Loc), Attribute_Name => Name_Length); Final_Expr := Make_Op_Gt (Loc, Left_Opnd => Length1, Right_Opnd => Length2); If_Stat := Make_Implicit_If_Statement (Nod, Condition => Make_Op_Eq (Loc, Left_Opnd => Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (X, Loc), Attribute_Name => Name_Length), Right_Opnd => Make_Integer_Literal (Loc, 0)), Then_Statements => New_List ( Make_Simple_Return_Statement (Loc, Expression => New_Occurrence_Of (Standard_False, Loc))), Elsif_Parts => New_List ( Make_Elsif_Part (Loc, Condition => Make_Op_Eq (Loc, Left_Opnd => Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Y, Loc), Attribute_Name => Name_Length), Right_Opnd => Make_Integer_Literal (Loc, 0)), Then_Statements => New_List ( Make_Simple_Return_Statement (Loc, Expression => New_Occurrence_Of (Standard_True, Loc))))), Else_Statements => New_List ( Loop_Statement, Make_Simple_Return_Statement (Loc, Expression => Final_Expr))); -- (X : a; Y: a) Formals := New_List ( Make_Parameter_Specification (Loc, Defining_Identifier => X, Parameter_Type => New_Occurrence_Of (Typ, Loc)), Make_Parameter_Specification (Loc, Defining_Identifier => Y, Parameter_Type => New_Occurrence_Of (Typ, Loc))); -- function Gnnn (...) return boolean is -- J : index := Y'first; -- begin -- if ... end if; -- end Gnnn; Func_Name := Make_Temporary (Loc, 'G'); Func_Body := Make_Subprogram_Body (Loc, Specification => Make_Function_Specification (Loc, Defining_Unit_Name => Func_Name, Parameter_Specifications => Formals, Result_Definition => New_Occurrence_Of (Standard_Boolean, Loc)), Declarations => New_List ( Make_Object_Declaration (Loc, Defining_Identifier => J, Object_Definition => New_Occurrence_Of (Index, Loc), Expression => Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Y, Loc), Attribute_Name => Name_First))), Handled_Statement_Sequence => Make_Handled_Sequence_Of_Statements (Loc, Statements => New_List (If_Stat))); return Func_Body; end Make_Array_Comparison_Op; --------------------------- -- Make_Boolean_Array_Op -- --------------------------- -- For logical operations on boolean arrays, expand in line the following, -- replacing 'and' with 'or' or 'xor' where needed: -- function Annn (A : typ; B: typ) return typ is -- C : typ; -- begin -- for J in A'range loop -- C (J) := A (J) op B (J); -- end loop; -- return C; -- end Annn; -- Here typ is the boolean array type function Make_Boolean_Array_Op (Typ : Entity_Id; N : Node_Id) return Node_Id is Loc : constant Source_Ptr := Sloc (N); A : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uA); B : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uB); C : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uC); J : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uJ); A_J : Node_Id; B_J : Node_Id; C_J : Node_Id; Op : Node_Id; Formals : List_Id; Func_Name : Entity_Id; Func_Body : Node_Id; Loop_Statement : Node_Id; begin A_J := Make_Indexed_Component (Loc, Prefix => New_Occurrence_Of (A, Loc), Expressions => New_List (New_Occurrence_Of (J, Loc))); B_J := Make_Indexed_Component (Loc, Prefix => New_Occurrence_Of (B, Loc), Expressions => New_List (New_Occurrence_Of (J, Loc))); C_J := Make_Indexed_Component (Loc, Prefix => New_Occurrence_Of (C, Loc), Expressions => New_List (New_Occurrence_Of (J, Loc))); if Nkind (N) = N_Op_And then Op := Make_Op_And (Loc, Left_Opnd => A_J, Right_Opnd => B_J); elsif Nkind (N) = N_Op_Or then Op := Make_Op_Or (Loc, Left_Opnd => A_J, Right_Opnd => B_J); else Op := Make_Op_Xor (Loc, Left_Opnd => A_J, Right_Opnd => B_J); end if; Loop_Statement := Make_Implicit_Loop_Statement (N, Identifier => Empty, Iteration_Scheme => Make_Iteration_Scheme (Loc, Loop_Parameter_Specification => Make_Loop_Parameter_Specification (Loc, Defining_Identifier => J, Discrete_Subtype_Definition => Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (A, Loc), Attribute_Name => Name_Range))), Statements => New_List ( Make_Assignment_Statement (Loc, Name => C_J, Expression => Op))); Formals := New_List ( Make_Parameter_Specification (Loc, Defining_Identifier => A, Parameter_Type => New_Occurrence_Of (Typ, Loc)), Make_Parameter_Specification (Loc, Defining_Identifier => B, Parameter_Type => New_Occurrence_Of (Typ, Loc))); Func_Name := Make_Temporary (Loc, 'A'); Set_Is_Inlined (Func_Name); Func_Body := Make_Subprogram_Body (Loc, Specification => Make_Function_Specification (Loc, Defining_Unit_Name => Func_Name, Parameter_Specifications => Formals, Result_Definition => New_Occurrence_Of (Typ, Loc)), Declarations => New_List ( Make_Object_Declaration (Loc, Defining_Identifier => C, Object_Definition => New_Occurrence_Of (Typ, Loc))), Handled_Statement_Sequence => Make_Handled_Sequence_Of_Statements (Loc, Statements => New_List ( Loop_Statement, Make_Simple_Return_Statement (Loc, Expression => New_Occurrence_Of (C, Loc))))); return Func_Body; end Make_Boolean_Array_Op; ----------------------------------------- -- Minimized_Eliminated_Overflow_Check -- ----------------------------------------- function Minimized_Eliminated_Overflow_Check (N : Node_Id) return Boolean is begin return Is_Signed_Integer_Type (Etype (N)) and then Overflow_Check_Mode in Minimized_Or_Eliminated; end Minimized_Eliminated_Overflow_Check; -------------------------------- -- Optimize_Length_Comparison -- -------------------------------- procedure Optimize_Length_Comparison (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Typ : constant Entity_Id := Etype (N); Result : Node_Id; Left : Node_Id; Right : Node_Id; -- First and Last attribute reference nodes, which end up as left and -- right operands of the optimized result. Is_Zero : Boolean; -- True for comparison operand of zero Comp : Node_Id; -- Comparison operand, set only if Is_Zero is false Ent : Entity_Id; -- Entity whose length is being compared Index : Node_Id; -- Integer_Literal node for length attribute expression, or Empty -- if there is no such expression present. Ityp : Entity_Id; -- Type of array index to which 'Length is applied Op : Node_Kind := Nkind (N); -- Kind of comparison operator, gets flipped if operands backwards function Is_Optimizable (N : Node_Id) return Boolean; -- Tests N to see if it is an optimizable comparison value (defined as -- constant zero or one, or something else where the value is known to -- be positive and in the range of 32-bits, and where the corresponding -- Length value is also known to be 32-bits. If result is true, sets -- Is_Zero, Ityp, and Comp accordingly. function Is_Entity_Length (N : Node_Id) return Boolean; -- Tests if N is a length attribute applied to a simple entity. If so, -- returns True, and sets Ent to the entity, and Index to the integer -- literal provided as an attribute expression, or to Empty if none. -- Also returns True if the expression is a generated type conversion -- whose expression is of the desired form. This latter case arises -- when Apply_Universal_Integer_Attribute_Check installs a conversion -- to check for being in range, which is not needed in this context. -- Returns False if neither condition holds. function Prepare_64 (N : Node_Id) return Node_Id; -- Given a discrete expression, returns a Long_Long_Integer typed -- expression representing the underlying value of the expression. -- This is done with an unchecked conversion to the result type. We -- use unchecked conversion to handle the enumeration type case. ---------------------- -- Is_Entity_Length -- ---------------------- function Is_Entity_Length (N : Node_Id) return Boolean is begin if Nkind (N) = N_Attribute_Reference and then Attribute_Name (N) = Name_Length and then Is_Entity_Name (Prefix (N)) then Ent := Entity (Prefix (N)); if Present (Expressions (N)) then Index := First (Expressions (N)); else Index := Empty; end if; return True; elsif Nkind (N) = N_Type_Conversion and then not Comes_From_Source (N) then return Is_Entity_Length (Expression (N)); else return False; end if; end Is_Entity_Length; -------------------- -- Is_Optimizable -- -------------------- function Is_Optimizable (N : Node_Id) return Boolean is Val : Uint; OK : Boolean; Lo : Uint; Hi : Uint; Indx : Node_Id; begin if Compile_Time_Known_Value (N) then Val := Expr_Value (N); if Val = Uint_0 then Is_Zero := True; Comp := Empty; return True; elsif Val = Uint_1 then Is_Zero := False; Comp := Empty; return True; end if; end if; -- Here we have to make sure of being within 32-bits Determine_Range (N, OK, Lo, Hi, Assume_Valid => True); if not OK or else Lo < Uint_1 or else Hi > UI_From_Int (Int'Last) then return False; end if; -- Comparison value was within range, so now we must check the index -- value to make sure it is also within 32-bits. Indx := First_Index (Etype (Ent)); if Present (Index) then for J in 2 .. UI_To_Int (Intval (Index)) loop Next_Index (Indx); end loop; end if; Ityp := Etype (Indx); if Esize (Ityp) > 32 then return False; end if; Is_Zero := False; Comp := N; return True; end Is_Optimizable; ---------------- -- Prepare_64 -- ---------------- function Prepare_64 (N : Node_Id) return Node_Id is begin return Unchecked_Convert_To (Standard_Long_Long_Integer, N); end Prepare_64; -- Start of processing for Optimize_Length_Comparison begin -- Nothing to do if not a comparison if Op not in N_Op_Compare then return; end if; -- Nothing to do if special -gnatd.P debug flag set. if Debug_Flag_Dot_PP then return; end if; -- Ent'Length op 0/1 if Is_Entity_Length (Left_Opnd (N)) and then Is_Optimizable (Right_Opnd (N)) then null; -- 0/1 op Ent'Length elsif Is_Entity_Length (Right_Opnd (N)) and then Is_Optimizable (Left_Opnd (N)) then -- Flip comparison to opposite sense case Op is when N_Op_Lt => Op := N_Op_Gt; when N_Op_Le => Op := N_Op_Ge; when N_Op_Gt => Op := N_Op_Lt; when N_Op_Ge => Op := N_Op_Le; when others => null; end case; -- Else optimization not possible else return; end if; -- Fall through if we will do the optimization -- Cases to handle: -- X'Length = 0 => X'First > X'Last -- X'Length = 1 => X'First = X'Last -- X'Length = n => X'First + (n - 1) = X'Last -- X'Length /= 0 => X'First <= X'Last -- X'Length /= 1 => X'First /= X'Last -- X'Length /= n => X'First + (n - 1) /= X'Last -- X'Length >= 0 => always true, warn -- X'Length >= 1 => X'First <= X'Last -- X'Length >= n => X'First + (n - 1) <= X'Last -- X'Length > 0 => X'First <= X'Last -- X'Length > 1 => X'First < X'Last -- X'Length > n => X'First + (n - 1) < X'Last -- X'Length <= 0 => X'First > X'Last (warn, could be =) -- X'Length <= 1 => X'First >= X'Last -- X'Length <= n => X'First + (n - 1) >= X'Last -- X'Length < 0 => always false (warn) -- X'Length < 1 => X'First > X'Last -- X'Length < n => X'First + (n - 1) > X'Last -- Note: for the cases of n (not constant 0,1), we require that the -- corresponding index type be integer or shorter (i.e. not 64-bit), -- and the same for the comparison value. Then we do the comparison -- using 64-bit arithmetic (actually long long integer), so that we -- cannot have overflow intefering with the result. -- First deal with warning cases if Is_Zero then case Op is -- X'Length >= 0 when N_Op_Ge => Rewrite (N, Convert_To (Typ, New_Occurrence_Of (Standard_True, Loc))); Analyze_And_Resolve (N, Typ); Warn_On_Known_Condition (N); return; -- X'Length < 0 when N_Op_Lt => Rewrite (N, Convert_To (Typ, New_Occurrence_Of (Standard_False, Loc))); Analyze_And_Resolve (N, Typ); Warn_On_Known_Condition (N); return; when N_Op_Le => if Constant_Condition_Warnings and then Comes_From_Source (Original_Node (N)) then Error_Msg_N ("could replace by ""'=""?c?", N); end if; Op := N_Op_Eq; when others => null; end case; end if; -- Build the First reference we will use Left := Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Ent, Loc), Attribute_Name => Name_First); if Present (Index) then Set_Expressions (Left, New_List (New_Copy (Index))); end if; -- If general value case, then do the addition of (n - 1), and -- also add the needed conversions to type Long_Long_Integer. if Present (Comp) then Left := Make_Op_Add (Loc, Left_Opnd => Prepare_64 (Left), Right_Opnd => Make_Op_Subtract (Loc, Left_Opnd => Prepare_64 (Comp), Right_Opnd => Make_Integer_Literal (Loc, 1))); end if; -- Build the Last reference we will use Right := Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Ent, Loc), Attribute_Name => Name_Last); if Present (Index) then Set_Expressions (Right, New_List (New_Copy (Index))); end if; -- If general operand, convert Last reference to Long_Long_Integer if Present (Comp) then Right := Prepare_64 (Right); end if; -- Check for cases to optimize -- X'Length = 0 => X'First > X'Last -- X'Length < 1 => X'First > X'Last -- X'Length < n => X'First + (n - 1) > X'Last if (Is_Zero and then Op = N_Op_Eq) or else (not Is_Zero and then Op = N_Op_Lt) then Result := Make_Op_Gt (Loc, Left_Opnd => Left, Right_Opnd => Right); -- X'Length = 1 => X'First = X'Last -- X'Length = n => X'First + (n - 1) = X'Last elsif not Is_Zero and then Op = N_Op_Eq then Result := Make_Op_Eq (Loc, Left_Opnd => Left, Right_Opnd => Right); -- X'Length /= 0 => X'First <= X'Last -- X'Length > 0 => X'First <= X'Last elsif Is_Zero and (Op = N_Op_Ne or else Op = N_Op_Gt) then Result := Make_Op_Le (Loc, Left_Opnd => Left, Right_Opnd => Right); -- X'Length /= 1 => X'First /= X'Last -- X'Length /= n => X'First + (n - 1) /= X'Last elsif not Is_Zero and then Op = N_Op_Ne then Result := Make_Op_Ne (Loc, Left_Opnd => Left, Right_Opnd => Right); -- X'Length >= 1 => X'First <= X'Last -- X'Length >= n => X'First + (n - 1) <= X'Last elsif not Is_Zero and then Op = N_Op_Ge then Result := Make_Op_Le (Loc, Left_Opnd => Left, Right_Opnd => Right); -- X'Length > 1 => X'First < X'Last -- X'Length > n => X'First + (n = 1) < X'Last elsif not Is_Zero and then Op = N_Op_Gt then Result := Make_Op_Lt (Loc, Left_Opnd => Left, Right_Opnd => Right); -- X'Length <= 1 => X'First >= X'Last -- X'Length <= n => X'First + (n - 1) >= X'Last elsif not Is_Zero and then Op = N_Op_Le then Result := Make_Op_Ge (Loc, Left_Opnd => Left, Right_Opnd => Right); -- Should not happen at this stage else raise Program_Error; end if; -- Rewrite and finish up Rewrite (N, Result); Analyze_And_Resolve (N, Typ); return; end Optimize_Length_Comparison; -------------------------------- -- Process_If_Case_Statements -- -------------------------------- procedure Process_If_Case_Statements (N : Node_Id; Stmts : List_Id) is Decl : Node_Id; begin Decl := First (Stmts); while Present (Decl) loop if Nkind (Decl) = N_Object_Declaration and then Is_Finalizable_Transient (Decl, N) then Process_Transient_In_Expression (Decl, N, Stmts); end if; Next (Decl); end loop; end Process_If_Case_Statements; ------------------------------------- -- Process_Transient_In_Expression -- ------------------------------------- procedure Process_Transient_In_Expression (Obj_Decl : Node_Id; Expr : Node_Id; Stmts : List_Id) is Loc : constant Source_Ptr := Sloc (Obj_Decl); Obj_Id : constant Entity_Id := Defining_Identifier (Obj_Decl); Hook_Context : constant Node_Id := Find_Hook_Context (Expr); -- The node on which to insert the hook as an action. This is usually -- the innermost enclosing non-transient construct. Fin_Call : Node_Id; Hook_Assign : Node_Id; Hook_Clear : Node_Id; Hook_Decl : Node_Id; Hook_Insert : Node_Id; Ptr_Decl : Node_Id; Fin_Context : Node_Id; -- The node after which to insert the finalization actions of the -- transient object. begin pragma Assert (Nkind_In (Expr, N_Case_Expression, N_Expression_With_Actions, N_If_Expression)); -- When the context is a Boolean evaluation, all three nodes capture the -- result of their computation in a local temporary: -- do -- Trans_Id : Ctrl_Typ := ...; -- Result : constant Boolean := ... Trans_Id ...; -- <finalize Trans_Id> -- in Result end; -- As a result, the finalization of any transient objects can safely -- take place after the result capture. -- ??? could this be extended to elementary types? if Is_Boolean_Type (Etype (Expr)) then Fin_Context := Last (Stmts); -- Otherwise the immediate context may not be safe enough to carry -- out transient object finalization due to aliasing and nesting of -- constructs. Insert calls to [Deep_]Finalize after the innermost -- enclosing non-transient construct. else Fin_Context := Hook_Context; end if; -- Mark the transient object as successfully processed to avoid double -- finalization. Set_Is_Finalized_Transient (Obj_Id); -- Construct all the pieces necessary to hook and finalize a transient -- object. Build_Transient_Object_Statements (Obj_Decl => Obj_Decl, Fin_Call => Fin_Call, Hook_Assign => Hook_Assign, Hook_Clear => Hook_Clear, Hook_Decl => Hook_Decl, Ptr_Decl => Ptr_Decl, Finalize_Obj => False); -- Add the access type which provides a reference to the transient -- object. Generate: -- type Ptr_Typ is access all Desig_Typ; Insert_Action (Hook_Context, Ptr_Decl); -- Add the temporary which acts as a hook to the transient object. -- Generate: -- Hook : Ptr_Id := null; Insert_Action (Hook_Context, Hook_Decl); -- When the transient object is initialized by an aggregate, the hook -- must capture the object after the last aggregate assignment takes -- place. Only then is the object considered initialized. Generate: -- Hook := Ptr_Typ (Obj_Id); -- <or> -- Hook := Obj_Id'Unrestricted_Access; if Ekind_In (Obj_Id, E_Constant, E_Variable) and then Present (Last_Aggregate_Assignment (Obj_Id)) then Hook_Insert := Last_Aggregate_Assignment (Obj_Id); -- Otherwise the hook seizes the related object immediately else Hook_Insert := Obj_Decl; end if; Insert_After_And_Analyze (Hook_Insert, Hook_Assign); -- When the node is part of a return statement, there is no need to -- insert a finalization call, as the general finalization mechanism -- (see Build_Finalizer) would take care of the transient object on -- subprogram exit. Note that it would also be impossible to insert the -- finalization code after the return statement as this will render it -- unreachable. if Nkind (Fin_Context) = N_Simple_Return_Statement then null; -- Finalize the hook after the context has been evaluated. Generate: -- if Hook /= null then -- [Deep_]Finalize (Hook.all); -- Hook := null; -- end if; else Insert_Action_After (Fin_Context, Make_Implicit_If_Statement (Obj_Decl, Condition => Make_Op_Ne (Loc, Left_Opnd => New_Occurrence_Of (Defining_Entity (Hook_Decl), Loc), Right_Opnd => Make_Null (Loc)), Then_Statements => New_List ( Fin_Call, Hook_Clear))); end if; end Process_Transient_In_Expression; ------------------------ -- Rewrite_Comparison -- ------------------------ procedure Rewrite_Comparison (N : Node_Id) is Warning_Generated : Boolean := False; -- Set to True if first pass with Assume_Valid generates a warning in -- which case we skip the second pass to avoid warning overloaded. Result : Node_Id; -- Set to Standard_True or Standard_False begin if Nkind (N) = N_Type_Conversion then Rewrite_Comparison (Expression (N)); return; elsif Nkind (N) not in N_Op_Compare then return; end if; -- Now start looking at the comparison in detail. We potentially go -- through this loop twice. The first time, Assume_Valid is set False -- in the call to Compile_Time_Compare. If this call results in a -- clear result of always True or Always False, that's decisive and -- we are done. Otherwise we repeat the processing with Assume_Valid -- set to True to generate additional warnings. We can skip that step -- if Constant_Condition_Warnings is False. for AV in False .. True loop declare Typ : constant Entity_Id := Etype (N); Op1 : constant Node_Id := Left_Opnd (N); Op2 : constant Node_Id := Right_Opnd (N); Res : constant Compare_Result := Compile_Time_Compare (Op1, Op2, Assume_Valid => AV); -- Res indicates if compare outcome can be compile time determined True_Result : Boolean; False_Result : Boolean; begin case N_Op_Compare (Nkind (N)) is when N_Op_Eq => True_Result := Res = EQ; False_Result := Res = LT or else Res = GT or else Res = NE; when N_Op_Ge => True_Result := Res in Compare_GE; False_Result := Res = LT; if Res = LE and then Constant_Condition_Warnings and then Comes_From_Source (Original_Node (N)) and then Nkind (Original_Node (N)) = N_Op_Ge and then not In_Instance and then Is_Integer_Type (Etype (Left_Opnd (N))) and then not Has_Warnings_Off (Etype (Left_Opnd (N))) then Error_Msg_N ("can never be greater than, could replace by " & """'=""?c?", N); Warning_Generated := True; end if; when N_Op_Gt => True_Result := Res = GT; False_Result := Res in Compare_LE; when N_Op_Lt => True_Result := Res = LT; False_Result := Res in Compare_GE; when N_Op_Le => True_Result := Res in Compare_LE; False_Result := Res = GT; if Res = GE and then Constant_Condition_Warnings and then Comes_From_Source (Original_Node (N)) and then Nkind (Original_Node (N)) = N_Op_Le and then not In_Instance and then Is_Integer_Type (Etype (Left_Opnd (N))) and then not Has_Warnings_Off (Etype (Left_Opnd (N))) then Error_Msg_N ("can never be less than, could replace by ""'=""?c?", N); Warning_Generated := True; end if; when N_Op_Ne => True_Result := Res = NE or else Res = GT or else Res = LT; False_Result := Res = EQ; end case; -- If this is the first iteration, then we actually convert the -- comparison into True or False, if the result is certain. if AV = False then if True_Result or False_Result then Result := Boolean_Literals (True_Result); Rewrite (N, Convert_To (Typ, New_Occurrence_Of (Result, Sloc (N)))); Analyze_And_Resolve (N, Typ); Warn_On_Known_Condition (N); return; end if; -- If this is the second iteration (AV = True), and the original -- node comes from source and we are not in an instance, then give -- a warning if we know result would be True or False. Note: we -- know Constant_Condition_Warnings is set if we get here. elsif Comes_From_Source (Original_Node (N)) and then not In_Instance then if True_Result then Error_Msg_N ("condition can only be False if invalid values present??", N); elsif False_Result then Error_Msg_N ("condition can only be True if invalid values present??", N); end if; end if; end; -- Skip second iteration if not warning on constant conditions or -- if the first iteration already generated a warning of some kind or -- if we are in any case assuming all values are valid (so that the -- first iteration took care of the valid case). exit when not Constant_Condition_Warnings; exit when Warning_Generated; exit when Assume_No_Invalid_Values; end loop; end Rewrite_Comparison; ---------------------------- -- Safe_In_Place_Array_Op -- ---------------------------- function Safe_In_Place_Array_Op (Lhs : Node_Id; Op1 : Node_Id; Op2 : Node_Id) return Boolean is Target : Entity_Id; function Is_Safe_Operand (Op : Node_Id) return Boolean; -- Operand is safe if it cannot overlap part of the target of the -- operation. If the operand and the target are identical, the operand -- is safe. The operand can be empty in the case of negation. function Is_Unaliased (N : Node_Id) return Boolean; -- Check that N is a stand-alone entity ------------------ -- Is_Unaliased -- ------------------ function Is_Unaliased (N : Node_Id) return Boolean is begin return Is_Entity_Name (N) and then No (Address_Clause (Entity (N))) and then No (Renamed_Object (Entity (N))); end Is_Unaliased; --------------------- -- Is_Safe_Operand -- --------------------- function Is_Safe_Operand (Op : Node_Id) return Boolean is begin if No (Op) then return True; elsif Is_Entity_Name (Op) then return Is_Unaliased (Op); elsif Nkind_In (Op, N_Indexed_Component, N_Selected_Component) then return Is_Unaliased (Prefix (Op)); elsif Nkind (Op) = N_Slice then return Is_Unaliased (Prefix (Op)) and then Entity (Prefix (Op)) /= Target; elsif Nkind (Op) = N_Op_Not then return Is_Safe_Operand (Right_Opnd (Op)); else return False; end if; end Is_Safe_Operand; -- Start of processing for Safe_In_Place_Array_Op begin -- Skip this processing if the component size is different from system -- storage unit (since at least for NOT this would cause problems). if Component_Size (Etype (Lhs)) /= System_Storage_Unit then return False; -- Cannot do in place stuff if non-standard Boolean representation elsif Has_Non_Standard_Rep (Component_Type (Etype (Lhs))) then return False; elsif not Is_Unaliased (Lhs) then return False; else Target := Entity (Lhs); return Is_Safe_Operand (Op1) and then Is_Safe_Operand (Op2); end if; end Safe_In_Place_Array_Op; ----------------------- -- Tagged_Membership -- ----------------------- -- There are two different cases to consider depending on whether the right -- operand is a class-wide type or not. If not we just compare the actual -- tag of the left expr to the target type tag: -- -- Left_Expr.Tag = Right_Type'Tag; -- -- If it is a class-wide type we use the RT function CW_Membership which is -- usually implemented by looking in the ancestor tables contained in the -- dispatch table pointed by Left_Expr.Tag for Typ'Tag -- Ada 2005 (AI-251): If it is a class-wide interface type we use the RT -- function IW_Membership which is usually implemented by looking in the -- table of abstract interface types plus the ancestor table contained in -- the dispatch table pointed by Left_Expr.Tag for Typ'Tag procedure Tagged_Membership (N : Node_Id; SCIL_Node : out Node_Id; Result : out Node_Id) is Left : constant Node_Id := Left_Opnd (N); Right : constant Node_Id := Right_Opnd (N); Loc : constant Source_Ptr := Sloc (N); Full_R_Typ : Entity_Id; Left_Type : Entity_Id; New_Node : Node_Id; Right_Type : Entity_Id; Obj_Tag : Node_Id; begin SCIL_Node := Empty; -- Handle entities from the limited view Left_Type := Available_View (Etype (Left)); Right_Type := Available_View (Etype (Right)); -- In the case where the type is an access type, the test is applied -- using the designated types (needed in Ada 2012 for implicit anonymous -- access conversions, for AI05-0149). if Is_Access_Type (Right_Type) then Left_Type := Designated_Type (Left_Type); Right_Type := Designated_Type (Right_Type); end if; if Is_Class_Wide_Type (Left_Type) then Left_Type := Root_Type (Left_Type); end if; if Is_Class_Wide_Type (Right_Type) then Full_R_Typ := Underlying_Type (Root_Type (Right_Type)); else Full_R_Typ := Underlying_Type (Right_Type); end if; Obj_Tag := Make_Selected_Component (Loc, Prefix => Relocate_Node (Left), Selector_Name => New_Occurrence_Of (First_Tag_Component (Left_Type), Loc)); if Is_Class_Wide_Type (Right_Type) then -- No need to issue a run-time check if we statically know that the -- result of this membership test is always true. For example, -- considering the following declarations: -- type Iface is interface; -- type T is tagged null record; -- type DT is new T and Iface with null record; -- Obj1 : T; -- Obj2 : DT; -- These membership tests are always true: -- Obj1 in T'Class -- Obj2 in T'Class; -- Obj2 in Iface'Class; -- We do not need to handle cases where the membership is illegal. -- For example: -- Obj1 in DT'Class; -- Compile time error -- Obj1 in Iface'Class; -- Compile time error if not Is_Class_Wide_Type (Left_Type) and then (Is_Ancestor (Etype (Right_Type), Left_Type, Use_Full_View => True) or else (Is_Interface (Etype (Right_Type)) and then Interface_Present_In_Ancestor (Typ => Left_Type, Iface => Etype (Right_Type)))) then Result := New_Occurrence_Of (Standard_True, Loc); return; end if; -- Ada 2005 (AI-251): Class-wide applied to interfaces if Is_Interface (Etype (Class_Wide_Type (Right_Type))) -- Support to: "Iface_CW_Typ in Typ'Class" or else Is_Interface (Left_Type) then -- Issue error if IW_Membership operation not available in a -- configurable run time setting. if not RTE_Available (RE_IW_Membership) then Error_Msg_CRT ("dynamic membership test on interface types", N); Result := Empty; return; end if; Result := Make_Function_Call (Loc, Name => New_Occurrence_Of (RTE (RE_IW_Membership), Loc), Parameter_Associations => New_List ( Make_Attribute_Reference (Loc, Prefix => Obj_Tag, Attribute_Name => Name_Address), New_Occurrence_Of ( Node (First_Elmt (Access_Disp_Table (Full_R_Typ))), Loc))); -- Ada 95: Normal case else Build_CW_Membership (Loc, Obj_Tag_Node => Obj_Tag, Typ_Tag_Node => New_Occurrence_Of ( Node (First_Elmt (Access_Disp_Table (Full_R_Typ))), Loc), Related_Nod => N, New_Node => New_Node); -- Generate the SCIL node for this class-wide membership test. -- Done here because the previous call to Build_CW_Membership -- relocates Obj_Tag. if Generate_SCIL then SCIL_Node := Make_SCIL_Membership_Test (Sloc (N)); Set_SCIL_Entity (SCIL_Node, Etype (Right_Type)); Set_SCIL_Tag_Value (SCIL_Node, Obj_Tag); end if; Result := New_Node; end if; -- Right_Type is not a class-wide type else -- No need to check the tag of the object if Right_Typ is abstract if Is_Abstract_Type (Right_Type) then Result := New_Occurrence_Of (Standard_False, Loc); else Result := Make_Op_Eq (Loc, Left_Opnd => Obj_Tag, Right_Opnd => New_Occurrence_Of (Node (First_Elmt (Access_Disp_Table (Full_R_Typ))), Loc)); end if; end if; end Tagged_Membership; ------------------------------ -- Unary_Op_Validity_Checks -- ------------------------------ procedure Unary_Op_Validity_Checks (N : Node_Id) is begin if Validity_Checks_On and Validity_Check_Operands then Ensure_Valid (Right_Opnd (N)); end if; end Unary_Op_Validity_Checks; end Exp_Ch4;
------------------------------------------------------------------------------ -- -- -- ASIS-for-GNAT IMPLEMENTATION COMPONENTS -- -- -- -- A S I S . T E X T . S E T _ G E T -- -- -- -- S p e c -- -- -- -- Copyright (c) 1995-2006, Free Software Foundation, Inc. -- -- -- -- ASIS-for-GNAT is free software; you can redistribute it and/or modify it -- -- under terms of the GNU General Public License as published by the Free -- -- Software Foundation; either version 2, or (at your option) any later -- -- version. ASIS-for-GNAT is distributed in the hope that it will be use- -- -- ful, but WITHOUT ANY WARRANTY; without even the implied warranty of MER- -- -- CHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General -- -- Public License for more details. You should have received a copy of the -- -- GNU General Public License distributed with ASIS-for-GNAT; see file -- -- COPYING. If not, write to the Free Software Foundation, 51 Franklin -- -- Street, Fifth Floor, Boston, MA 02110-1301, USA. -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- ASIS-for-GNAT was originally developed by the ASIS-for-GNAT team at the -- -- Software Engineering Laboratory of the Swiss Federal Institute of -- -- Technology (LGL-EPFL) in Lausanne, Switzerland, in cooperation with the -- -- Scientific Research Computer Center of Moscow State University (SRCC -- -- MSU), Russia, with funding partially provided by grants from the Swiss -- -- National Science Foundation and the Swiss Academy of Engineering -- -- Sciences. ASIS-for-GNAT is now maintained by AdaCore -- -- (http://www.adacore.com). -- -- -- ------------------------------------------------------------------------------ package Asis.Text.Set_Get is --------- -- Get -- --------- function Line_Length (L : Line) return Character_Position; -- Returns line length. Note, that this is the length in the original -- source, counted in wide characters, but not the length in the internal -- representation counted in one-byte characters function Line_Location (L : Line) return Source_Ptr; -- when Line Location is obtained, the tree is resetted if needed function Valid (L : Line) return Boolean; -- chechs, if the argument is valid, that is, if the Context -- from which this line was obtained is still opened function Line_Wide_Image (L : Line) return Wide_String; -- Returns the line image as the line is represented in the original -- source text function Debug_Image (The_Span : Span) return String; -- Produces the debug output for its argument --------- -- Set -- --------- procedure Set_Line_Length (L : in out Line; N : Character_Position); procedure Set_Line_Location (L : in out Line; S : Source_Ptr); -- this procedure is intended to correct the Sloc field in -- the first line from a line list covering a given Span. -- This means, that all the fields of the Line to be corrected -- have been already set as pointing to the beginning of -- a given line. Together with setting the Sloc field, this -- procedure adjust the Rel_Sloc field. procedure Set_Lines (LList : in out Line_List; El : Element); -- This procedure creates LList as a list of lines -- accessable through El. It gets LList as a list -- of Nil_Lines and makes the proper settings for -- the components of each line, making them non-nil -- It takes all the characteristics of these lines from El, -- that is, from the tree on which El is based. This is -- "tree-swapping-safe" procedure. -- The only call to this procedure is in the third -- Asis.Text.Lines function, which explicitly specifies -- the bounds of the Line_List to be returned (that is, LList). -- The caller makes all the checks needed to make sure, that -- the compilation enclosing El really contains lines with numbers -- LList'First and LList'Last end Asis.Text.Set_Get;
-- Copyright (c) 2013, Nordic Semiconductor ASA -- All rights reserved. -- -- Redistribution and use in source and binary forms, with or without -- modification, are permitted provided that the following conditions are met: -- -- * 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 Nordic Semiconductor ASA nor the names of its -- contributors may be used to endorse or promote products derived from -- this software without specific prior written permission. -- -- 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 spec has been automatically generated from nrf51.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with HAL; with System; package NRF_SVD.FICR is pragma Preelaborate; --------------- -- Registers -- --------------- -- Pre-programmed factory code present. type PPFC_PPFC_Field is (-- Present. Present, -- Not present. Notpresent) with Size => 8; for PPFC_PPFC_Field use (Present => 0, Notpresent => 255); -- Pre-programmed factory code present. type PPFC_Register is record -- Read-only. Pre-programmed factory code present. PPFC : PPFC_PPFC_Field; -- unspecified Reserved_8_31 : HAL.UInt24; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for PPFC_Register use record PPFC at 0 range 0 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; -- Deprecated array of size of RAM block in bytes. This name is kept for backward compatinility purposes. Use SIZERAMBLOCKS instead. -- Deprecated array of size of RAM block in bytes. This name is kept for -- backward compatinility purposes. Use SIZERAMBLOCKS instead. type SIZERAMBLOCK_Registers is array (0 .. 3) of HAL.UInt32; subtype CONFIGID_HWID_Field is HAL.UInt16; subtype CONFIGID_FWID_Field is HAL.UInt16; -- Configuration identifier. type CONFIGID_Register is record -- Read-only. Hardware Identification Number. HWID : CONFIGID_HWID_Field; -- Read-only. Firmware Identification Number pre-loaded into the flash. FWID : CONFIGID_FWID_Field; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for CONFIGID_Register use record HWID at 0 range 0 .. 15; FWID at 0 range 16 .. 31; end record; -- Device identifier. -- Device identifier. type DEVICEID_Registers is array (0 .. 1) of HAL.UInt32; -- Encryption root. -- Encryption root. type ER_Registers is array (0 .. 3) of HAL.UInt32; -- Identity root. -- Identity root. type IR_Registers is array (0 .. 3) of HAL.UInt32; -- Device address type. type DEVICEADDRTYPE_DEVICEADDRTYPE_Field is (-- Public address. Public, -- Random address. Random) with Size => 1; for DEVICEADDRTYPE_DEVICEADDRTYPE_Field use (Public => 0, Random => 1); -- Device address type. type DEVICEADDRTYPE_Register is record -- Read-only. Device address type. DEVICEADDRTYPE : DEVICEADDRTYPE_DEVICEADDRTYPE_Field; -- unspecified Reserved_1_31 : HAL.UInt31; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for DEVICEADDRTYPE_Register use record DEVICEADDRTYPE at 0 range 0 .. 0; Reserved_1_31 at 0 range 1 .. 31; end record; -- Device address. -- Device address. type DEVICEADDR_Registers is array (0 .. 1) of HAL.UInt32; -- Override default values for NRF_1Mbit mode. type OVERRIDEEN_NRF_1MBIT_Field is (-- Override the default values for NRF_1Mbit mode. Override, -- Do not override the default values for NRF_1Mbit mode. Notoverride) with Size => 1; for OVERRIDEEN_NRF_1MBIT_Field use (Override => 0, Notoverride => 1); -- Override default values for BLE_1Mbit mode. type OVERRIDEEN_BLE_1MBIT_Field is (-- Override the default values for BLE_1Mbit mode. Override, -- Do not override the default values for BLE_1Mbit mode. Notoverride) with Size => 1; for OVERRIDEEN_BLE_1MBIT_Field use (Override => 0, Notoverride => 1); -- Radio calibration override enable. type OVERRIDEEN_Register is record -- Read-only. Override default values for NRF_1Mbit mode. NRF_1MBIT : OVERRIDEEN_NRF_1MBIT_Field; -- unspecified Reserved_1_2 : HAL.UInt2; -- Read-only. Override default values for BLE_1Mbit mode. BLE_1MBIT : OVERRIDEEN_BLE_1MBIT_Field; -- unspecified Reserved_4_31 : HAL.UInt28; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for OVERRIDEEN_Register use record NRF_1MBIT at 0 range 0 .. 0; Reserved_1_2 at 0 range 1 .. 2; BLE_1MBIT at 0 range 3 .. 3; Reserved_4_31 at 0 range 4 .. 31; end record; -- Override values for the OVERRIDEn registers in RADIO for NRF_1Mbit mode. -- Override values for the OVERRIDEn registers in RADIO for NRF_1Mbit mode. type NRF_1MBIT_Registers is array (0 .. 4) of HAL.UInt32; -- Override values for the OVERRIDEn registers in RADIO for BLE_1Mbit mode. -- Override values for the OVERRIDEn registers in RADIO for BLE_1Mbit mode. type BLE_1MBIT_Registers is array (0 .. 4) of HAL.UInt32; ----------------- -- Peripherals -- ----------------- type FICR_Disc is (S, Default); -- Factory Information Configuration. type FICR_Peripheral (Discriminent : FICR_Disc := S) is record -- Code memory page size in bytes. CODEPAGESIZE : aliased HAL.UInt32; -- Code memory size in pages. CODESIZE : aliased HAL.UInt32; -- Length of code region 0 in bytes. CLENR0 : aliased HAL.UInt32; -- Pre-programmed factory code present. PPFC : aliased PPFC_Register; -- Number of individualy controllable RAM blocks. NUMRAMBLOCK : aliased HAL.UInt32; -- Configuration identifier. CONFIGID : aliased CONFIGID_Register; -- Device identifier. DEVICEID : aliased DEVICEID_Registers; -- Encryption root. ER : aliased ER_Registers; -- Identity root. IR : aliased IR_Registers; -- Device address type. DEVICEADDRTYPE : aliased DEVICEADDRTYPE_Register; -- Device address. DEVICEADDR : aliased DEVICEADDR_Registers; -- Radio calibration override enable. OVERRIDEEN : aliased OVERRIDEEN_Register; -- Override values for the OVERRIDEn registers in RADIO for NRF_1Mbit -- mode. NRF_1MBIT : aliased NRF_1MBIT_Registers; -- Override values for the OVERRIDEn registers in RADIO for BLE_1Mbit -- mode. BLE_1MBIT : aliased BLE_1MBIT_Registers; case Discriminent is when S => -- Size of RAM blocks in bytes. SIZERAMBLOCKS : aliased HAL.UInt32; when Default => -- Deprecated array of size of RAM block in bytes. This name is -- kept for backward compatinility purposes. Use SIZERAMBLOCKS -- instead. SIZERAMBLOCK : aliased SIZERAMBLOCK_Registers; end case; end record with Unchecked_Union, Volatile; for FICR_Peripheral use record CODEPAGESIZE at 16#10# range 0 .. 31; CODESIZE at 16#14# range 0 .. 31; CLENR0 at 16#28# range 0 .. 31; PPFC at 16#2C# range 0 .. 31; NUMRAMBLOCK at 16#34# range 0 .. 31; CONFIGID at 16#5C# range 0 .. 31; DEVICEID at 16#60# range 0 .. 63; ER at 16#80# range 0 .. 127; IR at 16#90# range 0 .. 127; DEVICEADDRTYPE at 16#A0# range 0 .. 31; DEVICEADDR at 16#A4# range 0 .. 63; OVERRIDEEN at 16#AC# range 0 .. 31; NRF_1MBIT at 16#B0# range 0 .. 159; BLE_1MBIT at 16#EC# range 0 .. 159; SIZERAMBLOCKS at 16#38# range 0 .. 31; SIZERAMBLOCK at 16#38# range 0 .. 127; end record; -- Factory Information Configuration. FICR_Periph : aliased FICR_Peripheral with Import, Address => FICR_Base; end NRF_SVD.FICR;
------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ -- This file is generated, don't edit it. ------------------------------------------------------------------------------ with AMF.Elements.Generic_Hash; function AMF.CMOF.Enumerations.Hash is new AMF.Elements.Generic_Hash (CMOF_Enumeration, CMOF_Enumeration_Access);
-- C97202A.ADA -- Grant of Unlimited Rights -- -- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687, -- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained -- unlimited rights in the software and documentation contained herein. -- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making -- this public release, the Government intends to confer upon all -- recipients unlimited rights equal to those held by the Government. -- These rights include rights to use, duplicate, release or disclose the -- released technical data and computer software in whole or in part, in -- any manner and for any purpose whatsoever, and to have or permit others -- to do so. -- -- DISCLAIMER -- -- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR -- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED -- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE -- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE -- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A -- PARTICULAR PURPOSE OF SAID MATERIAL. --* -- CHECK THAT THE INDEX IS EVALUATED BEFORE THE ENTRY PARAMETER AND BOTH -- THE INDEX AND THE ENTRY PARAMETER ARE EVALUATED BEFORE THE RENDEZVOUS -- IS ATTEMPED. -- RM 4/05/82 -- TBN 2/3/86 ADDED A CHECK THAT INDEX IS EVALUATED BEFORE THE ENTRY -- PARAMETER AND FIXED APPROPRIATE COMMENTS. WITH REPORT; USE REPORT; PROCEDURE C97202A IS INDEX_COMPUTED : BOOLEAN := FALSE ; FORMAL_COMPUTED : BOOLEAN := FALSE ; BEGIN TEST ("C97202A", "CHECK THAT THE INDEX IS EVALUATED BEFORE THE " & "ENTRY PARAMETER AND BOTH INDEX AND THE ENTRY " & "PARAMETER ARE EVALUATED BEFORE THE RENDEZVOUS " & "IS ATTEMPTED"); DECLARE SUBTYPE SHORT IS INTEGER RANGE 10..20 ; TASK T IS ENTRY DO_IT_NOW_ORELSE (SHORT) (DID_YOU_DO_IT : IN BOOLEAN); ENTRY KEEP_ALIVE ; END T ; TASK BODY T IS BEGIN ACCEPT KEEP_ALIVE ; END T ; FUNCTION F1 (X:INTEGER) RETURN INTEGER IS BEGIN IF FORMAL_COMPUTED THEN FAILED ("INDEX WAS NOT EVALUATED FIRST"); END IF; INDEX_COMPUTED := TRUE ; RETURN (7) ; END F1 ; FUNCTION F2 (X:INTEGER) RETURN BOOLEAN IS BEGIN FORMAL_COMPUTED := TRUE ; RETURN (FALSE) ; END F2 ; BEGIN SELECT T.DO_IT_NOW_ORELSE ( 6 + F1(7) ) ( NOT(F2(7)) ) ; ELSE NULL ; END SELECT; T.KEEP_ALIVE ; END; -- END OF BLOCK CONTAINING THE ENTRY CALLS. IF INDEX_COMPUTED THEN NULL ; ELSE FAILED( "ENTRY INDEX WAS NOT COMPUTED" ); END IF; IF FORMAL_COMPUTED THEN NULL ; ELSE FAILED( "ENTRY PARAMETER WAS NOT COMPUTED" ); END IF; RESULT; END C97202A ;
-- Copyright 2008-2015 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- This program is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. package body Pck is type Empty is record Month : Integer; Year : Integer; end record; function Create return Wrap is begin return (E => new Empty'(Month => 8, Year => 1974)); end Create; end Pck;
-- Abstract : -- -- Output Ada code implementing the grammar defined by input -- parameters, and a parser for that grammar. The grammar parser -- actions must be Ada. -- -- Copyright (C) 2017 - 2020 Free Software Foundation, Inc. -- -- The WisiToken package is free software; you can redistribute it -- and/or modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 3, or -- (at your option) any later version. This library is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. -- -- As a special exception under Section 7 of GPL version 3, you are granted -- additional permissions described in the GCC Runtime Library Exception, -- version 3.1, as published by the Free Software Foundation. pragma License (Modified_GPL); with Ada.Strings.Fixed; with Ada.Text_IO; use Ada.Text_IO; with GNAT.Regexp; with WisiToken.BNF.Generate_Packrat; with WisiToken.BNF.Generate_Utils; with WisiToken.BNF.Output_Ada_Common; use WisiToken.BNF.Output_Ada_Common; with WisiToken.Generate.Packrat; with WisiToken_Grammar_Runtime; procedure WisiToken.BNF.Output_Ada (Input_Data : in WisiToken_Grammar_Runtime.User_Data_Type; Output_File_Name_Root : in String; Generate_Data : aliased in WisiToken.BNF.Generate_Utils.Generate_Data; Packrat_Data : in WisiToken.Generate.Packrat.Data; Tuple : in Generate_Tuple; Test_Main : in Boolean; Multiple_Tuples : in Boolean) is Common_Data : Output_Ada_Common.Common_Data := WisiToken.BNF.Output_Ada_Common.Initialize (Input_Data, Tuple, Output_File_Name_Root, Check_Interface => False); Gen_Alg_Name : constant String := (if Test_Main or Multiple_Tuples then "_" & Generate_Algorithm_Image (Common_Data.Generate_Algorithm).all else ""); function Symbol_Regexp (Item : in String) return String is begin -- Return a regular expression string that matches Item as a symbol; -- it must be preceded and followed by non-symbol characters. -- -- GNAT.Regexp does not have a char for 'end of string', so we hope -- that doesn't occur. Sigh. return ".*[ (\.]" & Item & "[ );\.,].*"; end Symbol_Regexp; procedure Create_Ada_Actions_Body (Action_Names : not null access WisiToken.Names_Array_Array; Check_Names : not null access WisiToken.Names_Array_Array; Label_Count : in Ada.Containers.Count_Type; Package_Name : in String) is use all type Ada.Containers.Count_Type; use GNAT.Regexp; use Generate_Utils; use WisiToken.Generate; File_Name : constant String := Output_File_Name_Root & "_actions.adb"; User_Data_Regexp : constant Regexp := Compile (Symbol_Regexp ("User_Data"), Case_Sensitive => False); Tree_Regexp : constant Regexp := Compile (Symbol_Regexp ("Tree"), Case_Sensitive => False); Nonterm_Regexp : constant Regexp := Compile (Symbol_Regexp ("Nonterm"), Case_Sensitive => False); Tokens_Regexp : constant Regexp := Compile (Symbol_Regexp ("Tokens"), Case_Sensitive => False); Body_File : File_Type; begin Create (Body_File, Out_File, File_Name); Set_Output (Body_File); Indent := 1; Put_File_Header (Ada_Comment, Use_Tuple => True, Tuple => Tuple); Put_Raw_Code (Ada_Comment, Input_Data.Raw_Code (Copyright_License)); Put_Raw_Code (Ada_Comment, Input_Data.Raw_Code (Actions_Body_Context)); New_Line; if Label_Count > 0 then Put_Line ("with SAL;"); end if; Put_Line ("package body " & Package_Name & " is"); Indent := Indent + 3; New_Line; if Input_Data.Check_Count > 0 then Indent_Line ("use WisiToken.Semantic_Checks;"); New_Line; end if; Put_Raw_Code (Ada_Comment, Input_Data.Raw_Code (Actions_Body_Pre)); -- generate Action and Check subprograms. for Rule of Input_Data.Tokens.Rules loop -- No need for a Token_Cursor here, since we only need the -- nonterminals. declare use Ada.Strings.Unbounded; LHS_ID : constant WisiToken.Token_ID := Find_Token_ID (Generate_Data, -Rule.Left_Hand_Side); RHS_Index : Integer := 0; function Is_Elisp (Action : in Unbounded_String) return Boolean is begin return Length (Action) >= 6 and then (Slice (Action, 1, 6) = "(progn" or Slice (Action, 1, 5) = "wisi-"); end Is_Elisp; procedure Put_Labels (RHS : in RHS_Type; Line : in String) is Output : array (Rule.Labels.First_Index .. Rule.Labels.Last_Index) of Boolean := (others => False); procedure Update_Output (Label : in String) is begin for I in Rule.Labels.First_Index .. Rule.Labels.Last_Index loop if Label = Rule.Labels (I) then Output (I) := True; end if; end loop; end Update_Output; begin for I in RHS.Tokens.First_Index .. RHS.Tokens.Last_Index loop if Length (RHS.Tokens (I).Label) > 0 then declare Label : constant String := -RHS.Tokens (I).Label; begin if Match (Line, Compile (Symbol_Regexp (Label), Case_Sensitive => False)) then Indent_Line (Label & " : constant SAL.Peek_Type :=" & SAL.Peek_Type'Image (I) & ";"); Update_Output (Label); end if; end; end if; end loop; for I in Rule.Labels.First_Index .. Rule.Labels.Last_Index loop if not Output (I) and Match (Line, Compile (Symbol_Regexp (-Rule.Labels (I)), Case_Sensitive => False)) then Indent_Line (-Rule.Labels (I) & " : constant SAL.Base_Peek_Type := SAL.Base_Peek_Type'First;"); end if; end loop; end Put_Labels; begin for RHS of Rule.Right_Hand_Sides loop if Length (RHS.Action) > 0 and then not Is_Elisp (RHS.Action) then declare Line : constant String := -RHS.Action; -- Actually multiple lines; we assume the formatting is adequate. Name : constant String := Action_Names (LHS_ID)(RHS_Index).all; Unref_User_Data : Boolean := True; Unref_Tree : Boolean := True; Unref_Nonterm : Boolean := True; Unref_Tokens : Boolean := True; Need_Comma : Boolean := False; procedure Check_Unref (Line : in String) is begin if Match (Line, User_Data_Regexp) then Unref_User_Data := False; end if; if Match (Line, Tree_Regexp) then Unref_Tree := False; end if; if Match (Line, Nonterm_Regexp) then Unref_Nonterm := False; end if; if Match (Line, Tokens_Regexp) then Unref_Tokens := False; end if; end Check_Unref; begin Check_Unref (Line); Indent_Line ("procedure " & Name); Indent_Line (" (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;"); Indent_Line (" Tree : in out WisiToken.Syntax_Trees.Tree;"); Indent_Line (" Nonterm : in WisiToken.Valid_Node_Index;"); Indent_Line (" Tokens : in WisiToken.Valid_Node_Index_Array)"); Indent_Line ("is"); Indent := Indent + 3; if Unref_User_Data or Unref_Tree or Unref_Nonterm or Unref_Tokens then Indent_Start ("pragma Unreferenced ("); if Unref_User_Data then Put ("User_Data"); Need_Comma := True; end if; if Unref_Tree then Put ((if Need_Comma then ", " else "") & "Tree"); Need_Comma := True; end if; if Unref_Nonterm then Put ((if Need_Comma then ", " else "") & "Nonterm"); Need_Comma := True; end if; if Unref_Tokens then Put ((if Need_Comma then ", " else "") & "Tokens"); Need_Comma := True; end if; Put_Line (");"); end if; Put_Labels (RHS, Line); Indent := Indent - 3; Indent_Line ("begin"); Indent := Indent + 3; Indent_Line (Line); Indent := Indent - 3; Indent_Line ("end " & Name & ";"); New_Line; end; end if; if Length (RHS.Check) > 0 and then not Is_Elisp (RHS.Check) then declare use Ada.Strings.Fixed; Line : constant String := -RHS.Check; Name : constant String := Check_Names (LHS_ID)(RHS_Index).all; Unref_Lexer : constant Boolean := 0 = Index (Line, "Lexer"); Unref_Nonterm : constant Boolean := 0 = Index (Line, "Nonterm"); Unref_Tokens : constant Boolean := 0 = Index (Line, "Tokens"); Unref_Recover : constant Boolean := 0 = Index (Line, "Recover_Active"); Need_Comma : Boolean := False; begin Indent_Line ("function " & Name); Indent_Line (" (Lexer : access constant WisiToken.Lexer.Instance'Class;"); Indent_Line (" Nonterm : in out WisiToken.Recover_Token;"); Indent_Line (" Tokens : in WisiToken.Recover_Token_Array;"); Indent_Line (" Recover_Active : in Boolean)"); Indent_Line (" return WisiToken.Semantic_Checks.Check_Status"); Indent_Line ("is"); Indent := Indent + 3; if Unref_Lexer or Unref_Nonterm or Unref_Tokens or Unref_Recover then Indent_Start ("pragma Unreferenced ("); if Unref_Lexer then Put ("Lexer"); Need_Comma := True; end if; if Unref_Nonterm then Put ((if Need_Comma then ", " else "") & "Nonterm"); Need_Comma := True; end if; if Unref_Tokens then Put ((if Need_Comma then ", " else "") & "Tokens"); Need_Comma := True; end if; if Unref_Recover then Put ((if Need_Comma then ", " else "") & "Recover_Active"); Need_Comma := True; end if; Put_Line (");"); end if; Put_Labels (RHS, Line); Indent := Indent - 3; Indent_Line ("begin"); Indent := Indent + 3; Indent_Line (Line); Indent := Indent - 3; Indent_Line ("end " & Name & ";"); New_Line; end; end if; RHS_Index := RHS_Index + 1; end loop; end; end loop; Put_Raw_Code (Ada_Comment, Input_Data.Raw_Code (Actions_Body_Post)); Put_Line ("end " & Package_Name & ";"); Close (Body_File); Set_Output (Standard_Output); end Create_Ada_Actions_Body; procedure Create_Ada_Main_Body (Actions_Package_Name : in String; Main_Package_Name : in String) is use WisiToken.Generate; File_Name : constant String := To_Lower (Main_Package_Name) & ".adb"; re2c_Package_Name : constant String := -Common_Data.Lower_File_Name_Root & "_re2c_c"; Body_File : File_Type; begin Create (Body_File, Out_File, File_Name); Set_Output (Body_File); Indent := 1; Put_File_Header (Ada_Comment, Use_Tuple => True, Tuple => Tuple); Put_Raw_Code (Ada_Comment, Input_Data.Raw_Code (Copyright_License)); New_Line; if (case Common_Data.Generate_Algorithm is when LR_Generate_Algorithm => Input_Data.Action_Count > 0 or Input_Data.Check_Count > 0, when Packrat_Generate_Algorithm | External => Input_Data.Action_Count > 0) then Put_Line ("with " & Actions_Package_Name & "; use " & Actions_Package_Name & ";"); end if; case Common_Data.Lexer is when None | Elisp_Lexer => null; when re2c_Lexer => Put_Line ("with WisiToken.Lexer.re2c;"); Put_Line ("with " & re2c_Package_Name & ";"); end case; case Common_Data.Generate_Algorithm is when LR_Generate_Algorithm => null; when Packrat_Gen => Put_Line ("with WisiToken.Parse.Packrat.Generated;"); when Packrat_Proc => Put_Line ("with WisiToken.Parse.Packrat.Procedural;"); Put_Line ("with WisiToken.Productions;"); when External => null; end case; Put_Line ("package body " & Main_Package_Name & " is"); Indent := Indent + 3; New_Line; case Common_Data.Lexer is when None | Elisp_Lexer => null; when re2c_Lexer => Indent_Line ("package Lexer is new WisiToken.Lexer.re2c"); Indent_Line (" (" & re2c_Package_Name & ".New_Lexer,"); Indent_Line (" " & re2c_Package_Name & ".Free_Lexer,"); Indent_Line (" " & re2c_Package_Name & ".Reset_Lexer,"); Indent_Line (" " & re2c_Package_Name & ".Next_Token);"); New_Line; end case; case Common_Data.Generate_Algorithm is when LR_Generate_Algorithm => LR_Create_Create_Parser (Input_Data, Common_Data, Generate_Data); when Packrat_Gen => WisiToken.BNF.Generate_Packrat (Packrat_Data, Generate_Data); Packrat_Create_Create_Parser (Common_Data, Generate_Data, Packrat_Data); when Packrat_Proc => Packrat_Create_Create_Parser (Common_Data, Generate_Data, Packrat_Data); when External => External_Create_Create_Grammar (Generate_Data); end case; Put_Line ("end " & Main_Package_Name & ";"); Close (Body_File); Set_Output (Standard_Output); end Create_Ada_Main_Body; procedure Create_Ada_Test_Main (Actions_Package_Name : in String; Main_Package_Name : in String) is use WisiToken.Generate; Generic_Package_Name : constant String := (case Common_Data.Generate_Algorithm is when LR_Generate_Algorithm => (if Input_Data.Language_Params.Error_Recover then (if Common_Data.Text_Rep then "Gen_LR_Text_Rep_Parser_Run" else "Gen_LR_Parser_Run") else (if Common_Data.Text_Rep then "Gen_LR_Text_Rep_Parser_No_Recover_Run" else "Gen_LR_Parser_No_Recover_Run")), when Packrat_Generate_Algorithm => "Gen_Packrat_Parser_Run", when External => raise SAL.Programmer_Error); Unit_Name : constant String := File_Name_To_Ada (Output_File_Name_Root) & "_" & Generate_Algorithm'Image (Common_Data.Generate_Algorithm) & "_Run"; Default_Language_Runtime_Package : constant String := "WisiToken.Parse.LR.McKenzie_Recover." & File_Name_To_Ada (Output_File_Name_Root); File_Name : constant String := To_Lower (Unit_Name) & ".ads"; File : File_Type; begin Create (File, Out_File, File_Name); Set_Output (File); Indent := 1; Put_File_Header (Ada_Comment, Use_Tuple => True, Tuple => Tuple); -- no Copyright_License; just a test file New_Line; Put_Line ("with " & Generic_Package_Name & ";"); Put_Line ("with " & Actions_Package_Name & ";"); Put_Line ("with " & Main_Package_Name & ";"); if Input_Data.Language_Params.Error_Recover and Input_Data.Language_Params.Use_Language_Runtime then declare Pkg : constant String := (if -Input_Data.Language_Params.Language_Runtime_Name = "" then Default_Language_Runtime_Package else -Input_Data.Language_Params.Language_Runtime_Name); begin -- For language-specific names in actions, checks. Put_Line ("with " & Pkg & ";"); Put_Line ("use " & Pkg & ";"); end; end if; Put_Line ("procedure " & Unit_Name & " is new " & Generic_Package_Name); Put_Line (" (" & Actions_Package_Name & ".Descriptor,"); if Common_Data.Text_Rep then Put_Line (" """ & Output_File_Name_Root & "_" & To_Lower (Generate_Algorithm_Image (Tuple.Gen_Alg).all) & "_parse_table.txt"","); end if; if Input_Data.Language_Params.Error_Recover then if Input_Data.Language_Params.Use_Language_Runtime then Put_Line ("Fixes'Access, Matching_Begin_Tokens'Access, String_ID_Set'Access,"); else Put_Line ("null, null, null,"); end if; end if; Put_Line (Main_Package_Name & ".Create_Parser);"); Close (File); Set_Output (Standard_Output); end Create_Ada_Test_Main; begin case Common_Data.Lexer is when None | re2c_Lexer => null; when Elisp_Lexer => raise User_Error with WisiToken.Generate.Error_Message (Input_Data.Grammar_Lexer.File_Name, 1, "Ada output language does not support " & Lexer_Image (Common_Data.Lexer).all & " lexer"); end case; case Tuple.Interface_Kind is when None => null; when Module | Process => raise User_Error with WisiToken.Generate.Error_Message (Input_Data.Grammar_Lexer.File_Name, 1, "Ada output language does not support setting Interface"); end case; declare Main_Package_Name : constant String := File_Name_To_Ada (Output_File_Name_Root & Gen_Alg_Name) & "_Main"; Actions_Package_Name : constant String := File_Name_To_Ada (Output_File_Name_Root) & "_Actions"; begin if Input_Data.Action_Count > 0 or Input_Data.Check_Count > 0 then -- Some WisiToken tests have no actions or checks. Create_Ada_Actions_Body (Generate_Data.Action_Names, Generate_Data.Check_Names, Input_Data.Label_Count, Actions_Package_Name); end if; Create_Ada_Actions_Spec (Output_File_Name_Root & "_actions.ads", Actions_Package_Name, Input_Data, Common_Data, Generate_Data); if Tuple.Gen_Alg = External then Create_External_Main_Spec (Main_Package_Name, Tuple, Input_Data); Create_Ada_Main_Body (Actions_Package_Name, Main_Package_Name); else Create_Ada_Main_Body (Actions_Package_Name, Main_Package_Name); Create_Ada_Main_Spec (To_Lower (Main_Package_Name) & ".ads", Main_Package_Name, Input_Data, Common_Data); if Test_Main then Create_Ada_Test_Main (Actions_Package_Name, Main_Package_Name); end if; end if; end; exception when others => Set_Output (Standard_Output); raise; end WisiToken.BNF.Output_Ada;
-- Ada_GUI implementation based on Gnoga. Adapted 2021 -- -- -- GNOGA - The GNU Omnificent GUI for Ada -- -- -- -- G N O G A . G U I . D O C U M E N T -- -- -- -- S p e c -- -- -- -- -- -- Copyright (C) 2014 David Botton -- -- -- -- 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 -- -- 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/>. -- -- -- -- 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. -- -- -- -- For more information please go to http://www.gnoga.com -- ------------------------------------------------------------------------------ with Ada_GUI.Gnoga.Gui.Element; package Ada_GUI.Gnoga.Gui.Document is ------------------------------------------------------------------------- -- Document_Type ------------------------------------------------------------------------- -- Document_Type is the class encapsulating the DOM's root document node -- To use, access via Window_Type.Document type Document_Type is new Gnoga.Gui.Base_Type with private; type Document_Access is access all Document_Type; type Pointer_To_Document_Class is access all Document_Type'Class; Invalid_ID_Type : exception; overriding procedure Attach (Document : in out Document_Type; Connection_ID : in Gnoga.Connection_ID; ID : in String := "window"; ID_Type : in Gnoga.ID_Enumeration := Gnoga.Script); -- Attach a Gnoga Document_Type to the document on Connection_ID -- ID in this context does not mean as on other objects the ID of this -- element, but rather the ID of the parent Window for the document. -- ID_Type of DOM_ID will raise Invalid_ID_Type; ------------------------------------------------------------------------- -- Document_Type - Properties ------------------------------------------------------------------------- function Domain (Document : Document_Type) return String; function Input_Encoding (Document : Document_Type) return String; function Last_Modified (Document : Document_Type) return String; function Referrer (Document : Document_Type) return String; procedure Title (Document : in out Document_Type; Value : in String); function Title (Document : Document_Type) return String; function URL (Document : Document_Type) return String; function Head_Element (Document : Document_Type) return Gnoga.Gui.Element.Element_Access; function Body_Element (Document : Document_Type) return Gnoga.Gui.Element.Element_Access; function Document_Element (Document : Document_Type) return Gnoga.Gui.Element.Element_Access; -- The document element is the root of the document, example <HTML> -- in a text/html document. Using Document_Element.Outer_HTML will -- return the entire document as per the current state in the browser. type Ready_State_Type is (Uninitialized, Loading, Interactive, Complete); function Ready_State (Document : Document_Type) return Ready_State_Type; ------------------------------------------------------------------------- -- Document_Type - Methods ------------------------------------------------------------------------- procedure Load_CSS (Document : in out Document_Type; URL : in String); -- Loads a CSS file in to document from URL procedure Write (Document : in out Document_Type; Value : in String); procedure Write_Line (Document : in out Document_Type; Value : in String); -- Write Value (with new line if Write_Line) to the document. -- Note that the first use of these procedures can erase elements already -- inserted in to the Document.Body_Element. Therefore to use these -- Write/Write_Line so that a text node is created before inserting any -- elements into the document body. -- In general, use View.Put_Line instead with in a view that is attached -- to the window. procedure Put_Line (Document : in out Document_Type; Value : in String); -- Calls Write_Line with Value + "<br />" -- Using Put_Line on Firefox will break the WebSocket connection -- In general, use View.Put_Line instead with in a view that is attached -- to the window. private type Document_Type is new Gnoga.Gui.Base_Type with record DOM_HTML : aliased Gnoga.Gui.Element.Element_Type; DOM_Head : aliased Gnoga.Gui.Element.Element_Type; DOM_Body : aliased Gnoga.Gui.Element.Element_Type; end record; end Ada_GUI.Gnoga.Gui.Document;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . S T R I N G S . U N B O U N D E D -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2019, Free Software Foundation, Inc. -- -- -- -- This specification is derived from the Ada Reference Manual for use with -- -- GNAT. The copyright notice above, and the license provisions that follow -- -- apply solely to the contents of the part following the private keyword. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package provides an implementation of Ada.Strings.Unbounded that uses -- reference counts to implement copy on modification (rather than copy on -- assignment). This is significantly more efficient on many targets. -- This version is supported on: -- - all Alpha platforms -- - all ia64 platforms -- - all PowerPC platforms -- - all SPARC V9 platforms -- - all x86 platforms -- - all x86_64 platforms -- This package uses several techniques to increase speed: -- - Implicit sharing or copy-on-write. An Unbounded_String contains only -- the reference to the data which is shared between several instances. -- The shared data is reallocated only when its value is changed and -- the object mutation can't be used or it is inefficient to use it. -- - Object mutation. Shared data object can be reused without memory -- reallocation when all of the following requirements are met: -- - the shared data object is no longer used by anyone else; -- - the size is sufficient to store the new value; -- - the gap after reuse is less than a defined threshold. -- - Memory preallocation. Most of used memory allocation algorithms -- align allocated segments on the some boundary, thus some amount of -- additional memory can be preallocated without any impact. Such -- preallocated memory can used later by Append/Insert operations -- without reallocation. -- Reference counting uses GCC builtin atomic operations, which allows safe -- sharing of internal data between Ada tasks. Nevertheless, this does not -- make objects of Unbounded_String thread-safe: an instance cannot be -- accessed by several tasks simultaneously. with Ada.Strings.Maps; private with Ada.Finalization; private with System.Atomic_Counters; package Ada.Strings.Unbounded is pragma Preelaborate; type Unbounded_String is private; pragma Preelaborable_Initialization (Unbounded_String); Null_Unbounded_String : constant Unbounded_String; function Length (Source : Unbounded_String) return Natural; type String_Access is access all String; procedure Free (X : in out String_Access); -------------------------------------------------------- -- Conversion, Concatenation, and Selection Functions -- -------------------------------------------------------- function To_Unbounded_String (Source : String) return Unbounded_String; function To_Unbounded_String (Length : Natural) return Unbounded_String; function To_String (Source : Unbounded_String) return String; procedure Set_Unbounded_String (Target : out Unbounded_String; Source : String); pragma Ada_05 (Set_Unbounded_String); procedure Append (Source : in out Unbounded_String; New_Item : Unbounded_String); procedure Append (Source : in out Unbounded_String; New_Item : String); procedure Append (Source : in out Unbounded_String; New_Item : Character); function "&" (Left : Unbounded_String; Right : Unbounded_String) return Unbounded_String; function "&" (Left : Unbounded_String; Right : String) return Unbounded_String; function "&" (Left : String; Right : Unbounded_String) return Unbounded_String; function "&" (Left : Unbounded_String; Right : Character) return Unbounded_String; function "&" (Left : Character; Right : Unbounded_String) return Unbounded_String; function Element (Source : Unbounded_String; Index : Positive) return Character; procedure Replace_Element (Source : in out Unbounded_String; Index : Positive; By : Character); function Slice (Source : Unbounded_String; Low : Positive; High : Natural) return String; function Unbounded_Slice (Source : Unbounded_String; Low : Positive; High : Natural) return Unbounded_String; pragma Ada_05 (Unbounded_Slice); procedure Unbounded_Slice (Source : Unbounded_String; Target : out Unbounded_String; Low : Positive; High : Natural); pragma Ada_05 (Unbounded_Slice); function "=" (Left : Unbounded_String; Right : Unbounded_String) return Boolean; function "=" (Left : Unbounded_String; Right : String) return Boolean; function "=" (Left : String; Right : Unbounded_String) return Boolean; function "<" (Left : Unbounded_String; Right : Unbounded_String) return Boolean; function "<" (Left : Unbounded_String; Right : String) return Boolean; function "<" (Left : String; Right : Unbounded_String) return Boolean; function "<=" (Left : Unbounded_String; Right : Unbounded_String) return Boolean; function "<=" (Left : Unbounded_String; Right : String) return Boolean; function "<=" (Left : String; Right : Unbounded_String) return Boolean; function ">" (Left : Unbounded_String; Right : Unbounded_String) return Boolean; function ">" (Left : Unbounded_String; Right : String) return Boolean; function ">" (Left : String; Right : Unbounded_String) return Boolean; function ">=" (Left : Unbounded_String; Right : Unbounded_String) return Boolean; function ">=" (Left : Unbounded_String; Right : String) return Boolean; function ">=" (Left : String; Right : Unbounded_String) return Boolean; ------------------------ -- Search Subprograms -- ------------------------ function Index (Source : Unbounded_String; Pattern : String; Going : Direction := Forward; Mapping : Maps.Character_Mapping := Maps.Identity) return Natural; function Index (Source : Unbounded_String; Pattern : String; Going : Direction := Forward; Mapping : Maps.Character_Mapping_Function) return Natural; function Index (Source : Unbounded_String; Set : Maps.Character_Set; Test : Membership := Inside; Going : Direction := Forward) return Natural; function Index (Source : Unbounded_String; Pattern : String; From : Positive; Going : Direction := Forward; Mapping : Maps.Character_Mapping := Maps.Identity) return Natural; pragma Ada_05 (Index); function Index (Source : Unbounded_String; Pattern : String; From : Positive; Going : Direction := Forward; Mapping : Maps.Character_Mapping_Function) return Natural; pragma Ada_05 (Index); function Index (Source : Unbounded_String; Set : Maps.Character_Set; From : Positive; Test : Membership := Inside; Going : Direction := Forward) return Natural; pragma Ada_05 (Index); function Index_Non_Blank (Source : Unbounded_String; Going : Direction := Forward) return Natural; function Index_Non_Blank (Source : Unbounded_String; From : Positive; Going : Direction := Forward) return Natural; pragma Ada_05 (Index_Non_Blank); function Count (Source : Unbounded_String; Pattern : String; Mapping : Maps.Character_Mapping := Maps.Identity) return Natural; function Count (Source : Unbounded_String; Pattern : String; Mapping : Maps.Character_Mapping_Function) return Natural; function Count (Source : Unbounded_String; Set : Maps.Character_Set) return Natural; procedure Find_Token (Source : Unbounded_String; Set : Maps.Character_Set; From : Positive; Test : Membership; First : out Positive; Last : out Natural); pragma Ada_2012 (Find_Token); procedure Find_Token (Source : Unbounded_String; Set : Maps.Character_Set; Test : Membership; First : out Positive; Last : out Natural); ------------------------------------ -- String Translation Subprograms -- ------------------------------------ function Translate (Source : Unbounded_String; Mapping : Maps.Character_Mapping) return Unbounded_String; procedure Translate (Source : in out Unbounded_String; Mapping : Maps.Character_Mapping); function Translate (Source : Unbounded_String; Mapping : Maps.Character_Mapping_Function) return Unbounded_String; procedure Translate (Source : in out Unbounded_String; Mapping : Maps.Character_Mapping_Function); --------------------------------------- -- String Transformation Subprograms -- --------------------------------------- function Replace_Slice (Source : Unbounded_String; Low : Positive; High : Natural; By : String) return Unbounded_String; procedure Replace_Slice (Source : in out Unbounded_String; Low : Positive; High : Natural; By : String); function Insert (Source : Unbounded_String; Before : Positive; New_Item : String) return Unbounded_String; procedure Insert (Source : in out Unbounded_String; Before : Positive; New_Item : String); function Overwrite (Source : Unbounded_String; Position : Positive; New_Item : String) return Unbounded_String; procedure Overwrite (Source : in out Unbounded_String; Position : Positive; New_Item : String); function Delete (Source : Unbounded_String; From : Positive; Through : Natural) return Unbounded_String; procedure Delete (Source : in out Unbounded_String; From : Positive; Through : Natural); function Trim (Source : Unbounded_String; Side : Trim_End) return Unbounded_String; procedure Trim (Source : in out Unbounded_String; Side : Trim_End); function Trim (Source : Unbounded_String; Left : Maps.Character_Set; Right : Maps.Character_Set) return Unbounded_String; procedure Trim (Source : in out Unbounded_String; Left : Maps.Character_Set; Right : Maps.Character_Set); function Head (Source : Unbounded_String; Count : Natural; Pad : Character := Space) return Unbounded_String; procedure Head (Source : in out Unbounded_String; Count : Natural; Pad : Character := Space); function Tail (Source : Unbounded_String; Count : Natural; Pad : Character := Space) return Unbounded_String; procedure Tail (Source : in out Unbounded_String; Count : Natural; Pad : Character := Space); function "*" (Left : Natural; Right : Character) return Unbounded_String; function "*" (Left : Natural; Right : String) return Unbounded_String; function "*" (Left : Natural; Right : Unbounded_String) return Unbounded_String; private pragma Inline (Length); package AF renames Ada.Finalization; type Shared_String (Max_Length : Natural) is limited record Counter : System.Atomic_Counters.Atomic_Counter; -- Reference counter Last : Natural := 0; Data : String (1 .. Max_Length); -- Last is the index of last significant element of the Data. All -- elements with larger indexes are currently insignificant. end record; type Shared_String_Access is access all Shared_String; procedure Reference (Item : not null Shared_String_Access); -- Increment reference counter procedure Unreference (Item : not null Shared_String_Access); -- Decrement reference counter, deallocate Item when counter goes to zero function Can_Be_Reused (Item : not null Shared_String_Access; Length : Natural) return Boolean; -- Returns True if Shared_String can be reused. There are two criteria when -- Shared_String can be reused: its reference counter must be one (thus -- Shared_String is owned exclusively) and its size is sufficient to -- store string with specified length effectively. function Allocate (Max_Length : Natural) return not null Shared_String_Access; -- Allocates new Shared_String with at least specified maximum length. -- Actual maximum length of the allocated Shared_String can be slightly -- greater. Returns reference to Empty_Shared_String when requested length -- is zero. Empty_Shared_String : aliased Shared_String (0); function To_Unbounded (S : String) return Unbounded_String renames To_Unbounded_String; -- This renames are here only to be used in the pragma Stream_Convert type Unbounded_String is new AF.Controlled with record Reference : not null Shared_String_Access := Empty_Shared_String'Access; end record; pragma Stream_Convert (Unbounded_String, To_Unbounded, To_String); -- Provide stream routines without dragging in Ada.Streams pragma Finalize_Storage_Only (Unbounded_String); -- Finalization is required only for freeing storage overriding procedure Initialize (Object : in out Unbounded_String); overriding procedure Adjust (Object : in out Unbounded_String); overriding procedure Finalize (Object : in out Unbounded_String); pragma Inline (Initialize, Adjust); Null_Unbounded_String : constant Unbounded_String := (AF.Controlled with Reference => Empty_Shared_String'Access); end Ada.Strings.Unbounded;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . W C H _ C N V -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2019, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package contains generic subprograms used for converting between -- sequences of Character and Wide_Character. Wide_Wide_Character values -- are also handled, but represented using integer range types defined in -- this package, so that this package can be used from applications that -- are restricted to Ada 95 compatibility (such as the compiler itself). -- All the algorithms for encoding and decoding are isolated in this package -- and in System.WCh_JIS and should not be duplicated elsewhere. The only -- exception to this is that GNAT.Decode_String and GNAT.Encode_String have -- their own circuits for UTF-8 conversions, for improved efficiency. -- This unit may be used directly from an application program by providing -- an appropriate WITH, and the interface can be expected to remain stable. pragma Compiler_Unit_Warning; with System.WCh_Con; package System.WCh_Cnv is pragma Pure; type UTF_32_Code is range 0 .. 16#7FFF_FFFF#; for UTF_32_Code'Size use 32; -- Range of allowed UTF-32 encoding values type UTF_32_String is array (Positive range <>) of UTF_32_Code; generic with function In_Char return Character; function Char_Sequence_To_Wide_Char (C : Character; EM : System.WCh_Con.WC_Encoding_Method) return Wide_Character; -- C is the first character of a sequence of one or more characters which -- represent a wide character sequence. Calling the function In_Char for -- additional characters as required, Char_To_Wide_Char returns the -- corresponding wide character value. Constraint_Error is raised if the -- sequence of characters encountered is not a valid wide character -- sequence for the given encoding method. -- -- Note on the use of brackets encoding (WCEM_Brackets). The brackets -- encoding method is ambiguous in the context of this function, since -- there is no way to tell if ["1234"] is eight unencoded characters or -- one encoded character. In the context of Ada sources, any sequence -- starting [" must be the start of an encoding (since that sequence is -- not valid in Ada source otherwise). The routines in this package use -- the same approach. If the input string contains the sequence [" then -- this is assumed to be the start of a brackets encoding sequence, and -- if it does not match the syntax, an error is raised. generic with function In_Char return Character; function Char_Sequence_To_UTF_32 (C : Character; EM : System.WCh_Con.WC_Encoding_Method) return UTF_32_Code; -- This is similar to the above, but the function returns a code from -- the full UTF_32 code set, which covers the full range of possible -- values in Wide_Wide_Character. The result can be converted to -- Wide_Wide_Character form using Wide_Wide_Character'Val. generic with procedure Out_Char (C : Character); procedure Wide_Char_To_Char_Sequence (WC : Wide_Character; EM : System.WCh_Con.WC_Encoding_Method); -- Given a wide character, converts it into a sequence of one or -- more characters, calling the given Out_Char procedure for each. -- Constraint_Error is raised if the given wide character value is -- not a valid value for the given encoding method. -- -- Note on brackets encoding (WCEM_Brackets). For the input routines above, -- upper half characters can be represented as ["hh"] but this procedure -- will only use brackets encodings for codes higher than 16#FF#, so upper -- half characters will be output as single Character values. generic with procedure Out_Char (C : Character); procedure UTF_32_To_Char_Sequence (Val : UTF_32_Code; EM : System.WCh_Con.WC_Encoding_Method); -- This is similar to the above, but the input value is a code from the -- full UTF_32 code set, which covers the full range of possible values -- in Wide_Wide_Character. To convert a Wide_Wide_Character value, the -- caller can use Wide_Wide_Character'Pos in the call. end System.WCh_Cnv;
with DDS.Typed_DataWriter_Generic; with DDS.Typed_DataReader_Generic; with DDS.Entity_Impl; with DDS.Topic; with DDS.DomainParticipant; with DDS.Publisher; with DDS.Subscriber; generic with package Request_DataReaders is new DDS.Typed_DataReader_Generic (<>); with package Reply_DataWriters is new DDS.Typed_DataWriter_Generic (<>); package Dds.Request_Reply.Reply_Generic is type ReplierListener is interface; type ReplierListener_Access is access all ReplierListener'Class; function On_Request (Self : in out ReplierListener; Request_Data : Request_DataReaders.Treats.Data_Type) return Reply_DataWriters.Treats.Data_Type is abstract; type Ref is limited new Dds.Entity_Impl.Ref and Dds.Request_Reply.Ref with private; type Ref_Access is access all Ref'Class; generic Service_Name : Standard.String := ""; Request_Topic_Name : Standard.String := ""; Reply_Topic_Name : Standard.String := ""; package TopicReplier is type TopicReplierListener is interface and ReplierListener; function On_Request (Self : in out TopicReplierListener; Request_Data : Request_DataReaders.Treats.Data_Type) return Reply_DataWriters.Treats.Data_Type is abstract; end TopicReplier; function Create (Participant : DDS.DomainParticipant.Ref_Access; Service_Name : DDS.String; Datawriter_Qos : DDS.DataWriterQoS := DDS.Publisher.DATAWRITER_QOS_DEFAULT; Datareader_Qos : DDS.DataReaderQoS := DDS.Subscriber.DATAREADER_QOS_DEFAULT; Listener : ReplierListener_Access := null) return Ref_Access; function Create (Participant : DDS.DomainParticipant.Ref_Access; Service_Name : DDS.String; Datawriter_Qos : DDS.String; Datareader_Qos : DDS.String; Listener : ReplierListener_Access := null) return Ref_Access; function Create (Participant : DDS.DomainParticipant.Ref_Access; Service_Name : DDS.String; Request_Topic_Name : DDS.String; Reply_Topic_Name : DDS.String; Publisher : DDS.Publisher.Ref_Access; Subscriber : DDS.Subscriber.Ref_Access; Listener : ReplierListener_Access := null) return Ref_Access; function Create (Participant : DDS.DomainParticipant.Ref_Access; Service_Name : DDS.String; Request_Topic_Name : DDS.String; Reply_Topic_Name : DDS.String; Qos_Library_Name : DDS.String; Qos_Profile_Name : DDS.String; Publisher : DDS.Publisher.Ref_Access; Subscriber : DDS.Subscriber.Ref_Access; Listener : ReplierListener_access := null) return Ref_Access; function Take_Request (Self : not null access Ref; Requests : aliased Request_DataReaders.Treats.Data_Type; Sample_Info : not null access DDS.SampleInfo_Seq.Sequence) return DDS.ReturnCode_T; function Take_Request (Self : not null access Ref) return Request_DataReaders.Container'Class; function Take_Requests (Self : not null access Ref; Max_Request_Count : DDS.Long) return Request_DataReaders.Container'Class; function Read_Request (Self : not null access Ref; Requests : aliased Request_DataReaders.Treats.Data_Type; Sample_Info : not null access DDS.SampleInfo_Seq.Sequence) return DDS.ReturnCode_T; function Read_Requests (Self : not null access Ref; Requests : not null Request_DataReaders.Treats.Data_Sequences.Sequence_Access; Sample_Info : not null access DDS.SampleInfo_Seq.Sequence; Max_Request_Count : DDS.Long) return DDS.ReturnCode_T; function Read_Requests (Self : not null access Ref; Max_Request_Count : DDS.Long := DDS.Long'Last) return Request_DataReaders.Container'Class; function Receive_Request (Self : not null access Ref; Request : access Request_DataReaders.Treats.Data_Type; Info_Seq : not null access DDS.SampleInfo_Seq.Sequence; Timeout : DDS.Duration_T) return DDS.ReturnCode_T; function Receive_Requests (Self : not null access Ref; Requests : not null Request_DataReaders.Treats.Data_Sequences.Sequence_Access; Sample_Info : not null access DDS.SampleInfo_Seq.Sequence; Min_Request_Count : Request_DataReaders.Treats.Index_Type; Max_Request_Count : Request_DataReaders.Treats.Index_Type; Timeout : DDS.Duration_T) return DDS.ReturnCode_T; function Receive_Requests (Self : not null access Ref; Min_Request_Count : Request_DataReaders.Treats.Index_Type; Max_Request_Count : Request_DataReaders.Treats.Index_Type; Timeout : DDS.Duration_T) return Request_DataReaders.Container'Class; procedure Send_Reply (Self : not null access Ref; Reply : access Reply_DataWriters.Treats.Data_Type; Related_Request_Info : DDS.SampleIdentity_T); procedure Send_Reply (Self : not null access Ref; Reply : access Reply_DataWriters.Treats.Data_Type; Related_Request_Info : DDS.SampleInfo); procedure Send_Reply (Self : not null access Ref; Reply : Reply_DataWriters.Treats.Data_Type; Related_Request_Info : DDS.SampleIdentity_T); procedure Send_Reply (Self : not null access Ref; Reply : Reply_DataWriters.Treats.Data_Type; Related_Request_Info : DDS.SampleInfo); procedure Send_Reply (Self : not null access Ref; Reply : Reply_DataWriters.Treats.Data_Array; Related_Request_Info : DDS.SampleIdentity_T); procedure Send_Reply (Self : not null access Ref; Reply : Reply_DataWriters.Treats.Data_Array; Related_Request_Info : DDS.SampleInfo); procedure Return_Loan (Self : not null access Ref; Requests : not null Reply_DataWriters.Treats.Data_Sequences.Sequence_Access; Sample_Info : DDS.SampleInfo_Seq.Sequence_Access); function Get_Request_DataReader (Self : not null access Ref) return Request_DataReaders.Ref_Access; function Get_Reply_DataWriter (Self : not null access Ref) return Reply_DataWriters.Ref_Access; private type Ref is limited new Dds.Entity_Impl.Ref and Dds.Request_Reply.Ref with record Request_Topic : DDS.Topic.Ref_Access; Reply_Topic : DDS.Topic.Ref_Access; Request_DataReader : Request_DataReaders.Ref_Access; Reply_DatWriter : Reply_DataWriters.Ref_Access; end record; end Dds.Request_Reply.Reply_Generic;
package FLTK.Widgets.Buttons.Light.Radio is type Radio_Light_Button is new Light_Button with private; type Radio_Light_Button_Reference (Data : not null access Radio_Light_Button'Class) is limited null record with Implicit_Dereference => Data; package Forge is function Create (X, Y, W, H : in Integer; Text : in String) return Radio_Light_Button; end Forge; procedure Draw (This : in out Radio_Light_Button); function Handle (This : in out Radio_Light_Button; Event : in Event_Kind) return Event_Outcome; private type Radio_Light_Button is new Light_Button with null record; overriding procedure Finalize (This : in out Radio_Light_Button); pragma Inline (Draw); pragma Inline (Handle); end FLTK.Widgets.Buttons.Light.Radio;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . I M G _ L L W -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2019, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with System.Unsigned_Types; use System.Unsigned_Types; package body System.Img_LLW is --------------------------------------- -- Set_Image_Width_Long_Long_Integer -- --------------------------------------- procedure Set_Image_Width_Long_Long_Integer (V : Long_Long_Integer; W : Integer; S : out String; P : in out Natural) is Start : Natural; begin -- Positive case can just use the unsigned circuit directly if V >= 0 then Set_Image_Width_Long_Long_Unsigned (Long_Long_Unsigned (V), W, S, P); -- Negative case has to set a minus sign. Note also that we have to be -- careful not to generate overflow with the largest negative number. else P := P + 1; S (P) := ' '; Start := P; declare pragma Suppress (Overflow_Check); pragma Suppress (Range_Check); begin Set_Image_Width_Long_Long_Unsigned (Long_Long_Unsigned (-V), W - 1, S, P); end; -- Set minus sign in last leading blank location. Because of the -- code above, there must be at least one such location. while S (Start + 1) = ' ' loop Start := Start + 1; end loop; S (Start) := '-'; end if; end Set_Image_Width_Long_Long_Integer; ---------------------------------------- -- Set_Image_Width_Long_Long_Unsigned -- ---------------------------------------- procedure Set_Image_Width_Long_Long_Unsigned (V : Long_Long_Unsigned; W : Integer; S : out String; P : in out Natural) is Start : constant Natural := P; F, T : Natural; procedure Set_Digits (T : Long_Long_Unsigned); -- Set digits of absolute value of T ---------------- -- Set_Digits -- ---------------- procedure Set_Digits (T : Long_Long_Unsigned) is begin if T >= 10 then Set_Digits (T / 10); P := P + 1; S (P) := Character'Val (T mod 10 + Character'Pos ('0')); else P := P + 1; S (P) := Character'Val (T + Character'Pos ('0')); end if; end Set_Digits; -- Start of processing for Set_Image_Width_Long_Long_Unsigned begin Set_Digits (V); -- Add leading spaces if required by width parameter if P - Start < W then F := P; P := P + (W - (P - Start)); T := P; while F > Start loop S (T) := S (F); T := T - 1; F := F - 1; end loop; for J in Start + 1 .. T loop S (J) := ' '; end loop; end if; end Set_Image_Width_Long_Long_Unsigned; end System.Img_LLW;
-- Mojang API -- No description provided (generated by Openapi Generator https://github.com/openapitools/openapi-generator) -- ------------ EDIT NOTE ------------ -- This file was generated with openapi-generator. You can modify it to implement -- the server. After you modify this file, you should add the following line -- to the .openapi-generator-ignore file: -- -- src/com-github-asyncmc-mojang-status-ada-server-model.ads -- -- Then, you can drop this edit note comment. -- ------------ EDIT NOTE ------------ package com.github is end com.github;
-- Standard Ada library specification -- Copyright (c) 2004-2016 AXE Consultants -- Copyright (c) 2004, 2005, 2006 Ada-Europe -- Copyright (c) 2000 The MITRE Corporation, Inc. -- Copyright (c) 1992, 1993, 1994, 1995 Intermetrics, Inc. -- SPDX-License-Identifier: BSD-3-Clause and LicenseRef-AdaReferenceManual --------------------------------------------------------------------------- package Ada.Locales is pragma Preelaborate(Locales); pragma Remote_Types(Locales); type Language_Code is new String (1 .. 3) with Dynamic_Predicate => (for all E of Language_Code => E in 'a' .. 'z'); type Country_Code is new String (1 .. 2) with Dynamic_Predicate => (for all E of Country_Code => E in 'A' .. 'Z'); Language_Unknown : constant Language_Code := "und"; Country_Unknown : constant Country_Code := "ZZ"; function Language return Language_Code; function Country return Country_Code; end Ada.Locales;
-- Copyright 2015-2017 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- This program is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. package body Pck is function Ident (R : Record_Type) return Record_Type is begin return R; end Ident; procedure Do_Nothing (A : System.Address) is begin null; end Do_Nothing; end Pck;
with AWS.Config; with AWS.Response; with AWS.Services.Dispatchers.URI; with AWS.Status; package @_Project_Name_@.Dispatchers is use AWS; procedure Initialize (Web_Config : in Config.Object); -- Initialize state in this package depending on the HTTP configuration. -- For example it sets the web root for all dispatchers. All resources -- (templates, images, CSS file...) will be searched under this root -- directory. ------------- -- Default -- ------------- type Default is new Services.Dispatchers.URI.Handler with private; -- Handle everything not covered by the other dispatchers (CSS, Image) overriding function Dispatch (Dispatcher : in Default; Request : in Status.Data) return Response.Data; --------- -- CSS -- --------- type CSS is new Services.Dispatchers.URI.Handler with private; overriding function Dispatch (Dispatcher : in CSS; Request : in Status.Data) return Response.Data; --------- -- JS -- --------- type JS is new Services.Dispatchers.URI.Handler with private; overriding function Dispatch (Dispatcher : in JS; Request : in Status.Data) return Response.Data; ----------- -- Image -- ----------- type Image is new Services.Dispatchers.URI.Handler with private; overriding function Dispatch (Dispatcher : in Image; Request : in Status.Data) return Response.Data; private type Default is new Services.Dispatchers.URI.Handler with null record; type CSS is new Services.Dispatchers.URI.Handler with null record; type JS is new Services.Dispatchers.URI.Handler with null record; type Image is new Services.Dispatchers.URI.Handler with null record; end @_Project_Name_@.Dispatchers;
------------------------------------------------------------------------------ -- -- -- GNAT ncurses Binding Samples -- -- -- -- Sample.Menu_Demo -- -- -- -- B O D Y -- -- -- ------------------------------------------------------------------------------ -- Copyright (c) 1998-2004,2008 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.18 $ -- $Date: 2008/07/26 18:48:30 $ -- Binding Version 01.00 ------------------------------------------------------------------------------ with Terminal_Interface.Curses; use Terminal_Interface.Curses; with Terminal_Interface.Curses.Panels; use Terminal_Interface.Curses.Panels; with Terminal_Interface.Curses.Menus; use Terminal_Interface.Curses.Menus; with Terminal_Interface.Curses.Menus.Menu_User_Data; with Terminal_Interface.Curses.Menus.Item_User_Data; with Sample.Manifest; use Sample.Manifest; with Sample.Function_Key_Setting; use Sample.Function_Key_Setting; with Sample.Menu_Demo.Handler; with Sample.Helpers; use Sample.Helpers; with Sample.Explanation; use Sample.Explanation; package body Sample.Menu_Demo is package Spacing_Demo is procedure Spacing_Test; end Spacing_Demo; package body Spacing_Demo is procedure Spacing_Test is function My_Driver (M : Menu; K : Key_Code; P : Panel) return Boolean; procedure Set_Option_Key; procedure Set_Select_Key; procedure Set_Description_Key; procedure Set_Hide_Key; package Mh is new Sample.Menu_Demo.Handler (My_Driver); I : Item_Array_Access := new Item_Array' (New_Item ("January", "31 Days"), New_Item ("February", "28/29 Days"), New_Item ("March", "31 Days"), New_Item ("April", "30 Days"), New_Item ("May", "31 Days"), New_Item ("June", "30 Days"), New_Item ("July", "31 Days"), New_Item ("August", "31 Days"), New_Item ("September", "30 Days"), New_Item ("October", "31 Days"), New_Item ("November", "30 Days"), New_Item ("December", "31 Days"), Null_Item); M : Menu := New_Menu (I); Flip_State : Boolean := True; Hide_Long : Boolean := False; type Format_Code is (Four_By_1, Four_By_2, Four_By_3); type Operations is (Flip, Reorder, Reformat, Reselect, Describe); type Change is array (Operations) of Boolean; pragma Pack (Change); No_Change : constant Change := Change'(others => False); Current_Format : Format_Code := Four_By_1; To_Change : Change := No_Change; function My_Driver (M : Menu; K : Key_Code; P : Panel) return Boolean is begin if M = Null_Menu then raise Menu_Exception; end if; if P = Null_Panel then raise Panel_Exception; end if; To_Change := No_Change; if K in User_Key_Code'Range then if K = QUIT then return True; end if; end if; if K in Special_Key_Code'Range then case K is when Key_F4 => To_Change (Flip) := True; return True; when Key_F5 => To_Change (Reformat) := True; Current_Format := Four_By_1; return True; when Key_F6 => To_Change (Reformat) := True; Current_Format := Four_By_2; return True; when Key_F7 => To_Change (Reformat) := True; Current_Format := Four_By_3; return True; when Key_F8 => To_Change (Reorder) := True; return True; when Key_F9 => To_Change (Reselect) := True; return True; when Key_F10 => if Current_Format /= Four_By_3 then To_Change (Describe) := True; return True; else return False; end if; when Key_F11 => Hide_Long := not Hide_Long; declare O : Item_Option_Set; begin for J in I'Range loop Get_Options (I (J), O); O.Selectable := True; if Hide_Long then case J is when 1 | 3 | 5 | 7 | 8 | 10 | 12 => O.Selectable := False; when others => null; end case; end if; Set_Options (I (J), O); end loop; end; return False; when others => null; end case; end if; return False; end My_Driver; procedure Set_Option_Key is O : Menu_Option_Set; begin if Current_Format = Four_By_1 then Set_Soft_Label_Key (8, ""); else Get_Options (M, O); if O.Row_Major_Order then Set_Soft_Label_Key (8, "O-Col"); else Set_Soft_Label_Key (8, "O-Row"); end if; end if; Refresh_Soft_Label_Keys_Without_Update; end Set_Option_Key; procedure Set_Select_Key is O : Menu_Option_Set; begin Get_Options (M, O); if O.One_Valued then Set_Soft_Label_Key (9, "Multi"); else Set_Soft_Label_Key (9, "Singl"); end if; Refresh_Soft_Label_Keys_Without_Update; end Set_Select_Key; procedure Set_Description_Key is O : Menu_Option_Set; begin if Current_Format = Four_By_3 then Set_Soft_Label_Key (10, ""); else Get_Options (M, O); if O.Show_Descriptions then Set_Soft_Label_Key (10, "-Desc"); else Set_Soft_Label_Key (10, "+Desc"); end if; end if; Refresh_Soft_Label_Keys_Without_Update; end Set_Description_Key; procedure Set_Hide_Key is begin if Hide_Long then Set_Soft_Label_Key (11, "Enab"); else Set_Soft_Label_Key (11, "Disab"); end if; Refresh_Soft_Label_Keys_Without_Update; end Set_Hide_Key; begin Push_Environment ("MENU01"); Notepad ("MENU-PAD01"); Default_Labels; Set_Soft_Label_Key (4, "Flip"); Set_Soft_Label_Key (5, "4x1"); Set_Soft_Label_Key (6, "4x2"); Set_Soft_Label_Key (7, "4x3"); Set_Option_Key; Set_Select_Key; Set_Description_Key; Set_Hide_Key; Set_Format (M, 4, 1); loop Mh.Drive_Me (M); exit when To_Change = No_Change; if To_Change (Flip) then if Flip_State then Flip_State := False; Set_Spacing (M, 3, 2, 0); else Flip_State := True; Set_Spacing (M); end if; elsif To_Change (Reformat) then case Current_Format is when Four_By_1 => Set_Format (M, 4, 1); when Four_By_2 => Set_Format (M, 4, 2); when Four_By_3 => declare O : Menu_Option_Set; begin Get_Options (M, O); O.Show_Descriptions := False; Set_Options (M, O); Set_Format (M, 4, 3); end; end case; Set_Option_Key; Set_Description_Key; elsif To_Change (Reorder) then declare O : Menu_Option_Set; begin Get_Options (M, O); O.Row_Major_Order := not O.Row_Major_Order; Set_Options (M, O); Set_Option_Key; end; elsif To_Change (Reselect) then declare O : Menu_Option_Set; begin Get_Options (M, O); O.One_Valued := not O.One_Valued; Set_Options (M, O); Set_Select_Key; end; elsif To_Change (Describe) then declare O : Menu_Option_Set; begin Get_Options (M, O); O.Show_Descriptions := not O.Show_Descriptions; Set_Options (M, O); Set_Description_Key; end; else null; end if; end loop; Set_Spacing (M); Pop_Environment; pragma Assert (Get_Index (Items (M, 1)) = Get_Index (I (1))); Delete (M); Free (I, True); end Spacing_Test; end Spacing_Demo; procedure Demo is -- We use this datatype only to test the instantiation of -- the Menu_User_Data generic package. No functionality -- behind it. type User_Data is new Integer; type User_Data_Access is access User_Data; -- Those packages are only instantiated to test the usability. -- No real functionality is shown in the demo. package MUD is new Menu_User_Data (User_Data, User_Data_Access); package IUD is new Item_User_Data (User_Data, User_Data_Access); function My_Driver (M : Menu; K : Key_Code; P : Panel) return Boolean; package Mh is new Sample.Menu_Demo.Handler (My_Driver); Itm : Item_Array_Access := new Item_Array' (New_Item ("Menu Layout Options"), New_Item ("Demo of Hook functions"), Null_Item); M : Menu := New_Menu (Itm); U1 : constant User_Data_Access := new User_Data'(4711); U2 : User_Data_Access; U3 : constant User_Data_Access := new User_Data'(4712); U4 : User_Data_Access; function My_Driver (M : Menu; K : Key_Code; P : Panel) return Boolean is Idx : constant Positive := Get_Index (Current (M)); begin if K in User_Key_Code'Range then if K = QUIT then return True; elsif K = SELECT_ITEM then if Idx in Itm'Range then Hide (P); Update_Panels; end if; case Idx is when 1 => Spacing_Demo.Spacing_Test; when others => Not_Implemented; end case; if Idx in Itm'Range then Top (P); Show (P); Update_Panels; Update_Screen; end if; end if; end if; return False; end My_Driver; begin Push_Environment ("MENU00"); Notepad ("MENU-PAD00"); Default_Labels; Refresh_Soft_Label_Keys_Without_Update; Set_Pad_Character (M, '|'); MUD.Set_User_Data (M, U1); IUD.Set_User_Data (Itm (1), U3); Mh.Drive_Me (M); MUD.Get_User_Data (M, U2); pragma Assert (U1 = U2 and U1.all = 4711); IUD.Get_User_Data (Itm (1), U4); pragma Assert (U3 = U4 and U3.all = 4712); Pop_Environment; Delete (M); Free (Itm, True); end Demo; end Sample.Menu_Demo;
package body AdaM.Assist.Query.find_Entities.Actuals_for_traversing is ------------- -- Post_Op -- ------------- procedure Post_Op (Element : Asis.Element; Control : in out Asis.Traverse_Control; State : in out Traversal_State) is separate; ------------ -- Pre_Op -- ------------ procedure Pre_Op (Element : Asis.Element; Control : in out Asis.Traverse_Control; State : in out Traversal_State) is separate; end AdaM.Assist.Query.find_Entities.Actuals_for_traversing;
-- Copyright 2015,2016 Steven Stewart-Gallus -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or -- implied. See the License for the specific language governing -- permissions and limitations under the License. with Interfaces.C; with System; with Linted.Errors; with Linted.KOs; package Linted.Stdio is pragma Elaborate_Body; procedure Write_Line (Object : Linted.KOs.KO; Str : String); procedure Write_String (Object : Linted.KOs.KO; Str : String; Err : out Linted.Errors.Error); procedure Write (Object : Linted.KOs.KO; Buf : System.Address; Count : Interfaces.C.size_t; Bytes_Written : out Interfaces.C.size_t; Err : out Linted.Errors.Error); end Linted.Stdio;
package COBS.Queue with Preelaborate is end COBS.Queue;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- G N A T . W I D E _W I D E _ S P E L L I N G _ C H E C K E R -- -- -- -- B o d y -- -- -- -- Copyright (C) 1998-2020, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with GNAT.Spelling_Checker_Generic; package body GNAT.Wide_Wide_Spelling_Checker is function IBS is new GNAT.Spelling_Checker_Generic.Is_Bad_Spelling_Of (Wide_Wide_Character, Wide_Wide_String); ------------------------ -- Is_Bad_Spelling_Of -- ------------------------ function Is_Bad_Spelling_Of (Found : Wide_Wide_String; Expect : Wide_Wide_String) return Boolean renames IBS; end GNAT.Wide_Wide_Spelling_Checker;
-- 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/>. with System; package Pck is type Time_T is record Secs : Integer; end record; procedure Do_Nothing (A : System.Address); end Pck;
-- -- This package provides few handlers for common types: strings, -- integers and float. A separate package provides a generic -- handler for enumerative types. -- package Line_Parsers.Receivers is type String_Receiver is new Abstract_Parameter_Handler with private; overriding function Is_Set(Handler: String_Receiver) return Boolean; overriding procedure Receive (Handler : in out String_Receiver; Name : String; Value : String; Position : Natural); overriding function Reusable(Handler: String_Receiver) return Boolean; function Value (Handler : String_Receiver) return String with Pre => Handler.Is_Set; type Integer_Receiver is new Abstract_Parameter_Handler with private; overriding function Is_Set (Handler : integer_Receiver) return Boolean; overriding procedure Receive (Handler : in out Integer_Receiver; Name : String; Value : String; Position : Natural); overriding function Reusable (Handler : Integer_Receiver) return Boolean; function Get (Handler : Integer_Receiver) return Integer with Pre => Handler.Is_Set; type Float_Receiver is new Abstract_Parameter_Handler with private; overriding function Is_Set (Handler : Float_Receiver) return Boolean; procedure Receive (Handler : in out Float_Receiver; Name : String; Value : String; Position : Natural); function Get (Handler : Float_Receiver) return Float with Pre => Handler.Is_Set; overriding function Reusable(Handler: Float_Receiver) return Boolean; private type String_Receiver is new Abstract_Parameter_Handler with record Set : Boolean := False; Value : Unbounded_String; end record; function Is_Set (Handler : String_Receiver) return Boolean is (Handler.Set); function Value (Handler : String_Receiver) return String is (To_String (Handler.Value)); function Reusable(Handler: String_Receiver) return Boolean is (False); type Integer_Receiver is new Abstract_Parameter_Handler with record Set : Boolean := False; Value : Integer; end record; function Is_Set (Handler : Integer_Receiver) return Boolean is (Handler.Set); function Get (Handler : Integer_Receiver) return Integer is (Handler.Value); function Reusable(Handler: Integer_Receiver) return Boolean is (False); type Float_Receiver is new Abstract_Parameter_Handler with record Set : Boolean := False; Value : Float; end record; function Is_Set (Handler : Float_Receiver) return Boolean is (Handler.Set); function Get (Handler : Float_Receiver) return Float is (Handler.Value); function Reusable(Handler: Float_Receiver) return Boolean is (False); end Line_Parsers.Receivers;
------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- ADA.STRINGS.BOUNDED.LESS_CASE_INSENSITIVE -- -- -- -- B o d y -- -- -- -- Copyright (C) 2011-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/>. -- -- -- -- This unit was originally developed by Matthew J Heaney. -- ------------------------------------------------------------------------------ with Ada.Strings.Less_Case_Insensitive; function Ada.Strings.Bounded.Less_Case_Insensitive (Left, Right : Bounded.Bounded_String) return Boolean is begin return Ada.Strings.Less_Case_Insensitive (Left => Bounded.To_String (Left), Right => Bounded.To_String (Right)); end Ada.Strings.Bounded.Less_Case_Insensitive;
with Ada.Streams; use Ada.Streams; package Lto11 is type Vector is array (Positive range <>) of Float; procedure Write (S : not null access Root_Stream_Type'Class; V : Vector); end Lto11;
----------------------------------------------------------------------- -- volume - A simple bean example -- Copyright (C) 2010, 2011 Stephane Carrez -- Written by Stephane Carrez (Stephane.Carrez@gmail.com) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Ada.Strings.Unbounded; with Util.Beans.Objects; with Util.Beans.Basic; with Util.Beans.Methods; with ASF.Components.Base; with ASF.Contexts.Faces; with ASF.Converters; package Volume is type My_Float is delta 0.01 digits 10; type Compute_Bean is new Util.Beans.Basic.Bean and Util.Beans.Methods.Method_Bean with record Height : My_Float := -1.0; Radius : My_Float := -1.0; Volume : My_Float := -1.0; end record; -- Get the value identified by the name. function Get_Value (From : Compute_Bean; Name : String) return Util.Beans.Objects.Object; -- Set the value identified by the name. procedure Set_Value (From : in out Compute_Bean; Name : in String; Value : in Util.Beans.Objects.Object); -- Compute the volume of the cylinder. procedure Run (From : in out Compute_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); -- This bean provides some methods that can be used in a Method_Expression overriding function Get_Method_Bindings (From : in Compute_Bean) return Util.Beans.Methods.Method_Binding_Array_Access; type Float_Converter is new ASF.Converters.Converter with null record; overriding function To_String (Convert : in Float_Converter; Context : in ASF.Contexts.Faces.Faces_Context'Class; Component : in ASF.Components.Base.UIComponent'Class; Value : in Util.Beans.Objects.Object) return String; overriding function To_Object (Convert : in Float_Converter; Context : in ASF.Contexts.Faces.Faces_Context'Class; Component : in ASF.Components.Base.UIComponent'Class; Value : in String) return Util.Beans.Objects.Object; end Volume;
-- C35507C.ADA -- Grant of Unlimited Rights -- -- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687, -- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained -- unlimited rights in the software and documentation contained herein. -- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making -- this public release, the Government intends to confer upon all -- recipients unlimited rights equal to those held by the Government. -- These rights include rights to use, duplicate, release or disclose the -- released technical data and computer software in whole or in part, in -- any manner and for any purpose whatsoever, and to have or permit others -- to do so. -- -- DISCLAIMER -- -- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR -- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED -- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE -- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE -- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A -- PARTICULAR PURPOSE OF SAID MATERIAL. --* -- OBJECTIVE: -- CHECK THAT THE ATTRIBUTES 'IMAGE' AND 'VALUE' YIELD THE CORRECT -- RESULTS WHEN THE PREFIX IS A CHARACTER TYPE. -- SUBTESTS ARE: -- (A). TESTS FOR IMAGE. -- (B). TESTS FOR VALUE. -- HISTORY: -- RJW 05/29/86 CREATED ORIGINAL TEST. -- BCB 08/18/87 CHANGED HEADER TO STANDARD HEADER FORMAT. -- CORRECTED ERROR MESSAGES AND ADDED CALLS TO -- IDENT_STR. WITH REPORT; USE REPORT; PROCEDURE C35507C IS TYPE CHAR IS ('A', 'a'); TYPE NEWCHAR IS NEW CHAR; FUNCTION IDENT (CH : CHAR) RETURN CHAR IS BEGIN RETURN CHAR'VAL (IDENT_INT (CHAR'POS (CH))); END IDENT; FUNCTION IDENT (CH : NEWCHAR) RETURN NEWCHAR IS BEGIN RETURN NEWCHAR'VAL (IDENT_INT (NEWCHAR'POS (CH))); END IDENT; PROCEDURE CHECK_BOUND (STR1, STR2 : STRING) IS BEGIN IF STR1'FIRST /= 1 THEN FAILED ( "INCORRECT LOWER BOUND FOR " & STR2 & "'IMAGE ('" & STR1 & "')" ); END IF; END CHECK_BOUND; BEGIN TEST( "C35507C" , "CHECK THAT THE ATTRIBUTES 'IMAGE' AND " & "'VALUE' YIELD THE CORRECT RESULTS WHEN THE " & "PREFIX IS A CHARACTER TYPE" ); BEGIN -- (A). IF CHAR'IMAGE ('A') /= "'A'" THEN FAILED ( "INCORRECT IMAGE FOR CHAR'('A')" ); END IF; CHECK_BOUND (CHAR'IMAGE ('A'), "CHAR"); IF CHAR'IMAGE ('a') /= "'a'" THEN FAILED ( "INCORRECT IMAGE FOR CHAR'('a')" ); END IF; CHECK_BOUND (CHAR'IMAGE ('a'), "CHAR"); IF NEWCHAR'IMAGE ('A') /= "'A'" THEN FAILED ( "INCORRECT IMAGE FOR NEWCHAR'('A')" ); END IF; CHECK_BOUND (NEWCHAR'IMAGE ('A'), "NEWCHAR"); IF NEWCHAR'IMAGE ('a') /= "'a'" THEN FAILED ( "INCORRECT IMAGE FOR NEWCHAR'('a')" ); END IF; CHECK_BOUND (NEWCHAR'IMAGE ('a'), "NEWCHAR"); IF CHAR'IMAGE (IDENT ('A')) /= "'A'" THEN FAILED ( "INCORRECT IMAGE FOR CHAR'( IDENT ('A'))" ); END IF; CHECK_BOUND (CHAR'IMAGE (IDENT ('A')), "IDENT OF CHAR"); IF CHAR'IMAGE (IDENT ('a')) /= "'a'" THEN FAILED ( "INCORRECT IMAGE FOR CHAR'( IDENT ('a'))" ); END IF; CHECK_BOUND (CHAR'IMAGE (IDENT ('a')), "IDENT OF CHAR"); IF NEWCHAR'IMAGE (IDENT ('A')) /= "'A'" THEN FAILED ( "INCORRECT IMAGE FOR NEWCHAR'( IDENT ('A'))" ); END IF; CHECK_BOUND (NEWCHAR'IMAGE (IDENT ('A')), "IDENT OF NEWCHAR"); IF NEWCHAR'IMAGE (IDENT ('a')) /= "'a'" THEN FAILED ( "INCORRECT IMAGE FOR NEWCHAR'( IDENT ('a'))" ); END IF; CHECK_BOUND (NEWCHAR'IMAGE (IDENT ('a')), "IDENT OF NEWCHAR"); FOR CH IN CHARACTER'VAL (32) .. CHARACTER'VAL (126) LOOP IF CHARACTER'IMAGE (CH) /= ("'" & CH) & "'" THEN FAILED ( "INCORRECT IMAGE FOR CHARACTER'(" & CH & ")" ); END IF; CHECK_BOUND (CHARACTER'IMAGE (CH), "CHARACTER"); END LOOP; FOR CH IN CHARACTER'VAL (0) .. CHARACTER'VAL (31) LOOP CHECK_BOUND (CHARACTER'IMAGE (CH), "CHARACTER"); END LOOP; CHECK_BOUND (CHARACTER'IMAGE (CHARACTER'VAL (127)), "CHARACTER"); END; --------------------------------------------------------------- DECLARE -- (B). SUBTYPE SUBCHAR IS CHARACTER RANGE CHARACTER'VAL (127) .. CHARACTER'VAL (127); BEGIN FOR CH IN CHARACTER'VAL (32) .. CHARACTER'VAL (126) LOOP IF SUBCHAR'VALUE (("'" & CH) & "'") /= CH THEN FAILED ( "INCORRECT SUBCHAR'VALUE FOR " & CH ); END IF; END LOOP; FOR CH IN CHARACTER'VAL (0) .. CHARACTER'VAL (31) LOOP IF SUBCHAR'VALUE (CHARACTER'IMAGE (CH)) /= CH THEN FAILED ( "INCORRECT SUBCHAR'VALUE FOR " & CHARACTER'IMAGE (CH) ); END IF; END LOOP; IF SUBCHAR'VALUE (CHARACTER'IMAGE (CHARACTER'VAL (127))) /= CHARACTER'VAL (127) THEN FAILED ( "INCORRECT SUBCHAR'VALUE FOR " & "CHARACTER'VAL (127)" ); END IF; END; BEGIN IF CHAR'VALUE ("'A'") /= 'A' THEN FAILED ( "INCORRECT VALUE FOR CHAR'(""'A'"")" ); END IF; IF CHAR'VALUE ("'a'") /= 'a' THEN FAILED ( "INCORRECT VALUE FOR CHAR'(""'a'"")" ); END IF; IF NEWCHAR'VALUE ("'A'") /= 'A' THEN FAILED ( "INCORRECT VALUE FOR NEWCHAR'(""'A'"")" ); END IF; IF NEWCHAR'VALUE ("'a'") /= 'a' THEN FAILED ( "INCORRECT VALUE FOR NEWCHAR'(""'a'"")" ); END IF; END; BEGIN IF CHAR'VALUE (IDENT_STR("'A'")) /= 'A' THEN FAILED ( "INCORRECT VALUE FOR CHAR'(IDENT_STR" & "(""'A'""))" ); END IF; IF CHAR'VALUE (IDENT_STR("'a'")) /= 'a' THEN FAILED ( "INCORRECT VALUE FOR CHAR'(IDENT_STR" & "(""'a'""))" ); END IF; IF NEWCHAR'VALUE (IDENT_STR("'A'")) /= 'A' THEN FAILED ( "INCORRECT VALUE FOR NEWCHAR'(IDENT_STR" & "(""'A'""))" ); END IF; IF NEWCHAR'VALUE (IDENT_STR("'a'")) /= 'a' THEN FAILED ( "INCORRECT VALUE FOR NEWCHAR'(IDENT_STR" & "(""'a'""))" ); END IF; END; BEGIN IF CHAR'VALUE (IDENT_STR ("'B'")) = 'A' THEN FAILED ( "NO EXCEPTION RAISED " & "FOR CHAR'VALUE (IDENT_STR (""'B'"")) - 1" ); ELSE FAILED ( "NO EXCEPTION RAISED " & "FOR CHAR'VALUE (IDENT_STR (""'B'"")) - 2" ); END IF; EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ( "WRONG EXCEPTION RAISED " & "FOR CHAR'VALUE (IDENT_STR (""'B'""))" ); END; BEGIN IF CHARACTER'VALUE (IDENT_CHAR (ASCII.HT) & "'A'") = 'A' THEN FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE " & "(IDENT_CHAR (ASCII.HT) & ""'A'"") - 1" ); ELSE FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE " & "(IDENT_CHAR (ASCII.HT) & ""'A'"") - 2" ); END IF; EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ( "WRONG EXCEPTION RAISED " & "FOR CHARACTER'VALUE " & "(IDENT_CHAR (ASCII.HT) & ""'A'"")" ); END; BEGIN IF CHARACTER'VALUE ("'B'" & IDENT_CHAR (ASCII.HT)) = 'B' THEN FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (""'B'"" & " & "IDENT_CHAR (ASCII.HT)) - 1" ); ELSE FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (""'B'"" & " & "IDENT_CHAR (ASCII.HT)) - 2" ); END IF; EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ( "WRONG EXCEPTION RAISED " & "FOR CHARACTER'VALUE (""'B'"" & " & "IDENT_CHAR (ASCII.HT)) " ); END; BEGIN IF CHARACTER'VALUE ("'C'" & IDENT_CHAR (ASCII.BEL)) = 'C' THEN FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (""'C'"" & " & "IDENT_CHAR (ASCII.BEL)) - 1" ); ELSE FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (""'C'"" & " & "IDENT_CHAR (ASCII.BEL)) - 2" ); END IF; EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ( "WRONG EXCEPTION RAISED " & "FOR CHARACTER'VALUE (""'C'"" & " & "IDENT_CHAR (ASCII.BEL))" ); END; BEGIN IF CHARACTER'VALUE (IDENT_STR ("'")) = ''' THEN FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (IDENT_STR (""'"")) - 1" ); ELSE FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (IDENT_STR (""'"")) - 2" ); END IF; EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ( "WRONG EXCEPTION RAISED " & "FOR CHARACTER'VALUE (IDENT_STR (""'""))" ); END; BEGIN IF CHARACTER'VALUE (IDENT_STR ("''")) = ''' THEN FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (IDENT_STR (""''"")) - 1" ); ELSE FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (IDENT_STR (""''"")) - 2" ); END IF; EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ( "WRONG EXCEPTION RAISED " & "FOR CHARACTER'VALUE (IDENT_STR (""''""))" ); END; BEGIN IF CHARACTER'VALUE (IDENT_STR ("'A")) = 'A' THEN FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (IDENT_STR (""'A"")) - 1" ); ELSE FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (IDENT_STR (""'A"")) - 2" ); END IF; EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ( "WRONG EXCEPTION RAISED " & "FOR CHARACTER'VALUE IDENT_STR (""'A""))" ); END; BEGIN IF CHARACTER'VALUE (IDENT_STR ("A'")) = 'A' THEN FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (IDENT_STR (""A'"")) - 1" ); ELSE FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (IDENT_STR (""A'"")) - 2" ); END IF; EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ( "WRONG EXCEPTION RAISED " & "FOR CHARACTER'VALUE (IDENT_STR (""A'""))" ); END; BEGIN IF CHARACTER'VALUE (IDENT_STR ("'AB'")) = 'A' THEN FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (IDENT_STR (""'AB'"")) - 1" ); ELSE FAILED ( "NO EXCEPTION RAISED FOR " & "CHARACTER'VALUE (IDENT_STR (""'AB'"")) - 2" ); END IF; EXCEPTION WHEN CONSTRAINT_ERROR => NULL; WHEN OTHERS => FAILED ( "WRONG EXCEPTION RAISED " & "FOR CHARACTER'VALUE IDENT_STR (""'AB'""))" ); END; RESULT; END C35507C;
-- This spec has been automatically generated from STM32F030.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with System; package STM32_SVD.I2C is pragma Preelaborate; --------------- -- Registers -- --------------- subtype CR1_PE_Field is STM32_SVD.Bit; subtype CR1_TXIE_Field is STM32_SVD.Bit; subtype CR1_RXIE_Field is STM32_SVD.Bit; subtype CR1_ADDRIE_Field is STM32_SVD.Bit; subtype CR1_NACKIE_Field is STM32_SVD.Bit; subtype CR1_STOPIE_Field is STM32_SVD.Bit; subtype CR1_TCIE_Field is STM32_SVD.Bit; subtype CR1_ERRIE_Field is STM32_SVD.Bit; subtype CR1_DNF_Field is STM32_SVD.UInt4; subtype CR1_ANFOFF_Field is STM32_SVD.Bit; subtype CR1_SWRST_Field is STM32_SVD.Bit; subtype CR1_TXDMAEN_Field is STM32_SVD.Bit; subtype CR1_RXDMAEN_Field is STM32_SVD.Bit; subtype CR1_SBC_Field is STM32_SVD.Bit; subtype CR1_NOSTRETCH_Field is STM32_SVD.Bit; subtype CR1_WUPEN_Field is STM32_SVD.Bit; subtype CR1_GCEN_Field is STM32_SVD.Bit; subtype CR1_SMBHEN_Field is STM32_SVD.Bit; subtype CR1_SMBDEN_Field is STM32_SVD.Bit; subtype CR1_ALERTEN_Field is STM32_SVD.Bit; subtype CR1_PECEN_Field is STM32_SVD.Bit; -- Control register 1 type CR1_Register is record -- Peripheral enable PE : CR1_PE_Field := 16#0#; -- TX Interrupt enable TXIE : CR1_TXIE_Field := 16#0#; -- RX Interrupt enable RXIE : CR1_RXIE_Field := 16#0#; -- Address match interrupt enable (slave only) ADDRIE : CR1_ADDRIE_Field := 16#0#; -- Not acknowledge received interrupt enable NACKIE : CR1_NACKIE_Field := 16#0#; -- STOP detection Interrupt enable STOPIE : CR1_STOPIE_Field := 16#0#; -- Transfer Complete interrupt enable TCIE : CR1_TCIE_Field := 16#0#; -- Error interrupts enable ERRIE : CR1_ERRIE_Field := 16#0#; -- Digital noise filter DNF : CR1_DNF_Field := 16#0#; -- Analog noise filter OFF ANFOFF : CR1_ANFOFF_Field := 16#0#; -- Write-only. Software reset SWRST : CR1_SWRST_Field := 16#0#; -- DMA transmission requests enable TXDMAEN : CR1_TXDMAEN_Field := 16#0#; -- DMA reception requests enable RXDMAEN : CR1_RXDMAEN_Field := 16#0#; -- Slave byte control SBC : CR1_SBC_Field := 16#0#; -- Clock stretching disable NOSTRETCH : CR1_NOSTRETCH_Field := 16#0#; -- Wakeup from STOP enable WUPEN : CR1_WUPEN_Field := 16#0#; -- General call enable GCEN : CR1_GCEN_Field := 16#0#; -- SMBus Host address enable SMBHEN : CR1_SMBHEN_Field := 16#0#; -- SMBus Device Default address enable SMBDEN : CR1_SMBDEN_Field := 16#0#; -- SMBUS alert enable ALERTEN : CR1_ALERTEN_Field := 16#0#; -- PEC enable PECEN : CR1_PECEN_Field := 16#0#; -- unspecified Reserved_24_31 : STM32_SVD.Byte := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR1_Register use record PE at 0 range 0 .. 0; TXIE at 0 range 1 .. 1; RXIE at 0 range 2 .. 2; ADDRIE at 0 range 3 .. 3; NACKIE at 0 range 4 .. 4; STOPIE at 0 range 5 .. 5; TCIE at 0 range 6 .. 6; ERRIE at 0 range 7 .. 7; DNF at 0 range 8 .. 11; ANFOFF at 0 range 12 .. 12; SWRST at 0 range 13 .. 13; TXDMAEN at 0 range 14 .. 14; RXDMAEN at 0 range 15 .. 15; SBC at 0 range 16 .. 16; NOSTRETCH at 0 range 17 .. 17; WUPEN at 0 range 18 .. 18; GCEN at 0 range 19 .. 19; SMBHEN at 0 range 20 .. 20; SMBDEN at 0 range 21 .. 21; ALERTEN at 0 range 22 .. 22; PECEN at 0 range 23 .. 23; Reserved_24_31 at 0 range 24 .. 31; end record; subtype CR2_SADD0_Field is STM32_SVD.Bit; subtype CR2_SADD1_Field is STM32_SVD.UInt7; subtype CR2_SADD8_Field is STM32_SVD.UInt2; subtype CR2_RD_WRN_Field is STM32_SVD.Bit; subtype CR2_ADD10_Field is STM32_SVD.Bit; subtype CR2_HEAD10R_Field is STM32_SVD.Bit; subtype CR2_START_Field is STM32_SVD.Bit; subtype CR2_STOP_Field is STM32_SVD.Bit; subtype CR2_NACK_Field is STM32_SVD.Bit; subtype CR2_NBYTES_Field is STM32_SVD.Byte; subtype CR2_RELOAD_Field is STM32_SVD.Bit; subtype CR2_AUTOEND_Field is STM32_SVD.Bit; subtype CR2_PECBYTE_Field is STM32_SVD.Bit; -- Control register 2 type CR2_Register is record -- Slave address bit 0 (master mode) SADD0 : CR2_SADD0_Field := 16#0#; -- Slave address bit 7:1 (master mode) SADD1 : CR2_SADD1_Field := 16#0#; -- Slave address bit 9:8 (master mode) SADD8 : CR2_SADD8_Field := 16#0#; -- Transfer direction (master mode) RD_WRN : CR2_RD_WRN_Field := 16#0#; -- 10-bit addressing mode (master mode) ADD10 : CR2_ADD10_Field := 16#0#; -- 10-bit address header only read direction (master receiver mode) HEAD10R : CR2_HEAD10R_Field := 16#0#; -- Start generation START : CR2_START_Field := 16#0#; -- Stop generation (master mode) STOP : CR2_STOP_Field := 16#0#; -- NACK generation (slave mode) NACK : CR2_NACK_Field := 16#0#; -- Number of bytes NBYTES : CR2_NBYTES_Field := 16#0#; -- NBYTES reload mode RELOAD : CR2_RELOAD_Field := 16#0#; -- Automatic end mode (master mode) AUTOEND : CR2_AUTOEND_Field := 16#0#; -- Packet error checking byte PECBYTE : CR2_PECBYTE_Field := 16#0#; -- unspecified Reserved_27_31 : STM32_SVD.UInt5 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR2_Register use record SADD0 at 0 range 0 .. 0; SADD1 at 0 range 1 .. 7; SADD8 at 0 range 8 .. 9; RD_WRN at 0 range 10 .. 10; ADD10 at 0 range 11 .. 11; HEAD10R at 0 range 12 .. 12; START at 0 range 13 .. 13; STOP at 0 range 14 .. 14; NACK at 0 range 15 .. 15; NBYTES at 0 range 16 .. 23; RELOAD at 0 range 24 .. 24; AUTOEND at 0 range 25 .. 25; PECBYTE at 0 range 26 .. 26; Reserved_27_31 at 0 range 27 .. 31; end record; subtype OAR1_OA1_0_Field is STM32_SVD.Bit; subtype OAR1_OA1_1_Field is STM32_SVD.UInt7; subtype OAR1_OA1_8_Field is STM32_SVD.UInt2; subtype OAR1_OA1MODE_Field is STM32_SVD.Bit; subtype OAR1_OA1EN_Field is STM32_SVD.Bit; -- Own address register 1 type OAR1_Register is record -- Interface address OA1_0 : OAR1_OA1_0_Field := 16#0#; -- Interface address OA1_1 : OAR1_OA1_1_Field := 16#0#; -- Interface address OA1_8 : OAR1_OA1_8_Field := 16#0#; -- Own Address 1 10-bit mode OA1MODE : OAR1_OA1MODE_Field := 16#0#; -- unspecified Reserved_11_14 : STM32_SVD.UInt4 := 16#0#; -- Own Address 1 enable OA1EN : OAR1_OA1EN_Field := 16#0#; -- unspecified Reserved_16_31 : STM32_SVD.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for OAR1_Register use record OA1_0 at 0 range 0 .. 0; OA1_1 at 0 range 1 .. 7; OA1_8 at 0 range 8 .. 9; OA1MODE at 0 range 10 .. 10; Reserved_11_14 at 0 range 11 .. 14; OA1EN at 0 range 15 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype OAR2_OA2_Field is STM32_SVD.UInt7; subtype OAR2_OA2MSK_Field is STM32_SVD.UInt3; subtype OAR2_OA2EN_Field is STM32_SVD.Bit; -- Own address register 2 type OAR2_Register is record -- unspecified Reserved_0_0 : STM32_SVD.Bit := 16#0#; -- Interface address OA2 : OAR2_OA2_Field := 16#0#; -- Own Address 2 masks OA2MSK : OAR2_OA2MSK_Field := 16#0#; -- unspecified Reserved_11_14 : STM32_SVD.UInt4 := 16#0#; -- Own Address 2 enable OA2EN : OAR2_OA2EN_Field := 16#0#; -- unspecified Reserved_16_31 : STM32_SVD.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for OAR2_Register use record Reserved_0_0 at 0 range 0 .. 0; OA2 at 0 range 1 .. 7; OA2MSK at 0 range 8 .. 10; Reserved_11_14 at 0 range 11 .. 14; OA2EN at 0 range 15 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype TIMINGR_SCLL_Field is STM32_SVD.Byte; subtype TIMINGR_SCLH_Field is STM32_SVD.Byte; subtype TIMINGR_SDADEL_Field is STM32_SVD.UInt4; subtype TIMINGR_SCLDEL_Field is STM32_SVD.UInt4; subtype TIMINGR_PRESC_Field is STM32_SVD.UInt4; -- Timing register type TIMINGR_Register is record -- SCL low period (master mode) SCLL : TIMINGR_SCLL_Field := 16#0#; -- SCL high period (master mode) SCLH : TIMINGR_SCLH_Field := 16#0#; -- Data hold time SDADEL : TIMINGR_SDADEL_Field := 16#0#; -- Data setup time SCLDEL : TIMINGR_SCLDEL_Field := 16#0#; -- unspecified Reserved_24_27 : STM32_SVD.UInt4 := 16#0#; -- Timing prescaler PRESC : TIMINGR_PRESC_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for TIMINGR_Register use record SCLL at 0 range 0 .. 7; SCLH at 0 range 8 .. 15; SDADEL at 0 range 16 .. 19; SCLDEL at 0 range 20 .. 23; Reserved_24_27 at 0 range 24 .. 27; PRESC at 0 range 28 .. 31; end record; subtype TIMEOUTR_TIMEOUTA_Field is STM32_SVD.UInt12; subtype TIMEOUTR_TIDLE_Field is STM32_SVD.Bit; subtype TIMEOUTR_TIMOUTEN_Field is STM32_SVD.Bit; subtype TIMEOUTR_TIMEOUTB_Field is STM32_SVD.UInt12; subtype TIMEOUTR_TEXTEN_Field is STM32_SVD.Bit; -- Status register 1 type TIMEOUTR_Register is record -- Bus timeout A TIMEOUTA : TIMEOUTR_TIMEOUTA_Field := 16#0#; -- Idle clock timeout detection TIDLE : TIMEOUTR_TIDLE_Field := 16#0#; -- unspecified Reserved_13_14 : STM32_SVD.UInt2 := 16#0#; -- Clock timeout enable TIMOUTEN : TIMEOUTR_TIMOUTEN_Field := 16#0#; -- Bus timeout B TIMEOUTB : TIMEOUTR_TIMEOUTB_Field := 16#0#; -- unspecified Reserved_28_30 : STM32_SVD.UInt3 := 16#0#; -- Extended clock timeout enable TEXTEN : TIMEOUTR_TEXTEN_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for TIMEOUTR_Register use record TIMEOUTA at 0 range 0 .. 11; TIDLE at 0 range 12 .. 12; Reserved_13_14 at 0 range 13 .. 14; TIMOUTEN at 0 range 15 .. 15; TIMEOUTB at 0 range 16 .. 27; Reserved_28_30 at 0 range 28 .. 30; TEXTEN at 0 range 31 .. 31; end record; subtype ISR_TXE_Field is STM32_SVD.Bit; subtype ISR_TXIS_Field is STM32_SVD.Bit; subtype ISR_RXNE_Field is STM32_SVD.Bit; subtype ISR_ADDR_Field is STM32_SVD.Bit; subtype ISR_NACKF_Field is STM32_SVD.Bit; subtype ISR_STOPF_Field is STM32_SVD.Bit; subtype ISR_TC_Field is STM32_SVD.Bit; subtype ISR_TCR_Field is STM32_SVD.Bit; subtype ISR_BERR_Field is STM32_SVD.Bit; subtype ISR_ARLO_Field is STM32_SVD.Bit; subtype ISR_OVR_Field is STM32_SVD.Bit; subtype ISR_PECERR_Field is STM32_SVD.Bit; subtype ISR_TIMEOUT_Field is STM32_SVD.Bit; subtype ISR_ALERT_Field is STM32_SVD.Bit; subtype ISR_BUSY_Field is STM32_SVD.Bit; subtype ISR_DIR_Field is STM32_SVD.Bit; subtype ISR_ADDCODE_Field is STM32_SVD.UInt7; -- Interrupt and Status register type ISR_Register is record -- Transmit data register empty (transmitters) TXE : ISR_TXE_Field := 16#1#; -- Transmit interrupt status (transmitters) TXIS : ISR_TXIS_Field := 16#0#; -- Read-only. Receive data register not empty (receivers) RXNE : ISR_RXNE_Field := 16#0#; -- Read-only. Address matched (slave mode) ADDR : ISR_ADDR_Field := 16#0#; -- Read-only. Not acknowledge received flag NACKF : ISR_NACKF_Field := 16#0#; -- Read-only. Stop detection flag STOPF : ISR_STOPF_Field := 16#0#; -- Read-only. Transfer Complete (master mode) TC : ISR_TC_Field := 16#0#; -- Read-only. Transfer Complete Reload TCR : ISR_TCR_Field := 16#0#; -- Read-only. Bus error BERR : ISR_BERR_Field := 16#0#; -- Read-only. Arbitration lost ARLO : ISR_ARLO_Field := 16#0#; -- Read-only. Overrun/Underrun (slave mode) OVR : ISR_OVR_Field := 16#0#; -- Read-only. PEC Error in reception PECERR : ISR_PECERR_Field := 16#0#; -- Read-only. Timeout or t_low detection flag TIMEOUT : ISR_TIMEOUT_Field := 16#0#; -- Read-only. SMBus alert ALERT : ISR_ALERT_Field := 16#0#; -- unspecified Reserved_14_14 : STM32_SVD.Bit := 16#0#; -- Read-only. Bus busy BUSY : ISR_BUSY_Field := 16#0#; -- Read-only. Transfer direction (Slave mode) DIR : ISR_DIR_Field := 16#0#; -- Read-only. Address match code (Slave mode) ADDCODE : ISR_ADDCODE_Field := 16#0#; -- unspecified Reserved_24_31 : STM32_SVD.Byte := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for ISR_Register use record TXE at 0 range 0 .. 0; TXIS at 0 range 1 .. 1; RXNE at 0 range 2 .. 2; ADDR at 0 range 3 .. 3; NACKF at 0 range 4 .. 4; STOPF at 0 range 5 .. 5; TC at 0 range 6 .. 6; TCR at 0 range 7 .. 7; BERR at 0 range 8 .. 8; ARLO at 0 range 9 .. 9; OVR at 0 range 10 .. 10; PECERR at 0 range 11 .. 11; TIMEOUT at 0 range 12 .. 12; ALERT at 0 range 13 .. 13; Reserved_14_14 at 0 range 14 .. 14; BUSY at 0 range 15 .. 15; DIR at 0 range 16 .. 16; ADDCODE at 0 range 17 .. 23; Reserved_24_31 at 0 range 24 .. 31; end record; subtype ICR_ADDRCF_Field is STM32_SVD.Bit; subtype ICR_NACKCF_Field is STM32_SVD.Bit; subtype ICR_STOPCF_Field is STM32_SVD.Bit; subtype ICR_BERRCF_Field is STM32_SVD.Bit; subtype ICR_ARLOCF_Field is STM32_SVD.Bit; subtype ICR_OVRCF_Field is STM32_SVD.Bit; subtype ICR_PECCF_Field is STM32_SVD.Bit; subtype ICR_TIMOUTCF_Field is STM32_SVD.Bit; subtype ICR_ALERTCF_Field is STM32_SVD.Bit; -- Interrupt clear register type ICR_Register is record -- unspecified Reserved_0_2 : STM32_SVD.UInt3 := 16#0#; -- Write-only. Address Matched flag clear ADDRCF : ICR_ADDRCF_Field := 16#0#; -- Write-only. Not Acknowledge flag clear NACKCF : ICR_NACKCF_Field := 16#0#; -- Write-only. Stop detection flag clear STOPCF : ICR_STOPCF_Field := 16#0#; -- unspecified Reserved_6_7 : STM32_SVD.UInt2 := 16#0#; -- Write-only. Bus error flag clear BERRCF : ICR_BERRCF_Field := 16#0#; -- Write-only. Arbitration lost flag clear ARLOCF : ICR_ARLOCF_Field := 16#0#; -- Write-only. Overrun/Underrun flag clear OVRCF : ICR_OVRCF_Field := 16#0#; -- Write-only. PEC Error flag clear PECCF : ICR_PECCF_Field := 16#0#; -- Write-only. Timeout detection flag clear TIMOUTCF : ICR_TIMOUTCF_Field := 16#0#; -- Write-only. Alert flag clear ALERTCF : ICR_ALERTCF_Field := 16#0#; -- unspecified Reserved_14_31 : STM32_SVD.UInt18 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for ICR_Register use record Reserved_0_2 at 0 range 0 .. 2; ADDRCF at 0 range 3 .. 3; NACKCF at 0 range 4 .. 4; STOPCF at 0 range 5 .. 5; Reserved_6_7 at 0 range 6 .. 7; BERRCF at 0 range 8 .. 8; ARLOCF at 0 range 9 .. 9; OVRCF at 0 range 10 .. 10; PECCF at 0 range 11 .. 11; TIMOUTCF at 0 range 12 .. 12; ALERTCF at 0 range 13 .. 13; Reserved_14_31 at 0 range 14 .. 31; end record; subtype PECR_PEC_Field is STM32_SVD.Byte; -- PEC register type PECR_Register is record -- Read-only. Packet error checking register PEC : PECR_PEC_Field; -- unspecified Reserved_8_31 : STM32_SVD.UInt24; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for PECR_Register use record PEC at 0 range 0 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; subtype RXDR_RXDATA_Field is STM32_SVD.Byte; -- Receive data register type RXDR_Register is record -- Read-only. 8-bit receive data RXDATA : RXDR_RXDATA_Field; -- unspecified Reserved_8_31 : STM32_SVD.UInt24; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for RXDR_Register use record RXDATA at 0 range 0 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; subtype TXDR_TXDATA_Field is STM32_SVD.Byte; -- Transmit data register type TXDR_Register is record -- 8-bit transmit data TXDATA : TXDR_TXDATA_Field := 16#0#; -- unspecified Reserved_8_31 : STM32_SVD.UInt24 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for TXDR_Register use record TXDATA at 0 range 0 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Inter-integrated circuit type I2C_Peripheral is record -- Control register 1 CR1 : aliased CR1_Register; -- Control register 2 CR2 : aliased CR2_Register; -- Own address register 1 OAR1 : aliased OAR1_Register; -- Own address register 2 OAR2 : aliased OAR2_Register; -- Timing register TIMINGR : aliased TIMINGR_Register; -- Status register 1 TIMEOUTR : aliased TIMEOUTR_Register; -- Interrupt and Status register ISR : aliased ISR_Register; -- Interrupt clear register ICR : aliased ICR_Register; -- PEC register PECR : aliased PECR_Register; -- Receive data register RXDR : aliased RXDR_Register; -- Transmit data register TXDR : aliased TXDR_Register; end record with Volatile; for I2C_Peripheral use record CR1 at 16#0# range 0 .. 31; CR2 at 16#4# range 0 .. 31; OAR1 at 16#8# range 0 .. 31; OAR2 at 16#C# range 0 .. 31; TIMINGR at 16#10# range 0 .. 31; TIMEOUTR at 16#14# range 0 .. 31; ISR at 16#18# range 0 .. 31; ICR at 16#1C# range 0 .. 31; PECR at 16#20# range 0 .. 31; RXDR at 16#24# range 0 .. 31; TXDR at 16#28# range 0 .. 31; end record; -- Inter-integrated circuit I2C1_Periph : aliased I2C_Peripheral with Import, Address => System'To_Address (16#40005400#); -- Inter-integrated circuit I2C2_Periph : aliased I2C_Peripheral with Import, Address => System'To_Address (16#40005800#); end STM32_SVD.I2C;
----------------------------------------------------------------------- -- util-concurrent-pools -- Concurrent Pools -- Copyright (C) 2011, 2015, 2018 Stephane Carrez -- Written by Stephane Carrez (Stephane.Carrez@gmail.com) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Ada.Finalization; -- The <b>Util.Concurrent.Pools</b> generic defines a pool of objects which -- can be shared by multiple threads. First, the pool is configured to have -- a number of objects by using the <b>Set_Size</b> procedure. Then, a thread -- that needs an object uses the <b>Get_Instance</b> to get an object. -- The object is removed from the pool. As soon as the thread has finished, -- it puts back the object in the pool using the <b>Release</b> procedure. -- -- The <b>Get_Instance</b> entry will block until an object is available. generic type Element_Type is private; package Util.Concurrent.Pools is pragma Preelaborate; FOREVER : constant Duration := -1.0; -- Exception raised if the Get_Instance timeout exceeded. Timeout : exception; -- Pool of objects type Pool is limited new Ada.Finalization.Limited_Controlled with private; -- Get an element instance from the pool. -- Wait until one instance gets available. procedure Get_Instance (From : in out Pool; Item : out Element_Type; Wait : in Duration := FOREVER); -- Put the element back to the pool. procedure Release (Into : in out Pool; Item : in Element_Type); -- Set the pool size. procedure Set_Size (Into : in out Pool; Capacity : in Positive); -- Get the number of available elements in the pool. procedure Get_Available (From : in out Pool; Available : out Natural); -- Release the pool elements. overriding procedure Finalize (Object : in out Pool); private -- To store the pool elements, we use an array which is allocated dynamically -- by the <b>Set_Size</b> protected operation. The generated code is smaller -- compared to the use of Ada vectors container. type Element_Array is array (Positive range <>) of Element_Type; type Element_Array_Access is access all Element_Array; Null_Element_Array : constant Element_Array_Access := null; -- Pool of objects protected type Protected_Pool is -- Get an element instance from the pool. -- Wait until one instance gets available. entry Get_Instance (Item : out Element_Type); -- Put the element back to the pool. procedure Release (Item : in Element_Type); -- Set the pool size. procedure Set_Size (Capacity : in Natural); -- Get the number of available elements. function Get_Available return Natural; private Available : Natural := 0; Elements : Element_Array_Access := Null_Element_Array; end Protected_Pool; type Pool is limited new Ada.Finalization.Limited_Controlled with record List : Protected_Pool; end record; end Util.Concurrent.Pools;
package defining_operator_symbol is function "*"(Left, Right : Integer) return Integer; end defining_operator_symbol;
-- Copyright 2008-2015 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- This program is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. with Pck; use Pck; procedure Foo is begin declare procedure Call_Me is begin Do_Nothing; -- STOP end Call_Me; begin Call_Me; end; end Foo;
------------------------------------------------------------------------------ -- 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) $ package System.Storage_Elements is pragma Pure (System.Storage_Elements); type Storage_Offset is range implementation-Defined .. implementation-defined; subtype Storage_Count is Storage_Offset range 0 .. Storage_Offset'Last; type Storage_Element is mod implementation-defined; for Storage_Element'Size use Storage_Unit; type Storage_Array is array (Storage_Offset range <>) of aliased Storage_Element; for Storage_Array'Component_Size use Storage_Unit; -- Address Arithmetic: function "+" (Left : Address; Right : Storage_Offset) return Address; function "+" (Left : Storage_Offset; Right : Address) return Address; function "-" (Left : Address; Right : Storage_Offset) return Address; function "-" (Left, Right : Address) return Storage_Offset; function "mod" (Left : Address; Right : Storage_Offset) return Storage_Offset; -- Conversion to/from integers: type Integer_Address is mod implementation-defined; function To_Address (Value : Integer_Address) return Address; function To_Integer (Value : Address) return Integer_Address; pragma Convention (Intrinsic, "+"); pragma Convention (Intrinsic, "-"); pragma Convention (Intrinsic, "mod"); pragma Convention (Intrinsic, "To_Address"); pragma Convention (Intrinsic, "To_Integer"); -- and so on for all language-defined subprograms declared in this package. end System.Storage_Elements;
----------------------------------------------------------------------- -- components-widgets -- ASF Widget Components -- Copyright (C) 2013 Stephane Carrez -- Written by Stephane Carrez (Stephane.Carrez@gmail.com) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- package ASF.Components.Widgets is end ASF.Components.Widgets;
-- C86006I.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 IDENTIFIERS "BOOLEAN, TRUE, AND FALSE" AND THE -- IDENTIFIERS "INTEGER, NATURAL, AND POSITIVE" ARE DECLARED IN -- THE PACKAGE "STANDARD", ALONG WITH THE OPERATORS OF THE TYPE -- BOOLEAN AND THE TYPE INTEGER. -- HISTORY: -- DTN 04/15/92 CONSOLIDATION OF C86006A AND C86006B. WITH REPORT; USE REPORT; PROCEDURE C86006I IS ABOOL, BBOOL : STANDARD.BOOLEAN := STANDARD.FALSE; CBOOL : STANDARD.BOOLEAN := STANDARD.TRUE; INT1 : STANDARD.INTEGER := -2; NAT1 : STANDARD.NATURAL := 0; POS1, POS2 : STANDARD.POSITIVE := 2; BEGIN TEST("C86006I", "CHECK THAT THE IDENTIFIERS ""BOOLEAN, TRUE, AND " & "FALSE"" AND THE IDENTIFIERS ""INTEGER, NATURAL, " & "AND POSITIVE"" ARE DECLARED IN THE PACKAGE " & """STANDARD"", ALONG WITH THE OPERATORS OF THE " & "TYPE BOOLEAN AND THE TYPE INTEGER"); -- STANDARD.">" OPERATOR. IF STANDARD.">"(ABOOL,BBOOL) THEN FAILED("STANDARD.> FAILED FOR BOOLEAN TYPE"); END IF; IF STANDARD.">"(INT1,NAT1) THEN FAILED("STANDARD.> FAILED FOR INTEGER-NATURAL TYPE"); END IF; -- STANDARD."/=" OPERATOR. IF STANDARD."/="(ABOOL,BBOOL) THEN FAILED("STANDARD./= FAILED FOR BOOLEAN TYPE"); END IF; IF STANDARD."/="(POS1,POS2) THEN FAILED("STANDARD./= FAILED FOR INTEGER-POSITIVE TYPE"); END IF; -- STANDARD."AND" OPERATOR. IF STANDARD."AND"(CBOOL,ABOOL) THEN FAILED("STANDARD.AND FAILED"); END IF; -- STANDARD."-" BINARY OPERATOR. IF STANDARD."-"(INT1,POS1) /= IDENT_INT(-4) THEN FAILED("STANDARD.- FAILED"); END IF; -- STANDARD."-" UNARY OPERATOR. IF STANDARD."-"(INT1) /= IDENT_INT(2) THEN FAILED("STANDARD.UNARY - FAILED"); END IF; -- STANDARD."REM" OPERATOR. IF STANDARD."REM"(IDENT_INT(14),IDENT_INT(5)) /= IDENT_INT(4) THEN FAILED("STANDARD.REM (++=+) FAILED"); END IF; -- STANDARD."MOD" OPERATOR. IF STANDARD."MOD"(IDENT_INT(14),IDENT_INT(-5)) /= IDENT_INT(-1) THEN FAILED("STANDARD.MOD (+-=-) FAILED"); END IF; RESULT; END C86006I;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S Y S T E M . S H A R E D _ M E M O R Y -- -- -- -- B o d y -- -- -- -- Copyright (C) 1998-2015, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Ada.IO_Exceptions; with Ada.Streams; with Ada.Streams.Stream_IO; with System.Global_Locks; with System.Soft_Links; with System; with System.CRTL; with System.File_Control_Block; with System.File_IO; with System.HTable; with Ada.Unchecked_Deallocation; with Ada.Unchecked_Conversion; package body System.Shared_Storage is package AS renames Ada.Streams; package IOX renames Ada.IO_Exceptions; package FCB renames System.File_Control_Block; package SFI renames System.File_IO; package SIO renames Ada.Streams.Stream_IO; type String_Access is access String; procedure Free is new Ada.Unchecked_Deallocation (Object => String, Name => String_Access); Dir : String_Access; -- Holds the directory ------------------------------------------------ -- Variables for Shared Variable Access Files -- ------------------------------------------------ Max_Shared_Var_Files : constant := 20; -- Maximum number of lock files that can be open Shared_Var_Files_Open : Natural := 0; -- Number of shared variable access files currently open type File_Stream_Type is new AS.Root_Stream_Type with record File : SIO.File_Type; end record; type File_Stream_Access is access all File_Stream_Type'Class; procedure Read (Stream : in out File_Stream_Type; Item : out AS.Stream_Element_Array; Last : out AS.Stream_Element_Offset); procedure Write (Stream : in out File_Stream_Type; Item : AS.Stream_Element_Array); subtype Hash_Header is Natural range 0 .. 30; -- Number of hash headers, related (for efficiency purposes only) to the -- maximum number of lock files. type Shared_Var_File_Entry; type Shared_Var_File_Entry_Ptr is access Shared_Var_File_Entry; type Shared_Var_File_Entry is record Name : String_Access; -- Name of variable, as passed to Read_File/Write_File routines Stream : File_Stream_Access; -- Stream_IO file for the shared variable file Next : Shared_Var_File_Entry_Ptr; Prev : Shared_Var_File_Entry_Ptr; -- Links for LRU chain end record; procedure Free is new Ada.Unchecked_Deallocation (Object => Shared_Var_File_Entry, Name => Shared_Var_File_Entry_Ptr); procedure Free is new Ada.Unchecked_Deallocation (Object => File_Stream_Type'Class, Name => File_Stream_Access); function To_AFCB_Ptr is new Ada.Unchecked_Conversion (SIO.File_Type, FCB.AFCB_Ptr); LRU_Head : Shared_Var_File_Entry_Ptr; LRU_Tail : Shared_Var_File_Entry_Ptr; -- As lock files are opened, they are organized into a least recently -- used chain, which is a doubly linked list using the Next and Prev -- fields of Shared_Var_File_Entry records. The field LRU_Head points -- to the least recently used entry, whose prev pointer is null, and -- LRU_Tail points to the most recently used entry, whose next pointer -- is null. These pointers are null only if the list is empty. function Hash (F : String_Access) return Hash_Header; function Equal (F1, F2 : String_Access) return Boolean; -- Hash and equality functions for hash table package SFT is new System.HTable.Simple_HTable (Header_Num => Hash_Header, Element => Shared_Var_File_Entry_Ptr, No_Element => null, Key => String_Access, Hash => Hash, Equal => Equal); -------------------------------- -- Variables for Lock Control -- -------------------------------- Global_Lock : Global_Locks.Lock_Type; Lock_Count : Natural := 0; -- Counts nesting of lock calls, 0 means lock is not held ----------------------- -- Local Subprograms -- ----------------------- procedure Initialize; -- Called to initialize data structures for this package. -- Has no effect except on the first call. procedure Enter_SFE (SFE : Shared_Var_File_Entry_Ptr; Fname : String); -- The first parameter is a pointer to a newly allocated SFE, whose -- File field is already set appropriately. Fname is the name of the -- variable as passed to Shared_Var_RFile/Shared_Var_WFile. Enter_SFE -- completes the SFE value, and enters it into the hash table. If the -- hash table is already full, the least recently used entry is first -- closed and discarded. function Retrieve (File : String) return Shared_Var_File_Entry_Ptr; -- Given a file name, this function searches the hash table to see if -- the file is currently open. If so, then a pointer to the already -- created entry is returned, after first moving it to the head of -- the LRU chain. If not, then null is returned. function Shared_Var_ROpen (Var : String) return SIO.Stream_Access; -- As described above, this routine returns null if the -- corresponding shared storage does not exist, and otherwise, if -- the storage does exist, a Stream_Access value that references -- the shared storage, ready to read the current value. function Shared_Var_WOpen (Var : String) return SIO.Stream_Access; -- As described above, this routine returns a Stream_Access value -- that references the shared storage, ready to write the new -- value. The storage is created by this call if it does not -- already exist. procedure Shared_Var_Close (Var : SIO.Stream_Access); -- This routine signals the end of a read/assign operation. It can -- be useful to embrace a read/write operation between a call to -- open and a call to close which protect the whole operation. -- Otherwise, two simultaneous operations can result in the -- raising of exception Data_Error by setting the access mode of -- the variable in an incorrect mode. --------------- -- Enter_SFE -- --------------- procedure Enter_SFE (SFE : Shared_Var_File_Entry_Ptr; Fname : String) is Freed : Shared_Var_File_Entry_Ptr; begin SFE.Name := new String'(Fname); -- Release least recently used entry if we have to if Shared_Var_Files_Open = Max_Shared_Var_Files then Freed := LRU_Head; if Freed.Next /= null then Freed.Next.Prev := null; end if; LRU_Head := Freed.Next; SFT.Remove (Freed.Name); SIO.Close (Freed.Stream.File); Free (Freed.Name); Free (Freed.Stream); Free (Freed); else Shared_Var_Files_Open := Shared_Var_Files_Open + 1; end if; -- Add new entry to hash table SFT.Set (SFE.Name, SFE); -- Add new entry at end of LRU chain if LRU_Head = null then LRU_Head := SFE; LRU_Tail := SFE; else SFE.Prev := LRU_Tail; LRU_Tail.Next := SFE; LRU_Tail := SFE; end if; end Enter_SFE; ----------- -- Equal -- ----------- function Equal (F1, F2 : String_Access) return Boolean is begin return F1.all = F2.all; end Equal; ---------- -- Hash -- ---------- function Hash (F : String_Access) return Hash_Header is N : Natural := 0; begin -- Add up characters of name, mod our table size for J in F'Range loop N := (N + Character'Pos (F (J))) mod (Hash_Header'Last + 1); end loop; return N; end Hash; ---------------- -- Initialize -- ---------------- procedure Initialize is procedure Get_Env_Value_Ptr (Name, Length, Ptr : Address); pragma Import (C, Get_Env_Value_Ptr, "__gnat_getenv"); subtype size_t is CRTL.size_t; procedure Strncpy (dest, src : System.Address; n : size_t) renames CRTL.strncpy; Dir_Name : aliased constant String := "SHARED_MEMORY_DIRECTORY" & ASCII.NUL; Env_Value_Ptr : aliased Address; Env_Value_Len : aliased Integer; begin if Dir = null then Get_Env_Value_Ptr (Dir_Name'Address, Env_Value_Len'Address, Env_Value_Ptr'Address); Dir := new String (1 .. Env_Value_Len); if Env_Value_Len > 0 then Strncpy (Dir.all'Address, Env_Value_Ptr, size_t (Env_Value_Len)); end if; System.Global_Locks.Create_Lock (Global_Lock, Dir.all & "__lock"); end if; end Initialize; ---------- -- Read -- ---------- procedure Read (Stream : in out File_Stream_Type; Item : out AS.Stream_Element_Array; Last : out AS.Stream_Element_Offset) is begin SIO.Read (Stream.File, Item, Last); exception when others => Last := Item'Last; end Read; -------------- -- Retrieve -- -------------- function Retrieve (File : String) return Shared_Var_File_Entry_Ptr is SFE : Shared_Var_File_Entry_Ptr; begin Initialize; SFE := SFT.Get (File'Unrestricted_Access); if SFE /= null then -- Move to head of LRU chain if SFE = LRU_Tail then null; elsif SFE = LRU_Head then LRU_Head := LRU_Head.Next; LRU_Head.Prev := null; else SFE.Next.Prev := SFE.Prev; SFE.Prev.Next := SFE.Next; end if; SFE.Next := null; SFE.Prev := LRU_Tail; LRU_Tail.Next := SFE; LRU_Tail := SFE; end if; return SFE; end Retrieve; ---------------------- -- Shared_Var_Close -- ---------------------- procedure Shared_Var_Close (Var : SIO.Stream_Access) is pragma Warnings (Off, Var); begin System.Soft_Links.Unlock_Task.all; end Shared_Var_Close; --------------------- -- Shared_Var_Lock -- --------------------- procedure Shared_Var_Lock (Var : String) is pragma Warnings (Off, Var); begin System.Soft_Links.Lock_Task.all; Initialize; if Lock_Count /= 0 then Lock_Count := Lock_Count + 1; System.Soft_Links.Unlock_Task.all; else Lock_Count := 1; System.Soft_Links.Unlock_Task.all; System.Global_Locks.Acquire_Lock (Global_Lock); end if; exception when others => System.Soft_Links.Unlock_Task.all; raise; end Shared_Var_Lock; ---------------------- -- Shared_Var_Procs -- ---------------------- package body Shared_Var_Procs is use type SIO.Stream_Access; ---------- -- Read -- ---------- procedure Read is S : SIO.Stream_Access := null; begin S := Shared_Var_ROpen (Full_Name); if S /= null then Typ'Read (S, V); Shared_Var_Close (S); end if; end Read; ------------ -- Write -- ------------ procedure Write is S : SIO.Stream_Access := null; begin S := Shared_Var_WOpen (Full_Name); Typ'Write (S, V); Shared_Var_Close (S); return; end Write; end Shared_Var_Procs; ---------------------- -- Shared_Var_ROpen -- ---------------------- function Shared_Var_ROpen (Var : String) return SIO.Stream_Access is SFE : Shared_Var_File_Entry_Ptr; use type Ada.Streams.Stream_IO.File_Mode; begin System.Soft_Links.Lock_Task.all; SFE := Retrieve (Var); -- Here if file is not already open, try to open it if SFE = null then declare S : aliased constant String := Dir.all & Var; begin SFE := new Shared_Var_File_Entry; SFE.Stream := new File_Stream_Type; SIO.Open (SFE.Stream.File, SIO.In_File, Name => S); SFI.Make_Unbuffered (To_AFCB_Ptr (SFE.Stream.File)); -- File opened successfully, put new entry in hash table. Note -- that in this case, file is positioned correctly for read. Enter_SFE (SFE, Var); exception -- If we get an exception, it means that the file does not -- exist, and in this case, we don't need the SFE and we -- return null; when IOX.Name_Error => Free (SFE); System.Soft_Links.Unlock_Task.all; return null; end; -- Here if file is already open, set file for reading else if SIO.Mode (SFE.Stream.File) /= SIO.In_File then SIO.Set_Mode (SFE.Stream.File, SIO.In_File); SFI.Make_Unbuffered (To_AFCB_Ptr (SFE.Stream.File)); end if; SIO.Set_Index (SFE.Stream.File, 1); end if; return SIO.Stream_Access (SFE.Stream); exception when others => System.Soft_Links.Unlock_Task.all; raise; end Shared_Var_ROpen; ----------------------- -- Shared_Var_Unlock -- ----------------------- procedure Shared_Var_Unlock (Var : String) is pragma Warnings (Off, Var); begin System.Soft_Links.Lock_Task.all; Initialize; Lock_Count := Lock_Count - 1; if Lock_Count = 0 then System.Global_Locks.Release_Lock (Global_Lock); end if; System.Soft_Links.Unlock_Task.all; exception when others => System.Soft_Links.Unlock_Task.all; raise; end Shared_Var_Unlock; --------------------- -- Share_Var_WOpen -- --------------------- function Shared_Var_WOpen (Var : String) return SIO.Stream_Access is SFE : Shared_Var_File_Entry_Ptr; use type Ada.Streams.Stream_IO.File_Mode; begin System.Soft_Links.Lock_Task.all; SFE := Retrieve (Var); if SFE = null then declare S : aliased constant String := Dir.all & Var; begin SFE := new Shared_Var_File_Entry; SFE.Stream := new File_Stream_Type; SIO.Open (SFE.Stream.File, SIO.Out_File, Name => S); SFI.Make_Unbuffered (To_AFCB_Ptr (SFE.Stream.File)); exception -- If we get an exception, it means that the file does not -- exist, and in this case, we create the file. when IOX.Name_Error => begin SIO.Create (SFE.Stream.File, SIO.Out_File, Name => S); exception -- Error if we cannot create the file when others => raise Program_Error with "cannot create shared variable file for """ & S & '"'; end; end; -- Make new hash table entry for opened/created file. Note that -- in both cases, the file is already in write mode at the start -- of the file, ready to be written. Enter_SFE (SFE, Var); -- Here if file is already open, set file for writing else if SIO.Mode (SFE.Stream.File) /= SIO.Out_File then SIO.Set_Mode (SFE.Stream.File, SIO.Out_File); SFI.Make_Unbuffered (To_AFCB_Ptr (SFE.Stream.File)); end if; SIO.Set_Index (SFE.Stream.File, 1); end if; return SIO.Stream_Access (SFE.Stream); exception when others => System.Soft_Links.Unlock_Task.all; raise; end Shared_Var_WOpen; ----------- -- Write -- ----------- procedure Write (Stream : in out File_Stream_Type; Item : AS.Stream_Element_Array) is begin SIO.Write (Stream.File, Item); end Write; end System.Shared_Storage;
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com> -- -- SPDX-License-Identifier: MIT -- License-Filename: LICENSE ------------------------------------------------------------- with Program.Elements.Statements; with Program.Elements.Expressions; with Program.Lexical_Elements; package Program.Elements.Assignment_Statements is pragma Pure (Program.Elements.Assignment_Statements); type Assignment_Statement is limited interface and Program.Elements.Statements.Statement; type Assignment_Statement_Access is access all Assignment_Statement'Class with Storage_Size => 0; not overriding function Variable_Name (Self : Assignment_Statement) return not null Program.Elements.Expressions.Expression_Access is abstract; not overriding function Expression (Self : Assignment_Statement) return not null Program.Elements.Expressions.Expression_Access is abstract; type Assignment_Statement_Text is limited interface; type Assignment_Statement_Text_Access is access all Assignment_Statement_Text'Class with Storage_Size => 0; not overriding function To_Assignment_Statement_Text (Self : aliased in out Assignment_Statement) return Assignment_Statement_Text_Access is abstract; not overriding function Assignment_Token (Self : Assignment_Statement_Text) return not null Program.Lexical_Elements.Lexical_Element_Access is abstract; not overriding function Semicolon_Token (Self : Assignment_Statement_Text) return not null Program.Lexical_Elements.Lexical_Element_Access is abstract; end Program.Elements.Assignment_Statements;
-- SPDX-License-Identifier: Apache-2.0 -- -- Copyright (c) 2017 onox <denkpadje@gmail.com> -- -- 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.Indefinite_Holders; package GL.Debug.Logs is pragma Preelaborate; package String_Holder is new Ada.Containers.Indefinite_Holders (Element_Type => String); type Message is record From : Source; Kind : Message_Type; Level : Severity; ID : UInt; Message : String_Holder.Holder; end record; type Message_Array is array (Size range <>) of Message; function Message_Log return Message_Array; -- Return an array containing the debug messages that are in the log -- -- After having called this function, the messages that were returned -- in the array are removed from the log. function Logged_Messages return Size; end GL.Debug.Logs;
------------------------------------------------------------------------------ -- -- -- Giza -- -- -- -- Copyright (C) 2016 Fabien Chouteau (chouteau@adacore.com) -- -- -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions are -- -- met: -- -- 1. Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- 2. Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in -- -- the documentation and/or other materials provided with the -- -- distribution. -- -- 3. Neither the name of the copyright holder nor the names of its -- -- contributors may be used to endorse or promote products derived -- -- from this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT -- -- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, -- -- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY -- -- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -- -- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -- -- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ package Giza.Bitmaps.Indexed_4bits is new Giza.Bitmaps.Indexed_Bitmaps (Unsigned_4);
------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ -- This file is generated, don't edit it. ------------------------------------------------------------------------------ with AMF.Generic_Collections; package AMF.UML.Conditional_Nodes.Collections is pragma Preelaborate; package UML_Conditional_Node_Collections is new AMF.Generic_Collections (UML_Conditional_Node, UML_Conditional_Node_Access); type Set_Of_UML_Conditional_Node is new UML_Conditional_Node_Collections.Set with null record; Empty_Set_Of_UML_Conditional_Node : constant Set_Of_UML_Conditional_Node; type Ordered_Set_Of_UML_Conditional_Node is new UML_Conditional_Node_Collections.Ordered_Set with null record; Empty_Ordered_Set_Of_UML_Conditional_Node : constant Ordered_Set_Of_UML_Conditional_Node; type Bag_Of_UML_Conditional_Node is new UML_Conditional_Node_Collections.Bag with null record; Empty_Bag_Of_UML_Conditional_Node : constant Bag_Of_UML_Conditional_Node; type Sequence_Of_UML_Conditional_Node is new UML_Conditional_Node_Collections.Sequence with null record; Empty_Sequence_Of_UML_Conditional_Node : constant Sequence_Of_UML_Conditional_Node; private Empty_Set_Of_UML_Conditional_Node : constant Set_Of_UML_Conditional_Node := (UML_Conditional_Node_Collections.Set with null record); Empty_Ordered_Set_Of_UML_Conditional_Node : constant Ordered_Set_Of_UML_Conditional_Node := (UML_Conditional_Node_Collections.Ordered_Set with null record); Empty_Bag_Of_UML_Conditional_Node : constant Bag_Of_UML_Conditional_Node := (UML_Conditional_Node_Collections.Bag with null record); Empty_Sequence_Of_UML_Conditional_Node : constant Sequence_Of_UML_Conditional_Node := (UML_Conditional_Node_Collections.Sequence with null record); end AMF.UML.Conditional_Nodes.Collections;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- E X P _ S M E M -- -- -- -- B o d y -- -- -- -- Copyright (C) 1998-2014, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING3. If not, go to -- -- http://www.gnu.org/licenses for a complete copy of the license. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Atree; use Atree; with Einfo; use Einfo; with Elists; use Elists; with Exp_Ch7; use Exp_Ch7; with Exp_Ch9; use Exp_Ch9; with Exp_Tss; use Exp_Tss; with Exp_Util; use Exp_Util; with Nmake; use Nmake; with Namet; use Namet; with Nlists; use Nlists; with Rtsfind; use Rtsfind; with Sem; use Sem; with Sem_Aux; use Sem_Aux; with Sem_Util; use Sem_Util; with Sinfo; use Sinfo; with Snames; use Snames; with Stand; use Stand; with Stringt; use Stringt; with Tbuild; use Tbuild; package body Exp_Smem is Insert_Node : Node_Id; -- Node after which a write call is to be inserted ----------------------- -- Local Subprograms -- ----------------------- procedure Add_Read (N : Node_Id; Call : Node_Id := Empty); -- Insert a Shared_Var_ROpen call for variable before node N, unless -- Call is a call to an init-proc, in which case the call is inserted -- after Call. procedure Add_Write_After (N : Node_Id); -- Insert a Shared_Var_WOpen call for variable after the node Insert_Node, -- as recorded by On_Lhs_Of_Assignment (where it points to the assignment -- statement) or Is_Out_Actual (where it points to the subprogram call). -- When Insert_Node is a function call, establish a transient scope around -- the expression, and insert the write as an after-action of the transient -- scope. procedure Build_Full_Name (E : Entity_Id; N : out String_Id); -- Build the fully qualified string name of a shared variable function On_Lhs_Of_Assignment (N : Node_Id) return Boolean; -- Determines if N is on the left hand of the assignment. This means that -- either it is a simple variable, or it is a record or array variable with -- a corresponding selected or indexed component on the left side of an -- assignment. If the result is True, then Insert_Node is set to point -- to the assignment function Is_Out_Actual (N : Node_Id) return Boolean; -- In a similar manner, this function determines if N appears as an OUT -- or IN OUT parameter to a procedure call. If the result is True, then -- Insert_Node is set to point to the call. function Build_Shared_Var_Proc_Call (Loc : Source_Ptr; E : Node_Id; N : Name_Id) return Node_Id; -- Build a call to support procedure N for shared object E (provided by the -- instance of System.Shared_Storage.Shared_Var_Procs associated to E). -------------------------------- -- Build_Shared_Var_Proc_Call -- -------------------------------- function Build_Shared_Var_Proc_Call (Loc : Source_Ptr; E : Entity_Id; N : Name_Id) return Node_Id is begin return Make_Procedure_Call_Statement (Loc, Name => Make_Selected_Component (Loc, Prefix => New_Occurrence_Of (Shared_Var_Procs_Instance (E), Loc), Selector_Name => Make_Identifier (Loc, N))); end Build_Shared_Var_Proc_Call; -------------- -- Add_Read -- -------------- procedure Add_Read (N : Node_Id; Call : Node_Id := Empty) is Loc : constant Source_Ptr := Sloc (N); Ent : constant Node_Id := Entity (N); SVC : Node_Id; begin if Present (Shared_Var_Procs_Instance (Ent)) then SVC := Build_Shared_Var_Proc_Call (Loc, Ent, Name_Read); if Present (Call) and then Is_Init_Proc (Name (Call)) then Insert_After_And_Analyze (Call, SVC); else Insert_Action (N, SVC); end if; end if; end Add_Read; ------------------------------- -- Add_Shared_Var_Lock_Procs -- ------------------------------- procedure Add_Shared_Var_Lock_Procs (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Obj : constant Entity_Id := Entity (Expression (First_Actual (N))); Vnm : String_Id; Vid : Entity_Id; Vde : Node_Id; Aft : constant List_Id := New_List; In_Transient : constant Boolean := Scope_Is_Transient; function Build_Shared_Var_Lock_Call (RE : RE_Id) return Node_Id; -- Return a procedure call statement for lock proc RTE -------------------------------- -- Build_Shared_Var_Lock_Call -- -------------------------------- function Build_Shared_Var_Lock_Call (RE : RE_Id) return Node_Id is begin return Make_Procedure_Call_Statement (Loc, Name => New_Occurrence_Of (RTE (RE), Loc), Parameter_Associations => New_List (New_Occurrence_Of (Vid, Loc))); end Build_Shared_Var_Lock_Call; -- Start of processing for Add_Shared_Var_Lock_Procs begin -- Discussion of transient scopes: we need to have a transient scope -- to hold the required lock/unlock actions. Either the current scope -- is transient, in which case we reuse it, or we establish a new -- transient scope. If this is a function call with unconstrained -- return type, we can't introduce a transient scope here (because -- Wrap_Transient_Expression would need to declare a temporary with -- the unconstrained type outside of the transient block), but in that -- case we know that we have already established one at an outer level -- for secondary stack management purposes. -- If the lock/read/write/unlock actions for this object have already -- been emitted in the current scope, no need to perform them anew. if In_Transient and then Contains (Scope_Stack.Table (Scope_Stack.Last) .Locked_Shared_Objects, Obj) then return; end if; Build_Full_Name (Obj, Vnm); -- Declare a constant string to hold the name of the shared object. -- Note that this must occur outside of the transient scope, as the -- scope's finalizer needs to have access to this object. Also, it -- appears that GIGI does not support elaborating string literal -- subtypes in transient scopes. Vid := Make_Temporary (Loc, 'N', Obj); Vde := Make_Object_Declaration (Loc, Defining_Identifier => Vid, Constant_Present => True, Object_Definition => New_Occurrence_Of (Standard_String, Loc), Expression => Make_String_Literal (Loc, Vnm)); -- Already in a transient scope. Make sure that we insert Vde outside -- that scope. if In_Transient then Insert_Before_And_Analyze (Node_To_Be_Wrapped, Vde); -- Not in a transient scope yet: insert Vde as an action on N prior to -- establishing one. else Insert_Action (N, Vde); Establish_Transient_Scope (N, Sec_Stack => False); end if; -- Mark object as locked in the current (transient) scope Append_New_Elmt (Obj, To => Scope_Stack.Table (Scope_Stack.Last).Locked_Shared_Objects); -- First insert the Lock call before Insert_Action (N, Build_Shared_Var_Lock_Call (RE_Shared_Var_Lock)); -- Now, right after the Lock, insert a call to read the object Insert_Action (N, Build_Shared_Var_Proc_Call (Loc, Obj, Name_Read)); -- For a procedure call only, insert the call to write the object prior -- to unlocking. if Nkind (N) = N_Procedure_Call_Statement then Append_To (Aft, Build_Shared_Var_Proc_Call (Loc, Obj, Name_Write)); end if; -- Finally insert the Unlock call Append_To (Aft, Build_Shared_Var_Lock_Call (RE_Shared_Var_Unlock)); -- Store cleanup actions in transient scope Store_Cleanup_Actions_In_Scope (Aft); -- If we have established a transient scope here, wrap it now if not In_Transient then if Nkind (N) = N_Procedure_Call_Statement then Wrap_Transient_Statement (N); else Wrap_Transient_Expression (N); end if; end if; end Add_Shared_Var_Lock_Procs; --------------------- -- Add_Write_After -- --------------------- procedure Add_Write_After (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Ent : constant Entity_Id := Entity (N); Par : constant Node_Id := Insert_Node; begin if Present (Shared_Var_Procs_Instance (Ent)) then if Nkind (Insert_Node) = N_Function_Call then Establish_Transient_Scope (Insert_Node, Sec_Stack => False); Store_After_Actions_In_Scope (New_List ( Build_Shared_Var_Proc_Call (Loc, Ent, Name_Write))); else Insert_After_And_Analyze (Par, Build_Shared_Var_Proc_Call (Loc, Ent, Name_Write)); end if; end if; end Add_Write_After; --------------------- -- Build_Full_Name -- --------------------- procedure Build_Full_Name (E : Entity_Id; N : out String_Id) is procedure Build_Name (E : Entity_Id); -- This is a recursive routine used to construct the fully qualified -- string name of the package corresponding to the shared variable. ---------------- -- Build_Name -- ---------------- procedure Build_Name (E : Entity_Id) is begin if Scope (E) /= Standard_Standard then Build_Name (Scope (E)); Store_String_Char ('.'); end if; Get_Decoded_Name_String (Chars (E)); Store_String_Chars (Name_Buffer (1 .. Name_Len)); end Build_Name; -- Start of processing for Build_Full_Name begin Start_String; Build_Name (E); N := End_String; end Build_Full_Name; ------------------------------------ -- Expand_Shared_Passive_Variable -- ------------------------------------ procedure Expand_Shared_Passive_Variable (N : Node_Id) is Typ : constant Entity_Id := Etype (N); begin -- Nothing to do for protected or limited objects if Is_Limited_Type (Typ) or else Is_Concurrent_Type (Typ) then return; -- If we are on the left hand side of an assignment, then we add the -- write call after the assignment. elsif On_Lhs_Of_Assignment (N) then Add_Write_After (N); -- If we are a parameter for an out or in out formal, then in general -- we do: -- read -- call -- write -- but in the special case of a call to an init proc, we need to first -- call the init proc (to set discriminants), then read (to possibly -- set other components), then write (to record the updated components -- to the backing store): -- init-proc-call -- read -- write elsif Is_Out_Actual (N) then -- Note: For an init proc call, Add_Read inserts just after the -- call node, and we want to have first the read, then the write, -- so we need to first Add_Write_After, then Add_Read. Add_Write_After (N); Add_Read (N, Call => Insert_Node); -- All other cases are simple reads else Add_Read (N); end if; end Expand_Shared_Passive_Variable; ------------------- -- Is_Out_Actual -- ------------------- function Is_Out_Actual (N : Node_Id) return Boolean is Formal : Entity_Id; Call : Node_Id; begin Find_Actual (N, Formal, Call); if No (Formal) then return False; else if Ekind_In (Formal, E_Out_Parameter, E_In_Out_Parameter) then Insert_Node := Call; return True; else return False; end if; end if; end Is_Out_Actual; --------------------------- -- Make_Shared_Var_Procs -- --------------------------- function Make_Shared_Var_Procs (N : Node_Id) return Node_Id is Loc : constant Source_Ptr := Sloc (N); Ent : constant Entity_Id := Defining_Identifier (N); Typ : constant Entity_Id := Etype (Ent); Vnm : String_Id; Obj : Node_Id; Obj_Typ : Entity_Id; After : constant Node_Id := Next (N); -- Node located right after N originally (after insertion of the SV -- procs this node is right after the last inserted node). SVP_Instance : constant Entity_Id := Make_Defining_Identifier (Loc, Chars => New_External_Name (Chars (Ent), 'G')); -- Instance of Shared_Storage.Shared_Var_Procs associated with Ent Instantiation : Node_Id; -- Package instantiation node for SVP_Instance -- Start of processing for Make_Shared_Var_Procs begin Build_Full_Name (Ent, Vnm); -- We turn off Shared_Passive during construction and analysis of the -- generic package instantiation, to avoid improper attempts to process -- the variable references within these instantiation. Set_Is_Shared_Passive (Ent, False); -- Construct generic package instantiation -- package varG is new Shared_Var_Procs (typ, var, "pkg.var"); Obj := New_Occurrence_Of (Ent, Loc); Obj_Typ := Typ; if Is_Concurrent_Type (Typ) then Obj := Convert_Concurrent (N => Obj, Typ => Typ); Obj_Typ := Corresponding_Record_Type (Typ); end if; Instantiation := Make_Package_Instantiation (Loc, Defining_Unit_Name => SVP_Instance, Name => New_Occurrence_Of (RTE (RE_Shared_Var_Procs), Loc), Generic_Associations => New_List ( Make_Generic_Association (Loc, Explicit_Generic_Actual_Parameter => New_Occurrence_Of (Obj_Typ, Loc)), Make_Generic_Association (Loc, Explicit_Generic_Actual_Parameter => Obj), Make_Generic_Association (Loc, Explicit_Generic_Actual_Parameter => Make_String_Literal (Loc, Vnm)))); Insert_After_And_Analyze (N, Instantiation); Set_Is_Shared_Passive (Ent, True); Set_Shared_Var_Procs_Instance (Ent, Defining_Entity (Instance_Spec (Instantiation))); -- Return last node before After declare Nod : Node_Id := Next (N); begin while Next (Nod) /= After loop Nod := Next (Nod); end loop; return Nod; end; end Make_Shared_Var_Procs; -------------------------- -- On_Lhs_Of_Assignment -- -------------------------- function On_Lhs_Of_Assignment (N : Node_Id) return Boolean is P : constant Node_Id := Parent (N); begin if Nkind (P) = N_Assignment_Statement then if N = Name (P) then Insert_Node := P; return True; else return False; end if; elsif Nkind_In (P, N_Indexed_Component, N_Selected_Component) and then N = Prefix (P) then return On_Lhs_Of_Assignment (P); else return False; end if; end On_Lhs_Of_Assignment; end Exp_Smem;
pragma Style_Checks (Off); with Interfaces.C; use Interfaces.C; with Interfaces.C.Strings; package pulse_version_h is -- arg-macro: function pa_get_headers_version () -- return "5.0.0"; PA_API_VERSION : constant := 12; -- /usr/include/pulse/version.h:48 PA_PROTOCOL_VERSION : constant := 29; -- /usr/include/pulse/version.h:52 PA_MAJOR : constant := 5; -- /usr/include/pulse/version.h:55 PA_MINOR : constant := 0; -- /usr/include/pulse/version.h:58 PA_MICRO : constant := 0; -- /usr/include/pulse/version.h:61 -- arg-macro: function PA_CHECK_VERSION (major, minor, micro) -- return (PA_MAJOR > (major)) or else (PA_MAJOR = (major) and then PA_MINOR > (minor)) or else (PA_MAJOR = (major) and then PA_MINOR = (minor) and then PA_MICRO >= (micro)); --** -- This file is part of PulseAudio. -- Copyright 2004-2006 Lennart Poettering -- Copyright 2006 Pierre Ossman <ossman@cendio.se> for Cendio AB -- PulseAudio 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 of the License, -- or (at your option) any later version. -- PulseAudio 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 Lesser General Public License -- along with PulseAudio; if not, write to the Free Software -- Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 -- USA. --** -- WARNING: Make sure to edit the real source file version.h.in! --* \file -- * Define header version --* Return the version of the header files. Keep in mind that this is --a macro and not a function, so it is impossible to get the pointer of --it. --* Return the version of the library the current application is -- * linked to. function pa_get_library_version return Interfaces.C.Strings.chars_ptr; -- /usr/include/pulse/version.h:42 pragma Import (C, pa_get_library_version, "pa_get_library_version"); --* The current API version. Version 6 relates to Polypaudio -- * 0.6. Prior versions (i.e. Polypaudio 0.5.1 and older) have -- * PA_API_VERSION undefined. Please note that this is only ever -- * increased on incompatible API changes! --* The current protocol version. Version 8 relates to Polypaudio -- * 0.8/PulseAudio 0.9. --* The major version of PA. \since 0.9.15 --* The minor version of PA. \since 0.9.15 --* The micro version of PA (will always be 0 from v1.0 onwards). \since 0.9.15 --* Evaluates to TRUE if the PulseAudio library version is equal or -- * newer than the specified. \since 0.9.16 end pulse_version_h;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . S T R I N G S . W I D E _ S U P E R B O U N D E D -- -- -- -- S p e c -- -- -- -- Copyright (C) 2003-2020, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This non generic package contains most of the implementation of the -- generic package Ada.Strings.Wide_Bounded.Generic_Bounded_Length. -- It defines type Super_String as a discriminated record with the maximum -- length as the discriminant. Individual instantiations of the package -- Strings.Wide_Bounded.Generic_Bounded_Length use this type with -- an appropriate discriminant value set. with Ada.Strings.Wide_Maps; package Ada.Strings.Wide_Superbounded is pragma Preelaborate; Wide_NUL : constant Wide_Character := Wide_Character'Val (0); -- Ada.Strings.Wide_Bounded.Generic_Bounded_Length.Wide_Bounded_String is -- derived from Super_String, with the constraint of the maximum length. type Super_String (Max_Length : Positive) is record Current_Length : Natural := 0; Data : Wide_String (1 .. Max_Length); -- A previous version had a default initial value for Data, which is -- no longer necessary, because we now special-case this type in the -- compiler, so "=" composes properly for descendants of this type. -- Leaving it out is more efficient. end record; -- The subprograms defined for Super_String are similar to those defined -- for Bounded_Wide_String, except that they have different names, so that -- they can be renamed in Ada.Strings.Wide_Bounded.Generic_Bounded_Length. function Super_Length (Source : Super_String) return Natural; -------------------------------------------------------- -- Conversion, Concatenation, and Selection Functions -- -------------------------------------------------------- function To_Super_String (Source : Wide_String; Max_Length : Natural; Drop : Truncation := Error) return Super_String; -- Note the additional parameter Max_Length, which specifies the maximum -- length setting of the resulting Super_String value. -- The following procedures have declarations (and semantics) that are -- exactly analogous to those declared in Ada.Strings.Wide_Bounded. function Super_To_String (Source : Super_String) return Wide_String; procedure Set_Super_String (Target : out Super_String; Source : Wide_String; Drop : Truncation := Error); function Super_Append (Left : Super_String; Right : Super_String; Drop : Truncation := Error) return Super_String; function Super_Append (Left : Super_String; Right : Wide_String; Drop : Truncation := Error) return Super_String; function Super_Append (Left : Wide_String; Right : Super_String; Drop : Truncation := Error) return Super_String; function Super_Append (Left : Super_String; Right : Wide_Character; Drop : Truncation := Error) return Super_String; function Super_Append (Left : Wide_Character; Right : Super_String; Drop : Truncation := Error) return Super_String; procedure Super_Append (Source : in out Super_String; New_Item : Super_String; Drop : Truncation := Error); procedure Super_Append (Source : in out Super_String; New_Item : Wide_String; Drop : Truncation := Error); procedure Super_Append (Source : in out Super_String; New_Item : Wide_Character; Drop : Truncation := Error); function Concat (Left : Super_String; Right : Super_String) return Super_String; function Concat (Left : Super_String; Right : Wide_String) return Super_String; function Concat (Left : Wide_String; Right : Super_String) return Super_String; function Concat (Left : Super_String; Right : Wide_Character) return Super_String; function Concat (Left : Wide_Character; Right : Super_String) return Super_String; function Super_Element (Source : Super_String; Index : Positive) return Wide_Character; procedure Super_Replace_Element (Source : in out Super_String; Index : Positive; By : Wide_Character); function Super_Slice (Source : Super_String; Low : Positive; High : Natural) return Wide_String; function Super_Slice (Source : Super_String; Low : Positive; High : Natural) return Super_String; procedure Super_Slice (Source : Super_String; Target : out Super_String; Low : Positive; High : Natural); function "=" (Left : Super_String; Right : Super_String) return Boolean; function Equal (Left : Super_String; Right : Super_String) return Boolean renames "="; function Equal (Left : Super_String; Right : Wide_String) return Boolean; function Equal (Left : Wide_String; Right : Super_String) return Boolean; function Less (Left : Super_String; Right : Super_String) return Boolean; function Less (Left : Super_String; Right : Wide_String) return Boolean; function Less (Left : Wide_String; Right : Super_String) return Boolean; function Less_Or_Equal (Left : Super_String; Right : Super_String) return Boolean; function Less_Or_Equal (Left : Super_String; Right : Wide_String) return Boolean; function Less_Or_Equal (Left : Wide_String; Right : Super_String) return Boolean; function Greater (Left : Super_String; Right : Super_String) return Boolean; function Greater (Left : Super_String; Right : Wide_String) return Boolean; function Greater (Left : Wide_String; Right : Super_String) return Boolean; function Greater_Or_Equal (Left : Super_String; Right : Super_String) return Boolean; function Greater_Or_Equal (Left : Super_String; Right : Wide_String) return Boolean; function Greater_Or_Equal (Left : Wide_String; Right : Super_String) return Boolean; ---------------------- -- Search Functions -- ---------------------- function Super_Index (Source : Super_String; Pattern : Wide_String; Going : Direction := Forward; Mapping : Wide_Maps.Wide_Character_Mapping := Wide_Maps.Identity) return Natural; function Super_Index (Source : Super_String; Pattern : Wide_String; Going : Direction := Forward; Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Natural; function Super_Index (Source : Super_String; Set : Wide_Maps.Wide_Character_Set; Test : Membership := Inside; Going : Direction := Forward) return Natural; function Super_Index (Source : Super_String; Pattern : Wide_String; From : Positive; Going : Direction := Forward; Mapping : Wide_Maps.Wide_Character_Mapping := Wide_Maps.Identity) return Natural; function Super_Index (Source : Super_String; Pattern : Wide_String; From : Positive; Going : Direction := Forward; Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Natural; function Super_Index (Source : Super_String; Set : Wide_Maps.Wide_Character_Set; From : Positive; Test : Membership := Inside; Going : Direction := Forward) return Natural; function Super_Index_Non_Blank (Source : Super_String; Going : Direction := Forward) return Natural; function Super_Index_Non_Blank (Source : Super_String; From : Positive; Going : Direction := Forward) return Natural; function Super_Count (Source : Super_String; Pattern : Wide_String; Mapping : Wide_Maps.Wide_Character_Mapping := Wide_Maps.Identity) return Natural; function Super_Count (Source : Super_String; Pattern : Wide_String; Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Natural; function Super_Count (Source : Super_String; Set : Wide_Maps.Wide_Character_Set) return Natural; procedure Super_Find_Token (Source : Super_String; Set : Wide_Maps.Wide_Character_Set; From : Positive; Test : Membership; First : out Positive; Last : out Natural); procedure Super_Find_Token (Source : Super_String; Set : Wide_Maps.Wide_Character_Set; Test : Membership; First : out Positive; Last : out Natural); ------------------------------------ -- String Translation Subprograms -- ------------------------------------ function Super_Translate (Source : Super_String; Mapping : Wide_Maps.Wide_Character_Mapping) return Super_String; procedure Super_Translate (Source : in out Super_String; Mapping : Wide_Maps.Wide_Character_Mapping); function Super_Translate (Source : Super_String; Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Super_String; procedure Super_Translate (Source : in out Super_String; Mapping : Wide_Maps.Wide_Character_Mapping_Function); --------------------------------------- -- String Transformation Subprograms -- --------------------------------------- function Super_Replace_Slice (Source : Super_String; Low : Positive; High : Natural; By : Wide_String; Drop : Truncation := Error) return Super_String; procedure Super_Replace_Slice (Source : in out Super_String; Low : Positive; High : Natural; By : Wide_String; Drop : Truncation := Error); function Super_Insert (Source : Super_String; Before : Positive; New_Item : Wide_String; Drop : Truncation := Error) return Super_String; procedure Super_Insert (Source : in out Super_String; Before : Positive; New_Item : Wide_String; Drop : Truncation := Error); function Super_Overwrite (Source : Super_String; Position : Positive; New_Item : Wide_String; Drop : Truncation := Error) return Super_String; procedure Super_Overwrite (Source : in out Super_String; Position : Positive; New_Item : Wide_String; Drop : Truncation := Error); function Super_Delete (Source : Super_String; From : Positive; Through : Natural) return Super_String; procedure Super_Delete (Source : in out Super_String; From : Positive; Through : Natural); --------------------------------- -- String Selector Subprograms -- --------------------------------- function Super_Trim (Source : Super_String; Side : Trim_End) return Super_String; procedure Super_Trim (Source : in out Super_String; Side : Trim_End); function Super_Trim (Source : Super_String; Left : Wide_Maps.Wide_Character_Set; Right : Wide_Maps.Wide_Character_Set) return Super_String; procedure Super_Trim (Source : in out Super_String; Left : Wide_Maps.Wide_Character_Set; Right : Wide_Maps.Wide_Character_Set); function Super_Head (Source : Super_String; Count : Natural; Pad : Wide_Character := Wide_Space; Drop : Truncation := Error) return Super_String; procedure Super_Head (Source : in out Super_String; Count : Natural; Pad : Wide_Character := Wide_Space; Drop : Truncation := Error); function Super_Tail (Source : Super_String; Count : Natural; Pad : Wide_Character := Wide_Space; Drop : Truncation := Error) return Super_String; procedure Super_Tail (Source : in out Super_String; Count : Natural; Pad : Wide_Character := Wide_Space; Drop : Truncation := Error); ------------------------------------ -- String Constructor Subprograms -- ------------------------------------ -- Note: in some of the following routines, there is an extra parameter -- Max_Length which specifies the value of the maximum length for the -- resulting Super_String value. function Times (Left : Natural; Right : Wide_Character; Max_Length : Positive) return Super_String; -- Note the additional parameter Max_Length function Times (Left : Natural; Right : Wide_String; Max_Length : Positive) return Super_String; -- Note the additional parameter Max_Length function Times (Left : Natural; Right : Super_String) return Super_String; function Super_Replicate (Count : Natural; Item : Wide_Character; Drop : Truncation := Error; Max_Length : Positive) return Super_String; -- Note the additional parameter Max_Length function Super_Replicate (Count : Natural; Item : Wide_String; Drop : Truncation := Error; Max_Length : Positive) return Super_String; -- Note the additional parameter Max_Length function Super_Replicate (Count : Natural; Item : Super_String; Drop : Truncation := Error) return Super_String; private -- Pragma Inline declarations pragma Inline ("="); pragma Inline (Less); pragma Inline (Less_Or_Equal); pragma Inline (Greater); pragma Inline (Greater_Or_Equal); pragma Inline (Concat); pragma Inline (Super_Count); pragma Inline (Super_Element); pragma Inline (Super_Find_Token); pragma Inline (Super_Index); pragma Inline (Super_Index_Non_Blank); pragma Inline (Super_Length); pragma Inline (Super_Replace_Element); pragma Inline (Super_Slice); pragma Inline (Super_To_String); end Ada.Strings.Wide_Superbounded;
------------------------------------------------------------------------------ -- -- -- THIS IS AN AUTOMATICALLY GENERATED FILE! DO NOT EDIT! -- -- -- -- WAVEFILES -- -- -- -- Test application -- -- -- -- The MIT License (MIT) -- -- -- -- Copyright (c) 2020 Gustavo A. Hoffmann -- -- -- -- 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. -- ------------------------------------------------------------------------------ #if NUM_TYPE'Defined and then (NUM_TYPE = "FLOAT") then package body Generic_Float_PCM_Buffer_Ops is #else package body Generic_Fixed_PCM_Buffer_Ops is #end if; --------- -- "+" -- --------- function "+" (PCM_Ref : PCM_MC_Sample; PCM_DUT : PCM_MC_Sample) return PCM_MC_Sample is Max_Last : constant Positive := Positive'Max (PCM_Ref'Last, PCM_DUT'Last); PCM_Sum : PCM_MC_Sample (1 .. Max_Last); begin for I in 1 .. Max_Last loop PCM_Sum (I) := PCM_Ref (I) + PCM_DUT (I); end loop; return PCM_Sum; end "+"; --------- -- "-" -- --------- function "-" (PCM_Ref : PCM_MC_Sample; PCM_DUT : PCM_MC_Sample) return PCM_MC_Sample is Max_Last : constant Positive := Positive'Max (PCM_Ref'Last, PCM_DUT'Last); PCM_Diff : PCM_MC_Sample (1 .. Max_Last); begin for I in 1 .. Max_Last loop PCM_Diff (I) := PCM_Ref (I) - PCM_DUT (I); end loop; return PCM_Diff; end "-"; #if NUM_TYPE'Defined and then (NUM_TYPE = "FLOAT") then end Generic_Float_PCM_Buffer_Ops; #else end Generic_Fixed_PCM_Buffer_Ops; #end if;
pragma Style_Checks (Off); -- This spec has been automatically generated from STM32F3x4.svd pragma Restrictions (No_Elaboration_Code); with HAL; with System; package STM32_SVD.TSC is pragma Preelaborate; --------------- -- Registers -- --------------- subtype CR_MCV_Field is HAL.UInt3; subtype CR_PGPSC_Field is HAL.UInt3; subtype CR_SSD_Field is HAL.UInt7; subtype CR_CTPL_Field is HAL.UInt4; subtype CR_CTPH_Field is HAL.UInt4; -- control register type CR_Register is record -- Touch sensing controller enable TSCE : Boolean := False; -- Start a new acquisition START : Boolean := False; -- Acquisition mode AM : Boolean := False; -- Synchronization pin polarity SYNCPOL : Boolean := False; -- I/O Default mode IODEF : Boolean := False; -- Max count value MCV : CR_MCV_Field := 16#0#; -- unspecified Reserved_8_11 : HAL.UInt4 := 16#0#; -- pulse generator prescaler PGPSC : CR_PGPSC_Field := 16#0#; -- Spread spectrum prescaler SSPSC : Boolean := False; -- Spread spectrum enable SSE : Boolean := False; -- Spread spectrum deviation SSD : CR_SSD_Field := 16#0#; -- Charge transfer pulse low CTPL : CR_CTPL_Field := 16#0#; -- Charge transfer pulse high CTPH : CR_CTPH_Field := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for CR_Register use record TSCE at 0 range 0 .. 0; START at 0 range 1 .. 1; AM at 0 range 2 .. 2; SYNCPOL at 0 range 3 .. 3; IODEF at 0 range 4 .. 4; MCV at 0 range 5 .. 7; Reserved_8_11 at 0 range 8 .. 11; PGPSC at 0 range 12 .. 14; SSPSC at 0 range 15 .. 15; SSE at 0 range 16 .. 16; SSD at 0 range 17 .. 23; CTPL at 0 range 24 .. 27; CTPH at 0 range 28 .. 31; end record; -- interrupt enable register type IER_Register is record -- End of acquisition interrupt enable EOAIE : Boolean := False; -- Max count error interrupt enable MCEIE : Boolean := False; -- unspecified Reserved_2_31 : HAL.UInt30 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IER_Register use record EOAIE at 0 range 0 .. 0; MCEIE at 0 range 1 .. 1; Reserved_2_31 at 0 range 2 .. 31; end record; -- interrupt clear register type ICR_Register is record -- End of acquisition interrupt clear EOAIC : Boolean := False; -- Max count error interrupt clear MCEIC : Boolean := False; -- unspecified Reserved_2_31 : HAL.UInt30 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for ICR_Register use record EOAIC at 0 range 0 .. 0; MCEIC at 0 range 1 .. 1; Reserved_2_31 at 0 range 2 .. 31; end record; -- interrupt status register type ISR_Register is record -- End of acquisition flag EOAF : Boolean := False; -- Max count error flag MCEF : Boolean := False; -- unspecified Reserved_2_31 : HAL.UInt30 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for ISR_Register use record EOAF at 0 range 0 .. 0; MCEF at 0 range 1 .. 1; Reserved_2_31 at 0 range 2 .. 31; end record; -- IOHCR_G1_IO array type IOHCR_G1_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOHCR_G1_IO type IOHCR_G1_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G1_IO as a value Val : HAL.UInt4; when True => -- G1_IO as an array Arr : IOHCR_G1_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOHCR_G1_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOHCR_G2_IO array type IOHCR_G2_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOHCR_G2_IO type IOHCR_G2_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G2_IO as a value Val : HAL.UInt4; when True => -- G2_IO as an array Arr : IOHCR_G2_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOHCR_G2_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOHCR_G3_IO array type IOHCR_G3_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOHCR_G3_IO type IOHCR_G3_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G3_IO as a value Val : HAL.UInt4; when True => -- G3_IO as an array Arr : IOHCR_G3_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOHCR_G3_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOHCR_G4_IO array type IOHCR_G4_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOHCR_G4_IO type IOHCR_G4_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G4_IO as a value Val : HAL.UInt4; when True => -- G4_IO as an array Arr : IOHCR_G4_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOHCR_G4_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOHCR_G5_IO array type IOHCR_G5_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOHCR_G5_IO type IOHCR_G5_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G5_IO as a value Val : HAL.UInt4; when True => -- G5_IO as an array Arr : IOHCR_G5_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOHCR_G5_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOHCR_G6_IO array type IOHCR_G6_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOHCR_G6_IO type IOHCR_G6_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G6_IO as a value Val : HAL.UInt4; when True => -- G6_IO as an array Arr : IOHCR_G6_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOHCR_G6_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOHCR_G7_IO array type IOHCR_G7_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOHCR_G7_IO type IOHCR_G7_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G7_IO as a value Val : HAL.UInt4; when True => -- G7_IO as an array Arr : IOHCR_G7_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOHCR_G7_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOHCR_G8_IO array type IOHCR_G8_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOHCR_G8_IO type IOHCR_G8_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G8_IO as a value Val : HAL.UInt4; when True => -- G8_IO as an array Arr : IOHCR_G8_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOHCR_G8_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- I/O hysteresis control register type IOHCR_Register is record -- G1_IO1 Schmitt trigger hysteresis mode G1_IO : IOHCR_G1_IO_Field := (As_Array => False, Val => 16#1#); -- G2_IO1 Schmitt trigger hysteresis mode G2_IO : IOHCR_G2_IO_Field := (As_Array => False, Val => 16#1#); -- G3_IO1 Schmitt trigger hysteresis mode G3_IO : IOHCR_G3_IO_Field := (As_Array => False, Val => 16#1#); -- G4_IO1 Schmitt trigger hysteresis mode G4_IO : IOHCR_G4_IO_Field := (As_Array => False, Val => 16#1#); -- G5_IO1 Schmitt trigger hysteresis mode G5_IO : IOHCR_G5_IO_Field := (As_Array => False, Val => 16#1#); -- G6_IO1 Schmitt trigger hysteresis mode G6_IO : IOHCR_G6_IO_Field := (As_Array => False, Val => 16#1#); -- G7_IO1 Schmitt trigger hysteresis mode G7_IO : IOHCR_G7_IO_Field := (As_Array => False, Val => 16#1#); -- G8_IO1 Schmitt trigger hysteresis mode G8_IO : IOHCR_G8_IO_Field := (As_Array => False, Val => 16#1#); end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOHCR_Register use record G1_IO at 0 range 0 .. 3; G2_IO at 0 range 4 .. 7; G3_IO at 0 range 8 .. 11; G4_IO at 0 range 12 .. 15; G5_IO at 0 range 16 .. 19; G6_IO at 0 range 20 .. 23; G7_IO at 0 range 24 .. 27; G8_IO at 0 range 28 .. 31; end record; -- IOASCR_G1_IO array type IOASCR_G1_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOASCR_G1_IO type IOASCR_G1_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G1_IO as a value Val : HAL.UInt4; when True => -- G1_IO as an array Arr : IOASCR_G1_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOASCR_G1_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOASCR_G2_IO array type IOASCR_G2_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOASCR_G2_IO type IOASCR_G2_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G2_IO as a value Val : HAL.UInt4; when True => -- G2_IO as an array Arr : IOASCR_G2_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOASCR_G2_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOASCR_G3_IO array type IOASCR_G3_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOASCR_G3_IO type IOASCR_G3_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G3_IO as a value Val : HAL.UInt4; when True => -- G3_IO as an array Arr : IOASCR_G3_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOASCR_G3_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOASCR_G4_IO array type IOASCR_G4_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOASCR_G4_IO type IOASCR_G4_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G4_IO as a value Val : HAL.UInt4; when True => -- G4_IO as an array Arr : IOASCR_G4_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOASCR_G4_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOASCR_G5_IO array type IOASCR_G5_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOASCR_G5_IO type IOASCR_G5_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G5_IO as a value Val : HAL.UInt4; when True => -- G5_IO as an array Arr : IOASCR_G5_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOASCR_G5_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOASCR_G6_IO array type IOASCR_G6_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOASCR_G6_IO type IOASCR_G6_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G6_IO as a value Val : HAL.UInt4; when True => -- G6_IO as an array Arr : IOASCR_G6_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOASCR_G6_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOASCR_G7_IO array type IOASCR_G7_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOASCR_G7_IO type IOASCR_G7_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G7_IO as a value Val : HAL.UInt4; when True => -- G7_IO as an array Arr : IOASCR_G7_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOASCR_G7_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOASCR_G8_IO array type IOASCR_G8_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOASCR_G8_IO type IOASCR_G8_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G8_IO as a value Val : HAL.UInt4; when True => -- G8_IO as an array Arr : IOASCR_G8_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOASCR_G8_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- I/O analog switch control register type IOASCR_Register is record -- G1_IO1 analog switch enable G1_IO : IOASCR_G1_IO_Field := (As_Array => False, Val => 16#0#); -- G2_IO1 analog switch enable G2_IO : IOASCR_G2_IO_Field := (As_Array => False, Val => 16#0#); -- G3_IO1 analog switch enable G3_IO : IOASCR_G3_IO_Field := (As_Array => False, Val => 16#0#); -- G4_IO1 analog switch enable G4_IO : IOASCR_G4_IO_Field := (As_Array => False, Val => 16#0#); -- G5_IO1 analog switch enable G5_IO : IOASCR_G5_IO_Field := (As_Array => False, Val => 16#0#); -- G6_IO1 analog switch enable G6_IO : IOASCR_G6_IO_Field := (As_Array => False, Val => 16#0#); -- G7_IO1 analog switch enable G7_IO : IOASCR_G7_IO_Field := (As_Array => False, Val => 16#0#); -- G8_IO1 analog switch enable G8_IO : IOASCR_G8_IO_Field := (As_Array => False, Val => 16#0#); end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOASCR_Register use record G1_IO at 0 range 0 .. 3; G2_IO at 0 range 4 .. 7; G3_IO at 0 range 8 .. 11; G4_IO at 0 range 12 .. 15; G5_IO at 0 range 16 .. 19; G6_IO at 0 range 20 .. 23; G7_IO at 0 range 24 .. 27; G8_IO at 0 range 28 .. 31; end record; -- IOSCR_G1_IO array type IOSCR_G1_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOSCR_G1_IO type IOSCR_G1_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G1_IO as a value Val : HAL.UInt4; when True => -- G1_IO as an array Arr : IOSCR_G1_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOSCR_G1_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOSCR_G2_IO array type IOSCR_G2_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOSCR_G2_IO type IOSCR_G2_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G2_IO as a value Val : HAL.UInt4; when True => -- G2_IO as an array Arr : IOSCR_G2_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOSCR_G2_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOSCR_G3_IO array type IOSCR_G3_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOSCR_G3_IO type IOSCR_G3_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G3_IO as a value Val : HAL.UInt4; when True => -- G3_IO as an array Arr : IOSCR_G3_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOSCR_G3_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOSCR_G4_IO array type IOSCR_G4_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOSCR_G4_IO type IOSCR_G4_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G4_IO as a value Val : HAL.UInt4; when True => -- G4_IO as an array Arr : IOSCR_G4_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOSCR_G4_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOSCR_G5_IO array type IOSCR_G5_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOSCR_G5_IO type IOSCR_G5_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G5_IO as a value Val : HAL.UInt4; when True => -- G5_IO as an array Arr : IOSCR_G5_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOSCR_G5_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOSCR_G6_IO array type IOSCR_G6_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOSCR_G6_IO type IOSCR_G6_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G6_IO as a value Val : HAL.UInt4; when True => -- G6_IO as an array Arr : IOSCR_G6_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOSCR_G6_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOSCR_G7_IO array type IOSCR_G7_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOSCR_G7_IO type IOSCR_G7_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G7_IO as a value Val : HAL.UInt4; when True => -- G7_IO as an array Arr : IOSCR_G7_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOSCR_G7_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOSCR_G8_IO array type IOSCR_G8_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOSCR_G8_IO type IOSCR_G8_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G8_IO as a value Val : HAL.UInt4; when True => -- G8_IO as an array Arr : IOSCR_G8_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOSCR_G8_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- I/O sampling control register type IOSCR_Register is record -- G1_IO1 sampling mode G1_IO : IOSCR_G1_IO_Field := (As_Array => False, Val => 16#0#); -- G2_IO1 sampling mode G2_IO : IOSCR_G2_IO_Field := (As_Array => False, Val => 16#0#); -- G3_IO1 sampling mode G3_IO : IOSCR_G3_IO_Field := (As_Array => False, Val => 16#0#); -- G4_IO1 sampling mode G4_IO : IOSCR_G4_IO_Field := (As_Array => False, Val => 16#0#); -- G5_IO1 sampling mode G5_IO : IOSCR_G5_IO_Field := (As_Array => False, Val => 16#0#); -- G6_IO1 sampling mode G6_IO : IOSCR_G6_IO_Field := (As_Array => False, Val => 16#0#); -- G7_IO1 sampling mode G7_IO : IOSCR_G7_IO_Field := (As_Array => False, Val => 16#0#); -- G8_IO1 sampling mode G8_IO : IOSCR_G8_IO_Field := (As_Array => False, Val => 16#0#); end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOSCR_Register use record G1_IO at 0 range 0 .. 3; G2_IO at 0 range 4 .. 7; G3_IO at 0 range 8 .. 11; G4_IO at 0 range 12 .. 15; G5_IO at 0 range 16 .. 19; G6_IO at 0 range 20 .. 23; G7_IO at 0 range 24 .. 27; G8_IO at 0 range 28 .. 31; end record; -- IOCCR_G1_IO array type IOCCR_G1_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOCCR_G1_IO type IOCCR_G1_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G1_IO as a value Val : HAL.UInt4; when True => -- G1_IO as an array Arr : IOCCR_G1_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOCCR_G1_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOCCR_G2_IO array type IOCCR_G2_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOCCR_G2_IO type IOCCR_G2_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G2_IO as a value Val : HAL.UInt4; when True => -- G2_IO as an array Arr : IOCCR_G2_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOCCR_G2_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOCCR_G3_IO array type IOCCR_G3_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOCCR_G3_IO type IOCCR_G3_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G3_IO as a value Val : HAL.UInt4; when True => -- G3_IO as an array Arr : IOCCR_G3_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOCCR_G3_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOCCR_G4_IO array type IOCCR_G4_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOCCR_G4_IO type IOCCR_G4_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G4_IO as a value Val : HAL.UInt4; when True => -- G4_IO as an array Arr : IOCCR_G4_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOCCR_G4_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOCCR_G5_IO array type IOCCR_G5_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOCCR_G5_IO type IOCCR_G5_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G5_IO as a value Val : HAL.UInt4; when True => -- G5_IO as an array Arr : IOCCR_G5_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOCCR_G5_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOCCR_G6_IO array type IOCCR_G6_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOCCR_G6_IO type IOCCR_G6_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G6_IO as a value Val : HAL.UInt4; when True => -- G6_IO as an array Arr : IOCCR_G6_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOCCR_G6_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOCCR_G7_IO array type IOCCR_G7_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOCCR_G7_IO type IOCCR_G7_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G7_IO as a value Val : HAL.UInt4; when True => -- G7_IO as an array Arr : IOCCR_G7_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOCCR_G7_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- IOCCR_G8_IO array type IOCCR_G8_IO_Field_Array is array (1 .. 4) of Boolean with Component_Size => 1, Size => 4; -- Type definition for IOCCR_G8_IO type IOCCR_G8_IO_Field (As_Array : Boolean := False) is record case As_Array is when False => -- G8_IO as a value Val : HAL.UInt4; when True => -- G8_IO as an array Arr : IOCCR_G8_IO_Field_Array; end case; end record with Unchecked_Union, Size => 4; for IOCCR_G8_IO_Field use record Val at 0 range 0 .. 3; Arr at 0 range 0 .. 3; end record; -- I/O channel control register type IOCCR_Register is record -- G1_IO1 channel mode G1_IO : IOCCR_G1_IO_Field := (As_Array => False, Val => 16#0#); -- G2_IO1 channel mode G2_IO : IOCCR_G2_IO_Field := (As_Array => False, Val => 16#0#); -- G3_IO1 channel mode G3_IO : IOCCR_G3_IO_Field := (As_Array => False, Val => 16#0#); -- G4_IO1 channel mode G4_IO : IOCCR_G4_IO_Field := (As_Array => False, Val => 16#0#); -- G5_IO1 channel mode G5_IO : IOCCR_G5_IO_Field := (As_Array => False, Val => 16#0#); -- G6_IO1 channel mode G6_IO : IOCCR_G6_IO_Field := (As_Array => False, Val => 16#0#); -- G7_IO1 channel mode G7_IO : IOCCR_G7_IO_Field := (As_Array => False, Val => 16#0#); -- G8_IO1 channel mode G8_IO : IOCCR_G8_IO_Field := (As_Array => False, Val => 16#0#); end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOCCR_Register use record G1_IO at 0 range 0 .. 3; G2_IO at 0 range 4 .. 7; G3_IO at 0 range 8 .. 11; G4_IO at 0 range 12 .. 15; G5_IO at 0 range 16 .. 19; G6_IO at 0 range 20 .. 23; G7_IO at 0 range 24 .. 27; G8_IO at 0 range 28 .. 31; end record; -- I/O group control status register type IOGCSR_Register is record -- Analog I/O group x enable G1E : Boolean := False; -- Analog I/O group x enable G2E : Boolean := False; -- Analog I/O group x enable G3E : Boolean := False; -- Analog I/O group x enable G4E : Boolean := False; -- Analog I/O group x enable G5E : Boolean := False; -- Analog I/O group x enable G6E : Boolean := False; -- Analog I/O group x enable G7E : Boolean := False; -- Analog I/O group x enable G8E : Boolean := False; -- unspecified Reserved_8_15 : HAL.UInt8 := 16#0#; -- Read-only. Analog I/O group x status G1S : Boolean := False; -- Read-only. Analog I/O group x status G2S : Boolean := False; -- Read-only. Analog I/O group x status G3S : Boolean := False; -- Read-only. Analog I/O group x status G4S : Boolean := False; -- Read-only. Analog I/O group x status G5S : Boolean := False; -- Read-only. Analog I/O group x status G6S : Boolean := False; -- Analog I/O group x status G7S : Boolean := False; -- Analog I/O group x status G8S : Boolean := False; -- unspecified Reserved_24_31 : HAL.UInt8 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOGCSR_Register use record G1E at 0 range 0 .. 0; G2E at 0 range 1 .. 1; G3E at 0 range 2 .. 2; G4E at 0 range 3 .. 3; G5E at 0 range 4 .. 4; G6E at 0 range 5 .. 5; G7E at 0 range 6 .. 6; G8E at 0 range 7 .. 7; Reserved_8_15 at 0 range 8 .. 15; G1S at 0 range 16 .. 16; G2S at 0 range 17 .. 17; G3S at 0 range 18 .. 18; G4S at 0 range 19 .. 19; G5S at 0 range 20 .. 20; G6S at 0 range 21 .. 21; G7S at 0 range 22 .. 22; G8S at 0 range 23 .. 23; Reserved_24_31 at 0 range 24 .. 31; end record; subtype IOG1CR_CNT_Field is HAL.UInt14; -- I/O group x counter register type IOG1CR_Register is record -- Read-only. Counter value CNT : IOG1CR_CNT_Field; -- unspecified Reserved_14_31 : HAL.UInt18; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOG1CR_Register use record CNT at 0 range 0 .. 13; Reserved_14_31 at 0 range 14 .. 31; end record; subtype IOG2CR_CNT_Field is HAL.UInt14; -- I/O group x counter register type IOG2CR_Register is record -- Read-only. Counter value CNT : IOG2CR_CNT_Field; -- unspecified Reserved_14_31 : HAL.UInt18; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOG2CR_Register use record CNT at 0 range 0 .. 13; Reserved_14_31 at 0 range 14 .. 31; end record; subtype IOG3CR_CNT_Field is HAL.UInt14; -- I/O group x counter register type IOG3CR_Register is record -- Read-only. Counter value CNT : IOG3CR_CNT_Field; -- unspecified Reserved_14_31 : HAL.UInt18; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOG3CR_Register use record CNT at 0 range 0 .. 13; Reserved_14_31 at 0 range 14 .. 31; end record; subtype IOG4CR_CNT_Field is HAL.UInt14; -- I/O group x counter register type IOG4CR_Register is record -- Read-only. Counter value CNT : IOG4CR_CNT_Field; -- unspecified Reserved_14_31 : HAL.UInt18; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOG4CR_Register use record CNT at 0 range 0 .. 13; Reserved_14_31 at 0 range 14 .. 31; end record; subtype IOG5CR_CNT_Field is HAL.UInt14; -- I/O group x counter register type IOG5CR_Register is record -- Read-only. Counter value CNT : IOG5CR_CNT_Field; -- unspecified Reserved_14_31 : HAL.UInt18; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOG5CR_Register use record CNT at 0 range 0 .. 13; Reserved_14_31 at 0 range 14 .. 31; end record; subtype IOG6CR_CNT_Field is HAL.UInt14; -- I/O group x counter register type IOG6CR_Register is record -- Read-only. Counter value CNT : IOG6CR_CNT_Field; -- unspecified Reserved_14_31 : HAL.UInt18; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOG6CR_Register use record CNT at 0 range 0 .. 13; Reserved_14_31 at 0 range 14 .. 31; end record; subtype IOG7CR_CNT_Field is HAL.UInt14; -- I/O group x counter register type IOG7CR_Register is record -- Read-only. Counter value CNT : IOG7CR_CNT_Field; -- unspecified Reserved_14_31 : HAL.UInt18; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOG7CR_Register use record CNT at 0 range 0 .. 13; Reserved_14_31 at 0 range 14 .. 31; end record; subtype IOG8CR_CNT_Field is HAL.UInt14; -- I/O group x counter register type IOG8CR_Register is record -- Read-only. Counter value CNT : IOG8CR_CNT_Field; -- unspecified Reserved_14_31 : HAL.UInt18; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IOG8CR_Register use record CNT at 0 range 0 .. 13; Reserved_14_31 at 0 range 14 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Touch sensing controller type TSC_Peripheral is record -- control register CR : aliased CR_Register; -- interrupt enable register IER : aliased IER_Register; -- interrupt clear register ICR : aliased ICR_Register; -- interrupt status register ISR : aliased ISR_Register; -- I/O hysteresis control register IOHCR : aliased IOHCR_Register; -- I/O analog switch control register IOASCR : aliased IOASCR_Register; -- I/O sampling control register IOSCR : aliased IOSCR_Register; -- I/O channel control register IOCCR : aliased IOCCR_Register; -- I/O group control status register IOGCSR : aliased IOGCSR_Register; -- I/O group x counter register IOG1CR : aliased IOG1CR_Register; -- I/O group x counter register IOG2CR : aliased IOG2CR_Register; -- I/O group x counter register IOG3CR : aliased IOG3CR_Register; -- I/O group x counter register IOG4CR : aliased IOG4CR_Register; -- I/O group x counter register IOG5CR : aliased IOG5CR_Register; -- I/O group x counter register IOG6CR : aliased IOG6CR_Register; -- I/O group x counter register IOG7CR : aliased IOG7CR_Register; -- I/O group x counter register IOG8CR : aliased IOG8CR_Register; end record with Volatile; for TSC_Peripheral use record CR at 16#0# range 0 .. 31; IER at 16#4# range 0 .. 31; ICR at 16#8# range 0 .. 31; ISR at 16#C# range 0 .. 31; IOHCR at 16#10# range 0 .. 31; IOASCR at 16#18# range 0 .. 31; IOSCR at 16#20# range 0 .. 31; IOCCR at 16#28# range 0 .. 31; IOGCSR at 16#30# range 0 .. 31; IOG1CR at 16#34# range 0 .. 31; IOG2CR at 16#38# range 0 .. 31; IOG3CR at 16#3C# range 0 .. 31; IOG4CR at 16#40# range 0 .. 31; IOG5CR at 16#44# range 0 .. 31; IOG6CR at 16#48# range 0 .. 31; IOG7CR at 16#4C# range 0 .. 31; IOG8CR at 16#50# range 0 .. 31; end record; -- Touch sensing controller TSC_Periph : aliased TSC_Peripheral with Import, Address => TSC_Base; end STM32_SVD.TSC;
----------------------------------------------------------------------- -- Util.Beans.Objects.Time -- Helper conversion for Ada Calendar Time -- Copyright (C) 2010, 2013 Stephane Carrez -- Written by Stephane Carrez (Stephane.Carrez@gmail.com) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Interfaces.C; with Ada.Calendar.Formatting; with Ada.Calendar.Conversions; package body Util.Beans.Objects.Time is use Ada.Calendar; Epoch : constant Ada.Calendar.Time := Ada.Calendar.Time_Of (Year => Year_Number'First, Month => 1, Day => 1, Seconds => 12 * 3600.0); -- ------------------------------ -- Time Type -- ------------------------------ type Time_Type_Def is new Duration_Type_Def with null record; -- Get the type name function Get_Name (Type_Def : Time_Type_Def) return String; -- Convert the value into a string. function To_String (Type_Def : in Time_Type_Def; Value : in Object_Value) return String; Time_Type : aliased constant Time_Type_Def := Time_Type_Def '(others => <>); -- ------------------------------ -- Get the type name -- ------------------------------ function Get_Name (Type_Def : in Time_Type_Def) return String is pragma Unreferenced (Type_Def); begin return "Time"; end Get_Name; -- ------------------------------ -- Convert the value into a string. -- ------------------------------ function To_String (Type_Def : in Time_Type_Def; Value : in Object_Value) return String is pragma Unreferenced (Type_Def); begin return Ada.Calendar.Formatting.Image (Epoch + Value.Time_Value); end To_String; -- ------------------------------ -- Create an object from the given value. -- ------------------------------ function To_Object (Value : in Ada.Calendar.Time) return Object is begin return Object '(Controlled with V => Object_Value '(Of_Type => TYPE_TIME, Time_Value => Value - Epoch), Type_Def => Time_Type'Access); end To_Object; -- ------------------------------ -- Convert the object into a time. -- Raises Constraint_Error if the object cannot be converter to the target type. -- ------------------------------ function To_Time (Value : in Object) return Ada.Calendar.Time is begin case Value.V.Of_Type is when TYPE_TIME => return Value.V.Time_Value + Epoch; when TYPE_STRING | TYPE_WIDE_STRING => declare T : constant String := Value.Type_Def.To_String (Value.V); begin return Ada.Calendar.Formatting.Value (T); exception -- Last chance, try to convert a Unix time displayed as an integer. when Constraint_Error => return Ada.Calendar.Conversions.To_Ada_Time (Interfaces.C.long'Value (T)); end; when others => raise Constraint_Error with "Conversion to a date is not possible"; end case; end To_Time; -- ------------------------------ -- Force the object to be a time. -- ------------------------------ function Cast_Time (Value : Object) return Object is begin case Value.V.Of_Type is when TYPE_TIME => return Value; when TYPE_STRING | TYPE_WIDE_STRING => return Time.To_Object (Formatting.Value (Value.Type_Def.To_String (Value.V))); when others => raise Constraint_Error with "Conversion to a date is not possible"; end case; end Cast_Time; end Util.Beans.Objects.Time;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- GNAT.SOCKETS.THIN.HOST_ERROR_MESSAGES -- -- -- -- B o d y -- -- -- -- Copyright (C) 2007-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. -- -- -- ------------------------------------------------------------------------------ -- This is the default implementation of this unit, providing explicit -- literal messages (we do not use hstrerror from the standard C library, -- as this function is obsolete). separate (GNAT.Sockets.Thin) package body Host_Error_Messages is function Host_Error_Message (H_Errno : Integer) return String is begin case H_Errno is when SOSC.HOST_NOT_FOUND => return "Host not found"; when SOSC.TRY_AGAIN => return "Try again"; when SOSC.NO_RECOVERY => return "No recovery"; when SOSC.NO_DATA => return "No address"; when others => return "Unknown error"; end case; end Host_Error_Message; end Host_Error_Messages;
-- Copyright 2013-2016 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- This program is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. package body Pck is procedure Put(S : String) is begin null; end Put; end Pck;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- U I N T P -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2010, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- Support for universal integer arithmetic -- WARNING: There is a C version of this package. Any changes to this -- source file must be properly reflected in the C header file sinfo.h with Alloc; with Table; pragma Elaborate_All (Table); with Types; use Types; package Uintp is ------------------------------------------------- -- Basic Types and Constants for Uintp Package -- ------------------------------------------------- type Uint is private; -- The basic universal integer type No_Uint : constant Uint; -- A constant value indicating a missing or unset Uint value Uint_0 : constant Uint; Uint_1 : constant Uint; Uint_2 : constant Uint; Uint_3 : constant Uint; Uint_4 : constant Uint; Uint_5 : constant Uint; Uint_6 : constant Uint; Uint_7 : constant Uint; Uint_8 : constant Uint; Uint_9 : constant Uint; Uint_10 : constant Uint; Uint_11 : constant Uint; Uint_12 : constant Uint; Uint_13 : constant Uint; Uint_14 : constant Uint; Uint_15 : constant Uint; Uint_16 : constant Uint; Uint_24 : constant Uint; Uint_32 : constant Uint; Uint_63 : constant Uint; Uint_64 : constant Uint; Uint_80 : constant Uint; Uint_128 : constant Uint; Uint_Minus_1 : constant Uint; Uint_Minus_2 : constant Uint; Uint_Minus_3 : constant Uint; Uint_Minus_4 : constant Uint; Uint_Minus_5 : constant Uint; Uint_Minus_6 : constant Uint; Uint_Minus_7 : constant Uint; Uint_Minus_8 : constant Uint; Uint_Minus_9 : constant Uint; Uint_Minus_12 : constant Uint; Uint_Minus_36 : constant Uint; Uint_Minus_63 : constant Uint; Uint_Minus_80 : constant Uint; Uint_Minus_128 : constant Uint; ----------------- -- Subprograms -- ----------------- procedure Initialize; -- Initialize Uint tables. Note that Initialize must not be called if -- Tree_Read is used. Note also that there is no lock routine in this -- unit, these are among the few tables that can be expanded during -- gigi processing. procedure Tree_Read; -- Initializes internal tables from current tree file using the relevant -- Table.Tree_Read routines. Note that Initialize should not be called if -- Tree_Read is used. Tree_Read includes all necessary initialization. procedure Tree_Write; -- Writes out internal tables to current tree file using the relevant -- Table.Tree_Write routines. function UI_Abs (Right : Uint) return Uint; pragma Inline (UI_Abs); -- Returns abs function of universal integer function UI_Add (Left : Uint; Right : Uint) return Uint; function UI_Add (Left : Int; Right : Uint) return Uint; function UI_Add (Left : Uint; Right : Int) return Uint; -- Returns sum of two integer values function UI_Decimal_Digits_Hi (U : Uint) return Nat; -- Returns an estimate of the number of decimal digits required to -- represent the absolute value of U. This estimate is correct or high, -- i.e. it never returns a value that is too low. The accuracy of the -- estimate affects only the effectiveness of comparison optimizations -- in Urealp. function UI_Decimal_Digits_Lo (U : Uint) return Nat; -- Returns an estimate of the number of decimal digits required to -- represent the absolute value of U. This estimate is correct or low, -- i.e. it never returns a value that is too high. The accuracy of the -- estimate affects only the effectiveness of comparison optimizations -- in Urealp. function UI_Div (Left : Uint; Right : Uint) return Uint; function UI_Div (Left : Int; Right : Uint) return Uint; function UI_Div (Left : Uint; Right : Int) return Uint; -- Returns quotient of two integer values. Fatal error if Right = 0 function UI_Eq (Left : Uint; Right : Uint) return Boolean; function UI_Eq (Left : Int; Right : Uint) return Boolean; function UI_Eq (Left : Uint; Right : Int) return Boolean; pragma Inline (UI_Eq); -- Compares integer values for equality function UI_Expon (Left : Uint; Right : Uint) return Uint; function UI_Expon (Left : Int; Right : Uint) return Uint; function UI_Expon (Left : Uint; Right : Int) return Uint; function UI_Expon (Left : Int; Right : Int) return Uint; -- Returns result of exponentiating two integer values. -- Fatal error if Right is negative. function UI_GCD (Uin, Vin : Uint) return Uint; -- Computes GCD of input values. Assumes Uin >= Vin >= 0 function UI_Ge (Left : Uint; Right : Uint) return Boolean; function UI_Ge (Left : Int; Right : Uint) return Boolean; function UI_Ge (Left : Uint; Right : Int) return Boolean; pragma Inline (UI_Ge); -- Compares integer values for greater than or equal function UI_Gt (Left : Uint; Right : Uint) return Boolean; function UI_Gt (Left : Int; Right : Uint) return Boolean; function UI_Gt (Left : Uint; Right : Int) return Boolean; pragma Inline (UI_Gt); -- Compares integer values for greater than function UI_Is_In_Int_Range (Input : Uint) return Boolean; pragma Inline (UI_Is_In_Int_Range); -- Determines if universal integer is in Int range function UI_Le (Left : Uint; Right : Uint) return Boolean; function UI_Le (Left : Int; Right : Uint) return Boolean; function UI_Le (Left : Uint; Right : Int) return Boolean; pragma Inline (UI_Le); -- Compares integer values for less than or equal function UI_Lt (Left : Uint; Right : Uint) return Boolean; function UI_Lt (Left : Int; Right : Uint) return Boolean; function UI_Lt (Left : Uint; Right : Int) return Boolean; -- Compares integer values for less than function UI_Max (Left : Uint; Right : Uint) return Uint; function UI_Max (Left : Int; Right : Uint) return Uint; function UI_Max (Left : Uint; Right : Int) return Uint; -- Returns maximum of two integer values function UI_Min (Left : Uint; Right : Uint) return Uint; function UI_Min (Left : Int; Right : Uint) return Uint; function UI_Min (Left : Uint; Right : Int) return Uint; -- Returns minimum of two integer values function UI_Mod (Left : Uint; Right : Uint) return Uint; function UI_Mod (Left : Int; Right : Uint) return Uint; function UI_Mod (Left : Uint; Right : Int) return Uint; pragma Inline (UI_Mod); -- Returns mod function of two integer values function UI_Mul (Left : Uint; Right : Uint) return Uint; function UI_Mul (Left : Int; Right : Uint) return Uint; function UI_Mul (Left : Uint; Right : Int) return Uint; -- Returns product of two integer values function UI_Ne (Left : Uint; Right : Uint) return Boolean; function UI_Ne (Left : Int; Right : Uint) return Boolean; function UI_Ne (Left : Uint; Right : Int) return Boolean; pragma Inline (UI_Ne); -- Compares integer values for inequality function UI_Negate (Right : Uint) return Uint; pragma Inline (UI_Negate); -- Returns negative of universal integer function UI_Rem (Left : Uint; Right : Uint) return Uint; function UI_Rem (Left : Int; Right : Uint) return Uint; function UI_Rem (Left : Uint; Right : Int) return Uint; -- Returns rem of two integer values function UI_Sub (Left : Uint; Right : Uint) return Uint; function UI_Sub (Left : Int; Right : Uint) return Uint; function UI_Sub (Left : Uint; Right : Int) return Uint; pragma Inline (UI_Sub); -- Returns difference of two integer values function UI_Modular_Exponentiation (B : Uint; E : Uint; Modulo : Uint) return Uint; -- Efficiently compute (B ** E) rem Modulo function UI_Modular_Inverse (N : Uint; Modulo : Uint) return Uint; -- Compute the multiplicative inverse of N in modular arithmetics with the -- given Modulo (uses Euclid's algorithm). Note: the call is considered -- to be erroneous (and the behavior is undefined) if n is not invertible. function UI_From_Int (Input : Int) return Uint; -- Converts Int value to universal integer form function UI_From_CC (Input : Char_Code) return Uint; -- Converts Char_Code value to universal integer form function UI_To_Int (Input : Uint) return Int; -- Converts universal integer value to Int. Fatal error if value is not in -- appropriate range. function UI_To_CC (Input : Uint) return Char_Code; -- Converts universal integer value to Char_Code. Fatal error if value is -- not in Char_Code range. function Num_Bits (Input : Uint) return Nat; -- Approximate number of binary bits in given universal integer. -- This function is used for capacity checks, and it can be one -- bit off without affecting its usage. --------------------- -- Output Routines -- --------------------- type UI_Format is (Hex, Decimal, Auto); -- Used to determine whether UI_Image/UI_Write output is in hexadecimal -- or decimal format. Auto, the default setting, lets the routine make -- a decision based on the value. UI_Image_Max : constant := 48; -- Enough for a 128-bit number UI_Image_Buffer : String (1 .. UI_Image_Max); UI_Image_Length : Natural; -- Buffer used for UI_Image as described below procedure UI_Image (Input : Uint; Format : UI_Format := Auto); -- Places a representation of Uint, consisting of a possible minus sign, -- followed by the value in UI_Image_Buffer. The form of the value is an -- integer literal in either decimal (no base) or hexadecimal (base 16) -- format. If Hex is True on entry, then hex mode is forced, otherwise -- UI_Image makes a guess at which output format is more convenient. The -- value must fit in UI_Image_Buffer. If necessary, the result is an -- approximation of the proper value, using an exponential format. The -- image of No_Uint is output as a single question mark. procedure UI_Write (Input : Uint; Format : UI_Format := Auto); -- Writes a representation of Uint, consisting of a possible minus sign, -- followed by the value to the output file. The form of the value is an -- integer literal in either decimal (no base) or hexadecimal (base 16) -- format as appropriate. UI_Format shows which format to use. Auto, -- the default, asks UI_Write to make a guess at which output format -- will be more convenient to read. procedure pid (Input : Uint); pragma Export (Ada, pid); -- Writes representation of Uint in decimal with a terminating line -- return. This is intended for use from the debugger. procedure pih (Input : Uint); pragma Export (Ada, pih); -- Writes representation of Uint in hex with a terminating line return. -- This is intended for use from the debugger. ------------------------ -- Operator Renamings -- ------------------------ function "+" (Left : Uint; Right : Uint) return Uint renames UI_Add; function "+" (Left : Int; Right : Uint) return Uint renames UI_Add; function "+" (Left : Uint; Right : Int) return Uint renames UI_Add; function "/" (Left : Uint; Right : Uint) return Uint renames UI_Div; function "/" (Left : Int; Right : Uint) return Uint renames UI_Div; function "/" (Left : Uint; Right : Int) return Uint renames UI_Div; function "*" (Left : Uint; Right : Uint) return Uint renames UI_Mul; function "*" (Left : Int; Right : Uint) return Uint renames UI_Mul; function "*" (Left : Uint; Right : Int) return Uint renames UI_Mul; function "-" (Left : Uint; Right : Uint) return Uint renames UI_Sub; function "-" (Left : Int; Right : Uint) return Uint renames UI_Sub; function "-" (Left : Uint; Right : Int) return Uint renames UI_Sub; function "**" (Left : Uint; Right : Uint) return Uint renames UI_Expon; function "**" (Left : Uint; Right : Int) return Uint renames UI_Expon; function "**" (Left : Int; Right : Uint) return Uint renames UI_Expon; function "**" (Left : Int; Right : Int) return Uint renames UI_Expon; function "abs" (Real : Uint) return Uint renames UI_Abs; function "mod" (Left : Uint; Right : Uint) return Uint renames UI_Mod; function "mod" (Left : Int; Right : Uint) return Uint renames UI_Mod; function "mod" (Left : Uint; Right : Int) return Uint renames UI_Mod; function "rem" (Left : Uint; Right : Uint) return Uint renames UI_Rem; function "rem" (Left : Int; Right : Uint) return Uint renames UI_Rem; function "rem" (Left : Uint; Right : Int) return Uint renames UI_Rem; function "-" (Real : Uint) return Uint renames UI_Negate; function "=" (Left : Uint; Right : Uint) return Boolean renames UI_Eq; function "=" (Left : Int; Right : Uint) return Boolean renames UI_Eq; function "=" (Left : Uint; Right : Int) return Boolean renames UI_Eq; function ">=" (Left : Uint; Right : Uint) return Boolean renames UI_Ge; function ">=" (Left : Int; Right : Uint) return Boolean renames UI_Ge; function ">=" (Left : Uint; Right : Int) return Boolean renames UI_Ge; function ">" (Left : Uint; Right : Uint) return Boolean renames UI_Gt; function ">" (Left : Int; Right : Uint) return Boolean renames UI_Gt; function ">" (Left : Uint; Right : Int) return Boolean renames UI_Gt; function "<=" (Left : Uint; Right : Uint) return Boolean renames UI_Le; function "<=" (Left : Int; Right : Uint) return Boolean renames UI_Le; function "<=" (Left : Uint; Right : Int) return Boolean renames UI_Le; function "<" (Left : Uint; Right : Uint) return Boolean renames UI_Lt; function "<" (Left : Int; Right : Uint) return Boolean renames UI_Lt; function "<" (Left : Uint; Right : Int) return Boolean renames UI_Lt; ----------------------------- -- Mark/Release Processing -- ----------------------------- -- The space used by Uint data is not automatically reclaimed. However, -- a mark-release regime is implemented which allows storage to be -- released back to a previously noted mark. This is used for example -- when doing comparisons, where only intermediate results get stored -- that do not need to be saved for future use. type Save_Mark is private; function Mark return Save_Mark; -- Note mark point for future release procedure Release (M : Save_Mark); -- Release storage allocated since mark was noted procedure Release_And_Save (M : Save_Mark; UI : in out Uint); -- Like Release, except that the given Uint value (which is typically -- among the data being released) is recopied after the release, so -- that it is the most recent item, and UI is updated to point to -- its copied location. procedure Release_And_Save (M : Save_Mark; UI1, UI2 : in out Uint); -- Like Release, except that the given Uint values (which are typically -- among the data being released) are recopied after the release, so -- that they are the most recent items, and UI1 and UI2 are updated if -- necessary to point to the copied locations. This routine is careful -- to do things in the right order, so that the values do not clobber -- one another. ----------------------------------- -- Representation of Uint Values -- ----------------------------------- private type Uint is new Int range Uint_Low_Bound .. Uint_High_Bound; for Uint'Size use 32; No_Uint : constant Uint := Uint (Uint_Low_Bound); -- Uint values are represented as multiple precision integers stored in -- a multi-digit format using Base as the base. This value is chosen so -- that the product Base*Base is within the range of allowed Int values. -- Base is defined to allow efficient execution of the primitive operations -- (a0, b0, c0) defined in the section "The Classical Algorithms" -- (sec. 4.3.1) of Donald Knuth's "The Art of Computer Programming", -- Vol. 2. These algorithms are used in this package. In particular, -- the product of two single digits in this base fits in a 32-bit integer. Base_Bits : constant := 15; -- Number of bits in base value Base : constant Int := 2 ** Base_Bits; -- Values in the range -(Base+1) .. Max_Direct are encoded directly as -- Uint values by adding a bias value. The value of Max_Direct is chosen -- so that a directly represented number always fits in two digits when -- represented in base format. Min_Direct : constant Int := -(Base - 1); Max_Direct : constant Int := (Base - 1) * (Base - 1); -- The following values define the bias used to store Uint values which -- are in this range, as well as the biased values for the first and last -- values in this range. We use a new derived type for these constants to -- avoid accidental use of Uint arithmetic on these values, which is never -- correct. type Ctrl is range Int'First .. Int'Last; Uint_Direct_Bias : constant Ctrl := Ctrl (Uint_Low_Bound) + Ctrl (Base); Uint_Direct_First : constant Ctrl := Uint_Direct_Bias + Ctrl (Min_Direct); Uint_Direct_Last : constant Ctrl := Uint_Direct_Bias + Ctrl (Max_Direct); Uint_0 : constant Uint := Uint (Uint_Direct_Bias); Uint_1 : constant Uint := Uint (Uint_Direct_Bias + 1); Uint_2 : constant Uint := Uint (Uint_Direct_Bias + 2); Uint_3 : constant Uint := Uint (Uint_Direct_Bias + 3); Uint_4 : constant Uint := Uint (Uint_Direct_Bias + 4); Uint_5 : constant Uint := Uint (Uint_Direct_Bias + 5); Uint_6 : constant Uint := Uint (Uint_Direct_Bias + 6); Uint_7 : constant Uint := Uint (Uint_Direct_Bias + 7); Uint_8 : constant Uint := Uint (Uint_Direct_Bias + 8); Uint_9 : constant Uint := Uint (Uint_Direct_Bias + 9); Uint_10 : constant Uint := Uint (Uint_Direct_Bias + 10); Uint_11 : constant Uint := Uint (Uint_Direct_Bias + 11); Uint_12 : constant Uint := Uint (Uint_Direct_Bias + 12); Uint_13 : constant Uint := Uint (Uint_Direct_Bias + 13); Uint_14 : constant Uint := Uint (Uint_Direct_Bias + 14); Uint_15 : constant Uint := Uint (Uint_Direct_Bias + 15); Uint_16 : constant Uint := Uint (Uint_Direct_Bias + 16); Uint_24 : constant Uint := Uint (Uint_Direct_Bias + 24); Uint_32 : constant Uint := Uint (Uint_Direct_Bias + 32); Uint_63 : constant Uint := Uint (Uint_Direct_Bias + 63); Uint_64 : constant Uint := Uint (Uint_Direct_Bias + 64); Uint_80 : constant Uint := Uint (Uint_Direct_Bias + 80); Uint_128 : constant Uint := Uint (Uint_Direct_Bias + 128); Uint_Minus_1 : constant Uint := Uint (Uint_Direct_Bias - 1); Uint_Minus_2 : constant Uint := Uint (Uint_Direct_Bias - 2); Uint_Minus_3 : constant Uint := Uint (Uint_Direct_Bias - 3); Uint_Minus_4 : constant Uint := Uint (Uint_Direct_Bias - 4); Uint_Minus_5 : constant Uint := Uint (Uint_Direct_Bias - 5); Uint_Minus_6 : constant Uint := Uint (Uint_Direct_Bias - 6); Uint_Minus_7 : constant Uint := Uint (Uint_Direct_Bias - 7); Uint_Minus_8 : constant Uint := Uint (Uint_Direct_Bias - 8); Uint_Minus_9 : constant Uint := Uint (Uint_Direct_Bias - 9); Uint_Minus_12 : constant Uint := Uint (Uint_Direct_Bias - 12); Uint_Minus_36 : constant Uint := Uint (Uint_Direct_Bias - 36); Uint_Minus_63 : constant Uint := Uint (Uint_Direct_Bias - 63); Uint_Minus_80 : constant Uint := Uint (Uint_Direct_Bias - 80); Uint_Minus_128 : constant Uint := Uint (Uint_Direct_Bias - 128); Uint_Max_Simple_Mul : constant := Uint_Direct_Bias + 2 ** 15; -- If two values are directly represented and less than or equal to this -- value, then we know the product fits in a 32-bit integer. This allows -- UI_Mul to efficiently compute the product in this case. type Save_Mark is record Save_Uint : Uint; Save_Udigit : Int; end record; -- Values outside the range that is represented directly are stored using -- two tables. The secondary table Udigits contains sequences of Int values -- consisting of the digits of the number in a radix Base system. The -- digits are stored from most significant to least significant with the -- first digit only carrying the sign. -- There is one entry in the primary Uints table for each distinct Uint -- value. This table entry contains the length (number of digits) and -- a starting offset of the value in the Udigits table. Uint_First_Entry : constant Uint := Uint (Uint_Table_Start); -- Some subprograms defined in this package manipulate the Udigits table -- directly, while for others it is more convenient to work with locally -- defined arrays of the digits of the Universal Integers. The type -- UI_Vector is defined for this purpose and some internal subprograms -- used for converting from one to the other are defined. type UI_Vector is array (Pos range <>) of Int; -- Vector containing the integer values of a Uint value -- Note: An earlier version of this package used pointers of arrays -- of Ints (dynamically allocated) for the Uint type. The change -- leads to a few less natural idioms used throughout this code, but -- eliminates all uses of the heap except for the table package itself. -- For example, Uint parameters are often converted to UI_Vectors for -- internal manipulation. This is done by creating the local UI_Vector -- using the function N_Digits on the Uint to find the size needed for -- the vector, and then calling Init_Operand to copy the values out -- of the table into the vector. type Uint_Entry is record Length : Pos; -- Length of entry in Udigits table in digits (i.e. in words) Loc : Int; -- Starting location in Udigits table of this Uint value end record; package Uints is new Table.Table ( Table_Component_Type => Uint_Entry, Table_Index_Type => Uint'Base, Table_Low_Bound => Uint_First_Entry, Table_Initial => Alloc.Uints_Initial, Table_Increment => Alloc.Uints_Increment, Table_Name => "Uints"); package Udigits is new Table.Table ( Table_Component_Type => Int, Table_Index_Type => Int, Table_Low_Bound => 0, Table_Initial => Alloc.Udigits_Initial, Table_Increment => Alloc.Udigits_Increment, Table_Name => "Udigits"); -- Note: the reason these tables are defined here in the private part of -- the spec, rather than in the body, is that they are referenced directly -- by gigi. end Uintp;
-- Copyright 2012-2015 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- This program is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. with Pck; use Pck; procedure Foo is Full : Full_Table := (False, True, False, True, False); begin Do_Nothing (Full'Address); -- STOP end Foo;
package HTTP.Request with SPARK_Mode => On is package Sliced is type Header is record Key : Indexes; Val : Indexes; end record; subtype Header_Index is Natural range 1 .. 20; type Header_List is array (Header_Index) of Header; type Request_Line is record Kind : Indexes; -- Get, Post, ect. Path : Indexes; Vers : Indexes; end record; type Request is record Line : Request_Line; Headers : Header_List; Cnt : Natural := 0; end record; end Sliced; type As_Stored is null record; -- TODO; type As_Sliced is new Sliced.Request; type Parse_State is private; -- Note: Parse is a separate nested pacakge. package Parse is type Context is private; procedure One_Char (Ctx : in out Context; Char: in Character); procedure Str_Read (Ctx : in out Context; Str : in String; Cnt: out Natural); procedure Debug (Ctx : in Context; Str : in String); private type Context is record State : Parse_State; Split : As_Sliced; -- TODO: Better names for ``Count'' Count : Positive := 1; -- Position of incoming char (1st, 2nd, ..) end record; end Parse; private type Parse_State is ( -- Request Header -- Kind, -- Kind: The request method type; Get, Post, ect. Path, Pref, -- HTTP version preferred by client. Line, -- Waiting for the rest of the carriage return sequence. Head, -- Gathering the name of header (Part preceeded by colon ':'). SSep, -- Remainder of separator, following colon; (a single space). HBod, -- Body of header. (Following the colon and space); -- Final CRLF; HTTP Requests terminated by an additional CRLF sequence; -- These states represent this final evenuality. Term, -- Remainder of terminal CRLF sequence (the LF ('\n') part); Done, -- Done reading all the header sections! Overread, -- A character was fed after all header sections done with! Err -- Error state; Signals that an error occurred. ) with Default_Value => Kind; end HTTP.Request;
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com> -- -- SPDX-License-Identifier: MIT -- License-Filename: LICENSE ------------------------------------------------------------- with Program.Lexical_Elements; with Program.Elements.Defining_Identifiers; with Program.Elements.Aspect_Specifications; with Program.Elements.Expressions; with Program.Elements.Task_Definitions; with Program.Elements.Single_Task_Declarations; with Program.Element_Visitors; package Program.Nodes.Single_Task_Declarations is pragma Preelaborate; type Single_Task_Declaration is new Program.Nodes.Node and Program.Elements.Single_Task_Declarations.Single_Task_Declaration and Program.Elements.Single_Task_Declarations .Single_Task_Declaration_Text with private; function Create (Task_Token : not null Program.Lexical_Elements .Lexical_Element_Access; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; With_Token : Program.Lexical_Elements.Lexical_Element_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Is_Token : not null Program.Lexical_Elements .Lexical_Element_Access; New_Token : Program.Lexical_Elements.Lexical_Element_Access; Progenitors : Program.Elements.Expressions.Expression_Vector_Access; With_Token_2 : Program.Lexical_Elements.Lexical_Element_Access; Definition : not null Program.Elements.Task_Definitions .Task_Definition_Access; Semicolon_Token : not null Program.Lexical_Elements .Lexical_Element_Access) return Single_Task_Declaration; type Implicit_Single_Task_Declaration is new Program.Nodes.Node and Program.Elements.Single_Task_Declarations.Single_Task_Declaration with private; function Create (Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Progenitors : Program.Elements.Expressions .Expression_Vector_Access; Definition : not null Program.Elements.Task_Definitions .Task_Definition_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return Implicit_Single_Task_Declaration with Pre => Is_Part_Of_Implicit or Is_Part_Of_Inherited or Is_Part_Of_Instance; private type Base_Single_Task_Declaration is abstract new Program.Nodes.Node and Program.Elements.Single_Task_Declarations.Single_Task_Declaration with record Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Progenitors : Program.Elements.Expressions.Expression_Vector_Access; Definition : not null Program.Elements.Task_Definitions .Task_Definition_Access; end record; procedure Initialize (Self : aliased in out Base_Single_Task_Declaration'Class); overriding procedure Visit (Self : not null access Base_Single_Task_Declaration; Visitor : in out Program.Element_Visitors.Element_Visitor'Class); overriding function Name (Self : Base_Single_Task_Declaration) return not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; overriding function Aspects (Self : Base_Single_Task_Declaration) return Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; overriding function Progenitors (Self : Base_Single_Task_Declaration) return Program.Elements.Expressions.Expression_Vector_Access; overriding function Definition (Self : Base_Single_Task_Declaration) return not null Program.Elements.Task_Definitions.Task_Definition_Access; overriding function Is_Single_Task_Declaration_Element (Self : Base_Single_Task_Declaration) return Boolean; overriding function Is_Declaration_Element (Self : Base_Single_Task_Declaration) return Boolean; type Single_Task_Declaration is new Base_Single_Task_Declaration and Program.Elements.Single_Task_Declarations .Single_Task_Declaration_Text with record Task_Token : not null Program.Lexical_Elements .Lexical_Element_Access; With_Token : Program.Lexical_Elements.Lexical_Element_Access; Is_Token : not null Program.Lexical_Elements .Lexical_Element_Access; New_Token : Program.Lexical_Elements.Lexical_Element_Access; With_Token_2 : Program.Lexical_Elements.Lexical_Element_Access; Semicolon_Token : not null Program.Lexical_Elements .Lexical_Element_Access; end record; overriding function To_Single_Task_Declaration_Text (Self : aliased in out Single_Task_Declaration) return Program.Elements.Single_Task_Declarations .Single_Task_Declaration_Text_Access; overriding function Task_Token (Self : Single_Task_Declaration) return not null Program.Lexical_Elements.Lexical_Element_Access; overriding function With_Token (Self : Single_Task_Declaration) return Program.Lexical_Elements.Lexical_Element_Access; overriding function Is_Token (Self : Single_Task_Declaration) return not null Program.Lexical_Elements.Lexical_Element_Access; overriding function New_Token (Self : Single_Task_Declaration) return Program.Lexical_Elements.Lexical_Element_Access; overriding function With_Token_2 (Self : Single_Task_Declaration) return Program.Lexical_Elements.Lexical_Element_Access; overriding function Semicolon_Token (Self : Single_Task_Declaration) return not null Program.Lexical_Elements.Lexical_Element_Access; type Implicit_Single_Task_Declaration is new Base_Single_Task_Declaration with record Is_Part_Of_Implicit : Boolean; Is_Part_Of_Inherited : Boolean; Is_Part_Of_Instance : Boolean; end record; overriding function To_Single_Task_Declaration_Text (Self : aliased in out Implicit_Single_Task_Declaration) return Program.Elements.Single_Task_Declarations .Single_Task_Declaration_Text_Access; overriding function Is_Part_Of_Implicit (Self : Implicit_Single_Task_Declaration) return Boolean; overriding function Is_Part_Of_Inherited (Self : Implicit_Single_Task_Declaration) return Boolean; overriding function Is_Part_Of_Instance (Self : Implicit_Single_Task_Declaration) return Boolean; end Program.Nodes.Single_Task_Declarations;
with Ada.Text_IO, tools; use Ada.Text_IO; package body Garden_Pkg is package Position_Generator is new tools.Random_Generator(Position); function GetRandPos return Position is begin return Position_Generator.GetRandom; end GetRandPos; function GetField(pos : Position) return Boolean is begin return Garden(pos); end GetField; procedure SprayField(pos : Position) is begin Garden(pos) := true; end SprayField; procedure SprayAbsorbed is begin Garden := (1..10 => false); end SprayAbsorbed; end Garden_Pkg;
-- This file is generated by SWIG. Please do not modify by hand. -- with Interfaces; with swig; with Interfaces.C; with Interfaces.C.Pointers; package xcb.xcb_change_active_pointer_grab_request_t is -- Item -- type Item is record major_opcode : aliased Interfaces.Unsigned_8; pad0 : aliased Interfaces.Unsigned_8; length : aliased Interfaces.Unsigned_16; cursor : aliased xcb.xcb_cursor_t; time : aliased xcb.xcb_timestamp_t; event_mask : aliased Interfaces.Unsigned_16; pad1 : aliased swig.int8_t_Array (0 .. 1); end record; -- Item_Array -- type Item_Array is array (Interfaces.C .size_t range <>) of aliased xcb .xcb_change_active_pointer_grab_request_t .Item; -- Pointer -- package C_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_change_active_pointer_grab_request_t.Item, Element_Array => xcb.xcb_change_active_pointer_grab_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_change_active_pointer_grab_request_t .Pointer; -- Pointer_Pointer -- package C_Pointer_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_change_active_pointer_grab_request_t.Pointer, Element_Array => xcb.xcb_change_active_pointer_grab_request_t.Pointer_Array, Default_Terminator => null); subtype Pointer_Pointer is C_Pointer_Pointers.Pointer; end xcb.xcb_change_active_pointer_grab_request_t;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- G N A T . S O C K E T S . L I N K E R _ O P T I O N S -- -- -- -- S p e c -- -- -- -- Copyright (C) 2001-2020, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package is used to provide target specific linker_options for the -- support of sockets as required by the package GNAT.Sockets. -- This is the Solaris version of this package -- This package should not be directly with'ed by an application program package GNAT.Sockets.Linker_Options is private pragma Linker_Options ("-lnsl"); pragma Linker_Options ("-lsocket"); end GNAT.Sockets.Linker_Options;
----------------------------------------------------------------------- -- asf.requests.mockup -- ASF Requests mockup -- Copyright (C) 2010, 2011, 2012, 2013 Stephane Carrez -- Written by Stephane Carrez (Stephane.Carrez@gmail.com) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- package body ASF.Requests.Mockup is function Find (Map : in Util.Strings.Maps.Map; Name : in String) return String; -- ------------------------------ -- Find and return the string associated with a key in the map. -- ------------------------------ function Find (Map : in Util.Strings.Maps.Map; Name : in String) return String is Pos : constant Util.Strings.Maps.Cursor := Map.Find (Name); begin if Util.Strings.Maps.Has_Element (Pos) then return Util.Strings.Maps.Element (Pos); else return ""; end if; end Find; -- ------------------------------ -- Returns the value of a request parameter as a String, or null if the -- parameter does not exist. Request parameters are extra information sent with -- the request. For HTTP servlets, parameters are contained in the query string -- or posted form data. -- -- You should only use this method when you are sure the parameter has only one -- value. If the parameter might have more than one value, use -- Get_Parameter_Values(String). -- -- If you use this method with a multivalued parameter, the value returned is -- equal to the first value in the array returned by Get_Parameter_Values. -- -- If the parameter data was sent in the request body, such as occurs with -- an HTTP POST request, then reading the body directly via getInputStream() -- or getReader() can interfere with the execution of this method. -- ------------------------------ function Get_Parameter (Req : in Request; Name : in String) return String is begin return Find (Req.Parameters, Name); end Get_Parameter; -- ------------------------------ -- Iterate over the request parameters and executes the <b>Process</b> procedure. -- ------------------------------ procedure Iterate_Parameters (Req : in Request; Process : not null access procedure (Name : in String; Value : in String)) is procedure Process_Wrapper (Position : in Util.Strings.Maps.Cursor); procedure Process_Wrapper (Position : in Util.Strings.Maps.Cursor) is begin Process.all (Name => Util.Strings.Maps.Key (Position), Value => Util.Strings.Maps.Element (Position)); end Process_Wrapper; begin Req.Parameters.Iterate (Process => Process_Wrapper'Access); end Iterate_Parameters; -- ------------------------------ -- Set the parameter -- ------------------------------ procedure Set_Parameter (Req : in out Request; Name : in String; Value : in String) is begin Req.Parameters.Include (Name, Value); end Set_Parameter; -- ------------------------------ -- Returns the name of the HTTP method with which this request was made, -- for example, GET, POST, or PUT. Same as the value of the CGI variable -- REQUEST_METHOD. -- ------------------------------ function Get_Method (Req : in Request) return String is begin return To_String (Req.Method); end Get_Method; -- ------------------------------ -- Sets the HTTP method. -- ------------------------------ procedure Set_Method (Req : in out Request; Method : in String) is begin Req.Method := To_Unbounded_String (Method); end Set_Method; -- ------------------------------ -- Returns the name and version of the protocol the request uses in the form -- protocol/majorVersion.minorVersion, for example, HTTP/1.1. For HTTP servlets, -- the value returned is the same as the value of the CGI variable SERVER_PROTOCOL. -- ------------------------------ function Get_Protocol (Req : in Request) return String is begin return To_String (Req.Protocol); end Get_Protocol; -- ------------------------------ -- Sets the protocol version -- ------------------------------ procedure Set_Protocol (Req : in out Request; Protocol : in String) is begin Req.Protocol := To_Unbounded_String (Protocol); end Set_Protocol; -- ------------------------------ -- Returns the part of this request's URL from the protocol name up to the query -- string in the first line of the HTTP request. The web container does not decode -- this String. For example: -- First line of HTTP request Returned Value -- POST /some/path.html HTTP/1.1 /some/path.html -- GET http://foo.bar/a.html HTTP/1.0 /a.html -- HEAD /xyz?a=b HTTP/1.1 /xyz -- ------------------------------ function Get_Request_URI (Req : in Request) return String is begin return To_String (Req.URI); end Get_Request_URI; -- ------------------------------ -- Set the request URI. -- ------------------------------ procedure Set_Request_URI (Req : in out Request; URI : in String) is begin Req.URI := To_Unbounded_String (URI); end Set_Request_URI; -- ------------------------------ -- Returns the value of the specified request header as a String. If the request -- did not include a header of the specified name, this method returns null. -- If there are multiple headers with the same name, this method returns the -- first head in the request. The header name is case insensitive. You can use -- this method with any request header. -- ------------------------------ function Get_Header (Req : in Request; Name : in String) return String is begin return Find (Req.Headers, Name); end Get_Header; -- ------------------------------ -- Sets the header -- ------------------------------ procedure Set_Header (Req : in out Request; Name : in String; Value : in String) is begin Req.Headers.Include (Name, Value); end Set_Header; -- ------------------------------ -- Returns all the values of the specified request header as an Enumeration -- of String objects. -- -- Some headers, such as Accept-Language can be sent by clients as several headers -- each with a different value rather than sending the header as a comma -- separated list. -- -- If the request did not include any headers of the specified name, this method -- returns an empty Enumeration. The header name is case insensitive. You can use -- this method with any request header. -- ------------------------------ function Get_Headers (Req : in Request; Name : in String) return String is begin return Find (Req.Headers, Name); end Get_Headers; -- ------------------------------ -- Iterate over the request headers and executes the <b>Process</b> procedure. -- ------------------------------ procedure Iterate_Headers (Req : in Request; Process : not null access procedure (Name : in String; Value : in String)) is procedure Process_Wrapper (Position : in Util.Strings.Maps.Cursor); procedure Process_Wrapper (Position : in Util.Strings.Maps.Cursor) is begin Process.all (Name => Util.Strings.Maps.Key (Position), Value => Util.Strings.Maps.Element (Position)); end Process_Wrapper; begin Req.Headers.Iterate (Process => Process_Wrapper'Access); end Iterate_Headers; -- ------------------------------ -- Returns the Internet Protocol (IP) address of the client or last proxy that -- sent the request. For HTTP servlets, same as the value of the CGI variable -- REMOTE_ADDR. -- ------------------------------ function Get_Remote_Addr (Req : in Request) return String is begin return To_String (Req.Peer); end Get_Remote_Addr; -- ------------------------------ -- Sets the peer address -- ------------------------------ procedure Set_Remote_Addr (Req : in out Request; Addr : in String) is begin Req.Peer := To_Unbounded_String (Addr); end Set_Remote_Addr; -- ------------------------------ -- Get the number of parts included in the request. -- ------------------------------ function Get_Part_Count (Req : in Request) return Natural is pragma Unreferenced (Req); begin return 0; end Get_Part_Count; -- ------------------------------ -- Process the part at the given position and executes the <b>Process</b> operation -- with the part object. -- ------------------------------ procedure Process_Part (Req : in out Request; Position : in Positive; Process : not null access procedure (Data : in ASF.Parts.Part'Class)) is begin null; end Process_Part; -- ------------------------------ -- Process the part identifed by <b>Id</b> and executes the <b>Process</b> operation -- with the part object. -- ------------------------------ procedure Process_Part (Req : in out Request; Id : in String; Process : not null access procedure (Data : in ASF.Parts.Part'Class)) is begin null; end Process_Part; -- ------------------------------ -- Set the request cookie by using the cookie returned in the response. -- ------------------------------ procedure Set_Cookie (Req : in out Request; From : in ASF.Responses.Mockup.Response'Class) is C : constant String := From.Get_Header ("Set-Cookie"); begin Req.Set_Header ("Cookie", C); end Set_Cookie; end ASF.Requests.Mockup;
------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- G N A T . R E G P A T -- -- -- -- S p e c -- -- -- -- Copyright (C) 1986 by University of Toronto. -- -- Copyright (C) 1996-2010, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package implements roughly the same set of regular expressions as -- are available in the Perl or Python programming languages. -- This is an extension of the original V7 style regular expression library -- written in C by Henry Spencer. Apart from the translation to Ada, the -- interface has been considerably changed to use the Ada String type -- instead of C-style nul-terminated strings. -- See file s-regpat.ads for full documentation of the interface ------------------------------------------------------------ -- Summary of Pattern Matching Packages in GNAT Hierarchy -- ------------------------------------------------------------ -- There are three related packages that perform pattern matching functions. -- the following is an outline of these packages, to help you determine -- which is best for your needs. -- GNAT.Regexp (files g-regexp.ads/s-regexp.ads/s-regexp.adb) -- This is a simple package providing Unix-style regular expression -- matching with the restriction that it matches entire strings. It -- is particularly useful for file name matching, and in particular -- it provides "globbing patterns" that are useful in implementing -- unix or DOS style wild card matching for file names. -- GNAT.Regpat (files g-regpat.ads/s-regpat.ads/s-regpat.adb) -- This is a more complete implementation of Unix-style regular -- expressions, copied from the Perl regular expression engine, -- written originally in C by Henry Spencer. It is functionally the -- same as that library. -- GNAT.Spitbol.Patterns (files g-spipat.ads/g-spipat.adb) -- This is a completely general pattern matching package based on the -- pattern language of SNOBOL4, as implemented in SPITBOL. The pattern -- language is modeled on context free grammars, with context sensitive -- extensions that provide full (type 0) computational capabilities. with System.Regpat; package GNAT.Regpat renames System.Regpat;
with Ada.Text_Io.Editing; use Ada.Text_Io.Editing; with Ada.Text_Io; use Ada.Text_Io; procedure Zero_Fill is Pic_String: String := "<999999.99>"; Pic : Picture := To_Picture(Pic_String); type Money is delta 0.01 digits 8; package Money_Output is new Decimal_Output(Money); use Money_Output; Value : Money := 37.25; begin Put(Item => Value, Pic => Pic); end Zero_Fill; -- https://rosettacode.org/wiki/Formatted_numeric_output#Ada
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . I M G _ W C H A R -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2019, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Interfaces; use Interfaces; with System.Img_Char; use System.Img_Char; package body System.Img_WChar is -------------------------- -- Image_Wide_Character -- -------------------------- procedure Image_Wide_Character (V : Wide_Character; S : in out String; P : out Natural; Ada_2005 : Boolean) is pragma Assert (S'First = 1); begin -- Annoying Ada 95 incompatibility with FFFE/FFFF if V >= Wide_Character'Val (16#FFFE#) and then not Ada_2005 then if V = Wide_Character'Val (16#FFFE#) then S (1 .. 4) := "FFFE"; else S (1 .. 4) := "FFFF"; end if; P := 4; -- Deal with annoying Ada 95 incompatibility with soft hyphen elsif V = Wide_Character'Val (16#00AD#) and then not Ada_2005 then P := 3; S (1) := '''; S (2) := Character'Val (16#00AD#); S (3) := '''; -- Normal case, same as Wide_Wide_Character else Image_Wide_Wide_Character (Wide_Wide_Character'Val (Wide_Character'Pos (V)), S, P); end if; end Image_Wide_Character; ------------------------------- -- Image_Wide_Wide_Character -- ------------------------------- procedure Image_Wide_Wide_Character (V : Wide_Wide_Character; S : in out String; P : out Natural) is pragma Assert (S'First = 1); Val : Unsigned_32 := Wide_Wide_Character'Pos (V); begin -- If in range of standard Character, use Character routine. Use the -- Ada 2005 version, since either we are called directly in Ada 2005 -- mode for Wide_Wide_Character, or this is the Wide_Character case -- which already took care of the Soft_Hyphen glitch. if Val <= 16#FF# then Image_Character_05 (Character'Val (Wide_Wide_Character'Pos (V)), S, P); -- Otherwise value returned is Hex_hhhhhhhh else declare Hex : constant array (Unsigned_32 range 0 .. 15) of Character := "0123456789ABCDEF"; begin S (1 .. 4) := "Hex_"; for J in reverse 5 .. 12 loop S (J) := Hex (Val mod 16); Val := Val / 16; end loop; P := 12; end; end if; end Image_Wide_Wide_Character; end System.Img_WChar;
with Ada.Text_IO; use Ada.Text_IO; with Ada.Strings; use Ada.Strings; with Ada.Strings.Fixed; use Ada.Strings.Fixed; with Ada.Characters.Handling; -- with Ada.Characters.Latin_1; package body Support.Strings is package Real_IO is new Ada.Text_IO.Float_IO (Real); use Real_IO; package Integer_IO is new Ada.Text_IO.Integer_IO (Integer); use Integer_IO; function str (source : Real; width : Integer := 10) return string is result : string (1..width) := (others => Ada.Characters.Latin_1.NUL); begin -- 4932 = largest exponent for 18 dec. digits -- so may need up to 4 digits in the exponent + 1 for the sign = 5 if source = 0.0 then Put (result,source,width-7,3); elsif abs (source) < 1.0 then if abs (source) >= 1.0e-99 then Put (result,source,width-7,3); elsif abs (source) >= 1.0e-999 then Put (result,source,width-8,4); else Put (result,source,width-9,5); end if; else if abs (source) < 1.0e100 then Put (result,source,width-7,3); elsif abs (source) < 1.0e1000 then Put (result,source,width-8,4); else Put (result,source,width-9,5); end if; end if; return result; end str; function str (source : Integer; width : Integer := 0) return string is result : string (1..width) := (others => Ada.Characters.Latin_1.NUL); wide_result : string (1..Integer'width) := (others => Ada.Characters.Latin_1.NUL); begin if width = 0 then Put (wide_result,source); return trim(wide_result,left); -- flush left, returns a string just large enough to contain the integer else Put (result,source); return result; end if; end str; function str (source : string; width : integer; pad : Character := Ada.Characters.Latin_1.NUL) return string is len_src : integer; tmp_out : string (1..width) := (others => pad); tmp_src : string := cut (source); begin len_src := get_strlen (tmp_src); if len_src <= width then -- source fits in the window tmp_out (1..len_src) := tmp_src (tmp_src'first..tmp_src'first+len_src-1); return tmp_out; else -- source too wide for the window return tmp_src (tmp_src'first..tmp_src'first+width-1); end if; end str; function str (source : character; width : integer := 1) return string is tmp_str : String (1..width) := (others => Ada.Characters.Latin_1.NUL); begin tmp_str (1) := source; return tmp_str; end str; function str (source : in string) return string is begin return cut(source); -- return the leading part of the string, trailing null's are tiresome end str; function fill_str (the_num : Integer; -- the number to print width : Integer; -- width of the printed number fill_chr : Character := ' ') -- the fill character return String is the_str : String (1 .. width); begin writestr (the_str, str (the_num, width)); for i in 1 .. width loop if the_str (i) = ' ' then the_str (i) := fill_chr; else exit; end if; end loop; return the_str; end fill_str; function spc (width : integer) return string is spaces : constant string (1..width) := (others => ' '); begin return spaces; end spc; function cut (the_line : string) return string is result : constant string := the_line; begin return result(result'first..result'first+get_strlen(result)-1); end cut; procedure null_string (source : in out string) is begin source := (others => Ada.Characters.Latin_1.NUL); end null_string; function get_strlen (source : in string) return integer is length : Integer := 0; begin for i in source'range loop exit when source(i) = Ada.Characters.Latin_1.NUL; length := i-source'first+1; end loop; return length; end get_strlen; procedure set_strlen (source : in out string; length : integer) is begin for i in source'first+length..source'last loop source(i) := Ada.Characters.Latin_1.NUL; end loop; end set_strlen; function make_str (n : Integer; m : Integer) return String is the_str : String (1 .. m); begin writestr (the_str, str (n, m)); for i in 1 .. m loop if the_str (i) = ' ' then the_str (i) := '0'; end if; end loop; return the_str; end make_str; procedure readstr (source : string; target : out integer) is last : integer; begin get (source,target,last); end readstr; procedure readstr (source : string; target : out real) is last : integer; begin get (source,target,last); end readstr; procedure writestr (target : out string; source : integer) is begin put (target,source); end writestr; procedure writestr (target : out string; source : real) is begin put (target,source); end writestr; procedure writestr (target : out string; source : string) is len_substr : Integer; len_source : Integer; len_target : Integer; beg_source : Integer; end_source : Integer; beg_target : Integer; end_target : Integer; begin null_string (target); len_source := get_strlen (source); -- source length minus trailing null chars len_target := target'length; -- target lenght, maximum lenght of final string len_substr := min (len_source,len_target); beg_source := source'first; end_source := source'first+len_substr-1; beg_target := target'first; end_target := target'first+len_substr-1; target (beg_target..end_target) := source (beg_source..end_source); end writestr; function centre (the_string : String; the_length : Integer; the_offset : Integer := 0) return String is the_string_length : Integer; the_result : String := spc(the_length); start, finish : Integer; left_space, right_space : Integer; begin the_string_length := get_strlen (the_string); left_space := max (0,(the_length-the_string_length)/2); right_space := max (0,the_length - left_space - the_string_length); left_space := max (0,min(left_space+the_offset,the_length-the_string_length)); right_space := max (0,min(right_space-the_offset,the_length-the_string_length)); start := max (1,min(the_length,left_space+1)); finish := max (1,min(the_length,the_length-right_space)); for i in start..finish loop the_result (i) := the_string (i-start+1); end loop; return the_result; end centre; ------------------------------------------------------------------------------ -- LCB: my code is faster than the Ada.Strings.Fixed.Trim code -- see the examples in tests/strings/lcb02.adb ------------------------------------------------------------------------------ procedure trim_head (the_string : in out String) is j : Integer; found : Boolean; the_string_len : Integer; the_beg, the_end : Integer; tmp_string : String := the_string; begin -- delete leading whitespace found := False; the_string_len := get_strlen(the_string); the_beg := the_string'first; the_end := the_beg + the_string_len-1; for i in the_beg .. the_end loop if the_string (i) /= ' ' then j := i; found := True; exit; end if; end loop; if found then writestr (tmp_string,the_string(j..the_end)); -- the_string has non-empty content else null_string (tmp_string); -- the_string consists entirely of white space end if; the_string := tmp_string; -- writestr(the_string,Ada.Strings.Fixed.trim (cut(the_string),left)); end trim_head; procedure trim_tail (the_string : in out String) is j : Integer; found : Boolean; the_string_len : Integer; the_beg, the_end : Integer; tmp_string : String := the_string; begin -- delete trailing whitespace found := False; null_string (tmp_string); the_string_len := get_strlen(the_string); the_beg := the_string'first; the_end := the_beg + the_string_len-1; for i in reverse the_beg .. the_end loop if the_string (i) /= ' ' then j := i; found := True; exit; end if; end loop; if found then set_strlen (the_string,j); -- the_string has non-empty content else null_string (the_string); -- the_string consists entirely of white space end if; -- writestr(the_string,Ada.Strings.Fixed.trim (cut(the_string),right)); end trim_tail; function trim_head (the_string : String) return String is tmp_string : String := the_string; begin trim_head (tmp_string); return cut (tmp_string); end trim_head; function trim_tail (the_string : String) return String is tmp_string : String := the_string; begin trim_tail (tmp_string); return cut (tmp_string); end trim_tail; procedure trim (the_string : in out String) is begin trim_head (the_string); trim_tail (the_string); -- writestr(the_string,Ada.Strings.Fixed.trim (cut(the_string),both)); end trim; function trim (the_string : String) return String is tmp_string : String := the_string; begin trim (tmp_string); return cut (tmp_string); end trim; function lower_case (source : String) return String is begin return Ada.Characters.Handling.To_Lower (source); end lower_case; function upper_case (source : String) return String is begin return Ada.Characters.Handling.To_Upper (source); end upper_case; end Support.Strings;
-------------------------------------------------------------------------------- -- MIT License -- -- Copyright (c) 2020 Zane Myers -- -- Permission is hereby granted, free of charge, to any person obtaining a copy -- of this software and associated documentation files (the "Software"), to deal -- in the Software without restriction, including without limitation the rights -- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell -- copies of the Software, and to permit persons to whom the Software is -- furnished to do so, subject to the following conditions: -- -- The above copyright notice and this permission notice shall be included in all -- copies or substantial portions of the Software. -- -- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER -- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, -- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE -- SOFTWARE. -------------------------------------------------------------------------------- with Vulkan.Math.GenDMatrix; with Vulkan.Math.Dvec2; use Vulkan.Math.GenDMatrix; use Vulkan.Math.Dvec2; -------------------------------------------------------------------------------- --< @group Vulkan Math Basic Types -------------------------------------------------------------------------------- --< @summary --< This package provides a single precision floating point matrix with 3 rows --< and 2 columns. -------------------------------------------------------------------------------- package Vulkan.Math.Dmat3x2 is pragma Preelaborate; pragma Pure; --< A 3x2 matrix of single-precision floating point numbers. subtype Vkm_Dmat3x2 is Vkm_Dmat( last_row_index => 2, last_column_index => 1); ---------------------------------------------------------------------------- --< @summary --< Constructor for Vkm_Dmat3x2 type. --< --< @description --< Construct a 3x2 matrix with each component set to 0.0 --< --< @return --< A 3x2 matrix. ---------------------------------------------------------------------------- function Make_Dmat3x2 return Vkm_Dmat3x2 is (GDM.Make_GenMatrix(cN => 1, rN => 2)) with Inline; ---------------------------------------------------------------------------- --< @summary --< Constructor for Vkm_Dmat3x2 type. --< --< @description --< Construct a 3x2 matrix with each component set to a different value. --< --< | value1 value4 | --< | value2 value5 | --< | value3 value6 | --< --< @param value1 --< The first value to set for the matrix. --< --< @param value2 --< The second value to set for the matrix. --< --< @param value3 --< The third value to set for the matrix. --< --< @param value4 --< The fourth value to set for the matrix. --< --< @param value5 --< The fifth value to set for the matrix. --< --< @param value6 --< The sixth value to set for the matrix. --< --< @return --< A 3x2 matrix. ---------------------------------------------------------------------------- function Make_Dmat3x2 ( value1, value2, value3, value4, value5, value6 : in Vkm_Double) return Vkm_Dmat3x2 is (GDM.Make_GenMatrix( cN => 1, rN => 2, c0r0_val => value1, c0r1_val => value3, c0r2_val => value5, c1r0_val => value2, c1r1_val => value4, c1r2_val => value6)) with Inline; ---------------------------------------------------------------------------- --< @summary --< Constructor for Vkm_Dmat3x2 type. --< --< @description --< Construct a 3x2 matrix with each row set to the value of a 2 dimmensional --< vector. --< --< @param value1 --< The first value to set for the matrix. --< --< @param value2 --< The second value to set for the matrix. --< --< @param value3 --< The third value to set for the matrix. --< --< @return --< A 3x2 matrix. ---------------------------------------------------------------------------- function Make_Dmat3x2 ( value1, value2, value3 : in Vkm_Dvec2) return Vkm_Dmat3x2 is (GDM.Make_GenMatrix( cN => 1, rN => 2, c0r0_val => value1.x, c0r1_val => value2.x, c0r2_val => value3.x, c1r0_val => value1.y, c1r1_val => value2.y, c1r2_val => value3.y)) with Inline; ---------------------------------------------------------------------------- --< @summary --< Constructor for Vkm_Dmat3x2 type. --< --< @description --< Construct a 3x2 matrix using values from an existing matrix. --< --< If the provided matrix has dimmensions that are not the same as this --< matrix, the corresponding element in the 4x4 identity matrix is used for --< out of bounds accesses. --< --< @param value1 --< The submatrix to extract values from. --< --< @return --< A 3x2 matrix. ---------------------------------------------------------------------------- function Make_Dmat3x2 ( value1 : in Vkm_Dmat) return Vkm_Dmat3x2 is (GDM.Make_GenMatrix( cN => 1, rN => 2, c0r0_val => value1.c0r0, c0r1_val => value1.c0r1, c0r2_val => value1.c0r2, c1r0_val => value1.c1r0, c1r1_val => value1.c1r1, c1r2_val => value1.c1r2)) with Inline; end Vulkan.Math.Dmat3x2;
pragma Ada_2005; pragma Style_Checks (Off); with Interfaces.C; use Interfaces.C; with System; private package CUPS.cups_array_h is -- * "$Id: array.h 10996 2013-05-29 11:51:34Z msweet $" -- * -- * Sorted array definitions for CUPS. -- * -- * Copyright 2007-2010 by Apple Inc. -- * Copyright 1997-2007 by Easy Software Products. -- * -- * These coded instructions, statements, and computer programs are the -- * property of Apple Inc. and are protected by Federal copyright -- * law. Distribution and use rights are outlined in the file "LICENSE.txt" -- * which should have been included with this file. If this file is -- * file is missing or damaged, see the license at "http://www.cups.org/". -- * -- * This file is subject to the Apple OS-Developed Software exception. -- -- * Include necessary headers... -- -- * C++ magic... -- -- * Types and structures... -- -- skipped empty struct u_cups_array_s -- skipped empty struct cups_array_t --*** CUPS array type *** type cups_array_func_t is access function (arg1 : System.Address; arg2 : System.Address; arg3 : System.Address) return int; pragma Convention (C, cups_array_func_t); -- cups/array.h:44 --*** Array comparison function *** type cups_ahash_func_t is access function (arg1 : System.Address; arg2 : System.Address) return int; pragma Convention (C, cups_ahash_func_t); -- cups/array.h:46 --*** Array hash function *** type cups_acopy_func_t is access function (arg1 : System.Address; arg2 : System.Address) return System.Address; pragma Convention (C, cups_acopy_func_t); -- cups/array.h:48 --*** Array element copy function *** type cups_afree_func_t is access procedure (arg1 : System.Address; arg2 : System.Address); pragma Convention (C, cups_afree_func_t); -- cups/array.h:50 --*** Array element free function *** -- * Functions... -- -- * "$Id: array.h 10996 2013-05-29 11:51:34Z msweet $" -- * -- * Sorted array definitions for CUPS. -- * -- * Copyright 2007-2010 by Apple Inc. -- * Copyright 1997-2007 by Easy Software Products. -- * -- * These coded instructions, statements, and computer programs are the -- * property of Apple Inc. and are protected by Federal copyright -- * law. Distribution and use rights are outlined in the file "LICENSE.txt" -- * which should have been included with this file. If this file is -- * file is missing or damaged, see the license at "http://www.cups.org/". -- * -- * This file is subject to the Apple OS-Developed Software exception. -- function cupsArrayAdd (a : System.Address; e : System.Address) return int; -- cups/array.h:58 pragma Import (C, cupsArrayAdd, "cupsArrayAdd"); procedure cupsArrayClear (a : System.Address); -- cups/array.h:59 pragma Import (C, cupsArrayClear, "cupsArrayClear"); function cupsArrayCount (a : System.Address) return int; -- cups/array.h:60 pragma Import (C, cupsArrayCount, "cupsArrayCount"); function cupsArrayCurrent (a : System.Address) return System.Address; -- cups/array.h:61 pragma Import (C, cupsArrayCurrent, "cupsArrayCurrent"); procedure cupsArrayDelete (a : System.Address); -- cups/array.h:62 pragma Import (C, cupsArrayDelete, "cupsArrayDelete"); function cupsArrayDup (a : System.Address) return System.Address; -- cups/array.h:63 pragma Import (C, cupsArrayDup, "cupsArrayDup"); function cupsArrayFind (a : System.Address; e : System.Address) return System.Address; -- cups/array.h:64 pragma Import (C, cupsArrayFind, "cupsArrayFind"); function cupsArrayFirst (a : System.Address) return System.Address; -- cups/array.h:65 pragma Import (C, cupsArrayFirst, "cupsArrayFirst"); function cupsArrayGetIndex (a : System.Address) return int; -- cups/array.h:66 pragma Import (C, cupsArrayGetIndex, "cupsArrayGetIndex"); function cupsArrayGetInsert (a : System.Address) return int; -- cups/array.h:67 pragma Import (C, cupsArrayGetInsert, "cupsArrayGetInsert"); function cupsArrayIndex (a : System.Address; n : int) return System.Address; -- cups/array.h:68 pragma Import (C, cupsArrayIndex, "cupsArrayIndex"); function cupsArrayInsert (a : System.Address; e : System.Address) return int; -- cups/array.h:69 pragma Import (C, cupsArrayInsert, "cupsArrayInsert"); function cupsArrayLast (a : System.Address) return System.Address; -- cups/array.h:70 pragma Import (C, cupsArrayLast, "cupsArrayLast"); function cupsArrayNew (f : cups_array_func_t; d : System.Address) return System.Address; -- cups/array.h:71 pragma Import (C, cupsArrayNew, "cupsArrayNew"); function cupsArrayNew2 (f : cups_array_func_t; d : System.Address; h : cups_ahash_func_t; hsize : int) return System.Address; -- cups/array.h:72 pragma Import (C, cupsArrayNew2, "cupsArrayNew2"); function cupsArrayNew3 (f : cups_array_func_t; d : System.Address; h : cups_ahash_func_t; hsize : int; cf : cups_acopy_func_t; ff : cups_afree_func_t) return System.Address; -- cups/array.h:74 pragma Import (C, cupsArrayNew3, "cupsArrayNew3"); function cupsArrayNext (a : System.Address) return System.Address; -- cups/array.h:78 pragma Import (C, cupsArrayNext, "cupsArrayNext"); function cupsArrayPrev (a : System.Address) return System.Address; -- cups/array.h:79 pragma Import (C, cupsArrayPrev, "cupsArrayPrev"); function cupsArrayRemove (a : System.Address; e : System.Address) return int; -- cups/array.h:80 pragma Import (C, cupsArrayRemove, "cupsArrayRemove"); function cupsArrayRestore (a : System.Address) return System.Address; -- cups/array.h:81 pragma Import (C, cupsArrayRestore, "cupsArrayRestore"); function cupsArraySave (a : System.Address) return int; -- cups/array.h:82 pragma Import (C, cupsArraySave, "cupsArraySave"); function cupsArrayUserData (a : System.Address) return System.Address; -- cups/array.h:83 pragma Import (C, cupsArrayUserData, "cupsArrayUserData"); -- * End of "$Id: array.h 10996 2013-05-29 11:51:34Z msweet $". -- end CUPS.cups_array_h;
-- WORDS, a Latin dictionary, by Colonel William Whitaker (USAF, Retired) -- -- Copyright William A. Whitaker (1936–2010) -- -- This is a free program, which means it is proper to copy it and pass -- it on to your friends. Consider it a developmental item for which -- there is no charge. However, just for form, it is Copyrighted -- (c). Permission is hereby freely given for any and all use of program -- and data. You can sell it as your own, but at least tell me. -- -- This version is distributed without obligation, but the developer -- would appreciate comments and suggestions. -- -- All parts of the WORDS system, source code and data files, are made freely -- available to anyone who wishes to use them, for whatever purpose. separate (Latin_Utils.Inflections_Package) package body Propack_Record_IO is --------------------------------------------------------------------------- procedure Get (File : in File_Type; Item : out Propack_Record) is Spacer : Character := ' '; pragma Unreferenced (Spacer); begin Decn_Record_IO.Get (File, Item.Decl); Get (File, Spacer); Case_Type_IO.Get (File, Item.Of_Case); Get (File, Spacer); Number_Type_IO.Get (File, Item.Number); Get (File, Spacer); Gender_Type_IO.Get (File, Item.Gender); end Get; --------------------------------------------------------------------------- procedure Get (Item : out Propack_Record) is Spacer : Character := ' '; pragma Unreferenced (Spacer); begin Decn_Record_IO.Get (Item.Decl); Get (Spacer); Case_Type_IO.Get (Item.Of_Case); Get (Spacer); Number_Type_IO.Get (Item.Number); Get (Spacer); Gender_Type_IO.Get (Item.Gender); end Get; --------------------------------------------------------------------------- procedure Put (File : in File_Type; Item : in Propack_Record) is begin Decn_Record_IO.Put (File, Item.Decl); Put (File, ' '); Case_Type_IO.Put (File, Item.Of_Case); Put (File, ' '); Number_Type_IO.Put (File, Item.Number); Put (File, ' '); Gender_Type_IO.Put (File, Item.Gender); end Put; --------------------------------------------------------------------------- procedure Put (Item : in Propack_Record) is begin Decn_Record_IO.Put (Item.Decl); Put (' '); Case_Type_IO.Put (Item.Of_Case); Put (' '); Number_Type_IO.Put (Item.Number); Put (' '); Gender_Type_IO.Put (Item.Gender); end Put; --------------------------------------------------------------------------- procedure Get (Source : in String; Target : out Propack_Record; Last : out Integer ) is -- Used for computing lower bound of substrings Low : Integer := Source'First - 1; begin Decn_Record_IO.Get (Source (Low + 1 .. Source'Last), Target.Decl, Low); Low := Low + 1; Case_Type_IO.Get (Source (Low + 1 .. Source'Last), Target.Of_Case, Low); Low := Low + 1; Number_Type_IO.Get (Source (Low + 1 .. Source'Last), Target.Number, Low); Low := Low + 1; Gender_Type_IO.Get (Source (Low + 1 .. Source'Last), Target.Gender, Last); end Get; --------------------------------------------------------------------------- procedure Put (Target : out String; Item : in Propack_Record) is -- Used for computing bounds of substrings Low : Integer := Target'First - 1; High : Integer := 0; begin -- Put Decn_Record High := Low + Decn_Record_IO.Default_Width; Decn_Record_IO.Put (Target (Low + 1 .. High), Item.Decl); -- Put Case_Type Low := High + 1; Target (Low) := ' '; High := Low + Case_Type_IO.Default_Width; Case_Type_IO.Put (Target (Low + 1 .. High), Item.Of_Case); -- Put Number_Type Low := High + 1; Target (Low) := ' '; High := Low + Number_Type_IO.Default_Width; Number_Type_IO.Put (Target (Low + 1 .. High), Item.Number); -- Put Gender_Type Low := High + 1; Target (Low) := ' '; High := Low + Gender_Type_IO.Default_Width; Gender_Type_IO.Put (Target (Low + 1 .. High), Item.Gender); -- Fill remainder of String Target (High + 1 .. Target'Last) := (others => ' '); end Put; --------------------------------------------------------------------------- end Propack_Record_IO;
-- Copyright 2020 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- This program is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. package Pck is type Rec_Type (C : Character := 'd') is record case C is when Character'First => X_First : Integer; when Character'Val (127) => X_127 : Integer; when Character'Val (128) => X_128 : Integer; when Character'Last => X_Last : Integer; when others => null; end case; end record; type Second_Type (I : Integer) is record One: Integer; case I is when -5 .. 5 => X : Integer; when others => Y : Integer; end case; end record; type Nested_And_Variable (One, Two: Integer) is record Str : String (1 .. One); case One is when 0 => null; when others => OneValue : Integer; Str2 : String (1 .. Two); case Two is when 0 => null; when others => TwoValue : Integer; end case; end case; end record; end Pck;
----------------------------------------------------------------------- -- atlas -- Atlas demo ----------------------------------------------------------------------- -- Copyright (C) 2009, 2010, 2011, 2012, 2013 Stephane Carrez -- Written by Stephane Carrez (Stephane.Carrez@gmail.com) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- package Atlas is pragma Pure; end Atlas;
------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- ADA.CONTAINERS.RED_BLACK_TREES.GENERIC_BOUNDED_SET_OPERATIONS -- -- -- -- S p e c -- -- -- -- Copyright (C) 2004-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/>. -- -- -- -- This unit was originally developed by Matthew J Heaney. -- ------------------------------------------------------------------------------ -- Tree_Type is used to implement ordered containers. This package declares -- set-based tree operations. with Ada.Containers.Red_Black_Trees.Generic_Bounded_Operations; generic with package Tree_Operations is new Generic_Bounded_Operations (<>); type Set_Type is new Tree_Operations.Tree_Types.Tree_Type with private; use Tree_Operations.Tree_Types, Tree_Operations.Tree_Types.Implementation; with procedure Assign (Target : in out Set_Type; Source : Set_Type); with procedure Insert_With_Hint (Dst_Set : in out Set_Type; Dst_Hint : Count_Type; Src_Node : Node_Type; Dst_Node : out Count_Type); with function Is_Less (Left, Right : Node_Type) return Boolean; package Ada.Containers.Red_Black_Trees.Generic_Bounded_Set_Operations is pragma Pure; procedure Set_Union (Target : in out Set_Type; Source : Set_Type); -- Attempts to insert each element of Source in Target. If Target is -- busy then Program_Error is raised. We say "attempts" here because -- if these are unique-element sets, then the insertion should fail -- (not insert a new item) when the insertion item from Source is -- equivalent to an item already in Target. If these are multisets -- then of course the attempt should always succeed. function Set_Union (Left, Right : Set_Type) return Set_Type; -- Makes a copy of Left, and attempts to insert each element of -- Right into the copy, then returns the copy. procedure Set_Intersection (Target : in out Set_Type; Source : Set_Type); -- Removes elements from Target that are not equivalent to items in -- Source. If Target is busy then Program_Error is raised. function Set_Intersection (Left, Right : Set_Type) return Set_Type; -- Returns a set comprising all the items in Left equivalent to items in -- Right. procedure Set_Difference (Target : in out Set_Type; Source : Set_Type); -- Removes elements from Target that are equivalent to items in Source. If -- Target is busy then Program_Error is raised. function Set_Difference (Left, Right : Set_Type) return Set_Type; -- Returns a set comprising all the items in Left not equivalent to items -- in Right. procedure Set_Symmetric_Difference (Target : in out Set_Type; Source : Set_Type); -- Removes from Target elements that are equivalent to items in Source, -- and inserts into Target items from Source not equivalent elements in -- Target. If Target is busy then Program_Error is raised. function Set_Symmetric_Difference (Left, Right : Set_Type) return Set_Type; -- Returns a set comprising the union of the elements in Left not -- equivalent to items in Right, and the elements in Right not equivalent -- to items in Left. function Set_Subset (Subset : Set_Type; Of_Set : Set_Type) return Boolean; -- Returns False if Subset contains at least one element not equivalent to -- any item in Of_Set; returns True otherwise. function Set_Overlap (Left, Right : Set_Type) return Boolean; -- Returns True if at least one element of Left is equivalent to an item in -- Right; returns False otherwise. end Ada.Containers.Red_Black_Trees.Generic_Bounded_Set_Operations;
-- Copyright 2022 Jeff Foley. All rights reserved. -- Use of this source code is governed by Apache 2 LICENSE that can be found in the LICENSE file. local json = require("json") name = "DNSRepo" type = "api" function start() set_rate_limit(2) end function check() local c local cfg = datasrc_config() if cfg ~= nil then c = cfg.credentials end if (c ~= nil and c.key ~= nil and c.key ~= "") then return true end return false end function vertical(ctx, domain) local c local cfg = datasrc_config() if cfg ~= nil then c = cfg.credentials end if (c == nil or c.key == nil or c.key == "") then return end local resp, err = request(ctx, {['url']=build_url(domain, c.key)}) if (err ~= nil and err ~= "") then log(ctx, "vertical request to service failed: " .. err) return end resp = "{\"results\":" .. resp .. "}" local d = json.decode(resp) if (d == nil or d.results == nil or #(d.results) == 0) then return end for _, r in pairs(d.results) do new_name(ctx, r.domain) end end function build_url(domain, key) return "https://dnsrepo.noc.org/api/?apikey=" .. key .. "&search=" .. domain .. "&limit=5000" end
-- -- Copyright (c) 2008 Tero Koskinen <tero.koskinen@iki.fi> -- -- 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. -- -- UNIX version of OS compatibility package package body Ahven_Compat is function Directory_Separator return String is begin return "/"; end Directory_Separator; end Ahven_Compat;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . C H A R A C T E R S . W I D E _ W I D E _ L A T I N _ 9 -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-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. -- -- -- ------------------------------------------------------------------------------ -- This package provides definitions analogous to those in the GNAT package -- Ada.Characters.Latin_9 except that the type of the various constants is -- Wide_Wide_Character instead of Character. The provision of this package -- is in accordance with the implementation permission in RM (A.3.3(27)). package Ada.Characters.Wide_Wide_Latin_9 is pragma Pure; ------------------------ -- Control Characters -- ------------------------ NUL : constant Wide_Wide_Character := Wide_Wide_Character'Val (0); SOH : constant Wide_Wide_Character := Wide_Wide_Character'Val (1); STX : constant Wide_Wide_Character := Wide_Wide_Character'Val (2); ETX : constant Wide_Wide_Character := Wide_Wide_Character'Val (3); EOT : constant Wide_Wide_Character := Wide_Wide_Character'Val (4); ENQ : constant Wide_Wide_Character := Wide_Wide_Character'Val (5); ACK : constant Wide_Wide_Character := Wide_Wide_Character'Val (6); BEL : constant Wide_Wide_Character := Wide_Wide_Character'Val (7); BS : constant Wide_Wide_Character := Wide_Wide_Character'Val (8); HT : constant Wide_Wide_Character := Wide_Wide_Character'Val (9); LF : constant Wide_Wide_Character := Wide_Wide_Character'Val (10); VT : constant Wide_Wide_Character := Wide_Wide_Character'Val (11); FF : constant Wide_Wide_Character := Wide_Wide_Character'Val (12); CR : constant Wide_Wide_Character := Wide_Wide_Character'Val (13); SO : constant Wide_Wide_Character := Wide_Wide_Character'Val (14); SI : constant Wide_Wide_Character := Wide_Wide_Character'Val (15); DLE : constant Wide_Wide_Character := Wide_Wide_Character'Val (16); DC1 : constant Wide_Wide_Character := Wide_Wide_Character'Val (17); DC2 : constant Wide_Wide_Character := Wide_Wide_Character'Val (18); DC3 : constant Wide_Wide_Character := Wide_Wide_Character'Val (19); DC4 : constant Wide_Wide_Character := Wide_Wide_Character'Val (20); NAK : constant Wide_Wide_Character := Wide_Wide_Character'Val (21); SYN : constant Wide_Wide_Character := Wide_Wide_Character'Val (22); ETB : constant Wide_Wide_Character := Wide_Wide_Character'Val (23); CAN : constant Wide_Wide_Character := Wide_Wide_Character'Val (24); EM : constant Wide_Wide_Character := Wide_Wide_Character'Val (25); SUB : constant Wide_Wide_Character := Wide_Wide_Character'Val (26); ESC : constant Wide_Wide_Character := Wide_Wide_Character'Val (27); FS : constant Wide_Wide_Character := Wide_Wide_Character'Val (28); GS : constant Wide_Wide_Character := Wide_Wide_Character'Val (29); RS : constant Wide_Wide_Character := Wide_Wide_Character'Val (30); US : constant Wide_Wide_Character := Wide_Wide_Character'Val (31); ------------------------------------- -- ISO 646 Graphic Wide_Wide_Characters -- ------------------------------------- Space : constant Wide_Wide_Character := ' '; -- WC'Val(32) Exclamation : constant Wide_Wide_Character := '!'; -- WC'Val(33) Quotation : constant Wide_Wide_Character := '"'; -- WC'Val(34) Number_Sign : constant Wide_Wide_Character := '#'; -- WC'Val(35) Dollar_Sign : constant Wide_Wide_Character := '$'; -- WC'Val(36) Percent_Sign : constant Wide_Wide_Character := '%'; -- WC'Val(37) Ampersand : constant Wide_Wide_Character := '&'; -- WC'Val(38) Apostrophe : constant Wide_Wide_Character := '''; -- WC'Val(39) Left_Parenthesis : constant Wide_Wide_Character := '('; -- WC'Val(40) Right_Parenthesis : constant Wide_Wide_Character := ')'; -- WC'Val(41) Asterisk : constant Wide_Wide_Character := '*'; -- WC'Val(42) Plus_Sign : constant Wide_Wide_Character := '+'; -- WC'Val(43) Comma : constant Wide_Wide_Character := ','; -- WC'Val(44) Hyphen : constant Wide_Wide_Character := '-'; -- WC'Val(45) Minus_Sign : Wide_Wide_Character renames Hyphen; Full_Stop : constant Wide_Wide_Character := '.'; -- WC'Val(46) Solidus : constant Wide_Wide_Character := '/'; -- WC'Val(47) -- Decimal digits '0' though '9' are at positions 48 through 57 Colon : constant Wide_Wide_Character := ':'; -- WC'Val(58) Semicolon : constant Wide_Wide_Character := ';'; -- WC'Val(59) Less_Than_Sign : constant Wide_Wide_Character := '<'; -- WC'Val(60) Equals_Sign : constant Wide_Wide_Character := '='; -- WC'Val(61) Greater_Than_Sign : constant Wide_Wide_Character := '>'; -- WC'Val(62) Question : constant Wide_Wide_Character := '?'; -- WC'Val(63) Commercial_At : constant Wide_Wide_Character := '@'; -- WC'Val(64) -- Letters 'A' through 'Z' are at positions 65 through 90 Left_Square_Bracket : constant Wide_Wide_Character := '['; -- WC'Val (91) Reverse_Solidus : constant Wide_Wide_Character := '\'; -- WC'Val (92) Right_Square_Bracket : constant Wide_Wide_Character := ']'; -- WC'Val (93) Circumflex : constant Wide_Wide_Character := '^'; -- WC'Val (94) Low_Line : constant Wide_Wide_Character := '_'; -- WC'Val (95) Grave : constant Wide_Wide_Character := '`'; -- WC'Val (96) LC_A : constant Wide_Wide_Character := 'a'; -- WC'Val (97) LC_B : constant Wide_Wide_Character := 'b'; -- WC'Val (98) LC_C : constant Wide_Wide_Character := 'c'; -- WC'Val (99) LC_D : constant Wide_Wide_Character := 'd'; -- WC'Val (100) LC_E : constant Wide_Wide_Character := 'e'; -- WC'Val (101) LC_F : constant Wide_Wide_Character := 'f'; -- WC'Val (102) LC_G : constant Wide_Wide_Character := 'g'; -- WC'Val (103) LC_H : constant Wide_Wide_Character := 'h'; -- WC'Val (104) LC_I : constant Wide_Wide_Character := 'i'; -- WC'Val (105) LC_J : constant Wide_Wide_Character := 'j'; -- WC'Val (106) LC_K : constant Wide_Wide_Character := 'k'; -- WC'Val (107) LC_L : constant Wide_Wide_Character := 'l'; -- WC'Val (108) LC_M : constant Wide_Wide_Character := 'm'; -- WC'Val (109) LC_N : constant Wide_Wide_Character := 'n'; -- WC'Val (110) LC_O : constant Wide_Wide_Character := 'o'; -- WC'Val (111) LC_P : constant Wide_Wide_Character := 'p'; -- WC'Val (112) LC_Q : constant Wide_Wide_Character := 'q'; -- WC'Val (113) LC_R : constant Wide_Wide_Character := 'r'; -- WC'Val (114) LC_S : constant Wide_Wide_Character := 's'; -- WC'Val (115) LC_T : constant Wide_Wide_Character := 't'; -- WC'Val (116) LC_U : constant Wide_Wide_Character := 'u'; -- WC'Val (117) LC_V : constant Wide_Wide_Character := 'v'; -- WC'Val (118) LC_W : constant Wide_Wide_Character := 'w'; -- WC'Val (119) LC_X : constant Wide_Wide_Character := 'x'; -- WC'Val (120) LC_Y : constant Wide_Wide_Character := 'y'; -- WC'Val (121) LC_Z : constant Wide_Wide_Character := 'z'; -- WC'Val (122) Left_Curly_Bracket : constant Wide_Wide_Character := '{'; -- WC'Val (123) Vertical_Line : constant Wide_Wide_Character := '|'; -- WC'Val (124) Right_Curly_Bracket : constant Wide_Wide_Character := '}'; -- WC'Val (125) Tilde : constant Wide_Wide_Character := '~'; -- WC'Val (126) DEL : constant Wide_Wide_Character := Wide_Wide_Character'Val (127); -------------------------------------- -- ISO 6429 Control Wide_Wide_Characters -- -------------------------------------- IS4 : Wide_Wide_Character renames FS; IS3 : Wide_Wide_Character renames GS; IS2 : Wide_Wide_Character renames RS; IS1 : Wide_Wide_Character renames US; Reserved_128 : constant Wide_Wide_Character := Wide_Wide_Character'Val (128); Reserved_129 : constant Wide_Wide_Character := Wide_Wide_Character'Val (129); BPH : constant Wide_Wide_Character := Wide_Wide_Character'Val (130); NBH : constant Wide_Wide_Character := Wide_Wide_Character'Val (131); Reserved_132 : constant Wide_Wide_Character := Wide_Wide_Character'Val (132); NEL : constant Wide_Wide_Character := Wide_Wide_Character'Val (133); SSA : constant Wide_Wide_Character := Wide_Wide_Character'Val (134); ESA : constant Wide_Wide_Character := Wide_Wide_Character'Val (135); HTS : constant Wide_Wide_Character := Wide_Wide_Character'Val (136); HTJ : constant Wide_Wide_Character := Wide_Wide_Character'Val (137); VTS : constant Wide_Wide_Character := Wide_Wide_Character'Val (138); PLD : constant Wide_Wide_Character := Wide_Wide_Character'Val (139); PLU : constant Wide_Wide_Character := Wide_Wide_Character'Val (140); RI : constant Wide_Wide_Character := Wide_Wide_Character'Val (141); SS2 : constant Wide_Wide_Character := Wide_Wide_Character'Val (142); SS3 : constant Wide_Wide_Character := Wide_Wide_Character'Val (143); DCS : constant Wide_Wide_Character := Wide_Wide_Character'Val (144); PU1 : constant Wide_Wide_Character := Wide_Wide_Character'Val (145); PU2 : constant Wide_Wide_Character := Wide_Wide_Character'Val (146); STS : constant Wide_Wide_Character := Wide_Wide_Character'Val (147); CCH : constant Wide_Wide_Character := Wide_Wide_Character'Val (148); MW : constant Wide_Wide_Character := Wide_Wide_Character'Val (149); SPA : constant Wide_Wide_Character := Wide_Wide_Character'Val (150); EPA : constant Wide_Wide_Character := Wide_Wide_Character'Val (151); SOS : constant Wide_Wide_Character := Wide_Wide_Character'Val (152); Reserved_153 : constant Wide_Wide_Character := Wide_Wide_Character'Val (153); SCI : constant Wide_Wide_Character := Wide_Wide_Character'Val (154); CSI : constant Wide_Wide_Character := Wide_Wide_Character'Val (155); ST : constant Wide_Wide_Character := Wide_Wide_Character'Val (156); OSC : constant Wide_Wide_Character := Wide_Wide_Character'Val (157); PM : constant Wide_Wide_Character := Wide_Wide_Character'Val (158); APC : constant Wide_Wide_Character := Wide_Wide_Character'Val (159); ----------------------------------- -- Other Graphic Wide_Wide_Characters -- ----------------------------------- -- Wide_Wide_Character positions 160 (16#A0#) .. 175 (16#AF#) No_Break_Space : constant Wide_Wide_Character := Wide_Wide_Character'Val (160); NBSP : Wide_Wide_Character renames No_Break_Space; Inverted_Exclamation : constant Wide_Wide_Character := Wide_Wide_Character'Val (161); Cent_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (162); Pound_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (163); Euro_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (164); Yen_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (165); UC_S_Caron : constant Wide_Wide_Character := Wide_Wide_Character'Val (166); Section_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (167); LC_S_Caron : constant Wide_Wide_Character := Wide_Wide_Character'Val (168); Copyright_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (169); Feminine_Ordinal_Indicator : constant Wide_Wide_Character := Wide_Wide_Character'Val (170); Left_Angle_Quotation : constant Wide_Wide_Character := Wide_Wide_Character'Val (171); Not_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (172); Soft_Hyphen : constant Wide_Wide_Character := Wide_Wide_Character'Val (173); Registered_Trade_Mark_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (174); Macron : constant Wide_Wide_Character := Wide_Wide_Character'Val (175); -- Wide_Wide_Character positions 176 (16#B0#) .. 191 (16#BF#) Degree_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (176); Ring_Above : Wide_Wide_Character renames Degree_Sign; Plus_Minus_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (177); Superscript_Two : constant Wide_Wide_Character := Wide_Wide_Character'Val (178); Superscript_Three : constant Wide_Wide_Character := Wide_Wide_Character'Val (179); UC_Z_Caron : constant Wide_Wide_Character := Wide_Wide_Character'Val (180); Micro_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (181); Pilcrow_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (182); Paragraph_Sign : Wide_Wide_Character renames Pilcrow_Sign; Middle_Dot : constant Wide_Wide_Character := Wide_Wide_Character'Val (183); LC_Z_Caron : constant Wide_Wide_Character := Wide_Wide_Character'Val (184); Superscript_One : constant Wide_Wide_Character := Wide_Wide_Character'Val (185); Masculine_Ordinal_Indicator : constant Wide_Wide_Character := Wide_Wide_Character'Val (186); Right_Angle_Quotation : constant Wide_Wide_Character := Wide_Wide_Character'Val (187); UC_Ligature_OE : constant Wide_Wide_Character := Wide_Wide_Character'Val (188); LC_Ligature_OE : constant Wide_Wide_Character := Wide_Wide_Character'Val (189); UC_Y_Diaeresis : constant Wide_Wide_Character := Wide_Wide_Character'Val (190); Inverted_Question : constant Wide_Wide_Character := Wide_Wide_Character'Val (191); -- Wide_Wide_Character positions 192 (16#C0#) .. 207 (16#CF#) UC_A_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (192); UC_A_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (193); UC_A_Circumflex : constant Wide_Wide_Character := Wide_Wide_Character'Val (194); UC_A_Tilde : constant Wide_Wide_Character := Wide_Wide_Character'Val (195); UC_A_Diaeresis : constant Wide_Wide_Character := Wide_Wide_Character'Val (196); UC_A_Ring : constant Wide_Wide_Character := Wide_Wide_Character'Val (197); UC_AE_Diphthong : constant Wide_Wide_Character := Wide_Wide_Character'Val (198); UC_C_Cedilla : constant Wide_Wide_Character := Wide_Wide_Character'Val (199); UC_E_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (200); UC_E_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (201); UC_E_Circumflex : constant Wide_Wide_Character := Wide_Wide_Character'Val (202); UC_E_Diaeresis : constant Wide_Wide_Character := Wide_Wide_Character'Val (203); UC_I_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (204); UC_I_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (205); UC_I_Circumflex : constant Wide_Wide_Character := Wide_Wide_Character'Val (206); UC_I_Diaeresis : constant Wide_Wide_Character := Wide_Wide_Character'Val (207); -- Wide_Wide_Character positions 208 (16#D0#) .. 223 (16#DF#) UC_Icelandic_Eth : constant Wide_Wide_Character := Wide_Wide_Character'Val (208); UC_N_Tilde : constant Wide_Wide_Character := Wide_Wide_Character'Val (209); UC_O_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (210); UC_O_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (211); UC_O_Circumflex : constant Wide_Wide_Character := Wide_Wide_Character'Val (212); UC_O_Tilde : constant Wide_Wide_Character := Wide_Wide_Character'Val (213); UC_O_Diaeresis : constant Wide_Wide_Character := Wide_Wide_Character'Val (214); Multiplication_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (215); UC_O_Oblique_Stroke : constant Wide_Wide_Character := Wide_Wide_Character'Val (216); UC_U_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (217); UC_U_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (218); UC_U_Circumflex : constant Wide_Wide_Character := Wide_Wide_Character'Val (219); UC_U_Diaeresis : constant Wide_Wide_Character := Wide_Wide_Character'Val (220); UC_Y_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (221); UC_Icelandic_Thorn : constant Wide_Wide_Character := Wide_Wide_Character'Val (222); LC_German_Sharp_S : constant Wide_Wide_Character := Wide_Wide_Character'Val (223); -- Wide_Wide_Character positions 224 (16#E0#) .. 239 (16#EF#) LC_A_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (224); LC_A_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (225); LC_A_Circumflex : constant Wide_Wide_Character := Wide_Wide_Character'Val (226); LC_A_Tilde : constant Wide_Wide_Character := Wide_Wide_Character'Val (227); LC_A_Diaeresis : constant Wide_Wide_Character := Wide_Wide_Character'Val (228); LC_A_Ring : constant Wide_Wide_Character := Wide_Wide_Character'Val (229); LC_AE_Diphthong : constant Wide_Wide_Character := Wide_Wide_Character'Val (230); LC_C_Cedilla : constant Wide_Wide_Character := Wide_Wide_Character'Val (231); LC_E_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (232); LC_E_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (233); LC_E_Circumflex : constant Wide_Wide_Character := Wide_Wide_Character'Val (234); LC_E_Diaeresis : constant Wide_Wide_Character := Wide_Wide_Character'Val (235); LC_I_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (236); LC_I_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (237); LC_I_Circumflex : constant Wide_Wide_Character := Wide_Wide_Character'Val (238); LC_I_Diaeresis : constant Wide_Wide_Character := Wide_Wide_Character'Val (239); -- Wide_Wide_Character positions 240 (16#F0#) .. 255 (16#FF) LC_Icelandic_Eth : constant Wide_Wide_Character := Wide_Wide_Character'Val (240); LC_N_Tilde : constant Wide_Wide_Character := Wide_Wide_Character'Val (241); LC_O_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (242); LC_O_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (243); LC_O_Circumflex : constant Wide_Wide_Character := Wide_Wide_Character'Val (244); LC_O_Tilde : constant Wide_Wide_Character := Wide_Wide_Character'Val (245); LC_O_Diaeresis : constant Wide_Wide_Character := Wide_Wide_Character'Val (246); Division_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (247); LC_O_Oblique_Stroke : constant Wide_Wide_Character := Wide_Wide_Character'Val (248); LC_U_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (249); LC_U_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (250); LC_U_Circumflex : constant Wide_Wide_Character := Wide_Wide_Character'Val (251); LC_U_Diaeresis : constant Wide_Wide_Character := Wide_Wide_Character'Val (252); LC_Y_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (253); LC_Icelandic_Thorn : constant Wide_Wide_Character := Wide_Wide_Character'Val (254); LC_Y_Diaeresis : constant Wide_Wide_Character := Wide_Wide_Character'Val (255); ------------------------------------------------ -- Summary of Changes from Latin-1 => Latin-9 -- ------------------------------------------------ -- 164 Currency => Euro_Sign -- 166 Broken_Bar => UC_S_Caron -- 168 Diaeresis => LC_S_Caron -- 180 Acute => UC_Z_Caron -- 184 Cedilla => LC_Z_Caron -- 188 Fraction_One_Quarter => UC_Ligature_OE -- 189 Fraction_One_Half => LC_Ligature_OE -- 190 Fraction_Three_Quarters => UC_Y_Diaeresis end Ada.Characters.Wide_Wide_Latin_9;
-- This file is generated by SWIG. Please do not modify by hand. -- with Interfaces; with swig; with Interfaces.C; with Interfaces.C.Pointers; package xcb.xcb_alloc_color_reply_t is -- Item -- type Item is record response_type : aliased Interfaces.Unsigned_8; pad0 : aliased Interfaces.Unsigned_8; sequence : aliased Interfaces.Unsigned_16; length : aliased Interfaces.Unsigned_32; red : aliased Interfaces.Unsigned_16; green : aliased Interfaces.Unsigned_16; blue : aliased Interfaces.Unsigned_16; pad1 : aliased swig.int8_t_Array (0 .. 1); pixel : aliased Interfaces.Unsigned_32; end record; -- Item_Array -- type Item_Array is array (Interfaces.C.size_t range <>) of aliased xcb.xcb_alloc_color_reply_t .Item; -- Pointer -- package C_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_alloc_color_reply_t.Item, Element_Array => xcb.xcb_alloc_color_reply_t.Item_Array, Default_Terminator => (others => <>)); subtype Pointer is C_Pointers.Pointer; -- Pointer_Array -- type Pointer_Array is array (Interfaces.C.size_t range <>) of aliased xcb.xcb_alloc_color_reply_t .Pointer; -- Pointer_Pointer -- package C_Pointer_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_alloc_color_reply_t.Pointer, Element_Array => xcb.xcb_alloc_color_reply_t.Pointer_Array, Default_Terminator => null); subtype Pointer_Pointer is C_Pointer_Pointers.Pointer; end xcb.xcb_alloc_color_reply_t;
------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Web Framework -- -- -- -- Web API Definition -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2017, Vadim Godunko <vgodunko@gmail.com> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ -- This package provides handler interface to replace FrameRequestCallback -- callback. ------------------------------------------------------------------------------ package WebAPI.HTML.Frame_Request_Callbacks is pragma Preelaborate; type Frame_Request_Callback is limited interface; not overriding procedure Handle_Animation_Frame (Self : in out Frame_Request_Callback; Time : WebAPI.DOM_High_Res_Time_Stamp) is abstract; end WebAPI.HTML.Frame_Request_Callbacks;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S E M _ C H 4 -- -- -- -- S p e c -- -- -- -- $Revision$ -- -- -- Copyright (C) 1992,1993,1994,1995,1996 Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- 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_Ch4 is procedure Analyze_Aggregate (N : Node_Id); procedure Analyze_Allocator (N : Node_Id); procedure Analyze_Arithmetic_Op (N : Node_Id); procedure Analyze_Call (N : Node_Id); procedure Analyze_Comparison_Op (N : Node_Id); procedure Analyze_Concatenation (N : Node_Id); procedure Analyze_Conditional_Expression (N : Node_Id); procedure Analyze_Equality_Op (N : Node_Id); procedure Analyze_Explicit_Dereference (N : Node_Id); procedure Analyze_Logical_Op (N : Node_Id); procedure Analyze_Membership_Op (N : Node_Id); procedure Analyze_Negation (N : Node_Id); procedure Analyze_Null (N : Node_Id); procedure Analyze_Qualified_Expression (N : Node_Id); procedure Analyze_Range (N : Node_Id); procedure Analyze_Reference (N : Node_Id); procedure Analyze_Selected_Component (N : Node_Id); procedure Analyze_Short_Circuit (N : Node_Id); procedure Analyze_Slice (N : Node_Id); procedure Analyze_Type_Conversion (N : Node_Id); procedure Analyze_Unary_Op (N : Node_Id); procedure Analyze_Unchecked_Expression (N : Node_Id); procedure Analyze_Unchecked_Type_Conversion (N : Node_Id); procedure Analyze_Indexed_Component_Form (N : Node_Id); -- Prior to semantic analysis, an indexed component node can denote any -- of the following syntactic constructs: -- a) An indexed component of an array -- b) A function call -- c) A conversion -- d) A slice -- The resolution of the construct requires some semantic information -- on the prefix and the indices. end Sem_Ch4;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- I N T E R F A C E S . P A C K E D _ D E C I M A L -- -- -- -- S p e c -- -- (Version for IBM Mainframe Packed Decimal Format) -- -- -- -- 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. -- -- -- ------------------------------------------------------------------------------ -- This unit defines the packed decimal format used by GNAT in response to -- a specification of Machine_Radix 10 for a decimal fixed-point type. The -- format and operations are completely encapsulated in this unit, so all -- that is necessary to compile using different packed decimal formats is -- to replace this single unit. -- Note that the compiler access the spec of this unit during compilation -- to obtain the data length that needs allocating, so the correct version -- of the spec must be available to the compiler, and must correspond to -- the spec and body made available to the linker, and all units of a given -- program must be compiled with the same version of the spec and body. -- This consistency will be enforced automatically using the normal binder -- consistency checking, since any unit declaring Machine_Radix 10 types or -- containing operations on such data will implicitly with Packed_Decimal. with System; package Interfaces.Packed_Decimal is ------------------------ -- Format Description -- ------------------------ -- IBM Mainframe packed decimal format uses a byte string of length one -- to 10 bytes, with the most significant byte first. Each byte contains -- two decimal digits (with the high order digit in the left nibble, and -- the low order four bits contain the sign, using the following code: -- 16#A# 2#1010# positive -- 16#B# 2#1011# negative -- 16#C# 2#1100# positive (preferred representation) -- 16#D# 2#1101# negative (preferred representation) -- 16#E# 2#1110# positive -- 16#F# 2#1011# positive -- In this package, all six sign representations are interpreted as -- shown above when an operand is read, when an operand is written, -- the preferred representations are always used. Constraint_Error -- is raised if any other bit pattern is found in the sign nibble, -- or if a digit nibble contains an invalid digit code. -- Some examples follow: -- 05 76 3C +5763 -- 00 01 1D -11 -- 00 04 4E +44 (non-standard sign) -- 00 00 00 invalid (incorrect sign nibble) -- 0A 01 1C invalid (bad digit) ------------------ -- Length Array -- ------------------ -- The following array must be declared in exactly the form shown, since -- the compiler accesses the associated tree to determine the size to be -- allocated to a machine radix 10 type, depending on the number of digits. subtype Byte_Length is Positive range 1 .. 10; -- Range of possible byte lengths Packed_Size : constant array (1 .. 18) of Byte_Length := (01 => 01, -- Length in bytes for digits 1 02 => 02, -- Length in bytes for digits 2 03 => 02, -- Length in bytes for digits 2 04 => 03, -- Length in bytes for digits 2 05 => 03, -- Length in bytes for digits 2 06 => 04, -- Length in bytes for digits 2 07 => 04, -- Length in bytes for digits 2 08 => 05, -- Length in bytes for digits 2 09 => 05, -- Length in bytes for digits 2 10 => 06, -- Length in bytes for digits 2 11 => 06, -- Length in bytes for digits 2 12 => 07, -- Length in bytes for digits 2 13 => 07, -- Length in bytes for digits 2 14 => 08, -- Length in bytes for digits 2 15 => 08, -- Length in bytes for digits 2 16 => 09, -- Length in bytes for digits 2 17 => 09, -- Length in bytes for digits 2 18 => 10); -- Length in bytes for digits 2 ------------------------- -- Conversion Routines -- ------------------------- subtype D32 is Positive range 1 .. 9; -- Used to represent number of digits in a packed decimal value that -- can be represented in a 32-bit binary signed integer form. subtype D64 is Positive range 10 .. 18; -- Used to represent number of digits in a packed decimal value that -- requires a 64-bit signed binary integer for representing all values. function Packed_To_Int32 (P : System.Address; D : D32) return Integer_32; -- The argument P is the address of a packed decimal value and D is the -- number of digits (in the range 1 .. 9, as implied by the subtype). -- The returned result is the corresponding signed binary value. The -- exception Constraint_Error is raised if the input is invalid. function Packed_To_Int64 (P : System.Address; D : D64) return Integer_64; -- The argument P is the address of a packed decimal value and D is the -- number of digits (in the range 10 .. 18, as implied by the subtype). -- The returned result is the corresponding signed binary value. The -- exception Constraint_Error is raised if the input is invalid. procedure Int32_To_Packed (V : Integer_32; P : System.Address; D : D32); -- The argument V is a signed binary integer, which is converted to -- packed decimal format and stored using P, the address of a packed -- decimal item of D digits (D is in the range 1-9). Constraint_Error -- is raised if V is out of range of this number of digits. procedure Int64_To_Packed (V : Integer_64; P : System.Address; D : D64); -- The argument V is a signed binary integer, which is converted to -- packed decimal format and stored using P, the address of a packed -- decimal item of D digits (D is in the range 10-18). Constraint_Error -- is raised if V is out of range of this number of digits. end Interfaces.Packed_Decimal;
--***************************************************************************** --* --* PROJECT: BINGADA --* --* FILE: q_bingo-q_bombo.adb --* --* AUTHOR: Javier Fuica Fernandez --* --***************************************************************************** with Q_Gen_Shuffle; with Q_Sound; package body Q_Bingo.Q_Bombo is --================================================================== V_Index : T_Number; --================================================================== package Q_Shuffle is new Q_Gen_Shuffle (Element_Type => T_Number, C_Max_Number => T_Number'Last); V_Bingo_Array : Q_Shuffle.Array_Type; --================================================================== procedure P_Init is begin for I in 1 .. T_Number'Last loop V_Bingo_Array (I) := I; end loop; Q_Shuffle.P_Shuffle (List => V_Bingo_Array); V_Index := 1; end P_Init; --================================================================== procedure P_Spin (V_Number : out Positive; V_Current_Index : out T_Number; V_Last_Number : out Boolean) is begin if V_Index = T_Number'Last then V_Number := V_Bingo_Array (T_Number'Last); V_Last_Number := True; V_Current_Index := V_Index; else V_Number := V_Bingo_Array (V_Index); V_Current_Index := V_Index; V_Index := V_Index + 1; V_Last_Number := False; end if; Q_Sound.P_Play_Number (V_Bingo_Array (V_Current_Index)); end P_Spin; --================================================================== function F_Get_Number (V_Index : T_Number) return T_Number is (V_Bingo_Array (V_Index)); --================================================================== function F_Get_Current_Index return T_Number is (V_Index); --================================================================== end Q_Bingo.Q_Bombo;
------------------------------------------------------------------------------ -- -- -- ASIS-for-GNAT IMPLEMENTATION COMPONENTS -- -- -- -- A S I S . C O M P I L A T I O N _ U N I T S -- -- -- -- B o d y -- -- -- -- Copyright (C) 1995-2009, Free Software Foundation, Inc. -- -- -- -- ASIS-for-GNAT is free software; you can redistribute it and/or modify it -- -- under terms of the GNU General Public License as published by the Free -- -- Software Foundation; either version 2, or (at your option) any later -- -- version. ASIS-for-GNAT is distributed in the hope that it will be use- -- -- ful, but WITHOUT ANY WARRANTY; without even the implied warranty of MER- -- -- CHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General -- -- Public License for more details. You should have received a copy of the -- -- GNU General Public License distributed with ASIS-for-GNAT; see file -- -- COPYING. If not, write to the Free Software Foundation, 51 Franklin -- -- Street, Fifth Floor, Boston, MA 02110-1301, USA. -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- ASIS-for-GNAT was originally developed by the ASIS-for-GNAT team at the -- -- Software Engineering Laboratory of the Swiss Federal Institute of -- -- Technology (LGL-EPFL) in Lausanne, Switzerland, in cooperation with the -- -- Scientific Research Computer Center of Moscow State University (SRCC -- -- MSU), Russia, with funding partially provided by grants from the Swiss -- -- National Science Foundation and the Swiss Academy of Engineering -- -- Sciences. ASIS-for-GNAT is now maintained by AdaCore -- -- (http://www.adacore.com). -- -- -- ------------------------------------------------------------------------------ with Ada.Characters.Handling; use Ada.Characters.Handling; with Asis.Errors; use Asis.Errors; with Asis.Exceptions; use Asis.Exceptions; with Asis.Extensions; use Asis.Extensions; with Asis.Implementation; use Asis.Implementation; with Asis.Set_Get; use Asis.Set_Get; with A4G.A_Opt; use A4G.A_Opt; with A4G.A_Output; use A4G.A_Output; with A4G.Vcheck; use A4G.Vcheck; with A4G.Get_Unit; use A4G.Get_Unit; with A4G.Contt; use A4G.Contt; with A4G.Contt.UT; use A4G.Contt.UT; with Lib; use Lib; package body Asis.Compilation_Units is Package_Name : constant String := "Asis.Compilation_Units."; LT : Wide_String renames A4G.A_Types.Asis_Wide_Line_Terminator; function "=" (Left, Right : Compilation_Unit) return Boolean renames Asis.Set_Get."="; ---------------------- -- Attribute_Values -- ---------------------- function Attribute_Values (Compilation_Unit : Asis.Compilation_Unit; Attribute : Wide_String) return Wide_String is begin pragma Unreferenced (Attribute); Check_Validity (Compilation_Unit, Package_Name & "Attribute_Values"); return Nil_Asis_Wide_String; end Attribute_Values; ------------------------------- -- Attribute_Value_Delimiter -- ------------------------------- function Attribute_Value_Delimiter return Wide_String is begin return Asis_Wide_Line_Terminator; end Attribute_Value_Delimiter; ------------------------- -- Can_Be_Main_Program -- ------------------------- function Can_Be_Main_Program (Compilation_Unit : Asis.Compilation_Unit) return Boolean is Result : Boolean := False; begin Check_Validity (Compilation_Unit, Package_Name & "Can_Be_Main_Program"); Reset_Context (Encl_Cont_Id (Compilation_Unit)); case Kind (Compilation_Unit) is when A_Procedure | A_Function | A_Procedure_Body | A_Function_Body | A_Procedure_Renaming | A_Function_Renaming | A_Procedure_Instance | A_Function_Instance => Result := Is_Main_Unit (Compilation_Unit); when others => null; end case; return Result; exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Can_Be_Main_Program"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Can_Be_Main_Program", Ex => Ex, Arg_CU => Compilation_Unit); end Can_Be_Main_Program; -------------------------------------- -- Compilation_Command_Line_Options -- -------------------------------------- function Compilation_Command_Line_Options (Compilation_Unit : Asis.Compilation_Unit) return Wide_String is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Arg_Cont_Id : Context_Id; Arg_Len : Natural := 0; -- total length of compilation switches Arg_Count : Nat := 0; -- total number of compilation switches Arg_Ptr : String_Ptr; Corr_Main_Unit_Id : Unit_Id := Nil_Unit; Corresponding_Main_Unit : Asis.Compilation_Unit := Nil_Compilation_Unit; begin Check_Validity (Compilation_Unit, Package_Name & "Compilation_Command_Line_Options"); Arg_Kind := Kind (Compilation_Unit); if Arg_Kind not in A_Procedure .. A_Protected_Body_Subunit then return Nil_Asis_Wide_String; end if; Arg_Cont_Id := Encl_Cont_Id (Compilation_Unit); Reset_Context (Arg_Cont_Id); if Is_Main_Unit_In_Tree (Compilation_Unit) then Corresponding_Main_Unit := Compilation_Unit; else Arg_Unit_Id := Get_Unit_Id (Compilation_Unit); -- Here we have to check if the argument unit should to -- inherit command line options from some main unit: if Arg_Kind in A_Procedure .. A_Package then -- Here we have to check if the corresponding body is a -- main unit of some compilation: Corr_Main_Unit_Id := Get_Body (Arg_Cont_Id, Arg_Unit_Id); elsif Arg_Kind in A_Procedure_Body_Subunit .. A_Protected_Body_Subunit then -- We have to go to ancestor body and to check if it is a main -- unit of some compilation Corr_Main_Unit_Id := Get_Subunit_Parent_Body (Arg_Cont_Id, Arg_Unit_Id); while Class (Arg_Cont_Id, Corr_Main_Unit_Id) = A_Separate_Body loop Corr_Main_Unit_Id := Get_Subunit_Parent_Body (Arg_Cont_Id, Corr_Main_Unit_Id); end loop; end if; Corresponding_Main_Unit := Get_Comp_Unit (Corr_Main_Unit_Id, Arg_Cont_Id); if not Is_Main_Unit_In_Tree (Corresponding_Main_Unit) then Corresponding_Main_Unit := Nil_Compilation_Unit; end if; end if; if Is_Nil (Corresponding_Main_Unit) then return Nil_Asis_Wide_String; else Reset_Main_Tree (Corresponding_Main_Unit); -- First, find the length of the string to return Find_Arguments_Length : loop Arg_Ptr := Get_Compilation_Switch (Arg_Count + 1); exit Find_Arguments_Length when Arg_Ptr = null; Arg_Count := Arg_Count + 1; Arg_Len := Arg_Len + Arg_Ptr'Length + 1; end loop Find_Arguments_Length; if Arg_Count > 0 then Arg_Len := Arg_Len - 1; end if; declare Result : String (1 .. Arg_Len); Next_Pos : Natural := 1; Next_Arg_Len : Natural; begin -- Should be rewritten on the base of ASIS string buffer??? for Next_Arg in 1 .. Arg_Count loop Arg_Ptr := Get_Compilation_Switch (Next_Arg); Next_Arg_Len := Arg_Ptr'Length; Result (Next_Pos .. Next_Pos + Next_Arg_Len - 1) := Arg_Ptr.all; Next_Pos := Next_Pos + Next_Arg_Len; if Next_Arg < Arg_Count then Result (Next_Pos) := ' '; Next_Pos := Next_Pos + 1; end if; end loop; return To_Program_Text (Result); end; end if; exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Compilation_Command_Line_Options"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Compilation_Command_Line_Options", Ex => Ex, Arg_CU => Compilation_Unit); end Compilation_Command_Line_Options; ----------------------- -- Compilation_Units -- ----------------------- function Compilation_Units (The_Context : Asis.Context) return Asis.Compilation_Unit_List is Res_Cont_Id : constant Context_Id := Get_Cont_Id (The_Context); Cont_Tree_Mode : Tree_Mode; begin Check_Validity (The_Context, Package_Name & "Compilation_Units"); Cont_Tree_Mode := Tree_Processing_Mode (Res_Cont_Id); if not (Cont_Tree_Mode = Pre_Created or else Cont_Tree_Mode = Incremental) then Set_Status (Status => Use_Error, Diagnosis => "Asis.Compilation_Units.Compilation_Units can not be used " & LT & "for dynamic ASIS Context"); raise ASIS_Failed; end if; Reset_Context (Res_Cont_Id); declare Result_Len : constant Natural := Lib_Unit_Decls (Res_Cont_Id) + Comp_Unit_Bodies (Res_Cont_Id); Result : Compilation_Unit_List (1 .. Result_Len); begin -- We have to skip A_Configuration_Compilation unit, it is the second -- unit in the table Result (1) := Get_Comp_Unit (Standard_Id, Res_Cont_Id); for I in 2 .. Result_Len loop Result (I) := Get_Comp_Unit (First_Unit_Id + Unit_Id (I), Res_Cont_Id); end loop; return Result; end; exception when ASIS_Inappropriate_Context => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Compilation_Units"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Compilation_Units", Ex => Ex); end Compilation_Units; ----------------------------- -- Compilation_Unit_Bodies -- ----------------------------- function Compilation_Unit_Bodies (The_Context : Asis.Context) return Asis.Compilation_Unit_List is Res_Cont_Id : constant Context_Id := Get_Cont_Id (The_Context); Cont_Tree_Mode : Tree_Mode; begin Check_Validity (The_Context, Package_Name & "Compilation_Unit_Bodies"); Cont_Tree_Mode := Tree_Processing_Mode (Res_Cont_Id); if not (Cont_Tree_Mode = Pre_Created or else Cont_Tree_Mode = Incremental) then Set_Status (Status => Use_Error, Diagnosis => "Asis.Compilation_Units.Compilation_Unit_Bodies can not be used " & LT & "for dynamic ASIS Context"); raise ASIS_Failed; end if; Reset_Context (Res_Cont_Id); declare Result_Len : constant Natural := Comp_Unit_Bodies (Res_Cont_Id); Result : Compilation_Unit_List (1 .. Result_Len); L_U_Body : Unit_Id := First_Body; begin for I in 1 .. Result_Len loop Result (I) := Get_Comp_Unit (L_U_Body, Res_Cont_Id); L_U_Body := Next_Body (L_U_Body); end loop; return Result; end; exception when ASIS_Inappropriate_Context => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Compilation_Unit_Bodies"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Compilation_Unit_Bodies", Ex => Ex); end Compilation_Unit_Bodies; --------------------------- -- Compilation_Unit_Body -- --------------------------- function Compilation_Unit_Body (Name : Wide_String; The_Context : Asis.Context) return Asis.Compilation_Unit is Result_Id : Unit_Id; Result_Cont : Context_Id; begin Check_Validity (The_Context, Package_Name & "Compilation_Unit_Body"); Result_Cont := Get_Cont_Id (The_Context); Reset_Context (Result_Cont); Result_Id := Get_One_Unit (Name, Result_Cont, Spec => False); return Get_Comp_Unit (Result_Id, Result_Cont); exception when ASIS_Inappropriate_Context => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Compilation_Unit_Body"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Compilation_Unit_Body (" & To_String (Name) & ")", Ex => Ex); end Compilation_Unit_Body; ------------------------ -- Corresponding_Body -- ------------------------ function Corresponding_Body (Library_Item : Asis.Compilation_Unit) return Asis.Compilation_Unit is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Result_Unit_Id : Unit_Id; Result_Cont_Id : Context_Id; Cont_Tree_Mode : Tree_Mode; begin Check_Validity (Library_Item, Package_Name & "Corresponding_Body"); Result_Cont_Id := Encl_Cont_Id (Library_Item); Reset_Context (Result_Cont_Id); Arg_Kind := Kind (Library_Item); if not (Arg_Kind = A_Procedure or else Arg_Kind = A_Function or else Arg_Kind = A_Package or else Arg_Kind = A_Generic_Procedure or else Arg_Kind = A_Generic_Function or else Arg_Kind = A_Generic_Package or else Arg_Kind = An_Unknown_Unit or else Arg_Kind = A_Procedure_Body or else Arg_Kind = A_Function_Body or else Arg_Kind = A_Package_Body or else Arg_Kind = A_Procedure_Instance or else Arg_Kind = A_Function_Instance or else Arg_Kind = A_Package_Instance or else Arg_Kind = A_Procedure_Renaming or else Arg_Kind = A_Function_Renaming or else Arg_Kind = A_Package_Renaming or else Arg_Kind = A_Generic_Procedure_Renaming or else Arg_Kind = A_Generic_Function_Renaming or else Arg_Kind = A_Generic_Package_Renaming or else Arg_Kind = A_Procedure_Body_Subunit or else Arg_Kind = A_Function_Body_Subunit or else Arg_Kind = A_Package_Body_Subunit or else Arg_Kind = A_Task_Body_Subunit or else Arg_Kind = A_Protected_Body_Subunit or else Arg_Kind = A_Nonexistent_Declaration or else Arg_Kind = A_Nonexistent_Body) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Corresponding_Body"); end if; if Arg_Kind = A_Procedure_Body or else Arg_Kind = A_Function_Body or else Arg_Kind = A_Package_Body or else Arg_Kind = A_Procedure_Instance or else Arg_Kind = A_Function_Instance or else Arg_Kind = A_Package_Instance or else Arg_Kind = A_Procedure_Renaming or else Arg_Kind = A_Function_Renaming or else Arg_Kind = A_Package_Renaming or else Arg_Kind = A_Generic_Procedure_Renaming or else Arg_Kind = A_Generic_Function_Renaming or else Arg_Kind = A_Generic_Package_Renaming or else Arg_Kind = A_Procedure_Body_Subunit or else Arg_Kind = A_Function_Body_Subunit or else Arg_Kind = A_Package_Body_Subunit or else Arg_Kind = A_Task_Body_Subunit or else Arg_Kind = A_Protected_Body_Subunit or else Arg_Kind = A_Nonexistent_Declaration or else Arg_Kind = A_Nonexistent_Body then return Library_Item; end if; if (Arg_Kind = A_Package or else Arg_Kind = A_Generic_Package) and then not Asis.Set_Get.Is_Body_Required (Library_Item) then return Nil_Compilation_Unit; end if; Arg_Unit_Id := Get_Unit_Id (Library_Item); Cont_Tree_Mode := Tree_Processing_Mode (Result_Cont_Id); Result_Unit_Id := Get_Body (Result_Cont_Id, Arg_Unit_Id); if No (Result_Unit_Id) and then (Cont_Tree_Mode = On_The_Fly or else Cont_Tree_Mode = Mixed or else Cont_Tree_Mode = Incremental) then -- as a last escape, we try to create the result body by -- compiling on the fly: Result_Unit_Id := Get_One_Unit (Name => Unit_Full_Name (Library_Item), Context => Result_Cont_Id, Spec => False); end if; if No (Result_Unit_Id) then Result_Unit_Id := Get_Nonexistent_Unit (Result_Cont_Id); end if; return Get_Comp_Unit (Result_Unit_Id, Result_Cont_Id); exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Corresponding_Body"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Corresponding_Body", Ex => Ex, Arg_CU => Library_Item); end Corresponding_Body; function Corresponding_Body (Library_Item : Asis.Compilation_Unit; The_Context : Asis.Context) return Asis.Compilation_Unit is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Arg_Cont_Id : Context_Id; Result_Cont_Id : Context_Id; New_Arg_Unit_Id : Unit_Id; begin Check_Validity (The_Context, Package_Name & "Corresponding_Body"); Check_Validity (Library_Item, Package_Name & "Corresponding_Body"); Arg_Cont_Id := Encl_Cont_Id (Library_Item); Reset_Context (Arg_Cont_Id); Arg_Kind := Kind (Library_Item); if not (Arg_Kind = A_Procedure or else Arg_Kind = A_Function or else Arg_Kind = A_Package or else Arg_Kind = A_Generic_Procedure or else Arg_Kind = A_Generic_Function or else Arg_Kind = A_Generic_Package or else Arg_Kind = An_Unknown_Unit or else Arg_Kind = A_Procedure_Body or else Arg_Kind = A_Function_Body or else Arg_Kind = A_Package_Body or else Arg_Kind = A_Procedure_Instance or else Arg_Kind = A_Function_Instance or else Arg_Kind = A_Package_Instance or else Arg_Kind = A_Procedure_Renaming or else Arg_Kind = A_Function_Renaming or else Arg_Kind = A_Package_Renaming or else Arg_Kind = A_Generic_Procedure_Renaming or else Arg_Kind = A_Generic_Function_Renaming or else Arg_Kind = A_Generic_Package_Renaming or else Arg_Kind = A_Procedure_Body_Subunit or else Arg_Kind = A_Function_Body_Subunit or else Arg_Kind = A_Package_Body_Subunit or else Arg_Kind = A_Task_Body_Subunit or else Arg_Kind = A_Protected_Body_Subunit or else Arg_Kind = A_Nonexistent_Declaration or else Arg_Kind = A_Nonexistent_Body) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Corresponding_Body"); end if; Arg_Unit_Id := Get_Unit_Id (Library_Item); Result_Cont_Id := Get_Cont_Id (The_Context); New_Arg_Unit_Id := Get_Same_Unit (Arg_Cont_Id, Arg_Unit_Id, Result_Cont_Id); if Present (New_Arg_Unit_Id) then return Corresponding_Body (Get_Comp_Unit (New_Arg_Unit_Id, Result_Cont_Id)); else return Nil_Compilation_Unit; end if; exception when ASIS_Inappropriate_Compilation_Unit | ASIS_Inappropriate_Context => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Corresponding_Body"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Corresponding_Body", Ex => Ex, Arg_CU => Library_Item, Context_Par => True); end Corresponding_Body; ---------------------------- -- Corresponding_Children -- ---------------------------- function Corresponding_Children (Library_Unit : Asis.Compilation_Unit) return Asis.Compilation_Unit_List is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Res_Cont_Id : Context_Id; Cont_Tree_Mode : Tree_Mode; begin Check_Validity (Library_Unit, Package_Name & "Corresponding_Children"); Res_Cont_Id := Encl_Cont_Id (Library_Unit); Reset_Context (Res_Cont_Id); Arg_Kind := Kind (Library_Unit); if not (Arg_Kind = A_Package or else Arg_Kind = A_Generic_Package or else Arg_Kind = A_Package_Instance) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Corresponding_Children"); end if; Cont_Tree_Mode := Tree_Processing_Mode (Res_Cont_Id); if not (Cont_Tree_Mode = Pre_Created or else Cont_Tree_Mode = Incremental) then Set_Status (Status => Use_Error, Diagnosis => "Asis.Compilation_Units.Corresponding_Children can not be used " & LT & "for dynamic ASIS Context"); raise ASIS_Failed; end if; Arg_Unit_Id := Get_Unit_Id (Library_Unit); declare Result_Id_List : constant Unit_Id_List := Children (Arg_Unit_Id); Result_List : constant Compilation_Unit_List := Get_Comp_Unit_List (Result_Id_List, Res_Cont_Id); begin return Result_List; end; exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Corresponding_Children"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Corresponding_Children", Ex => Ex, Arg_CU => Library_Unit); end Corresponding_Children; function Corresponding_Children (Library_Unit : Asis.Compilation_Unit; The_Context : Asis.Context) return Asis.Compilation_Unit_List is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Arg_Cont_Id : Context_Id; Result_Cont_Id : Context_Id; New_Arg_Unit_Id : Unit_Id; Cont_Tree_Mode : Tree_Mode; begin Check_Validity (The_Context, Package_Name & "Corresponding_Children"); Check_Validity (Library_Unit, Package_Name & "Corresponding_Children"); Arg_Cont_Id := Encl_Cont_Id (Library_Unit); Reset_Context (Arg_Cont_Id); Arg_Kind := Kind (Library_Unit); if not (Arg_Kind = A_Package or else Arg_Kind = A_Generic_Package or else Arg_Kind = A_Package_Instance) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Corresponding_Children"); end if; Result_Cont_Id := Get_Cont_Id (The_Context); Cont_Tree_Mode := Tree_Processing_Mode (Result_Cont_Id); if not (Cont_Tree_Mode = Pre_Created or else Cont_Tree_Mode = Incremental) then Set_Status (Status => Use_Error, Diagnosis => "Asis.Compilation_Units.Corresponding_Children can not be used " & LT & "for dynamic ASIS Context"); raise ASIS_Failed; end if; Arg_Unit_Id := Get_Unit_Id (Library_Unit); New_Arg_Unit_Id := Get_Same_Unit (Arg_Cont_Id, Arg_Unit_Id, Result_Cont_Id); if Present (New_Arg_Unit_Id) then return Corresponding_Children (Get_Comp_Unit (New_Arg_Unit_Id, Result_Cont_Id)); else return Nil_Compilation_Unit_List; end if; exception when ASIS_Inappropriate_Compilation_Unit | ASIS_Inappropriate_Context => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Corresponding_Children"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Corresponding_Children", Ex => Ex, Arg_CU => Library_Unit, Context_Par => True); end Corresponding_Children; ------------------------------- -- Corresponding_Declaration -- ------------------------------- function Corresponding_Declaration (Library_Item : Asis.Compilation_Unit) return Asis.Compilation_Unit is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Result_Unit_Id : Unit_Id; Result_Cont_Id : Context_Id; begin Check_Validity (Library_Item, Package_Name & "Corresponding_Declaration"); Result_Cont_Id := Encl_Cont_Id (Library_Item); Reset_Context (Result_Cont_Id); Arg_Kind := Kind (Library_Item); if not (Arg_Kind = A_Procedure_Body or else Arg_Kind = A_Function_Body or else Arg_Kind = A_Package_Body or else Arg_Kind = An_Unknown_Unit or else Arg_Kind = A_Procedure or else Arg_Kind = A_Function or else Arg_Kind = A_Package or else Arg_Kind = A_Generic_Procedure or else Arg_Kind = A_Generic_Function or else Arg_Kind = A_Generic_Package or else Arg_Kind = A_Procedure_Instance or else Arg_Kind = A_Function_Instance or else Arg_Kind = A_Package_Instance or else Arg_Kind = A_Procedure_Renaming or else Arg_Kind = A_Function_Renaming or else Arg_Kind = A_Package_Renaming or else Arg_Kind = A_Generic_Procedure_Renaming or else Arg_Kind = A_Generic_Function_Renaming or else Arg_Kind = A_Generic_Package_Renaming or else Arg_Kind = A_Procedure_Body_Subunit or else Arg_Kind = A_Function_Body_Subunit or else Arg_Kind = A_Package_Body_Subunit or else Arg_Kind = A_Task_Body_Subunit or else Arg_Kind = A_Protected_Body_Subunit or else Arg_Kind = A_Nonexistent_Declaration or else Arg_Kind = A_Nonexistent_Body) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Corresponding_Declaration"); end if; if Arg_Kind = A_Procedure or else Arg_Kind = A_Function or else Arg_Kind = A_Package or else Arg_Kind = A_Generic_Procedure or else Arg_Kind = A_Generic_Function or else Arg_Kind = A_Generic_Package or else Arg_Kind = A_Procedure_Instance or else Arg_Kind = A_Function_Instance or else Arg_Kind = A_Package_Instance or else Arg_Kind = A_Procedure_Renaming or else Arg_Kind = A_Function_Renaming or else Arg_Kind = A_Package_Renaming or else Arg_Kind = A_Generic_Procedure_Renaming or else Arg_Kind = A_Generic_Function_Renaming or else Arg_Kind = A_Generic_Package_Renaming or else Arg_Kind = A_Procedure_Body_Subunit or else -- ??? Arg_Kind = A_Function_Body_Subunit or else -- ??? Arg_Kind = A_Package_Body_Subunit or else -- ??? Arg_Kind = A_Task_Body_Subunit or else -- ??? Arg_Kind = A_Protected_Body_Subunit or else -- ??? Arg_Kind = A_Nonexistent_Declaration or else Arg_Kind = A_Nonexistent_Body -- ??? then return Library_Item; end if; if (Arg_Kind = A_Procedure_Body or else Arg_Kind = A_Function_Body) and then Class (Library_Item) = A_Public_Declaration_And_Body then return Nil_Compilation_Unit; end if; Arg_Unit_Id := Get_Unit_Id (Library_Item); Result_Unit_Id := Get_Declaration (Result_Cont_Id, Arg_Unit_Id); return Get_Comp_Unit (Result_Unit_Id, Result_Cont_Id); exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Corresponding_Declaration"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Corresponding_Declaration", Ex => Ex, Arg_CU => Library_Item); end Corresponding_Declaration; function Corresponding_Declaration (Library_Item : Asis.Compilation_Unit; The_Context : Asis.Context) return Asis.Compilation_Unit is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Arg_Cont_Id : Context_Id; Result_Cont_Id : Context_Id; New_Arg_Unit_Id : Unit_Id; begin Check_Validity (The_Context, Package_Name & "Corresponding_Declaration"); Check_Validity (Library_Item, Package_Name & "Corresponding_Declaration"); Arg_Cont_Id := Encl_Cont_Id (Library_Item); Reset_Context (Arg_Cont_Id); Arg_Kind := Kind (Library_Item); if not (Arg_Kind = A_Procedure_Body or else Arg_Kind = A_Function_Body or else Arg_Kind = A_Package_Body or else Arg_Kind = An_Unknown_Unit or else Arg_Kind = A_Procedure or else Arg_Kind = A_Function or else Arg_Kind = A_Package or else Arg_Kind = A_Generic_Procedure or else Arg_Kind = A_Generic_Function or else Arg_Kind = A_Generic_Package or else Arg_Kind = A_Procedure_Instance or else Arg_Kind = A_Function_Instance or else Arg_Kind = A_Package_Instance or else Arg_Kind = A_Procedure_Renaming or else Arg_Kind = A_Function_Renaming or else Arg_Kind = A_Package_Renaming or else Arg_Kind = A_Generic_Procedure_Renaming or else Arg_Kind = A_Generic_Function_Renaming or else Arg_Kind = A_Generic_Package_Renaming or else Arg_Kind = A_Procedure_Body_Subunit or else Arg_Kind = A_Function_Body_Subunit or else Arg_Kind = A_Package_Body_Subunit or else Arg_Kind = A_Task_Body_Subunit or else Arg_Kind = A_Protected_Body_Subunit or else Arg_Kind = A_Nonexistent_Declaration or else Arg_Kind = A_Nonexistent_Body) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Corresponding_Declaration"); end if; Arg_Unit_Id := Get_Unit_Id (Library_Item); Result_Cont_Id := Get_Cont_Id (The_Context); New_Arg_Unit_Id := Get_Same_Unit (Arg_Cont_Id, Arg_Unit_Id, Result_Cont_Id); if Present (New_Arg_Unit_Id) then return Corresponding_Declaration (Get_Comp_Unit (New_Arg_Unit_Id, Result_Cont_Id)); else return Nil_Compilation_Unit; end if; exception when ASIS_Inappropriate_Compilation_Unit | ASIS_Inappropriate_Context => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Corresponding_Declaration"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Corresponding_Declaration", Ex => Ex, Arg_CU => Library_Item, Context_Par => True); end Corresponding_Declaration; -------------------------------------- -- Corresponding_Parent_Declaration -- -------------------------------------- function Corresponding_Parent_Declaration (Library_Unit : Asis.Compilation_Unit) return Asis.Compilation_Unit is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Res_Cont_Id : Context_Id; Result_Id : Unit_Id; begin Check_Validity (Library_Unit, Package_Name & "Corresponding_Parent_Declaration"); Res_Cont_Id := Encl_Cont_Id (Library_Unit); Reset_Context (Res_Cont_Id); Arg_Kind := Kind (Library_Unit); if not (Arg_Kind = A_Procedure or else Arg_Kind = A_Function or else Arg_Kind = A_Package or else Arg_Kind = A_Generic_Procedure or else Arg_Kind = A_Generic_Function or else Arg_Kind = A_Generic_Package or else Arg_Kind = A_Procedure_Instance or else Arg_Kind = A_Function_Instance or else Arg_Kind = A_Package_Instance or else Arg_Kind = A_Procedure_Renaming or else Arg_Kind = A_Function_Renaming or else Arg_Kind = A_Package_Renaming or else Arg_Kind = A_Generic_Procedure_Renaming or else Arg_Kind = A_Generic_Function_Renaming or else Arg_Kind = A_Generic_Package_Renaming or else Arg_Kind = A_Procedure_Body or else Arg_Kind = A_Function_Body or else Arg_Kind = A_Package_Body) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Corresponding_Parent_Declaration"); end if; Arg_Unit_Id := Get_Unit_Id (Library_Unit); Result_Id := Get_Parent_Unit (Res_Cont_Id, Arg_Unit_Id); -- Result_Id cannot be Nil_Unit here return Get_Comp_Unit (Result_Id, Res_Cont_Id); exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Corresponding_Parent_Declaration"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Corresponding_Parent_Declaration", Ex => Ex, Arg_CU => Library_Unit); end Corresponding_Parent_Declaration; function Corresponding_Parent_Declaration (Library_Unit : Asis.Compilation_Unit; The_Context : Asis.Context) return Asis.Compilation_Unit is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Arg_Cont_Id : Context_Id; Result_Cont_Id : Context_Id; New_Arg_Unit_Id : Unit_Id; begin Check_Validity (The_Context, Package_Name & "Corresponding_Parent_Declaration"); Check_Validity (Library_Unit, Package_Name & "Corresponding_Parent_Declaration"); Arg_Cont_Id := Encl_Cont_Id (Library_Unit); Reset_Context (Arg_Cont_Id); Arg_Kind := Kind (Library_Unit); if not (Arg_Kind = A_Procedure or else Arg_Kind = A_Function or else Arg_Kind = A_Package or else Arg_Kind = A_Generic_Procedure or else Arg_Kind = A_Generic_Function or else Arg_Kind = A_Generic_Package or else Arg_Kind = A_Procedure_Instance or else Arg_Kind = A_Function_Instance or else Arg_Kind = A_Package_Instance or else Arg_Kind = A_Procedure_Renaming or else Arg_Kind = A_Function_Renaming or else Arg_Kind = A_Package_Renaming or else Arg_Kind = A_Generic_Procedure_Renaming or else Arg_Kind = A_Generic_Function_Renaming or else Arg_Kind = A_Generic_Package_Renaming or else Arg_Kind = A_Procedure_Body or else Arg_Kind = A_Function_Body or else Arg_Kind = A_Package_Body) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Corresponding_Parent_Declaration"); end if; Arg_Unit_Id := Get_Unit_Id (Library_Unit); Result_Cont_Id := Get_Cont_Id (The_Context); New_Arg_Unit_Id := Get_Same_Unit (Arg_Cont_Id, Arg_Unit_Id, Result_Cont_Id); if Present (New_Arg_Unit_Id) then return Corresponding_Parent_Declaration (Get_Comp_Unit (New_Arg_Unit_Id, Result_Cont_Id)); else return Nil_Compilation_Unit; end if; exception when ASIS_Inappropriate_Compilation_Unit | ASIS_Inappropriate_Context => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Corresponding_Parent_Declaration"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Corresponding_Parent_Declaration", Ex => Ex, Arg_CU => Library_Unit, Context_Par => True); end Corresponding_Parent_Declaration; --------------------------------------- -- Corresponding_Subunit_Parent_Body -- --------------------------------------- function Corresponding_Subunit_Parent_Body (Subunit : Asis.Compilation_Unit) return Asis.Compilation_Unit is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Result_Unit_Id : Unit_Id; Result_Cont_Id : Context_Id; begin Check_Validity (Subunit, Package_Name & "Corresponding_Subunit_Parent_Body"); Result_Cont_Id := Encl_Cont_Id (Subunit); Reset_Context (Result_Cont_Id); Arg_Kind := Kind (Subunit); if not (Arg_Kind = A_Procedure_Body_Subunit or else Arg_Kind = A_Function_Body_Subunit or else Arg_Kind = A_Package_Body_Subunit or else Arg_Kind = A_Task_Body_Subunit or else Arg_Kind = A_Protected_Body_Subunit) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Corresponding_Subunit_Parent_Body"); end if; Arg_Unit_Id := Get_Unit_Id (Subunit); Result_Unit_Id := Get_Subunit_Parent_Body (Result_Cont_Id, Arg_Unit_Id); return Get_Comp_Unit (Result_Unit_Id, Result_Cont_Id); exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Corresponding_Subunit_Parent_Body"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Corresponding_Subunit_Parent_Body", Ex => Ex, Arg_CU => Subunit); end Corresponding_Subunit_Parent_Body; function Corresponding_Subunit_Parent_Body (Subunit : Asis.Compilation_Unit; The_Context : Asis.Context) return Asis.Compilation_Unit is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Arg_Cont_Id : Context_Id; Result_Cont_Id : Context_Id; New_Arg_Unit_Id : Unit_Id; begin Check_Validity (The_Context, Package_Name & "Corresponding_Subunit_Parent_Body"); Check_Validity (Subunit, Package_Name & "Corresponding_Subunit_Parent_Body"); Arg_Cont_Id := Encl_Cont_Id (Subunit); Reset_Context (Arg_Cont_Id); Arg_Kind := Kind (Subunit); if not (Arg_Kind = A_Procedure_Body_Subunit or else Arg_Kind = A_Function_Body_Subunit or else Arg_Kind = A_Package_Body_Subunit or else Arg_Kind = A_Task_Body_Subunit or else Arg_Kind = A_Protected_Body_Subunit) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Corresponding_Subunit_Parent_Body"); end if; Arg_Unit_Id := Get_Unit_Id (Subunit); Result_Cont_Id := Get_Cont_Id (The_Context); New_Arg_Unit_Id := Get_Same_Unit (Arg_Cont_Id, Arg_Unit_Id, Result_Cont_Id); if Present (New_Arg_Unit_Id) then return Corresponding_Subunit_Parent_Body (Get_Comp_Unit (New_Arg_Unit_Id, Result_Cont_Id)); else return Nil_Compilation_Unit; end if; exception when ASIS_Inappropriate_Compilation_Unit | ASIS_Inappropriate_Context => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Corresponding_Subunit_Parent_Body"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Corresponding_Subunit_Parent_Body", Ex => Ex, Arg_CU => Subunit, Context_Par => True); end Corresponding_Subunit_Parent_Body; ----------------- -- Debug_Image -- ----------------- function Debug_Image (Compilation_Unit : Asis.Compilation_Unit) return Wide_String is LT : String renames A4G.A_Types.ASIS_Line_Terminator; begin return To_Wide_String (LT & "Compilation Unit Debug_Image: " & Debug_String (Compilation_Unit)); exception when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Debug_Image", Ex => Ex, Arg_CU => Compilation_Unit); end Debug_Image; ------------------------- -- Enclosing_Container -- ------------------------- function Enclosing_Container (Compilation_Unit : Asis.Compilation_Unit) return Asis.Ada_Environments.Containers.Container is begin Check_Validity (Compilation_Unit, Package_Name & "Enclosing_Container"); if Is_Nil (Compilation_Unit) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Enclosing_Container"); else -- For the currently implemented trivial Container model we have: return Asis.Ada_Environments.Containers.Defining_Containers (Enclosing_Context (Compilation_Unit)) (1); end if; exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Enclosing_Container"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Enclosing_Container", Ex => Ex, Arg_CU => Compilation_Unit); end Enclosing_Container; ----------------------- -- Enclosing_Context -- ----------------------- function Enclosing_Context (Compilation_Unit : Asis.Compilation_Unit) return Asis.Context is begin Check_Validity (Compilation_Unit, Package_Name & "Enclosing_Context"); if Is_Nil (Compilation_Unit) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Enclosing_Context"); else return Encl_Cont (Compilation_Unit); end if; exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Enclosing_Context"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Enclosing_Context", Ex => Ex, Arg_CU => Compilation_Unit); end Enclosing_Context; ------------ -- Exists -- ------------ function Exists (Compilation_Unit : Asis.Compilation_Unit) return Boolean is Unit_Kind : Asis.Unit_Kinds; begin Check_Validity (Compilation_Unit, Package_Name & "Exists"); Reset_Context (Encl_Cont_Id (Compilation_Unit)); Unit_Kind := Kind (Compilation_Unit); return not (Unit_Kind = Not_A_Unit or else Unit_Kind = A_Nonexistent_Declaration or else Unit_Kind = A_Nonexistent_Body); exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Exists"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Exists", Ex => Ex, Arg_CU => Compilation_Unit); end Exists; ------------------- -- Has_Attribute -- ------------------- function Has_Attribute (Compilation_Unit : Asis.Compilation_Unit; Attribute : Wide_String) return Boolean is begin pragma Unreferenced (Attribute); Check_Validity (Compilation_Unit, Package_Name & "Has_Attribute"); return False; end Has_Attribute; ---------------------- -- Is_Body_Required -- ---------------------- function Is_Body_Required (Compilation_Unit : Asis.Compilation_Unit) return Boolean is Unit_Kind : constant Asis.Unit_Kinds := Kind (Compilation_Unit); Result : Boolean := False; begin Check_Validity (Compilation_Unit, Package_Name & "Is_Body_Required"); Reset_Context (Encl_Cont_Id (Compilation_Unit)); case Unit_Kind is when A_Package | A_Generic_Package => Result := Asis.Set_Get.Is_Body_Required (Compilation_Unit); when others => null; end case; return Result; exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Is_Body_Required"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Is_Body_Required", Ex => Ex, Arg_CU => Compilation_Unit); end Is_Body_Required; -------------- -- Is_Equal -- -------------- function Is_Equal (Left : Asis.Compilation_Unit; Right : Asis.Compilation_Unit) return Boolean is Left_Unit_Id : Unit_Id; Right_Unit_Id : Unit_Id; Left_Cont_Id : Context_Id; Right_Cont_Id : Context_Id; begin Check_Validity (Left, Package_Name & "Is_Equal"); Check_Validity (Right, Package_Name & "Is_Equal"); Left_Unit_Id := Get_Unit_Id (Left); Right_Unit_Id := Get_Unit_Id (Right); if Left_Unit_Id = Nil_Unit and then Right_Unit_Id = Nil_Unit then return True; elsif (Right_Unit_Id = Nil_Unit and then Left_Unit_Id /= Nil_Unit) or else (Right_Unit_Id /= Nil_Unit and then Left_Unit_Id = Nil_Unit) then return False; end if; Left_Cont_Id := Encl_Cont_Id (Left); Right_Cont_Id := Encl_Cont_Id (Right); if Left_Cont_Id = Right_Cont_Id then return Left_Unit_Id = Right_Unit_Id; else return Right_Unit_Id = Get_Same_Unit (Left_Cont_Id, Left_Unit_Id, Right_Cont_Id); end if; exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Is_Equal"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Is_Equal", Ex => Ex, Arg_CU => Left, Arg_CU_2 => Right); end Is_Equal; ------------------ -- Is_Identical -- ------------------ function Is_Identical (Left : Asis.Compilation_Unit; Right : Asis.Compilation_Unit) return Boolean is Left_Cont_Id : Context_Id; Right_Cont_Id : Context_Id; begin Check_Validity (Left, Package_Name & "Is_Identical"); Check_Validity (Right, Package_Name & "Is_Identical"); Left_Cont_Id := Encl_Cont_Id (Left); Right_Cont_Id := Encl_Cont_Id (Right); return Left_Cont_Id = Right_Cont_Id and then Is_Equal (Left, Right); exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Is_Identical"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Is_Identical", Ex => Ex, Arg_CU => Left, Arg_CU_2 => Right); end Is_Identical; ------------ -- Is_Nil -- ------------ function Is_Nil (Right : Asis.Compilation_Unit) return Boolean is begin Check_Validity (Right, Package_Name & "Is_Nil"); return Right = Nil_Compilation_Unit; end Is_Nil; function Is_Nil (Right : Asis.Compilation_Unit_List) return Boolean is begin return Right = Nil_Compilation_Unit_List; end Is_Nil; ------------------------------ -- Library_Unit_Declaration -- ------------------------------ function Library_Unit_Declaration (Name : Wide_String; The_Context : Asis.Context) return Asis.Compilation_Unit is Result_Id : Unit_Id; Result_Cont : Context_Id; begin Check_Validity (The_Context, Package_Name & "Library_Unit_Declaration"); Result_Cont := Get_Cont_Id (The_Context); Reset_Context (Result_Cont); Result_Id := Get_One_Unit (Name, Result_Cont, Spec => True); return Get_Comp_Unit (Result_Id, Result_Cont); exception when ASIS_Inappropriate_Context => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Library_Unit_Declaration"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Library_Unit_Declaration (" & To_String (Name) & ")", Ex => Ex); end Library_Unit_Declaration; ------------------------------- -- Library_Unit_Declarations -- ------------------------------- function Library_Unit_Declarations (The_Context : Asis.Context) return Asis.Compilation_Unit_List is Res_Cont_Id : constant Context_Id := Get_Cont_Id (The_Context); Cont_Tree_Mode : Tree_Mode; begin Check_Validity (The_Context, Package_Name & "Library_Unit_Declarations"); Cont_Tree_Mode := Tree_Processing_Mode (Res_Cont_Id); if not (Cont_Tree_Mode = Pre_Created or else Cont_Tree_Mode = Incremental) then Set_Status (Status => Use_Error, Diagnosis => "Asis.Compilation_Units.Library_Unit_Declarations " & "can not be used " & LT & "for dynamic ASIS Context"); raise ASIS_Failed; end if; Reset_Context (Res_Cont_Id); declare Result_Len : constant Natural := Lib_Unit_Decls (Res_Cont_Id); Result : Compilation_Unit_List (1 .. Result_Len); L_U_Decl : Unit_Id := First_Unit_Id; -- Standard begin for I in 1 .. Result_Len loop Result (I) := Get_Comp_Unit (L_U_Decl, Res_Cont_Id); L_U_Decl := Next_Decl (L_U_Decl); end loop; return Result; end; exception when ASIS_Inappropriate_Context => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Library_Unit_Declarations"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Library_Unit_Declarations", Ex => Ex); end Library_Unit_Declarations; ----------------- -- Object_Form -- ----------------- function Object_Form (Compilation_Unit : Asis.Compilation_Unit) return Wide_String is begin Check_Validity (Compilation_Unit, Package_Name & "Object_Form"); return Nil_Asis_Wide_String; end Object_Form; ----------------- -- Object_Name -- ----------------- function Object_Name (Compilation_Unit : Asis.Compilation_Unit) return Wide_String is begin Check_Validity (Compilation_Unit, Package_Name & "Object_Name"); return Nil_Asis_Wide_String; end Object_Name; -------------- -- Subunits -- -------------- function Subunits (Parent_Body : Asis.Compilation_Unit) return Asis.Compilation_Unit_List is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Res_Cont_Id : Context_Id; begin Check_Validity (Parent_Body, Package_Name & "Subunits"); Res_Cont_Id := Encl_Cont_Id (Parent_Body); Reset_Context (Res_Cont_Id); Arg_Kind := Kind (Parent_Body); if not (Arg_Kind = A_Procedure_Body or else Arg_Kind = A_Function_Body or else Arg_Kind = A_Package_Body or else Arg_Kind = A_Procedure_Body_Subunit or else Arg_Kind = A_Function_Body_Subunit or else Arg_Kind = A_Package_Body_Subunit or else Arg_Kind = A_Task_Body_Subunit or else Arg_Kind = A_Protected_Body_Subunit) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Subunits"); end if; Arg_Unit_Id := Get_Unit_Id (Parent_Body); declare Result_Id_List : constant Unit_Id_List := Subunits (Res_Cont_Id, Arg_Unit_Id); Result_List : constant Compilation_Unit_List := Get_Comp_Unit_List (Result_Id_List, Res_Cont_Id); begin return Result_List; end; exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Subunits"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Subunits", Ex => Ex, Arg_CU => Parent_Body); end Subunits; function Subunits (Parent_Body : Asis.Compilation_Unit; The_Context : Asis.Context) return Asis.Compilation_Unit_List is Arg_Kind : Asis.Unit_Kinds; Arg_Unit_Id : Unit_Id; Arg_Cont_Id : Context_Id; Result_Cont_Id : Context_Id; New_Arg_Unit_Id : Unit_Id; begin Check_Validity (The_Context, Package_Name & "Subunits"); Check_Validity (Parent_Body, Package_Name & "Subunits"); Arg_Cont_Id := Encl_Cont_Id (Parent_Body); Reset_Context (Arg_Cont_Id); Arg_Kind := Kind (Parent_Body); if not (Arg_Kind = A_Procedure_Body or else Arg_Kind = A_Function_Body or else Arg_Kind = A_Package_Body or else Arg_Kind = A_Procedure_Body_Subunit or else Arg_Kind = A_Function_Body_Subunit or else Arg_Kind = A_Package_Body_Subunit or else Arg_Kind = A_Task_Body_Subunit or else Arg_Kind = A_Protected_Body_Subunit) then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Subunits"); end if; Result_Cont_Id := Get_Cont_Id (The_Context); Arg_Unit_Id := Get_Unit_Id (Parent_Body); New_Arg_Unit_Id := Get_Same_Unit (Arg_Cont_Id, Arg_Unit_Id, Result_Cont_Id); if Present (New_Arg_Unit_Id) then return Subunits (Get_Comp_Unit (New_Arg_Unit_Id, Result_Cont_Id)); else return Nil_Compilation_Unit_List; end if; exception when ASIS_Inappropriate_Compilation_Unit | ASIS_Inappropriate_Context => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Subunits"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Subunits", Ex => Ex, Arg_CU => Parent_Body, Context_Par => True); end Subunits; --------------- -- Text_Form -- --------------- function Text_Form (Compilation_Unit : Asis.Compilation_Unit) return Wide_String is begin Check_Validity (Compilation_Unit, Package_Name & "Text_Form"); return Nil_Asis_Wide_String; end Text_Form; --------------- -- Text_Name -- --------------- function Text_Name (Compilation_Unit : Asis.Compilation_Unit) return Wide_String is begin Check_Validity (Compilation_Unit, Package_Name & "Text_Name"); if not Exists (Compilation_Unit) then return Nil_Asis_Wide_String; else -- Exists resets the Context! return To_Program_Text (Source_File (Compilation_Unit)); end if; exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Text_Name"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Text_Name", Ex => Ex, Arg_CU => Compilation_Unit); end Text_Name; ----------------- -- Unique_Name -- ----------------- function Unique_Name (Compilation_Unit : Asis.Compilation_Unit) return Wide_String is Arg_Kind : Unit_Kinds; begin Check_Validity (Compilation_Unit, Package_Name & "Unique_Name"); if Is_Nil (Compilation_Unit) then return Nil_Asis_Wide_String; else Reset_Context (Encl_Cont_Id (Compilation_Unit)); Arg_Kind := Unit_Kind (Compilation_Unit); -- ???!! Diagnosis_Buffer and Diagnosis_Len should not be used here! Diagnosis_Len := 0; A4G.Vcheck.Add (Context_Info (Compilation_Unit)); A4G.Vcheck.Add (": "); A4G.Vcheck.Add (Unit_Name (Compilation_Unit)); case Arg_Kind is when Asis.A_Library_Unit_Body => A4G.Vcheck.Add (" (body)"); when Asis.A_Subunit => A4G.Vcheck.Add (" (subunit)"); when others => A4G.Vcheck.Add (" (spec)"); end case; return To_Program_Text (Diagnosis_Buffer (1 .. Diagnosis_Len)); end if; exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & ""); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Unique_Name", Ex => Ex, Arg_CU => Compilation_Unit); end Unique_Name; ---------------- -- Unit_Class -- ---------------- function Unit_Class (Compilation_Unit : Asis.Compilation_Unit) return Asis.Unit_Classes is begin Check_Validity (Compilation_Unit, Package_Name & "Unit_Class"); Reset_Context (Encl_Cont_Id (Compilation_Unit)); return Class (Compilation_Unit); end Unit_Class; -------------------- -- Unit_Full_Name -- -------------------- function Unit_Full_Name (Compilation_Unit : Asis.Compilation_Unit) return Wide_String is begin Check_Validity (Compilation_Unit, Package_Name & "Unit_Full_Name"); if Is_Nil (Compilation_Unit) or else Unit_Kind (Compilation_Unit) = A_Configuration_Compilation then return Nil_Asis_Wide_String; else Reset_Context (Encl_Cont_Id (Compilation_Unit)); return To_Program_Text (Unit_Name (Compilation_Unit)); end if; exception when ASIS_Inappropriate_Compilation_Unit => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Unit_Full_Name"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Unit_Full_Name", Ex => Ex, Arg_CU => Compilation_Unit); end Unit_Full_Name; --------------- -- Unit_Kind -- --------------- function Unit_Kind (Compilation_Unit : Asis.Compilation_Unit) return Asis.Unit_Kinds is begin Check_Validity (Compilation_Unit, Package_Name & "Unit_Kind"); return Kind (Compilation_Unit); end Unit_Kind; ----------------- -- Unit_Origin -- ----------------- function Unit_Origin (Compilation_Unit : Asis.Compilation_Unit) return Asis.Unit_Origins is begin Check_Validity (Compilation_Unit, Package_Name & "Unit_Origin"); Reset_Context (Encl_Cont_Id (Compilation_Unit)); return Origin (Compilation_Unit); end Unit_Origin; end Asis.Compilation_Units;
-- Copyright 2016-2019 NXP -- All rights reserved.SPDX-License-Identifier: BSD-3-Clause -- This spec has been automatically generated from LPC55S6x.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with HAL; with System; package NXP_SVD.USBFSH is pragma Preelaborate; --------------- -- Registers -- --------------- subtype HCREVISION_REV_Field is HAL.UInt8; -- BCD representation of the version of the HCI specification that is -- implemented by the Host Controller (HC) type HCREVISION_Register is record -- Read-only. Revision. REV : HCREVISION_REV_Field; -- unspecified Reserved_8_31 : HAL.UInt24; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for HCREVISION_Register use record REV at 0 range 0 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; subtype HCCONTROL_CBSR_Field is HAL.UInt2; subtype HCCONTROL_HCFS_Field is HAL.UInt2; -- Defines the operating modes of the HC type HCCONTROL_Register is record -- ControlBulkServiceRatio. CBSR : HCCONTROL_CBSR_Field := 16#0#; -- PeriodicListEnable. PLE : Boolean := False; -- IsochronousEnable. IE : Boolean := False; -- ControlListEnable. CLE : Boolean := False; -- BulkListEnable This bit is set to enable the processing of the Bulk -- list in the next Frame. BLE : Boolean := False; -- HostControllerFunctionalState for USB 00b: USBRESET 01b: USBRESUME -- 10b: USBOPERATIONAL 11b: USBSUSPEND A transition to USBOPERATIONAL -- from another state causes SOFgeneration to begin 1 ms later. HCFS : HCCONTROL_HCFS_Field := 16#0#; -- InterruptRouting This bit determines the routing of interrupts -- generated by events registered in HcInterruptStatus. IR : Boolean := False; -- RemoteWakeupConnected This bit indicates whether HC supports remote -- wake-up signaling. RWC : Boolean := False; -- RemoteWakeupEnable This bit is used by HCD to enable or disable the -- remote wake-up feature upon the detection of upstream resume -- signaling. RWE : Boolean := False; -- unspecified Reserved_11_31 : HAL.UInt21 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for HCCONTROL_Register use record CBSR at 0 range 0 .. 1; PLE at 0 range 2 .. 2; IE at 0 range 3 .. 3; CLE at 0 range 4 .. 4; BLE at 0 range 5 .. 5; HCFS at 0 range 6 .. 7; IR at 0 range 8 .. 8; RWC at 0 range 9 .. 9; RWE at 0 range 10 .. 10; Reserved_11_31 at 0 range 11 .. 31; end record; subtype HCCOMMANDSTATUS_SOC_Field is HAL.UInt2; -- This register is used to receive the commands from the Host Controller -- Driver (HCD) type HCCOMMANDSTATUS_Register is record -- HostControllerReset This bit is set by HCD to initiate a software -- reset of HC. HCR : Boolean := False; -- ControlListFilled This bit is used to indicate whether there are any -- TDs on the Control list. CLF : Boolean := False; -- BulkListFilled This bit is used to indicate whether there are any TDs -- on the Bulk list. BLF : Boolean := False; -- OwnershipChangeRequest This bit is set by an OS HCD to request a -- change of control of the HC. OCR : Boolean := False; -- unspecified Reserved_4_5 : HAL.UInt2 := 16#0#; -- SchedulingOverrunCount These bits are incremented on each scheduling -- overrun error. SOC : HCCOMMANDSTATUS_SOC_Field := 16#0#; -- unspecified Reserved_8_31 : HAL.UInt24 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for HCCOMMANDSTATUS_Register use record HCR at 0 range 0 .. 0; CLF at 0 range 1 .. 1; BLF at 0 range 2 .. 2; OCR at 0 range 3 .. 3; Reserved_4_5 at 0 range 4 .. 5; SOC at 0 range 6 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; subtype HCINTERRUPTSTATUS_OC_Field is HAL.UInt22; -- Indicates the status on various events that cause hardware interrupts by -- setting the appropriate bits type HCINTERRUPTSTATUS_Register is record -- SchedulingOverrun This bit is set when the USB schedule for the -- current Frame overruns and after the update of HccaFrameNumber. SO : Boolean := False; -- WritebackDoneHead This bit is set immediately after HC has written -- HcDoneHead to HccaDoneHead. WDH : Boolean := False; -- StartofFrame This bit is set by HC at each start of a frame and after -- the update of HccaFrameNumber. SF : Boolean := False; -- ResumeDetected This bit is set when HC detects that a device on the -- USB is asserting resume signaling. RD : Boolean := False; -- UnrecoverableError This bit is set when HC detects a system error not -- related to USB. UE : Boolean := False; -- FrameNumberOverflow This bit is set when the MSb of HcFmNumber (bit -- 15) changes value, from 0 to 1 or from 1 to 0, and after -- HccaFrameNumber has been updated. FNO : Boolean := False; -- RootHubStatusChange This bit is set when the content of HcRhStatus or -- the content of any of HcRhPortStatus[NumberofDownstreamPort] has -- changed. RHSC : Boolean := False; -- unspecified Reserved_7_9 : HAL.UInt3 := 16#0#; -- OwnershipChange This bit is set by HC when HCD sets the -- OwnershipChangeRequest field in HcCommandStatus. OC : HCINTERRUPTSTATUS_OC_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for HCINTERRUPTSTATUS_Register use record SO at 0 range 0 .. 0; WDH at 0 range 1 .. 1; SF at 0 range 2 .. 2; RD at 0 range 3 .. 3; UE at 0 range 4 .. 4; FNO at 0 range 5 .. 5; RHSC at 0 range 6 .. 6; Reserved_7_9 at 0 range 7 .. 9; OC at 0 range 10 .. 31; end record; -- Controls the bits in the HcInterruptStatus register and indicates which -- events will generate a hardware interrupt type HCINTERRUPTENABLE_Register is record -- Scheduling Overrun interrupt. SO : Boolean := False; -- HcDoneHead Writeback interrupt. WDH : Boolean := False; -- Start of Frame interrupt. SF : Boolean := False; -- Resume Detect interrupt. RD : Boolean := False; -- Unrecoverable Error interrupt. UE : Boolean := False; -- Frame Number Overflow interrupt. FNO : Boolean := False; -- Root Hub Status Change interrupt. RHSC : Boolean := False; -- unspecified Reserved_7_29 : HAL.UInt23 := 16#0#; -- Ownership Change interrupt. OC : Boolean := False; -- Master Interrupt Enable. MIE : Boolean := False; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for HCINTERRUPTENABLE_Register use record SO at 0 range 0 .. 0; WDH at 0 range 1 .. 1; SF at 0 range 2 .. 2; RD at 0 range 3 .. 3; UE at 0 range 4 .. 4; FNO at 0 range 5 .. 5; RHSC at 0 range 6 .. 6; Reserved_7_29 at 0 range 7 .. 29; OC at 0 range 30 .. 30; MIE at 0 range 31 .. 31; end record; -- The bits in this register are used to disable corresponding bits in the -- HCInterruptStatus register and in turn disable that event leading to -- hardware interrupt type HCINTERRUPTDISABLE_Register is record -- Scheduling Overrun interrupt. SO : Boolean := False; -- HcDoneHead Writeback interrupt. WDH : Boolean := False; -- Start of Frame interrupt. SF : Boolean := False; -- Resume Detect interrupt. RD : Boolean := False; -- Unrecoverable Error interrupt. UE : Boolean := False; -- Frame Number Overflow interrupt. FNO : Boolean := False; -- Root Hub Status Change interrupt. RHSC : Boolean := False; -- unspecified Reserved_7_29 : HAL.UInt23 := 16#0#; -- Ownership Change interrupt. OC : Boolean := False; -- A 0 written to this field is ignored by HC. MIE : Boolean := False; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for HCINTERRUPTDISABLE_Register use record SO at 0 range 0 .. 0; WDH at 0 range 1 .. 1; SF at 0 range 2 .. 2; RD at 0 range 3 .. 3; UE at 0 range 4 .. 4; FNO at 0 range 5 .. 5; RHSC at 0 range 6 .. 6; Reserved_7_29 at 0 range 7 .. 29; OC at 0 range 30 .. 30; MIE at 0 range 31 .. 31; end record; subtype HCHCCA_HCCA_Field is HAL.UInt24; -- Contains the physical address of the host controller communication area type HCHCCA_Register is record -- unspecified Reserved_0_7 : HAL.UInt8 := 16#0#; -- Base address of the Host Controller Communication Area. HCCA : HCHCCA_HCCA_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for HCHCCA_Register use record Reserved_0_7 at 0 range 0 .. 7; HCCA at 0 range 8 .. 31; end record; subtype HCPERIODCURRENTED_PCED_Field is HAL.UInt28; -- Contains the physical address of the current isochronous or interrupt -- endpoint descriptor type HCPERIODCURRENTED_Register is record -- unspecified Reserved_0_3 : HAL.UInt4; -- Read-only. The content of this register is updated by HC after a -- periodic ED is processed. PCED : HCPERIODCURRENTED_PCED_Field; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for HCPERIODCURRENTED_Register use record Reserved_0_3 at 0 range 0 .. 3; PCED at 0 range 4 .. 31; end record; subtype HCCONTROLHEADED_CHED_Field is HAL.UInt28; -- Contains the physical address of the first endpoint descriptor of the -- control list type HCCONTROLHEADED_Register is record -- unspecified Reserved_0_3 : HAL.UInt4 := 16#0#; -- HC traverses the Control list starting with the HcControlHeadED -- pointer. CHED : HCCONTROLHEADED_CHED_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for HCCONTROLHEADED_Register use record Reserved_0_3 at 0 range 0 .. 3; CHED at 0 range 4 .. 31; end record; subtype HCCONTROLCURRENTED_CCED_Field is HAL.UInt28; -- Contains the physical address of the current endpoint descriptor of the -- control list type HCCONTROLCURRENTED_Register is record -- unspecified Reserved_0_3 : HAL.UInt4 := 16#0#; -- ControlCurrentED. CCED : HCCONTROLCURRENTED_CCED_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for HCCONTROLCURRENTED_Register use record Reserved_0_3 at 0 range 0 .. 3; CCED at 0 range 4 .. 31; end record; subtype HCBULKHEADED_BHED_Field is HAL.UInt28; -- Contains the physical address of the first endpoint descriptor of the -- bulk list type HCBULKHEADED_Register is record -- unspecified Reserved_0_3 : HAL.UInt4 := 16#0#; -- BulkHeadED HC traverses the bulk list starting with the HcBulkHeadED -- pointer. BHED : HCBULKHEADED_BHED_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for HCBULKHEADED_Register use record Reserved_0_3 at 0 range 0 .. 3; BHED at 0 range 4 .. 31; end record; subtype HCBULKCURRENTED_BCED_Field is HAL.UInt28; -- Contains the physical address of the current endpoint descriptor of the -- bulk list type HCBULKCURRENTED_Register is record -- unspecified Reserved_0_3 : HAL.UInt4 := 16#0#; -- BulkCurrentED This is advanced to the next ED after the HC has served -- the current one. BCED : HCBULKCURRENTED_BCED_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for HCBULKCURRENTED_Register use record Reserved_0_3 at 0 range 0 .. 3; BCED at 0 range 4 .. 31; end record; subtype HCDONEHEAD_DH_Field is HAL.UInt28; -- Contains the physical address of the last transfer descriptor added to -- the 'Done' queue type HCDONEHEAD_Register is record -- unspecified Reserved_0_3 : HAL.UInt4; -- Read-only. DoneHead When a TD is completed, HC writes the content of -- HcDoneHead to the NextTD field of the TD. DH : HCDONEHEAD_DH_Field; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for HCDONEHEAD_Register use record Reserved_0_3 at 0 range 0 .. 3; DH at 0 range 4 .. 31; end record; subtype HCFMINTERVAL_FI_Field is HAL.UInt14; subtype HCFMINTERVAL_FSMPS_Field is HAL.UInt15; -- Defines the bit time interval in a frame and the full speed maximum -- packet size which would not cause an overrun type HCFMINTERVAL_Register is record -- FrameInterval This specifies the interval between two consecutive -- SOFs in bit times. FI : HCFMINTERVAL_FI_Field := 16#2EDF#; -- unspecified Reserved_14_15 : HAL.UInt2 := 16#0#; -- FSLargestDataPacket This field specifies a value which is loaded into -- the Largest Data Packet Counter at the beginning of each frame. FSMPS : HCFMINTERVAL_FSMPS_Field := 16#0#; -- FrameIntervalToggle HCD toggles this bit whenever it loads a new -- value to FrameInterval. FIT : Boolean := False; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for HCFMINTERVAL_Register use record FI at 0 range 0 .. 13; Reserved_14_15 at 0 range 14 .. 15; FSMPS at 0 range 16 .. 30; FIT at 0 range 31 .. 31; end record; subtype HCFMREMAINING_FR_Field is HAL.UInt14; -- A 14-bit counter showing the bit time remaining in the current frame type HCFMREMAINING_Register is record -- Read-only. FrameRemaining This counter is decremented at each bit -- time. FR : HCFMREMAINING_FR_Field; -- unspecified Reserved_14_30 : HAL.UInt17; -- Read-only. FrameRemainingToggle This bit is loaded from the -- FrameIntervalToggle field of HcFmInterval whenever FrameRemaining -- reaches 0. FRT : Boolean; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for HCFMREMAINING_Register use record FR at 0 range 0 .. 13; Reserved_14_30 at 0 range 14 .. 30; FRT at 0 range 31 .. 31; end record; subtype HCFMNUMBER_FN_Field is HAL.UInt16; -- Contains a 16-bit counter and provides the timing reference among events -- happening in the HC and the HCD type HCFMNUMBER_Register is record -- Read-only. FrameNumber This is incremented when HcFmRemaining is -- re-loaded. FN : HCFMNUMBER_FN_Field; -- unspecified Reserved_16_31 : HAL.UInt16; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for HCFMNUMBER_Register use record FN at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype HCPERIODICSTART_PS_Field is HAL.UInt14; -- Contains a programmable 14-bit value which determines the earliest time -- HC should start processing a periodic list type HCPERIODICSTART_Register is record -- PeriodicStart After a hardware reset, this field is cleared and then -- set by HCD during the HC initialization. PS : HCPERIODICSTART_PS_Field := 16#0#; -- unspecified Reserved_14_31 : HAL.UInt18 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for HCPERIODICSTART_Register use record PS at 0 range 0 .. 13; Reserved_14_31 at 0 range 14 .. 31; end record; subtype HCLSTHRESHOLD_LST_Field is HAL.UInt12; -- Contains 11-bit value which is used by the HC to determine whether to -- commit to transfer a maximum of 8-byte LS packet before EOF type HCLSTHRESHOLD_Register is record -- LSThreshold This field contains a value which is compared to the -- FrameRemaining field prior to initiating a Low Speed transaction. LST : HCLSTHRESHOLD_LST_Field := 16#628#; -- unspecified Reserved_12_31 : HAL.UInt20 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for HCLSTHRESHOLD_Register use record LST at 0 range 0 .. 11; Reserved_12_31 at 0 range 12 .. 31; end record; subtype HCRHDESCRIPTORA_NDP_Field is HAL.UInt8; subtype HCRHDESCRIPTORA_POTPGT_Field is HAL.UInt8; -- First of the two registers which describes the characteristics of the -- root hub type HCRHDESCRIPTORA_Register is record -- NumberDownstreamPorts These bits specify the number of downstream -- ports supported by the root hub. NDP : HCRHDESCRIPTORA_NDP_Field := 16#2#; -- PowerSwitchingMode This bit is used to specify how the power -- switching of the root hub ports is controlled. PSM : Boolean := True; -- NoPowerSwitching These bits are used to specify whether power -- switching is supported or port are always powered. NPS : Boolean := False; -- DeviceType This bit specifies that the root hub is not a compound -- device. DT : Boolean := False; -- OverCurrentProtectionMode This bit describes how the overcurrent -- status for the root hub ports are reported. OCPM : Boolean := True; -- NoOverCurrentProtection This bit describes how the overcurrent status -- for the root hub ports are reported. NOCP : Boolean := False; -- unspecified Reserved_13_23 : HAL.UInt11 := 16#0#; -- PowerOnToPowerGoodTime This byte specifies the duration the HCD has -- to wait before accessing a powered-on port of the root hub. POTPGT : HCRHDESCRIPTORA_POTPGT_Field := 16#FF#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for HCRHDESCRIPTORA_Register use record NDP at 0 range 0 .. 7; PSM at 0 range 8 .. 8; NPS at 0 range 9 .. 9; DT at 0 range 10 .. 10; OCPM at 0 range 11 .. 11; NOCP at 0 range 12 .. 12; Reserved_13_23 at 0 range 13 .. 23; POTPGT at 0 range 24 .. 31; end record; subtype HCRHDESCRIPTORB_DR_Field is HAL.UInt16; subtype HCRHDESCRIPTORB_PPCM_Field is HAL.UInt16; -- Second of the two registers which describes the characteristics of the -- Root Hub type HCRHDESCRIPTORB_Register is record -- DeviceRemovable Each bit is dedicated to a port of the Root Hub. DR : HCRHDESCRIPTORB_DR_Field := 16#0#; -- PortPowerControlMask Each bit indicates if a port is affected by a -- global power control command when PowerSwitchingMode is set. PPCM : HCRHDESCRIPTORB_PPCM_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for HCRHDESCRIPTORB_Register use record DR at 0 range 0 .. 15; PPCM at 0 range 16 .. 31; end record; -- This register is divided into two parts type HCRHSTATUS_Register is record -- (read) LocalPowerStatus The Root Hub does not support the local power -- status feature; thus, this bit is always read as 0. LPS : Boolean := False; -- OverCurrentIndicator This bit reports overcurrent conditions when the -- global reporting is implemented. OCI : Boolean := False; -- unspecified Reserved_2_14 : HAL.UInt13 := 16#0#; -- (read) DeviceRemoteWakeupEnable This bit enables a -- ConnectStatusChange bit as a resume event, causing a USBSUSPEND to -- USBRESUME state transition and setting the ResumeDetected interrupt. DRWE : Boolean := False; -- (read) LocalPowerStatusChange The root hub does not support the local -- power status feature. LPSC : Boolean := False; -- OverCurrentIndicatorChange This bit is set by hardware when a change -- has occurred to the OCI field of this register. OCIC : Boolean := False; -- unspecified Reserved_18_30 : HAL.UInt13 := 16#0#; -- (write) ClearRemoteWakeupEnable Writing a 1 clears -- DeviceRemoveWakeupEnable. CRWE : Boolean := False; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for HCRHSTATUS_Register use record LPS at 0 range 0 .. 0; OCI at 0 range 1 .. 1; Reserved_2_14 at 0 range 2 .. 14; DRWE at 0 range 15 .. 15; LPSC at 0 range 16 .. 16; OCIC at 0 range 17 .. 17; Reserved_18_30 at 0 range 18 .. 30; CRWE at 0 range 31 .. 31; end record; -- Controls and reports the port events on a per-port basis type HCRHPORTSTATUS_Register is record -- (read) CurrentConnectStatus This bit reflects the current state of -- the downstream port. CCS : Boolean := False; -- (read) PortEnableStatus This bit indicates whether the port is -- enabled or disabled. PES : Boolean := False; -- (read) PortSuspendStatus This bit indicates the port is suspended or -- in the resume sequence. PSS : Boolean := False; -- (read) PortOverCurrentIndicator This bit is only valid when the Root -- Hub is configured in such a way that overcurrent conditions are -- reported on a per-port basis. POCI : Boolean := False; -- (read) PortResetStatus When this bit is set by a write to -- SetPortReset, port reset signaling is asserted. PRS : Boolean := False; -- unspecified Reserved_5_7 : HAL.UInt3 := 16#0#; -- (read) PortPowerStatus This bit reflects the porta's power status, -- regardless of the type of power switching implemented. PPS : Boolean := False; -- (read) LowSpeedDeviceAttached This bit indicates the speed of the -- device attached to this port. LSDA : Boolean := False; -- unspecified Reserved_10_15 : HAL.UInt6 := 16#0#; -- ConnectStatusChange This bit is set whenever a connect or disconnect -- event occurs. CSC : Boolean := False; -- PortEnableStatusChange This bit is set when hardware events cause the -- PortEnableStatus bit to be cleared. PESC : Boolean := False; -- PortSuspendStatusChange This bit is set when the full resume sequence -- is completed. PSSC : Boolean := False; -- PortOverCurrentIndicatorChange This bit is valid only if overcurrent -- conditions are reported on a per-port basis. OCIC : Boolean := False; -- PortResetStatusChange This bit is set at the end of the 10 ms port -- reset signal. PRSC : Boolean := False; -- unspecified Reserved_21_31 : HAL.UInt11 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for HCRHPORTSTATUS_Register use record CCS at 0 range 0 .. 0; PES at 0 range 1 .. 1; PSS at 0 range 2 .. 2; POCI at 0 range 3 .. 3; PRS at 0 range 4 .. 4; Reserved_5_7 at 0 range 5 .. 7; PPS at 0 range 8 .. 8; LSDA at 0 range 9 .. 9; Reserved_10_15 at 0 range 10 .. 15; CSC at 0 range 16 .. 16; PESC at 0 range 17 .. 17; PSSC at 0 range 18 .. 18; OCIC at 0 range 19 .. 19; PRSC at 0 range 20 .. 20; Reserved_21_31 at 0 range 21 .. 31; end record; -- Controls the port if it is attached to the host block or the device -- block type PORTMODE_Register is record -- Port ID pin value. ID : Boolean := False; -- unspecified Reserved_1_7 : HAL.UInt7 := 16#0#; -- Port ID pin pull-up enable. ID_EN : Boolean := False; -- unspecified Reserved_9_15 : HAL.UInt7 := 16#0#; -- 1: device 0: host. DEV_ENABLE : Boolean := False; -- unspecified Reserved_17_31 : HAL.UInt15 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for PORTMODE_Register use record ID at 0 range 0 .. 0; Reserved_1_7 at 0 range 1 .. 7; ID_EN at 0 range 8 .. 8; Reserved_9_15 at 0 range 9 .. 15; DEV_ENABLE at 0 range 16 .. 16; Reserved_17_31 at 0 range 17 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- USB0 Full-speed Host controller type USBFSH_Peripheral is record -- BCD representation of the version of the HCI specification that is -- implemented by the Host Controller (HC) HCREVISION : aliased HCREVISION_Register; -- Defines the operating modes of the HC HCCONTROL : aliased HCCONTROL_Register; -- This register is used to receive the commands from the Host -- Controller Driver (HCD) HCCOMMANDSTATUS : aliased HCCOMMANDSTATUS_Register; -- Indicates the status on various events that cause hardware interrupts -- by setting the appropriate bits HCINTERRUPTSTATUS : aliased HCINTERRUPTSTATUS_Register; -- Controls the bits in the HcInterruptStatus register and indicates -- which events will generate a hardware interrupt HCINTERRUPTENABLE : aliased HCINTERRUPTENABLE_Register; -- The bits in this register are used to disable corresponding bits in -- the HCInterruptStatus register and in turn disable that event leading -- to hardware interrupt HCINTERRUPTDISABLE : aliased HCINTERRUPTDISABLE_Register; -- Contains the physical address of the host controller communication -- area HCHCCA : aliased HCHCCA_Register; -- Contains the physical address of the current isochronous or interrupt -- endpoint descriptor HCPERIODCURRENTED : aliased HCPERIODCURRENTED_Register; -- Contains the physical address of the first endpoint descriptor of the -- control list HCCONTROLHEADED : aliased HCCONTROLHEADED_Register; -- Contains the physical address of the current endpoint descriptor of -- the control list HCCONTROLCURRENTED : aliased HCCONTROLCURRENTED_Register; -- Contains the physical address of the first endpoint descriptor of the -- bulk list HCBULKHEADED : aliased HCBULKHEADED_Register; -- Contains the physical address of the current endpoint descriptor of -- the bulk list HCBULKCURRENTED : aliased HCBULKCURRENTED_Register; -- Contains the physical address of the last transfer descriptor added -- to the 'Done' queue HCDONEHEAD : aliased HCDONEHEAD_Register; -- Defines the bit time interval in a frame and the full speed maximum -- packet size which would not cause an overrun HCFMINTERVAL : aliased HCFMINTERVAL_Register; -- A 14-bit counter showing the bit time remaining in the current frame HCFMREMAINING : aliased HCFMREMAINING_Register; -- Contains a 16-bit counter and provides the timing reference among -- events happening in the HC and the HCD HCFMNUMBER : aliased HCFMNUMBER_Register; -- Contains a programmable 14-bit value which determines the earliest -- time HC should start processing a periodic list HCPERIODICSTART : aliased HCPERIODICSTART_Register; -- Contains 11-bit value which is used by the HC to determine whether to -- commit to transfer a maximum of 8-byte LS packet before EOF HCLSTHRESHOLD : aliased HCLSTHRESHOLD_Register; -- First of the two registers which describes the characteristics of the -- root hub HCRHDESCRIPTORA : aliased HCRHDESCRIPTORA_Register; -- Second of the two registers which describes the characteristics of -- the Root Hub HCRHDESCRIPTORB : aliased HCRHDESCRIPTORB_Register; -- This register is divided into two parts HCRHSTATUS : aliased HCRHSTATUS_Register; -- Controls and reports the port events on a per-port basis HCRHPORTSTATUS : aliased HCRHPORTSTATUS_Register; -- Controls the port if it is attached to the host block or the device -- block PORTMODE : aliased PORTMODE_Register; end record with Volatile; for USBFSH_Peripheral use record HCREVISION at 16#0# range 0 .. 31; HCCONTROL at 16#4# range 0 .. 31; HCCOMMANDSTATUS at 16#8# range 0 .. 31; HCINTERRUPTSTATUS at 16#C# range 0 .. 31; HCINTERRUPTENABLE at 16#10# range 0 .. 31; HCINTERRUPTDISABLE at 16#14# range 0 .. 31; HCHCCA at 16#18# range 0 .. 31; HCPERIODCURRENTED at 16#1C# range 0 .. 31; HCCONTROLHEADED at 16#20# range 0 .. 31; HCCONTROLCURRENTED at 16#24# range 0 .. 31; HCBULKHEADED at 16#28# range 0 .. 31; HCBULKCURRENTED at 16#2C# range 0 .. 31; HCDONEHEAD at 16#30# range 0 .. 31; HCFMINTERVAL at 16#34# range 0 .. 31; HCFMREMAINING at 16#38# range 0 .. 31; HCFMNUMBER at 16#3C# range 0 .. 31; HCPERIODICSTART at 16#40# range 0 .. 31; HCLSTHRESHOLD at 16#44# range 0 .. 31; HCRHDESCRIPTORA at 16#48# range 0 .. 31; HCRHDESCRIPTORB at 16#4C# range 0 .. 31; HCRHSTATUS at 16#50# range 0 .. 31; HCRHPORTSTATUS at 16#54# range 0 .. 31; PORTMODE at 16#5C# range 0 .. 31; end record; -- USB0 Full-speed Host controller USBFSH_Periph : aliased USBFSH_Peripheral with Import, Address => System'To_Address (16#400A2000#); end NXP_SVD.USBFSH;
with Vect9_Pkg; use Vect9_Pkg; package Vect9 is type Rec is record Data : Vector_Access; end record; procedure Proc (This : in Rec; CV : in Unit_Vector; Data : in out Unit_Vector); end Vect9;
------------------------------------------------------------------------------- -- -- -- Coffee Clock -- -- -- -- Copyright (C) 2016-2017 Fabien Chouteau -- -- -- -- Coffee Clock 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. -- -- -- -- Coffee Clock 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 We Noise Maker. If not, see <http://www.gnu.org/licenses/>. -- -- -- ------------------------------------------------------------------------------- with Giza.Colors; with HAL; with HAL.Bitmap; with Giza.Backend; use Giza.Backend; with Giza.Types; use Giza.Types; with Giza.Image; ------------------------- -- LCD_Graphic_Backend -- ------------------------- package LCD_Graphic_Backend is procedure Initialize; subtype Parent is Giza.Backend.Instance; type Instance is new Parent with private; subtype Class is Instance'Class; type Ref is access all Class; overriding procedure Set_Pixel (This : in out Instance; Pt : Point_T); overriding procedure Set_Color (This : in out Instance; C : Giza.Colors.Color); overriding function Size (This : Instance) return Size_T; overriding function Has_Double_Buffring (This : Instance) return Boolean; overriding procedure Swap_Buffers (This : in out Instance); overriding procedure Rectangle (This : in out Instance; Start, Stop : Point_T); overriding procedure Fill_Rectangle (This : in out Instance; Start, Stop : Point_T); overriding procedure Draw_Image (This : in out Instance; Img : Giza.Image.Class; Pt : Point_T); private type Instance is new Parent with record RGB_Color : HAL.Bitmap.Bitmap_Color; end record; end LCD_Graphic_Backend;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . W I D E _ W I D E _ T E X T _ I O . G E N E R I C _ A U X -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2005, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package contains a set of auxiliary routines used by Wide_Wide_Text_IO -- generic children, including for reading and writing numeric strings. -- Note: although this is the Wide version of the package, the interface here -- is still in terms of Character and String rather than Wide_Wide_Character -- and Wide_Wide_String, since all numeric strings are composed entirely of -- characters in the range of type Standard.Character, and the basic -- conversion routines work with Character rather than Wide_Wide_Character. package Ada.Wide_Wide_Text_IO.Generic_Aux is -- Note: for all the Load routines, File indicates the file to be read, -- Buf is the string into which data is stored, Ptr is the index of the -- last character stored so far, and is updated if additional characters -- are stored. Data_Error is raised if the input overflows Buf. The only -- Load routines that do a file status check are Load_Skip and Load_Width -- so one of these two routines must be called first. procedure Check_End_Of_Field (Buf : String; Stop : Integer; Ptr : Integer; Width : Field); -- This routine is used after doing a get operations on a numeric value. -- Buf is the string being scanned, and Stop is the last character of -- the field being scanned. Ptr is as set by the call to the scan routine -- that scanned out the numeric value, i.e. it points one past the last -- character scanned, and Width is the width parameter from the Get call. -- -- There are two cases, if Width is non-zero, then a check is made that -- the remainder of the field is all blanks. If Width is zero, then it -- means that the scan routine scanned out only part of the field. We -- have already scanned out the field that the ACVC tests seem to expect -- us to read (even if it does not follow the syntax of the type being -- scanned, e.g. allowing negative exponents in integers, and underscores -- at the end of the string), so we just raise Data_Error. procedure Check_On_One_Line (File : File_Type; Length : Integer); -- Check to see if item of length Integer characters can fit on -- current line. Call New_Line if not, first checking that the -- line length can accommodate Length characters, raise Layout_Error -- if item is too large for a single line. function Is_Blank (C : Character) return Boolean; -- Determines if C is a blank (space or tab) procedure Load_Width (File : File_Type; Width : Field; Buf : out String; Ptr : in out Integer); -- Loads exactly Width characters, unless a line mark is encountered first procedure Load_Skip (File : File_Type); -- Skips leading blanks and line and page marks, if the end of file is -- read without finding a non-blank character, then End_Error is raised. -- Note: a blank is defined as a space or horizontal tab (RM A.10.6(5)). procedure Load (File : File_Type; Buf : out String; Ptr : in out Integer; Char : Character; Loaded : out Boolean); -- If next character is Char, loads it, otherwise no characters are loaded -- Loaded is set to indicate whether or not the character was found. procedure Load (File : File_Type; Buf : out String; Ptr : in out Integer; Char : Character); -- Same as above, but no indication if character is loaded procedure Load (File : File_Type; Buf : out String; Ptr : in out Integer; Char1 : Character; Char2 : Character; Loaded : out Boolean); -- If next character is Char1 or Char2, loads it, otherwise no characters -- are loaded. Loaded is set to indicate whether or not one of the two -- characters was found. procedure Load (File : File_Type; Buf : out String; Ptr : in out Integer; Char1 : Character; Char2 : Character); -- Same as above, but no indication if character is loaded procedure Load_Digits (File : File_Type; Buf : out String; Ptr : in out Integer; Loaded : out Boolean); -- Loads a sequence of zero or more decimal digits. Loaded is set if -- at least one digit is loaded. procedure Load_Digits (File : File_Type; Buf : out String; Ptr : in out Integer); -- Same as above, but no indication if character is loaded procedure Load_Extended_Digits (File : File_Type; Buf : out String; Ptr : in out Integer; Loaded : out Boolean); -- Like Load_Digits, but also allows extended digits a-f and A-F procedure Load_Extended_Digits (File : File_Type; Buf : out String; Ptr : in out Integer); -- Same as above, but no indication if character is loaded procedure Put_Item (File : File_Type; Str : String); -- This routine is like Wide_Wide_Text_IO.Put, except that it checks for -- overflow of bounded lines, as described in (RM A.10.6(8)). It is used -- for all output of numeric values and of enumeration values. Note that -- the buffer is of type String. Put_Item deals with converting this to -- Wide_Wide_Characters as required. procedure Store_Char (File : File_Type; ch : Integer; Buf : out String; Ptr : in out Integer); -- Store a single character in buffer, checking for overflow and -- adjusting the column number in the file to reflect the fact -- that a character has been acquired from the input stream. -- The pos value of the character to store is in ch on entry. procedure String_Skip (Str : String; Ptr : out Integer); -- Used in the Get from string procedures to skip leading blanks in the -- string. Ptr is set to the index of the first non-blank. If the string -- is all blanks, then the excption End_Error is raised, Note that blank -- is defined as a space or horizontal tab (RM A.10.6(5)). procedure Ungetc (ch : Integer; File : File_Type); -- Pushes back character into stream, using ungetc. The caller has -- checked that the file is in read status. Device_Error is raised -- if the character cannot be pushed back. An attempt to push back -- an end of file (EOF) is ignored. private pragma Inline (Is_Blank); end Ada.Wide_Wide_Text_IO.Generic_Aux;
-- This spec has been automatically generated from STM32L4x3.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with HAL; with System; package STM32_SVD.RCC is pragma Preelaborate; --------------- -- Registers -- --------------- subtype CR_MSIRANGE_Field is HAL.UInt4; -- Clock control register type CR_Register is record -- MSI clock enable MSION : Boolean := True; -- Read-only. MSI clock ready flag MSIRDY : Boolean := True; -- MSI clock PLL enable MSIPLLEN : Boolean := False; -- Write-only. MSI clock range selection MSIRGSEL : Boolean := False; -- MSI clock ranges MSIRANGE : CR_MSIRANGE_Field := 16#6#; -- HSI clock enable HSION : Boolean := False; -- HSI always enable for peripheral kernels HSIKERON : Boolean := False; -- Read-only. HSI clock ready flag HSIRDY : Boolean := False; -- HSI automatic start from Stop HSIASFS : Boolean := False; -- unspecified Reserved_12_15 : HAL.UInt4 := 16#0#; -- HSE clock enable HSEON : Boolean := False; -- Read-only. HSE clock ready flag HSERDY : Boolean := False; -- HSE crystal oscillator bypass HSEBYP : Boolean := False; -- Write-only. Clock security system enable CSSON : Boolean := False; -- unspecified Reserved_20_23 : HAL.UInt4 := 16#0#; -- Main PLL enable PLLON : Boolean := False; -- Read-only. Main PLL clock ready flag PLLRDY : Boolean := False; -- SAI1 PLL enable PLLSAI1ON : Boolean := False; -- Read-only. SAI1 PLL clock ready flag PLLSAI1RDY : Boolean := False; -- unspecified Reserved_28_31 : HAL.UInt4 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for CR_Register use record MSION at 0 range 0 .. 0; MSIRDY at 0 range 1 .. 1; MSIPLLEN at 0 range 2 .. 2; MSIRGSEL at 0 range 3 .. 3; MSIRANGE at 0 range 4 .. 7; HSION at 0 range 8 .. 8; HSIKERON at 0 range 9 .. 9; HSIRDY at 0 range 10 .. 10; HSIASFS at 0 range 11 .. 11; Reserved_12_15 at 0 range 12 .. 15; HSEON at 0 range 16 .. 16; HSERDY at 0 range 17 .. 17; HSEBYP at 0 range 18 .. 18; CSSON at 0 range 19 .. 19; Reserved_20_23 at 0 range 20 .. 23; PLLON at 0 range 24 .. 24; PLLRDY at 0 range 25 .. 25; PLLSAI1ON at 0 range 26 .. 26; PLLSAI1RDY at 0 range 27 .. 27; Reserved_28_31 at 0 range 28 .. 31; end record; subtype ICSCR_MSICAL_Field is HAL.UInt8; subtype ICSCR_MSITRIM_Field is HAL.UInt8; subtype ICSCR_HSICAL_Field is HAL.UInt8; subtype ICSCR_HSITRIM_Field is HAL.UInt5; -- Internal clock sources calibration register type ICSCR_Register is record -- Read-only. MSI clock calibration MSICAL : ICSCR_MSICAL_Field := 16#0#; -- MSI clock trimming MSITRIM : ICSCR_MSITRIM_Field := 16#0#; -- Read-only. HSI clock calibration HSICAL : ICSCR_HSICAL_Field := 16#0#; -- HSI clock trimming HSITRIM : ICSCR_HSITRIM_Field := 16#10#; -- unspecified Reserved_29_31 : HAL.UInt3 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for ICSCR_Register use record MSICAL at 0 range 0 .. 7; MSITRIM at 0 range 8 .. 15; HSICAL at 0 range 16 .. 23; HSITRIM at 0 range 24 .. 28; Reserved_29_31 at 0 range 29 .. 31; end record; subtype CFGR_SW_Field is HAL.UInt2; subtype CFGR_SWS_Field is HAL.UInt2; subtype CFGR_HPRE_Field is HAL.UInt4; -- CFGR_PPRE array element subtype CFGR_PPRE_Element is HAL.UInt3; -- CFGR_PPRE array type CFGR_PPRE_Field_Array is array (1 .. 2) of CFGR_PPRE_Element with Component_Size => 3, Size => 6; -- Type definition for CFGR_PPRE type CFGR_PPRE_Field (As_Array : Boolean := False) is record case As_Array is when False => -- PPRE as a value Val : HAL.UInt6; when True => -- PPRE as an array Arr : CFGR_PPRE_Field_Array; end case; end record with Unchecked_Union, Size => 6; for CFGR_PPRE_Field use record Val at 0 range 0 .. 5; Arr at 0 range 0 .. 5; end record; subtype CFGR_MCOSEL_Field is HAL.UInt3; subtype CFGR_MCOPRE_Field is HAL.UInt3; -- Clock configuration register type CFGR_Register is record -- System clock switch SW : CFGR_SW_Field := 16#0#; -- Read-only. System clock switch status SWS : CFGR_SWS_Field := 16#0#; -- AHB prescaler HPRE : CFGR_HPRE_Field := 16#0#; -- PB low-speed prescaler (APB1) PPRE : CFGR_PPRE_Field := (As_Array => False, Val => 16#0#); -- unspecified Reserved_14_14 : HAL.Bit := 16#0#; -- Wakeup from Stop and CSS backup clock selection STOPWUCK : Boolean := False; -- unspecified Reserved_16_23 : HAL.UInt8 := 16#0#; -- Microcontroller clock output MCOSEL : CFGR_MCOSEL_Field := 16#0#; -- unspecified Reserved_27_27 : HAL.Bit := 16#0#; -- Read-only. Microcontroller clock output prescaler MCOPRE : CFGR_MCOPRE_Field := 16#0#; -- unspecified Reserved_31_31 : HAL.Bit := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for CFGR_Register use record SW at 0 range 0 .. 1; SWS at 0 range 2 .. 3; HPRE at 0 range 4 .. 7; PPRE at 0 range 8 .. 13; Reserved_14_14 at 0 range 14 .. 14; STOPWUCK at 0 range 15 .. 15; Reserved_16_23 at 0 range 16 .. 23; MCOSEL at 0 range 24 .. 26; Reserved_27_27 at 0 range 27 .. 27; MCOPRE at 0 range 28 .. 30; Reserved_31_31 at 0 range 31 .. 31; end record; subtype PLLCFGR_PLLSRC_Field is HAL.UInt2; subtype PLLCFGR_PLLM_Field is HAL.UInt3; subtype PLLCFGR_PLLN_Field is HAL.UInt7; subtype PLLCFGR_PLLQ_Field is HAL.UInt2; subtype PLLCFGR_PLLR_Field is HAL.UInt2; -- PLL configuration register type PLLCFGR_Register is record -- Main PLL, PLLSAI1 and PLLSAI2 entry clock source PLLSRC : PLLCFGR_PLLSRC_Field := 16#0#; -- unspecified Reserved_2_3 : HAL.UInt2 := 16#0#; -- Division factor for the main PLL and audio PLL (PLLSAI1 and PLLSAI2) -- input clock PLLM : PLLCFGR_PLLM_Field := 16#0#; -- unspecified Reserved_7_7 : HAL.Bit := 16#0#; -- Main PLL multiplication factor for VCO PLLN : PLLCFGR_PLLN_Field := 16#10#; -- unspecified Reserved_15_15 : HAL.Bit := 16#0#; -- Main PLL PLLSAI3CLK output enable PLLPEN : Boolean := False; -- Main PLL division factor for PLLSAI3CLK (SAI1 and SAI2 clock) PLLP : Boolean := False; -- unspecified Reserved_18_19 : HAL.UInt2 := 16#0#; -- Main PLL PLLUSB1CLK output enable PLLQEN : Boolean := False; -- Main PLL division factor for PLLUSB1CLK(48 MHz clock) PLLQ : PLLCFGR_PLLQ_Field := 16#0#; -- unspecified Reserved_23_23 : HAL.Bit := 16#0#; -- Main PLL PLLCLK output enable PLLREN : Boolean := False; -- Main PLL division factor for PLLCLK (system clock) PLLR : PLLCFGR_PLLR_Field := 16#0#; -- unspecified Reserved_27_31 : HAL.UInt5 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for PLLCFGR_Register use record PLLSRC at 0 range 0 .. 1; Reserved_2_3 at 0 range 2 .. 3; PLLM at 0 range 4 .. 6; Reserved_7_7 at 0 range 7 .. 7; PLLN at 0 range 8 .. 14; Reserved_15_15 at 0 range 15 .. 15; PLLPEN at 0 range 16 .. 16; PLLP at 0 range 17 .. 17; Reserved_18_19 at 0 range 18 .. 19; PLLQEN at 0 range 20 .. 20; PLLQ at 0 range 21 .. 22; Reserved_23_23 at 0 range 23 .. 23; PLLREN at 0 range 24 .. 24; PLLR at 0 range 25 .. 26; Reserved_27_31 at 0 range 27 .. 31; end record; subtype PLLSAI1CFGR_PLLSAI1N_Field is HAL.UInt7; subtype PLLSAI1CFGR_PLLSAI1Q_Field is HAL.UInt2; subtype PLLSAI1CFGR_PLLSAI1R_Field is HAL.UInt2; -- PLLSAI1 configuration register type PLLSAI1CFGR_Register is record -- unspecified Reserved_0_7 : HAL.UInt8 := 16#0#; -- SAI1PLL multiplication factor for VCO PLLSAI1N : PLLSAI1CFGR_PLLSAI1N_Field := 16#10#; -- unspecified Reserved_15_15 : HAL.Bit := 16#0#; -- SAI1PLL PLLSAI1CLK output enable PLLSAI1PEN : Boolean := False; -- SAI1PLL division factor for PLLSAI1CLK (SAI1 or SAI2 clock) PLLSAI1P : Boolean := False; -- unspecified Reserved_18_19 : HAL.UInt2 := 16#0#; -- SAI1PLL PLLUSB2CLK output enable PLLSAI1QEN : Boolean := False; -- SAI1PLL division factor for PLLUSB2CLK (48 MHz clock) PLLSAI1Q : PLLSAI1CFGR_PLLSAI1Q_Field := 16#0#; -- unspecified Reserved_23_23 : HAL.Bit := 16#0#; -- PLLSAI1 PLLADC1CLK output enable PLLSAI1REN : Boolean := False; -- PLLSAI1 division factor for PLLADC1CLK (ADC clock) PLLSAI1R : PLLSAI1CFGR_PLLSAI1R_Field := 16#0#; -- unspecified Reserved_27_31 : HAL.UInt5 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for PLLSAI1CFGR_Register use record Reserved_0_7 at 0 range 0 .. 7; PLLSAI1N at 0 range 8 .. 14; Reserved_15_15 at 0 range 15 .. 15; PLLSAI1PEN at 0 range 16 .. 16; PLLSAI1P at 0 range 17 .. 17; Reserved_18_19 at 0 range 18 .. 19; PLLSAI1QEN at 0 range 20 .. 20; PLLSAI1Q at 0 range 21 .. 22; Reserved_23_23 at 0 range 23 .. 23; PLLSAI1REN at 0 range 24 .. 24; PLLSAI1R at 0 range 25 .. 26; Reserved_27_31 at 0 range 27 .. 31; end record; -- Clock interrupt enable register type CIER_Register is record -- LSI ready interrupt enable LSIRDYIE : Boolean := False; -- LSE ready interrupt enable LSERDYIE : Boolean := False; -- MSI ready interrupt enable MSIRDYIE : Boolean := False; -- HSI ready interrupt enable HSIRDYIE : Boolean := False; -- HSE ready interrupt enable HSERDYIE : Boolean := False; -- PLL ready interrupt enable PLLRDYIE : Boolean := False; -- PLLSAI1 ready interrupt enable PLLSAI1RDYIE : Boolean := False; -- unspecified Reserved_7_8 : HAL.UInt2 := 16#0#; -- LSE clock security system interrupt enable LSECSSIE : Boolean := False; -- HSI48 ready interrupt enable HSI48RDYIE : Boolean := False; -- unspecified Reserved_11_31 : HAL.UInt21 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for CIER_Register use record LSIRDYIE at 0 range 0 .. 0; LSERDYIE at 0 range 1 .. 1; MSIRDYIE at 0 range 2 .. 2; HSIRDYIE at 0 range 3 .. 3; HSERDYIE at 0 range 4 .. 4; PLLRDYIE at 0 range 5 .. 5; PLLSAI1RDYIE at 0 range 6 .. 6; Reserved_7_8 at 0 range 7 .. 8; LSECSSIE at 0 range 9 .. 9; HSI48RDYIE at 0 range 10 .. 10; Reserved_11_31 at 0 range 11 .. 31; end record; -- Clock interrupt flag register type CIFR_Register is record -- Read-only. LSI ready interrupt flag LSIRDYF : Boolean; -- Read-only. LSE ready interrupt flag LSERDYF : Boolean; -- Read-only. MSI ready interrupt flag MSIRDYF : Boolean; -- Read-only. HSI ready interrupt flag HSIRDYF : Boolean; -- Read-only. HSE ready interrupt flag HSERDYF : Boolean; -- Read-only. PLL ready interrupt flag PLLRDYF : Boolean; -- Read-only. PLLSAI1 ready interrupt flag PLLSAI1RDYF : Boolean; -- unspecified Reserved_7_7 : HAL.Bit; -- Read-only. Clock security system interrupt flag CSSF : Boolean; -- Read-only. LSE Clock security system interrupt flag LSECSSF : Boolean; -- Read-only. HSI48 ready interrupt flag HSI48RDYF : Boolean; -- unspecified Reserved_11_31 : HAL.UInt21; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for CIFR_Register use record LSIRDYF at 0 range 0 .. 0; LSERDYF at 0 range 1 .. 1; MSIRDYF at 0 range 2 .. 2; HSIRDYF at 0 range 3 .. 3; HSERDYF at 0 range 4 .. 4; PLLRDYF at 0 range 5 .. 5; PLLSAI1RDYF at 0 range 6 .. 6; Reserved_7_7 at 0 range 7 .. 7; CSSF at 0 range 8 .. 8; LSECSSF at 0 range 9 .. 9; HSI48RDYF at 0 range 10 .. 10; Reserved_11_31 at 0 range 11 .. 31; end record; -- Clock interrupt clear register type CICR_Register is record -- Write-only. LSI ready interrupt clear LSIRDYC : Boolean := False; -- Write-only. LSE ready interrupt clear LSERDYC : Boolean := False; -- Write-only. MSI ready interrupt clear MSIRDYC : Boolean := False; -- Write-only. HSI ready interrupt clear HSIRDYC : Boolean := False; -- Write-only. HSE ready interrupt clear HSERDYC : Boolean := False; -- Write-only. PLL ready interrupt clear PLLRDYC : Boolean := False; -- Write-only. PLLSAI1 ready interrupt clear PLLSAI1RDYC : Boolean := False; -- unspecified Reserved_7_7 : HAL.Bit := 16#0#; -- Write-only. Clock security system interrupt clear CSSC : Boolean := False; -- Write-only. LSE Clock security system interrupt clear LSECSSC : Boolean := False; -- Write-only. HSI48 oscillator ready interrupt clear HSI48RDYC : Boolean := False; -- unspecified Reserved_11_31 : HAL.UInt21 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for CICR_Register use record LSIRDYC at 0 range 0 .. 0; LSERDYC at 0 range 1 .. 1; MSIRDYC at 0 range 2 .. 2; HSIRDYC at 0 range 3 .. 3; HSERDYC at 0 range 4 .. 4; PLLRDYC at 0 range 5 .. 5; PLLSAI1RDYC at 0 range 6 .. 6; Reserved_7_7 at 0 range 7 .. 7; CSSC at 0 range 8 .. 8; LSECSSC at 0 range 9 .. 9; HSI48RDYC at 0 range 10 .. 10; Reserved_11_31 at 0 range 11 .. 31; end record; -- AHB1 peripheral reset register type AHB1RSTR_Register is record -- DMA1 reset DMA1RST : Boolean := False; -- DMA2 reset DMA2RST : Boolean := False; -- unspecified Reserved_2_7 : HAL.UInt6 := 16#0#; -- Flash memory interface reset FLASHRST : Boolean := False; -- unspecified Reserved_9_10 : HAL.UInt2 := 16#0#; -- CRC reset CRCRST : Boolean := False; -- unspecified Reserved_12_15 : HAL.UInt4 := 16#0#; -- Touch Sensing Controller reset TSCRST : Boolean := False; -- unspecified Reserved_17_31 : HAL.UInt15 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for AHB1RSTR_Register use record DMA1RST at 0 range 0 .. 0; DMA2RST at 0 range 1 .. 1; Reserved_2_7 at 0 range 2 .. 7; FLASHRST at 0 range 8 .. 8; Reserved_9_10 at 0 range 9 .. 10; CRCRST at 0 range 11 .. 11; Reserved_12_15 at 0 range 12 .. 15; TSCRST at 0 range 16 .. 16; Reserved_17_31 at 0 range 17 .. 31; end record; -- AHB2 peripheral reset register type AHB2RSTR_Register is record -- IO port A reset GPIOARST : Boolean := False; -- IO port B reset GPIOBRST : Boolean := False; -- IO port C reset GPIOCRST : Boolean := False; -- IO port D reset GPIODRST : Boolean := False; -- IO port E reset GPIOERST : Boolean := False; -- unspecified Reserved_5_6 : HAL.UInt2 := 16#0#; -- IO port H reset GPIOHRST : Boolean := False; -- unspecified Reserved_8_12 : HAL.UInt5 := 16#0#; -- ADC reset ADCRST : Boolean := False; -- unspecified Reserved_14_15 : HAL.UInt2 := 16#0#; -- AES hardware accelerator reset AESRST : Boolean := False; -- unspecified Reserved_17_17 : HAL.Bit := 16#0#; -- Random number generator reset RNGRST : Boolean := False; -- unspecified Reserved_19_31 : HAL.UInt13 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for AHB2RSTR_Register use record GPIOARST at 0 range 0 .. 0; GPIOBRST at 0 range 1 .. 1; GPIOCRST at 0 range 2 .. 2; GPIODRST at 0 range 3 .. 3; GPIOERST at 0 range 4 .. 4; Reserved_5_6 at 0 range 5 .. 6; GPIOHRST at 0 range 7 .. 7; Reserved_8_12 at 0 range 8 .. 12; ADCRST at 0 range 13 .. 13; Reserved_14_15 at 0 range 14 .. 15; AESRST at 0 range 16 .. 16; Reserved_17_17 at 0 range 17 .. 17; RNGRST at 0 range 18 .. 18; Reserved_19_31 at 0 range 19 .. 31; end record; -- AHB3 peripheral reset register type AHB3RSTR_Register is record -- unspecified Reserved_0_7 : HAL.UInt8 := 16#0#; -- Quad SPI memory interface reset QSPIRST : Boolean := False; -- unspecified Reserved_9_31 : HAL.UInt23 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for AHB3RSTR_Register use record Reserved_0_7 at 0 range 0 .. 7; QSPIRST at 0 range 8 .. 8; Reserved_9_31 at 0 range 9 .. 31; end record; -- APB1 peripheral reset register 1 type APB1RSTR1_Register is record -- TIM2 timer reset TIM2RST : Boolean := False; -- unspecified Reserved_1_3 : HAL.UInt3 := 16#0#; -- TIM6 timer reset TIM6RST : Boolean := False; -- TIM7 timer reset TIM7RST : Boolean := False; -- unspecified Reserved_6_8 : HAL.UInt3 := 16#0#; -- LCD interface reset LCDRST : Boolean := False; -- unspecified Reserved_10_13 : HAL.UInt4 := 16#0#; -- SPI2 reset SPI2RST : Boolean := False; -- SPI3 reset SPI3RST : Boolean := False; -- unspecified Reserved_16_16 : HAL.Bit := 16#0#; -- USART2 reset USART2RST : Boolean := False; -- USART3 reset USART3RST : Boolean := False; -- UART4 reset UART4RST : Boolean := False; -- UART5 reset UART5RST : Boolean := False; -- I2C1 reset I2C1RST : Boolean := False; -- I2C2 reset I2C2RST : Boolean := False; -- I2C3 reset I2C3RST : Boolean := False; -- unspecified Reserved_24_24 : HAL.Bit := 16#0#; -- CAN1 reset CAN1RST : Boolean := False; -- unspecified Reserved_26_27 : HAL.UInt2 := 16#0#; -- Power interface reset PWRRST : Boolean := False; -- DAC1 interface reset DAC1RST : Boolean := False; -- OPAMP interface reset OPAMPRST : Boolean := False; -- Low Power Timer 1 reset LPTIM1RST : Boolean := False; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for APB1RSTR1_Register use record TIM2RST at 0 range 0 .. 0; Reserved_1_3 at 0 range 1 .. 3; TIM6RST at 0 range 4 .. 4; TIM7RST at 0 range 5 .. 5; Reserved_6_8 at 0 range 6 .. 8; LCDRST at 0 range 9 .. 9; Reserved_10_13 at 0 range 10 .. 13; SPI2RST at 0 range 14 .. 14; SPI3RST at 0 range 15 .. 15; Reserved_16_16 at 0 range 16 .. 16; USART2RST at 0 range 17 .. 17; USART3RST at 0 range 18 .. 18; UART4RST at 0 range 19 .. 19; UART5RST at 0 range 20 .. 20; I2C1RST at 0 range 21 .. 21; I2C2RST at 0 range 22 .. 22; I2C3RST at 0 range 23 .. 23; Reserved_24_24 at 0 range 24 .. 24; CAN1RST at 0 range 25 .. 25; Reserved_26_27 at 0 range 26 .. 27; PWRRST at 0 range 28 .. 28; DAC1RST at 0 range 29 .. 29; OPAMPRST at 0 range 30 .. 30; LPTIM1RST at 0 range 31 .. 31; end record; -- APB1 peripheral reset register 2 type APB1RSTR2_Register is record -- Low-power UART 1 reset LPUART1RST : Boolean := False; -- unspecified Reserved_1_1 : HAL.Bit := 16#0#; -- Single wire protocol reset SWPMI1RST : Boolean := False; -- unspecified Reserved_3_4 : HAL.UInt2 := 16#0#; -- Low-power timer 2 reset LPTIM2RST : Boolean := False; -- unspecified Reserved_6_31 : HAL.UInt26 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for APB1RSTR2_Register use record LPUART1RST at 0 range 0 .. 0; Reserved_1_1 at 0 range 1 .. 1; SWPMI1RST at 0 range 2 .. 2; Reserved_3_4 at 0 range 3 .. 4; LPTIM2RST at 0 range 5 .. 5; Reserved_6_31 at 0 range 6 .. 31; end record; -- APB2 peripheral reset register type APB2RSTR_Register is record -- System configuration (SYSCFG) reset SYSCFGRST : Boolean := False; -- unspecified Reserved_1_9 : HAL.UInt9 := 16#0#; -- SDMMC reset SDMMCRST : Boolean := False; -- TIM1 timer reset TIM1RST : Boolean := False; -- SPI1 reset SPI1RST : Boolean := False; -- unspecified Reserved_13_13 : HAL.Bit := 16#0#; -- USART1 reset USART1RST : Boolean := False; -- unspecified Reserved_15_15 : HAL.Bit := 16#0#; -- TIM15 timer reset TIM15RST : Boolean := False; -- TIM16 timer reset TIM16RST : Boolean := False; -- unspecified Reserved_18_20 : HAL.UInt3 := 16#0#; -- Serial audio interface 1 (SAI1) reset SAI1RST : Boolean := False; -- unspecified Reserved_22_31 : HAL.UInt10 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for APB2RSTR_Register use record SYSCFGRST at 0 range 0 .. 0; Reserved_1_9 at 0 range 1 .. 9; SDMMCRST at 0 range 10 .. 10; TIM1RST at 0 range 11 .. 11; SPI1RST at 0 range 12 .. 12; Reserved_13_13 at 0 range 13 .. 13; USART1RST at 0 range 14 .. 14; Reserved_15_15 at 0 range 15 .. 15; TIM15RST at 0 range 16 .. 16; TIM16RST at 0 range 17 .. 17; Reserved_18_20 at 0 range 18 .. 20; SAI1RST at 0 range 21 .. 21; Reserved_22_31 at 0 range 22 .. 31; end record; -- AHB1 peripheral clock enable register type AHB1ENR_Register is record -- DMA1 clock enable DMA1EN : Boolean := False; -- DMA2 clock enable DMA2EN : Boolean := False; -- unspecified Reserved_2_7 : HAL.UInt6 := 16#0#; -- Flash memory interface clock enable FLASHEN : Boolean := True; -- unspecified Reserved_9_10 : HAL.UInt2 := 16#0#; -- CRC clock enable CRCEN : Boolean := False; -- unspecified Reserved_12_15 : HAL.UInt4 := 16#0#; -- Touch Sensing Controller clock enable TSCEN : Boolean := False; -- unspecified Reserved_17_31 : HAL.UInt15 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for AHB1ENR_Register use record DMA1EN at 0 range 0 .. 0; DMA2EN at 0 range 1 .. 1; Reserved_2_7 at 0 range 2 .. 7; FLASHEN at 0 range 8 .. 8; Reserved_9_10 at 0 range 9 .. 10; CRCEN at 0 range 11 .. 11; Reserved_12_15 at 0 range 12 .. 15; TSCEN at 0 range 16 .. 16; Reserved_17_31 at 0 range 17 .. 31; end record; -- AHB2 peripheral clock enable register type AHB2ENR_Register is record -- IO port A clock enable GPIOAEN : Boolean := False; -- IO port B clock enable GPIOBEN : Boolean := False; -- IO port C clock enable GPIOCEN : Boolean := False; -- IO port D clock enable GPIODEN : Boolean := False; -- IO port E clock enable GPIOEEN : Boolean := False; -- unspecified Reserved_5_6 : HAL.UInt2 := 16#0#; -- IO port H clock enable GPIOHEN : Boolean := False; -- unspecified Reserved_8_12 : HAL.UInt5 := 16#0#; -- ADC clock enable ADCEN : Boolean := False; -- unspecified Reserved_14_15 : HAL.UInt2 := 16#0#; -- AES accelerator clock enable AESEN : Boolean := False; -- unspecified Reserved_17_17 : HAL.Bit := 16#0#; -- Random Number Generator clock enable RNGEN : Boolean := False; -- unspecified Reserved_19_31 : HAL.UInt13 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for AHB2ENR_Register use record GPIOAEN at 0 range 0 .. 0; GPIOBEN at 0 range 1 .. 1; GPIOCEN at 0 range 2 .. 2; GPIODEN at 0 range 3 .. 3; GPIOEEN at 0 range 4 .. 4; Reserved_5_6 at 0 range 5 .. 6; GPIOHEN at 0 range 7 .. 7; Reserved_8_12 at 0 range 8 .. 12; ADCEN at 0 range 13 .. 13; Reserved_14_15 at 0 range 14 .. 15; AESEN at 0 range 16 .. 16; Reserved_17_17 at 0 range 17 .. 17; RNGEN at 0 range 18 .. 18; Reserved_19_31 at 0 range 19 .. 31; end record; -- AHB3 peripheral clock enable register type AHB3ENR_Register is record -- unspecified Reserved_0_7 : HAL.UInt8 := 16#0#; -- QSPIEN QSPIEN : Boolean := False; -- unspecified Reserved_9_31 : HAL.UInt23 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for AHB3ENR_Register use record Reserved_0_7 at 0 range 0 .. 7; QSPIEN at 0 range 8 .. 8; Reserved_9_31 at 0 range 9 .. 31; end record; -- APB1ENR1 type APB1ENR1_Register is record -- TIM2 timer clock enable TIM2EN : Boolean := False; -- unspecified Reserved_1_3 : HAL.UInt3 := 16#0#; -- TIM6 timer clock enable TIM6EN : Boolean := False; -- TIM7 timer clock enable TIM7EN : Boolean := False; -- unspecified Reserved_6_8 : HAL.UInt3 := 16#0#; -- LCD clock enable LCDEN : Boolean := False; -- RTC APB clock enable RTCAPBEN : Boolean := False; -- Window watchdog clock enable WWDGEN : Boolean := False; -- unspecified Reserved_12_13 : HAL.UInt2 := 16#0#; -- SPI2 clock enable SPI2EN : Boolean := False; -- SPI3 clock enable SP3EN : Boolean := False; -- unspecified Reserved_16_16 : HAL.Bit := 16#0#; -- USART2 clock enable USART2EN : Boolean := False; -- USART3 clock enable USART3EN : Boolean := False; -- unspecified Reserved_19_20 : HAL.UInt2 := 16#0#; -- I2C1 clock enable I2C1EN : Boolean := False; -- I2C2 clock enable I2C2EN : Boolean := False; -- I2C3 clock enable I2C3EN : Boolean := False; -- CRS clock enable CRSEN : Boolean := False; -- CAN1 clock enable CAN1EN : Boolean := False; -- USB FS clock enable USBF : Boolean := False; -- unspecified Reserved_27_27 : HAL.Bit := 16#0#; -- Power interface clock enable PWREN : Boolean := False; -- DAC1 interface clock enable DAC1EN : Boolean := False; -- OPAMP interface clock enable OPAMPEN : Boolean := False; -- Low power timer 1 clock enable LPTIM1EN : Boolean := False; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for APB1ENR1_Register use record TIM2EN at 0 range 0 .. 0; Reserved_1_3 at 0 range 1 .. 3; TIM6EN at 0 range 4 .. 4; TIM7EN at 0 range 5 .. 5; Reserved_6_8 at 0 range 6 .. 8; LCDEN at 0 range 9 .. 9; RTCAPBEN at 0 range 10 .. 10; WWDGEN at 0 range 11 .. 11; Reserved_12_13 at 0 range 12 .. 13; SPI2EN at 0 range 14 .. 14; SP3EN at 0 range 15 .. 15; Reserved_16_16 at 0 range 16 .. 16; USART2EN at 0 range 17 .. 17; USART3EN at 0 range 18 .. 18; Reserved_19_20 at 0 range 19 .. 20; I2C1EN at 0 range 21 .. 21; I2C2EN at 0 range 22 .. 22; I2C3EN at 0 range 23 .. 23; CRSEN at 0 range 24 .. 24; CAN1EN at 0 range 25 .. 25; USBF at 0 range 26 .. 26; Reserved_27_27 at 0 range 27 .. 27; PWREN at 0 range 28 .. 28; DAC1EN at 0 range 29 .. 29; OPAMPEN at 0 range 30 .. 30; LPTIM1EN at 0 range 31 .. 31; end record; -- APB1 peripheral clock enable register 2 type APB1ENR2_Register is record -- Low power UART 1 clock enable LPUART1EN : Boolean := False; -- unspecified Reserved_1_1 : HAL.Bit := 16#0#; -- Single wire protocol clock enable SWPMI1EN : Boolean := False; -- unspecified Reserved_3_4 : HAL.UInt2 := 16#0#; -- LPTIM2EN LPTIM2EN : Boolean := False; -- unspecified Reserved_6_31 : HAL.UInt26 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for APB1ENR2_Register use record LPUART1EN at 0 range 0 .. 0; Reserved_1_1 at 0 range 1 .. 1; SWPMI1EN at 0 range 2 .. 2; Reserved_3_4 at 0 range 3 .. 4; LPTIM2EN at 0 range 5 .. 5; Reserved_6_31 at 0 range 6 .. 31; end record; -- APB2ENR type APB2ENR_Register is record -- SYSCFG clock enable SYSCFGEN : Boolean := False; -- unspecified Reserved_1_6 : HAL.UInt6 := 16#0#; -- Firewall clock enable FIREWALLEN : Boolean := False; -- unspecified Reserved_8_9 : HAL.UInt2 := 16#0#; -- SDMMC clock enable SDMMCEN : Boolean := False; -- TIM1 timer clock enable TIM1EN : Boolean := False; -- SPI1 clock enable SPI1EN : Boolean := False; -- unspecified Reserved_13_13 : HAL.Bit := 16#0#; -- USART1clock enable USART1EN : Boolean := False; -- unspecified Reserved_15_15 : HAL.Bit := 16#0#; -- TIM15 timer clock enable TIM15EN : Boolean := False; -- TIM16 timer clock enable TIM16EN : Boolean := False; -- unspecified Reserved_18_20 : HAL.UInt3 := 16#0#; -- SAI1 clock enable SAI1EN : Boolean := False; -- unspecified Reserved_22_31 : HAL.UInt10 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for APB2ENR_Register use record SYSCFGEN at 0 range 0 .. 0; Reserved_1_6 at 0 range 1 .. 6; FIREWALLEN at 0 range 7 .. 7; Reserved_8_9 at 0 range 8 .. 9; SDMMCEN at 0 range 10 .. 10; TIM1EN at 0 range 11 .. 11; SPI1EN at 0 range 12 .. 12; Reserved_13_13 at 0 range 13 .. 13; USART1EN at 0 range 14 .. 14; Reserved_15_15 at 0 range 15 .. 15; TIM15EN at 0 range 16 .. 16; TIM16EN at 0 range 17 .. 17; Reserved_18_20 at 0 range 18 .. 20; SAI1EN at 0 range 21 .. 21; Reserved_22_31 at 0 range 22 .. 31; end record; -- AHB1 peripheral clocks enable in Sleep and Stop modes register type AHB1SMENR_Register is record -- DMA1 clocks enable during Sleep and Stop modes DMA1SMEN : Boolean := True; -- DMA2 clocks enable during Sleep and Stop modes DMA2SMEN : Boolean := True; -- unspecified Reserved_2_7 : HAL.UInt6 := 16#0#; -- Flash memory interface clocks enable during Sleep and Stop modes FLASHSMEN : Boolean := True; -- SRAM1 interface clocks enable during Sleep and Stop modes SRAM1SMEN : Boolean := True; -- unspecified Reserved_10_10 : HAL.Bit := 16#0#; -- CRCSMEN CRCSMEN : Boolean := False; -- unspecified Reserved_12_15 : HAL.UInt4 := 16#1#; -- Touch Sensing Controller clocks enable during Sleep and Stop modes TSCSMEN : Boolean := True; -- unspecified Reserved_17_31 : HAL.UInt15 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for AHB1SMENR_Register use record DMA1SMEN at 0 range 0 .. 0; DMA2SMEN at 0 range 1 .. 1; Reserved_2_7 at 0 range 2 .. 7; FLASHSMEN at 0 range 8 .. 8; SRAM1SMEN at 0 range 9 .. 9; Reserved_10_10 at 0 range 10 .. 10; CRCSMEN at 0 range 11 .. 11; Reserved_12_15 at 0 range 12 .. 15; TSCSMEN at 0 range 16 .. 16; Reserved_17_31 at 0 range 17 .. 31; end record; -- AHB2 peripheral clocks enable in Sleep and Stop modes register type AHB2SMENR_Register is record -- IO port A clocks enable during Sleep and Stop modes GPIOASMEN : Boolean := True; -- IO port B clocks enable during Sleep and Stop modes GPIOBSMEN : Boolean := True; -- IO port C clocks enable during Sleep and Stop modes GPIOCSMEN : Boolean := True; -- IO port D clocks enable during Sleep and Stop modes GPIODSMEN : Boolean := True; -- IO port E clocks enable during Sleep and Stop modes GPIOESMEN : Boolean := True; -- unspecified Reserved_5_6 : HAL.UInt2 := 16#3#; -- IO port H clocks enable during Sleep and Stop modes GPIOHSMEN : Boolean := True; -- unspecified Reserved_8_8 : HAL.Bit := 16#0#; -- SRAM2 interface clocks enable during Sleep and Stop modes SRAM2SMEN : Boolean := True; -- unspecified Reserved_10_12 : HAL.UInt3 := 16#4#; -- ADC clocks enable during Sleep and Stop modes ADCFSSMEN : Boolean := True; -- unspecified Reserved_14_15 : HAL.UInt2 := 16#0#; -- AES accelerator clocks enable during Sleep and Stop modes AESSMEN : Boolean := True; -- unspecified Reserved_17_17 : HAL.Bit := 16#0#; -- Random Number Generator clocks enable during Sleep and Stop modes RNGSMEN : Boolean := True; -- unspecified Reserved_19_31 : HAL.UInt13 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for AHB2SMENR_Register use record GPIOASMEN at 0 range 0 .. 0; GPIOBSMEN at 0 range 1 .. 1; GPIOCSMEN at 0 range 2 .. 2; GPIODSMEN at 0 range 3 .. 3; GPIOESMEN at 0 range 4 .. 4; Reserved_5_6 at 0 range 5 .. 6; GPIOHSMEN at 0 range 7 .. 7; Reserved_8_8 at 0 range 8 .. 8; SRAM2SMEN at 0 range 9 .. 9; Reserved_10_12 at 0 range 10 .. 12; ADCFSSMEN at 0 range 13 .. 13; Reserved_14_15 at 0 range 14 .. 15; AESSMEN at 0 range 16 .. 16; Reserved_17_17 at 0 range 17 .. 17; RNGSMEN at 0 range 18 .. 18; Reserved_19_31 at 0 range 19 .. 31; end record; -- AHB3 peripheral clocks enable in Sleep and Stop modes register type AHB3SMENR_Register is record -- unspecified Reserved_0_7 : HAL.UInt8 := 16#1#; -- QSPISMEN QSPISMEN : Boolean := True; -- unspecified Reserved_9_31 : HAL.UInt23 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for AHB3SMENR_Register use record Reserved_0_7 at 0 range 0 .. 7; QSPISMEN at 0 range 8 .. 8; Reserved_9_31 at 0 range 9 .. 31; end record; -- APB1SMENR1 type APB1SMENR1_Register is record -- TIM2 timer clocks enable during Sleep and Stop modes TIM2SMEN : Boolean := True; -- unspecified Reserved_1_3 : HAL.UInt3 := 16#7#; -- TIM6 timer clocks enable during Sleep and Stop modes TIM6SMEN : Boolean := True; -- TIM7 timer clocks enable during Sleep and Stop modes TIM7SMEN : Boolean := True; -- unspecified Reserved_6_8 : HAL.UInt3 := 16#0#; -- LCD clocks enable during Sleep and Stop modes LCDSMEN : Boolean := True; -- RTC APB clock enable during Sleep and Stop modes RTCAPBSMEN : Boolean := False; -- Window watchdog clocks enable during Sleep and Stop modes WWDGSMEN : Boolean := True; -- unspecified Reserved_12_13 : HAL.UInt2 := 16#0#; -- SPI2 clocks enable during Sleep and Stop modes SPI2SMEN : Boolean := True; -- SPI3 clocks enable during Sleep and Stop modes SP3SMEN : Boolean := True; -- unspecified Reserved_16_16 : HAL.Bit := 16#0#; -- USART2 clocks enable during Sleep and Stop modes USART2SMEN : Boolean := True; -- USART3 clocks enable during Sleep and Stop modes USART3SMEN : Boolean := True; -- unspecified Reserved_19_20 : HAL.UInt2 := 16#3#; -- I2C1 clocks enable during Sleep and Stop modes I2C1SMEN : Boolean := True; -- I2C2 clocks enable during Sleep and Stop modes I2C2SMEN : Boolean := True; -- I2C3 clocks enable during Sleep and Stop modes I2C3SMEN : Boolean := True; -- unspecified Reserved_24_24 : HAL.Bit := 16#0#; -- CAN1 clocks enable during Sleep and Stop modes CAN1SMEN : Boolean := True; -- USB FS clock enable during Sleep and Stop modes USBFSSMEN : Boolean := False; -- unspecified Reserved_27_27 : HAL.Bit := 16#0#; -- Power interface clocks enable during Sleep and Stop modes PWRSMEN : Boolean := True; -- DAC1 interface clocks enable during Sleep and Stop modes DAC1SMEN : Boolean := True; -- OPAMP interface clocks enable during Sleep and Stop modes OPAMPSMEN : Boolean := True; -- Low power timer 1 clocks enable during Sleep and Stop modes LPTIM1SMEN : Boolean := True; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for APB1SMENR1_Register use record TIM2SMEN at 0 range 0 .. 0; Reserved_1_3 at 0 range 1 .. 3; TIM6SMEN at 0 range 4 .. 4; TIM7SMEN at 0 range 5 .. 5; Reserved_6_8 at 0 range 6 .. 8; LCDSMEN at 0 range 9 .. 9; RTCAPBSMEN at 0 range 10 .. 10; WWDGSMEN at 0 range 11 .. 11; Reserved_12_13 at 0 range 12 .. 13; SPI2SMEN at 0 range 14 .. 14; SP3SMEN at 0 range 15 .. 15; Reserved_16_16 at 0 range 16 .. 16; USART2SMEN at 0 range 17 .. 17; USART3SMEN at 0 range 18 .. 18; Reserved_19_20 at 0 range 19 .. 20; I2C1SMEN at 0 range 21 .. 21; I2C2SMEN at 0 range 22 .. 22; I2C3SMEN at 0 range 23 .. 23; Reserved_24_24 at 0 range 24 .. 24; CAN1SMEN at 0 range 25 .. 25; USBFSSMEN at 0 range 26 .. 26; Reserved_27_27 at 0 range 27 .. 27; PWRSMEN at 0 range 28 .. 28; DAC1SMEN at 0 range 29 .. 29; OPAMPSMEN at 0 range 30 .. 30; LPTIM1SMEN at 0 range 31 .. 31; end record; -- APB1 peripheral clocks enable in Sleep and Stop modes register 2 type APB1SMENR2_Register is record -- Low power UART 1 clocks enable during Sleep and Stop modes LPUART1SMEN : Boolean := True; -- unspecified Reserved_1_1 : HAL.Bit := 16#0#; -- Single wire protocol clocks enable during Sleep and Stop modes SWPMI1SMEN : Boolean := True; -- unspecified Reserved_3_4 : HAL.UInt2 := 16#0#; -- LPTIM2SMEN LPTIM2SMEN : Boolean := True; -- unspecified Reserved_6_31 : HAL.UInt26 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for APB1SMENR2_Register use record LPUART1SMEN at 0 range 0 .. 0; Reserved_1_1 at 0 range 1 .. 1; SWPMI1SMEN at 0 range 2 .. 2; Reserved_3_4 at 0 range 3 .. 4; LPTIM2SMEN at 0 range 5 .. 5; Reserved_6_31 at 0 range 6 .. 31; end record; -- APB2SMENR type APB2SMENR_Register is record -- SYSCFG clocks enable during Sleep and Stop modes SYSCFGSMEN : Boolean := True; -- unspecified Reserved_1_9 : HAL.UInt9 := 16#0#; -- SDMMC clocks enable during Sleep and Stop modes SDMMCSMEN : Boolean := True; -- TIM1 timer clocks enable during Sleep and Stop modes TIM1SMEN : Boolean := True; -- SPI1 clocks enable during Sleep and Stop modes SPI1SMEN : Boolean := True; -- unspecified Reserved_13_13 : HAL.Bit := 16#1#; -- USART1clocks enable during Sleep and Stop modes USART1SMEN : Boolean := True; -- unspecified Reserved_15_15 : HAL.Bit := 16#0#; -- TIM15 timer clocks enable during Sleep and Stop modes TIM15SMEN : Boolean := True; -- TIM16 timer clocks enable during Sleep and Stop modes TIM16SMEN : Boolean := True; -- unspecified Reserved_18_20 : HAL.UInt3 := 16#1#; -- SAI1 clocks enable during Sleep and Stop modes SAI1SMEN : Boolean := True; -- unspecified Reserved_22_31 : HAL.UInt10 := 16#5#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for APB2SMENR_Register use record SYSCFGSMEN at 0 range 0 .. 0; Reserved_1_9 at 0 range 1 .. 9; SDMMCSMEN at 0 range 10 .. 10; TIM1SMEN at 0 range 11 .. 11; SPI1SMEN at 0 range 12 .. 12; Reserved_13_13 at 0 range 13 .. 13; USART1SMEN at 0 range 14 .. 14; Reserved_15_15 at 0 range 15 .. 15; TIM15SMEN at 0 range 16 .. 16; TIM16SMEN at 0 range 17 .. 17; Reserved_18_20 at 0 range 18 .. 20; SAI1SMEN at 0 range 21 .. 21; Reserved_22_31 at 0 range 22 .. 31; end record; subtype CCIPR_USART1SEL_Field is HAL.UInt2; subtype CCIPR_USART2SEL_Field is HAL.UInt2; subtype CCIPR_USART3SEL_Field is HAL.UInt2; subtype CCIPR_LPUART1SEL_Field is HAL.UInt2; subtype CCIPR_I2C1SEL_Field is HAL.UInt2; subtype CCIPR_I2C2SEL_Field is HAL.UInt2; subtype CCIPR_I2C3SEL_Field is HAL.UInt2; subtype CCIPR_LPTIM1SEL_Field is HAL.UInt2; subtype CCIPR_LPTIM2SEL_Field is HAL.UInt2; subtype CCIPR_SAI1SEL_Field is HAL.UInt2; subtype CCIPR_CLK48SEL_Field is HAL.UInt2; subtype CCIPR_ADCSEL_Field is HAL.UInt2; -- CCIPR type CCIPR_Register is record -- USART1 clock source selection USART1SEL : CCIPR_USART1SEL_Field := 16#0#; -- USART2 clock source selection USART2SEL : CCIPR_USART2SEL_Field := 16#0#; -- USART3 clock source selection USART3SEL : CCIPR_USART3SEL_Field := 16#0#; -- unspecified Reserved_6_9 : HAL.UInt4 := 16#0#; -- LPUART1 clock source selection LPUART1SEL : CCIPR_LPUART1SEL_Field := 16#0#; -- I2C1 clock source selection I2C1SEL : CCIPR_I2C1SEL_Field := 16#0#; -- I2C2 clock source selection I2C2SEL : CCIPR_I2C2SEL_Field := 16#0#; -- I2C3 clock source selection I2C3SEL : CCIPR_I2C3SEL_Field := 16#0#; -- Low power timer 1 clock source selection LPTIM1SEL : CCIPR_LPTIM1SEL_Field := 16#0#; -- Low power timer 2 clock source selection LPTIM2SEL : CCIPR_LPTIM2SEL_Field := 16#0#; -- SAI1 clock source selection SAI1SEL : CCIPR_SAI1SEL_Field := 16#0#; -- unspecified Reserved_24_25 : HAL.UInt2 := 16#0#; -- 48 MHz clock source selection CLK48SEL : CCIPR_CLK48SEL_Field := 16#0#; -- ADCs clock source selection ADCSEL : CCIPR_ADCSEL_Field := 16#0#; -- SWPMI1 clock source selection SWPMI1SEL : Boolean := False; -- unspecified Reserved_31_31 : HAL.Bit := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for CCIPR_Register use record USART1SEL at 0 range 0 .. 1; USART2SEL at 0 range 2 .. 3; USART3SEL at 0 range 4 .. 5; Reserved_6_9 at 0 range 6 .. 9; LPUART1SEL at 0 range 10 .. 11; I2C1SEL at 0 range 12 .. 13; I2C2SEL at 0 range 14 .. 15; I2C3SEL at 0 range 16 .. 17; LPTIM1SEL at 0 range 18 .. 19; LPTIM2SEL at 0 range 20 .. 21; SAI1SEL at 0 range 22 .. 23; Reserved_24_25 at 0 range 24 .. 25; CLK48SEL at 0 range 26 .. 27; ADCSEL at 0 range 28 .. 29; SWPMI1SEL at 0 range 30 .. 30; Reserved_31_31 at 0 range 31 .. 31; end record; subtype BDCR_LSEDRV_Field is HAL.UInt2; subtype BDCR_RTCSEL_Field is HAL.UInt2; -- BDCR type BDCR_Register is record -- LSE oscillator enable LSEON : Boolean := False; -- Read-only. LSE oscillator ready LSERDY : Boolean := False; -- LSE oscillator bypass LSEBYP : Boolean := False; -- SE oscillator drive capability LSEDRV : BDCR_LSEDRV_Field := 16#0#; -- LSECSSON LSECSSON : Boolean := False; -- Read-only. LSECSSD LSECSSD : Boolean := False; -- unspecified Reserved_7_7 : HAL.Bit := 16#0#; -- RTC clock source selection RTCSEL : BDCR_RTCSEL_Field := 16#0#; -- unspecified Reserved_10_14 : HAL.UInt5 := 16#0#; -- RTC clock enable RTCEN : Boolean := False; -- Backup domain software reset BDRST : Boolean := False; -- unspecified Reserved_17_23 : HAL.UInt7 := 16#0#; -- Low speed clock output enable LSCOEN : Boolean := False; -- Low speed clock output selection LSCOSEL : Boolean := False; -- unspecified Reserved_26_31 : HAL.UInt6 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for BDCR_Register use record LSEON at 0 range 0 .. 0; LSERDY at 0 range 1 .. 1; LSEBYP at 0 range 2 .. 2; LSEDRV at 0 range 3 .. 4; LSECSSON at 0 range 5 .. 5; LSECSSD at 0 range 6 .. 6; Reserved_7_7 at 0 range 7 .. 7; RTCSEL at 0 range 8 .. 9; Reserved_10_14 at 0 range 10 .. 14; RTCEN at 0 range 15 .. 15; BDRST at 0 range 16 .. 16; Reserved_17_23 at 0 range 17 .. 23; LSCOEN at 0 range 24 .. 24; LSCOSEL at 0 range 25 .. 25; Reserved_26_31 at 0 range 26 .. 31; end record; subtype CSR_MSISRANGE_Field is HAL.UInt4; -- CSR type CSR_Register is record -- LSI oscillator enable LSION : Boolean := False; -- Read-only. LSI oscillator ready LSIRDY : Boolean := False; -- unspecified Reserved_2_7 : HAL.UInt6 := 16#0#; -- SI range after Standby mode MSISRANGE : CSR_MSISRANGE_Field := 16#6#; -- unspecified Reserved_12_22 : HAL.UInt11 := 16#0#; -- Remove reset flag RMVF : Boolean := False; -- Read-only. Firewall reset flag FIREWALLRSTF : Boolean := False; -- Read-only. Option byte loader reset flag OBLRSTF : Boolean := False; -- Read-only. Pin reset flag PINRSTF : Boolean := True; -- Read-only. BOR flag BORRSTF : Boolean := True; -- Read-only. Software reset flag SFTRSTF : Boolean := False; -- Read-only. Independent window watchdog reset flag IWDGRSTF : Boolean := False; -- Read-only. Window watchdog reset flag WWDGRSTF : Boolean := False; -- Read-only. Low-power reset flag LPWRSTF : Boolean := False; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for CSR_Register use record LSION at 0 range 0 .. 0; LSIRDY at 0 range 1 .. 1; Reserved_2_7 at 0 range 2 .. 7; MSISRANGE at 0 range 8 .. 11; Reserved_12_22 at 0 range 12 .. 22; RMVF at 0 range 23 .. 23; FIREWALLRSTF at 0 range 24 .. 24; OBLRSTF at 0 range 25 .. 25; PINRSTF at 0 range 26 .. 26; BORRSTF at 0 range 27 .. 27; SFTRSTF at 0 range 28 .. 28; IWDGRSTF at 0 range 29 .. 29; WWDGRSTF at 0 range 30 .. 30; LPWRSTF at 0 range 31 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Reset and clock control type RCC_Peripheral is record -- Clock control register CR : aliased CR_Register; -- Internal clock sources calibration register ICSCR : aliased ICSCR_Register; -- Clock configuration register CFGR : aliased CFGR_Register; -- PLL configuration register PLLCFGR : aliased PLLCFGR_Register; -- PLLSAI1 configuration register PLLSAI1CFGR : aliased PLLSAI1CFGR_Register; -- Clock interrupt enable register CIER : aliased CIER_Register; -- Clock interrupt flag register CIFR : aliased CIFR_Register; -- Clock interrupt clear register CICR : aliased CICR_Register; -- AHB1 peripheral reset register AHB1RSTR : aliased AHB1RSTR_Register; -- AHB2 peripheral reset register AHB2RSTR : aliased AHB2RSTR_Register; -- AHB3 peripheral reset register AHB3RSTR : aliased AHB3RSTR_Register; -- APB1 peripheral reset register 1 APB1RSTR1 : aliased APB1RSTR1_Register; -- APB1 peripheral reset register 2 APB1RSTR2 : aliased APB1RSTR2_Register; -- APB2 peripheral reset register APB2RSTR : aliased APB2RSTR_Register; -- AHB1 peripheral clock enable register AHB1ENR : aliased AHB1ENR_Register; -- AHB2 peripheral clock enable register AHB2ENR : aliased AHB2ENR_Register; -- AHB3 peripheral clock enable register AHB3ENR : aliased AHB3ENR_Register; -- APB1ENR1 APB1ENR1 : aliased APB1ENR1_Register; -- APB1 peripheral clock enable register 2 APB1ENR2 : aliased APB1ENR2_Register; -- APB2ENR APB2ENR : aliased APB2ENR_Register; -- AHB1 peripheral clocks enable in Sleep and Stop modes register AHB1SMENR : aliased AHB1SMENR_Register; -- AHB2 peripheral clocks enable in Sleep and Stop modes register AHB2SMENR : aliased AHB2SMENR_Register; -- AHB3 peripheral clocks enable in Sleep and Stop modes register AHB3SMENR : aliased AHB3SMENR_Register; -- APB1SMENR1 APB1SMENR1 : aliased APB1SMENR1_Register; -- APB1 peripheral clocks enable in Sleep and Stop modes register 2 APB1SMENR2 : aliased APB1SMENR2_Register; -- APB2SMENR APB2SMENR : aliased APB2SMENR_Register; -- CCIPR CCIPR : aliased CCIPR_Register; -- BDCR BDCR : aliased BDCR_Register; -- CSR CSR : aliased CSR_Register; end record with Volatile; for RCC_Peripheral use record CR at 16#0# range 0 .. 31; ICSCR at 16#4# range 0 .. 31; CFGR at 16#8# range 0 .. 31; PLLCFGR at 16#C# range 0 .. 31; PLLSAI1CFGR at 16#10# range 0 .. 31; CIER at 16#18# range 0 .. 31; CIFR at 16#1C# range 0 .. 31; CICR at 16#20# range 0 .. 31; AHB1RSTR at 16#28# range 0 .. 31; AHB2RSTR at 16#2C# range 0 .. 31; AHB3RSTR at 16#30# range 0 .. 31; APB1RSTR1 at 16#38# range 0 .. 31; APB1RSTR2 at 16#3C# range 0 .. 31; APB2RSTR at 16#40# range 0 .. 31; AHB1ENR at 16#48# range 0 .. 31; AHB2ENR at 16#4C# range 0 .. 31; AHB3ENR at 16#50# range 0 .. 31; APB1ENR1 at 16#58# range 0 .. 31; APB1ENR2 at 16#5C# range 0 .. 31; APB2ENR at 16#60# range 0 .. 31; AHB1SMENR at 16#68# range 0 .. 31; AHB2SMENR at 16#6C# range 0 .. 31; AHB3SMENR at 16#70# range 0 .. 31; APB1SMENR1 at 16#78# range 0 .. 31; APB1SMENR2 at 16#7C# range 0 .. 31; APB2SMENR at 16#80# range 0 .. 31; CCIPR at 16#88# range 0 .. 31; BDCR at 16#90# range 0 .. 31; CSR at 16#94# range 0 .. 31; end record; -- Reset and clock control RCC_Periph : aliased RCC_Peripheral with Import, Address => RCC_Base; end STM32_SVD.RCC;
-- Ascon -- an Ada / SPARK implementation of the Ascon Authenticated Encryption Algorithm -- created by Christoph Dobraunig, Maria Eichlseder, Florian Mendel and -- Martin Schläffer -- Copyright (c) 2016-2018, James Humphry - see LICENSE file for details pragma Restrictions(No_Implementation_Attributes, No_Implementation_Units, No_Obsolescent_Features); with System.Storage_Elements; private with Interfaces; with Ascon_Definitions; use Ascon_Definitions; generic a_rounds : Round_Count := 12; b_rounds : Round_Count := 6; b_round_constants_offset : Round_Offset := 6; rate : Rate_Bits := 64; package Ascon with SPARK_Mode => On is -- These constants are the same for all variants of Ascon key_bits : constant := 128; nonce_bits : constant := 128; tag_bits : constant := 128; use System.Storage_Elements; subtype Key_Type is Storage_Array(0..Storage_Offset(key_bits/8)-1); -- A Storage_Array subtype containing key material. subtype Nonce_Type is Storage_Array(0..Storage_Offset(nonce_bits/8)-1); -- A Storage_Array subtype containing the nonce material. This must be unique -- per-message. subtype Tag_Type is Storage_Array(0..Storage_Offset(tag_bits/8)-1); -- A Storage_Array subtype containing an authentication tag. Null_Storage_Array : constant Storage_Array(1..0) := (others => 0); -- A null Storage_Array that can be passed to AEADEnc and AEADDec if one of -- the associated data or message parameters is not required. -- High-level API for Ascon procedure AEADEnc(K : in Key_Type; N : in Nonce_Type; A : in Storage_Array; M : in Storage_Array; C : out Storage_Array; T : out Tag_Type) with Pre => ( (Valid_Storage_Array_Parameter(A) and Valid_Storage_Array_Parameter(M) and Valid_Storage_Array_Parameter(C'First, C'Last)) and then C'Length = M'Length ); -- AEADEnc carries out an authenticated encryption -- K : key data -- N : nonce -- A : optional (unencrypted) associated data -- M : optional message to be encrypted -- C : encrypted version of M -- T : authentication tag for (A,M,Z) procedure AEADDec(K : in Key_Type; N : in Nonce_Type; A : in Storage_Array; C : in Storage_Array; T : in Tag_Type; M : out Storage_Array; Valid : out Boolean) with Pre => ( (Valid_Storage_Array_Parameter(A) and Valid_Storage_Array_Parameter(C) and Valid_Storage_Array_Parameter(M'First, M'Last)) and then M'Length = C'Length ), Post => (Valid or (for all I in M'Range => M(I) = 0)); -- AEADEnc carries out an authenticated decryption -- K : key data -- N : nonce -- A : optional (unencrypted) associated data -- C : optional ciphertext to be decrypted -- T : authentication tag -- M : contains the decrypted C or zero if the input does not authenticate -- Valid : indicates if the input authenticates correctly type State is private; -- This type declaration makes the Ascon.Access_Internals package easier to -- write. It is not intended for normal use. function Valid_Storage_Array_Parameter(X : in Storage_Array) return Boolean with Ghost; -- This ghost function simplifies the preconditions function Valid_Storage_Array_Parameter(First : in Storage_Offset; Last : in Storage_Offset) return Boolean with Ghost; -- This ghost function simplifies the preconditions private function Valid_Storage_Array_Parameter(X : in Storage_Array) return Boolean is ( if X'First <= 0 then ((Long_Long_Integer (X'Last) < Long_Long_Integer'Last + Long_Long_Integer (X'First)) and then X'Last < Storage_Offset'Last - Storage_Offset(rate/8)) else X'Last < Storage_Offset'Last - Storage_Offset(rate/8) ); function Valid_Storage_Array_Parameter(First : in Storage_Offset; Last : in Storage_Offset) return Boolean is ( if First <= 0 then ((Long_Long_Integer (Last) < Long_Long_Integer'Last + Long_Long_Integer (First)) and then Last < Storage_Offset'Last - Storage_Offset(rate/8)) else Last < Storage_Offset'Last - Storage_Offset(rate/8) ); subtype Word is Interfaces.Unsigned_64; type State is array (Integer range 0..4) of Word; -- Low-level API for Ascon. These routines can be accessed by instantiating -- the Ascon.Access_Internals child package function Make_State return State; function Initialise (Key : in Key_Type; Nonce : in Nonce_Type) return State; procedure Absorb (S : in out State; X : in Storage_Array) with Pre=> (Valid_Storage_Array_Parameter(X)); procedure Encrypt (S : in out State; M : in Storage_Array; C : out Storage_Array) with Relaxed_Initialization => C, Pre => ( (Valid_Storage_Array_Parameter(M) and Valid_Storage_Array_Parameter(C'First, C'Last)) and then C'Length = M'Length ), Post => C'Initialized; procedure Decrypt (S : in out State; C : in Storage_Array; M : out Storage_Array) with Relaxed_Initialization => M, Pre => ( (Valid_Storage_Array_Parameter(C) and Valid_Storage_Array_Parameter(M'First, M'Last)) and then C'Length = M'Length ), Post => M'Initialized; procedure Finalise (S : in out State; Key : in Key_Type; Tag : out Tag_Type) with Relaxed_Initialization => Tag, Post => Tag'Initialized; -- These compile-time checks test requirements that cannot be expressed -- in the generic formal parameters. Currently compile-time checks are -- not supported in GNATprove so the related warnings are suppressed. pragma Warnings (GNATprove, Off, "Compile_Time_Error"); pragma Compile_Time_Error (key_bits /= tag_bits, "The tag has to be the same length as the key"); pragma Compile_Time_Error (rate mod 64 /= 0, "The rate is not a multiple of 64 bits"); pragma Compile_Time_Error (System.Storage_Elements.Storage_Element'Size /= 8, "This implementation of Ascon cannot work " & "with Storage_Element'Size /= 8"); pragma Compile_Time_Error (b_rounds + b_round_constants_offset > 12, "Ascon requires b_rounds +" & " b_round_constants_offset to be <= 12"); pragma Warnings (GNATprove, On, "Compile_Time_Error"); end Ascon;
------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- XML Processor -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2010-2014, Vadim Godunko <vgodunko@gmail.com> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ pragma Ada_2012; private package XML.SAX.Simple_Readers.Parser is procedure YYParse (Self : in out Simple_Reader); -- Parse XML document. procedure Initialize (State : in out Parser_State_Information); -- Initialize parser's state before first use. end XML.SAX.Simple_Readers.Parser;
-- SPDX-License-Identifier: Apache-2.0 -- -- Copyright (c) 2016 onox <denkpadje@gmail.com> -- -- 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 AUnit.Test_Suites; with AUnit.Test_Fixtures; package Test_SIMD_AVX_Swizzle is function Suite return AUnit.Test_Suites.Access_Test_Suite; private type Test is new AUnit.Test_Fixtures.Test_Fixture with null record; procedure Test_Shuffle (Object : in out Test); procedure Test_Shuffle_Across_Lanes (Object : in out Test); procedure Test_Permute_Lanes (Object : in out Test); procedure Test_Blend (Object : in out Test); procedure Test_Transpose_Function (Object : in out Test); procedure Test_Transpose_Procedure (Object : in out Test); end Test_SIMD_AVX_Swizzle;
------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Localization, Internationalization, Globalization for Ada -- -- -- -- Testsuite Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2012-2015, Vadim Godunko <vgodunko@gmail.com> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ with League.Base_Codecs; with League.Stream_Element_Vectors; with League.Strings; procedure Base64_Test is type Test_Data is record Source : League.Stream_Element_Vectors.Stream_Element_Vector; Encoded : League.Strings.Universal_String; end record; procedure Do_Test (Data : Test_Data); Test_1 : constant Test_Data := (League.Stream_Element_Vectors.To_Stream_Element_Vector ((0 => Character'Pos ('H'))), League.Strings.To_Universal_String ("SA==")); Test_2 : constant Test_Data := (League.Stream_Element_Vectors.To_Stream_Element_Vector ((0 => Character'Pos ('H'), 1 => Character'Pos ('e'))), League.Strings.To_Universal_String ("SGU=")); Test_3 : constant Test_Data := (League.Stream_Element_Vectors.To_Stream_Element_Vector ((0 => Character'Pos ('H'), 1 => Character'Pos ('e'), 2 => Character'Pos ('l'))), League.Strings.To_Universal_String ("SGVs")); Test_4 : constant Test_Data := (League.Stream_Element_Vectors.To_Stream_Element_Vector ((0 => Character'Pos ('H'), 1 => Character'Pos ('e'), 2 => Character'Pos ('l'), 3 => Character'Pos ('l'))), League.Strings.To_Universal_String ("SGVsbA==")); Test_5 : constant Test_Data := (League.Stream_Element_Vectors.To_Stream_Element_Vector ((0 => Character'Pos ('H'), 1 => Character'Pos ('e'), 2 => Character'Pos ('l'), 3 => Character'Pos ('l'), 4 => Character'Pos ('o'))), League.Strings.To_Universal_String ("SGVsbG8=")); Test_6 : constant Test_Data := (League.Stream_Element_Vectors.To_Stream_Element_Vector ((0 => Character'Pos ('H'), 1 => Character'Pos ('e'), 2 => Character'Pos ('l'), 3 => Character'Pos ('l'), 4 => Character'Pos ('o'), 5 => Character'Pos (ASCII.NUL))), League.Strings.To_Universal_String ("SGVsbG8A")); Test_7 : constant Test_Data := (League.Stream_Element_Vectors.To_Stream_Element_Vector ((0 => 16#FF#, 1 => 16#FF#, 2 => 16#FF#, 3 => 16#FF#)), League.Strings.To_Universal_String ("/////w==")); ------------- -- Do_Test -- ------------- procedure Do_Test (Data : Test_Data) is use type League.Stream_Element_Vectors.Stream_Element_Vector; use type League.Strings.Universal_String; X : constant League.Strings.Universal_String := League.Base_Codecs.To_Base_64 (Data.Source); Y : constant League.Stream_Element_Vectors.Stream_Element_Vector := League.Base_Codecs.From_Base_64 (X); begin if Data.Encoded /= X then raise Program_Error; end if; if Data.Source /= Y then raise Program_Error; end if; end Do_Test; begin Do_Test (Test_1); Do_Test (Test_2); Do_Test (Test_3); Do_Test (Test_4); Do_Test (Test_5); Do_Test (Test_6); Do_Test (Test_7); end Base64_Test;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- G N A T . E X C E P T I O N _ T R A C E S -- -- -- -- B o d y -- -- -- -- $Revision$ -- -- -- Copyright (C) 2000-2001 Ada Core Technologies, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT is maintained by Ada Core Technologies Inc (http://www.gnat.com). -- -- -- ------------------------------------------------------------------------------ with System.Standard_Library; use System.Standard_Library; with System.Soft_Links; use System.Soft_Links; package body GNAT.Exception_Traces is -- Calling the decorator directly from where it is needed would require -- introducing nasty dependencies upon the spec of this package (typically -- in a-except.adb). We also have to deal with the fact that the traceback -- array within an exception occurrence and the one the decorator shall -- accept are of different types. These are two reasons for which a wrapper -- with a System.Address argument is indeed used to call the decorator -- provided by the user of this package. This wrapper is called via a -- soft-link, which either is null when no decorator is in place or "points -- to" the following function otherwise. function Decorator_Wrapper (Traceback : System.Address; Len : Natural) return String; -- The wrapper to be called when a decorator is in place for exception -- backtraces. -- -- Traceback is the address of the call chain array as stored in the -- exception occurrence and Len is the number of significant addresses -- contained in this array. Current_Decorator : Traceback_Decorator := null; -- The decorator to be called by the wrapper when it is not null, as set -- by Set_Trace_Decorator. When this access is null, the wrapper is null -- also and shall then not be called. ----------------------- -- Decorator_Wrapper -- ----------------------- function Decorator_Wrapper (Traceback : System.Address; Len : Natural) return String is Decorator_Traceback : Tracebacks_Array (1 .. Len); for Decorator_Traceback'Address use Traceback; -- Handle the "transition" from the array stored in the exception -- occurrence to the array expected by the decorator. pragma Import (Ada, Decorator_Traceback); begin return Current_Decorator.all (Decorator_Traceback); end Decorator_Wrapper; ------------------------- -- Set_Trace_Decorator -- ------------------------- procedure Set_Trace_Decorator (Decorator : Traceback_Decorator) is begin Current_Decorator := Decorator; if Current_Decorator /= null then Traceback_Decorator_Wrapper := Decorator_Wrapper'Access; else Traceback_Decorator_Wrapper := null; end if; end Set_Trace_Decorator; -- Trace_On/Trace_Off control the kind of automatic output to occur -- by way of the global Exception_Trace variable. --------------- -- Trace_Off -- --------------- procedure Trace_Off is begin Exception_Trace := RM_Convention; end Trace_Off; -------------- -- Trace_On -- -------------- procedure Trace_On (Kind : in Trace_Kind) is begin case Kind is when Every_Raise => Exception_Trace := Every_Raise; when Unhandled_Raise => Exception_Trace := Unhandled_Raise; end case; end Trace_On; end GNAT.Exception_Traces;
------------------------------------------------------------------------------ -- 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 Ada.Unchecked_Conversion; package body Gela.Hash.SHA.b256 is -- K Constants K : constant array (1 .. 64) of Interfaces.Unsigned_32 := (16#428a2f98#, 16#71374491#, 16#b5c0fbcf#, 16#e9b5dba5#, 16#3956c25b#, 16#59f111f1#, 16#923f82a4#, 16#ab1c5ed5#, 16#d807aa98#, 16#12835b01#, 16#243185be#, 16#550c7dc3#, 16#72be5d74#, 16#80deb1fe#, 16#9bdc06a7#, 16#c19bf174#, 16#e49b69c1#, 16#efbe4786#, 16#0fc19dc6#, 16#240ca1cc#, 16#2de92c6f#, 16#4a7484aa#, 16#5cb0a9dc#, 16#76f988da#, 16#983e5152#, 16#a831c66d#, 16#b00327c8#, 16#bf597fc7#, 16#c6e00bf3#, 16#d5a79147#, 16#06ca6351#, 16#14292967#, 16#27b70a85#, 16#2e1b2138#, 16#4d2c6dfc#, 16#53380d13#, 16#650a7354#, 16#766a0abb#, 16#81c2c92e#, 16#92722c85#, 16#a2bfe8a1#, 16#a81a664b#, 16#c24b8b70#, 16#c76c51a3#, 16#d192e819#, 16#d6990624#, 16#f40e3585#, 16#106aa070#, 16#19a4c116#, 16#1e376c08#, 16#2748774c#, 16#34b0bcb5#, 16#391c0cb3#, 16#4ed8aa4a#, 16#5b9cca4f#, 16#682e6ff3#, 16#748f82ee#, 16#78a5636f#, 16#84c87814#, 16#8cc70208#, 16#90befffa#, 16#a4506ceb#, 16#bef9a3f7#, 16#c67178f2#); Hex_Chars : constant array (Interfaces.Unsigned_32 range 0 .. 15) of Character := ('0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'a', 'b', 'c', 'd', 'e', 'f'); -- Stream_Element_Array4 -- subtype Stream_Element_Array4 is Ada.Streams.Stream_Element_Array (1 .. 4); -- Endian -- function Endian (Value : in Stream_Element_Array4) return Interfaces.Unsigned_32; -- Sigma0 -- function Sigma0 (Value : in Interfaces.Unsigned_32) return Interfaces.Unsigned_32; -- Sigma1 -- function Sigma1 (Value : in Interfaces.Unsigned_32) return Interfaces.Unsigned_32; -- E0 -- function E0 (Value : in Interfaces.Unsigned_32) return Interfaces.Unsigned_32; -- E1 -- function E1 (Value : in Interfaces.Unsigned_32) return Interfaces.Unsigned_32; -- Ch -- function Ch (X, Y, Z : in Interfaces.Unsigned_32) return Interfaces.Unsigned_32; -- Maj -- function Maj (X, Y, Z : in Interfaces.Unsigned_32) return Interfaces.Unsigned_32; --------------- -- Calculate -- --------------- function Calculate (Value : in String) return SHA256 is H : Hasher_256; Res : SHA256; begin Update (H, Value); Result (H, Res); return Res; end Calculate; -------------------- -- Wide_Calculate -- -------------------- function Wide_Calculate (Value : in Wide_String) return SHA256 is H : Hasher_256; Res : SHA256; begin Wide_Update (H, Value); Result (H, Res); return Res; end Wide_Calculate; ------------------------- -- Wide_Wide_Calculate -- ------------------------- function Wide_Wide_Calculate (Value : in Wide_Wide_String) return SHA256 is H : Hasher_256; Res : SHA256; begin Wide_Wide_Update (H, Value); Result (H, Res); return Res; end Wide_Wide_Calculate; --------------- -- Calculate -- --------------- function Calculate (Value : in Ada.Streams.Stream_Element_Array) return SHA256 is H : Hasher_256; Res : SHA256; begin Update (H, Value); Result (H, Res); return Res; end Calculate; ------------ -- Update -- ------------ procedure Update (This : in out Hasher_256; Value : in Ada.Streams.Stream_Element_Array) is use Ada.Streams; Buffer : constant Stream_Element_Array := This.Internal_Buffer (1 .. This.Last) & Value; Index : Stream_Element_Offset := Buffer'First; begin while Index + 63 <= Buffer'Last loop Process (This, Buffer (Index .. Index + 63)); Index := Index + 64; end loop; This.Last := Buffer'Last - Index + 1; This.Internal_Buffer (1 .. This.Last) := Buffer (Index .. Buffer'Last); This.Length := This.Length + Value'Length; end Update; ------------- -- Process -- ------------- procedure Process (This : in out Hasher_256; Value : in Ada.Streams.Stream_Element_Array) is use Interfaces; use Ada.Streams; Hash : Hash_Array (1 .. 8) := This.Internal_Hash; W : Hash_Array (1 .. 64); Temp1, Temp2 : Interfaces.Unsigned_32; Position : Stream_Element_Offset; begin for Index in 1 .. 16 loop Position := Stream_Element_Offset (((Index - 1) * 4) + 1); W (Index) := Endian (Value (Position .. Position + 3)); end loop; for Index in 17 .. 64 loop W (Index) := Sigma1 (W (Index - 2)) + W (Index - 7) + Sigma0 (W (Index - 15)) + W (Index - 16); end loop; for Index in 1 .. 64 loop Temp1 := Hash (8) + E1 (Hash (5)) + Ch (Hash (5), Hash (6), Hash (7)) + K (Index) + W (Index); Temp2 := E0 (Hash (1)) + Maj (Hash (1), Hash (2), Hash (3)); Hash (8) := Hash (7); Hash (7) := Hash (6); Hash (6) := Hash (5); Hash (5) := Hash (4) + Temp1; Hash (4) := Hash (3); Hash (3) := Hash (2); Hash (2) := Hash (1); Hash (1) := Temp1 + Temp2; end loop; for Index in 1 .. 8 loop This.Internal_Hash (Index) := This.Internal_Hash (Index) + Hash (Index); end loop; end Process; ------------ -- Result -- ------------ procedure Result (This : in out Hasher_256; Value : out SHA256) is use Ada.Streams; use Interfaces; Last : Stream_Element_Array (1 .. 64) := (others => 0); Length : Unsigned_64 := Unsigned_64 (This.Length) * 8; Result_Position : Positive := Value'First; -- To_Hex -- procedure To_Hex (Item : in Unsigned_32) is V : Unsigned_32 := Item; Position : Integer := Result_Position + 7; begin for Index in 1 .. 4 loop Value (Position) := Hex_Chars (V and 16#0F#); Position := Position - 1; V := Shift_Right (V, 4); Value (Position) := Hex_Chars (V and 16#0F#); Position := Position - 1; V := Shift_Right (V, 4); end loop; Result_Position := Result_Position + 8; end To_Hex; begin Last (1 .. This.Last) := This.Internal_Buffer (1 .. This.Last); Last (This.Last + 1) := 16#80#; if This.Last > 55 then Process (This, Last); Last := (others => 0); end if; for Index in 57 .. 64 loop Last (Stream_Element_Offset (Index)) := Stream_Element ((Shift_Right (Length, (64 - Index) * 8)) and 16#FF#); end loop; Process (This, Last); for Index in 1 .. 8 loop To_Hex (This.Internal_Hash (Index)); end loop; end Result; ------------ -- Endian -- ------------ function Endian (Value : in Stream_Element_Array4) return Interfaces.Unsigned_32 is function To_I32 is new Ada.Unchecked_Conversion (Stream_Element_Array4, Interfaces.Unsigned_32); Temp : Stream_Element_Array4 := (Value (4), Value (3), Value (2), Value (1)); begin return To_I32 (Temp); end Endian; ------------ -- Sigma0 -- ------------ function Sigma0 (Value : in Interfaces.Unsigned_32) return Interfaces.Unsigned_32 is use Interfaces; begin return Rotate_Right (Value, 7) xor Rotate_Right (Value, 18) xor Shift_Right (Value, 3); end Sigma0; ------------ -- Sigma1 -- ------------ function Sigma1 (Value : in Interfaces.Unsigned_32) return Interfaces.Unsigned_32 is use Interfaces; begin return Rotate_Right (Value, 17) xor Rotate_Right (Value, 19) xor Shift_Right (Value, 10); end Sigma1; -------- -- E0 -- -------- function E0 (Value : in Interfaces.Unsigned_32) return Interfaces.Unsigned_32 is use Interfaces; begin return Rotate_Right (Value, 2) xor Rotate_Right (Value, 13) xor Rotate_Right (Value, 22); end E0; -------- -- E1 -- -------- function E1 (Value : in Interfaces.Unsigned_32) return Interfaces.Unsigned_32 is use Interfaces; begin return Rotate_Right (Value, 6) xor Rotate_Right (Value, 11) xor Rotate_Right (Value, 25); end E1; -------- -- Ch -- -------- function Ch (X, Y, Z : in Interfaces.Unsigned_32) return Interfaces.Unsigned_32 is use Interfaces; begin return (X and Y) xor ((not X) and Z); end Ch; --------- -- Maj -- --------- function Maj (X, Y, Z : in Interfaces.Unsigned_32) return Interfaces.Unsigned_32 is use Interfaces; begin return (X and Y) xor (X and Z) xor (Y and Z); end Maj; end Gela.Hash.SHA.b256; ------------------------------------------------------------------------------ -- Copyright (c) 2006, Andry Ogorodnik -- 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. -- -- 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. ------------------------------------------------------------------------------ ------------------------------------------------------------------------------ -- Copyright (c) 2006-2013, Maxim Reznik -- All rights reserved. -- -- Redistribution and use in source and binary forms, with or without -- modification, are permitted provided that the following conditions are met: -- -- * Redistributions of source code must retain the above copyright notice, -- this list of conditions and the following disclaimer. -- * Redistributions in binary form must reproduce the above copyright -- notice, this list of conditions and the following disclaimer in the -- documentation and/or other materials provided with the distribution. -- * Neither the name of the Maxim Reznik, IE nor the names of its -- contributors may be used to endorse or promote products derived from -- this software without specific prior written permission. -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" -- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE -- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE -- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR -- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF -- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS -- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN -- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) -- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE -- POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------
with Text_IO; package body Control is procedure Put_Line (S: String) is begin Text_IO.Put_Line(S); end Put_Line; function Get_Line return String is S: String(1..5) := (others => ASCII.NUL); Char : Character; begin for I in 1 .. 3 loop Text_IO.Get(Char); Text_IO.Put(Char); S(I) := Char; end loop; --S := Text_IO.Get_Line; return S; end Get_Line; procedure Toggle_LedR is begin null; end; procedure Toggle_LedL is begin null; end; procedure Off_LedR is begin null; end; procedure Off_LedL is begin null; end; end Control;