CombinedText
stringlengths 4
3.42M
|
|---|
------------------------------------------------------------------------------
-- EMAIL: <darkestkhan@gmail.com> --
-- License: ISC License (see COPYING file) --
-- --
-- Copyright © 2015 darkestkhan --
------------------------------------------------------------------------------
-- Permission to use, copy, modify, and/or distribute this software for any --
-- purpose with or without fee is hereby granted, provided that the above --
-- copyright notice and this permission notice appear in all copies. --
-- --
-- The software is provided "as is" and the author disclaims all warranties --
-- with regard to this software including all implied warranties of --
-- merchantability and fitness. In no event shall the author be liable for --
-- any special, direct, indirect, or consequential damages or any damages --
-- whatsoever resulting from loss of use, data or profits, whether in an --
-- action of contract, negligence or other tortious action, arising out of --
-- or in connection with the use or performance of this software. --
------------------------------------------------------------------------------
private package XDG.Defaults is
-- Directory separator character.
Separator: constant Character := '\';
Home : constant String := "_local\share\";
Config: constant String := "_config\";
Cache : constant String := "_cache\";
Data_Dirs : constant String := "";
Config_Dirs : constant String := "";
end XDG.Defaults;
|
pragma License (Unrestricted);
-- runtime unit specialized for Linux
package System.Storage_Map is
pragma Preelaborate;
function Load_Address return Address;
Growing_Down_Is_Preferred : constant Boolean := True; -- bias of mmap
end System.Storage_Map;
|
------------------------------------------------------------------------------
-- --
-- File: --
-- formatted_output-enumeration_output.adb --
-- --
-- Description: --
-- Formatted_Output.Enumeration_Output generic package body --
-- --
-- Author: --
-- Eugene Nonko, cm@liceum.secna.ru --
-- --
-- Revision history: --
-- 27/01/99 - original --
-- 16/03/99 - added support for justification characters --
-- --
------------------------------------------------------------------------------
with Ada.Text_IO,
Ada.Characters.Handling,
Ada.Strings,
Ada.Strings.Fixed,
Ada.Strings.Unbounded;
use Ada.Text_IO,
Ada.Characters.Handling,
Ada.Strings,
Ada.Strings.Fixed,
Ada.Strings.Unbounded;
package body Formatted_Output.Enumeration_Output is
package Item_Type_IO is new Enumeration_IO (Item_Type);
use Item_Type_IO;
type Style_Type is (Capitalized, Upper_Case, Lower_Case);
function Format
(Value : Item_Type; Initial_Width : Integer; Justification : Alignment;
Style : Style_Type) return String is
Img : String (1 .. Maximal_Item_Length);
Width, Real_Width : Integer;
Past_Last : Integer := 1;
begin -- Format
case Style is
when Capitalized =>
Put (Img, Value, Set => Type_Set'(Lower_Case));
Img (1) := To_Upper (Img (1));
when Lower_Case =>
Put (Img, Value, Set => Type_Set'(Lower_Case));
when Upper_Case =>
Put (Img, Value, Set => Type_Set'(Upper_Case));
end case;
while Img (Past_Last) /= ' ' loop
Past_Last := Past_Last + 1;
end loop;
Real_Width := Past_Last - 1;
if Initial_Width < Real_Width then
Width := Real_Width;
else
Width := Initial_Width;
end if;
declare
S : String (1 .. Width);
begin
Move (Img (Past_Last - Real_Width .. Past_Last - 1), S,
Justify => Justification, Pad => Filler);
return S;
end;
end Format;
function "&" (Fmt : Format_Type; Value : Item_Type) return Format_Type is
Command_Start : constant Integer := Scan_To_Percent_Sign (Fmt);
Width : Integer := 0;
Digit_Occured, Justification_Changed : Boolean := False;
Justification : Alignment := Right;
Fmt_Copy : Unbounded_String;
begin -- "&"
if Command_Start /= 0 then
Fmt_Copy := Unbounded_String (Fmt);
for I in Command_Start + 1 .. Length (Fmt_Copy) loop
case Element (Fmt_Copy, I) is
when 'c' =>
Replace_Slice (Fmt_Copy, Command_Start, I,
Format (Value, Width, Justification, Capitalized));
return Format_Type (Fmt_Copy);
when 'u' =>
Replace_Slice (Fmt_Copy, Command_Start, I,
Format (Value, Width, Justification, Upper_Case));
return Format_Type (Fmt_Copy);
when 'l' =>
Replace_Slice (Fmt_Copy, Command_Start, I,
Format (Value, Width, Justification, Lower_Case));
return Format_Type (Fmt_Copy);
when '-' | '+' | '*' =>
if Justification_Changed or else Digit_Occured then
raise Format_Error;
end if;
Justification_Changed := True;
case Element (Fmt_Copy, I) is
when '-' =>
Justification := Left;
when '+' =>
Justification := Right;
when '*' =>
Justification := Center;
when others =>
null;
end case;
when '0' .. '9' =>
Width := Width * 10
+ Character'Pos (Element (Fmt_Copy, I))
- Character'Pos ('0');
when others =>
raise Format_Error;
end case;
end loop;
end if;
raise Format_Error;
end "&";
end Formatted_Output.Enumeration_Output;
|
-----------------------------------------------------------------------
-- ado-sequences-tests -- Test sequences factories
-- Copyright (C) 2012 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 Util.Tests;
package ADO.Sequences.Tests is
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite);
type Test is new Util.Tests.Test with null record;
procedure Test_Create_Factory (T : in out Test);
end ADO.Sequences.Tests;
|
-- part of AdaYaml, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "copying.txt"
with AUnit.Test_Suites;
package Text.Suite is
function Suite return AUnit.Test_Suites.Access_Test_Suite;
end Text.Suite;
|
------------------------------------------------------------------------------
-- Copyright (c) 2015-2017, Natacha Porté --
-- --
-- Permission to use, copy, modify, and distribute this software for any --
-- purpose with or without fee is hereby granted, provided that the above --
-- copyright notice and this permission notice appear in all copies. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES --
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF --
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR --
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES --
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN --
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF --
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. --
------------------------------------------------------------------------------
package body Lithium.Line_Parsers is
procedure Append_Line
(Line : in out Natools.S_Expressions.Atom_Buffers.Atom_Buffer;
Source : in out Ada.Streams.Root_Stream_Type'Class;
Finished : out Boolean)
is
Buffer : Ada.Streams.Stream_Element_Array (1 .. 1);
Last : Ada.Streams.Stream_Element_Offset;
begin
Finished := False;
loop
Source.Read (Buffer, Last);
if Last not in Buffer'Range then
Finished := True;
exit;
end if;
Line.Append (Buffer (Last));
exit when Buffer (Last) in 10 | 13;
end loop;
end Append_Line;
overriding procedure Read_More
(Self : in out Parser;
Buffer : out Natools.S_Expressions.Atom_Buffers.Atom_Buffer)
is
Finished : Boolean;
begin
Append_Line (Buffer, Self.Source.all, Finished);
end Read_More;
end Lithium.Line_Parsers;
|
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="14">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName/>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>Loop_1_proc</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>p_hw_input_stencil_stream_V_value_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>_hw_input_stencil_stream_to_hw_output.V.value.V</originalName>
<rtlName/>
<coreName>FIFO_SRL</coreName>
</Obj>
<bitwidth>72</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>hw_output_V_value_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>stream&lt;AxiPackedStencil&lt;unsigned char, 1, 1, 1, 1&gt; &gt;.V.value.V</originalName>
<rtlName/>
<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="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>hw_output_V_last_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>stream&lt;AxiPackedStencil&lt;unsigned char, 1, 1, 1, 1&gt; &gt;.V.last.V</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>1</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>59</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>6</id>
<name/>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>67</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second class_id="11" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="12" tracking_level="0" version="0">
<first class_id="13" tracking_level="0" version="0">
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>67</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>indvar_flatten</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>219</item>
<item>220</item>
<item>221</item>
<item>222</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>p_hw_output_y_scan_1</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>223</item>
<item>224</item>
<item>225</item>
<item>226</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>p_hw_output_x_scan_2</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>_hw_output_x___scan_dim_0</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>227</item>
<item>228</item>
<item>229</item>
<item>230</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>exitcond_flatten</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>exitcond_flatten_fu_151_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>231</item>
<item>233</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>indvar_flatten_next</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>indvar_flatten_next_fu_157_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>234</item>
<item>236</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>237</item>
<item>238</item>
<item>239</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>exitcond8</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>exitcond8_fu_163_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>74</item>
<item>76</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>p_hw_output_x_scan_s</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_hw_output_x_scan_s_fu_169_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>77</item>
<item>79</item>
<item>80</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>tmp_mid1</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>150</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>150</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_mid1_fu_177_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>81</item>
<item>82</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>tmp5</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>150</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>150</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp5_fu_183_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>83</item>
<item>85</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>tmp_mid2</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>150</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>150</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_mid2_fu_209_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>86</item>
<item>87</item>
<item>88</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>p_hw_output_y_scan_2</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>67</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>67</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_hw_output_y_scan_2_fu_189_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>89</item>
<item>90</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>p_hw_output_y_scan_s</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_hw_output_y_scan_s_fu_195_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>91</item>
<item>92</item>
<item>93</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>tmp_value_V</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.value.V</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>72</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>95</item>
<item>96</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>p_309</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</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/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_309</originalName>
<rtlName>p_309_fu_214_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>97</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>p_312_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>86</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>86</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_312_cast_fu_218_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>98</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>p_321</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</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/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_321</originalName>
<rtlName>p_321_fu_222_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>100</item>
<item>101</item>
<item>103</item>
<item>105</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>p_324_cast_cast</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</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/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_324_cast_cast_fu_232_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>p_345</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</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/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_345</originalName>
<rtlName>p_345_fu_236_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>107</item>
<item>108</item>
<item>110</item>
<item>112</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>p_348_cast_cast</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</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/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_348_cast_cast_fu_246_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>113</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>p_357</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</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/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_357</originalName>
<rtlName>p_357_reg_498</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>114</item>
<item>115</item>
<item>117</item>
<item>119</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>p_360_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>142</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>142</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_360_cast_fu_436_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>120</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>tmp_2</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_2_fu_260_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>122</item>
<item>123</item>
<item>125</item>
<item>127</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>p_317</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_317</originalName>
<rtlName>p_317_fu_270_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>129</item>
<item>130</item>
<item>132</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>p_318_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>93</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>93</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_318_cast_fu_278_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>133</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>p_319</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_319</originalName>
<rtlName>p_319_fu_282_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>134</item>
<item>135</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>p_319_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_319_cast_fu_375_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>136</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>tmp_3</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_3_fu_288_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>137</item>
<item>138</item>
<item>140</item>
<item>142</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>p_329</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>106</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>106</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_329</originalName>
<rtlName>p_329_fu_298_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>143</item>
<item>144</item>
<item>145</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>p_330_cast_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>108</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>108</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_330_cast_cast_fu_306_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>146</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>tmp1</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>108</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>108</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp1_fu_310_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>147</item>
<item>148</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>tmp1_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>108</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>108</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp1_cast_fu_378_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>149</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>p_331</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>108</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>108</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_331</originalName>
<rtlName>p_331_fu_381_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>150</item>
<item>151</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>p_331_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>108</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>108</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_331_cast_fu_407_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>152</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>tmp_4</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_4_reg_513</rtlName>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>154</item>
<item>155</item>
<item>157</item>
<item>159</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>p_335</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_335</originalName>
<rtlName>p_335_fu_410_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>161</item>
<item>162</item>
<item>163</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>p_336_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>114</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>114</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_336_cast_fu_417_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>164</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name>tmp_5</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_5_reg_518</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>165</item>
<item>166</item>
<item>168</item>
<item>170</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>p_341</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>120</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_341</originalName>
<rtlName>p_341_fu_387_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>171</item>
<item>172</item>
<item>173</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name>p_342_cast_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>120</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_342_cast_cast_fu_394_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>174</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>tmp_6</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_6_fu_336_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>175</item>
<item>176</item>
<item>178</item>
<item>180</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>p_353</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>134</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>134</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_353</originalName>
<rtlName>p_353_fu_346_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>181</item>
<item>182</item>
<item>183</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name>p_354_cast_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>136</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_354_cast_cast_fu_354_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>184</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>tmp2</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>136</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp2_fu_421_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>185</item>
<item>186</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>tmp4</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>136</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp4_fu_358_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>187</item>
<item>188</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>tmp4_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>136</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp4_cast_fu_398_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>189</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name>tmp3</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>136</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp3_fu_401_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>190</item>
<item>191</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name>tmp3_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>136</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp3_cast_fu_427_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>192</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name>p_355</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>136</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_355</originalName>
<rtlName>p_355_fu_430_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>193</item>
<item>194</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>61</id>
<name>p_355_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>136</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_355_cast_fu_439_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>195</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>62</id>
<name>p_361</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>143</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_361</originalName>
<rtlName>p_361_fu_442_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>196</item>
<item>197</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name>p_364</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>147</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>147</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_364</originalName>
<rtlName>hw_output_V_value_V</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>199</item>
<item>200</item>
<item>202</item>
<item>204</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>tmp_s</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>150</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>150</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_s_fu_364_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>205</item>
<item>206</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>65</id>
<name>tmp_last_V</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>150</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>150</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.last.V</originalName>
<rtlName>tmp_last_V_fu_369_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>207</item>
<item>208</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>66</id>
<name/>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>155</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>155</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>210</item>
<item>211</item>
<item>212</item>
<item>213</item>
<item>214</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>68</id>
<name>p_hw_output_x_scan_1</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_hw_output_x___scan_dim_0</originalName>
<rtlName>p_hw_output_x_scan_1_fu_203_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>215</item>
<item>216</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name/>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>hls_target</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/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>217</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>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>25</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_63">
<Value>
<Obj>
<type>2</type>
<id>75</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>2</content>
</item>
<item class_id_reference="16" object_id="_64">
<Value>
<Obj>
<type>2</type>
<id>78</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_65">
<Value>
<Obj>
<type>2</type>
<id>84</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_66">
<Value>
<Obj>
<type>2</type>
<id>102</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>16</content>
</item>
<item class_id_reference="16" object_id="_67">
<Value>
<Obj>
<type>2</type>
<id>104</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>23</content>
</item>
<item class_id_reference="16" object_id="_68">
<Value>
<Obj>
<type>2</type>
<id>109</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>48</content>
</item>
<item class_id_reference="16" object_id="_69">
<Value>
<Obj>
<type>2</type>
<id>111</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>55</content>
</item>
<item class_id_reference="16" object_id="_70">
<Value>
<Obj>
<type>2</type>
<id>116</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>64</content>
</item>
<item class_id_reference="16" object_id="_71">
<Value>
<Obj>
<type>2</type>
<id>118</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>71</content>
</item>
<item class_id_reference="16" object_id="_72">
<Value>
<Obj>
<type>2</type>
<id>124</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_73">
<Value>
<Obj>
<type>2</type>
<id>126</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>14</content>
</item>
<item class_id_reference="16" object_id="_74">
<Value>
<Obj>
<type>2</type>
<id>131</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_75">
<Value>
<Obj>
<type>2</type>
<id>139</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>24</content>
</item>
<item class_id_reference="16" object_id="_76">
<Value>
<Obj>
<type>2</type>
<id>141</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>30</content>
</item>
<item class_id_reference="16" object_id="_77">
<Value>
<Obj>
<type>2</type>
<id>156</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>32</content>
</item>
<item class_id_reference="16" object_id="_78">
<Value>
<Obj>
<type>2</type>
<id>158</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>37</content>
</item>
<item class_id_reference="16" object_id="_79">
<Value>
<Obj>
<type>2</type>
<id>167</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>40</content>
</item>
<item class_id_reference="16" object_id="_80">
<Value>
<Obj>
<type>2</type>
<id>169</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>46</content>
</item>
<item class_id_reference="16" object_id="_81">
<Value>
<Obj>
<type>2</type>
<id>177</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>56</content>
</item>
<item class_id_reference="16" object_id="_82">
<Value>
<Obj>
<type>2</type>
<id>179</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>62</content>
</item>
<item class_id_reference="16" object_id="_83">
<Value>
<Obj>
<type>2</type>
<id>201</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>4</content>
</item>
<item class_id_reference="16" object_id="_84">
<Value>
<Obj>
<type>2</type>
<id>203</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>11</content>
</item>
<item class_id_reference="16" object_id="_85">
<Value>
<Obj>
<type>2</type>
<id>218</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_86">
<Value>
<Obj>
<type>2</type>
<id>232</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>4</content>
</item>
<item class_id_reference="16" object_id="_87">
<Value>
<Obj>
<type>2</type>
<id>235</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_88">
<Obj>
<type>3</type>
<id>7</id>
<name>newFuncRoot</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>6</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_89">
<Obj>
<type>3</type>
<id>14</id>
<name>.preheader</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>8</item>
<item>9</item>
<item>10</item>
<item>11</item>
<item>12</item>
<item>13</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_90">
<Obj>
<type>3</type>
<id>70</id>
<name>.preheader.preheader</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>51</count>
<item_version>0</item_version>
<item>16</item>
<item>17</item>
<item>18</item>
<item>19</item>
<item>20</item>
<item>21</item>
<item>22</item>
<item>25</item>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
<item>40</item>
<item>41</item>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
<item>46</item>
<item>47</item>
<item>48</item>
<item>49</item>
<item>50</item>
<item>51</item>
<item>52</item>
<item>53</item>
<item>54</item>
<item>55</item>
<item>56</item>
<item>57</item>
<item>58</item>
<item>59</item>
<item>60</item>
<item>61</item>
<item>62</item>
<item>63</item>
<item>64</item>
<item>65</item>
<item>66</item>
<item>68</item>
<item>69</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_91">
<Obj>
<type>3</type>
<id>72</id>
<name>.exitStub</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>122</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_92">
<id>73</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>6</sink_obj>
</item>
<item class_id_reference="20" object_id="_93">
<id>74</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_94">
<id>76</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_95">
<id>77</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_96">
<id>79</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_97">
<id>80</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_98">
<id>81</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_99">
<id>82</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_100">
<id>83</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_101">
<id>85</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_102">
<id>86</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_103">
<id>87</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_104">
<id>88</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_105">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_106">
<id>90</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_107">
<id>91</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_108">
<id>92</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_109">
<id>93</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_110">
<id>96</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_111">
<id>97</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_112">
<id>98</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_113">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_114">
<id>103</id>
<edge_type>1</edge_type>
<source_obj>102</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_115">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_116">
<id>106</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_117">
<id>108</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_118">
<id>110</id>
<edge_type>1</edge_type>
<source_obj>109</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_119">
<id>112</id>
<edge_type>1</edge_type>
<source_obj>111</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_120">
<id>113</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_121">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_122">
<id>117</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_123">
<id>119</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_124">
<id>120</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_125">
<id>123</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_126">
<id>125</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_127">
<id>127</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_128">
<id>130</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_129">
<id>132</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_130">
<id>133</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_131">
<id>134</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_132">
<id>135</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_133">
<id>136</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_134">
<id>138</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_135">
<id>140</id>
<edge_type>1</edge_type>
<source_obj>139</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_136">
<id>142</id>
<edge_type>1</edge_type>
<source_obj>141</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_137">
<id>144</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_138">
<id>145</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_139">
<id>146</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_140">
<id>147</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_141">
<id>148</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_142">
<id>149</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_143">
<id>150</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_144">
<id>151</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_145">
<id>152</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_146">
<id>155</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_147">
<id>157</id>
<edge_type>1</edge_type>
<source_obj>156</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_148">
<id>159</id>
<edge_type>1</edge_type>
<source_obj>158</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_149">
<id>162</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_150">
<id>163</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_151">
<id>164</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_152">
<id>166</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_153">
<id>168</id>
<edge_type>1</edge_type>
<source_obj>167</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_154">
<id>170</id>
<edge_type>1</edge_type>
<source_obj>169</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_155">
<id>172</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_156">
<id>173</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_157">
<id>174</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_158">
<id>176</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_159">
<id>178</id>
<edge_type>1</edge_type>
<source_obj>177</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_160">
<id>180</id>
<edge_type>1</edge_type>
<source_obj>179</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_161">
<id>182</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_162">
<id>183</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_163">
<id>184</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_164">
<id>185</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_165">
<id>186</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_166">
<id>187</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_167">
<id>188</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_168">
<id>189</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>57</sink_obj>
</item>
<item class_id_reference="20" object_id="_169">
<id>190</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_170">
<id>191</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_171">
<id>192</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>59</sink_obj>
</item>
<item class_id_reference="20" object_id="_172">
<id>193</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_173">
<id>194</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_174">
<id>195</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>61</sink_obj>
</item>
<item class_id_reference="20" object_id="_175">
<id>196</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>62</sink_obj>
</item>
<item class_id_reference="20" object_id="_176">
<id>197</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>62</sink_obj>
</item>
<item class_id_reference="20" object_id="_177">
<id>200</id>
<edge_type>1</edge_type>
<source_obj>62</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_178">
<id>202</id>
<edge_type>1</edge_type>
<source_obj>201</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_179">
<id>204</id>
<edge_type>1</edge_type>
<source_obj>203</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_180">
<id>205</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_181">
<id>206</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_182">
<id>207</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_183">
<id>208</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_184">
<id>211</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_185">
<id>212</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_186">
<id>213</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_187">
<id>214</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_188">
<id>215</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_189">
<id>216</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_190">
<id>217</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>69</sink_obj>
</item>
<item class_id_reference="20" object_id="_191">
<id>219</id>
<edge_type>1</edge_type>
<source_obj>218</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_192">
<id>220</id>
<edge_type>2</edge_type>
<source_obj>7</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_193">
<id>221</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_194">
<id>222</id>
<edge_type>2</edge_type>
<source_obj>70</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_195">
<id>223</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_196">
<id>224</id>
<edge_type>2</edge_type>
<source_obj>7</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_197">
<id>225</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_198">
<id>226</id>
<edge_type>2</edge_type>
<source_obj>70</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_199">
<id>227</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_200">
<id>228</id>
<edge_type>2</edge_type>
<source_obj>7</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_201">
<id>229</id>
<edge_type>1</edge_type>
<source_obj>68</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_202">
<id>230</id>
<edge_type>2</edge_type>
<source_obj>70</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_203">
<id>231</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_204">
<id>233</id>
<edge_type>1</edge_type>
<source_obj>232</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_205">
<id>234</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_206">
<id>236</id>
<edge_type>1</edge_type>
<source_obj>235</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_207">
<id>237</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_208">
<id>238</id>
<edge_type>2</edge_type>
<source_obj>70</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_209">
<id>239</id>
<edge_type>2</edge_type>
<source_obj>72</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_210">
<id>298</id>
<edge_type>2</edge_type>
<source_obj>7</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_211">
<id>299</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>72</sink_obj>
</item>
<item class_id_reference="20" object_id="_212">
<id>300</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>70</sink_obj>
</item>
<item class_id_reference="20" object_id="_213">
<id>301</id>
<edge_type>2</edge_type>
<source_obj>70</source_obj>
<sink_obj>14</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_214">
<mId>1</mId>
<mTag>Loop_1_proc</mTag>
<mType>0</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>9</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_215">
<mId>2</mId>
<mTag>Entry</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_216">
<mId>3</mId>
<mTag>Loop 1</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>14</item>
<item>70</item>
</basic_blocks>
<mII>1</mII>
<mDepth>5</mDepth>
<mMinTripCount>4</mMinTripCount>
<mMaxTripCount>4</mMaxTripCount>
<mMinLatency>7</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_217">
<mId>4</mId>
<mTag>Return</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_218">
<states class_id="25" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_219">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_220">
<id>4</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_221">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_222">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_223">
<id>2</id>
<operations>
<count>13</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_224">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_225">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_226">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_227">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_228">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_229">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_230">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_231">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_232">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_233">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_234">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_235">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_236">
<id>68</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_237">
<id>3</id>
<operations>
<count>25</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_238">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_239">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_240">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_241">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_242">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_243">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_244">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_245">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_246">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_247">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_248">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_249">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_250">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_251">
<id>39</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_252">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_253">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_254">
<id>42</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_255">
<id>46</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_256">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_257">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_258">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_259">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_260">
<id>56</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_261">
<id>64</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_262">
<id>65</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_263">
<id>4</id>
<operations>
<count>7</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_264">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_265">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_266">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_267">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_268">
<id>51</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_269">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_270">
<id>58</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_271">
<id>5</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_272">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_273">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_274">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_275">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_276">
<id>59</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_277">
<id>60</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_278">
<id>6</id>
<operations>
<count>10</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_279">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_280">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_281">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_282">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_283">
<id>61</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_284">
<id>62</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_285">
<id>63</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_286">
<id>66</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_287">
<id>67</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_288">
<id>69</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_289">
<id>7</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_290">
<id>71</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_291">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>22</id>
<sop class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_292">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>33</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_293">
<inState>4</inState>
<outState>5</outState>
<condition>
<id>34</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_294">
<inState>5</inState>
<outState>6</outState>
<condition>
<id>35</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_295">
<inState>6</inState>
<outState>2</outState>
<condition>
<id>36</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_296">
<inState>2</inState>
<outState>7</outState>
<condition>
<id>32</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item class_id="34" tracking_level="0" version="0">
<first class_id="35" tracking_level="0" version="0">
<first>11</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_297">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>37</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>11</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="36" tracking_level="1" version="0" object_id="_298">
<dp_component_resource class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_resource>
<dp_expression_resource>
<count>27</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>ap_block_pp0_stage0_flag00001001 ( and ) </first>
<second class_id="39" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="0" version="0">
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_block_pp0_stage0_flag00011001 ( or ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_block_state1 ( or ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_block_state3_pp0_stage0_iter1 ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_block_state6_io ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_enable_pp0 ( xor ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>2</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter1 ( xor ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>2</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>exitcond8_fu_163_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>2</second>
</item>
<item>
<first>(1P1)</first>
<second>3</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>exitcond_flatten_fu_151_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>3</second>
</item>
<item>
<first>(1P1)</first>
<second>4</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_157_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>3</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>14</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>p_319_fu_282_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>9</second>
</item>
<item>
<first>(1P1)</first>
<second>9</second>
</item>
<item>
<first>FF</first>
<second>32</second>
</item>
<item>
<first>LUT</first>
<second>14</second>
</item>
</second>
</item>
<item>
<first>p_331_fu_381_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>10</second>
</item>
<item>
<first>(1P1)</first>
<second>10</second>
</item>
<item>
<first>FF</first>
<second>35</second>
</item>
<item>
<first>LUT</first>
<second>15</second>
</item>
</second>
</item>
<item>
<first>p_355_fu_430_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>11</second>
</item>
<item>
<first>(1P1)</first>
<second>11</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>p_361_fu_442_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>12</second>
</item>
<item>
<first>(1P1)</first>
<second>12</second>
</item>
<item>
<first>FF</first>
<second>41</second>
</item>
<item>
<first>LUT</first>
<second>17</second>
</item>
</second>
</item>
<item>
<first>p_hw_output_x_scan_1_fu_203_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>2</second>
</item>
<item>
<first>FF</first>
<second>11</second>
</item>
<item>
<first>LUT</first>
<second>8</second>
</item>
</second>
</item>
<item>
<first>p_hw_output_x_scan_s_fu_169_p3 ( select ) </first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>(2P2)</first>
<second>2</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>p_hw_output_y_scan_2_fu_189_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>2</second>
</item>
<item>
<first>FF</first>
<second>11</second>
</item>
<item>
<first>LUT</first>
<second>8</second>
</item>
</second>
</item>
<item>
<first>p_hw_output_y_scan_s_fu_195_p3 ( select ) </first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>2</second>
</item>
<item>
<first>(2P2)</first>
<second>2</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>tmp1_fu_310_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>9</second>
</item>
<item>
<first>(1P1)</first>
<second>9</second>
</item>
<item>
<first>FF</first>
<second>32</second>
</item>
<item>
<first>LUT</first>
<second>14</second>
</item>
</second>
</item>
<item>
<first>tmp2_fu_421_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>11</second>
</item>
<item>
<first>(1P1)</first>
<second>11</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>tmp3_fu_401_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>10</second>
</item>
<item>
<first>(1P1)</first>
<second>10</second>
</item>
<item>
<first>FF</first>
<second>35</second>
</item>
<item>
<first>LUT</first>
<second>15</second>
</item>
</second>
</item>
<item>
<first>tmp4_fu_358_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>9</second>
</item>
<item>
<first>(1P1)</first>
<second>9</second>
</item>
<item>
<first>FF</first>
<second>32</second>
</item>
<item>
<first>LUT</first>
<second>14</second>
</item>
</second>
</item>
<item>
<first>tmp5_fu_183_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>2</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>tmp_last_V_fu_369_p2 ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>tmp_mid1_fu_177_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>2</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>tmp_mid2_fu_209_p3 ( select ) </first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>(2P2)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>tmp_s_fu_364_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>2</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
</dp_expression_resource>
<dp_fifo_resource>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_resource>
<dp_memory_resource>
<count>0</count>
<item_version>0</item_version>
</dp_memory_resource>
<dp_multiplexer_resource>
<count>11</count>
<item_version>0</item_version>
<item>
<first>ap_NS_fsm</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>4</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>4</second>
</item>
<item>
<first>LUT</first>
<second>21</second>
</item>
</second>
</item>
<item>
<first>ap_done</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter1</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter4</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>ap_sig_ioackin_hw_output_V_value_V_ap_ack</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>hw_output_V_last_V_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>hw_output_V_value_V_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_118</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>3</second>
</item>
<item>
<first>(2Count)</first>
<second>6</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>p_hw_input_stencil_stream_V_value_V_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>p_hw_output_x_scan_2_reg_140</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>2</second>
</item>
<item>
<first>(2Count)</first>
<second>4</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>p_hw_output_y_scan_1_reg_129</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>2</second>
</item>
<item>
<first>(2Count)</first>
<second>4</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
</dp_multiplexer_resource>
<dp_register_resource>
<count>28</count>
<item_version>0</item_version>
<item>
<first>ap_CS_fsm</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>3</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>3</second>
</item>
</second>
</item>
<item>
<first>ap_done_reg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter0</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter1</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter2</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter3</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter4</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_reg_ioackin_hw_output_V_last_V_ap_ack</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_reg_ioackin_hw_output_V_value_V_ap_ack</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_reg_pp0_iter2_tmp_4_reg_513</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>6</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>6</second>
</item>
</second>
</item>
<item>
<first>exitcond8_reg_468</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>exitcond_flatten_reg_459</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_118</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>3</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>3</second>
</item>
</second>
</item>
<item>
<first>p_319_reg_503</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>9</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>p_331_reg_533</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>10</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>10</second>
</item>
</second>
</item>
<item>
<first>p_355_reg_543</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>11</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>p_357_reg_498</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>8</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>8</second>
</item>
</second>
</item>
<item>
<first>p_hw_output_x_scan_2_reg_140</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>2</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>p_hw_output_x_scan_s_reg_473</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>2</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>p_hw_output_y_scan_1_reg_129</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>2</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>tmp1_reg_508</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>9</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>tmp3_reg_538</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>10</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>10</second>
</item>
</second>
</item>
<item>
<first>tmp4_reg_523</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>9</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>tmp5_reg_483</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>tmp_4_reg_513</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>6</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>6</second>
</item>
</second>
</item>
<item>
<first>tmp_5_reg_518</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>7</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>7</second>
</item>
</second>
</item>
<item>
<first>tmp_last_V_reg_528</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>tmp_mid1_reg_478</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
</dp_register_resource>
<dp_component_map class_id="41" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_map>
<dp_expression_map>
<count>20</count>
<item_version>0</item_version>
<item class_id="42" tracking_level="0" version="0">
<first>exitcond8_fu_163_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>exitcond_flatten_fu_151_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_157_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>p_319_fu_282_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>p_331_fu_381_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>p_355_fu_430_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>p_361_fu_442_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>p_hw_output_x_scan_1_fu_203_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>p_hw_output_x_scan_s_fu_169_p3 ( select ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>p_hw_output_y_scan_2_fu_189_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>p_hw_output_y_scan_s_fu_195_p3 ( select ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>tmp1_fu_310_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>tmp2_fu_421_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>tmp3_fu_401_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>tmp4_fu_358_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>tmp5_fu_183_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>tmp_last_V_fu_369_p2 ( and ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>tmp_mid1_fu_177_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>tmp_mid2_fu_209_p3 ( select ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>tmp_s_fu_364_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
</dp_expression_map>
<dp_fifo_map>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_map>
<dp_memory_map>
<count>0</count>
<item_version>0</item_version>
</dp_memory_map>
</res>
<node_label_latency class_id="43" tracking_level="0" version="0">
<count>59</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="0" version="0">
<first>6</first>
<second class_id="45" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>8</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="46" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="47" tracking_level="0" version="0">
<first>7</first>
<second class_id="48" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>1</first>
<second>5</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="49" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="50" tracking_level="1" version="0" object_id="_299">
<region_name>Loop 1</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>14</item>
<item>70</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>5</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="51" tracking_level="0" version="0">
<count>55</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="0" version="0">
<first>102</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>108</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>122</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>133</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>144</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>151</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>157</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>163</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>169</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>177</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>183</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>189</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>195</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>203</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>209</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>214</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>218</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>222</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>232</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>236</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>246</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>250</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>260</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>270</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>278</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>282</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>298</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>306</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>310</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>316</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>326</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>336</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>346</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>354</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>358</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>364</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>369</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>375</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>378</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>381</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>387</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>394</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>398</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>401</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>407</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>410</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>417</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>421</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>427</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>430</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>436</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>439</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>442</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>448</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="54" tracking_level="0" version="0">
<count>53</count>
<item_version>0</item_version>
<item class_id="55" tracking_level="0" version="0">
<first>exitcond8_fu_163</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>exitcond_flatten_fu_151</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_157</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>indvar_flatten_phi_fu_122</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>p_309_fu_214</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>p_312_cast_fu_218</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>p_317_fu_270</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>p_318_cast_fu_278</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>p_319_cast_fu_375</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>p_319_fu_282</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>p_321_fu_222</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>p_324_cast_cast_fu_232</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>p_329_fu_298</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>p_330_cast_cast_fu_306</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>p_331_cast_fu_407</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>p_331_fu_381</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>p_335_fu_410</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>p_336_cast_fu_417</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>p_341_fu_387</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>p_342_cast_cast_fu_394</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>p_345_fu_236</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>p_348_cast_cast_fu_246</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>p_353_fu_346</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>p_354_cast_cast_fu_354</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>p_355_cast_fu_439</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>p_355_fu_430</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>p_357_fu_250</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>p_360_cast_fu_436</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>p_361_fu_442</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>p_364_fu_448</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>p_hw_output_x_scan_1_fu_203</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>p_hw_output_x_scan_2_phi_fu_144</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>p_hw_output_x_scan_s_fu_169</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>p_hw_output_y_scan_1_phi_fu_133</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>p_hw_output_y_scan_2_fu_189</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>p_hw_output_y_scan_s_fu_195</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>tmp1_cast_fu_378</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>tmp1_fu_310</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>tmp2_fu_421</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>tmp3_cast_fu_427</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>tmp3_fu_401</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>tmp4_cast_fu_398</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>tmp4_fu_358</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>tmp5_fu_183</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>tmp_2_fu_260</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>tmp_3_fu_288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>tmp_4_fu_316</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>tmp_5_fu_326</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>tmp_6_fu_336</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>tmp_last_V_fu_369</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>tmp_mid1_fu_177</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>tmp_mid2_fu_209</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>tmp_s_fu_364</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>2</count>
<item_version>0</item_version>
<item>
<first>StgValue_69_write_fu_108</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>tmp_value_V_read_fu_102</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="56" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>21</count>
<item_version>0</item_version>
<item>
<first>118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>129</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>140</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>459</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>463</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>468</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>473</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>478</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>483</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>488</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>493</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>498</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>503</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>508</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>513</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>518</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>523</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>528</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>533</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>538</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>543</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>21</count>
<item_version>0</item_version>
<item>
<first>exitcond8_reg_468</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>exitcond_flatten_reg_459</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>indvar_flatten_next_reg_463</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>p_319_reg_503</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>p_331_reg_533</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>p_355_reg_543</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>p_357_reg_498</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>p_hw_output_x_scan_1_reg_493</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>p_hw_output_x_scan_2_reg_140</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>p_hw_output_x_scan_s_reg_473</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>p_hw_output_y_scan_1_reg_129</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>p_hw_output_y_scan_s_reg_488</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>tmp1_reg_508</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>tmp3_reg_538</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>tmp4_reg_523</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>tmp5_reg_483</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>tmp_4_reg_513</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>tmp_5_reg_518</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>tmp_last_V_reg_528</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>tmp_mid1_reg_478</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>3</count>
<item_version>0</item_version>
<item>
<first>118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>129</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>140</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>3</count>
<item_version>0</item_version>
<item>
<first>indvar_flatten_reg_118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>p_hw_output_x_scan_2_reg_140</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>p_hw_output_y_scan_1_reg_129</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="57" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="58" tracking_level="0" version="0">
<first>hw_output_V_last_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
</second>
</item>
<item>
<first>hw_output_V_value_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
</second>
</item>
<item>
<first>p_hw_input_stencil_stream_V_value_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="59" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="60" tracking_level="0" version="0">
<first>1</first>
<second>FIFO_SRL</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
|
-- { dg-do compile }
-- { dg-options "-O2 -fdump-tree-optimized" }
package body Noinline2 is
function Inner (A, B : Integer) return Integer;
pragma No_Inline (Inner);
function Inner (A, B : Integer) return Integer is
begin
return A + B;
end;
function F (A, B : Integer) return Integer is
begin
return Inner (A, B) + Inner (A, -B);
end;
end Noinline2;
-- { dg-final { scan-tree-dump-times "noinline2.inner" 2 "optimized" } }
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . I N I T --
-- --
-- S p e c --
-- --
-- Copyright (C) 2003-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/>. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by AdaCore. --
-- --
------------------------------------------------------------------------------
-- This unit contains initialization circuits that are system dependent
-- This package is for use with configurable runtimes, and replaces init.c
pragma Restrictions (No_Elaboration_Code);
-- The procedure Install_Handler is called by the binder generated file before
-- any elaboration code, so we use the No_Elaboration_Code restriction to be
-- enfore full static preelaboration.
package System.Init is
pragma Preelaborate;
procedure Install_Handler;
pragma Export (C, Install_Handler, "__gnat_install_handler");
-- Install signal handlers. This procedure is called by Runtime_Initialize,
-- but it may also be called by the tasking runtime when a task is created.
procedure Runtime_Initialize (Install_Handler : Integer);
pragma Export (C, Runtime_Initialize, "__gnat_runtime_initialize");
-- This procedure is called by adainit before the elaboration of other
-- units. It usually installs handler for the synchronous signals. The C
-- profile here is what is expected by the binder-generated main.
procedure Runtime_Finalize;
pragma Export (C, Runtime_Finalize, "__gnat_runtime_finalize");
-- This procedure is called by adafinal.
private
-----------------------------
-- Binder Generated Values --
-----------------------------
Gl_Leap_Seconds_Support : Integer := 0;
pragma Export (C, Gl_Leap_Seconds_Support, "__gl_leap_seconds_support");
Gl_Time_Slice_Val : Integer := -1;
pragma Export (C, Gl_Time_Slice_Val, "__gl_time_slice_val");
Gl_Wc_Encoding : Character := 'n';
pragma Export (C, Gl_Wc_Encoding, "__gl_wc_encoding");
Gl_Locking_Policy : Character := ' ';
pragma Export (C, Gl_Locking_Policy, "__gl_locking_policy");
Gl_Queuing_Policy : Character := ' ';
pragma Export (C, Gl_Queuing_Policy, "__gl_queuing_policy");
Gl_Task_Dispatching_Policy : Character := ' ';
pragma Export (C, Gl_Task_Dispatching_Policy,
"__gl_task_dispatching_policy");
Gl_Priority_Specific_Dispatching : Address := Null_Address;
pragma Export (C, Gl_Priority_Specific_Dispatching,
"__gl_priority_specific_dispatching");
Gl_Num_Specific_Dispatching : Integer := 0;
pragma Export (C, Gl_Num_Specific_Dispatching,
"__gl_num_specific_dispatching");
Gl_Restrictions : Address := Null_Address;
pragma Export (C, Gl_Restrictions, "__gl_restrictions");
Gl_Interrupt_States : Address := Null_Address;
pragma Export (C, Gl_Interrupt_States, "__gl_interrupt_states");
Gl_Num_Interrupt_States : Integer := 0;
pragma Export (C, Gl_Num_Interrupt_States, "__gl_num_interrupt_states");
Gl_Unreserve_All_Interrupts : Integer := 0;
pragma Export (C, Gl_Unreserve_All_Interrupts,
"__gl_unreserve_all_interrupts");
Gl_Exception_Tracebacks : Integer := 0;
pragma Export (C, Gl_Exception_Tracebacks, "__gl_exception_tracebacks");
Gl_Exception_Tracebacks_Symbolic : Integer := 0;
pragma Export (C, Gl_Exception_Tracebacks_Symbolic,
"__gl_exception_tracebacks_symbolic");
Gl_Detect_Blocking : Integer := 0;
pragma Export (C, Gl_Detect_Blocking, "__gl_detect_blocking");
Gl_Default_Stack_Size : Integer := 0;
pragma Export (C, Gl_Default_Stack_Size, "__gl_default_stack_size");
Gl_Bind_Env_Addr : Address := Null_Address;
pragma Export (C, Gl_Bind_Env_Addr, "__gl_bind_env_addr");
Gl_XDR_Stream : Integer := 0;
pragma Export (C, Gl_XDR_Stream, "__gl_xdr_stream");
Gl_Time_T_is_32_Bits : Integer := 0;
pragma Export (C, Gl_Time_T_is_32_Bits, "__gl_time_t_is_32_bits");
-- The following two variables are deliberately commented out. They are
-- referenced by the binder generated file, but they cannot be shared among
-- different versions of System.Init. The reason is that the ravenscar
-- version of System.Tasking (s-taskin-raven.adb) redefines these variables
-- because the ravenscar/sfp runtime doesn't use System.Init, while the
-- ravenscar/full runtime does.
-- Gl_Main_Priority : Integer := -1;
-- pragma Export (C, Gl_Main_Priority, "__gl_main_priority");
-- Gl_Main_CPU : Integer := -1;
-- pragma Export (C, Gl_Main_CPU, "__gl_main_cpu");
end System.Init;
|
package body System.File_Control_Block is
function Stream (File : AFCB_Ptr) return Interfaces.C_Streams.FILEs is
begin
raise Program_Error; -- FILE * is not used in drake
return Stream (File);
end Stream;
end System.File_Control_Block;
|
-- AOC 2020, Day 8
with Ada.Text_IO; use Ada.Text_IO;
with Day; use Day;
procedure main is
acc : constant Integer := acc_before_repeat("input.txt");
h : constant Integer := acc_after_terminate("input.txt");
begin
put_line("Part 1: " & Integer'Image(acc));
put_line("Part 2: " & Integer'Image(h));
end main;
|
with TestAPI.Clients;
with TestAPI.Models;
with Swagger;
with Util.Http.Clients.Curl;
with Ada.Text_IO;
with Ada.Command_Line;
with Ada.Calendar.Formatting;
with Ada.Exceptions;
procedure TestAPI.Client is
use Ada.Text_IO;
procedure Usage;
Server : constant Swagger.UString := Swagger.To_UString ("http://localhost:8080/v2");
Arg_Count : constant Natural := Ada.Command_Line.Argument_Count;
Arg : Positive := 1;
procedure Usage is
begin
Put_Line ("Usage: TestAPI {params}...");
end Usage;
begin
if Arg_Count <= 1 then
Usage;
return;
end if;
Util.Http.Clients.Curl.Register;
declare
Command : constant String := Ada.Command_Line.Argument (Arg);
Item : constant String := Ada.Command_Line.Argument (Arg + 1);
C : TestAPI.Clients.Client_Type;
begin
C.Set_Server (Server);
Arg := Arg + 2;
exception
when E : Constraint_Error =>
Put_Line ("Constraint error raised: " & Ada.Exceptions.Exception_Message (E));
end;
end TestAPI.Client;
|
-- SPDX-FileCopyrightText: 2019 Max Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
package body Program.Nodes.Extension_Aggregates is
function Create
(Left_Bracket_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Ancestor : not null Program.Elements.Expressions
.Expression_Access;
With_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Components : Program.Elements.Record_Component_Associations
.Record_Component_Association_Vector_Access;
Right_Bracket_Token : not null Program.Lexical_Elements
.Lexical_Element_Access)
return Extension_Aggregate is
begin
return Result : Extension_Aggregate :=
(Left_Bracket_Token => Left_Bracket_Token, Ancestor => Ancestor,
With_Token => With_Token, Components => Components,
Right_Bracket_Token => Right_Bracket_Token, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
function Create
(Ancestor : not null Program.Elements.Expressions
.Expression_Access;
Components : Program.Elements.Record_Component_Associations
.Record_Component_Association_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Extension_Aggregate is
begin
return Result : Implicit_Extension_Aggregate :=
(Ancestor => Ancestor, Components => Components,
Is_Part_Of_Implicit => Is_Part_Of_Implicit,
Is_Part_Of_Inherited => Is_Part_Of_Inherited,
Is_Part_Of_Instance => Is_Part_Of_Instance, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
overriding function Ancestor
(Self : Base_Extension_Aggregate)
return not null Program.Elements.Expressions.Expression_Access is
begin
return Self.Ancestor;
end Ancestor;
overriding function Components
(Self : Base_Extension_Aggregate)
return Program.Elements.Record_Component_Associations
.Record_Component_Association_Vector_Access is
begin
return Self.Components;
end Components;
overriding function Left_Bracket_Token
(Self : Extension_Aggregate)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Left_Bracket_Token;
end Left_Bracket_Token;
overriding function With_Token
(Self : Extension_Aggregate)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.With_Token;
end With_Token;
overriding function Right_Bracket_Token
(Self : Extension_Aggregate)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Right_Bracket_Token;
end Right_Bracket_Token;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Extension_Aggregate)
return Boolean is
begin
return Self.Is_Part_Of_Implicit;
end Is_Part_Of_Implicit;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Extension_Aggregate)
return Boolean is
begin
return Self.Is_Part_Of_Inherited;
end Is_Part_Of_Inherited;
overriding function Is_Part_Of_Instance
(Self : Implicit_Extension_Aggregate)
return Boolean is
begin
return Self.Is_Part_Of_Instance;
end Is_Part_Of_Instance;
procedure Initialize (Self : in out Base_Extension_Aggregate'Class) is
begin
Set_Enclosing_Element (Self.Ancestor, Self'Unchecked_Access);
for Item in Self.Components.Each_Element loop
Set_Enclosing_Element (Item.Element, Self'Unchecked_Access);
end loop;
null;
end Initialize;
overriding function Is_Extension_Aggregate
(Self : Base_Extension_Aggregate)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Extension_Aggregate;
overriding function Is_Expression
(Self : Base_Extension_Aggregate)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Expression;
overriding procedure Visit
(Self : not null access Base_Extension_Aggregate;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is
begin
Visitor.Extension_Aggregate (Self);
end Visit;
overriding function To_Extension_Aggregate_Text
(Self : in out Extension_Aggregate)
return Program.Elements.Extension_Aggregates
.Extension_Aggregate_Text_Access is
begin
return Self'Unchecked_Access;
end To_Extension_Aggregate_Text;
overriding function To_Extension_Aggregate_Text
(Self : in out Implicit_Extension_Aggregate)
return Program.Elements.Extension_Aggregates
.Extension_Aggregate_Text_Access is
pragma Unreferenced (Self);
begin
return null;
end To_Extension_Aggregate_Text;
end Program.Nodes.Extension_Aggregates;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- SQL Database Access --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011, 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 for internal use only.
------------------------------------------------------------------------------
with Matreshka.Internals.SQL_Drivers;
package SQL.Databases.Internals is
function Internal
(Self : SQL_Database'Class)
return Matreshka.Internals.SQL_Drivers.Database_Access;
pragma Inline (Internal);
-- Returns internal object. Reference counter is untouched.
end SQL.Databases.Internals;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- B U T I L --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2014, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. 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 Output; use Output;
package body Butil is
----------------------
-- Is_Internal_Unit --
----------------------
-- Note: the reason we do not use the Fname package for this function
-- is that it would drag too much junk into the binder.
function Is_Internal_Unit return Boolean is
begin
return Is_Predefined_Unit
or else (Name_Len > 4 and then (Name_Buffer (1 .. 5) = "gnat%"
or else
Name_Buffer (1 .. 5) = "gnat."));
end Is_Internal_Unit;
------------------------
-- Is_Predefined_Unit --
------------------------
-- Note: the reason we do not use the Fname package for this function
-- is that it would drag too much junk into the binder.
function Is_Predefined_Unit return Boolean is
L : Natural renames Name_Len;
B : String renames Name_Buffer;
begin
return (L > 3 and then B (1 .. 4) = "ada.")
or else (L > 6 and then B (1 .. 7) = "system.")
or else (L > 10 and then B (1 .. 11) = "interfaces.")
or else (L > 3 and then B (1 .. 4) = "ada%")
or else (L > 8 and then B (1 .. 9) = "calendar%")
or else (L > 9 and then B (1 .. 10) = "direct_io%")
or else (L > 10 and then B (1 .. 11) = "interfaces%")
or else (L > 13 and then B (1 .. 14) = "io_exceptions%")
or else (L > 12 and then B (1 .. 13) = "machine_code%")
or else (L > 13 and then B (1 .. 14) = "sequential_io%")
or else (L > 6 and then B (1 .. 7) = "system%")
or else (L > 7 and then B (1 .. 8) = "text_io%")
or else (L > 20 and then B (1 .. 21) = "unchecked_conversion%")
or else (L > 22 and then B (1 .. 23) = "unchecked_deallocation%")
or else (L > 4 and then B (1 .. 5) = "gnat%")
or else (L > 4 and then B (1 .. 5) = "gnat.");
end Is_Predefined_Unit;
----------------
-- Uname_Less --
----------------
function Uname_Less (U1, U2 : Unit_Name_Type) return Boolean is
begin
Get_Name_String (U1);
declare
U1_Name : constant String (1 .. Name_Len) :=
Name_Buffer (1 .. Name_Len);
Min_Length : Natural;
begin
Get_Name_String (U2);
if Name_Len < U1_Name'Last then
Min_Length := Name_Len;
else
Min_Length := U1_Name'Last;
end if;
for J in 1 .. Min_Length loop
if U1_Name (J) > Name_Buffer (J) then
return False;
elsif U1_Name (J) < Name_Buffer (J) then
return True;
end if;
end loop;
return U1_Name'Last < Name_Len;
end;
end Uname_Less;
---------------------
-- Write_Unit_Name --
---------------------
procedure Write_Unit_Name (U : Unit_Name_Type) is
begin
Get_Name_String (U);
Write_Str (Name_Buffer (1 .. Name_Len - 2));
if Name_Buffer (Name_Len) = 's' then
Write_Str (" (spec)");
else
Write_Str (" (body)");
end if;
Name_Len := Name_Len + 5;
end Write_Unit_Name;
end Butil;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . S H O R T _ F L O A T _ W I D E _ T E X T _ I O --
-- --
-- S p e c --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. In accordance with the copyright of that document, you can freely --
-- copy and modify this specification, provided that if you redistribute a --
-- modified version, any changes that you have made are clearly indicated. --
-- --
------------------------------------------------------------------------------
with Ada.Wide_Text_IO;
package Ada.Short_Float_Wide_Text_IO is
new Ada.Wide_Text_IO.Float_IO (Short_Float);
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- G N A T . S P I T B O L . T A B L E _ I N T E G E R --
-- --
-- S p e c --
-- --
-- Copyright (C) 1997-2005, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- SPITBOL tables with integer values
-- This package provides a predefined instantiation of the table abstraction
-- for type Standard.Integer. The largest negative integer is used as the
-- null value for the table. This package is based on Macro-SPITBOL created
-- by Robert Dewar.
package GNAT.Spitbol.Table_Integer is
new GNAT.Spitbol.Table (Integer, Integer'First, Integer'Image);
pragma Preelaborate (Table_Integer);
|
-- part of AdaYaml, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "copying.txt"
with Ada.Text_IO;
package Yaml.Destination.Text_IO is
type Instance is new Destination.Instance with private;
function As_Destination (File : Ada.Text_IO.File_Access) return Pointer
with Pre => Ada.Text_IO.Is_Open (File.all);
overriding procedure Write_Data (D : in out Instance; Buffer : String);
private
type Instance is new Destination.Instance with record
File_Pointer : Ada.Text_IO.File_Access;
end record;
end Yaml.Destination.Text_IO;
|
-----------------------------------------------------------------------
-- awa-mail-components-attachments -- Mail UI Attachments
-- Copyright (C) 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 Ada.Strings.Unbounded;
with Util.Beans.Objects;
package body AWA.Mail.Components.Attachments is
use Ada.Strings.Unbounded;
-- ------------------------------
-- Render the mail subject and initializes the message with its content.
-- ------------------------------
overriding
procedure Encode_Children (UI : in UIMailAttachment;
Context : in out ASF.Contexts.Faces.Faces_Context'Class) is
procedure Process (Content : in Unbounded_String);
Content_Type : Util.Beans.Objects.Object;
File_Name : Util.Beans.Objects.Object;
Value : Util.Beans.Objects.Object;
Msg : constant AWA.Mail.Clients.Mail_Message_Access := UI.Get_Message;
function Get_Content_Id return String is
(if not Util.Beans.Objects.Is_Empty (File_Name) then
Util.Beans.Objects.To_String (File_Name)
else
To_String (UI.Get_Client_Id));
function Get_Content_Type return String is
(if Util.Beans.Objects.Is_Empty (Content_Type) then
""
else
Util.Beans.Objects.To_String (Content_Type));
procedure Process (Content : in Unbounded_String) is
begin
Msg.Add_Attachment (Content, Get_Content_Id, Get_Content_Type);
end Process;
begin
Content_Type := UI.Get_Attribute (Name => "contentType", Context => Context);
File_Name := UI.Get_Attribute (Name => "fileName", Context => Context);
Value := UI.Get_Attribute (Name => "value", Context => Context);
if Util.Beans.Objects.Is_Empty (Value) then
UI.Wrap_Encode_Children (Context, Process'Access);
else
Msg.Add_File_Attachment (Util.Beans.Objects.To_String (Value),
Get_Content_Id,
Get_Content_Type);
end if;
end Encode_Children;
end AWA.Mail.Components.Attachments;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of STMicroelectronics nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
-- --
-- This file is based on: --
-- --
-- @file l3gd20.h --
-- @author MCD Application Team --
-- @version V1.1.0 --
-- @date 19-June-2014 --
-- @brief This file contains all the functions prototypes for the --
-- l3gd20.c driver --
-- --
-- COPYRIGHT(c) 2014 STMicroelectronics --
------------------------------------------------------------------------------
-- This file provides a driver for the L3GD20 gyroscope from ST
-- Microelectronics.
-- See datasheet "L3GD20 MEMS motion sensor: three-axis digital output
-- gyroscope" DocID022116 Rev 2, dated February 2013, file number DM00036465
with Interfaces; use Interfaces;
with HAL; use HAL;
with HAL.SPI; use HAL.SPI;
with HAL.GPIO; use HAL.GPIO;
package L3GD20 is
pragma Elaborate_Body;
type Three_Axis_Gyroscope is tagged limited private;
procedure Initialize
(This : in out Three_Axis_Gyroscope;
Port : Any_SPI_Port;
Chip_Select : Any_GPIO_Point);
-- Does device-specific initialization. Must be called prior to use.
--
-- NB: does NOT init/configure SPI and GPIO IO, which must be done
-- (elsewhere) prior to calling this routine.
type Power_Mode_Selection is
(L3GD20_Mode_Powerdown,
L3GD20_Mode_Active)
with Size => 8;
for Power_Mode_Selection use
(L3GD20_Mode_Powerdown => 16#00#,
L3GD20_Mode_Active => 16#08#);
type Output_Data_Rate_Selection is
(L3GD20_Output_Data_Rate_95Hz,
L3GD20_Output_Data_Rate_190Hz,
L3GD20_Output_Data_Rate_380Hz,
L3GD20_Output_Data_Rate_760Hz)
with Size => 8;
for Output_Data_Rate_Selection use
(L3GD20_Output_Data_Rate_95Hz => 16#00#,
L3GD20_Output_Data_Rate_190Hz => 16#40#,
L3GD20_Output_Data_Rate_380Hz => 16#80#,
L3GD20_Output_Data_Rate_760Hz => 16#C0#);
-- See App Note 4505, pg 8, Table 3.
function Data_Rate_Hertz (Selection : Output_Data_Rate_Selection) return Float is
(case Selection is
when L3GD20_Output_Data_Rate_95Hz => 95.0,
when L3GD20_Output_Data_Rate_190Hz => 190.0,
when L3GD20_Output_Data_Rate_380Hz => 380.0,
when L3GD20_Output_Data_Rate_760Hz => 760.0);
type Axes_Selection is
(L3GD20_Axes_Disable,
L3GD20_Y_Enable,
L3GD20_X_Enable,
L3GD20_Z_Enable,
L3GD20_Axes_Enable)
with Size => 8;
for Axes_Selection use
(L3GD20_X_Enable => 16#02#,
L3GD20_Y_Enable => 16#01#,
L3GD20_Z_Enable => 16#04#,
L3GD20_Axes_Enable => 16#07#,
L3GD20_Axes_Disable => 16#00#);
-- See App Note 4505, pg 8, Table 3.
type Bandwidth_Selection is
(L3GD20_Bandwidth_1,
L3GD20_Bandwidth_2,
L3GD20_Bandwidth_3,
L3GD20_Bandwidth_4)
with Size => 8;
for Bandwidth_Selection use
(L3GD20_Bandwidth_1 => 16#00#,
L3GD20_Bandwidth_2 => 16#10#,
L3GD20_Bandwidth_3 => 16#20#,
L3GD20_Bandwidth_4 => 16#30#);
type Full_Scale_Selection is
(L3GD20_Fullscale_250,
L3GD20_Fullscale_500,
L3GD20_Fullscale_2000)
with Size => 8;
for Full_Scale_Selection use
(L3GD20_Fullscale_250 => 16#00#,
L3GD20_Fullscale_500 => 16#10#,
L3GD20_Fullscale_2000 => 16#20#);
type Block_Data_Update_Selection is
(L3GD20_BlockDataUpdate_Continous,
L3GD20_BlockDataUpdate_Single)
with Size => 8;
for Block_Data_Update_Selection use
(L3GD20_BlockDataUpdate_Continous => 16#00#,
L3GD20_BlockDataUpdate_Single => 16#80#);
type Endian_Data_Selection is
(L3GD20_Little_Endian,
L3GD20_Big_Endian)
with Size => 8;
for Endian_Data_Selection use
(L3GD20_Little_Endian => 16#00#,
L3GD20_Big_Endian => 16#40#);
-- Set up the gyro behavior. Must be called prior to using the gyro.
procedure Configure
(This : in out Three_Axis_Gyroscope;
Power_Mode : Power_Mode_Selection;
Output_Data_Rate : Output_Data_Rate_Selection;
Axes_Enable : Axes_Selection;
Bandwidth : Bandwidth_Selection;
BlockData_Update : Block_Data_Update_Selection;
Endianness : Endian_Data_Selection;
Full_Scale : Full_Scale_Selection);
procedure Enable_Low_Pass_Filter (This : in out Three_Axis_Gyroscope);
-- See App Note 4505, pg 15, Figure 5 and Table 9 for the concept. Enables
-- the low pass filter LPF2 in the diagrams, for output to the data
-- registers and the FIFO. The value of LPF2 is determined by the output
-- data rate and bandwidth selections specified when calling procedure
-- Configure. These values are shown in the App Note, pg 16, Table 11.
-- The filter allows frequencies lower than the LPF2 "cutoff" value, and
-- attenuates those at or above the cutoff. Note that the high pass filter
-- is independent of the low pass filter.
procedure Disable_Low_Pass_Filter (This : in out Three_Axis_Gyroscope);
function Full_Scale_Sensitivity (This : Three_Axis_Gyroscope) return Float;
-- Returns the sensitivity per LSB based on the Full_Scale_Selection
-- specified to procedure Configure. Used to scale raw angle rates. Note
-- that the values are already in terms of millidegrees per second per
-- digit, so to use these values you should multiply, rather than divide.
-- NB: These values are not measured on the specific device on the board
-- in use. Instead, they are statistical averages determined at the factory
-- for this component family, so you will likely need to tweak them a bit.
-- High Pass Filtering functionality
-- See App Note 4505, pg 17, Table 14.
type High_Pass_Filter_Mode is
(L3GD20_HPM_Normal_Mode_Reset,
-- filter is reset by reading the Reference register
L3GD20_HPM_Reference_Signal,
-- output data is input - Reference register
L3GD20_HPM_Normal_Mode,
-- filter is reset by reading the Reference register
L3GD20_HPM_Autoreset_Int)
-- filter is auto-reset on configured interrupt
with Size => 8;
for High_Pass_Filter_Mode use
(L3GD20_HPM_Normal_Mode_Reset => 16#00#,
L3GD20_HPM_Reference_Signal => 16#10#,
L3GD20_HPM_Normal_Mode => 16#20#,
L3GD20_HPM_Autoreset_Int => 16#30#);
-- See App Note 4505, pg 17, Table 13 for the resulting frequencies. As
-- shown in that table, the frequencies selected by these enumerals are
-- a function of the configured output data rate selected elsewhere.
type High_Pass_Cutoff_Frequency is
(L3GD20_HPFCF_0,
L3GD20_HPFCF_1,
L3GD20_HPFCF_2,
L3GD20_HPFCF_3,
L3GD20_HPFCF_4,
L3GD20_HPFCF_5,
L3GD20_HPFCF_6,
L3GD20_HPFCF_7,
L3GD20_HPFCF_8,
L3GD20_HPFCF_9)
with Size => 8;
for High_Pass_Cutoff_Frequency use -- confirming
(L3GD20_HPFCF_0 => 16#00#,
L3GD20_HPFCF_1 => 16#01#,
L3GD20_HPFCF_2 => 16#02#,
L3GD20_HPFCF_3 => 16#03#,
L3GD20_HPFCF_4 => 16#04#,
L3GD20_HPFCF_5 => 16#05#,
L3GD20_HPFCF_6 => 16#06#,
L3GD20_HPFCF_7 => 16#07#,
L3GD20_HPFCF_8 => 16#08#,
L3GD20_HPFCF_9 => 16#09#);
procedure Configure_High_Pass_Filter
(This : in out Three_Axis_Gyroscope;
Mode_Selection : High_Pass_Filter_Mode;
Cutoff_Frequency : High_Pass_Cutoff_Frequency);
procedure Enable_High_Pass_Filter (This : in out Three_Axis_Gyroscope);
-- Allows frequencies higher than the cutoff specified to procedure
-- Configure_High_Pass_Filter, and attenuates those at or below it.
procedure Disable_High_Pass_Filter (This : in out Three_Axis_Gyroscope);
function Reference_Value
(This : Three_Axis_Gyroscope)
return UInt8
with Inline;
procedure Set_Reference
(This : in out Three_Axis_Gyroscope; Value : UInt8)
with Inline;
-- Basic data access functionality
type Gyro_Data_Status is record
ZYX_Overrun : Boolean;
Z_Overrun : Boolean;
Y_Overrun : Boolean;
X_Overrun : Boolean;
ZYX_Available : Boolean;
Z_Available : Boolean;
Y_Available : Boolean;
X_Available : Boolean;
end record
with Size => 8;
for Gyro_Data_Status use record
ZYX_Overrun at 0 range 7 .. 7;
Z_Overrun at 0 range 6 .. 6;
Y_Overrun at 0 range 5 .. 5;
X_Overrun at 0 range 4 .. 4;
ZYX_Available at 0 range 3 .. 3;
Z_Available at 0 range 2 .. 2;
Y_Available at 0 range 1 .. 1;
X_Available at 0 range 0 .. 0;
end record;
function Data_Status (This : Three_Axis_Gyroscope) return Gyro_Data_Status
with Inline;
type Angle_Rate is new Integer_16;
type Angle_Rates is record
X : Angle_Rate; -- pitch, per Figure 2, pg 7 of the Datasheet
Y : Angle_Rate; -- roll
Z : Angle_Rate; -- yaw
end record with Size => 3 * 16;
for Angle_Rates use record
X at 0 range 0 .. 15;
Y at 2 range 0 .. 15;
Z at 4 range 0 .. 15;
end record;
-- confirming, but required, eg for matching FIFO content format
procedure Get_Raw_Angle_Rates
(This : Three_Axis_Gyroscope;
Rates : out Angle_Rates);
-- Returns the latest data, swapping UInt8s if required by the endianess
-- selected by a previous call to Configure.
-- NB: does NOT check whether the gyro status indicates data are ready.
-- NB: does NOT apply any sensitity scaling.
-- FIFO functionality
type FIFO_Modes is
(L3GD20_Bypass_Mode,
L3GD20_FIFO_Mode,
L3GD20_Stream_Mode,
L3GD20_Stream_To_FIFO_Mode,
L3GD20_Bypass_To_Stream_Mode)
with Size => 8;
for FIFO_Modes use -- confirming
(L3GD20_Bypass_Mode => 2#0000_0000#,
L3GD20_FIFO_Mode => 2#0010_0000#,
L3GD20_Stream_Mode => 2#0100_0000#,
L3GD20_Stream_To_FIFO_Mode => 2#0110_0000#,
L3GD20_Bypass_To_Stream_Mode => 2#1000_0000#);
procedure Set_FIFO_Mode (This : in out Three_Axis_Gyroscope;
Mode : FIFO_Modes);
procedure Enable_FIFO (This : in out Three_Axis_Gyroscope);
procedure Disable_FIFO (This : in out Three_Axis_Gyroscope);
subtype FIFO_Level is Integer range 0 .. 31;
procedure Set_FIFO_Watermark (This : in out Three_Axis_Gyroscope;
Level : FIFO_Level);
type Angle_Rates_FIFO_Buffer is array (FIFO_Level range <>) of Angle_Rates
with Alignment => Angle_Rate'Alignment;
procedure Get_Raw_Angle_Rates_FIFO
(This : in out Three_Axis_Gyroscope;
Buffer : out Angle_Rates_FIFO_Buffer);
-- Returns the latest raw data in the FIFO, swapping UInt8s if required by
-- the endianess selected by a previous call to Configure. Fills the entire
-- buffer passed.
-- NB: does NOT apply any sensitity scaling.
function Current_FIFO_Depth (This : Three_Axis_Gyroscope) return FIFO_Level;
-- The number of unread entries currently in the hardware FIFO
function FIFO_Below_Watermark (This : Three_Axis_Gyroscope) return Boolean;
function FIFO_Empty (This : Three_Axis_Gyroscope) return Boolean;
function FIFO_Overrun (This : Three_Axis_Gyroscope) return Boolean;
-- Interrupt 2 controls
procedure Disable_Int2_Interrupts (This : in out Three_Axis_Gyroscope);
procedure Enable_Data_Ready_Interrupt (This : in out Three_Axis_Gyroscope);
procedure Disable_Data_Ready_Interrupt (This : in out Three_Axis_Gyroscope);
procedure Enable_FIFO_Watermark_Interrupt
(This : in out Three_Axis_Gyroscope);
procedure Disable_FIFO_Watermark_Interrupt
(This : in out Three_Axis_Gyroscope);
procedure Enable_FIFO_Overrun_Interrupt (This : in out Three_Axis_Gyroscope);
procedure Disable_FIFO_Overrun_Interrupt (This : in out Three_Axis_Gyroscope);
procedure Enable_FIFO_Empty_Interrupt (This : in out Three_Axis_Gyroscope);
procedure Disable_FIFO_Empty_Interrupt (This : in out Three_Axis_Gyroscope);
-- Interrupt 1 facilities
procedure Disable_Int1_Interrupts (This : in out Three_Axis_Gyroscope);
type Sample_Counter is mod 2 ** 6;
procedure Set_Duration_Counter
(This : in out Three_Axis_Gyroscope;
Value : Sample_Counter);
-- Loads the INT1_DURATION register with the specified Value and enables
-- the "wait" option so that the interrupt is not generated unless any
-- sample value is beyond a threshold for the corresponding amount of time.
-- The effective time is dependent on the data rate selected elsewhere.
type Axes_Interrupts is
(Z_High_Interrupt,
Z_Low_Interrupt,
Y_High_Interrupt,
Y_Low_Interrupt,
X_High_Interrupt,
X_Low_Interrupt);
procedure Enable_Event
(This : in out Three_Axis_Gyroscope;
Event : Axes_Interrupts);
procedure Disable_Event
(This : in out Three_Axis_Gyroscope;
Event : Axes_Interrupts);
type Axis_Sample_Threshold is new UInt16 range 0 .. 2 ** 15;
-- Threshold values do not use the high-order bit
procedure Set_Threshold
(This : in out Three_Axis_Gyroscope;
Event : Axes_Interrupts;
Value : Axis_Sample_Threshold);
-- Writes the two-UInt8 threshold value into the two threshold registers for
-- the specified interrupt event. Does not enable the event itself.
type Threshold_Event is record
Axis : Axes_Interrupts;
Threshold : Axis_Sample_Threshold;
end record;
type Threshold_Event_List is
array (Positive range <>) of Threshold_Event;
type Interrupt1_Active_Edge is
(L3GD20_Interrupt1_High_Edge,
L3GD20_Interrupt1_Low_Edge);
for Interrupt1_Active_Edge use
(L3GD20_Interrupt1_Low_Edge => 16#20#,
L3GD20_Interrupt1_High_Edge => 16#00#);
procedure Configure_Interrupt1
(This : in out Three_Axis_Gyroscope;
Triggers : Threshold_Event_List;
Latched : Boolean := False;
Active_Edge : Interrupt1_Active_Edge := L3GD20_Interrupt1_High_Edge;
Combine_Events : Boolean := False;
Sample_Count : Sample_Counter := 0);
--
-- If Latched is False (the hardware default value), the interrupt signal
-- goes high when the interrupt condition is satisfied and returns low
-- immediately if the interrupt condition is no longer verified. Otherwise,
-- if Latched is True, the interrupt signal remains high even if the
-- condition returns to a non-interrupt status, until a read of the
-- INT1_SRC register is performed.
--
-- If Combine_Events is True, all events' criteria must be
-- safisfied for the interrupt to be generated; otherwise any one is
-- sufficient.
--
-- If Sample_Count is not zero, passes Sample_Count to a call to
-- Set_Duration_Counter
--
-- For every event and threshold specified in Triggers, sets the threshold
-- value and enables the corresponding high or low threshold interrupt for
-- that axis. For example, the following call enables the interrupt when
-- the sampled value for the X axis is greater than 10 or the sample for
-- the Z axis is greater than 20:
--
-- Configure_Interrupt_1
-- (Latched => ... ,
-- Active_Edge => ... ,
-- Triggers => ((X_High_Interrupt, Threshold => 10),
-- (Z_High_Interrupt, Threshold => 20)));
--
-- For that example call, if Combine_Events is True, the interrupt is only
-- generated if both thresholds are exceeded. Otherwise either one is
-- sufficient for the interrupt to be generated.
procedure Enable_Interrupt1 (This : in out Three_Axis_Gyroscope);
procedure Disable_Interrupt1 (This : in out Three_Axis_Gyroscope);
type Pin_Modes is (Push_Pull, Open_Drain);
for Pin_Modes use (Push_Pull => 0, Open_Drain => 2#0001_0000#);
procedure Set_Interrupt_Pin_Mode
(This : in out Three_Axis_Gyroscope;
Mode : Pin_Modes);
type Interrupt1_Sources is record
Interrupts_Active : Boolean;
Z_High_Interrupt : Boolean;
Z_Low_Interrupt : Boolean;
Y_High_Interrupt : Boolean;
Y_Low_Interrupt : Boolean;
X_High_Interrupt : Boolean;
X_Low_Interrupt : Boolean;
end record
with Size => 8;
for Interrupt1_Sources use record
Interrupts_Active at 0 range 6 .. 6;
Z_High_Interrupt at 0 range 5 .. 5;
Z_Low_Interrupt at 0 range 4 .. 4;
Y_High_Interrupt at 0 range 3 .. 3;
Y_Low_Interrupt at 0 range 2 .. 2;
X_High_Interrupt at 0 range 1 .. 1;
X_Low_Interrupt at 0 range 0 .. 0;
end record;
function Interrupt1_Source (This : Three_Axis_Gyroscope) return Interrupt1_Sources;
-- Miscellaneous functionality
procedure Sleep (This : in out Three_Axis_Gyroscope);
-- See App Note 4505, pg 9
procedure Reboot (This : Three_Axis_Gyroscope);
procedure Reset (This : in out Three_Axis_Gyroscope);
-- writes default values to all writable registers
I_Am_L3GD20 : constant := 16#D4#;
function Device_Id (This : Three_Axis_Gyroscope) return UInt8;
-- Will return I_Am_L3GD20 when functioning properly
function Temperature (This : Three_Axis_Gyroscope) return UInt8;
-- the temperature of the chip itself
private
type Three_Axis_Gyroscope is tagged limited record
Port : Any_SPI_Port;
CS : Any_GPIO_Point;
end record;
type Register is new UInt8;
procedure Write
(This : Three_Axis_Gyroscope;
Addr : Register;
Data : UInt8)
with Inline;
-- Writes Data to the specified register within the gyro chip
procedure Read
(This : Three_Axis_Gyroscope;
Addr : Register;
Data : out UInt8)
with Inline;
-- Reads Data from the specified register within the gyro chip
procedure Read_UInt8s
(This : Three_Axis_Gyroscope;
Addr : Register;
Buffer : out SPI_Data_8b;
Count : Natural);
-- Reads multiple Data from the specified register within the gyro chip
-- L3GD20 Registers
Who_Am_I : constant Register := 16#0F#; -- device identification
CTRL_REG1 : constant Register := 16#20#; -- Control register 1
CTRL_REG2 : constant Register := 16#21#; -- Control register 2
CTRL_REG3 : constant Register := 16#22#; -- Control register 3
CTRL_REG4 : constant Register := 16#23#; -- Control register 4
CTRL_REG5 : constant Register := 16#24#; -- Control register 5
Reference : constant Register := 16#25#; -- Reference
OUT_Temp : constant Register := 16#26#; -- Temperature
Status : constant Register := 16#27#; -- Status
OUT_X_L : constant Register := 16#28#; -- Output X low UInt8
OUT_X_H : constant Register := 16#29#; -- Output X high UInt8
OUT_Y_L : constant Register := 16#2A#; -- Output Y low UInt8
OUT_Y_H : constant Register := 16#2B#; -- Output Y high UInt8
OUT_Z_L : constant Register := 16#2C#; -- Output Z low UInt8
OUT_Z_H : constant Register := 16#2D#; -- Output Z high UInt8
FIFO_CTRL : constant Register := 16#2E#; -- FIFO control
FIFO_SRC : constant Register := 16#2F#; -- FIFO src
INT1_CFG : constant Register := 16#30#; -- Interrupt 1 configuration
INT1_SRC : constant Register := 16#31#; -- Interrupt 1 source
INT1_TSH_XH : constant Register := 16#32#; -- Interrupt 1 Threshold X
INT1_TSH_XL : constant Register := 16#33#; -- Interrupt 1 Threshold X
INT1_TSH_YH : constant Register := 16#34#; -- Interrupt 1 Threshold Y
INT1_TSH_YL : constant Register := 16#35#; -- Interrupt 1 Threshold Y
INT1_TSH_ZH : constant Register := 16#36#; -- Interrupt 1 Threshold Z
INT1_TSH_ZL : constant Register := 16#37#; -- Interrupt 1 Threshold Z
INT1_Duration : constant Register := 16#38#; -- Interrupt 1 Duration
end L3GD20;
|
-- This spec has been automatically generated from STM32WL5x_CM0P.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.PKA is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype CR_MODE_Field is HAL.UInt6;
-- control register
type CR_Register is record
-- PKA enable.
EN : Boolean := False;
-- start the operation
START : Boolean := False;
-- unspecified
Reserved_2_7 : HAL.UInt6 := 16#0#;
-- PKA operation code
MODE : CR_MODE_Field := 16#0#;
-- unspecified
Reserved_14_16 : HAL.UInt3 := 16#0#;
-- PROCENDIE
PROCENDIE : Boolean := False;
-- unspecified
Reserved_18_18 : HAL.Bit := 16#0#;
-- RAM error interrupt enable
RAMERRIE : Boolean := False;
-- Address error interrupt enable
ADDRERRIE : Boolean := False;
-- unspecified
Reserved_21_31 : HAL.UInt11 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CR_Register use record
EN at 0 range 0 .. 0;
START at 0 range 1 .. 1;
Reserved_2_7 at 0 range 2 .. 7;
MODE at 0 range 8 .. 13;
Reserved_14_16 at 0 range 14 .. 16;
PROCENDIE at 0 range 17 .. 17;
Reserved_18_18 at 0 range 18 .. 18;
RAMERRIE at 0 range 19 .. 19;
ADDRERRIE at 0 range 20 .. 20;
Reserved_21_31 at 0 range 21 .. 31;
end record;
-- status register
type SR_Register is record
-- unspecified
Reserved_0_15 : HAL.UInt16;
-- Read-only. PKA operation is in progressThis bit is set to 1 whenever
-- START bit in the PKA_CR is set. It is automatically cleared when the
-- computation is complete, meaning that PKA RAM can be safely accessed
-- and a new operation can be started.
BUSY : Boolean;
-- Read-only. PKA End of Operation flag
PROCENDF : Boolean;
-- unspecified
Reserved_18_18 : HAL.Bit;
-- Read-only. PKA RAM error flag
RAMERRF : Boolean;
-- Read-only. Address error flag
ADDRERRF : Boolean;
-- unspecified
Reserved_21_31 : HAL.UInt11;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register use record
Reserved_0_15 at 0 range 0 .. 15;
BUSY at 0 range 16 .. 16;
PROCENDF at 0 range 17 .. 17;
Reserved_18_18 at 0 range 18 .. 18;
RAMERRF at 0 range 19 .. 19;
ADDRERRF at 0 range 20 .. 20;
Reserved_21_31 at 0 range 21 .. 31;
end record;
-- clear flag register
type CLRFR_Register is record
-- unspecified
Reserved_0_16 : HAL.UInt17 := 16#0#;
-- Write-only. Clear PKA End of Operation flag
PROCENDFC : Boolean := False;
-- unspecified
Reserved_18_18 : HAL.Bit := 16#0#;
-- Write-only. Clear PKA RAM error flag
RAMERRFC : Boolean := False;
-- Write-only. Clear Address error flag
ADDRERRFC : Boolean := False;
-- unspecified
Reserved_21_31 : HAL.UInt11 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CLRFR_Register use record
Reserved_0_16 at 0 range 0 .. 16;
PROCENDFC at 0 range 17 .. 17;
Reserved_18_18 at 0 range 18 .. 18;
RAMERRFC at 0 range 19 .. 19;
ADDRERRFC at 0 range 20 .. 20;
Reserved_21_31 at 0 range 21 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Public key accelerator
type PKA_Peripheral is record
-- control register
CR : aliased CR_Register;
-- status register
SR : aliased SR_Register;
-- clear flag register
CLRFR : aliased CLRFR_Register;
end record
with Volatile;
for PKA_Peripheral use record
CR at 16#0# range 0 .. 31;
SR at 16#4# range 0 .. 31;
CLRFR at 16#8# range 0 .. 31;
end record;
-- Public key accelerator
PKA_Periph : aliased PKA_Peripheral
with Import, Address => PKA_Base;
end STM32_SVD.PKA;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . S T O R A G E _ P O O L S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2009-2011, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
package body System.Storage_Pools is
------------------
-- Allocate_Any --
------------------
procedure Allocate_Any
(Pool : in out Root_Storage_Pool'Class;
Storage_Address : out System.Address;
Size_In_Storage_Elements : System.Storage_Elements.Storage_Count;
Alignment : System.Storage_Elements.Storage_Count)
is
begin
Allocate (Pool, Storage_Address, Size_In_Storage_Elements, Alignment);
end Allocate_Any;
--------------------
-- Deallocate_Any --
--------------------
procedure Deallocate_Any
(Pool : in out Root_Storage_Pool'Class;
Storage_Address : System.Address;
Size_In_Storage_Elements : System.Storage_Elements.Storage_Count;
Alignment : System.Storage_Elements.Storage_Count)
is
begin
Deallocate (Pool, Storage_Address, Size_In_Storage_Elements, Alignment);
end Deallocate_Any;
end System.Storage_Pools;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Program.Elements.Expressions;
with Program.Lexical_Elements;
package Program.Elements.Numeric_Literals is
pragma Pure (Program.Elements.Numeric_Literals);
type Numeric_Literal is
limited interface and Program.Elements.Expressions.Expression;
type Numeric_Literal_Access is access all Numeric_Literal'Class
with Storage_Size => 0;
not overriding function Image (Self : Numeric_Literal) return Text
is abstract;
type Numeric_Literal_Text is limited interface;
type Numeric_Literal_Text_Access is access all Numeric_Literal_Text'Class
with Storage_Size => 0;
not overriding function To_Numeric_Literal_Text
(Self : aliased in out Numeric_Literal)
return Numeric_Literal_Text_Access is abstract;
not overriding function Numeric_Literal_Token
(Self : Numeric_Literal_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
end Program.Elements.Numeric_Literals;
|
-- Copyright 2008-2021 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package body Pck is
procedure Do_Nothing (A : System.Address) is
begin
null;
end Do_Nothing;
end Pck;
|
------------------------------------------------------------------------------
-- Copyright (C) 2012-2020 by Heisenbug Ltd.
--
-- This work is free. You can redistribute it and/or modify it under the
-- terms of the Do What The Fuck You Want To Public License, Version 2,
-- as published by Sam Hocevar. See the LICENSE file for more details.
--------------------------------------------------------------------------------
pragma License (Unrestricted);
--------------------------------------------------------------------------------
-- Implements a linear (ascending order) access pattern.
--------------------------------------------------------------------------------
package Caches.Access_Patterns.Linear is
pragma Preelaborate;
type Linear_Pattern is new Pattern with private;
-----------------------------------------------------------------------------
-- Create
--
-- Creates a new linear access pattern with given step width.
-----------------------------------------------------------------------------
function Create (Length : in Bytes;
Step : in Bytes := 1) return Linear_Pattern;
-----------------------------------------------------------------------------
-- Next
--
-- Returns the next address for this access pattern.
-----------------------------------------------------------------------------
function Next (This_Ptr : access Linear_Pattern) return Address;
private
type Linear_Pattern is new Pattern with
record
Step : Address;
end record;
end Caches.Access_Patterns.Linear;
|
-- CB3003A.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 NON-SPECIFIC RAISE STATEMENT PROPAGATES THE EXCEPTION
-- FOR FURTHER PROCESSING(HANDLING) IN ANOTHER HANDLER.
-- *** NOTE: This test has been modified since ACVC version 1.11 to -- 9X
-- *** remove incompatibilities associated with the transition -- 9X
-- *** to Ada 9X. -- 9X
-- *** -- 9X
-- DCB 04/01/80
-- JRK 11/19/80
-- SPS 11/2/82
-- MRM 03/30/93 REMOVED NUMERIC_ERROR FOR 9X COMPATIBILITY
WITH REPORT;
PROCEDURE CB3003A IS
USE REPORT;
FLOW_COUNT : INTEGER := 0;
E1,E2 : EXCEPTION;
BEGIN
TEST("CB3003A","CHECK THAT THE NON-SPECIFIC RAISE STATEMENT" &
" PROPAGATES THE ERROR FOR FURTHER HANDLING IN ANOTHER" &
" HANDLER");
-------------------------------------------------------
BEGIN
BEGIN
BEGIN
FLOW_COUNT := FLOW_COUNT + 1;
RAISE E1;
FAILED("EXCEPTION NOT RAISED (CASE 1)");
EXCEPTION
WHEN OTHERS =>
FLOW_COUNT := FLOW_COUNT + 1;
RAISE;
FAILED("EXCEPTION NOT RERAISED (CASE 1; " &
"INNER)");
END;
EXCEPTION
-- A HANDLER SPECIFIC TO THE RAISED EXCEPTION (E1).
WHEN E1 =>
FLOW_COUNT := FLOW_COUNT + 1;
RAISE;
FAILED("EXCEPTION NOT RERAISED (CASE 1; OUTER)");
WHEN OTHERS =>
FAILED("WRONG EXCEPTION RAISED (CASE 1)");
END;
EXCEPTION
WHEN E1 =>
FLOW_COUNT := FLOW_COUNT + 1;
WHEN OTHERS =>
FAILED("WRONG EXCEPTION PASSED (CASE 1)");
END;
-------------------------------------------------------
BEGIN
BEGIN
BEGIN
FLOW_COUNT := FLOW_COUNT + 1;
RAISE E1;
FAILED("EXCEPTION NOT RAISED (CASE 2)");
EXCEPTION
WHEN OTHERS =>
FLOW_COUNT := FLOW_COUNT + 1;
RAISE;
FAILED("EXCEPTION NOT RERAISED (CASE 2; " &
"INNER)");
END;
EXCEPTION
-- A HANDLER FOR SEVERAL EXCEPTIONS INCLUDING THE ONE RAISED.
WHEN CONSTRAINT_ERROR =>
FAILED("WRONG EXCEPTION RAISED (CONSTRAINT_ERROR)");
WHEN E2 =>
FAILED("WRONG EXCEPTION RAISED (E2)");
WHEN PROGRAM_ERROR | E1 | TASKING_ERROR =>
FLOW_COUNT := FLOW_COUNT + 1;
RAISE;
FAILED("EXCEPTION NOT RERAISED (CASE 2; OUTER)");
WHEN STORAGE_ERROR =>
FAILED("WRONG EXCEPTION RAISED (STORAGE_ERROR)");
WHEN OTHERS =>
FAILED("WRONG EXCEPTION RAISED (OTHERS)");
END;
EXCEPTION
WHEN E1 =>
FLOW_COUNT := FLOW_COUNT + 1;
WHEN OTHERS =>
FAILED("WRONG EXCEPTION PASSED (CASE 2)");
END;
-------------------------------------------------------
BEGIN
BEGIN
BEGIN
FLOW_COUNT := FLOW_COUNT + 1;
RAISE E1;
FAILED("EXCEPTION NOT RAISED (CASE 3)");
EXCEPTION
WHEN OTHERS =>
FLOW_COUNT := FLOW_COUNT + 1;
RAISE;
FAILED("EXCEPTION NOT RERAISED (CASE 3; " &
"INNER)");
END;
EXCEPTION
-- A NON-SPECIFIC HANDLER.
WHEN CONSTRAINT_ERROR | E2 =>
FAILED("WRONG EXCEPTION RAISED " &
"(CONSTRAINT_ERROR | E2)");
WHEN OTHERS =>
FLOW_COUNT := FLOW_COUNT + 1;
RAISE;
FAILED("EXCEPTION NOT RERAISED (CASE 3; OUTER)");
END;
EXCEPTION
WHEN E1 =>
FLOW_COUNT := FLOW_COUNT + 1;
WHEN OTHERS =>
FAILED("WRONG EXCEPTION PASSED (CASE 3)");
END;
-------------------------------------------------------
IF FLOW_COUNT /= 12 THEN
FAILED("INCORRECT FLOW_COUNT VALUE");
END IF;
RESULT;
END CB3003A;
|
-- 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.
with Ada.Integer_Text_IO;
with Latin_Utils.Config;
with Latin_Utils.Latin_File_Names; use Latin_Utils.Latin_File_Names;
--with Latin_Utils.Preface;
package body Latin_Utils.Inflections_Package is
---------------------------------------------------------------------------
function "<" (Left, Right : Decn_Record) return Boolean is
begin
if Left.Which < Right.Which or else
(Left.Which = Right.Which and then
Left.Var < Right.Var)
then
return True;
else
return False;
end if;
end "<";
---------------------------------------------------------------------------
-- FIXME: should the function below, comparing two Quality_Records
-- not call the function above, comparing two Decn_Records?
function "<" (Left, Right : Quality_Record) return Boolean is
begin
if Left.Pofs = Right.Pofs then
case Left.Pofs is
when N =>
if Left.Noun.Decl.Which < Right.Noun.Decl.Which or else
(Left.Noun.Decl.Which = Right.Noun.Decl.Which and then
Left.Noun.Decl.Var < Right.Noun.Decl.Var) or else
(Left.Noun.Decl.Which = Right.Noun.Decl.Which and then
Left.Noun.Decl.Var = Right.Noun.Decl.Var and then
Left.Noun.Number < Right.Noun.Number) or else
(Left.Noun.Decl.Which = Right.Noun.Decl.Which and then
Left.Noun.Decl.Var = Right.Noun.Decl.Var and then
Left.Noun.Number = Right.Noun.Number and then
Left.Noun.Of_Case < Right.Noun.Of_Case) or else
(Left.Noun.Decl.Which = Right.Noun.Decl.Which and then
Left.Noun.Decl.Var = Right.Noun.Decl.Var and then
Left.Noun.Number = Right.Noun.Number and then
Left.Noun.Of_Case = Right.Noun.Of_Case and then
Left.Noun.Gender < Right.Noun.Gender)
then
return True;
end if;
when Pron =>
if Left.Pron.Decl.Which < Right.Pron.Decl.Which or else
(Left.Pron.Decl.Which = Right.Pron.Decl.Which and then
Left.Pron.Decl.Var < Right.Pron.Decl.Var) or else
(Left.Pron.Decl.Which = Right.Pron.Decl.Which and then
Left.Pron.Decl.Var = Right.Pron.Decl.Var and then
Left.Pron.Number < Right.Pron.Number) or else
(Left.Pron.Decl.Which = Right.Pron.Decl.Which and then
Left.Pron.Decl.Var = Right.Pron.Decl.Var and then
Left.Pron.Number = Right.Pron.Number and then
Left.Pron.Of_Case < Right.Pron.Of_Case) or else
(Left.Pron.Decl.Which = Right.Pron.Decl.Which and then
Left.Pron.Decl.Var = Right.Pron.Decl.Var and then
Left.Pron.Number = Right.Pron.Number and then
Left.Pron.Of_Case = Right.Pron.Of_Case and then
Left.Pron.Gender < Right.Pron.Gender)
then
return True;
end if;
when Pack =>
if Left.Pack.Decl.Which < Right.Pack.Decl.Which or else
(Left.Pack.Decl.Which = Right.Pack.Decl.Which and then
Left.Pack.Decl.Var < Right.Pack.Decl.Var) or else
(Left.Pack.Decl.Which = Right.Pack.Decl.Which and then
Left.Pack.Decl.Var = Right.Pack.Decl.Var and then
Left.Pack.Number < Right.Pack.Number) or else
(Left.Pack.Decl.Which = Right.Pack.Decl.Which and then
Left.Pack.Decl.Var = Right.Pack.Decl.Var and then
Left.Pack.Number = Right.Pack.Number and then
Left.Pack.Of_Case < Right.Pack.Of_Case) or else
(Left.Pack.Decl.Which = Right.Pack.Decl.Which and then
Left.Pack.Decl.Var = Right.Pack.Decl.Var and then
Left.Pack.Number = Right.Pack.Number and then
Left.Pack.Of_Case = Right.Pack.Of_Case and then
Left.Pack.Gender < Right.Pack.Gender)
then
return True;
end if;
when Adj =>
if Left.Adj.Decl.Which < Right.Adj.Decl.Which or else
(Left.Adj.Decl.Which = Right.Adj.Decl.Which and then
Left.Adj.Decl.Var < Right.Adj.Decl.Var) or else
(Left.Adj.Decl.Which = Right.Adj.Decl.Which and then
Left.Adj.Decl.Var = Right.Adj.Decl.Var and then
Left.Adj.Number < Right.Adj.Number) or else
(Left.Adj.Decl.Which = Right.Adj.Decl.Which and then
Left.Adj.Decl.Var = Right.Adj.Decl.Var and then
Left.Adj.Number = Right.Adj.Number and then
Left.Adj.Of_Case < Right.Adj.Of_Case) or else
(Left.Adj.Decl.Which = Right.Adj.Decl.Which and then
Left.Adj.Decl.Var = Right.Adj.Decl.Var and then
Left.Adj.Number = Right.Adj.Number and then
Left.Adj.Of_Case = Right.Adj.Of_Case and then
Left.Adj.Gender < Right.Adj.Gender) or else
(Left.Adj.Decl.Which = Right.Adj.Decl.Which and then
Left.Adj.Decl.Var = Right.Adj.Decl.Var and then
Left.Adj.Number = Right.Adj.Number and then
Left.Adj.Of_Case = Right.Adj.Of_Case and then
Left.Adj.Gender = Right.Adj.Gender and then
Left.Adj.Comparison < Right.Adj.Comparison)
then
return True;
end if;
when Adv =>
return Left.Adv.Comparison < Right.Adv.Comparison;
when V =>
if (Left.Verb.Con.Which < Right.Verb.Con.Which) or else
(Left.Verb.Con.Which = Right.Verb.Con.Which and then
Left.Verb.Con.Var < Right.Verb.Con.Var) or else
(Left.Verb.Con.Which = Right.Verb.Con.Which and then
Left.Verb.Con.Var = Right.Verb.Con.Var and then
Left.Verb.Number < Right.Verb.Number) or else
(Left.Verb.Con.Which = Right.Verb.Con.Which and then
Left.Verb.Con.Var = Right.Verb.Con.Var and then
Left.Verb.Number = Right.Verb.Number and then
Left.Verb.Tense_Voice_Mood.Tense <
Right.Verb.Tense_Voice_Mood.Tense) or else
(Left.Verb.Con.Which = Right.Verb.Con.Which and then
Left.Verb.Con.Var = Right.Verb.Con.Var and then
Left.Verb.Number = Right.Verb.Number and then
Left.Verb.Tense_Voice_Mood.Tense =
Right.Verb.Tense_Voice_Mood.Tense and then
Left.Verb.Tense_Voice_Mood.Voice <
Right.Verb.Tense_Voice_Mood.Voice) or else
(Left.Verb.Con.Which = Right.Verb.Con.Which and then
Left.Verb.Con.Var = Right.Verb.Con.Var and then
Left.Verb.Number = Right.Verb.Number and then
Left.Verb.Tense_Voice_Mood.Tense =
Right.Verb.Tense_Voice_Mood.Tense and then
Left.Verb.Tense_Voice_Mood.Voice =
Right.Verb.Tense_Voice_Mood.Voice and then
Left.Verb.Tense_Voice_Mood.Mood <
Right.Verb.Tense_Voice_Mood.Mood) or else
(Left.Verb.Con.Which = Right.Verb.Con.Which and then
Left.Verb.Con.Var = Right.Verb.Con.Var and then
Left.Verb.Number = Right.Verb.Number and then
Left.Verb.Tense_Voice_Mood.Tense =
Right.Verb.Tense_Voice_Mood.Tense and then
Left.Verb.Tense_Voice_Mood.Voice =
Right.Verb.Tense_Voice_Mood.Voice and then
Left.Verb.Tense_Voice_Mood.Mood =
Right.Verb.Tense_Voice_Mood.Mood and then
Left.Verb.Person < Right.Verb.Person)
then
return True;
end if;
when Vpar =>
if Left.Vpar.Con.Which < Right.Vpar.Con.Which or else
(Left.Vpar.Con.Which = Right.Vpar.Con.Which and then
Left.Vpar.Con.Var < Right.Vpar.Con.Var) or else
(Left.Vpar.Con.Which = Right.Vpar.Con.Which and then
Left.Vpar.Con.Var = Right.Vpar.Con.Var and then
Left.Vpar.Number < Right.Vpar.Number) or else
(Left.Vpar.Con.Which = Right.Vpar.Con.Which and then
Left.Vpar.Con.Var = Right.Vpar.Con.Var and then
Left.Vpar.Number = Right.Vpar.Number and then
Left.Vpar.Of_Case < Right.Vpar.Of_Case) or else
(Left.Vpar.Con.Which = Right.Vpar.Con.Which and then
Left.Vpar.Con.Var = Right.Vpar.Con.Var and then
Left.Vpar.Number = Right.Vpar.Number and then
Left.Vpar.Of_Case = Right.Vpar.Of_Case and then
Left.Vpar.Gender < Right.Vpar.Gender)
then
return True;
end if;
when Supine =>
if Left.Supine.Con.Which < Right.Supine.Con.Which or else
(Left.Supine.Con.Which = Right.Supine.Con.Which and then
Left.Supine.Con.Var < Right.Supine.Con.Var) or else
(Left.Supine.Con.Which = Right.Supine.Con.Which and then
Left.Supine.Con.Var = Right.Supine.Con.Var and then
Left.Supine.Number < Right.Supine.Number) or else
(Left.Supine.Con.Which = Right.Supine.Con.Which and then
Left.Supine.Con.Var = Right.Supine.Con.Var and then
Left.Supine.Number = Right.Supine.Number and then
Left.Supine.Of_Case < Right.Supine.Of_Case) or else
(Left.Supine.Con.Which = Right.Supine.Con.Which and then
Left.Supine.Con.Var = Right.Supine.Con.Var and then
Left.Supine.Number = Right.Supine.Number and then
Left.Supine.Of_Case = Right.Supine.Of_Case and then
Left.Supine.Gender < Right.Supine.Gender)
then
return True;
end if;
when Prep =>
return Left.Prep.Of_Case < Right.Prep.Of_Case;
when Conj =>
null;
when Interj =>
null;
when Num =>
if Left.Num.Decl.Which < Right.Num.Decl.Which or else
(Left.Num.Decl.Which = Right.Num.Decl.Which and then
Left.Num.Decl.Var < Right.Num.Decl.Var) or else
(Left.Num.Decl.Which = Right.Num.Decl.Which and then
Left.Num.Decl.Var = Right.Num.Decl.Var and then
Left.Num.Number < Right.Num.Number) or else
(Left.Num.Decl.Which = Right.Num.Decl.Which and then
Left.Num.Decl.Var = Right.Num.Decl.Var and then
Left.Num.Number = Right.Num.Number and then
Left.Num.Of_Case < Right.Num.Of_Case) or else
(Left.Num.Decl.Which = Right.Num.Decl.Which and then
Left.Num.Decl.Var = Right.Num.Decl.Var and then
Left.Num.Number = Right.Num.Number and then
Left.Num.Of_Case = Right.Num.Of_Case and then
Left.Num.Gender < Right.Num.Gender) or else
(Left.Num.Decl.Which = Right.Num.Decl.Which and then
Left.Num.Decl.Var = Right.Num.Decl.Var and then
Left.Num.Number = Right.Num.Number and then
Left.Num.Of_Case = Right.Num.Of_Case and then
Left.Num.Gender = Right.Num.Gender and then
Left.Num.Sort < Right.Num.Sort)
then
return True;
end if;
when Tackon .. Suffix =>
null;
when X =>
null;
end case;
else
return Left.Pofs < Right.Pofs;
end if;
return False;
exception
when Constraint_Error =>
return Left.Pofs < Right.Pofs;
end "<";
overriding function "<="
(Left, Right : Part_Of_Speech_Type)
return Boolean is
begin
if Right = Left or else
(Left = Pack and Right = Pron) or else
Right = X
then
return True;
else
return False;
end if;
end "<=";
function "<="
(Left, Right : Decn_Record)
return Boolean is
begin
if Right = Left or else
(Right = Decn_Record'(0, 0) and Left.Which /= 9) or else
Right = Decn_Record'(Left.Which, 0)
then
return True;
else
return False;
end if;
end "<=";
overriding function "<="
(Left, Right : Gender_Type)
return Boolean is
begin
if Right = Left or else
Right = X or else
(Right = C and then (Left = M or Left = F))
then
return True;
else
return False;
end if;
end "<=";
overriding function "<="
(Left, Right : Case_Type)
return Boolean is
begin
if Right = Left or else Right = X then
return True;
else
return False;
end if;
end "<=";
overriding function "<="
(Left, Right : Number_Type)
return Boolean is
begin
if Right = Left or else Right = X then
return True;
else
return False;
end if;
end "<=";
overriding function "<=" (Left, Right : Person_Type) return Boolean is
begin
if Right = Left or else Right = 0 then
return True;
else
return False;
end if;
end "<=";
overriding function "<=" (Left, Right : Comparison_Type) return Boolean is
begin
if Right = Left or else Right = X then
return True;
else
return False;
end if;
end "<=";
function "<=" (Left, Right : Tense_Voice_Mood_Record) return Boolean is
begin
if (Right.Tense = Left.Tense or else Right.Tense = X) and then
(Right.Voice = Left.Voice or else Right.Voice = X) and then
(Right.Mood = Left.Mood or else Right.Mood = X)
then
return True;
else
return False;
end if;
end "<=";
overriding function "<=" (Left, Right : Noun_Kind_Type) return Boolean is
begin
if Right = Left or else Right = X then
return True;
else
return False;
end if;
end "<=";
overriding function "<="
(Left, Right : Pronoun_Kind_Type)
return Boolean is
begin
if Right = Left or else Right = X then
return True;
else
return False;
end if;
end "<=";
overriding function "<=" (Left, Right : Stem_Key_Type) return Boolean is
begin -- Only works for 2 stem parts, not verbs
if Right = Left or else Right = 0 then
return True;
else
return False;
end if;
end "<=";
overriding function "<=" (Left, Right : Age_Type) return Boolean is
begin
if Right = Left or else Right = X then
return True;
else
return False;
end if;
end "<=";
overriding function "<=" (Left, Right : Frequency_Type) return Boolean is
begin
if Right = Left or else Right = X then
return True;
else
return False;
end if;
end "<=";
---------------------------------------------------------------------------
package body Stem_Type_IO is separate;
package body Decn_Record_IO is separate;
package body Tense_Voice_Mood_Record_IO is separate;
package body Noun_Record_IO is separate;
package body Pronoun_Record_IO is separate;
package body Propack_Record_IO is separate;
package body Adjective_Record_IO is separate;
package body Numeral_Record_IO is separate;
package body Adverb_Record_IO is separate;
package body Verb_Record_IO is separate;
package body Vpar_Record_IO is separate;
package body Supine_Record_IO is separate;
package body Preposition_Record_IO is separate;
package body Conjunction_Record_IO is separate;
package body Interjection_Record_IO is separate;
package body Tackon_Record_IO is separate;
package body Prefix_Record_IO is separate;
package body Suffix_Record_IO is separate;
package body Quality_Record_IO is separate;
package body Ending_Record_IO is separate;
package body Inflection_Record_IO is separate;
---------------------------------------------------------------------------
procedure Establish_Inflections_Section is
-- Loads the inflection array from the file prepared in
-- FILE_INFLECTIONS_SECTION
-- If N = 0 (an artificial flag for the section for blank
-- inflections = 5)
-- computes the LELL .. LELF indices for use in WORD
use Lel_Section_Io;
procedure Load_Lel_Indexes is
-- Load arrays from file
I : Integer := 0;
N, Xn : Integer := 0;
Ch, Xch : Character := ' ';
Inflections_Sections_File : Lel_Section_Io.File_Type;
-- FIXME: This enumeration and its values should be changed to
-- something more meaningful.
type Paradigm is (P1, P2, P3, P4, P5);
procedure Read_Inflections (P : Paradigm)
is
Count : constant Integer := Paradigm'Pos (P) + 1;
begin
if P /= P5 then
Lel_Section_Io.Read (Inflections_Sections_File,
Lel,
Lel_Section_Io.Positive_Count (Count));
I := 1;
end if;
N := Lel (I).Ending.Size;
Ch := Lel (I).Ending.Suf (N);
Xn := N;
Xch := Ch;
if P /= P5 then
Lelf (N, Ch) := I;
else
Pelf (N, Ch) := I;
Pell (N, Ch) := 0;
end if;
C1_Loop :
loop
N1_Loop :
loop
case P is
when P1 | P2 | P3 | P5 =>
exit C1_Loop when Lel (I) = Null_Inflection_Record;
when P4 =>
exit C1_Loop when Lel (I).Qual.Pofs = Pron and then
(Lel (I).Qual.Pron.Decl.Which = 1 or
Lel (I).Qual.Pron.Decl.Which = 2);
end case;
N := Lel (I).Ending.Size;
Ch := Lel (I).Ending.Suf (N);
case P is
when P1 | P4 | P5 =>
null;
when P2 =>
exit N1_Loop when Ch > 'r';
when P3 =>
exit N1_Loop when Ch > 's';
end case;
if P /= P5 then
if Ch /= Xch then
Lell (Xn, Xch) := I - 1;
Lelf (N, Ch) := I;
Lell (N, Ch) := 0;
Xch := Ch;
Xn := N;
elsif N /= Xn then
Lell (Xn, Ch) := I - 1;
Lelf (N, Ch) := I;
Lell (N, Ch) := 0;
Xn := N;
exit N1_Loop;
end if;
else
if Ch /= Xch then
Pell (Xn, Xch) := I - 1;
Pelf (N, Ch) := I;
Pell (N, Ch) := 0;
Xch := Ch;
Xn := N;
elsif N /= Xn then
Pell (Xn, Ch) := I - 1;
Pelf (N, Ch) := I;
Pell (N, Ch) := 0;
Xn := N;
exit N1_Loop;
end if;
end if;
I := I + 1;
end loop N1_Loop;
end loop C1_Loop;
if P /= P5 then
Lell (Xn, Xch) := I - 1;
end if;
end Read_Inflections;
begin
Open (Inflections_Sections_File, In_File,
Latin_Utils.Config.Path (Inflections_Sections_Name));
Number_Of_Inflections := 0;
Lel_Section_Io.Read (Inflections_Sections_File,
Lel,
Lel_Section_Io.Positive_Count (5));
I := 1;
Belf (0, ' ') := I;
Bell (0, ' ') := 0;
loop
exit when Lel (I) = Null_Inflection_Record;
Bel (I) := Lel (I);
Bell (0, ' ') := I;
I := I + 1;
end loop;
for K in Paradigm'Range loop
if K /= P5 then
Number_Of_Inflections := Number_Of_Inflections + I - 1;
end if;
Read_Inflections (K);
end loop;
Pell (Xn, Xch) := I - 1;
Number_Of_Inflections := Number_Of_Inflections + I - 1;
Close (Inflections_Sections_File);
end Load_Lel_Indexes;
begin
--Preface.Put ("INFLECTION_ARRAY being loaded");
--Preface.Set_Col (33);
Load_Lel_Indexes; -- Makes indexes from array
--Preface.Put (Number_Of_Inflections, 6);
--Preface.Put (" entries");
--Preface.Set_Col (55); Preface.Put_Line ("-- Loaded correctly");
exception
when Ada.Text_IO.Name_Error =>
New_Line;
Put_Line ("There is no " & Inflections_Sections_Name & " file.");
Put_Line ("The program cannot work without one.");
Put_Line ("Make sure you are in the"
& " subdirectory containing the files");
Put_Line ("for inflections, dictionary, addons and uniques.");
raise Give_Up;
end Establish_Inflections_Section;
begin
-- initialization of body of INFLECTIONS_PACKAGE
Part_Of_Speech_Type_IO.Default_Width := Part_Of_Speech_Type'Width;
Gender_Type_IO.Default_Width := Gender_Type'Width;
Case_Type_IO.Default_Width := Case_Type'Width;
Number_Type_IO.Default_Width := Number_Type'Width;
Person_Type_IO.Default_Width := 1;
Comparison_Type_IO.Default_Width := Comparison_Type'Width;
Tense_Type_IO.Default_Width := Tense_Type'Width;
Voice_Type_IO.Default_Width := Voice_Type'Width;
Mood_Type_IO.Default_Width := Mood_Type'Width;
Numeral_Sort_Type_IO.Default_Width := Numeral_Sort_Type'Width;
end Latin_Utils.Inflections_Package;
|
------------------------------------------------------------------------------
-- 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 Asis.Gela.Elements.Assoc;
with Asis.Gela.Elements.Helpers;
package body Asis.Gela.Parser_Utils is
----------------
-- Init_Token --
----------------
procedure Init_Token
(Element : in out Elements.Helpers.Token_Node;
Line : in Positive;
Column : in Positive;
Length : in Positive;
Image : in Gela_String)
is
use Asis.Gela.Elements.Helpers;
begin
Set_Start_Position (Element, (Line, Column - Length));
Set_End_Position (Element, (Line, Column - 1));
Set_Raw_Image (Element, Image);
end Init_Token;
-------------------
-- Push_Argument --
-------------------
procedure Push_Argument
(Call : in out Elements.Expr.Function_Call_Node;
Arg : in Asis.Element)
is
use Asis.Gela.Elements.Expr;
use Asis.Gela.Elements.Assoc;
Assoc : constant Asis.Association := Function_Call_Parameters (Call) (1);
Node : Parameter_Association_Node renames
Parameter_Association_Node (Assoc.all);
Left : constant Asis.Element := Actual_Parameter (Assoc.all);
begin
Set_Start_Position (Node, Start_Position (Arg.all));
Set_Start_Position (Call, Start_Position (Arg.all));
if Assigned (Left) then
Push_Argument
(Call => Function_Call_Node (Left.all),
Arg => Arg);
else
Set_Actual_Parameter (Node, Arg);
Set_End_Position (Node, End_Position (Arg.all));
end if;
end Push_Argument;
-------------------
-- Push_Argument --
-------------------
procedure Push_Argument
(Call : in out Elements.Expr.Base_Short_Circuit_Node'Class;
Arg : in Asis.Element)
is
use Asis.Gela.Elements.Expr;
Left : constant Asis.Element :=
Short_Circuit_Operation_Left_Expression (Call);
begin
if Assigned (Left) then
Push_Argument
(Call => Base_Short_Circuit_Node'Class (Left.all),
Arg => Arg);
else
Set_Short_Circuit_Operation_Left_Expression (Call, Arg);
end if;
Set_Start_Position (Call, Start_Position (Arg.all));
end Push_Argument;
end Asis.Gela.Parser_Utils;
------------------------------------------------------------------------------
-- 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.
------------------------------------------------------------------------------
|
------------------------------------------------------------------------------
-- --
-- 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.
------------------------------------------------------------------------------
-- An extension point identifies a point in the behavior of a use case where
-- that behavior can be extended by the behavior of some other (extending)
-- use case, as specified by an extend relationship.
------------------------------------------------------------------------------
with AMF.UML.Redefinable_Elements;
limited with AMF.UML.Use_Cases;
package AMF.UML.Extension_Points is
pragma Preelaborate;
type UML_Extension_Point is limited interface
and AMF.UML.Redefinable_Elements.UML_Redefinable_Element;
type UML_Extension_Point_Access is
access all UML_Extension_Point'Class;
for UML_Extension_Point_Access'Storage_Size use 0;
not overriding function Get_Use_Case
(Self : not null access constant UML_Extension_Point)
return AMF.UML.Use_Cases.UML_Use_Case_Access is abstract;
-- Getter of ExtensionPoint::useCase.
--
-- References the use case that owns this extension point.
not overriding procedure Set_Use_Case
(Self : not null access UML_Extension_Point;
To : AMF.UML.Use_Cases.UML_Use_Case_Access) is abstract;
-- Setter of ExtensionPoint::useCase.
--
-- References the use case that owns this extension point.
end AMF.UML.Extension_Points;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Tools Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 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 Asis;
with Engines.Contexts;
with League.Strings;
package Properties.Expressions.Attribute_Reference is
function Code
(Engine : access Engines.Contexts.Context;
Element : Asis.Expression;
Name : Engines.Text_Property) return League.Strings.Universal_String;
function Call_Convention
(Engine : access Engines.Contexts.Context;
Element : Asis.Declaration;
Name : Engines.Convention_Property)
return Engines.Convention_Kind;
function Intrinsic_Name
(Engine : access Engines.Contexts.Context;
Element : Asis.Declaration;
Name : Engines.Text_Property) return League.Strings.Universal_String;
end Properties.Expressions.Attribute_Reference;
|
------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding Samples --
-- --
-- Rain --
-- --
-- S P E C --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 1998 Free Software Foundation, Inc. --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, distribute with modifications, sublicense, and/or sell --
-- copies of the Software, and to permit persons to whom the Software is --
-- furnished to do so, subject to the following conditions: --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, --
-- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR --
-- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR --
-- THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
-- --
-- Except as contained in this notice, the name(s) of the above copyright --
-- holders shall not be used in advertising or otherwise to promote the --
-- sale, use or other dealings in this Software without prior written --
-- authorization. --
------------------------------------------------------------------------------
-- Author: Laurent Pautet <pautet@gnat.com>
-- Modified by: Juergen Pfeifer, 1997
-- Version Control
-- $Revision: 1.6 $
-- Binding Version 01.00
------------------------------------------------------------------------------
-- --
procedure Rain;
|
with AWS.Config.Set;
with AWS.Server;
with @_Project_Name_@.Callbacks;
procedure @_Project_Name_@.Main is
use AWS;
Web_Server : Server.HTTP;
Web_Config : Config.Object;
begin
-- Setup
Config.Set.Server_Host (Web_Config, Host);
Config.Set.Server_Port (Web_Config, Port);
-- Start the server
Server.Start (Web_Server, Callbacks.Default'Access, Web_Config);
-- Wait for the Q key
Server.Wait (Server.Q_Key_Pressed);
-- Stop the server
Server.Shutdown (Web_Server);
end @_Project_Name_@.Main;
|
<?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>checkAxis_0</name>
<ret_bitwidth>64</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>edge_p1_x</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>edge_p1_y</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>edge_p1_z</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_4">
<Value>
<Obj>
<type>1</type>
<id>4</id>
<name>edge_p2_x</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_5">
<Value>
<Obj>
<type>1</type>
<id>5</id>
<name>edge_p2_y</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_6">
<Value>
<Obj>
<type>1</type>
<id>6</id>
<name>edge_p2_z</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>88</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>edge_p2_z_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>117</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second class_id="11" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="12" tracking_level="0" version="0">
<first class_id="13" tracking_level="0" version="0">
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>117</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>106</item>
<item>107</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>edge_p2_y_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>117</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>117</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>108</item>
<item>109</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>edge_p2_x_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>117</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>117</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>110</item>
<item>111</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>edge_p1_z_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>117</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>117</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>112</item>
<item>113</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>edge_p1_y_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>117</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>117</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>114</item>
<item>115</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>edge_p1_x_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>117</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>117</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>116</item>
<item>117</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>call_ret9</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>117</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>117</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>96</bitwidth>
</Value>
<oprand_edges>
<count>8</count>
<item_version>0</item_version>
<item>119</item>
<item>120</item>
<item>121</item>
<item>122</item>
<item>123</item>
<item>124</item>
<item>125</item>
<item>127</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.58</m_delay>
<m_topoIndex>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>p_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>117</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>117</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>128</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>11</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>p_s</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>117</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>117</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>129</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>p_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>117</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>117</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>130</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>13</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>tmp_s</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>119</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>119</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>10</count>
<item_version>0</item_version>
<item>132</item>
<item>133</item>
<item>134</item>
<item>135</item>
<item>136</item>
<item>137</item>
<item>138</item>
<item>139</item>
<item>140</item>
<item>141</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>4.19</m_delay>
<m_topoIndex>23</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>_ln119</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>119</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>119</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>142</item>
<item>143</item>
<item>144</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.46</m_delay>
<m_topoIndex>27</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>i_assign</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>121</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>146</item>
<item>147</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>7.59</m_delay>
<m_topoIndex>28</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>k_assign</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>121</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>k</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>148</item>
<item>149</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>7.59</m_delay>
<m_topoIndex>29</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>shl_ln80</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>80</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>80</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>150</item>
<item>152</item>
</oprand_edges>
<opcode>shl</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>39</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>add_ln80</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>80</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>80</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>153</item>
<item>154</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.89</m_delay>
<m_topoIndex>40</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>zext_ln121</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>121</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</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>155</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>41</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>shl_ln121</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>121</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</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>157</item>
<item>158</item>
</oprand_edges>
<opcode>shl</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>42</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>add_ln80_18</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>80</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>80</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>160</item>
<item>161</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>43</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>add_ln80_19</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>80</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>80</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>162</item>
<item>163</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.58</m_delay>
<m_topoIndex>44</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>zext_ln122</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>122</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>164</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>45</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>shl_ln122</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>122</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>165</item>
<item>166</item>
</oprand_edges>
<opcode>shl</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>46</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>or_ln122</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>122</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>167</item>
<item>168</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.93</m_delay>
<m_topoIndex>47</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>_ln123</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>123</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>123</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>169</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.46</m_delay>
<m_topoIndex>48</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>collisions_load_0</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>122</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>170</item>
<item>171</item>
<item>173</item>
<item>174</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>49</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>call_ret9_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>117</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>117</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>96</bitwidth>
</Value>
<oprand_edges>
<count>8</count>
<item_version>0</item_version>
<item>175</item>
<item>176</item>
<item>177</item>
<item>178</item>
<item>179</item>
<item>180</item>
<item>181</item>
<item>183</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.58</m_delay>
<m_topoIndex>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>p_01_0_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>117</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>117</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>184</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>14</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>p_12_0_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>117</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>117</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>185</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>15</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>p_23_0_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>117</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>117</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>186</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>16</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>tmp_43_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>119</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>119</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>10</count>
<item_version>0</item_version>
<item>187</item>
<item>188</item>
<item>189</item>
<item>190</item>
<item>191</item>
<item>192</item>
<item>193</item>
<item>194</item>
<item>195</item>
<item>196</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>4.19</m_delay>
<m_topoIndex>24</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>_ln119</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>119</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>119</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>197</item>
<item>198</item>
<item>199</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.46</m_delay>
<m_topoIndex>30</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>i_assign_4</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>121</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>200</item>
<item>201</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>7.59</m_delay>
<m_topoIndex>31</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>k_assign_4</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>121</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>k</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>202</item>
<item>203</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>7.59</m_delay>
<m_topoIndex>32</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>shl_ln80_11</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>80</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>80</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>204</item>
<item>205</item>
</oprand_edges>
<opcode>shl</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>50</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>or_ln80</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>80</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>80</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>206</item>
<item>207</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>51</m_topoIndex>
<m_clusterGroupNumber>2</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>add_ln80_20</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>80</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>80</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>208</item>
<item>209</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.89</m_delay>
<m_topoIndex>52</m_topoIndex>
<m_clusterGroupNumber>2</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>zext_ln121_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>121</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</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>210</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>53</m_topoIndex>
<m_clusterGroupNumber>3</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>shl_ln121_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>121</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</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>211</item>
<item>212</item>
</oprand_edges>
<opcode>shl</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>54</m_topoIndex>
<m_clusterGroupNumber>3</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name>add_ln80_21</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>80</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>80</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>213</item>
<item>214</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.89</m_delay>
<m_topoIndex>55</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>zext_ln122_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>122</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>215</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>56</m_topoIndex>
<m_clusterGroupNumber>3</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name>shl_ln122_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>122</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>216</item>
<item>217</item>
</oprand_edges>
<opcode>shl</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>57</m_topoIndex>
<m_clusterGroupNumber>3</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>or_ln122_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>122</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>218</item>
<item>219</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.93</m_delay>
<m_topoIndex>58</m_topoIndex>
<m_clusterGroupNumber>3</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>_ln123</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>123</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>123</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>220</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.46</m_delay>
<m_topoIndex>59</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>collisions_load_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>122</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>221</item>
<item>222</item>
<item>223</item>
<item>224</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>60</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>call_ret9_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>117</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>117</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>96</bitwidth>
</Value>
<oprand_edges>
<count>8</count>
<item_version>0</item_version>
<item>225</item>
<item>226</item>
<item>227</item>
<item>228</item>
<item>229</item>
<item>230</item>
<item>231</item>
<item>233</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.58</m_delay>
<m_topoIndex>9</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>p_01_0_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>117</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>117</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>234</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>17</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name>p_12_0_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>117</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>117</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>235</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>18</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name>p_23_0_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>117</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>117</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>236</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>19</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name>tmp_43_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>119</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>119</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>10</count>
<item_version>0</item_version>
<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>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>4.19</m_delay>
<m_topoIndex>25</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>61</id>
<name>_ln119</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>119</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>119</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>247</item>
<item>248</item>
<item>249</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.46</m_delay>
<m_topoIndex>33</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name>i_assign_5</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>121</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>250</item>
<item>251</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>7.59</m_delay>
<m_topoIndex>34</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>k_assign_5</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>121</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>k</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>252</item>
<item>253</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>7.59</m_delay>
<m_topoIndex>35</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>65</id>
<name>shl_ln80_12</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>80</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>80</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>254</item>
<item>255</item>
</oprand_edges>
<opcode>shl</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>61</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>66</id>
<name>or_ln80_5</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>80</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>80</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>256</item>
<item>258</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>62</m_topoIndex>
<m_clusterGroupNumber>4</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>67</id>
<name>add_ln80_22</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>80</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>80</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>259</item>
<item>260</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.89</m_delay>
<m_topoIndex>63</m_topoIndex>
<m_clusterGroupNumber>4</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>68</id>
<name>zext_ln121_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>121</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</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>261</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>64</m_topoIndex>
<m_clusterGroupNumber>5</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_63">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name>shl_ln121_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>121</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</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>262</item>
<item>263</item>
</oprand_edges>
<opcode>shl</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>65</m_topoIndex>
<m_clusterGroupNumber>5</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_64">
<Value>
<Obj>
<type>0</type>
<id>70</id>
<name>or_ln80_6</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>80</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>80</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>264</item>
<item>265</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>66</m_topoIndex>
<m_clusterGroupNumber>6</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_65">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name>add_ln80_23</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>80</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>80</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>266</item>
<item>267</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.89</m_delay>
<m_topoIndex>67</m_topoIndex>
<m_clusterGroupNumber>6</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_66">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name>zext_ln122_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>122</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>268</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>68</m_topoIndex>
<m_clusterGroupNumber>5</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_67">
<Value>
<Obj>
<type>0</type>
<id>73</id>
<name>shl_ln122_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>122</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>269</item>
<item>270</item>
</oprand_edges>
<opcode>shl</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>69</m_topoIndex>
<m_clusterGroupNumber>5</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_68">
<Value>
<Obj>
<type>0</type>
<id>74</id>
<name>or_ln122_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>122</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>271</item>
<item>272</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.93</m_delay>
<m_topoIndex>70</m_topoIndex>
<m_clusterGroupNumber>5</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_69">
<Value>
<Obj>
<type>0</type>
<id>75</id>
<name>_ln123</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>123</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>123</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>273</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.46</m_delay>
<m_topoIndex>71</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_70">
<Value>
<Obj>
<type>0</type>
<id>77</id>
<name>collisions_load_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>122</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>285</item>
<item>286</item>
<item>287</item>
<item>288</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>72</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_71">
<Value>
<Obj>
<type>0</type>
<id>78</id>
<name>call_ret9_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>117</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>117</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>96</bitwidth>
</Value>
<oprand_edges>
<count>8</count>
<item_version>0</item_version>
<item>289</item>
<item>290</item>
<item>291</item>
<item>292</item>
<item>293</item>
<item>294</item>
<item>295</item>
<item>297</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.58</m_delay>
<m_topoIndex>10</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_72">
<Value>
<Obj>
<type>0</type>
<id>79</id>
<name>p_01_0_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>117</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>117</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>298</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>20</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_73">
<Value>
<Obj>
<type>0</type>
<id>80</id>
<name>p_12_0_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>117</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>117</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>299</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>21</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_74">
<Value>
<Obj>
<type>0</type>
<id>81</id>
<name>p_23_0_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>117</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>117</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>300</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>22</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_75">
<Value>
<Obj>
<type>0</type>
<id>82</id>
<name>tmp_43_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>119</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>119</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>10</count>
<item_version>0</item_version>
<item>301</item>
<item>302</item>
<item>303</item>
<item>304</item>
<item>305</item>
<item>306</item>
<item>307</item>
<item>308</item>
<item>309</item>
<item>310</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>4.19</m_delay>
<m_topoIndex>26</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_76">
<Value>
<Obj>
<type>0</type>
<id>83</id>
<name>_ln119</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>119</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>119</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>311</item>
<item>312</item>
<item>313</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.46</m_delay>
<m_topoIndex>36</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_77">
<Value>
<Obj>
<type>0</type>
<id>85</id>
<name>i_assign_6</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>121</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>314</item>
<item>315</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>7.59</m_delay>
<m_topoIndex>37</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_78">
<Value>
<Obj>
<type>0</type>
<id>86</id>
<name>k_assign_6</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>121</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>k</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>316</item>
<item>317</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>7.59</m_delay>
<m_topoIndex>38</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_79">
<Value>
<Obj>
<type>0</type>
<id>87</id>
<name>shl_ln80_13</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>80</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>80</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>318</item>
<item>319</item>
</oprand_edges>
<opcode>shl</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>73</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_80">
<Value>
<Obj>
<type>0</type>
<id>88</id>
<name>or_ln80_7</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>80</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>80</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>320</item>
<item>322</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>74</m_topoIndex>
<m_clusterGroupNumber>7</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_81">
<Value>
<Obj>
<type>0</type>
<id>89</id>
<name>add_ln80_24</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>80</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>80</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>323</item>
<item>324</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.89</m_delay>
<m_topoIndex>75</m_topoIndex>
<m_clusterGroupNumber>7</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_82">
<Value>
<Obj>
<type>0</type>
<id>90</id>
<name>zext_ln121_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>121</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</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>325</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>76</m_topoIndex>
<m_clusterGroupNumber>8</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_83">
<Value>
<Obj>
<type>0</type>
<id>91</id>
<name>shl_ln121_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>121</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>121</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>326</item>
<item>327</item>
</oprand_edges>
<opcode>shl</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>77</m_topoIndex>
<m_clusterGroupNumber>8</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_84">
<Value>
<Obj>
<type>0</type>
<id>92</id>
<name>or_ln80_8</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>80</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>80</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>328</item>
<item>329</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>78</m_topoIndex>
<m_clusterGroupNumber>9</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_85">
<Value>
<Obj>
<type>0</type>
<id>93</id>
<name>add_ln80_25</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>80</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>80</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>330</item>
<item>331</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.89</m_delay>
<m_topoIndex>79</m_topoIndex>
<m_clusterGroupNumber>9</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_86">
<Value>
<Obj>
<type>0</type>
<id>94</id>
<name>zext_ln122_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>122</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>332</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>80</m_topoIndex>
<m_clusterGroupNumber>8</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_87">
<Value>
<Obj>
<type>0</type>
<id>95</id>
<name>shl_ln122_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>122</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>333</item>
<item>334</item>
</oprand_edges>
<opcode>shl</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>81</m_topoIndex>
<m_clusterGroupNumber>8</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_88">
<Value>
<Obj>
<type>0</type>
<id>96</id>
<name>or_ln122_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>122</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>335</item>
<item>336</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.93</m_delay>
<m_topoIndex>82</m_topoIndex>
<m_clusterGroupNumber>8</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_89">
<Value>
<Obj>
<type>0</type>
<id>97</id>
<name>_ln123</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>123</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>123</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>337</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.46</m_delay>
<m_topoIndex>83</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_90">
<Value>
<Obj>
<type>0</type>
<id>99</id>
<name>collisions_load_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>122</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>274</item>
<item>275</item>
<item>276</item>
<item>277</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>84</m_topoIndex>
<m_clusterGroupNumber>10</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_91">
<Value>
<Obj>
<type>0</type>
<id>100</id>
<name>or_ln139</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>139</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>139</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>278</item>
<item>279</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>85</m_topoIndex>
<m_clusterGroupNumber>10</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_92">
<Value>
<Obj>
<type>0</type>
<id>101</id>
<name>or_ln139_4</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>139</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>139</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>280</item>
<item>281</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>86</m_topoIndex>
<m_clusterGroupNumber>10</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_93">
<Value>
<Obj>
<type>0</type>
<id>102</id>
<name>or_ln139_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>139</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>139</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>282</item>
<item>283</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>87</m_topoIndex>
<m_clusterGroupNumber>10</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_94">
<Value>
<Obj>
<type>0</type>
<id>103</id>
<name>_ln141</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>141</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>141</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>284</item>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>88</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>13</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_95">
<Value>
<Obj>
<type>2</type>
<id>118</id>
<name>lineIntersectsPlane</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>96</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:lineIntersectsPlane></content>
</item>
<item class_id_reference="16" object_id="_96">
<Value>
<Obj>
<type>2</type>
<id>126</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>1</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_97">
<Value>
<Obj>
<type>2</type>
<id>131</id>
<name>pointOnSegment</name>
<fileName></fileName>
<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>6</const_type>
<content><constant:pointOnSegment></content>
</item>
<item class_id_reference="16" object_id="_98">
<Value>
<Obj>
<type>2</type>
<id>145</id>
<name>p_hls_fptosi_float_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>
<bitwidth>32</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:__hls_fptosi_float_i></content>
</item>
<item class_id_reference="16" object_id="_99">
<Value>
<Obj>
<type>2</type>
<id>151</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="_100">
<Value>
<Obj>
<type>2</type>
<id>156</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_101">
<Value>
<Obj>
<type>2</type>
<id>159</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>4294967292</content>
</item>
<item class_id_reference="16" object_id="_102">
<Value>
<Obj>
<type>2</type>
<id>172</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="_103">
<Value>
<Obj>
<type>2</type>
<id>182</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>1</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_104">
<Value>
<Obj>
<type>2</type>
<id>232</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>1</const_type>
<content>2</content>
</item>
<item class_id_reference="16" object_id="_105">
<Value>
<Obj>
<type>2</type>
<id>257</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="_106">
<Value>
<Obj>
<type>2</type>
<id>296</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>1</const_type>
<content>3</content>
</item>
<item class_id_reference="16" object_id="_107">
<Value>
<Obj>
<type>2</type>
<id>321</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>12</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_108">
<Obj>
<type>3</type>
<id>20</id>
<name>meminst.0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>12</count>
<item_version>0</item_version>
<item>8</item>
<item>9</item>
<item>10</item>
<item>11</item>
<item>12</item>
<item>13</item>
<item>14</item>
<item>15</item>
<item>16</item>
<item>17</item>
<item>18</item>
<item>19</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_109">
<Obj>
<type>3</type>
<id>33</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>12</count>
<item_version>0</item_version>
<item>21</item>
<item>22</item>
<item>23</item>
<item>24</item>
<item>25</item>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_110">
<Obj>
<type>3</type>
<id>41</id>
<name>._crit_edge20.0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>7</count>
<item_version>0</item_version>
<item>34</item>
<item>35</item>
<item>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
<item>40</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_111">
<Obj>
<type>3</type>
<id>54</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>12</count>
<item_version>0</item_version>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
<item>46</item>
<item>47</item>
<item>48</item>
<item>49</item>
<item>50</item>
<item>51</item>
<item>52</item>
<item>53</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_112">
<Obj>
<type>3</type>
<id>62</id>
<name>._crit_edge20.1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>7</count>
<item_version>0</item_version>
<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="_113">
<Obj>
<type>3</type>
<id>76</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>13</count>
<item_version>0</item_version>
<item>63</item>
<item>64</item>
<item>65</item>
<item>66</item>
<item>67</item>
<item>68</item>
<item>69</item>
<item>70</item>
<item>71</item>
<item>72</item>
<item>73</item>
<item>74</item>
<item>75</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_114">
<Obj>
<type>3</type>
<id>84</id>
<name>._crit_edge20.2</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>7</count>
<item_version>0</item_version>
<item>77</item>
<item>78</item>
<item>79</item>
<item>80</item>
<item>81</item>
<item>82</item>
<item>83</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_115">
<Obj>
<type>3</type>
<id>98</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>13</count>
<item_version>0</item_version>
<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>
</node_objs>
</item>
<item class_id_reference="18" object_id="_116">
<Obj>
<type>3</type>
<id>104</id>
<name>.preheader.preheader</name>
<fileName></fileName>
<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>99</item>
<item>100</item>
<item>101</item>
<item>102</item>
<item>103</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>225</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_117">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>8</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_118">
<id>109</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_119">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>10</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_120">
<id>113</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>11</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_121">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_122">
<id>117</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_123">
<id>119</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_124">
<id>120</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_125">
<id>121</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_126">
<id>122</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_127">
<id>123</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_128">
<id>124</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_129">
<id>125</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_130">
<id>127</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_131">
<id>128</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_132">
<id>129</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_133">
<id>130</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_134">
<id>132</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_135">
<id>133</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_136">
<id>134</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_137">
<id>135</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_138">
<id>136</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_139">
<id>137</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_140">
<id>138</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_141">
<id>139</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_142">
<id>140</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_143">
<id>141</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_144">
<id>142</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="_145">
<id>143</id>
<edge_type>2</edge_type>
<source_obj>41</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_146">
<id>144</id>
<edge_type>2</edge_type>
<source_obj>33</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_147">
<id>146</id>
<edge_type>1</edge_type>
<source_obj>145</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_148">
<id>147</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_149">
<id>148</id>
<edge_type>1</edge_type>
<source_obj>145</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_150">
<id>149</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_151">
<id>150</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_152">
<id>152</id>
<edge_type>1</edge_type>
<source_obj>151</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_153">
<id>153</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_154">
<id>154</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_155">
<id>155</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_156">
<id>157</id>
<edge_type>1</edge_type>
<source_obj>156</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_157">
<id>158</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_158">
<id>160</id>
<edge_type>1</edge_type>
<source_obj>159</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_159">
<id>161</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_160">
<id>162</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_161">
<id>163</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_162">
<id>164</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_163">
<id>165</id>
<edge_type>1</edge_type>
<source_obj>156</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_164">
<id>166</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_165">
<id>167</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="_166">
<id>168</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_167">
<id>169</id>
<edge_type>2</edge_type>
<source_obj>41</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_168">
<id>170</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_169">
<id>171</id>
<edge_type>2</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="_170">
<id>173</id>
<edge_type>1</edge_type>
<source_obj>172</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_171">
<id>174</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_172">
<id>175</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_173">
<id>176</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_174">
<id>177</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_175">
<id>178</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_176">
<id>179</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_177">
<id>180</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_178">
<id>181</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_179">
<id>183</id>
<edge_type>1</edge_type>
<source_obj>182</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_180">
<id>184</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_181">
<id>185</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_182">
<id>186</id>
<edge_type>1</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="_183">
<id>187</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_184">
<id>188</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_185">
<id>189</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_186">
<id>190</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_187">
<id>191</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_188">
<id>192</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_189">
<id>193</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_190">
<id>194</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_191">
<id>195</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_192">
<id>196</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_193">
<id>197</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="_194">
<id>198</id>
<edge_type>2</edge_type>
<source_obj>62</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_195">
<id>199</id>
<edge_type>2</edge_type>
<source_obj>54</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_196">
<id>200</id>
<edge_type>1</edge_type>
<source_obj>145</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_197">
<id>201</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_198">
<id>202</id>
<edge_type>1</edge_type>
<source_obj>145</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_199">
<id>203</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_200">
<id>204</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_201">
<id>205</id>
<edge_type>1</edge_type>
<source_obj>151</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_202">
<id>206</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_203">
<id>207</id>
<edge_type>1</edge_type>
<source_obj>151</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_204">
<id>208</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="_205">
<id>209</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_206">
<id>210</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_207">
<id>211</id>
<edge_type>1</edge_type>
<source_obj>156</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_208">
<id>212</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_209">
<id>213</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_210">
<id>214</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_211">
<id>215</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_212">
<id>216</id>
<edge_type>1</edge_type>
<source_obj>156</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_213">
<id>217</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_214">
<id>218</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_215">
<id>219</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_216">
<id>220</id>
<edge_type>2</edge_type>
<source_obj>62</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_217">
<id>221</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_218">
<id>222</id>
<edge_type>2</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="_219">
<id>223</id>
<edge_type>1</edge_type>
<source_obj>172</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_220">
<id>224</id>
<edge_type>2</edge_type>
<source_obj>41</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_221">
<id>225</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_222">
<id>226</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_223">
<id>227</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_224">
<id>228</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_225">
<id>229</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_226">
<id>230</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_227">
<id>231</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_228">
<id>233</id>
<edge_type>1</edge_type>
<source_obj>232</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_229">
<id>234</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="_230">
<id>235</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_231">
<id>236</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_232">
<id>237</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_233">
<id>238</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="_234">
<id>239</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_235">
<id>240</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_236">
<id>241</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_237">
<id>242</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_238">
<id>243</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_239">
<id>244</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_240">
<id>245</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_241">
<id>246</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_242">
<id>247</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_243">
<id>248</id>
<edge_type>2</edge_type>
<source_obj>84</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_244">
<id>249</id>
<edge_type>2</edge_type>
<source_obj>76</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_245">
<id>250</id>
<edge_type>1</edge_type>
<source_obj>145</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_246">
<id>251</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_247">
<id>252</id>
<edge_type>1</edge_type>
<source_obj>145</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_248">
<id>253</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_249">
<id>254</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_250">
<id>255</id>
<edge_type>1</edge_type>
<source_obj>151</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_251">
<id>256</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="_252">
<id>258</id>
<edge_type>1</edge_type>
<source_obj>257</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_253">
<id>259</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>67</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_254">
<id>260</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>67</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_255">
<id>261</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_256">
<id>262</id>
<edge_type>1</edge_type>
<source_obj>156</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_257">
<id>263</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="_258">
<id>264</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_259">
<id>265</id>
<edge_type>1</edge_type>
<source_obj>151</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_260">
<id>266</id>
<edge_type>1</edge_type>
<source_obj>70</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_261">
<id>267</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_262">
<id>268</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="_263">
<id>269</id>
<edge_type>1</edge_type>
<source_obj>156</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_264">
<id>270</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_265">
<id>271</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>74</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_266">
<id>272</id>
<edge_type>1</edge_type>
<source_obj>69</source_obj>
<sink_obj>74</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_267">
<id>273</id>
<edge_type>2</edge_type>
<source_obj>84</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_268">
<id>274</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>99</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_269">
<id>275</id>
<edge_type>2</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="_270">
<id>276</id>
<edge_type>1</edge_type>
<source_obj>172</source_obj>
<sink_obj>99</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_271">
<id>277</id>
<edge_type>2</edge_type>
<source_obj>84</source_obj>
<sink_obj>99</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_272">
<id>278</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_273">
<id>279</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_274">
<id>280</id>
<edge_type>1</edge_type>
<source_obj>77</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_275">
<id>281</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_276">
<id>282</id>
<edge_type>1</edge_type>
<source_obj>101</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_277">
<id>283</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_278">
<id>284</id>
<edge_type>1</edge_type>
<source_obj>102</source_obj>
<sink_obj>103</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_279">
<id>285</id>
<edge_type>1</edge_type>
<source_obj>74</source_obj>
<sink_obj>77</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_280">
<id>286</id>
<edge_type>2</edge_type>
<source_obj>76</source_obj>
<sink_obj>77</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_281">
<id>287</id>
<edge_type>1</edge_type>
<source_obj>172</source_obj>
<sink_obj>77</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_282">
<id>288</id>
<edge_type>2</edge_type>
<source_obj>62</source_obj>
<sink_obj>77</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_283">
<id>289</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_284">
<id>290</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_285">
<id>291</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_286">
<id>292</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_287">
<id>293</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_288">
<id>294</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_289">
<id>295</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_290">
<id>297</id>
<edge_type>1</edge_type>
<source_obj>296</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_291">
<id>298</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="_292">
<id>299</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_293">
<id>300</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>81</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_294">
<id>301</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_295">
<id>302</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_296">
<id>303</id>
<edge_type>1</edge_type>
<source_obj>81</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_297">
<id>304</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="_298">
<id>305</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_299">
<id>306</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_300">
<id>307</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_301">
<id>308</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_302">
<id>309</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_303">
<id>310</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_304">
<id>311</id>
<edge_type>1</edge_type>
<source_obj>82</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_305">
<id>312</id>
<edge_type>2</edge_type>
<source_obj>104</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_306">
<id>313</id>
<edge_type>2</edge_type>
<source_obj>98</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_307">
<id>314</id>
<edge_type>1</edge_type>
<source_obj>145</source_obj>
<sink_obj>85</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_308">
<id>315</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="_309">
<id>316</id>
<edge_type>1</edge_type>
<source_obj>145</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_310">
<id>317</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_311">
<id>318</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="_312">
<id>319</id>
<edge_type>1</edge_type>
<source_obj>151</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_313">
<id>320</id>
<edge_type>1</edge_type>
<source_obj>87</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_314">
<id>322</id>
<edge_type>1</edge_type>
<source_obj>321</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_315">
<id>323</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="_316">
<id>324</id>
<edge_type>1</edge_type>
<source_obj>85</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_317">
<id>325</id>
<edge_type>1</edge_type>
<source_obj>89</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_318">
<id>326</id>
<edge_type>1</edge_type>
<source_obj>156</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_319">
<id>327</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="_320">
<id>328</id>
<edge_type>1</edge_type>
<source_obj>87</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_321">
<id>329</id>
<edge_type>1</edge_type>
<source_obj>257</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_322">
<id>330</id>
<edge_type>1</edge_type>
<source_obj>92</source_obj>
<sink_obj>93</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_323">
<id>331</id>
<edge_type>1</edge_type>
<source_obj>85</source_obj>
<sink_obj>93</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_324">
<id>332</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="_325">
<id>333</id>
<edge_type>1</edge_type>
<source_obj>156</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_326">
<id>334</id>
<edge_type>1</edge_type>
<source_obj>94</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_327">
<id>335</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="_328">
<id>336</id>
<edge_type>1</edge_type>
<source_obj>91</source_obj>
<sink_obj>96</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_329">
<id>337</id>
<edge_type>2</edge_type>
<source_obj>104</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_330">
<id>350</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_331">
<id>351</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_332">
<id>352</id>
<edge_type>2</edge_type>
<source_obj>33</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_333">
<id>353</id>
<edge_type>2</edge_type>
<source_obj>41</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_334">
<id>354</id>
<edge_type>2</edge_type>
<source_obj>41</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_335">
<id>355</id>
<edge_type>2</edge_type>
<source_obj>54</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_336">
<id>356</id>
<edge_type>2</edge_type>
<source_obj>62</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_337">
<id>357</id>
<edge_type>2</edge_type>
<source_obj>62</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_338">
<id>358</id>
<edge_type>2</edge_type>
<source_obj>76</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_339">
<id>359</id>
<edge_type>2</edge_type>
<source_obj>84</source_obj>
<sink_obj>98</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_340">
<id>360</id>
<edge_type>2</edge_type>
<source_obj>84</source_obj>
<sink_obj>104</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_341">
<id>361</id>
<edge_type>2</edge_type>
<source_obj>98</source_obj>
<sink_obj>104</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="_342">
<mId>1</mId>
<mTag>checkAxis.0</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>9</count>
<item_version>0</item_version>
<item>20</item>
<item>33</item>
<item>41</item>
<item>54</item>
<item>62</item>
<item>76</item>
<item>84</item>
<item>98</item>
<item>104</item>
</basic_blocks>
<mII>1</mII>
<mDepth>52</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>51</mMinLatency>
<mMaxLatency>51</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_343">
<states class_id="25" tracking_level="0" version="0">
<count>52</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_344">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_345">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_346">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_347">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_348">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_349">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_350">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_351">
<id>14</id>
<stage>46</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_352">
<id>35</id>
<stage>46</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_353">
<id>56</id>
<stage>46</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_354">
<id>78</id>
<stage>46</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_355">
<id>2</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_356">
<id>14</id>
<stage>45</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_357">
<id>35</id>
<stage>45</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_358">
<id>56</id>
<stage>45</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_359">
<id>78</id>
<stage>45</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_360">
<id>3</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_361">
<id>14</id>
<stage>44</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_362">
<id>35</id>
<stage>44</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_363">
<id>56</id>
<stage>44</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_364">
<id>78</id>
<stage>44</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_365">
<id>4</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_366">
<id>14</id>
<stage>43</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_367">
<id>35</id>
<stage>43</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_368">
<id>56</id>
<stage>43</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_369">
<id>78</id>
<stage>43</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_370">
<id>5</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_371">
<id>14</id>
<stage>42</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_372">
<id>35</id>
<stage>42</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_373">
<id>56</id>
<stage>42</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_374">
<id>78</id>
<stage>42</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_375">
<id>6</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_376">
<id>14</id>
<stage>41</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_377">
<id>35</id>
<stage>41</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_378">
<id>56</id>
<stage>41</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_379">
<id>78</id>
<stage>41</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_380">
<id>7</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_381">
<id>14</id>
<stage>40</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_382">
<id>35</id>
<stage>40</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_383">
<id>56</id>
<stage>40</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_384">
<id>78</id>
<stage>40</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_385">
<id>8</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_386">
<id>14</id>
<stage>39</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_387">
<id>35</id>
<stage>39</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_388">
<id>56</id>
<stage>39</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_389">
<id>78</id>
<stage>39</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_390">
<id>9</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_391">
<id>14</id>
<stage>38</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_392">
<id>35</id>
<stage>38</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_393">
<id>56</id>
<stage>38</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_394">
<id>78</id>
<stage>38</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_395">
<id>10</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_396">
<id>14</id>
<stage>37</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_397">
<id>35</id>
<stage>37</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_398">
<id>56</id>
<stage>37</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_399">
<id>78</id>
<stage>37</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_400">
<id>11</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_401">
<id>14</id>
<stage>36</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_402">
<id>35</id>
<stage>36</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_403">
<id>56</id>
<stage>36</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_404">
<id>78</id>
<stage>36</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_405">
<id>12</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_406">
<id>14</id>
<stage>35</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_407">
<id>35</id>
<stage>35</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_408">
<id>56</id>
<stage>35</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_409">
<id>78</id>
<stage>35</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_410">
<id>13</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_411">
<id>14</id>
<stage>34</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_412">
<id>35</id>
<stage>34</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_413">
<id>56</id>
<stage>34</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_414">
<id>78</id>
<stage>34</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_415">
<id>14</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_416">
<id>14</id>
<stage>33</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_417">
<id>35</id>
<stage>33</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_418">
<id>56</id>
<stage>33</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_419">
<id>78</id>
<stage>33</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_420">
<id>15</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_421">
<id>14</id>
<stage>32</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_422">
<id>35</id>
<stage>32</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_423">
<id>56</id>
<stage>32</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_424">
<id>78</id>
<stage>32</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_425">
<id>16</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_426">
<id>14</id>
<stage>31</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_427">
<id>35</id>
<stage>31</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_428">
<id>56</id>
<stage>31</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_429">
<id>78</id>
<stage>31</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_430">
<id>17</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_431">
<id>14</id>
<stage>30</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_432">
<id>35</id>
<stage>30</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_433">
<id>56</id>
<stage>30</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_434">
<id>78</id>
<stage>30</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_435">
<id>18</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_436">
<id>14</id>
<stage>29</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_437">
<id>35</id>
<stage>29</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_438">
<id>56</id>
<stage>29</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_439">
<id>78</id>
<stage>29</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_440">
<id>19</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_441">
<id>14</id>
<stage>28</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_442">
<id>35</id>
<stage>28</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_443">
<id>56</id>
<stage>28</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_444">
<id>78</id>
<stage>28</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_445">
<id>20</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_446">
<id>14</id>
<stage>27</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_447">
<id>35</id>
<stage>27</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_448">
<id>56</id>
<stage>27</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_449">
<id>78</id>
<stage>27</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_450">
<id>21</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_451">
<id>14</id>
<stage>26</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_452">
<id>35</id>
<stage>26</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_453">
<id>56</id>
<stage>26</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_454">
<id>78</id>
<stage>26</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_455">
<id>22</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_456">
<id>14</id>
<stage>25</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_457">
<id>35</id>
<stage>25</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_458">
<id>56</id>
<stage>25</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_459">
<id>78</id>
<stage>25</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_460">
<id>23</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_461">
<id>14</id>
<stage>24</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_462">
<id>35</id>
<stage>24</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_463">
<id>56</id>
<stage>24</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_464">
<id>78</id>
<stage>24</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_465">
<id>24</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_466">
<id>14</id>
<stage>23</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_467">
<id>35</id>
<stage>23</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_468">
<id>56</id>
<stage>23</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_469">
<id>78</id>
<stage>23</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_470">
<id>25</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_471">
<id>14</id>
<stage>22</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_472">
<id>35</id>
<stage>22</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_473">
<id>56</id>
<stage>22</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_474">
<id>78</id>
<stage>22</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_475">
<id>26</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_476">
<id>14</id>
<stage>21</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_477">
<id>35</id>
<stage>21</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_478">
<id>56</id>
<stage>21</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_479">
<id>78</id>
<stage>21</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_480">
<id>27</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_481">
<id>14</id>
<stage>20</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_482">
<id>35</id>
<stage>20</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_483">
<id>56</id>
<stage>20</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_484">
<id>78</id>
<stage>20</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_485">
<id>28</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_486">
<id>14</id>
<stage>19</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_487">
<id>35</id>
<stage>19</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_488">
<id>56</id>
<stage>19</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_489">
<id>78</id>
<stage>19</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_490">
<id>29</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_491">
<id>14</id>
<stage>18</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_492">
<id>35</id>
<stage>18</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_493">
<id>56</id>
<stage>18</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_494">
<id>78</id>
<stage>18</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_495">
<id>30</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_496">
<id>14</id>
<stage>17</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_497">
<id>35</id>
<stage>17</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_498">
<id>56</id>
<stage>17</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_499">
<id>78</id>
<stage>17</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_500">
<id>31</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_501">
<id>14</id>
<stage>16</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_502">
<id>35</id>
<stage>16</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_503">
<id>56</id>
<stage>16</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_504">
<id>78</id>
<stage>16</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_505">
<id>32</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_506">
<id>14</id>
<stage>15</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_507">
<id>35</id>
<stage>15</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_508">
<id>56</id>
<stage>15</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_509">
<id>78</id>
<stage>15</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_510">
<id>33</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_511">
<id>14</id>
<stage>14</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_512">
<id>35</id>
<stage>14</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_513">
<id>56</id>
<stage>14</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_514">
<id>78</id>
<stage>14</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_515">
<id>34</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_516">
<id>14</id>
<stage>13</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_517">
<id>35</id>
<stage>13</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_518">
<id>56</id>
<stage>13</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_519">
<id>78</id>
<stage>13</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_520">
<id>35</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_521">
<id>14</id>
<stage>12</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_522">
<id>35</id>
<stage>12</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_523">
<id>56</id>
<stage>12</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_524">
<id>78</id>
<stage>12</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_525">
<id>36</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_526">
<id>14</id>
<stage>11</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_527">
<id>35</id>
<stage>11</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_528">
<id>56</id>
<stage>11</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_529">
<id>78</id>
<stage>11</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_530">
<id>37</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_531">
<id>14</id>
<stage>10</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_532">
<id>35</id>
<stage>10</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_533">
<id>56</id>
<stage>10</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_534">
<id>78</id>
<stage>10</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_535">
<id>38</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_536">
<id>14</id>
<stage>9</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_537">
<id>35</id>
<stage>9</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_538">
<id>56</id>
<stage>9</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_539">
<id>78</id>
<stage>9</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_540">
<id>39</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_541">
<id>14</id>
<stage>8</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_542">
<id>35</id>
<stage>8</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_543">
<id>56</id>
<stage>8</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_544">
<id>78</id>
<stage>8</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_545">
<id>40</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_546">
<id>14</id>
<stage>7</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_547">
<id>35</id>
<stage>7</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_548">
<id>56</id>
<stage>7</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_549">
<id>78</id>
<stage>7</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_550">
<id>41</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_551">
<id>14</id>
<stage>6</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_552">
<id>35</id>
<stage>6</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_553">
<id>56</id>
<stage>6</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_554">
<id>78</id>
<stage>6</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_555">
<id>42</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_556">
<id>14</id>
<stage>5</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_557">
<id>35</id>
<stage>5</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_558">
<id>56</id>
<stage>5</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_559">
<id>78</id>
<stage>5</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_560">
<id>43</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_561">
<id>14</id>
<stage>4</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_562">
<id>35</id>
<stage>4</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_563">
<id>56</id>
<stage>4</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_564">
<id>78</id>
<stage>4</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_565">
<id>44</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_566">
<id>14</id>
<stage>3</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_567">
<id>35</id>
<stage>3</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_568">
<id>56</id>
<stage>3</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_569">
<id>78</id>
<stage>3</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_570">
<id>45</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_571">
<id>14</id>
<stage>2</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_572">
<id>35</id>
<stage>2</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_573">
<id>56</id>
<stage>2</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_574">
<id>78</id>
<stage>2</stage>
<latency>46</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_575">
<id>46</id>
<operations>
<count>16</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_576">
<id>14</id>
<stage>1</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_577">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_578">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_579">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_580">
<id>35</id>
<stage>1</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_581">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_582">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_583">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_584">
<id>56</id>
<stage>1</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_585">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_586">
<id>58</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_587">
<id>59</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_588">
<id>78</id>
<stage>1</stage>
<latency>46</latency>
</item>
<item class_id_reference="28" object_id="_589">
<id>79</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_590">
<id>80</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_591">
<id>81</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_592">
<id>47</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_593">
<id>18</id>
<stage>5</stage>
<latency>5</latency>
</item>
<item class_id_reference="28" object_id="_594">
<id>39</id>
<stage>5</stage>
<latency>5</latency>
</item>
<item class_id_reference="28" object_id="_595">
<id>60</id>
<stage>5</stage>
<latency>5</latency>
</item>
<item class_id_reference="28" object_id="_596">
<id>82</id>
<stage>5</stage>
<latency>5</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_597">
<id>48</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_598">
<id>18</id>
<stage>4</stage>
<latency>5</latency>
</item>
<item class_id_reference="28" object_id="_599">
<id>39</id>
<stage>4</stage>
<latency>5</latency>
</item>
<item class_id_reference="28" object_id="_600">
<id>60</id>
<stage>4</stage>
<latency>5</latency>
</item>
<item class_id_reference="28" object_id="_601">
<id>82</id>
<stage>4</stage>
<latency>5</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_602">
<id>49</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_603">
<id>18</id>
<stage>3</stage>
<latency>5</latency>
</item>
<item class_id_reference="28" object_id="_604">
<id>39</id>
<stage>3</stage>
<latency>5</latency>
</item>
<item class_id_reference="28" object_id="_605">
<id>60</id>
<stage>3</stage>
<latency>5</latency>
</item>
<item class_id_reference="28" object_id="_606">
<id>82</id>
<stage>3</stage>
<latency>5</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_607">
<id>50</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_608">
<id>18</id>
<stage>2</stage>
<latency>5</latency>
</item>
<item class_id_reference="28" object_id="_609">
<id>39</id>
<stage>2</stage>
<latency>5</latency>
</item>
<item class_id_reference="28" object_id="_610">
<id>60</id>
<stage>2</stage>
<latency>5</latency>
</item>
<item class_id_reference="28" object_id="_611">
<id>82</id>
<stage>2</stage>
<latency>5</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_612">
<id>51</id>
<operations>
<count>16</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_613">
<id>18</id>
<stage>1</stage>
<latency>5</latency>
</item>
<item class_id_reference="28" object_id="_614">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_615">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_616">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_617">
<id>39</id>
<stage>1</stage>
<latency>5</latency>
</item>
<item class_id_reference="28" object_id="_618">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_619">
<id>42</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_620">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_621">
<id>60</id>
<stage>1</stage>
<latency>5</latency>
</item>
<item class_id_reference="28" object_id="_622">
<id>61</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_623">
<id>63</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_624">
<id>64</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_625">
<id>82</id>
<stage>1</stage>
<latency>5</latency>
</item>
<item class_id_reference="28" object_id="_626">
<id>83</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_627">
<id>85</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_628">
<id>86</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_629">
<id>52</id>
<operations>
<count>51</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_630">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_631">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_632">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_633">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_634">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_635">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_636">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_637">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_638">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_639">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_640">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_641">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_642">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_643">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_644">
<id>46</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_645">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_646">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_647">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_648">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_649">
<id>51</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_650">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_651">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_652">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_653">
<id>65</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_654">
<id>66</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_655">
<id>67</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_656">
<id>68</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_657">
<id>69</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_658">
<id>70</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_659">
<id>71</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_660">
<id>72</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_661">
<id>73</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_662">
<id>74</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_663">
<id>75</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_664">
<id>77</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_665">
<id>87</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_666">
<id>88</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_667">
<id>89</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_668">
<id>90</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_669">
<id>91</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_670">
<id>92</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_671">
<id>93</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_672">
<id>94</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_673">
<id>95</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_674">
<id>96</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_675">
<id>97</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_676">
<id>99</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_677">
<id>100</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_678">
<id>101</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_679">
<id>102</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_680">
<id>103</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>51</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_681">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>-1</id>
<sop class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_682">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_683">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_684">
<inState>4</inState>
<outState>5</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_685">
<inState>5</inState>
<outState>6</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_686">
<inState>6</inState>
<outState>7</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_687">
<inState>7</inState>
<outState>8</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_688">
<inState>8</inState>
<outState>9</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_689">
<inState>9</inState>
<outState>10</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_690">
<inState>10</inState>
<outState>11</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_691">
<inState>11</inState>
<outState>12</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_692">
<inState>12</inState>
<outState>13</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_693">
<inState>13</inState>
<outState>14</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_694">
<inState>14</inState>
<outState>15</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_695">
<inState>15</inState>
<outState>16</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_696">
<inState>16</inState>
<outState>17</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_697">
<inState>17</inState>
<outState>18</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_698">
<inState>18</inState>
<outState>19</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_699">
<inState>19</inState>
<outState>20</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_700">
<inState>20</inState>
<outState>21</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_701">
<inState>21</inState>
<outState>22</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_702">
<inState>22</inState>
<outState>23</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_703">
<inState>23</inState>
<outState>24</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_704">
<inState>24</inState>
<outState>25</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_705">
<inState>25</inState>
<outState>26</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_706">
<inState>26</inState>
<outState>27</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_707">
<inState>27</inState>
<outState>28</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_708">
<inState>28</inState>
<outState>29</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_709">
<inState>29</inState>
<outState>30</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_710">
<inState>30</inState>
<outState>31</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_711">
<inState>31</inState>
<outState>32</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_712">
<inState>32</inState>
<outState>33</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_713">
<inState>33</inState>
<outState>34</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_714">
<inState>34</inState>
<outState>35</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_715">
<inState>35</inState>
<outState>36</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_716">
<inState>36</inState>
<outState>37</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_717">
<inState>37</inState>
<outState>38</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_718">
<inState>38</inState>
<outState>39</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_719">
<inState>39</inState>
<outState>40</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_720">
<inState>40</inState>
<outState>41</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_721">
<inState>41</inState>
<outState>42</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_722">
<inState>42</inState>
<outState>43</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_723">
<inState>43</inState>
<outState>44</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_724">
<inState>44</inState>
<outState>45</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_725">
<inState>45</inState>
<outState>46</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_726">
<inState>46</inState>
<outState>47</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_727">
<inState>47</inState>
<outState>48</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_728">
<inState>48</inState>
<outState>49</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_729">
<inState>49</inState>
<outState>50</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_730">
<inState>50</inState>
<outState>51</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_731">
<inState>51</inState>
<outState>52</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="-1"></res>
<node_label_latency class_id="35" tracking_level="0" version="0">
<count>88</count>
<item_version>0</item_version>
<item class_id="36" tracking_level="0" version="0">
<first>8</first>
<second class_id="37" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>0</first>
<second>45</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>45</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>45</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>45</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>46</first>
<second>4</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>50</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>50</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>50</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>0</first>
<second>45</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>45</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>45</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>45</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>46</first>
<second>4</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>50</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>50</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>50</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>0</first>
<second>45</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>45</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>45</first>
<second>0</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>45</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>46</first>
<second>4</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>50</first>
<second>0</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>50</first>
<second>0</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>50</first>
<second>0</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>73</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>74</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>77</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>78</first>
<second>
<first>0</first>
<second>45</second>
</second>
</item>
<item>
<first>79</first>
<second>
<first>45</first>
<second>0</second>
</second>
</item>
<item>
<first>80</first>
<second>
<first>45</first>
<second>0</second>
</second>
</item>
<item>
<first>81</first>
<second>
<first>45</first>
<second>0</second>
</second>
</item>
<item>
<first>82</first>
<second>
<first>46</first>
<second>4</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>50</first>
<second>0</second>
</second>
</item>
<item>
<first>85</first>
<second>
<first>50</first>
<second>0</second>
</second>
</item>
<item>
<first>86</first>
<second>
<first>50</first>
<second>0</second>
</second>
</item>
<item>
<first>87</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>89</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>90</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>91</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>92</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>93</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>94</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>95</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>96</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>97</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>99</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>100</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>101</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>102</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
<item>
<first>103</first>
<second>
<first>51</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="38" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="39" tracking_level="0" version="0">
<first>20</first>
<second class_id="40" tracking_level="0" version="0">
<first>0</first>
<second>51</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>50</first>
<second>51</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>0</first>
<second>51</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>50</first>
<second>51</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>0</first>
<second>51</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>50</first>
<second>51</second>
</second>
</item>
<item>
<first>84</first>
<second>
<first>0</first>
<second>51</second>
</second>
</item>
<item>
<first>98</first>
<second>
<first>50</first>
<second>51</second>
</second>
</item>
<item>
<first>104</first>
<second>
<first>51</first>
<second>51</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="_732">
<region_name>checkAxis.0</region_name>
<basic_blocks>
<count>9</count>
<item_version>0</item_version>
<item>20</item>
<item>33</item>
<item>41</item>
<item>54</item>
<item>62</item>
<item>76</item>
<item>84</item>
<item>98</item>
<item>104</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>52</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="43" tracking_level="0" version="0">
<count>79</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="0" version="0">
<first>50</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>56</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>62</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>68</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>74</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>80</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>101</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>112</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>77</item>
</second>
</item>
<item>
<first>123</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>99</item>
</second>
</item>
<item>
<first>130</first>
<second>
<count>46</count>
<item_version>0</item_version>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
</second>
</item>
<item>
<first>148</first>
<second>
<count>46</count>
<item_version>0</item_version>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
</second>
</item>
<item>
<first>166</first>
<second>
<count>46</count>
<item_version>0</item_version>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
</second>
</item>
<item>
<first>184</first>
<second>
<count>46</count>
<item_version>0</item_version>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
</second>
</item>
<item>
<first>202</first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>18</item>
<item>18</item>
<item>18</item>
<item>18</item>
<item>18</item>
</second>
</item>
<item>
<first>215</first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>39</item>
<item>39</item>
<item>39</item>
<item>39</item>
<item>39</item>
</second>
</item>
<item>
<first>228</first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>60</item>
<item>60</item>
<item>60</item>
<item>60</item>
<item>60</item>
</second>
</item>
<item>
<first>241</first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>82</item>
<item>82</item>
<item>82</item>
<item>82</item>
<item>82</item>
</second>
</item>
<item>
<first>254</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>259</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>264</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>269</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>274</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>279</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>284</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>289</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>86</item>
</second>
</item>
<item>
<first>294</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>298</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>302</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>306</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>310</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>314</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>318</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>322</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>326</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>330</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>334</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>338</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>342</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>347</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>352</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>356</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>362</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>368</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>373</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>377</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>383</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>390</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>395</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>401</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>406</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>410</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>416</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>421</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>425</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>431</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>438</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>443</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>449</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>454</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>458</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>69</item>
</second>
</item>
<item>
<first>464</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>70</item>
</second>
</item>
<item>
<first>470</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>475</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>479</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>485</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>492</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>497</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>503</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</second>
</item>
<item>
<first>508</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</second>
</item>
<item>
<first>512</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>91</item>
</second>
</item>
<item>
<first>518</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
<item>
<first>524</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>93</item>
</second>
</item>
<item>
<first>529</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
<item>
<first>533</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</second>
</item>
<item>
<first>539</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>96</item>
</second>
</item>
<item>
<first>546</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>100</item>
</second>
</item>
<item>
<first>552</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>101</item>
</second>
</item>
<item>
<first>558</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>102</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="46" tracking_level="0" version="0">
<count>57</count>
<item_version>0</item_version>
<item class_id="47" tracking_level="0" version="0">
<first>add_ln80_18_fu_362</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>add_ln80_19_fu_368</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>add_ln80_20_fu_401</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>add_ln80_21_fu_416</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>add_ln80_22_fu_449</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>add_ln80_23_fu_470</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>add_ln80_24_fu_503</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</second>
</item>
<item>
<first>add_ln80_25_fu_524</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>93</item>
</second>
</item>
<item>
<first>add_ln80_fu_347</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>collisions_load_0_phi_fu_90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>collisions_load_1_phi_fu_101</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>collisions_load_2_phi_fu_112</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>77</item>
</second>
</item>
<item>
<first>collisions_load_3_phi_fu_123</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>99</item>
</second>
</item>
<item>
<first>or_ln122_1_fu_431</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>or_ln122_2_fu_485</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>or_ln122_3_fu_539</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>96</item>
</second>
</item>
<item>
<first>or_ln122_fu_383</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>or_ln139_2_fu_558</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>102</item>
</second>
</item>
<item>
<first>or_ln139_4_fu_552</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>101</item>
</second>
</item>
<item>
<first>or_ln139_fu_546</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>100</item>
</second>
</item>
<item>
<first>or_ln80_5_fu_443</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>or_ln80_6_fu_464</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>70</item>
</second>
</item>
<item>
<first>or_ln80_7_fu_497</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>or_ln80_8_fu_518</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
<item>
<first>or_ln80_fu_395</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>p_01_0_1_fu_306</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>p_01_0_2_fu_318</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>p_01_0_3_fu_330</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>p_12_0_1_fu_310</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>p_12_0_2_fu_322</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>p_12_0_3_fu_334</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>p_1_fu_294</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>p_23_0_1_fu_314</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>p_23_0_2_fu_326</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>p_23_0_3_fu_338</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>p_3_fu_302</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>p_s_fu_298</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>shl_ln121_1_fu_410</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>shl_ln121_2_fu_458</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>69</item>
</second>
</item>
<item>
<first>shl_ln121_3_fu_512</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>91</item>
</second>
</item>
<item>
<first>shl_ln121_fu_356</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>shl_ln122_1_fu_425</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>shl_ln122_2_fu_479</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>shl_ln122_3_fu_533</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</second>
</item>
<item>
<first>shl_ln122_fu_377</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>shl_ln80_11_fu_390</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>shl_ln80_12_fu_438</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>shl_ln80_13_fu_492</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>shl_ln80_fu_342</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>zext_ln121_1_fu_406</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>zext_ln121_2_fu_454</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>zext_ln121_3_fu_508</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</second>
</item>
<item>
<first>zext_ln121_fu_352</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>zext_ln122_1_fu_421</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>zext_ln122_2_fu_475</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>zext_ln122_3_fu_529</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
<item>
<first>zext_ln122_fu_373</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>16</count>
<item_version>0</item_version>
<item>
<first>grp_lineIntersectsPlane_fu_130</first>
<second>
<count>46</count>
<item_version>0</item_version>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
<item>14</item>
</second>
</item>
<item>
<first>grp_lineIntersectsPlane_fu_148</first>
<second>
<count>46</count>
<item_version>0</item_version>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
<item>35</item>
</second>
</item>
<item>
<first>grp_lineIntersectsPlane_fu_166</first>
<second>
<count>46</count>
<item_version>0</item_version>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
<item>56</item>
</second>
</item>
<item>
<first>grp_lineIntersectsPlane_fu_184</first>
<second>
<count>46</count>
<item_version>0</item_version>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
</second>
</item>
<item>
<first>grp_pointOnSegment_fu_202</first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>18</item>
<item>18</item>
<item>18</item>
<item>18</item>
<item>18</item>
</second>
</item>
<item>
<first>grp_pointOnSegment_fu_215</first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>39</item>
<item>39</item>
<item>39</item>
<item>39</item>
<item>39</item>
</second>
</item>
<item>
<first>grp_pointOnSegment_fu_228</first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>60</item>
<item>60</item>
<item>60</item>
<item>60</item>
<item>60</item>
</second>
</item>
<item>
<first>grp_pointOnSegment_fu_241</first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>82</item>
<item>82</item>
<item>82</item>
<item>82</item>
<item>82</item>
</second>
</item>
<item>
<first>i_assign_4_p_hls_fptosi_float_i_fu_264</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>i_assign_5_p_hls_fptosi_float_i_fu_274</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>i_assign_6_p_hls_fptosi_float_i_fu_284</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>i_assign_p_hls_fptosi_float_i_fu_254</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>k_assign_4_p_hls_fptosi_float_i_fu_269</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>k_assign_5_p_hls_fptosi_float_i_fu_279</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>k_assign_6_p_hls_fptosi_float_i_fu_289</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>86</item>
</second>
</item>
<item>
<first>k_assign_p_hls_fptosi_float_i_fu_259</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>6</count>
<item_version>0</item_version>
<item>
<first>edge_p1_x_read_read_fu_80</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>edge_p1_y_read_read_fu_74</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>edge_p1_z_read_read_fu_68</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>edge_p2_x_read_read_fu_62</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>edge_p2_y_read_read_fu_56</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>edge_p2_z_read_read_fu_50</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</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>34</count>
<item_version>0</item_version>
<item>
<first>86</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>97</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>108</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>77</item>
</second>
</item>
<item>
<first>119</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>99</item>
</second>
</item>
<item>
<first>564</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>576</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>588</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>600</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>612</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>624</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>636</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>642</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>648</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>653</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>659</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>665</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>670</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>676</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>682</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>687</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>693</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>699</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>704</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>708</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>714</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>719</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>723</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>729</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>734</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>738</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>744</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>749</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</second>
</item>
<item>
<first>753</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>759</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>86</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>34</count>
<item_version>0</item_version>
<item>
<first>collisions_load_0_reg_86</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>collisions_load_1_reg_97</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>collisions_load_2_reg_108</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>77</item>
</second>
</item>
<item>
<first>collisions_load_3_reg_119</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>99</item>
</second>
</item>
<item>
<first>edge_p1_x_read_reg_624</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>edge_p1_y_read_reg_612</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>edge_p1_z_read_reg_600</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>edge_p2_x_read_reg_588</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>edge_p2_y_read_reg_576</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>edge_p2_z_read_reg_564</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>i_assign_4_reg_723</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>i_assign_5_reg_738</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>i_assign_6_reg_753</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>i_assign_reg_708</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>k_assign_4_reg_729</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>k_assign_5_reg_744</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>k_assign_6_reg_759</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>86</item>
</second>
</item>
<item>
<first>k_assign_reg_714</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>p_01_0_1_reg_653</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>p_01_0_2_reg_670</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>p_01_0_3_reg_687</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>p_12_0_1_reg_659</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>p_12_0_2_reg_676</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>p_12_0_3_reg_693</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>p_1_reg_636</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>p_23_0_1_reg_665</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>p_23_0_2_reg_682</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>p_23_0_3_reg_699</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>p_3_reg_648</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>p_s_reg_642</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>tmp_43_1_reg_719</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>tmp_43_2_reg_734</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>tmp_43_3_reg_749</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</second>
</item>
<item>
<first>tmp_s_reg_704</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>4</count>
<item_version>0</item_version>
<item>
<first>86</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>97</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>108</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>77</item>
</second>
</item>
<item>
<first>119</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>99</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>4</count>
<item_version>0</item_version>
<item>
<first>collisions_load_0_reg_86</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>collisions_load_1_reg_97</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>collisions_load_2_reg_108</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>77</item>
</second>
</item>
<item>
<first>collisions_load_3_reg_119</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>99</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>edge_p1_x</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
</second>
</item>
<item>
<first>edge_p1_y</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
</second>
</item>
<item>
<first>edge_p1_z</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
</second>
</item>
<item>
<first>edge_p2_x</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
</second>
</item>
<item>
<first>edge_p2_y</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
</second>
</item>
<item>
<first>edge_p2_z</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="51" 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>
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . T E X T _ I O . E N U M E R A T I O N _ 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.Enumeration_IO
-- that are shared among separate instantiations of this package.
private package Ada.Text_IO.Enumeration_Aux is
procedure Get_Enum_Lit
(File : File_Type;
Buf : out String;
Buflen : out Natural);
-- Reads an enumeration literal value from the file, folds to upper case,
-- and stores the result in Buf, setting Buflen to the number of stored
-- characters (Buf has a lower bound of 1). If more than Buflen characters
-- are present in the literal, Data_Error is raised.
procedure Scan_Enum_Lit
(From : String;
Start : out Natural;
Stop : out Natural);
-- Scans an enumeration literal at the start of From, skipping any leading
-- spaces. Sets Start to the first character, Stop to the last character.
-- Raises End_Error if no enumeration literal is found.
procedure Put
(File : File_Type;
Item : String;
Width : Field;
Set : Type_Set);
-- Outputs the enumeration literal image stored in Item to the given File,
-- using the given Width and Set parameters (Item is always in upper case).
procedure Puts
(To : out String;
Item : in String;
Set : Type_Set);
-- Stores the enumeration literal image stored in Item to the string To,
-- padding with trailing spaces if necessary to fill To. Set is used to
end Ada.Text_IO.Enumeration_Aux;
|
-- This file is generated by SWIG. Please do *not* modify by hand.
--
with interfaces.c;
with interfaces.c.strings;
with speech_tools_c.Pointers;
with swig.pointers;
with interfaces.C;
package speech_tools_c.Binding
is
function new_EST_Wave return speech_tools_c.Pointers.EST_Wave_Pointer;
function EST_Wave_num_samples (Self : in speech_tools_c.Pointers.EST_Wave_Pointer) return interfaces.c.int;
function EST_Wave_num_channels (Self : in speech_tools_c.Pointers.EST_Wave_Pointer) return interfaces.c.int;
function EST_Wave_sample_rate (Self : in speech_tools_c.Pointers.EST_Wave_Pointer) return interfaces.c.int;
function EST_Wave_length (Self : in speech_tools_c.Pointers.EST_Wave_Pointer) return interfaces.c.int;
function EST_Wave_end (Self : in speech_tools_c.Pointers.EST_Wave_Pointer) return interfaces.c.c_float;
function EST_Wave_Data (Self : in speech_tools_c.Pointers.EST_Wave_Pointer) return swig.pointers.short_Pointer;
procedure EST_Wave_resample (Self : in speech_tools_c.Pointers.EST_Wave_Pointer;
new_Rate : in interfaces.c.int);
function new_EST_String return speech_tools_c.Pointers.EST_String_Pointer;
function new_EST_String (From : in interfaces.c.strings.chars_ptr) return speech_tools_c.Pointers.EST_String_Pointer;
private
pragma Import (C, new_EST_Wave, "Ada_new_EST_Wave");
pragma Import (C, EST_Wave_num_samples, "Ada_EST_Wave_num_samples");
pragma Import (C, EST_Wave_num_channels, "Ada_EST_Wave_num_channels");
pragma Import (C, EST_Wave_sample_rate, "Ada_EST_Wave_sample_rate");
pragma Import (C, EST_Wave_length, "Ada_EST_Wave_length");
pragma Import (C, EST_Wave_end, "Ada_EST_Wave_end");
pragma Import (C, EST_Wave_Data, "Ada_EST_Wave_Data");
pragma Import (C, EST_Wave_resample, "Ada_EST_Wave_resample");
function new_EST_String_v1 return speech_tools_c.Pointers.EST_String_Pointer;
function new_EST_String return speech_tools_c.Pointers.EST_String_Pointer
renames new_EST_String_v1;
pragma Import (C, new_EST_String_v1, "Ada_new_EST_String__SWIG_0");
function new_EST_String_v2 (From : in interfaces.c.strings.chars_ptr) return speech_tools_c.Pointers.EST_String_Pointer;
function new_EST_String (From : in interfaces.c.strings.chars_ptr) return speech_tools_c.Pointers.EST_String_Pointer
renames new_EST_String_v2;
pragma Import (C, new_EST_String_v2, "Ada_new_EST_String__SWIG_1");
end speech_tools_c.Binding;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- ADA.NUMERICS.SHORT_ELEMENTARY_FUNCTIONS --
-- --
-- S p e c --
-- --
-- This specification is adapted from the Ada Reference Manual for use with --
-- GNAT. In accordance with the copyright of that document, you can freely --
-- copy and modify this specification, provided that if you redistribute a --
-- modified version, any changes that you have made are clearly indicated. --
-- --
------------------------------------------------------------------------------
with Ada.Numerics.Generic_Elementary_Functions;
package Ada.Numerics.Short_Elementary_Functions is
new Ada.Numerics.Generic_Elementary_Functions (Short_Float);
pragma Pure (Short_Elementary_Functions);
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2013, 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 access to Intel x86 AVX instructions set.
------------------------------------------------------------------------------
package Matreshka.SIMD.Intel.AVX is
pragma Preelaborate;
-- _mm256_add_pd
-- _mm256_add_ps
-- _mm256_addsub_pd
-- _mm256_addsub_ps
function mm256_and_pd (A : v4df; B : v4df) return v4df;
pragma Import (Intrinsic, mm256_and_pd, "__builtin_ia32_andpd256");
function mm256_and_ps (A : v8sf; B : v8sf) return v8sf;
pragma Import (Intrinsic, mm256_and_ps, "__builtin_ia32_andps256");
-- _mm256_andnot_pd
-- _mm256_andnot_ps
-- _mm256_blend_pd
-- _mm256_blend_ps
-- _mm256_blendv_pd
-- _mm256_blendv_ps
-- _mm256_div_pd
-- _mm256_div_ps
-- _mm256_dp_ps
-- _mm256_hadd_pd
-- _mm256_hadd_ps
-- _mm256_hsub_pd
-- _mm256_hsub_ps
--
--
--
--
--
end Matreshka.SIMD.Intel.AVX;
|
with avtas.lmcp.types; use avtas.lmcp.types;
package avtas.lmcp.object is
type Object is tagged null record;
type Object_Acc is access Object;
type Object_Class_Acc is access Object'Class;
function clone(this, that: Object_Acc) return Object_Acc is abstract;
function "="(this, that: Object) return Boolean is (True);
function getLmcpTypeName(this : Object) return String is ("Object");
function getFullLmcpTypeName(this : Object) return String is ("avtas.lmcp.object.Object");
function getLmcpType(this : Object'Class) return Int32_t is abstract;
function getSeriesName(this : Object'Class) return String is abstract;
function getSeriesNameAsLong(this : Object'Class) return Int64_t is abstract;
function getSeriesVersion(this : Object'Class) return UInt16_t is abstract;
end avtas.lmcp.object;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M --
-- --
-- S p e c --
-- (GNU/Linux/x86 Version) --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-2001 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, 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. --
-- --
------------------------------------------------------------------------------
package System is
pragma Pure (System);
-- Note that we take advantage of the implementation permission to
-- make this unit Pure instead of Preelaborable, see RM 13.7(36)
type Name is (SYSTEM_NAME_GNAT);
System_Name : constant Name := SYSTEM_NAME_GNAT;
-- System-Dependent Named Numbers
Min_Int : constant := Long_Long_Integer'First;
Max_Int : constant := Long_Long_Integer'Last;
Max_Binary_Modulus : constant := 2 ** Long_Long_Integer'Size;
Max_Nonbinary_Modulus : constant := Integer'Last;
Max_Base_Digits : constant := Long_Long_Float'Digits;
Max_Digits : constant := Long_Long_Float'Digits;
Max_Mantissa : constant := 63;
Fine_Delta : constant := 2.0 ** (-Max_Mantissa);
Tick : constant := Standard'Tick;
-- Storage-related Declarations
type Address is private;
Null_Address : constant Address;
Storage_Unit : constant := Standard'Storage_Unit;
Word_Size : constant := Standard'Word_Size;
Memory_Size : constant := 2 ** Standard'Address_Size;
-- Address comparison
function "<" (Left, Right : Address) return Boolean;
function "<=" (Left, Right : Address) return Boolean;
function ">" (Left, Right : Address) return Boolean;
function ">=" (Left, Right : Address) return Boolean;
function "=" (Left, Right : Address) return Boolean;
pragma Import (Intrinsic, "<");
pragma Import (Intrinsic, "<=");
pragma Import (Intrinsic, ">");
pragma Import (Intrinsic, ">=");
pragma Import (Intrinsic, "=");
-- Other System-Dependent Declarations
type Bit_Order is (High_Order_First, Low_Order_First);
Default_Bit_Order : constant Bit_Order :=
Bit_Order'Val (Standard'Default_Bit_Order);
-- Priority-related Declarations (RM D.1)
Max_Priority : constant Positive := 30;
Max_Interrupt_Priority : constant Positive := 31;
subtype Any_Priority is Integer
range 0 .. Standard'Max_Interrupt_Priority;
subtype Priority is Any_Priority
range 0 .. Standard'Max_Priority;
-- Functional notation is needed in the following to avoid visibility
-- problems when this package is compiled through rtsfind in the middle
-- of another compilation.
subtype Interrupt_Priority is Any_Priority
range
Standard."+" (Standard'Max_Priority, 1) ..
Standard'Max_Interrupt_Priority;
Default_Priority : constant Priority :=
Standard."/" (Standard."+" (Priority'First, Priority'Last), 2);
private
type Address is mod Memory_Size;
Null_Address : constant Address := 0;
--------------------------------------
-- System Implementation Parameters --
--------------------------------------
-- These parameters provide information about the target that is used
-- by the compiler. They are in the private part of System, where they
-- can be accessed using the special circuitry in the Targparm unit
-- whose source should be consulted for more detailed descriptions
-- of the individual switch values.
AAMP : constant Boolean := False;
Command_Line_Args : constant Boolean := True;
Denorm : constant Boolean := True;
Frontend_Layout : constant Boolean := False;
Functions_Return_By_DSP : constant Boolean := False;
Long_Shifts_Inlined : constant Boolean := True;
High_Integrity_Mode : constant Boolean := False;
Machine_Overflows : constant Boolean := False;
Machine_Rounds : constant Boolean := True;
OpenVMS : constant Boolean := False;
Signed_Zeros : constant Boolean := True;
Stack_Check_Default : constant Boolean := False;
Stack_Check_Probes : constant Boolean := False;
Use_Ada_Main_Program_Name : constant Boolean := False;
ZCX_By_Default : constant Boolean := False;
GCC_ZCX_Support : constant Boolean := False;
Front_End_ZCX_Support : constant Boolean := True;
end System;
|
------------------------------------------------------------------------------
-- --
-- GNU ADA RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- SYSTEM.TASK_PRIMITIVES.OPERATIONS.SPECIFIC --
-- --
-- B o d y --
-- --
-- --
-- Copyright (C) 1991-2001, Florida State University --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNARL is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNARL; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. It is --
-- now maintained by Ada Core Technologies Inc. in cooperation with Florida --
-- State University (http://www.gnat.com). --
-- --
------------------------------------------------------------------------------
-- This is a NetBSD version of this package.
separate (System.Task_Primitives.Operations)
package body Specific is
------------------
-- Local Data --
------------------
-- The followings are logically constants, but need to be initialized
-- at run time.
ATCB_Key : aliased pthread_key_t;
-- Key used to find the Ada Task_ID associated with a thread
----------------
-- Initialize --
----------------
procedure Initialize (Environment_Task : Task_ID) is
Result : Interfaces.C.int;
begin
Result := pthread_key_create (ATCB_Key'Access, null);
pragma Assert (Result = 0);
Result := pthread_setspecific (ATCB_Key, To_Address (Environment_Task));
pragma Assert (Result = 0);
end Initialize;
---------
-- Set --
---------
procedure Set (Self_Id : Task_ID) is
Result : Interfaces.C.int;
begin
Result := pthread_setspecific (ATCB_Key, To_Address (Self_Id));
pragma Assert (Result = 0);
end Set;
----------
-- Self --
----------
function Self return Task_ID is
Result : System.Address;
begin
Result := pthread_getspecific (ATCB_Key);
pragma Assert (Result /= System.Null_Address);
return To_Task_Id (Result);
end Self;
-------------------
-- Is_Valid_Task --
-------------------
function Is_Valid_Task return Boolean is
begin
return pthread_getspecific (ATCB_Key) /= System.Null_Address;
end Is_Valid_Task;
end Specific;
|
-- SPDX-FileCopyrightText: 2019 Max Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
package body Program.Nodes.Type_Conversions is
function Create
(Subtype_Mark : not null Program.Elements.Expressions
.Expression_Access;
Left_Bracket_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Operand : not null Program.Elements.Expressions
.Expression_Access;
Right_Bracket_Token : not null Program.Lexical_Elements
.Lexical_Element_Access)
return Type_Conversion is
begin
return Result : Type_Conversion :=
(Subtype_Mark => Subtype_Mark,
Left_Bracket_Token => Left_Bracket_Token, Operand => Operand,
Right_Bracket_Token => Right_Bracket_Token, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
function Create
(Subtype_Mark : not null Program.Elements.Expressions
.Expression_Access;
Operand : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Type_Conversion is
begin
return Result : Implicit_Type_Conversion :=
(Subtype_Mark => Subtype_Mark, Operand => Operand,
Is_Part_Of_Implicit => Is_Part_Of_Implicit,
Is_Part_Of_Inherited => Is_Part_Of_Inherited,
Is_Part_Of_Instance => Is_Part_Of_Instance, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
overriding function Subtype_Mark
(Self : Base_Type_Conversion)
return not null Program.Elements.Expressions.Expression_Access is
begin
return Self.Subtype_Mark;
end Subtype_Mark;
overriding function Operand
(Self : Base_Type_Conversion)
return not null Program.Elements.Expressions.Expression_Access is
begin
return Self.Operand;
end Operand;
overriding function Left_Bracket_Token
(Self : Type_Conversion)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Left_Bracket_Token;
end Left_Bracket_Token;
overriding function Right_Bracket_Token
(Self : Type_Conversion)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Right_Bracket_Token;
end Right_Bracket_Token;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Type_Conversion)
return Boolean is
begin
return Self.Is_Part_Of_Implicit;
end Is_Part_Of_Implicit;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Type_Conversion)
return Boolean is
begin
return Self.Is_Part_Of_Inherited;
end Is_Part_Of_Inherited;
overriding function Is_Part_Of_Instance
(Self : Implicit_Type_Conversion)
return Boolean is
begin
return Self.Is_Part_Of_Instance;
end Is_Part_Of_Instance;
procedure Initialize (Self : in out Base_Type_Conversion'Class) is
begin
Set_Enclosing_Element (Self.Subtype_Mark, Self'Unchecked_Access);
Set_Enclosing_Element (Self.Operand, Self'Unchecked_Access);
null;
end Initialize;
overriding function Is_Type_Conversion
(Self : Base_Type_Conversion)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Type_Conversion;
overriding function Is_Expression
(Self : Base_Type_Conversion)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Expression;
overriding procedure Visit
(Self : not null access Base_Type_Conversion;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is
begin
Visitor.Type_Conversion (Self);
end Visit;
overriding function To_Type_Conversion_Text
(Self : in out Type_Conversion)
return Program.Elements.Type_Conversions.Type_Conversion_Text_Access is
begin
return Self'Unchecked_Access;
end To_Type_Conversion_Text;
overriding function To_Type_Conversion_Text
(Self : in out Implicit_Type_Conversion)
return Program.Elements.Type_Conversions.Type_Conversion_Text_Access is
pragma Unreferenced (Self);
begin
return null;
end To_Type_Conversion_Text;
end Program.Nodes.Type_Conversions;
|
------------------------------------------------------------------------------
-- 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) $
package body XML_IO.Decoders.Streams is
----------
-- Read --
----------
procedure Read
(Input : in out Stream;
Buffer : in out String;
Last : out Natural) is
begin
Text_Streams.Read (Input.Input.all, Buffer, Last);
end Read;
end XML_IO.Decoders.Streams;
------------------------------------------------------------------------------
-- 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.
------------------------------------------------------------------------------
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of STMicroelectronics nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
-- --
-- This file is based on: --
-- --
-- @file stm32f4xx_hal_spi.h --
-- @author MCD Application Team --
-- @version V1.1.0 --
-- @date 19-June-2014 --
-- @brief Header file of SPI HAL module. --
-- --
-- COPYRIGHT(c) 2014 STMicroelectronics --
------------------------------------------------------------------------------
-- This file provides definitions for the STM32F4 (ARM Cortex M4F
-- from ST Microelectronics) Serial Peripheral Interface (SPI) facility.
private with STM32_SVD.SPI;
with HAL.SPI;
package STM32.SPI is
type Internal_SPI_Port is private;
type SPI_Port (Periph : not null access Internal_SPI_Port) is
limited new HAL.SPI.SPI_Port with private;
type SPI_Data_Direction is
(D2Lines_FullDuplex,
D2Lines_RxOnly,
D1Line_Rx,
D1Line_Tx);
type SPI_Mode is (Master, Slave);
type SPI_CLock_Polarity is (High, Low);
type SPI_CLock_Phase is (P1Edge, P2Edge);
type SPI_Slave_Management is (Software_Managed, Hardware_Managed);
type SPI_Baud_Rate_Prescaler is
(BRP_2, BRP_4, BRP_8, BRP_16, BRP_32, BRP_64, BRP_128, BRP_256);
type SPI_First_Bit is (MSB, LSB);
type SPI_Configuration is record
Direction : SPI_Data_Direction;
Mode : SPI_Mode;
Data_Size : HAL.SPI.SPI_Data_Size;
Clock_Polarity : SPI_CLock_Polarity;
Clock_Phase : SPI_CLock_Phase;
Slave_Management : SPI_Slave_Management;
Baud_Rate_Prescaler : SPI_Baud_Rate_Prescaler;
First_Bit : SPI_First_Bit;
CRC_Poly : UInt16;
Transmit_DMA : Boolean;
Receive_DMA : Boolean;
Fifo_Level : Boolean; -- When RXNE assserts: 1 For 8bit, 0 for 16bit
end record;
procedure Configure (This : in out SPI_Port; Conf : SPI_Configuration);
procedure Enable (This : in out SPI_Port);
procedure Disable (This : in out SPI_Port);
function Enabled (This : SPI_Port) return Boolean;
procedure Send (This : in out SPI_Port; Data : UInt16);
function Data (This : SPI_Port) return UInt16
with Inline;
procedure Send (This : in out SPI_Port; Data : UInt8);
function Data (This : SPI_Port) return UInt8
with Inline;
function Is_Busy (This : SPI_Port) return Boolean
with Inline;
function Rx_Is_Empty (This : SPI_Port) return Boolean
with Inline;
function Tx_Is_Empty (This : SPI_Port) return Boolean
with Inline;
function Busy (This : SPI_Port) return Boolean
with Inline;
-- function Channel_Side_Indicated (This : SPI_Port) return Boolean
-- with Inline;
-- function Underrun_Indicated (This : SPI_Port) return Boolean
-- with Inline;
function CRC_Error_Indicated (This : SPI_Port) return Boolean
with Inline;
function Mode_Fault_Indicated (This : SPI_Port) return Boolean
with Inline;
function Overrun_Indicated (This : SPI_Port) return Boolean
with Inline;
function Frame_Fmt_Error_Indicated (This : SPI_Port) return Boolean
with Inline;
procedure Clear_Overrun (This : SPI_Port);
procedure Reset_CRC (This : in out SPI_Port);
function CRC_Enabled (This : SPI_Port) return Boolean;
function Is_Data_Frame_16bit (This : SPI_Port) return Boolean;
function Current_Mode (This : SPI_Port) return SPI_Mode;
function Current_Data_Direction (This : SPI_Port) return SPI_Data_Direction;
-- The following I/O routines implement the higher level functionality for
-- CRC and data direction, among others.
type UInt8_Buffer is array (Natural range <>) of UInt8
with Alignment => 2;
-- The alignment is set to 2 because we treat component pairs as half_word
-- values when sending/receiving in 16-bit mode.
-- Blocking
overriding
function Data_Size (This : SPI_Port) return HAL.SPI.SPI_Data_Size;
overriding
procedure Transmit
(This : in out SPI_Port;
Data : HAL.SPI.SPI_Data_8b;
Status : out HAL.SPI.SPI_Status;
Timeout : Natural := 1000);
overriding
procedure Transmit
(This : in out SPI_Port;
Data : HAL.SPI.SPI_Data_16b;
Status : out HAL.SPI.SPI_Status;
Timeout : Natural := 1000);
procedure Transmit
(This : in out SPI_Port;
Outgoing : UInt8);
overriding
procedure Receive
(This : in out SPI_Port;
Data : out HAL.SPI.SPI_Data_8b;
Status : out HAL.SPI.SPI_Status;
Timeout : Natural := 1000);
overriding
procedure Transmit_Receive
(This : in out SPI_Port;
Outgoing : HAL.SPI.SPI_Data_8b;
Incoming : out HAL.SPI.SPI_Data_8b;
Status : out HAL.SPI.SPI_Status;
Timeout : Natural := 1000);
overriding
procedure Receive
(This : in out SPI_Port;
Data : out HAL.SPI.SPI_Data_16b;
Status : out HAL.SPI.SPI_Status;
Timeout : Natural := 1000);
procedure Receive
(This : in out SPI_Port;
Incoming : out UInt8);
procedure Transmit_Receive
(This : in out SPI_Port;
Outgoing : UInt8_Buffer;
Incoming : out UInt8_Buffer;
Size : Positive);
procedure Transmit_Receive
(This : in out SPI_Port;
Outgoing : UInt8;
Incoming : out UInt8);
-- TODO: add the other higher-level HAL routines for interrupts and DMA
private
type Internal_SPI_Port is new STM32_SVD.SPI.SPI_Peripheral;
type SPI_Port (Periph : not null access Internal_SPI_Port) is
limited new HAL.SPI.SPI_Port with null record;
procedure Send_Receive_16bit_Mode
(This : in out SPI_Port;
Outgoing : UInt8_Buffer;
Incoming : out UInt8_Buffer;
Size : Positive);
procedure Send_Receive_8bit_Mode
(This : in out SPI_Port;
Outgoing : UInt8_Buffer;
Incoming : out UInt8_Buffer;
Size : Positive);
procedure Send_16bit_Mode
(This : in out SPI_Port;
Outgoing : HAL.SPI.SPI_Data_16b);
procedure Send_8bit_Mode
(This : in out SPI_Port;
Outgoing : HAL.SPI.SPI_Data_8b);
procedure Receive_16bit_Mode
(This : in out SPI_Port;
Incoming : out HAL.SPI.SPI_Data_16b);
procedure Receive_8bit_Mode
(This : in out SPI_Port;
Incoming : out HAL.SPI.SPI_Data_8b);
end STM32.SPI;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- G N A T . C R C 3 2 --
-- --
-- B o d y --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
with Ada.Unchecked_Conversion;
package body GNAT.CRC32 is
------------
-- Update --
------------
procedure Update (C : in out CRC32; Value : String) is
begin
for K in Value'Range loop
Update (C, Value (K));
end loop;
end Update;
procedure Update (C : in out CRC32; Value : Ada.Streams.Stream_Element) is
function To_Char is new Ada.Unchecked_Conversion
(Ada.Streams.Stream_Element, Character);
V : constant Character := To_Char (Value);
begin
Update (C, V);
end Update;
procedure Update
(C : in out CRC32;
Value : Ada.Streams.Stream_Element_Array)
is
begin
for K in Value'Range loop
Update (C, Value (K));
end loop;
end Update;
-----------------
-- Wide_Update --
-----------------
procedure Wide_Update (C : in out CRC32; Value : Wide_Character) is
subtype S2 is String (1 .. 2);
function To_S2 is new Ada.Unchecked_Conversion (Wide_Character, S2);
VS : constant S2 := To_S2 (Value);
begin
Update (C, VS (1));
Update (C, VS (2));
end Wide_Update;
procedure Wide_Update (C : in out CRC32; Value : Wide_String) is
begin
for K in Value'Range loop
Wide_Update (C, Value (K));
end loop;
end Wide_Update;
end GNAT.CRC32;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- S Y S T E M . I M G _ L L B --
-- --
-- S p e c --
-- --
-- $Revision: 2 $ --
-- --
-- Copyright (c) 1992,1993,1994 NYU, All Rights Reserved --
-- --
-- The GNAT library is free software; you can redistribute it and/or modify --
-- it under terms of the GNU Library General Public License as published by --
-- the Free Software Foundation; either version 2, or (at your option) any --
-- later version. The GNAT library is distributed in the hope that it will --
-- be useful, but WITHOUT ANY WARRANTY; without even the implied warranty --
-- of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU --
-- Library General Public License for more details. You should have --
-- received a copy of the GNU Library General Public License along with --
-- the GNAT library; see the file COPYING.LIB. If not, write to the Free --
-- Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. --
-- --
------------------------------------------------------------------------------
-- Contains the routine for computing the image in based format of signed and
-- unsigned integers whose size > Integer'Size for use by Text_Io.Integer_Io,
-- Text_Io.Modular_Io, and the Img attribute.
with System.Unsigned_Types;
package System.Img_LLB is
pragma Preelaborate (Img_LLB);
procedure Set_Image_Based_Long_Long_Integer
(V : Long_Long_Integer;
B : Natural;
W : Integer;
S : out String;
P : in out Natural);
-- Sets the signed image of V in based format, using base value B (2..16)
-- starting at S (P + 1), updating P to point to the last character stored.
-- The image includes a leading minus sign if necessary, but no leading
-- spaces unless W is positive, in which case leading spaces are output if
-- necessary to ensure that the output string is no less than W characters
-- long. The caller promises that the buffer is large enough and no check
-- is made for this. Constraint_Error will not necessarily be raised if
-- this is violated, since it is perfectly valid to compile this unit with
-- checks off.
procedure Set_Image_Based_Long_Long_Unsigned
(V : System.Unsigned_Types.Long_Long_Unsigned;
B : Natural;
W : Integer;
S : out String;
P : in out Natural);
-- Sets the unsigned image of V in based format, using base value B (2..16)
-- starting at S (P + 1), updating P to point to the last character stored.
-- The image includes no leading spaces unless W is positive, in which case
-- leading spaces are output if necessary to ensure that the output string
-- is no less than W characters long. The caller promises that the buffer
-- is large enough and no check is made for this. Constraint_Error will not
-- necessarily be raised if this is violated, since it is perfectly valid
-- to compile this unit with checks off).
end System.Img_LLB;
|
-----------------------------------------------------------------------
-- awa-workspaces-beans -- Beans for module workspaces
-- Copyright (C) 2011, 2012 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.Basic;
with Util.Beans.Objects;
with Util.Beans.Methods;
with AWA.Events;
with AWA.Workspaces.Modules;
package AWA.Workspaces.Beans is
type Workspaces_Bean is new Util.Beans.Basic.Bean
and Util.Beans.Methods.Method_Bean with record
Module : AWA.Workspaces.Modules.Workspace_Module_Access := null;
Count : Natural := 0;
end record;
type Workspaces_Bean_Access is access all Workspaces_Bean'Class;
-- Get the value identified by the name.
overriding
function Get_Value (From : in Workspaces_Bean;
Name : in String) return Util.Beans.Objects.Object;
-- Set the value identified by the name.
overriding
procedure Set_Value (From : in out Workspaces_Bean;
Name : in String;
Value : in Util.Beans.Objects.Object);
-- This bean provides some methods that can be used in a Method_Expression
overriding
function Get_Method_Bindings (From : in Workspaces_Bean)
return Util.Beans.Methods.Method_Binding_Array_Access;
-- Event action called to create the workspace when the given event is posted.
procedure Create (Bean : in out Workspaces_Bean;
Event : in AWA.Events.Module_Event'Class);
-- Example of action method.
procedure Action (Bean : in out Workspaces_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
-- Create the Workspaces_Bean bean instance.
function Create_Workspaces_Bean (Module : in AWA.Workspaces.Modules.Workspace_Module_Access)
return Util.Beans.Basic.Readonly_Bean_Access;
end AWA.Workspaces.Beans;
|
-- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2018 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.Unchecked_Deallocation;
package body Orka.Smart_Pointers is
procedure Free is new Ada.Unchecked_Deallocation (Data_Record, Data_Record_Access);
function Is_Null (Object : Abstract_Pointer) return Boolean is (Object.Data = null);
function References (Object : Abstract_Pointer) return Natural is
(Object.Data.References.Count);
procedure Set
(Object : in out Abstract_Pointer;
Value : not null Object_Access) is
begin
if Object.Data /= null then
-- Decrement old reference count
Finalize (Object);
end if;
Object.Data := new Data_Record'(Object => Value, References => <>);
end Set;
function Get (Object : Mutable_Pointer) return Reference is
begin
return Reference'(Value => Object.Data.Object, Hold => Object);
end Get;
function Get (Object : Pointer) return Constant_Reference is
begin
return Constant_Reference'(Value => Object.Data.Object, Hold => Object);
end Get;
overriding
procedure Adjust (Object : in out Abstract_Pointer) is
begin
if Object.Data /= null then
Object.Data.References.Increment;
end if;
end Adjust;
overriding
procedure Finalize (Object : in out Abstract_Pointer) is
Zero : Boolean;
begin
if Object.Data /= null then
Object.Data.References.Decrement (Zero);
if Zero then
Free_Object (Object.Data.Object);
Free (Object.Data);
end if;
end if;
-- Idempotence: next call to Finalize has no effect
Object.Data := null;
end Finalize;
end Orka.Smart_Pointers;
|
-----------------------------------------------------------------------
-- awa-applications-configs -- Read application configuration files
-- Copyright (C) 2011, 2012, 2015, 2017 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 EL.Contexts.Default;
with Util.Serialize.IO.XML;
-- The <b>AWA.Applications.Configs</b> package reads the application configuration files.
package AWA.Applications.Configs is
-- XML reader configuration. By instantiating this generic package, the XML parser
-- gets initialized to read the configuration for servlets, filters, managed beans,
-- permissions, events and other configuration elements.
generic
Reader : in out Util.Serialize.IO.XML.Parser;
App : in Application_Access;
Context : in EL.Contexts.Default.Default_Context_Access;
Override_Context : in Boolean;
package Reader_Config is
end Reader_Config;
-- Read the application configuration file and configure the application
procedure Read_Configuration (App : in out Application'Class;
File : in String;
Context : in EL.Contexts.Default.Default_Context_Access;
Override_Context : in Boolean);
-- Get the configuration path for the application name.
-- The configuration path is search from:
-- o the current directory,
-- o the 'config' directory,
-- o the Dynamo installation directory in share/dynamo
function Get_Config_Path (Name : in String) return String;
end AWA.Applications.Configs;
|
------------------------------------------------------------------------------
-- Copyright (C) 2020 by Heisenbug Ltd. (gh+spat@heisenbug.eu)
--
-- This work is free. You can redistribute it and/or modify it under the
-- terms of the Do What The Fuck You Want To Public License, Version 2,
-- as published by Sam Hocevar. See the LICENSE file for more details.
------------------------------------------------------------------------------
pragma License (Unrestricted);
------------------------------------------------------------------------------
--
-- SPARK Proof Analysis Tool
--
-- S.P.A.T. - Object representing an entity (name) with a file location based
-- on a single source line (no column information).
--
------------------------------------------------------------------------------
with SPAT.Entity;
with SPAT.Field_Names;
with SPAT.Preconditions;
package SPAT.Entity_Line is
use all type GNATCOLL.JSON.JSON_Value_Type;
---------------------------------------------------------------------------
-- Has_Required_Fields
---------------------------------------------------------------------------
function Has_Required_Fields (Object : in JSON_Value) return Boolean is
(Preconditions.Ensure_Field (Object => Object,
Field => Field_Names.File,
Kind => JSON_String_Type) and
Preconditions.Ensure_Field (Object => Object,
Field => Field_Names.Line,
Kind => JSON_Int_Type));
type T is new Entity.T with private;
---------------------------------------------------------------------------
-- Create
---------------------------------------------------------------------------
not overriding
function Create (Object : in JSON_Value) return T with
Pre => Has_Required_Fields (Object => Object);
---------------------------------------------------------------------------
-- Image
---------------------------------------------------------------------------
overriding
function Image (This : T) return String;
---------------------------------------------------------------------------
-- File
---------------------------------------------------------------------------
not overriding
function File (This : in T) return Subject_Name;
---------------------------------------------------------------------------
-- Line
---------------------------------------------------------------------------
not overriding
function Line (This : in T) return Natural;
private
type T is new Entity.T with
record
File : Subject_Name;
Line : Natural;
end record;
---------------------------------------------------------------------------
-- File
---------------------------------------------------------------------------
not overriding
function File (This : in T) return Subject_Name is
(This.File);
---------------------------------------------------------------------------
-- Line
---------------------------------------------------------------------------
not overriding
function Line (This : in T) return Natural is
(This.Line);
end SPAT.Entity_Line;
|
with Ada.Text_IO;
package body Tagged_Subprogram_Calls is
package body Inner is
procedure P(A : E) is
begin
null;
end P;
end Inner;
procedure Test(Param : Inner.E) is
type F is new Inner.E range Param .. Inner.C;
O : F := B;
Q : Inner.E := Inner.B;
begin
P(O);
Inner.P(Q);
end Test;
procedure Test2 is
A : T;
B : T1 := (I => 42);
C : T'Class := A;
D : T'Class := B;
E : T1'Class := B;
F : T'Class := T_F(D);
begin
T_P(A);
T_P(B);
T_P(C);
T_P(D);
T_P(E);
T_Q(42, A);
T_Q(42, B);
T_Q(42, C);
T_Q(42, D);
T_Q(42, E);
A.T_P;
B.T_P;
C.T_P;
D.T_P;
E.T_P;
A.T_R(42);
B.T_R(42);
C.T_R(42);
D.T_R(42);
E.T_R(42);
D.T_F.T_P;
B.T_F.T_P;
D.T_F.T_R(42);
B.T_F.T_R(42);
D.T_G.T_R(42); -- D.T_G should yield class wide type, but doesn't
B.T_G.T_R(42);
if +D then
null;
end if;
end Test2;
procedure T_P(S : T) is null;
procedure T_P(S : T1) is null;
procedure T_P(S : T2) is null;
procedure T_Q(J : Integer; S : T) is null;
procedure T_Q(J : Integer; S : T1) is null;
procedure T_R(S : T; J : Integer) is
begin
Ada.Text_IO.Put_Line("T");
end T_R;
procedure T_R(S : T1; J : Integer) is
begin
Ada.Text_IO.Put_Line("T1");
end T_R;
procedure Test3 is
O1 : S1;
O2 : S'Class := O1;
O3 : I'Class := O1;
begin
O1.S_P;
O2.S_P;
O1.S_I;
O3.S_I;
end Test3;
procedure S_I(A : I1) is
begin
null;
end S_I;
procedure S_P(A : S1) is
begin
Ada.Text_IO.Put_Line("S1");
end S_P;
procedure S_I(A : S1) is
begin
Ada.Text_IO.Put_Line("S1");
end S_I;
procedure S_P(A : S2) is
begin
Ada.Text_IO.Put_Line("S2");
end S_P;
procedure S_I(A : S2) is
begin
Ada.Text_IO.Put_Line("S2");
end S_I;
procedure GP1(I : TP'Class) is
begin
PP(I);
end GP1;
procedure GPI is new GP1(TP => S, PP => S_P);
procedure GP2(I : TP'Class) is
procedure GPI is new GP1(TP => TP, PP => PP);
begin
null;
end GP2;
task body TI is
begin
accept E;
end TI;
task body TIT is
begin
accept E;
end TIT;
protected body PI is
entry E when True is
begin
null;
end E;
end PI;
protected body PIT is
entry E when True is
begin
null;
end E;
end PIT;
end Tagged_Subprogram_Calls;
|
package body HTML_Table is
procedure Print(Items: Item_Array; Column_Heads: Header_Array) is
function Blanks(N: Natural) return String is
-- indention for better readable HTML
begin
if N=0 then
return "";
else
return " " & Blanks(N-1);
end if;
end Blanks;
procedure Print_Row(Row_Number: Positive) is
begin
Put(Blanks(4) & "<tr><td>" & Positive'Image(Row_Number) & "</td>");
for I in Items'Range(2) loop
Put("<td>" & To_String(Items(Row_Number, I)) & "</td>");
end loop;
Put_Line("</tr>");
end Print_Row;
procedure Print_Body is
begin
Put_Line(Blanks(2)&"<tbody align = ""right"">");
for I in Items'Range(1) loop
Print_Row(I);
end loop;
Put_Line(Blanks(2)&"</tbody>");
end Print_Body;
procedure Print_Header is
function To_Str(U: U_String) return String renames
Ada.Strings.Unbounded.To_String;
begin
Put_Line(Blanks(2) & "<thead align = ""right"">");
Put(Blanks(4) & "<tr><th></th>");
for I in Column_Heads'Range loop
Put("<td>" & To_Str(Column_Heads(I)) & "</td>");
end loop;
Put_Line("</tr>");
Put_Line(Blanks(2) & "</thead>");
end Print_Header;
begin
if Items'Length(2) /= Column_Heads'Length then
raise Constraint_Error with "number of headers /= number of columns";
end if;
Put_Line("<table>");
Print_Header;
Print_Body;
Put_Line("</table>");
end Print;
end HTML_Table;
|
-- Copyright 2019 Patrick Kelly (entomy)
--
-- 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 Actions is
end Actions;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- G N A T . E X C E P T I O N _ T R A C E S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2000-2020, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package provides an interface allowing to control *automatic* output
-- to standard error upon exception occurrences (as opposed to explicit
-- generation of traceback information using System.Traceback).
-- See file s-exctra.ads for full documentation of the interface
with System.Exception_Traces;
package GNAT.Exception_Traces renames System.Exception_Traces;
|
function Ada.Strings.Generic_Unbounded.Generic_Hash (Key : Unbounded_String)
return Containers.Hash_Type
is
pragma Suppress (Access_Check);
begin
return Fixed_Hash (Key.Data.Items (1 .. Key.Length));
end Ada.Strings.Generic_Unbounded.Generic_Hash;
|
with Ada.Streams;
with Bitmaps.RGB;
package Bitmaps.IO is
procedure Write_PPM_P6(To : not null access Ada.Streams.Root_Stream_Type'Class;
Source : in Bitmaps.RGB.Image);
end Bitmaps.IO;
|
-- Copyright 2019-2021 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with Some_Package;
procedure Foo is
Some_Val : Integer := 0;
begin
Some_Package.Do_Something (Some_Val);
if Some_Val = 1 then
raise Some_Package.Some_Kind_Of_Error;
end if;
end Foo;
|
-- Copyright 2010-2019 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with Pack; use Pack;
procedure P is
begin
Print (4, 5);
end P;
|
------------------------------------------------------------------------------
-- --
-- File: --
-- formatted_output.ads --
-- --
-- Description: --
-- Formatted_Output package specification, contains prototypes of --
-- miscellaneous conversion functions and support for formatted output --
-- of standard fixed-length strings --
-- --
-- Author: --
-- Eugene Nonko, cm@liceum.secna.ru --
-- --
-- Revision history: --
-- 27/01/99 - original --
-- 14/03/99 - Format function renamed to "+" the unary operator --
-- --
------------------------------------------------------------------------------
with Ada.Strings.Unbounded,
Ada.Text_IO;
use Ada.Text_IO;
package Formatted_Output is
type Format_Type is limited private;
function "+" (Fmt_String : String) return Format_Type;
-- Converts String to Format_Type
function "&" (Fmt : Format_Type; Value : String) return Format_Type;
-- Replaces leftmost formatting sequence in Fmt with formatted
-- Value string, then returns Fmt. Raises exception Format_Error
-- when invalid string formatting sequence is found or no formatting
-- sequence found at all
procedure Put (Fmt : Format_Type);
-- Puts formatted string to console using Ada.Text_IO
-- Defined as Ada.Text_IO.Put (To_String (Fmt));
-- Example:
-- Put (+"%s %s %s\n" & "Just" & "a" & "test");
procedure Put (File : File_Type; Fmt : Format_Type);
-- Puts formatted string to file using Ada.Text_IO
-- Defined as Ada.Text_IO.Put (File, To_String (Fmt));
function To_String (Fmt : Format_Type) return String;
-- Convert formatted string to fixed-length string
-- Example:
-- Send_To_Terminal (To_String (+"Hello %s\n" & "world"));
Format_Error : exception;
-- Format_Error exception raised when bad format detected
Filler : Character := ' ';
-- Filling character, used when padding strings
private
type Format_Type is new Ada.Strings.Unbounded.Unbounded_String;
Maximal_Item_Length : constant := 4096;
function Scan_To_Percent_Sign (Fmt : Format_Type) return Integer;
-- Scans string to the first occurence of percent sign ignoring the double
-- percent, returns index of the found sign or zero, if no percent sign is
-- found
end Formatted_Output;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Tools Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2009, 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 defines SAX reader for load segments information. An
-- implementation assumes input source is a valid file.
------------------------------------------------------------------------------
private with Ada.Strings.Unbounded;
with Sax.Attributes;
with SAX.Readers;
with Unicode.CES;
package Segments_Readers is
type Segments_Reader is new SAX.Readers.Reader with private;
overriding procedure Start_Element
(Self : in out Segments_Reader;
Namespace_URI : Unicode.CES.Byte_Sequence := "";
Local_Name : Unicode.CES.Byte_Sequence := "";
Qname : Unicode.CES.Byte_Sequence := "";
Attrs : Sax.Attributes.Attributes'Class);
overriding procedure End_Element
(Self : in out Segments_Reader;
Namespace_URI : Unicode.CES.Byte_Sequence := "";
Local_Name : Unicode.CES.Byte_Sequence := "";
Qname : Unicode.CES.Byte_Sequence := "");
overriding procedure Characters
(Self : in out Segments_Reader;
Ch : Unicode.CES.Byte_Sequence);
private
type Segments_Reader is new SAX.Readers.Reader with record
C : Ada.Strings.Unbounded.Unbounded_String;
end record;
end Segments_Readers;
|
private with Ada.Text_IO;
private with GNAT.OS_Lib;
private with CLIC.Subcommand.Instance;
private with CLIC.TTY;
package CLIC_Ex.Commands is
procedure Execute;
private
procedure Set_Global_Switches
(Config : in out CLIC.Subcommand.Switches_Configuration);
package Sub_Cmd is new CLIC.Subcommand.Instance
(Main_Command_Name => "clic_example",
Version => "0.0.0",
Set_Global_Switches => Set_Global_Switches,
Put => Ada.Text_IO.Put,
Put_Line => Ada.Text_IO.Put_Line,
Put_Error => Ada.Text_IO.Put_Line,
Error_Exit => GNAT.OS_Lib.OS_Exit,
TTY_Chapter => CLIC.TTY.Info,
TTY_Description => CLIC.TTY.Description,
TTY_Version => CLIC.TTY.Version,
TTY_Underline => CLIC.TTY.Underline,
TTY_Emph => CLIC.TTY.Emph);
end CLIC_Ex.Commands;
|
-- Copyright 2012-2019 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with System;
package Pck is
procedure Do_Nothing (A : System.Address);
end Pck;
|
------------------------------------------------------------------------------
-- --
-- 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.Decision_Nodes.Collections is
pragma Preelaborate;
package UML_Decision_Node_Collections is
new AMF.Generic_Collections
(UML_Decision_Node,
UML_Decision_Node_Access);
type Set_Of_UML_Decision_Node is
new UML_Decision_Node_Collections.Set with null record;
Empty_Set_Of_UML_Decision_Node : constant Set_Of_UML_Decision_Node;
type Ordered_Set_Of_UML_Decision_Node is
new UML_Decision_Node_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_UML_Decision_Node : constant Ordered_Set_Of_UML_Decision_Node;
type Bag_Of_UML_Decision_Node is
new UML_Decision_Node_Collections.Bag with null record;
Empty_Bag_Of_UML_Decision_Node : constant Bag_Of_UML_Decision_Node;
type Sequence_Of_UML_Decision_Node is
new UML_Decision_Node_Collections.Sequence with null record;
Empty_Sequence_Of_UML_Decision_Node : constant Sequence_Of_UML_Decision_Node;
private
Empty_Set_Of_UML_Decision_Node : constant Set_Of_UML_Decision_Node
:= (UML_Decision_Node_Collections.Set with null record);
Empty_Ordered_Set_Of_UML_Decision_Node : constant Ordered_Set_Of_UML_Decision_Node
:= (UML_Decision_Node_Collections.Ordered_Set with null record);
Empty_Bag_Of_UML_Decision_Node : constant Bag_Of_UML_Decision_Node
:= (UML_Decision_Node_Collections.Bag with null record);
Empty_Sequence_Of_UML_Decision_Node : constant Sequence_Of_UML_Decision_Node
:= (UML_Decision_Node_Collections.Sequence with null record);
end AMF.UML.Decision_Nodes.Collections;
|
-- C64103B.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, FOR IN-OUT PARAMETERS OF A SCALAR TYPE,
-- CONSTRAINT_ERROR IS RAISED:
-- BEFORE A SUBPROGRAM CALL WHEN THE CONVERTED ACTUAL
-- PARAMETER IS OUTSIDE THE RANGE OF THE FORMAL PARAMETER'S
-- SUBTYPE;
-- AFTER A SUBPROGRAM CALL WHEN THE CONVERTED FORMAL PARAMETER
-- IS OUTSIDE THE RANGE OF THE ACTUAL PARAMETER'S SUBTYPE.
-- HISTORY:
-- CPP 07/18/84 CREATED ORIGINAL TEST.
-- VCL 10/27/87 MODIFIED THIS HEADER; ADDED STATEMENTS WHICH
-- REFERENCED THE ACTUAL PARAMETERS IN THE SECOND
-- SUBTEST.
WITH REPORT; USE REPORT;
PROCEDURE C64103B IS
BEGIN
TEST ("C64103B", "FOR IN-OUT PARAMETERS OF A SCALAR TYPE, " &
"CONSTRAINT_ERROR IS RAISED: BEFORE A " &
"SUBPROGRAM CALL WHEN THE CONVERTED ACTUAL " &
"PARAMETER IS OUTSIDE THE RANGE OF THE FORMAL " &
"PARAMETER'S SUBTYPE; AFTER A SUBPROGRAM " &
"CALL WHEN THE CONVERTED FORMAL PARAMETER IS " &
"OUTSIDE THE RANGE OF THE ACTUAL PARAMETER'S " &
"SUBTYPE");
DECLARE
A0 : INTEGER := -9;
A1 : INTEGER := IDENT_INT(-1);
TYPE SUBINT IS RANGE -8 .. -2;
TYPE FLOAT_TYPE IS DIGITS 3 RANGE 0.0 .. 3.0;
A2 : FLOAT_TYPE := 0.12;
A3 : FLOAT_TYPE := 2.5;
TYPE NEW_FLOAT IS DIGITS 3 RANGE 1.0 .. 2.0;
TYPE FIXED_TYPE IS DELTA 1.0 RANGE -2.0 .. 5.0;
A4 : FIXED_TYPE := -2.0;
A5 : FIXED_TYPE := 4.0;
TYPE NEW_FIXED IS DELTA 1.0 RANGE -1.0 .. 3.0;
A6 : CHARACTER := 'A';
SUBTYPE SUPER_CHAR IS CHARACTER RANGE 'B'..'Q';
TYPE COLOR IS (RED, BURGUNDY, LILAC, MAROON, MAGENTA);
SUBTYPE A_COLOR IS COLOR RANGE RED..LILAC;
SUBTYPE B_COLOR IS COLOR RANGE MAROON..MAGENTA;
A7 : B_COLOR := MAROON;
PROCEDURE P1 (X : IN OUT SUBINT;
S : STRING) IS
BEGIN
FAILED ("EXCEPTION NOT RAISED BEFORE CALL -P1 (A" &
S & ")");
END P1;
PROCEDURE P2 (X : IN OUT NEW_FLOAT;
S : STRING) IS
BEGIN
FAILED ("EXCEPTION NOT RAISED BEFORE CALL -P2 (A" &
S & ")");
END P2;
PROCEDURE P3 (X : IN OUT NEW_FIXED;
S : STRING) IS
BEGIN
FAILED ("EXCEPTION NOT RAISED BEFORE CALL -P3 (A" &
S & ")");
END P3;
PROCEDURE P4 (X : IN OUT SUPER_CHAR;
S : STRING) IS
BEGIN
FAILED ("EXCEPTION NOT RAISED BEFORE CALL -P4 (A" &
S & ")");
END P4;
PROCEDURE P5 (X : IN OUT A_COLOR;
S : STRING) IS
BEGIN
FAILED ("EXCEPTION NOT RAISED BEFORE CALL -P5 (A" &
S & ")");
END P5;
BEGIN
BEGIN
P1 (SUBINT (A0), "1");
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -P1 (A1)");
END;
BEGIN
P1 (SUBINT (A1), "2");
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -P1 (A2)");
END;
BEGIN
P2 (NEW_FLOAT (A2), "1");
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -P2 (A1)");
END;
BEGIN
P2 (NEW_FLOAT (A3), "2");
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -P2 (A2)");
END;
BEGIN
P3 (NEW_FIXED (A4), "1");
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -P3 (A1)");
END;
BEGIN
P3 (NEW_FIXED (A5), "2");
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -P3 (A2)");
END;
BEGIN
P4 (SUPER_CHAR (A6),"1");
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -P4 (A1)");
END;
BEGIN
P5 (A_COLOR (A7), "1");
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -P5 (A1)");
END;
END;
DECLARE
CALLED : BOOLEAN;
TYPE SUBINT IS RANGE -8 .. -2;
A0 : SUBINT := -3;
A1 : INTEGER := -9;
A2 : INTEGER := -1;
TYPE FLOAT IS DIGITS 3 RANGE -1.0 .. 2.0;
TYPE A_FLOAT IS DIGITS 3 RANGE 0.0 .. 1.0;
A3 : A_FLOAT := 1.0;
A4 : FLOAT := -0.5;
A5 : FLOAT := 1.5;
TYPE NEW_FIXED IS DELTA 1.0 RANGE -1.0 .. 3.0;
A6 : NEW_FIXED := 0.0;
TYPE FIXED_TYPE IS DELTA 1.0 RANGE -2.0 .. 5.0;
A7 : FIXED_TYPE := -2.0;
A8 : FIXED_TYPE := 4.0;
SUBTYPE SUPER_CHAR IS CHARACTER RANGE 'B'..'Q';
A9 : SUPER_CHAR := 'C';
A10 : CHARACTER := 'A';
A11 : CHARACTER := 'R';
PROCEDURE P1 (X : IN OUT INTEGER; Y : INTEGER) IS
BEGIN
CALLED := TRUE;
X := IDENT_INT (Y);
END P1;
PROCEDURE P2 (X : IN OUT FLOAT; Y : FLOAT) IS
BEGIN
CALLED := TRUE;
X := Y;
END P2;
PROCEDURE P3 ( X : IN OUT FIXED_TYPE; Y : FIXED_TYPE) IS
BEGIN
CALLED := TRUE;
X := Y;
END P3;
PROCEDURE P4 (X : IN OUT CHARACTER; Y : CHARACTER) IS
BEGIN
CALLED := TRUE;
X := IDENT_CHAR(Y);
END P4;
BEGIN
BEGIN
CALLED := FALSE;
P1 (INTEGER(A0), A1);
IF A0 = -3 THEN
FAILED ("EXCEPTION NOT RAISED AFTER CALL -P1 (B1)");
ELSE
FAILED ("EXCEPTION NOT RAISED AFTER CALL -P1 (B2)");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
IF NOT CALLED THEN
FAILED ("EXCEPTION RAISED BEFORE CALL " &
"-P1 (B1)");
END IF;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -P1 (B1)");
END;
BEGIN
CALLED := FALSE;
P1 (INTEGER(A0), A2);
IF A0 = -3 THEN
FAILED ("EXCEPTION NOT RAISED AFTER CALL -P1 (B3)");
ELSE
FAILED ("EXCEPTION NOT RAISED AFTER CALL -P1 (B4)");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
IF NOT CALLED THEN
FAILED ("EXCEPTION RAISED BEFORE CALL " &
"-P1 (B2)");
END IF;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -P1 (B2)");
END;
BEGIN
CALLED := FALSE;
P2 (FLOAT (A3), A4);
IF A3 = 1.0 THEN
FAILED ("EXCEPTION NOT RAISED AFTER CALL -P2 (B1)");
ELSE
FAILED ("EXCEPTION NOT RAISED AFTER CALL -P2 (B2)");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
IF NOT CALLED THEN
FAILED ("EXCEPTION RAISED BEFORE CALL " &
"-P2 (B1)");
END IF;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -P2 (B1)");
END;
BEGIN
CALLED := FALSE;
P2 (FLOAT (A3), A5);
IF A3 = 1.0 THEN
FAILED ("EXCEPTION NOT RAISED -P2 (B3)");
ELSE
FAILED ("EXCEPTION NOT RAISED -P2 (B4)");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
IF NOT CALLED THEN
FAILED ("EXCEPTION RAISED BEFORE CALL " &
"-P2 (B2)");
END IF;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -P2 (B2)");
END;
BEGIN
CALLED := FALSE;
P3 (FIXED_TYPE (A6), A7);
IF A6 = 0.0 THEN
FAILED ("EXCEPTION NOT RAISED -P3 (B1)");
ELSE
FAILED ("EXCEPTION NOT RAISED -P3 (B2)");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
IF NOT CALLED THEN
FAILED ("EXCEPTION RAISED BEFORE CALL " &
"-P3 (B1)");
END IF;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -P3 (B1)");
END;
BEGIN
CALLED := FALSE;
P3 (FIXED_TYPE (A6), A8);
IF A6 = 0.0 THEN
FAILED ("EXCEPTION NOT RAISED -P3 (B3)");
ELSE
FAILED ("EXCEPTION NOT RAISED -P3 (B4)");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
IF NOT CALLED THEN
FAILED ("EXCEPTION RAISED BEFORE CALL " &
"-P3 (B2)");
END IF;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -P3 (B2)");
END;
BEGIN
CALLED := FALSE;
P4 (CHARACTER (A9), A10);
IF A9 = 'C' THEN
FAILED ("EXCEPTION NOT RAISED AFTER CALL -P4 (B1)");
ELSE
FAILED ("EXCEPTION NOT RAISED AFTER CALL -P4 (B2)");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
IF NOT CALLED THEN
FAILED ("EXCEPTION RAISED BEFORE CALL " &
"-P4 (B1)");
END IF;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -P4 (B1)");
END;
BEGIN
CALLED := FALSE;
P4 (CHARACTER (A9), A11);
IF A9 = 'C' THEN
FAILED ("EXCEPTION NOT RAISED AFTER CALL -P4 (B3)");
ELSE
FAILED ("EXCEPTION NOT RAISED AFTER CALL -P4 (B4)");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
IF NOT CALLED THEN
FAILED ("EXCEPTION RAISED BEFORE CALL " &
"-P4 (B2)");
END IF;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -P4 (B2)");
END;
END;
RESULT;
END C64103B;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Slim.Message_Visiters;
package body Slim.Messages.DSCO is
List : constant Field_Description_Array :=
(1 => (Uint_8_Field, 1)); -- Disconnection reasons
----------
-- Read --
----------
overriding function Read
(Data : not null access
League.Stream_Element_Vectors.Stream_Element_Vector)
return DSCO_Message is
begin
return Result : DSCO_Message do
Read_Fields (Result, List, Data.all);
end return;
end Read;
-----------
-- Visit --
-----------
overriding procedure Visit
(Self : not null access DSCO_Message;
Visiter : in out Slim.Message_Visiters.Visiter'Class)
is
begin
Visiter.DSCO (Self);
end Visit;
-----------
-- Write --
-----------
overriding procedure Write
(Self : DSCO_Message;
Tag : out Message_Tag;
Data : out League.Stream_Element_Vectors.Stream_Element_Vector)
is
begin
Tag := "DSCO";
Write_Fields (Self, List, Data);
end Write;
end Slim.Messages.DSCO;
|
with Selection;
with Ada.Text_IO;
procedure Main is
Arr: Selection.Arr (0 .. 3) := (5, 8, 6, 2);
begin
for I in Arr'Range loop
Ada.Text_IO.Put_Line(Arr (I)'Image);
end loop;
Selection.Sort(Arr);
Ada.Text_IO.Put_Line("Sorted:");
for I in Arr'Range loop
Ada.Text_IO.Put_Line(Arr (I)'Image);
end loop;
end Main;
|
with System;
with C.string;
package body MPFR.Root_FR is
use type C.signed_int;
procedure memcpy (dst, src : System.Address; n : C.size_t)
with Import, Convention => Intrinsic, External_Name => "__builtin_memcpy";
-- implementation
function To_MP_Float (
X : Long_Long_Float;
Precision : MPFR.Precision;
Rounding : MPFR.Rounding)
return MP_Float
is
Dummy : C.signed_int;
begin
return Result : MP_Float (Precision) do
Dummy :=
C.mpfr.mpfr_set_ld (
Controlled.Reference (Result),
C.long_double (X),
C.mpfr.mpfr_rnd_t'Enum_Val (MPFR.Rounding'Enum_Rep (Rounding)));
end return;
end To_MP_Float;
function To_Long_Long_Float (X : MP_Float; Rounding : MPFR.Rounding)
return Long_Long_Float is
begin
return Long_Long_Float (C.mpfr.mpfr_get_ld (
Controlled.Constant_Reference (X),
C.mpfr.mpfr_rnd_t'Enum_Val (MPFR.Rounding'Enum_Rep (Rounding))));
end To_Long_Long_Float;
function Image (
Value : MP_Float;
Base : Number_Base := 10;
Rounding : MPFR.Rounding)
return String
is
Raw_Value : constant not null access constant C.mpfr.mpfr_struct :=
Controlled.Constant_Reference (Value);
begin
if C.mpfr.mpfr_nan_p (Raw_Value) /= 0 then
return "NAN";
elsif C.mpfr.mpfr_inf_p (Raw_Value) /= 0 then
declare
Image : constant String := "-INF";
Sign : constant Integer range 0 .. 1 :=
Integer (C.mpfr.mpfr_signbit (Raw_Value));
begin
return Image (Image'First + 1 - Sign .. Image'Last);
end;
else
declare
Exponent : aliased C.mpfr.mpfr_exp_t;
Image : constant C.char_ptr :=
C.mpfr.mpfr_get_str (
null,
Exponent'Access,
C.signed_int (Base),
0,
Raw_Value,
C.mpfr.mpfr_rnd_t'Enum_Val (MPFR.Rounding'Enum_Rep (Rounding)));
Length : constant Natural := Integer (C.string.strlen (Image));
Ada_Image : String (1 .. Length);
for Ada_Image'Address use Image.all'Address;
Sign_Width : constant Natural :=
Boolean'Pos (Length > 0 and then Ada_Image (1) = '-');
Exponent_P : constant Natural := Integer (Exponent) + Sign_Width;
begin
if Length = 0 then
C.mpfr.mpfr_free_str (Image);
return "0";
elsif Exponent_P >= Length then
return Result : String (1 .. Exponent_P) do
Result (1 .. Length) := Ada_Image;
Result (Length + 1 .. Result'Last) := (others => '0');
C.mpfr.mpfr_free_str (Image);
end return;
elsif Exponent_P > 0 then
return Result : String (1 .. Length + 1) do -- add '.'
Result (Result'First .. Exponent_P) :=
Ada_Image (Ada_Image'First .. Exponent_P);
Result (Result'First + Exponent_P) := '.';
Result (Result'First + Exponent_P + 1 .. Result'Last) :=
Ada_Image (Ada_Image'First + Exponent_P .. Ada_Image'Last);
C.mpfr.mpfr_free_str (Image);
end return;
else
declare
Zero_Width : constant Natural := -Integer (Exponent);
begin
return Result : String (1 .. Length + Zero_Width + 2) do -- add "0."
if Sign_Width > 0 then
Result (Result'First) := '-';
end if;
Result (Result'First + Sign_Width) := '0';
Result (Result'First + Sign_Width + 1) := '.';
Result (
Result'First + Sign_Width + 2 .. Result'First + Sign_Width + Zero_Width + 1) :=
(others => '0');
Result (Result'First + Sign_Width + Zero_Width + 2 .. Result'Last) :=
Ada_Image (Ada_Image'First + Sign_Width .. Ada_Image'Last);
C.mpfr.mpfr_free_str (Image);
end return;
end;
end if;
end;
end if;
end Image;
function Value (
Image : String;
Base : Number_Base := 10;
Precision : MPFR.Precision;
Rounding : MPFR.Rounding)
return MP_Float
is
Image_Length : constant C.size_t := Image'Length;
C_Image : C.char_array (0 .. Image_Length); -- NUL
begin
memcpy (C_Image'Address, Image'Address, Image_Length);
C_Image (Image_Length) := C.char'Val (0);
return Result : MP_Float (Precision) do
if C.mpfr.mpfr_set_str (
Controlled.Reference (Result),
C_Image (C_Image'First)'Access,
C.signed_int (Base),
C.mpfr.mpfr_rnd_t'Enum_Val (MPFR.Rounding'Enum_Rep (Rounding))) < 0
then
raise Constraint_Error;
end if;
end return;
end Value;
function "=" (Left, Right : MP_Float) return Boolean is
begin
return C.mpfr.mpfr_cmp (
Controlled.Constant_Reference (Left),
Controlled.Constant_Reference (Right)) = 0;
end "=";
function "<" (Left, Right : MP_Float) return Boolean is
begin
return C.mpfr.mpfr_cmp (
Controlled.Constant_Reference (Left),
Controlled.Constant_Reference (Right)) < 0;
end "<";
function ">" (Left, Right : MP_Float) return Boolean is
begin
return C.mpfr.mpfr_cmp (
Controlled.Constant_Reference (Left),
Controlled.Constant_Reference (Right)) > 0;
end ">";
function "<=" (Left, Right : MP_Float) return Boolean is
begin
return C.mpfr.mpfr_cmp (
Controlled.Constant_Reference (Left),
Controlled.Constant_Reference (Right)) <= 0;
end "<=";
function ">=" (Left, Right : MP_Float) return Boolean is
begin
return C.mpfr.mpfr_cmp (
Controlled.Constant_Reference (Left),
Controlled.Constant_Reference (Right)) >= 0;
end ">=";
function Copy (
Right : MP_Float;
Precision : MPFR.Precision := Default_Precision;
Rounding : MPFR.Rounding := Default_Rounding)
return MP_Float
is
Dummy : C.signed_int;
begin
return Result : MP_Float (Precision) do
Dummy :=
C.mpfr.mpfr_set4 (
Controlled.Reference (Result),
Controlled.Constant_Reference (Right),
C.mpfr.mpfr_rnd_t'Enum_Val (MPFR.Rounding'Enum_Rep (Rounding)),
+1);
end return;
end Copy;
function Negative (
Right : MP_Float;
Precision : MPFR.Precision;
Rounding : MPFR.Rounding)
return MP_Float
is
Dummy : C.signed_int;
begin
return Result : MP_Float (Precision) do
Dummy :=
C.mpfr.mpfr_neg (
Controlled.Reference (Result),
Controlled.Constant_Reference (Right),
C.mpfr.mpfr_rnd_t'Enum_Val (MPFR.Rounding'Enum_Rep (Rounding)));
end return;
end Negative;
function Add (
Left, Right : MP_Float;
Precision : MPFR.Precision;
Rounding : MPFR.Rounding)
return MP_Float
is
Dummy : C.signed_int;
begin
return Result : MP_Float (Precision) do
Dummy :=
C.mpfr.mpfr_add (
Controlled.Reference (Result),
Controlled.Constant_Reference (Left),
Controlled.Constant_Reference (Right),
C.mpfr.mpfr_rnd_t'Enum_Val (MPFR.Rounding'Enum_Rep (Rounding)));
end return;
end Add;
function Add (
Left : MP_Float;
Right : Long_Long_Float;
Precision : MPFR.Precision;
Rounding : MPFR.Rounding)
return MP_Float
is
Dummy : C.signed_int;
Right2 : C.mpfr.mpfr_t := (others => (others => <>));
begin
return Result : MP_Float (Precision) do
C.mpfr.mpfr_init2 (Right2 (0)'Access, C.mpfr.mpfr_prec_t (Precision));
Dummy :=
C.mpfr.mpfr_set_ld (
Right2 (0)'Access,
C.long_double (Right),
C.mpfr.mpfr_rnd_t'Enum_Val (MPFR.Rounding'Enum_Rep (Rounding)));
Dummy :=
C.mpfr.mpfr_add (
Controlled.Reference (Result),
Controlled.Constant_Reference (Left),
Right2 (0)'Access,
C.mpfr.mpfr_rnd_t'Enum_Val (MPFR.Rounding'Enum_Rep (Rounding)));
C.mpfr.mpfr_clear (Right2 (0)'Access);
end return;
end Add;
function Add (
Left : Long_Long_Float;
Right : MP_Float;
Precision : MPFR.Precision;
Rounding : MPFR.Rounding)
return MP_Float is
begin
return Add (Right, Left, Precision, Rounding);
end Add;
function Subtract (
Left, Right : MP_Float;
Precision : MPFR.Precision;
Rounding : MPFR.Rounding)
return MP_Float
is
Dummy : C.signed_int;
begin
return Result : MP_Float (Precision) do
Dummy :=
C.mpfr.mpfr_sub (
Controlled.Reference (Result),
Controlled.Constant_Reference (Left),
Controlled.Constant_Reference (Right),
C.mpfr.mpfr_rnd_t'Enum_Val (MPFR.Rounding'Enum_Rep (Rounding)));
end return;
end Subtract;
function Subtract (
Left : MP_Float;
Right : Long_Long_Float;
Precision : MPFR.Precision;
Rounding : MPFR.Rounding)
return MP_Float
is
Dummy : C.signed_int;
Right2 : C.mpfr.mpfr_t := (others => (others => <>));
begin
return Result : MP_Float (Precision) do
C.mpfr.mpfr_init2 (Right2 (0)'Access, C.mpfr.mpfr_prec_t (Precision));
Dummy :=
C.mpfr.mpfr_set_ld (
Right2 (0)'Access,
C.long_double (Right),
C.mpfr.mpfr_rnd_t'Enum_Val (MPFR.Rounding'Enum_Rep (Rounding)));
Dummy :=
C.mpfr.mpfr_sub (
Controlled.Reference (Result),
Controlled.Constant_Reference (Left),
Right2 (0)'Access,
C.mpfr.mpfr_rnd_t'Enum_Val (MPFR.Rounding'Enum_Rep (Rounding)));
C.mpfr.mpfr_clear (Right2 (0)'Access);
end return;
end Subtract;
function Subtract (
Left : Long_Long_Float;
Right : MP_Float;
Precision : MPFR.Precision;
Rounding : MPFR.Rounding)
return MP_Float
is
Dummy : C.signed_int;
Left2 : C.mpfr.mpfr_t := (others => (others => <>));
begin
return Result : MP_Float (Precision) do
C.mpfr.mpfr_init2 (Left2 (0)'Access, C.mpfr.mpfr_prec_t (Precision));
Dummy :=
C.mpfr.mpfr_set_ld (
Left2 (0)'Access,
C.long_double (Left),
C.mpfr.mpfr_rnd_t'Enum_Val (MPFR.Rounding'Enum_Rep (Rounding)));
Dummy :=
C.mpfr.mpfr_sub (
Controlled.Reference (Result),
Left2 (0)'Access,
Controlled.Constant_Reference (Right),
C.mpfr.mpfr_rnd_t'Enum_Val (MPFR.Rounding'Enum_Rep (Rounding)));
C.mpfr.mpfr_clear (Left2 (0)'Access);
end return;
end Subtract;
function Multiply (
Left, Right : MP_Float;
Precision : MPFR.Precision;
Rounding : MPFR.Rounding)
return MP_Float
is
Dummy : C.signed_int;
begin
return Result : MP_Float (Precision) do
Dummy :=
C.mpfr.mpfr_mul (
Controlled.Reference (Result),
Controlled.Constant_Reference (Left),
Controlled.Constant_Reference (Right),
C.mpfr.mpfr_rnd_t'Enum_Val (MPFR.Rounding'Enum_Rep (Rounding)));
end return;
end Multiply;
function Multiply (
Left : MP_Float;
Right : Long_Long_Float;
Precision : MPFR.Precision;
Rounding : MPFR.Rounding)
return MP_Float
is
Dummy : C.signed_int;
Right2 : C.mpfr.mpfr_t := (others => (others => <>));
begin
return Result : MP_Float (Precision) do
C.mpfr.mpfr_init2 (Right2 (0)'Access, C.mpfr.mpfr_prec_t (Precision));
Dummy :=
C.mpfr.mpfr_set_ld (
Right2 (0)'Access,
C.long_double (Right),
C.mpfr.mpfr_rnd_t'Enum_Val (MPFR.Rounding'Enum_Rep (Rounding)));
Dummy :=
C.mpfr.mpfr_mul (
Controlled.Reference (Result),
Controlled.Constant_Reference (Left),
Right2 (0)'Access,
C.mpfr.mpfr_rnd_t'Enum_Val (MPFR.Rounding'Enum_Rep (Rounding)));
C.mpfr.mpfr_clear (Right2 (0)'Access);
end return;
end Multiply;
function Multiply (
Left : Long_Long_Float;
Right : MP_Float;
Precision : MPFR.Precision;
Rounding : MPFR.Rounding)
return MP_Float is
begin
return Multiply (Right, Left, Precision, Rounding);
end Multiply;
function Divide (
Left, Right : MP_Float;
Precision : MPFR.Precision;
Rounding : MPFR.Rounding)
return MP_Float
is
Dummy : C.signed_int;
begin
return Result : MP_Float (Precision) do
Dummy :=
C.mpfr.mpfr_div (
Controlled.Reference (Result),
Controlled.Constant_Reference (Left),
Controlled.Constant_Reference (Right),
C.mpfr.mpfr_rnd_t'Enum_Val (MPFR.Rounding'Enum_Rep (Rounding)));
end return;
end Divide;
function Divide (
Left : MP_Float;
Right : Long_Long_Float;
Precision : MPFR.Precision;
Rounding : MPFR.Rounding)
return MP_Float
is
Dummy : C.signed_int;
Right2 : C.mpfr.mpfr_t := (others => (others => <>));
begin
return Result : MP_Float (Precision) do
C.mpfr.mpfr_init2 (Right2 (0)'Access, C.mpfr.mpfr_prec_t (Precision));
Dummy :=
C.mpfr.mpfr_set_ld (
Right2 (0)'Access,
C.long_double (Right),
C.mpfr.mpfr_rnd_t'Enum_Val (MPFR.Rounding'Enum_Rep (Rounding)));
Dummy :=
C.mpfr.mpfr_div (
Controlled.Reference (Result),
Controlled.Constant_Reference (Left),
Right2 (0)'Access,
C.mpfr.mpfr_rnd_t'Enum_Val (MPFR.Rounding'Enum_Rep (Rounding)));
C.mpfr.mpfr_clear (Right2 (0)'Access);
end return;
end Divide;
function Divide (
Left : Long_Long_Float;
Right : MP_Float;
Precision : MPFR.Precision;
Rounding : MPFR.Rounding)
return MP_Float
is
Dummy : C.signed_int;
Left2 : C.mpfr.mpfr_t := (others => (others => <>));
begin
return Result : MP_Float (Precision) do
C.mpfr.mpfr_init2 (Left2 (0)'Access, C.mpfr.mpfr_prec_t (Precision));
Dummy :=
C.mpfr.mpfr_set_ld (
Left2 (0)'Access,
C.long_double (Left),
C.mpfr.mpfr_rnd_t'Enum_Val (MPFR.Rounding'Enum_Rep (Rounding)));
Dummy :=
C.mpfr.mpfr_div (
Controlled.Reference (Result),
Left2 (0)'Access,
Controlled.Constant_Reference (Right),
C.mpfr.mpfr_rnd_t'Enum_Val (MPFR.Rounding'Enum_Rep (Rounding)));
C.mpfr.mpfr_clear (Left2 (0)'Access);
end return;
end Divide;
function Power (
Left : MP_Float;
Right : Integer;
Precision : MPFR.Precision;
Rounding : MPFR.Rounding)
return MP_Float
is
Dummy : C.signed_int;
begin
return Result : MP_Float (Precision) do
Dummy :=
C.mpfr.mpfr_pow_si (
Controlled.Reference (Result),
Controlled.Constant_Reference (Left),
C.signed_long (Right),
C.mpfr.mpfr_rnd_t'Enum_Val (MPFR.Rounding'Enum_Rep (Rounding)));
end return;
end Power;
function Sqrt (
X : MP_Float;
Precision : MPFR.Precision;
Rounding : MPFR.Rounding)
return MP_Float
is
Dummy : C.signed_int;
begin
return Result : MP_Float (Precision) do
Dummy :=
C.mpfr.mpfr_sqrt (
Controlled.Reference (Result),
Controlled.Constant_Reference (X),
C.mpfr.mpfr_rnd_t'Enum_Val (MPFR.Rounding'Enum_Rep (Rounding)));
end return;
end Sqrt;
function NaN (Precision : MPFR.Precision) return MP_Float is
begin
return Result : MP_Float (Precision) do
C.mpfr.mpfr_set_nan (Controlled.Reference (Result));
end return;
end NaN;
function Infinity (Precision : MPFR.Precision) return MP_Float is
begin
return Result : MP_Float (Precision) do
C.mpfr.mpfr_set_inf (Controlled.Reference (Result), 0);
end return;
end Infinity;
package body Controlled is
function Create (Precision : MPFR.Precision) return MP_Float is
begin
return Result : Controlled.MP_Float :=
(Ada.Finalization.Controlled with Raw => <>)
do
C.mpfr.mpfr_init2 (Result.Raw (0)'Access, C.mpfr.mpfr_prec_t (Precision));
end return;
end Create;
function Reference (Item : in out Root_FR.MP_Float)
return not null access C.mpfr.mpfr_struct is
begin
return Item.Data.Raw (0)'Unchecked_Access;
end Reference;
function Constant_Reference (Item : Root_FR.MP_Float)
return not null access constant C.mpfr.mpfr_struct is
begin
return Item.Data.Raw (0)'Unchecked_Access;
end Constant_Reference;
overriding procedure Initialize (Object : in out MP_Float) is
begin
raise Program_Error;
end Initialize;
overriding procedure Adjust (Object : in out MP_Float) is
Source : constant C.mpfr.mpfr_t := Object.Raw; -- move
Dummy : C.signed_int;
begin
C.mpfr.mpfr_init2 (
Object.Raw (0)'Access,
C.mpfr.mpfr_get_prec (Source (0)'Access));
Dummy :=
C.mpfr.mpfr_set4 (
Object.Raw (0)'Access,
Source (0)'Access,
C.mpfr.MPFR_RNDN,
C.mpfr.mpfr_sgn (Source (0)'Access));
end Adjust;
overriding procedure Finalize (Object : in out MP_Float) is
begin
C.mpfr.mpfr_clear (Object.Raw (0)'Access);
end Finalize;
end Controlled;
end MPFR.Root_FR;
|
with Ada.Unchecked_Conversion;
private with STM32_SVD.CORDIC;
package STM32.CORDIC is
pragma Elaborate_Body;
type CORDIC_Coprocessor is limited private;
type CORDIC_Function is
(Cosine,
Sine,
Phase,
Modulus,
Arctangent,
Hyperbolic_Cosine,
Hyperbolic_Sine,
Hyperbolic_Arctangent,
Natural_Logarithm,
Square_Root)
with Size => 4;
procedure Set_CORDIC_Function
(This : in out CORDIC_Coprocessor;
Value : CORDIC_Function)
with Post => Get_CORDIC_Function (This) = Value;
-- Set the function for the next calculation.
function Get_CORDIC_Function (This : CORDIC_Coprocessor)
return CORDIC_Function;
-- Returns the function to be calculated.
type CORDIC_Iterations is
(Iteration_4,
Iteration_8,
Iteration_12,
Iteration_16,
Iteration_20,
Iteration_24);
for CORDIC_Iterations use
(Iteration_4 => 1,
Iteration_8 => 2,
Iteration_12 => 3,
Iteration_16 => 4,
Iteration_20 => 5,
Iteration_24 => 6);
procedure Set_CORDIC_Precision
(This : in out CORDIC_Coprocessor;
Value : CORDIC_Iterations);
-- The precision of the result is dependent on the number of CORDIC
-- iterations. To determine the number of iterations needed for a given
-- accuracy refer to RM0440 rev 6 Chapter 17.3.5 Table 115 at pg 479. The
-- value written in this register is (Number of iterations) / 4. Note that
-- for most functions, the recommended range for this field is 3 to 6.
procedure Set_CORDIC_Scaling_Factor
(This : in out CORDIC_Coprocessor;
Value : UInt3);
-- The value of this field indicates the scaling factor applied to the
-- arguments and/or results. A value n implies that the arguments have been
-- multiplied by a factor 2**-n, and/or the results need to be multiplied by
-- 2**n. Refer to RM0440 rev 6 Section 17.3.2 pg 469 for the applicability
-- of the scaling factor for each function and the appropriate range.
type CORDIC_Data_Size is (Data_32_Bit, Data_16_Bit);
procedure Set_CORDIC_Data_Size
(This : in out CORDIC_Coprocessor;
Value : CORDIC_Data_Size)
with Post => Get_CORDIC_Data_Size (This) = Value;
function Get_CORDIC_Data_Size
(This : CORDIC_Coprocessor)
return CORDIC_Data_Size;
type CORDIC_Arguments_Number is (One_32_Bit, Two_32_Bit);
procedure Set_CORDIC_Arguments_Number
(This : in out CORDIC_Coprocessor;
Value : CORDIC_Arguments_Number)
with Post => Get_CORDIC_Arguments_Number (This) = Value;
-- Set the number of arguments expected by the CORDIC_WDATA register:
-- Only one 32-bit write (or two 16-bit values if ARGSIZE = 1) is needed
-- for the next calculation.
-- Two 32-bit values must be written to the CORDIC_WDATA register to
-- trigger the next calculation.
function Get_CORDIC_Arguments_Number
(This : CORDIC_Coprocessor)
return CORDIC_Arguments_Number;
procedure Set_CORDIC_Results_Number
(This : in out CORDIC_Coprocessor;
Value : CORDIC_Arguments_Number)
with Post => Get_CORDIC_Results_Number (This) = Value;
-- Set the number of results in the CORDIC_RDATA register:
-- Only one 32-bit value (or two 16-bit values if RESSIZE = 1) is
-- transferred to the CORDIC_RDATA register on completion of the next
-- calculation. One read from CORDIC_RDATA resets the RRDY flag.
-- Two 32-bit values are transferred to the CORDIC_RDATA register on
-- completion of the next calculation. Two reads from CORDIC_RDATA are
-- necessary to reset the RRDY flag.
function Get_CORDIC_Results_Number
(This : CORDIC_Coprocessor)
return CORDIC_Arguments_Number;
procedure Configure_CORDIC_Coprocessor
(This : in out CORDIC_Coprocessor;
Operation : CORDIC_Function;
Precision : CORDIC_Iterations := Iteration_20;
Scaling : UInt3 := 0;
Data_Size : CORDIC_Data_Size);
-- Several functions take two input arguments (ARG1 and ARG2) and some
-- generate two results (RES1 and RES2) simultaneously. See RM0440 rev 6
-- chapter 17.3.2 Table 102.
function Get_CORDIC_Data (This : CORDIC_Coprocessor) return UInt32;
-- The CORDIC operates in fixed point signed integer format. Input and
-- output values can be either q1.31 or q1.15. See RM0440 rev 6 chapter
-- 17.3.3.
type Q1_31 is delta 2.0**(-31) range -1.0 .. 1.0 - 2.0**(-31)
with Size => 32;
-- In q1.31 format, numbers are represented by one sign bit and 31
-- fractional bits (binary decimal places). The numeric range is therefore
-- -1 (0x80000000) to 1 - 2**-31 (0x7FFFFFFF).
type Q1_15 is delta 2.0**(-15) range -1.0 .. 1.0 - 2.0**(-15)
with Size => 16;
-- In q1.15 format, the numeric range is -1 (0x8000) to 1 - 2**-15 (0x7FFF).
-- This format has the advantage that two input arguments can be packed
-- into a single 32-bit write, and two results can be fetched in one 32-bit
-- read.
-- The input (WDATA) and output (RDATA) data of the CORDIC uses UInt32
-- to represent the fixed point values. So we need to convert the type
-- Fraction to UInt and vice-versa.
function Q1_31_To_UInt32 is new
Ada.Unchecked_Conversion (Q1_31, UInt32);
function UInt32_To_Q1_31 is new
Ada.Unchecked_Conversion (UInt32, Q1_31);
function Q1_15_To_UInt16 is new
Ada.Unchecked_Conversion (Q1_15, UInt16);
function UInt16_To_Q1_15 is new
Ada.Unchecked_Conversion (UInt16, Q1_15);
type CORDIC_Status is (Result_Ready);
function Status
(This : CORDIC_Coprocessor;
Flag : CORDIC_Status) return Boolean;
procedure Set_Interrupt
(This : in out CORDIC_Coprocessor;
Enable : Boolean)
with Post => Interrupt_Enabled (This) = Enable;
-- An interrupt request is generated whenever the RRDY flag is set.
function Interrupt_Enabled
(This : CORDIC_Coprocessor) return Boolean;
type CORDIC_DMA is (Read_DMA, Write_DMA);
procedure Set_DMA
(This : in out CORDIC_Coprocessor;
DMA : CORDIC_DMA;
Enable : Boolean)
with Post => DMA_Enabled (This, DMA) = Enable;
-- Requests are generated on the DMA read channel whenever the RRDY flag
-- is set and on the DMA write channel whenever no operation is pendig.
function DMA_Enabled
(This : CORDIC_Coprocessor;
DMA : CORDIC_DMA) return Boolean;
private
type CORDIC_Coprocessor is new STM32_SVD.CORDIC.CORDIC_Peripheral;
end STM32.CORDIC;
|
-----------------------------------------------------------------------
-- awa-sysadmin-beans -- Sysadmin specific Ada beans
-- Copyright (C) 2019 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.Basic;
with AWA.Sysadmin.Modules;
with AWA.Sysadmin.Models;
package AWA.Sysadmin.Beans is
use Ada.Strings.Unbounded;
type Authenticate_Bean is new AWA.Sysadmin.Models.Authenticate_Bean with null record;
type Authenticate_Bean_Access is access all Authenticate_Bean'Class;
-- Action to authenticate the sysadmin user.
overriding
procedure Authenticate (Data : in out Authenticate_Bean;
Outcome : in out Unbounded_String);
-- Create an authenticate bean.
function Create_Authenticate_Bean (Module : in AWA.Sysadmin.Modules.Sysadmin_Module_Access)
return Util.Beans.Basic.Readonly_Bean_Access;
end AWA.Sysadmin.Beans;
|
with Ada.Real_Time; use Ada.Real_Time;
with STM32_SVD; use STM32_SVD;
with STM32_SVD.TIM; use STM32_SVD.TIM;
with STM32_SVD.RCC; use STM32_SVD.RCC;
package body STM32GD.Timer.Peripheral is
Timer_Callback : Timer_Callback_Type := null;
Frequency : constant Natural := 1_000;
CK_INT : constant Natural := 8_000_000;
Repeat : Boolean;
First : Boolean;
procedure Start (Time : Time_Span; Callback : Timer_Callback_Type);
protected body IRQ_Handler is
procedure Handler is
begin
if Timer = Timer_3 then
TIM3_Periph.SR.UIF := 0;
end if;
if Timer_Callback /= null then
if not First then
if not Repeat then
Stop;
end if;
Timer_Callback.all;
else
First := False;
end if;
end if;
end Handler;
end IRQ_Handler;
procedure Init is
begin
if Timer = Timer_3 then
RCC_Periph.APB1ENR.TIM3EN := 1;
TIM3_Periph.PSC.PSC := UInt16 (CK_INT / Frequency);
TIM3_Periph.CR1.ARPE := 1;
end if;
end Init;
procedure Start (Time : Time_Span; Callback : Timer_Callback_Type) is
MS : UInt16;
begin
MS := UInt16 (To_Duration (Time) * 1_000);
Timer_Callback := Callback;
First := True;
if Timer = Timer_3 then
TIM3_Periph.CNT.CNT_L := 0;
TIM3_Periph.ARR.ARR_L := MS;
TIM3_Periph.CR1.CEN := 1;
TIM3_Periph.DIER.UIE := 1;
end if;
end Start;
procedure Stop is
begin
if Timer = Timer_3 then
TIM3_Periph.CR1.CEN := 0;
TIM3_Periph.DIER.UIE := 0;
end if;
end Stop;
procedure After (Time : Time_Span; Callback : Timer_Callback_Type) is
begin
Repeat := False;
Start (Time, Callback);
end After;
procedure Every (Interval : Time_Span; Callback : Timer_Callback_Type) is
begin
Repeat := True;
Start (Interval, Callback);
end Every;
end STM32GD.Timer.Peripheral;
|
package Import1 is
type Arr is array (Positive range <>) of Integer;
procedure Create (Bounds : Arr);
end Import1;
|
-- Copyright 2012-2014 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package Ops is
type Int is private;
function Make (X: Natural) return Int;
function "+" (I1, I2 : Int) return Int;
function "-" (I1, I2 : Int) return Int;
function "*" (I1, I2 : Int) return Int;
function "/" (I1, I2 : Int) return Int;
function "mod" (I1, I2 : Int) return Int;
function "rem" (I1, I2 : Int) return Int;
function "**" (I1, I2 : Int) return Int;
function "<" (I1, I2 : Int) return Boolean;
function "<=" (I1, I2 : Int) return Boolean;
function ">" (I1, I2 : Int) return Boolean;
function ">=" (I1, I2 : Int) return Boolean;
function "=" (I1, I2 : Int) return Boolean;
function "and" (I1, I2 : Int) return Int;
function "or" (I1, I2 : Int) return Int;
function "xor" (I1, I2 : Int) return Int;
function "&" (I1, I2 : Int) return Int;
function "abs" (I1 : Int) return Int;
function "not" (I1 : Int) return Int;
function "+" (I1 : Int) return Int;
function "-" (I1 : Int) return Int;
procedure Dummy (B1 : Boolean);
procedure Dummy (I1 : Int);
private
type IntRep is mod 2**31;
type Int is new IntRep;
end Ops;
|
-- C45264A.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 EQUALITY COMPARISONS YIELD CORRECT RESULTS FOR ONE
-- DIMENSIONAL AND MULTI-DIMENSIONAL ARRAY TYPES.
-- CASE THAT CHECKS THAT TWO NULL ARRAYS OF THE SAME TYPE ARE
-- ALWAYS EQUAL.
-- PK 02/21/84
-- EG 05/30/84
WITH REPORT;
USE REPORT;
PROCEDURE C45264A IS
SUBTYPE INT IS INTEGER RANGE 1 .. 3;
BEGIN
TEST("C45264A","CHECK THAT EQUALITY COMPARISONS YIELD CORRECT " &
"RESULTS FOR ONE DIMENSIONAL AND MULTI-" &
"DIMENSIONAL ARRAY TYPES");
DECLARE
TYPE A1 IS ARRAY(INT RANGE <>) OF INTEGER;
BEGIN
IF A1'(1 .. IDENT_INT(2) => IDENT_INT(1)) /=
A1'(IDENT_INT(2) .. 3 => IDENT_INT(1)) THEN
FAILED ("A1 - ARRAYS NOT EQUAL");
END IF;
EXCEPTION
WHEN OTHERS =>
FAILED ("A1 - EXCEPTION RAISED");
END;
DECLARE
TYPE A2 IS ARRAY(INT RANGE <>, INT RANGE <>) OF INTEGER;
BEGIN
IF A2'(1 .. IDENT_INT(2) =>
(IDENT_INT(3) .. IDENT_INT(2) => IDENT_INT(1))) /=
A2'(IDENT_INT(2) .. 3 =>
(IDENT_INT(2) .. IDENT_INT(1) => IDENT_INT(1))) THEN
FAILED ("A2 - ARRAYS NOT EQUAL");
END IF;
EXCEPTION
WHEN OTHERS =>
FAILED ("A2 - EXCEPTION RAISED");
END;
DECLARE
TYPE A3 IS
ARRAY(INT RANGE <>, INT RANGE <>, INT RANGE <>) OF
INTEGER;
BEGIN
IF A3'(1 .. IDENT_INT(2) =>
(IDENT_INT(1) .. IDENT_INT(3) =>
(IDENT_INT(3) .. IDENT_INT(2) => IDENT_INT(1)))) /=
A3'(IDENT_INT(1) .. 3 =>
(IDENT_INT(2) .. IDENT_INT(1) =>
(IDENT_INT(1) .. IDENT_INT(2) => IDENT_INT(1)))) THEN
FAILED ("A3 - ARRAYS NOT EQUAL");
END IF;
EXCEPTION
WHEN OTHERS =>
FAILED ("A3 - EXCEPTION RAISED");
END;
RESULT;
END C45264A;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Program.Elements.Anonymous_Access_Definitions;
with Program.Lexical_Elements;
with Program.Elements.Parameter_Specifications;
package Program.Elements.Anonymous_Access_To_Functions is
pragma Pure (Program.Elements.Anonymous_Access_To_Functions);
type Anonymous_Access_To_Function is
limited interface
and Program.Elements.Anonymous_Access_Definitions
.Anonymous_Access_Definition;
type Anonymous_Access_To_Function_Access is
access all Anonymous_Access_To_Function'Class with Storage_Size => 0;
not overriding function Parameters
(Self : Anonymous_Access_To_Function)
return Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access is abstract;
not overriding function Result_Subtype
(Self : Anonymous_Access_To_Function)
return not null Program.Elements.Element_Access is abstract;
not overriding function Has_Not_Null
(Self : Anonymous_Access_To_Function)
return Boolean is abstract;
not overriding function Has_Protected
(Self : Anonymous_Access_To_Function)
return Boolean is abstract;
not overriding function Has_Not_Null_2
(Self : Anonymous_Access_To_Function)
return Boolean is abstract;
type Anonymous_Access_To_Function_Text is limited interface;
type Anonymous_Access_To_Function_Text_Access is
access all Anonymous_Access_To_Function_Text'Class with Storage_Size => 0;
not overriding function To_Anonymous_Access_To_Function_Text
(Self : aliased in out Anonymous_Access_To_Function)
return Anonymous_Access_To_Function_Text_Access is abstract;
not overriding function Not_Token
(Self : Anonymous_Access_To_Function_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Null_Token
(Self : Anonymous_Access_To_Function_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Access_Token
(Self : Anonymous_Access_To_Function_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Protected_Token
(Self : Anonymous_Access_To_Function_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Function_Token
(Self : Anonymous_Access_To_Function_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Left_Bracket_Token
(Self : Anonymous_Access_To_Function_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Right_Bracket_Token
(Self : Anonymous_Access_To_Function_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Return_Token
(Self : Anonymous_Access_To_Function_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Not_Token_2
(Self : Anonymous_Access_To_Function_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Null_Token_2
(Self : Anonymous_Access_To_Function_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
end Program.Elements.Anonymous_Access_To_Functions;
|
-- C87B45C.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 OVERLOADING RESOLUTION USES THE RULE THAT:
--
-- FOR A DEFAULT ENTRY PARAMETER, THE TYPE OF THE INITIALIZATION
-- EXPRESSION MUST MATCH THE PARAMETERS'S EXPLICIT TYPEMARK.
--
-- THE FOUR KINDS OF EXPRESSIONS TESTED HERE ARE:
--
-- (A): A CALL TO AN OVERLOADED FUNCTION.
-- (B): AN OVERLOADED OPERATOR SYMBOL.
-- (C): AN OVERLOADED (INFIX) OPERATOR.
-- (D): AN OVERLOADED ENUMERATION LITERAL.
-- TRH 7 JULY 82
WITH REPORT; USE REPORT;
PROCEDURE C87B45C IS
TYPE WHOLE IS NEW INTEGER RANGE 0..INTEGER'LAST;
TYPE CITRUS IS (LEMON, LIME, ORANGE);
TYPE HUE IS (RED, ORANGE, YELLOW);
FUNCTION F1 (X, Y : INTEGER) RETURN INTEGER IS
BEGIN
RETURN -1;
END F1;
FUNCTION F1 (X, Y : WHOLE) RETURN WHOLE IS
BEGIN
RETURN 0;
END F1;
FUNCTION F1 (X, Y : INTEGER) RETURN HUE IS
BEGIN
RETURN ORANGE;
END F1;
FUNCTION F1 (X, Y : INTEGER) RETURN CITRUS IS
BEGIN
RETURN ORANGE;
END F1;
BEGIN
TEST ("C87B45C","OVERLOADED INITIALIZATION EXPRESSIONS" &
" IN DEFAULT ENTRY PARAMETERS");
DECLARE
FUNCTION "*" (X, Y : INTEGER) RETURN INTEGER
RENAMES F1;
FUNCTION "*" (X, Y : WHOLE) RETURN WHOLE
RENAMES F1;
FUNCTION "*" (X, Y : INTEGER) RETURN HUE
RENAMES F1;
FUNCTION "*" (X, Y : INTEGER) RETURN CITRUS
RENAMES F1;
TASK T1 IS
ENTRY E1 (I1 : INTEGER := F1 (0, 0);
W1 : WHOLE := F1 (0, 0);
C1 : CITRUS := F1 (0, 0);
H1 : HUE := F1 (0, 0);
I2 : INTEGER := "*" (0, 0);
W2 : WHOLE := "*" (0, 0);
C2 : CITRUS := "*" (0, 0);
H2 : HUE := "*" (0, 0);
I3 : INTEGER := (0 * 0);
W3 : WHOLE := (0 * 0);
C3 : CITRUS := (0 * 0);
H3 : HUE := (0 * 0);
C4 : CITRUS := ORANGE;
H4 : HUE := ORANGE);
END T1;
TASK BODY T1 IS
BEGIN
ACCEPT E1 (I1 : INTEGER := F1 (0, 0);
W1 : WHOLE := F1 (0, 0);
C1 : CITRUS := F1 (0, 0);
H1 : HUE := F1 (0, 0);
I2 : INTEGER := "*" (0, 0);
W2 : WHOLE := "*" (0, 0);
C2 : CITRUS := "*" (0, 0);
H2 : HUE := "*" (0, 0);
I3 : INTEGER := (0 * 0);
W3 : WHOLE := (0 * 0);
C3 : CITRUS := (0 * 0);
H3 : HUE := (0 * 0);
C4 : CITRUS := ORANGE;
H4 : HUE := ORANGE) DO
IF I1 /= -1 OR W1 /= 0 OR
CITRUS'POS (C1) /= 2 OR HUE'POS (H1) /= 1 THEN
FAILED ("(A): RESOLUTION INCORRECT - FUNCTION");
END IF;
IF I2 /= -1 OR W2 /= 0 OR
CITRUS'POS (C2) /= 2 OR HUE'POS (H2) /= 1 THEN
FAILED ("(B): RESOLUTION INCORRECT " &
"- OPERATOR SYMBOL");
END IF;
IF I3 /= -1 OR W3 /= 0 OR
CITRUS'POS (C3) /= 2 OR HUE'POS (H3) /= 1 THEN
FAILED ("(C): RESOLUTION INCORRECT - INFIX " &
"OPERATOR");
END IF;
IF CITRUS'POS (C4) /= 2 OR HUE'POS (H4) /= 1 THEN
FAILED ("(D): RESOLUTION INCORRECT - " &
"ENUMERATION LITERAL");
END IF;
END E1;
END T1;
BEGIN
T1.E1;
END;
RESULT;
END C87B45C;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S E T _ T A R G --
-- --
-- B o d y --
-- --
-- Copyright (C) 2013-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Debug; use Debug;
with Get_Targ; use Get_Targ;
with Opt; use Opt;
with Output; use Output;
with System; use System;
with System.OS_Lib; use System.OS_Lib;
with Unchecked_Conversion;
package body Set_Targ is
--------------------------------------------------------
-- Data Used to Read/Write Target Dependent Info File --
--------------------------------------------------------
-- Table of string names written to file
subtype Str is String;
S_Bits_BE : constant Str := "Bits_BE";
S_Bits_Per_Unit : constant Str := "Bits_Per_Unit";
S_Bits_Per_Word : constant Str := "Bits_Per_Word";
S_Bytes_BE : constant Str := "Bytes_BE";
S_Char_Size : constant Str := "Char_Size";
S_Double_Float_Alignment : constant Str := "Double_Float_Alignment";
S_Double_Scalar_Alignment : constant Str := "Double_Scalar_Alignment";
S_Double_Size : constant Str := "Double_Size";
S_Float_Size : constant Str := "Float_Size";
S_Float_Words_BE : constant Str := "Float_Words_BE";
S_Int_Size : constant Str := "Int_Size";
S_Long_Double_Size : constant Str := "Long_Double_Size";
S_Long_Long_Size : constant Str := "Long_Long_Size";
S_Long_Size : constant Str := "Long_Size";
S_Maximum_Alignment : constant Str := "Maximum_Alignment";
S_Max_Unaligned_Field : constant Str := "Max_Unaligned_Field";
S_Pointer_Size : constant Str := "Pointer_Size";
S_Short_Enums : constant Str := "Short_Enums";
S_Short_Size : constant Str := "Short_Size";
S_Strict_Alignment : constant Str := "Strict_Alignment";
S_System_Allocator_Alignment : constant Str := "System_Allocator_Alignment";
S_Wchar_T_Size : constant Str := "Wchar_T_Size";
S_Words_BE : constant Str := "Words_BE";
-- Table of names
type AStr is access all String;
DTN : constant array (Nat range <>) of AStr := (
S_Bits_BE 'Unrestricted_Access,
S_Bits_Per_Unit 'Unrestricted_Access,
S_Bits_Per_Word 'Unrestricted_Access,
S_Bytes_BE 'Unrestricted_Access,
S_Char_Size 'Unrestricted_Access,
S_Double_Float_Alignment 'Unrestricted_Access,
S_Double_Scalar_Alignment 'Unrestricted_Access,
S_Double_Size 'Unrestricted_Access,
S_Float_Size 'Unrestricted_Access,
S_Float_Words_BE 'Unrestricted_Access,
S_Int_Size 'Unrestricted_Access,
S_Long_Double_Size 'Unrestricted_Access,
S_Long_Long_Size 'Unrestricted_Access,
S_Long_Size 'Unrestricted_Access,
S_Maximum_Alignment 'Unrestricted_Access,
S_Max_Unaligned_Field 'Unrestricted_Access,
S_Pointer_Size 'Unrestricted_Access,
S_Short_Enums 'Unrestricted_Access,
S_Short_Size 'Unrestricted_Access,
S_Strict_Alignment 'Unrestricted_Access,
S_System_Allocator_Alignment 'Unrestricted_Access,
S_Wchar_T_Size 'Unrestricted_Access,
S_Words_BE 'Unrestricted_Access);
-- Table of corresponding value pointers
DTV : constant array (Nat range <>) of System.Address := (
Bits_BE 'Address,
Bits_Per_Unit 'Address,
Bits_Per_Word 'Address,
Bytes_BE 'Address,
Char_Size 'Address,
Double_Float_Alignment 'Address,
Double_Scalar_Alignment 'Address,
Double_Size 'Address,
Float_Size 'Address,
Float_Words_BE 'Address,
Int_Size 'Address,
Long_Double_Size 'Address,
Long_Long_Size 'Address,
Long_Size 'Address,
Maximum_Alignment 'Address,
Max_Unaligned_Field 'Address,
Pointer_Size 'Address,
Short_Enums 'Address,
Short_Size 'Address,
Strict_Alignment 'Address,
System_Allocator_Alignment 'Address,
Wchar_T_Size 'Address,
Words_BE 'Address);
DTR : array (Nat range DTV'Range) of Boolean := (others => False);
-- Table of flags used to validate that all values are present in file
-----------------------
-- Local Subprograms --
-----------------------
procedure Read_Target_Dependent_Values (File_Name : String);
-- Read target dependent values from File_Name, and set the target
-- dependent values (global variables) declared in this package.
procedure Fail (E : String);
pragma No_Return (Fail);
-- Terminate program with fatal error message passed as parameter
procedure Register_Float_Type
(Name : C_String;
Digs : Natural;
Complex : Boolean;
Count : Natural;
Float_Rep : Float_Rep_Kind;
Precision : Positive;
Size : Positive;
Alignment : Natural);
pragma Convention (C, Register_Float_Type);
-- Call back to allow the back end to register available types. This call
-- back makes entries in the FPT_Mode_Table for any floating point types
-- reported by the back end. Name is the name of the type as a normal
-- format Null-terminated string. Digs is the number of digits, where 0
-- means it is not a fpt type (ignored during registration). Complex is
-- non-zero if the type has real and imaginary parts (also ignored during
-- registration). Count is the number of elements in a vector type (zero =
-- not a vector, registration ignores vectors). Float_Rep shows the kind of
-- floating-point type, and Precision, Size and Alignment are the precision
-- size and alignment in bits.
--
-- The only types that are actually registered have Digs non-zero, Complex
-- zero (false), and Count zero (not a vector). The Long_Double_Index
-- variable below is updated to indicate the index at which a "long double"
-- type can be found if it gets registered at all.
Long_Double_Index : Integer := -1;
-- Once all the floating point types have been registered, the index in
-- FPT_Mode_Table at which "long double" can be found, if anywhere. A
-- negative value means that no "long double" has been registered. This
-- is useful to know whether we have a "long double" available at all and
-- get at it's characteristics without having to search the FPT_Mode_Table
-- when we need to decide which C type should be used as the basis for
-- Long_Long_Float in Ada.
function FPT_Mode_Index_For (Name : String) return Natural;
-- Return the index in FPT_Mode_Table that designates the entry
-- corresponding to the C type named Name. Raise Program_Error if
-- there is no such entry.
function FPT_Mode_Index_For (T : S_Float_Types) return Natural;
-- Return the index in FPT_Mode_Table that designates the entry for
-- a back-end type suitable as a basis to construct the standard Ada
-- floating point type identified by T.
----------------
-- C_Type_For --
----------------
function C_Type_For (T : S_Float_Types) return String is
-- ??? For now, we don't have a good way to tell the widest float
-- type with hardware support. Basically, GCC knows the size of that
-- type, but on x86-64 there often are two or three 128-bit types,
-- one double extended that has 18 decimal digits, a 128-bit quad
-- precision type with 33 digits and possibly a 128-bit decimal float
-- type with 34 digits. As a workaround, we define Long_Long_Float as
-- C's "long double" if that type exists and has at most 18 digits,
-- or otherwise the same as Long_Float.
Max_HW_Digs : constant := 18;
-- Maximum hardware digits supported
begin
case T is
when S_Float
| S_Short_Float
=>
return "float";
when S_Long_Float =>
return "double";
when S_Long_Long_Float =>
if Long_Double_Index >= 0
and then FPT_Mode_Table (Long_Double_Index).DIGS <= Max_HW_Digs
then
return "long double";
else
return "double";
end if;
end case;
end C_Type_For;
----------
-- Fail --
----------
procedure Fail (E : String) is
E_Fatal : constant := 4;
-- Code for fatal error
begin
Write_Str (E);
Write_Eol;
OS_Exit (E_Fatal);
end Fail;
------------------------
-- FPT_Mode_Index_For --
------------------------
function FPT_Mode_Index_For (Name : String) return Natural is
begin
for J in FPT_Mode_Table'First .. Num_FPT_Modes loop
if FPT_Mode_Table (J).NAME.all = Name then
return J;
end if;
end loop;
raise Program_Error;
end FPT_Mode_Index_For;
function FPT_Mode_Index_For (T : S_Float_Types) return Natural is
begin
return FPT_Mode_Index_For (C_Type_For (T));
end FPT_Mode_Index_For;
-------------------------
-- Register_Float_Type --
-------------------------
procedure Register_Float_Type
(Name : C_String;
Digs : Natural;
Complex : Boolean;
Count : Natural;
Float_Rep : Float_Rep_Kind;
Precision : Positive;
Size : Positive;
Alignment : Natural)
is
T : String (1 .. Name'Length);
Last : Natural := 0;
procedure Dump;
-- Dump information given by the back end for the type to register
----------
-- Dump --
----------
procedure Dump is
begin
Write_Str ("type " & T (1 .. Last) & " is ");
if Count > 0 then
Write_Str ("array (1 .. ");
Write_Int (Int (Count));
if Complex then
Write_Str (", 1 .. 2");
end if;
Write_Str (") of ");
elsif Complex then
Write_Str ("array (1 .. 2) of ");
end if;
if Digs > 0 then
Write_Str ("digits ");
Write_Int (Int (Digs));
Write_Line (";");
Write_Str ("pragma Float_Representation (");
case Float_Rep is
when AAMP => Write_Str ("AAMP");
when IEEE_Binary => Write_Str ("IEEE");
end case;
Write_Line (", " & T (1 .. Last) & ");");
else
Write_Str ("mod 2**");
Write_Int (Int (Precision / Positive'Max (1, Count)));
Write_Line (";");
end if;
if Precision = Size then
Write_Str ("for " & T (1 .. Last) & "'Size use ");
Write_Int (Int (Size));
Write_Line (";");
else
Write_Str ("for " & T (1 .. Last) & "'Value_Size use ");
Write_Int (Int (Precision));
Write_Line (";");
Write_Str ("for " & T (1 .. Last) & "'Object_Size use ");
Write_Int (Int (Size));
Write_Line (";");
end if;
Write_Str ("for " & T (1 .. Last) & "'Alignment use ");
Write_Int (Int (Alignment / 8));
Write_Line (";");
Write_Eol;
end Dump;
-- Start of processing for Register_Float_Type
begin
-- Acquire name
for J in T'Range loop
T (J) := Name (Name'First + J - 1);
if T (J) = ASCII.NUL then
Last := J - 1;
exit;
end if;
end loop;
-- Dump info if debug flag set
if Debug_Flag_Dot_B then
Dump;
end if;
-- Acquire entry if non-vector non-complex fpt type (digits non-zero)
if Digs > 0 and then not Complex and then Count = 0 then
declare
This_Name : constant String := T (1 .. Last);
begin
Num_FPT_Modes := Num_FPT_Modes + 1;
FPT_Mode_Table (Num_FPT_Modes) :=
(NAME => new String'(This_Name),
DIGS => Digs,
FLOAT_REP => Float_Rep,
PRECISION => Precision,
SIZE => Size,
ALIGNMENT => Alignment);
if Long_Double_Index < 0 and then This_Name = "long double" then
Long_Double_Index := Num_FPT_Modes;
end if;
end;
end if;
end Register_Float_Type;
-----------------------------------
-- Write_Target_Dependent_Values --
-----------------------------------
-- We do this at the System.Os_Lib level, since we have to do the read at
-- that level anyway, so it is easier and more consistent to follow the
-- same path for the write.
procedure Write_Target_Dependent_Values is
Fdesc : File_Descriptor;
OK : Boolean;
Buffer : String (1 .. 80);
Buflen : Natural;
-- Buffer used to build line one of file
type ANat is access all Natural;
-- Pointer to Nat or Pos value (it is harmless to treat Pos values and
-- Nat values as Natural via Unchecked_Conversion).
function To_ANat is new Unchecked_Conversion (Address, ANat);
procedure AddC (C : Character);
-- Add one character to buffer
procedure AddN (N : Natural);
-- Add representation of integer N to Buffer, updating Buflen. N
-- must be less than 1000, and output is 3 characters with leading
-- spaces as needed.
procedure Write_Line;
-- Output contents of Buffer (1 .. Buflen) followed by a New_Line,
-- and set Buflen back to zero, ready to write next line.
----------
-- AddC --
----------
procedure AddC (C : Character) is
begin
Buflen := Buflen + 1;
Buffer (Buflen) := C;
end AddC;
----------
-- AddN --
----------
procedure AddN (N : Natural) is
begin
if N > 999 then
raise Program_Error;
end if;
if N > 99 then
AddC (Character'Val (48 + N / 100));
else
AddC (' ');
end if;
if N > 9 then
AddC (Character'Val (48 + N / 10 mod 10));
else
AddC (' ');
end if;
AddC (Character'Val (48 + N mod 10));
end AddN;
----------------
-- Write_Line --
----------------
procedure Write_Line is
begin
AddC (ASCII.LF);
if Buflen /= Write (Fdesc, Buffer'Address, Buflen) then
Delete_File (Target_Dependent_Info_Write_Name.all, OK);
Fail ("disk full writing file "
& Target_Dependent_Info_Write_Name.all);
end if;
Buflen := 0;
end Write_Line;
-- Start of processing for Write_Target_Dependent_Values
begin
Fdesc :=
Create_File (Target_Dependent_Info_Write_Name.all, Text);
if Fdesc = Invalid_FD then
Fail ("cannot create file " & Target_Dependent_Info_Write_Name.all);
end if;
-- Loop through values
for J in DTN'Range loop
-- Output name
Buflen := DTN (J)'Length;
Buffer (1 .. Buflen) := DTN (J).all;
-- Line up values
while Buflen < 26 loop
AddC (' ');
end loop;
AddC (' ');
AddC (' ');
-- Output value and write line
AddN (To_ANat (DTV (J)).all);
Write_Line;
end loop;
-- Blank line to separate sections
Write_Line;
-- Write lines for registered FPT types
for J in 1 .. Num_FPT_Modes loop
declare
E : FPT_Mode_Entry renames FPT_Mode_Table (J);
begin
Buflen := E.NAME'Last;
Buffer (1 .. Buflen) := E.NAME.all;
-- Pad out to line up values
while Buflen < 11 loop
AddC (' ');
end loop;
AddC (' ');
AddC (' ');
AddN (E.DIGS);
AddC (' ');
AddC (' ');
case E.FLOAT_REP is
when AAMP => AddC ('A');
when IEEE_Binary => AddC ('I');
end case;
AddC (' ');
AddN (E.PRECISION);
AddC (' ');
AddN (E.ALIGNMENT);
Write_Line;
end;
end loop;
-- Close file
Close (Fdesc, OK);
if not OK then
Fail ("disk full writing file "
& Target_Dependent_Info_Write_Name.all);
end if;
end Write_Target_Dependent_Values;
----------------------------------
-- Read_Target_Dependent_Values --
----------------------------------
procedure Read_Target_Dependent_Values (File_Name : String) is
File_Desc : File_Descriptor;
N : Natural;
type ANat is access all Natural;
-- Pointer to Nat or Pos value (it is harmless to treat Pos values
-- as Nat via Unchecked_Conversion).
function To_ANat is new Unchecked_Conversion (Address, ANat);
VP : ANat;
Buffer : String (1 .. 2000);
Buflen : Natural;
-- File information and length (2000 easily enough)
Nam_Buf : String (1 .. 40);
Nam_Len : Natural;
procedure Check_Spaces;
-- Checks that we have one or more spaces and skips them
procedure FailN (S : String);
pragma No_Return (FailN);
-- Calls Fail adding " name in file xxx", where name is the currently
-- gathered name in Nam_Buf, surrounded by quotes, and xxx is the
-- name of the file.
procedure Get_Name;
-- Scan out name, leaving it in Nam_Buf with Nam_Len set. Calls
-- Skip_Spaces to skip any following spaces. Note that the name is
-- terminated by a sequence of at least two spaces.
function Get_Nat return Natural;
-- N on entry points to decimal integer, scan out decimal integer
-- and return it, leaving N pointing to following space or LF.
procedure Skip_Spaces;
-- Skip past spaces
------------------
-- Check_Spaces --
------------------
procedure Check_Spaces is
begin
if N > Buflen or else Buffer (N) /= ' ' then
FailN ("missing space for");
end if;
Skip_Spaces;
return;
end Check_Spaces;
-----------
-- FailN --
-----------
procedure FailN (S : String) is
begin
Fail (S & " """ & Nam_Buf (1 .. Nam_Len) & """ in file "
& File_Name);
end FailN;
--------------
-- Get_Name --
--------------
procedure Get_Name is
begin
Nam_Len := 0;
-- Scan out name and put it in Nam_Buf
loop
if N > Buflen or else Buffer (N) = ASCII.LF then
FailN ("incorrectly formatted line for");
end if;
-- Name is terminated by two blanks
exit when N < Buflen and then Buffer (N .. N + 1) = " ";
Nam_Len := Nam_Len + 1;
if Nam_Len > Nam_Buf'Last then
Fail ("name too long");
end if;
Nam_Buf (Nam_Len) := Buffer (N);
N := N + 1;
end loop;
Check_Spaces;
end Get_Name;
-------------
-- Get_Nat --
-------------
function Get_Nat return Natural is
Result : Natural := 0;
begin
loop
if N > Buflen
or else Buffer (N) not in '0' .. '9'
or else Result > 999
then
FailN ("bad value for");
end if;
Result := Result * 10 + (Character'Pos (Buffer (N)) - 48);
N := N + 1;
exit when N <= Buflen
and then (Buffer (N) = ASCII.LF or else Buffer (N) = ' ');
end loop;
return Result;
end Get_Nat;
-----------------
-- Skip_Spaces --
-----------------
procedure Skip_Spaces is
begin
while N <= Buflen and Buffer (N) = ' ' loop
N := N + 1;
end loop;
end Skip_Spaces;
-- Start of processing for Read_Target_Dependent_Values
begin
File_Desc := Open_Read (File_Name, Text);
if File_Desc = Invalid_FD then
Fail ("cannot read file " & File_Name);
end if;
Buflen := Read (File_Desc, Buffer'Address, Buffer'Length);
Close (File_Desc);
if Buflen = Buffer'Length then
Fail ("file is too long: " & File_Name);
end if;
-- Scan through file for properly formatted entries in first section
N := 1;
while N <= Buflen and then Buffer (N) /= ASCII.LF loop
Get_Name;
-- Validate name and get corresponding value pointer
VP := null;
for J in DTN'Range loop
if DTN (J).all = Nam_Buf (1 .. Nam_Len) then
VP := To_ANat (DTV (J));
DTR (J) := True;
exit;
end if;
end loop;
if VP = null then
FailN ("unrecognized name");
end if;
-- Scan out value
VP.all := Get_Nat;
if N > Buflen or else Buffer (N) /= ASCII.LF then
FailN ("misformatted line for");
end if;
N := N + 1; -- skip LF
end loop;
-- Fall through this loop when all lines in first section read.
-- Check that values have been supplied for all entries.
for J in DTR'Range loop
if not DTR (J) then
Fail ("missing entry for " & DTN (J).all & " in file "
& File_Name);
end if;
end loop;
-- Now acquire FPT entries
if N >= Buflen then
Fail ("missing entries for FPT modes in file " & File_Name);
end if;
if Buffer (N) = ASCII.LF then
N := N + 1;
else
Fail ("missing blank line in file " & File_Name);
end if;
Num_FPT_Modes := 0;
while N <= Buflen loop
Get_Name;
Num_FPT_Modes := Num_FPT_Modes + 1;
declare
E : FPT_Mode_Entry renames FPT_Mode_Table (Num_FPT_Modes);
begin
E.NAME := new String'(Nam_Buf (1 .. Nam_Len));
if Long_Double_Index < 0 and then E.NAME.all = "long double" then
Long_Double_Index := Num_FPT_Modes;
end if;
E.DIGS := Get_Nat;
Check_Spaces;
case Buffer (N) is
when 'I' =>
E.FLOAT_REP := IEEE_Binary;
when 'A' =>
E.FLOAT_REP := AAMP;
when others =>
FailN ("bad float rep field for");
end case;
N := N + 1;
Check_Spaces;
E.PRECISION := Get_Nat;
Check_Spaces;
E.ALIGNMENT := Get_Nat;
if Buffer (N) /= ASCII.LF then
FailN ("junk at end of line for");
end if;
-- ??? We do not read E.SIZE, see Write_Target_Dependent_Values
E.SIZE :=
(E.PRECISION + E.ALIGNMENT - 1) / E.ALIGNMENT * E.ALIGNMENT;
N := N + 1;
end;
end loop;
end Read_Target_Dependent_Values;
-- Package Initialization, set target dependent values. This must be done
-- early on, before we start accessing various compiler packages, since
-- these values are used all over the place.
begin
-- First step: see if the -gnateT switch is present. As we have noted,
-- this has to be done very early, so cannot depend on the normal circuit
-- for reading switches and setting switches in Opt. The following code
-- will set Opt.Target_Dependent_Info_Read_Name if the switch -gnateT=name
-- is present in the options string.
declare
type Arg_Array is array (Nat) of Big_String_Ptr;
type Arg_Array_Ptr is access Arg_Array;
-- Types to access compiler arguments
save_argc : Nat;
pragma Import (C, save_argc);
-- Saved value of argc (number of arguments), imported from misc.c
save_argv : Arg_Array_Ptr;
pragma Import (C, save_argv);
-- Saved value of argv (argument pointers), imported from misc.c
gnat_argc : Nat;
gnat_argv : Arg_Array_Ptr;
pragma Import (C, gnat_argc);
pragma Import (C, gnat_argv);
-- If save_argv is not set, default to gnat_argc/argv
argc : Nat;
argv : Arg_Array_Ptr;
function Len_Arg (Arg : Big_String_Ptr) return Nat;
-- Determine length of argument Arg (a nul terminated C string).
-------------
-- Len_Arg --
-------------
function Len_Arg (Arg : Big_String_Ptr) return Nat is
begin
for J in 1 .. Nat'Last loop
if Arg (Natural (J)) = ASCII.NUL then
return J - 1;
end if;
end loop;
raise Program_Error;
end Len_Arg;
begin
if save_argv /= null then
argv := save_argv;
argc := save_argc;
else
-- Case of a non gcc compiler, e.g. gnat2why or gnat2scil
argv := gnat_argv;
argc := gnat_argc;
end if;
-- Loop through arguments looking for -gnateT, also look for -gnatd.b
for Arg in 1 .. argc - 1 loop
declare
Argv_Ptr : constant Big_String_Ptr := argv (Arg);
Argv_Len : constant Nat := Len_Arg (Argv_Ptr);
begin
if Argv_Len > 8
and then Argv_Ptr (1 .. 8) = "-gnateT="
then
Opt.Target_Dependent_Info_Read_Name :=
new String'(Argv_Ptr (9 .. Natural (Argv_Len)));
elsif Argv_Len >= 8
and then Argv_Ptr (1 .. 8) = "-gnatd.b"
then
Debug_Flag_Dot_B := True;
end if;
end;
end loop;
end;
-- Case of reading the target dependent values from file
-- This is bit more complex than might be expected, because it has to be
-- done very early. All kinds of packages depend on these values, and we
-- can't wait till the normal processing of reading command line switches
-- etc to read the file. We do this at the System.OS_Lib level since it is
-- too early to be using Osint directly.
if Opt.Target_Dependent_Info_Read_Name /= null then
Read_Target_Dependent_Values (Target_Dependent_Info_Read_Name.all);
else
-- If the back-end comes with a target config file, then use it
-- to set the values
declare
Back_End_Config_File : constant String_Ptr :=
Get_Back_End_Config_File;
begin
if Back_End_Config_File /= null then
pragma Gnat_Annotate
(CodePeer, Intentional, "test always false",
"some variant body will return non null");
Read_Target_Dependent_Values (Back_End_Config_File.all);
-- Otherwise we get all values from the back end directly
else
Bits_BE := Get_Bits_BE;
Bits_Per_Unit := Get_Bits_Per_Unit;
Bits_Per_Word := Get_Bits_Per_Word;
Bytes_BE := Get_Bytes_BE;
Char_Size := Get_Char_Size;
Double_Float_Alignment := Get_Double_Float_Alignment;
Double_Scalar_Alignment := Get_Double_Scalar_Alignment;
Float_Words_BE := Get_Float_Words_BE;
Int_Size := Get_Int_Size;
Long_Long_Size := Get_Long_Long_Size;
Long_Size := Get_Long_Size;
Maximum_Alignment := Get_Maximum_Alignment;
Max_Unaligned_Field := Get_Max_Unaligned_Field;
Pointer_Size := Get_Pointer_Size;
Short_Enums := Get_Short_Enums;
Short_Size := Get_Short_Size;
Strict_Alignment := Get_Strict_Alignment;
System_Allocator_Alignment := Get_System_Allocator_Alignment;
Wchar_T_Size := Get_Wchar_T_Size;
Words_BE := Get_Words_BE;
-- Let the back-end register its floating point types and compute
-- the sizes of our standard types from there:
Num_FPT_Modes := 0;
Register_Back_End_Types (Register_Float_Type'Access);
declare
T : FPT_Mode_Entry renames
FPT_Mode_Table (FPT_Mode_Index_For (S_Float));
begin
Float_Size := Pos (T.SIZE);
end;
declare
T : FPT_Mode_Entry renames
FPT_Mode_Table (FPT_Mode_Index_For (S_Long_Float));
begin
Double_Size := Pos (T.SIZE);
end;
declare
T : FPT_Mode_Entry renames
FPT_Mode_Table (FPT_Mode_Index_For (S_Long_Long_Float));
begin
Long_Double_Size := Pos (T.SIZE);
end;
end if;
end;
end if;
end Set_Targ;
|
package body Problem_12 is
function Solution_1 return Int64 is
Sum : Int64 := 1;
Triangle_Num : Int64 := 1;
Inc : Int64 := 1;
Prime_Count : Int64;
Temp : Int64;
I : Int64 := 3;
begin
loop
Sum := 1;
Temp := Triangle_Num;
Prime_Count := 1;
while Temp mod 2 = 0 loop
Prime_Count := Prime_Count + 1;
Temp := Temp / 2;
end loop;
Sum := Sum * Prime_Count;
I := 3;
while Temp > 1 loop
Prime_Count := 1;
while Temp mod I = 0 loop
Prime_Count := Prime_Count + 1;
Temp := Temp / I;
end loop;
Sum := Sum * Prime_Count;
I := I + 2;
end loop;
exit when Sum > 500;
Inc := Inc + 1;
Triangle_Num := Triangle_Num + Inc;
end loop;
return Triangle_Num;
end Solution_1;
procedure Test_Solution_1 is
Solution: constant Int64 := 76576500;
begin
Assert( Solution_1 = Solution );
end Test_Solution_1;
function Get_Solutions return Solution_Case is
Ret : Solution_Case;
begin
Set_Name( Ret, "Problem 12");
Add_Test( Ret, Test_Solution_1'Access );
return Ret;
end Get_Solutions;
end Problem_12;
|
with Ada.Finalization; use Ada.Finalization;
package body EU_Projects.Nodes.Action_Nodes.WPs is
overriding
function Next
(Object : Deliverable_Iterator;
Position : Deliverable_Cursor) return Deliverable_Cursor
is
pragma Unreferenced (Object);
begin
if Position.Clone = Deliverable_Vectors.Element (Position.Top_Level).Max_Clone then
return Deliverable_Cursor'(Top_Level => Deliverable_Vectors.Next(Position.Top_Level),
Clone => 0);
else
return Deliverable_Cursor'(Top_Level => Position.Top_Level,
Clone => Position.Clone + 1);
end if;
end Next;
function Element (Index : Deliverable_Cursor) return Nodes.Timed_Nodes.Deliverables.Deliverable_Access
is
begin
if Index.Clone = 0 then
return Deliverable_Vectors.Element (Index.Top_Level);
else
return Deliverable_Vectors.Element (Index.Top_Level).Clone (Index.Clone);
end if;
end Element;
---------------------
-- Dependency_List --
---------------------
overriding function Dependency_List (Item : Project_WP)
return Node_Label_Lists.Vector
is
Result : Node_Label_Lists.Vector;
begin
for Tsk of Item.Task_List loop
Result.Append (Tsk);
end loop;
return Result;
end Dependency_List;
---------------------
-- Add_Deliverable --
---------------------
procedure Add_Deliverable
(WP : in out Project_WP;
item : Timed_Nodes.Deliverables.Deliverable_Access)
is
begin
if Item.Is_Clone or Item.Index /= Timed_Nodes.Deliverables.No_Deliverable
then
raise Constraint_Error;
end if;
WP.Deliverables.Append (Item);
Item.Set_Index (WP.Deliverables.Last_Index);
end Add_Deliverable;
------------
-- Create --
------------
function Create
(Label : WP_Label;
Name : String;
Short_Name : String;
Leader : Partners.Partner_Label;
Objectives : String;
Description : String;
Active_When : Action_Time;
Depends_On : Node_Label_Lists.Vector;
Node_Dir : in out Node_Tables.Node_Table)
return Project_WP_Access
is
Result : Project_WP_Access;
begin
Result := new
Project_WP'(Controlled with
Label => Node_Label (Label),
Raw_Time => Active_When,
Name => To_Unbounded_String (Name),
Short_Name => Make_Short_Name (Short_Name, Name),
Index => No_WP,
Description => To_Unbounded_String (Description),
Attributes => Attribute_Maps.Empty_Map,
Leader => Leader,
Class => WP_Node,
Objectives => To_Unbounded_String (Objectives),
Depend_On => Depends_On,
WP_Tasks => Task_Vectors.Empty_Vector,
Start_Symbolic => <>,
Stop_Symbolic => <>,
Duration_Symbolic => <>,
Start_At => <>,
Stop_At => <>,
Elapsed_Time => <>,
Start_Fixed => False,
Stop_Fixed => False,
Partner_Effort => Efforts.Effort_Maps.Empty_Map,
Deliverables => Deliverable_Vectors.Empty_Vector
);
Node_Dir.Insert (ID => Node_Label (Label),
Item => Node_Access (Result));
Result.Initialize_Efforts (Node_Dir);
return Result;
end Create;
--------------
-- Add_Task --
--------------
procedure Add_Task (WP : in out Project_WP;
Tsk : Tasks.Project_Task_Access)
is
use Efforts.Effort_Maps;
use type Efforts.Person_Months;
begin
WP.WP_Tasks.Append (Tsk);
Tsk.Set_Index (WP.WP_Tasks.Last_Index);
for Pos in WP.Partner_Effort.Iterate loop
WP.Partner_Effort (Pos) := WP.Partner_Effort (Pos) + Tsk.Effort_Of (Key (Pos));
end loop;
end Add_Task;
---------------
-- Set_Index --
---------------
procedure Set_Index (WP : in out Project_WP;
Idx : WP_Index)
is
begin
if WP.Index /= No_Index and WP.Index /= Node_Index (Idx) then
raise Constraint_Error;
else
WP.Index := Node_Index (Idx);
end if;
end Set_Index;
overriding procedure Parse_Raw_Expressions
(Item : in out Project_WP;
Vars : Times.Time_Expressions.Parsing.Symbol_Table)
is
begin
if Item.Raw_Time.Stop = To_Unbounded_String ("*") then
Item.Raw_Time.Stop := To_Unbounded_String (After (Item.Task_List, "end"));
end if;
Action_Node (Item).Parse_Raw_Expressions (Vars);
end Parse_Raw_Expressions;
---------------
-- Task_List --
---------------
function Task_List (Item : Project_WP) return Node_Label_Lists.Vector
is
Result : Node_Label_Lists.Vector;
begin
for T in Item.All_Tasks loop
Result.Append (Element (T).Label);
end loop;
return Result;
end Task_List;
end EU_Projects.Nodes.Action_Nodes.WPs;
-- ----------
-- -- Find --
-- ----------
--
-- function Find
-- (Where : Project_WP;
-- Label : Identifiers.Identifier)
-- return Searchable_Nodes.Child_Value
-- is
-- begin
-- -- Generated stub: replace with real body!
-- pragma Compile_Time_Warning (Standard.True, "Find unimplemented");
-- raise Program_Error with "Unimplemented function Find";
-- return Find (Where, Label);
-- end Find;
--
-- ------------
-- -- Exists --
-- ------------
--
-- function Exists
-- (Where : Project_WP;
-- Label : Identifiers.Identifier)
-- return Searchable_Nodes.Child_Class
-- is
-- begin
-- -- Generated stub: replace with real body!
-- pragma Compile_Time_Warning (Standard.True, "Exists unimplemented");
-- raise Program_Error with "Unimplemented function Exists";
-- return Exists (Where, Label);
-- end Exists;
-- ---------------------
-- -- Add_Description --
-- ---------------------
--
-- procedure Add_Description
-- (WP : in out Project_WP;
-- Description : String)
-- is
-- begin
-- -- Generated stub: replace with real body!
-- pragma Compile_Time_Warning (Standard.True, "Add_Description unimplemented");
-- raise Program_Error with "Unimplemented procedure Add_Description";
-- end Add_Description;
--
-- --------------------
-- -- Add_Objectives --
-- --------------------
--
-- procedure Add_Objectives
-- (WP : in out Project_WP;
-- Objectives : String)
-- is
-- begin
-- -- Generated stub: replace with real body!
-- pragma Compile_Time_Warning (Standard.True, "Add_Objectives unimplemented");
-- raise Program_Error with "Unimplemented procedure Add_Objectives";
-- end Add_Objectives;
-- --------------------
-- -- Add_Dependence --
-- --------------------
--
-- procedure Add_Dependence
-- (WP : in out Project_WP;
-- Label : Identifiers.Identifier)
-- is
-- begin
-- -- Generated stub: replace with real body!
-- pragma Compile_Time_Warning (Standard.True, "Add_Dependence unimplemented");
-- raise Program_Error with "Unimplemented procedure Add_Dependence";
-- end Add_Dependence;
-- ---------------------
-- -- Summarize_Tasks --
-- ---------------------
--
-- procedure Summarize_Tasks (WP : in out Project_WP) is
-- begin
-- -- Generated stub: replace with real body!
-- pragma Compile_Time_Warning (Standard.True, "Summarize_Tasks unimplemented");
-- raise Program_Error with "Unimplemented procedure Summarize_Tasks";
-- end Summarize_Tasks;
-- ---------------
-- -- Set_Times --
-- ---------------
--
-- procedure Set_Times
-- (WP : in out Project_WP;
-- Start_On : Symbolic_Time;
-- End_On : Symbolic_Time;
-- Duration : Symbolic_Time)
-- is
-- begin
-- -- Generated stub: replace with real body!
-- pragma Compile_Time_Warning (Standard.True, "Set_Times unimplemented");
-- raise Program_Error with "Unimplemented procedure Set_Times";
-- end Set_Times;
-- declare
-- Tmp : Unbounded_String := To_Unbounded_String ("max(");
-- begin
-- for Pos in Item.All_Tasks loop
-- if Tmp /= "max(" then
-- Tmp := Tmp & ",";
-- end if;
--
-- Tmp := Tmp & To_String (Element (Pos).Label) & ".end";
-- end loop;
--
-- if Tmp = "max(" then
-- raise Bad_Input with "End time '*' with no task";
-- end if;
--
-- Tmp := Tmp & ")";
--
-- Item.Raw_Time.Stop := Tmp;
-- end;
|
-----------------------------------------------------------------------
-- Logs -- Utility Log Package
-- Copyright (C) 2001, 2002, 2003, 2006, 2008, 2009, 2010, 2011, 2012 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.Text_IO;
with Ada.Containers;
with Ada.Strings;
with Ada.Strings.Fixed;
with Ada.Strings.Hash;
with Ada.Calendar;
with Ada.Containers.Indefinite_Hashed_Maps;
with Ada.Unchecked_Deallocation;
with Ada.IO_Exceptions;
with Util.Strings;
package body Util.Log.Loggers is
use Ada.Text_IO;
use Ada.Strings;
use Ada.Strings.Fixed;
use Log.Appenders;
package Appender_Maps is new Ada.Containers.Indefinite_Hashed_Maps
(String, Log.Appenders.Appender_Access, Ada.Strings.Hash, "=");
function Traceback (E : in Exception_Occurrence) return String is separate;
-- The log manager controls the configuration of loggers.
-- The log appenders are shared by loggers and they are created by
-- the log manager when a logger is created.
--
protected type Log_Manager is
-- Initialize the log environment with the property file.
procedure Initialize (Name : in String);
-- Initialize the log environment with the property file.
procedure Initialize (Properties : in Util.Properties.Manager);
-- Create and initialize the logger
procedure Create (Name : in String;
Log : out Logger_Info_Access);
-- Remove the logger from the list
procedure Remove (Log : in out Logger_Info_Access);
private
-- Initialize the logger by reading the configuration, setting its level
-- and creating the appender
procedure Initialize (Log : in out Logger_Info);
-- Re-initializes the loggers after the configuration is changed.
procedure Initialize_Again;
-- Find the appender to be used for the given logger.
-- Create the appender if necessary.
procedure Find_Appender (Property : in String;
Appender : out Appender_Access);
-- Obtain an appender given its name. If the appender does not exist, it is created.
procedure Build_Appender (Name : in String;
Appender : out Appender_Access);
procedure Delete_Appenders;
Config : Properties.Manager;
Appenders : Appender_Maps.Map;
Default_Level : Level_Type := INFO_LEVEL;
Default_Appender : Log.Appenders.Appender_Access := null;
First_Logger : Logger_Info_Access := null;
end Log_Manager;
Manager : Log_Manager;
function Get_Appender (Value : in String) return String;
procedure Format (Result : in out Unbounded_String;
Message : in String;
Arg1 : in String;
Arg2 : in String;
Arg3 : in String;
Arg4 : in String);
-- Get the logger property associated with a given logger
function Get_Logger_Property (Properties : in Util.Properties.Manager;
Name : in String) return String;
-- ------------------------------
-- Get the logger property associated with a given logger
-- ------------------------------
function Get_Logger_Property (Properties : in Util.Properties.Manager;
Name : in String) return String is
Prop_Name : constant String := "log4j.logger." & Name;
Pos : Natural := Prop_Name'Last;
begin
while Pos > Prop_Name'First loop
if Properties.Exists (Prop_Name (Prop_Name'First .. Pos)) then
return Trim (Properties.Get (Prop_Name (Prop_Name'First .. Pos)), Both);
end if;
Pos := Util.Strings.Rindex (Prop_Name, '.', Pos);
if Pos > 0 then
Pos := Pos - 1;
end if;
end loop;
return "";
end Get_Logger_Property;
-- ------------------------------
-- Initialize the log environment with the property file.
-- ------------------------------
procedure Initialize (Name : in String) is
begin
Manager.Initialize (Name);
end Initialize;
-- ------------------------------
-- Initialize the log environment with the properties.
-- ------------------------------
procedure Initialize (Properties : in Util.Properties.Manager) is
begin
Manager.Initialize (Properties);
end Initialize;
-- ------------------------------
-- Get the logger name.
-- ------------------------------
function Get_Logger_Name (Log : in Logger_Info) return String is
begin
return Log.Name;
end Get_Logger_Name;
protected body Log_Manager is
-- ------------------------------
-- Initialize the log environment with the property file.
-- ------------------------------
procedure Initialize (Name : in String) is
F : File_Type;
begin
Open (F, In_File, Name);
Properties.Load_Properties (Config, F);
Close (F);
Initialize_Again;
exception
when Ada.IO_Exceptions.Name_Error =>
declare
Event : Util.Log.Appenders.Log_Event;
Log : aliased Logger_Info := Logger_Info '(Len => 8,
Name => "Util.Log",
others => <>);
begin
Event.Time := Ada.Calendar.Clock;
Event.Level := WARN_LEVEL;
Event.Logger := Log'Unchecked_Access;
Format (Event.Message, "Log configuration file {0} not found", Name, "", "", "");
if Default_Appender = null then
Default_Appender := new Console_Appender;
end if;
Default_Appender.Append (Event);
end;
end Initialize;
-- ------------------------------
-- Re-initializes the loggers after the configuration is changed.
-- ------------------------------
procedure Initialize_Again is
L : Logger_Info_Access := First_Logger;
begin
Delete_Appenders;
-- Initialize the default category.
if Config.Exists ("log4j.rootCategory") then
declare
Value : constant String := Config.Get ("log4j.rootCategory");
begin
Default_Level := Get_Level (Value, Default_Level);
Find_Appender (Property => Value, Appender => Default_Appender);
end;
end if;
if Default_Appender = null then
Default_Appender := new Log.Appenders.Console_Appender;
end if;
Appenders.Insert (Key => "root", New_Item => Default_Appender);
-- Re-initialize the existing loggers. Note that there is no concurrency
-- protection if a thread calls 'Initialize' while another thread is using
-- an already initialized logger.
while L /= null loop
Initialize (L.all);
L := L.Next_Logger;
end loop;
end Initialize_Again;
-- ------------------------------
-- Initialize the log environment with the properties.
-- ------------------------------
procedure Initialize (Properties : in Util.Properties.Manager) is
begin
Config.Copy (From => Properties, Prefix => "log4j.");
Initialize_Again;
end Initialize;
-- ------------------------------
-- Initialize the logger by reading the configuration, setting its level
-- and creating the appender
-- ------------------------------
procedure Initialize (Log : in out Logger_Info) is
Prop : constant String := Get_Logger_Property (Config, Log.Name);
begin
Log.Level := Get_Level (Prop, Default_Level);
Find_Appender (Prop, Log.Appender);
end Initialize;
-- ------------------------------
-- Create and initialize the logger
-- ------------------------------
procedure Create (Name : in String;
Log : out Logger_Info_Access) is
begin
Log := new Logger_Info (Len => Name'Length);
Log.Name := Name;
Initialize (Log.all);
Log.Next_Logger := First_Logger;
Log.Prev_Logger := null;
if First_Logger /= null then
First_Logger.Prev_Logger := Log;
end if;
First_Logger := Log;
end Create;
-- ------------------------------
-- Remove the logger from the list
-- ------------------------------
procedure Remove (Log : in out Logger_Info_Access) is
procedure Free is new Ada.Unchecked_Deallocation (Object => Logger_Info,
Name => Logger_Info_Access);
begin
-- Remove first logger
if Log = First_Logger then
First_Logger := First_Logger.Next_Logger;
if First_Logger /= null then
First_Logger.Prev_Logger := null;
end if;
-- Remove last logger
elsif Log.Next_Logger = null then
Log.Prev_Logger.Next_Logger := null;
else
Log.Next_Logger.Prev_Logger := Log.Prev_Logger;
Log.Prev_Logger.Next_Logger := Log.Next_Logger;
end if;
Free (Log);
end Remove;
procedure Delete_Appenders is
procedure Free is new Ada.Unchecked_Deallocation (Object => Appender'Class,
Name => Appender_Access);
begin
while not Appenders.Is_Empty loop
declare
Iter : Appender_Maps.Cursor := Appenders.First;
E : Appender_Access := Appender_Maps.Element (Iter);
begin
Appenders.Delete (Iter);
-- Remove each mapping that points to the same appender.
Iter := Appenders.First;
while Appender_Maps.Has_Element (Iter) loop
if Appender_Maps.Element (Iter) = E then
Appenders.Delete (Iter);
Iter := Appenders.First;
else
Appender_Maps.Next (Iter);
end if;
end loop;
Free (E);
end;
end loop;
Default_Appender := null;
end Delete_Appenders;
-- ------------------------------
-- Obtain an appender given its name. If the appender does not exist, it is created.
-- ------------------------------
procedure Build_Appender (Name : in String;
Appender : out Appender_Access) is
use Appender_Maps;
Pos : constant Appender_Maps.Cursor := Appenders.Find (Name);
begin
if Pos /= Appender_Maps.No_Element then
Appender := Appender_Maps.Element (Pos);
return;
end if;
declare
Prop_Name : constant String := "log4j.appender." & Name;
Appender_Type : constant String := Config.Get (Prop_Name, "console");
begin
if Index (Appender_Type, "File") > 0 then
Appender := Create_File_Appender (Prop_Name, Config, Default_Level);
else
Appender := Create_Console_Appender (Prop_Name, Config, Default_Level);
end if;
Appenders.Insert (Name, Appender);
end;
end Build_Appender;
-- ------------------------------
-- Find an appender given the property value
-- ------------------------------
procedure Find_Appender (Property : in String;
Appender : out Appender_Access) is
use Appender_Maps;
Appender_Name : constant String := Get_Appender (Property);
Pos : constant Appender_Maps.Cursor := Appenders.Find (Appender_Name);
begin
if Pos /= Appender_Maps.No_Element then
Appender := Appender_Maps.Element (Pos);
return;
end if;
declare
N : Natural := Index (Appender_Name, ",");
Last_Pos : Natural := Appender_Name'First;
List : List_Appender_Access;
A : Appender_Access;
begin
-- The appender configuration refers to a list of appenders.
-- Example: DEBUG, out1, console
if N > 0 then
List := Create_List_Appender;
loop
Build_Appender (Trim (Appender_Name (Last_Pos .. N - 1), Both), A);
List.Add_Appender (A);
exit when N > Appender_Name'Last;
Last_Pos := N + 1;
N := Ada.Strings.Fixed.Index (Appender_Name, ",", Last_Pos);
if N = 0 then
N := Appender_Name'Last + 1;
end if;
end loop;
Appender := List.all'Access;
Appenders.Insert (Appender_Name, Appender);
else
Build_Appender (Appender_Name, Appender);
end if;
end;
end Find_Appender;
end Log_Manager;
-- ------------------------------
-- Get the log appender name from the property value
-- ------------------------------
function Get_Appender (Value : in String) return String is
Pos : constant Natural := Index (Value, ",");
begin
if Pos <= Value'First or Pos >= Value'Last then
return "root";
else
return Trim (Value (Pos + 1 .. Value'Last), Both);
end if;
end Get_Appender;
-- ------------------------------
-- Create a logger with the given name.
-- ------------------------------
function Create (Name : in String) return Logger is
Log : Logger_Info_Access;
begin
Manager.Create (Name, Log);
-- declare
-- Event : Util.Log.Appenders.Log_Event;
-- begin
-- Event.Time := Ada.Calendar.Clock;
-- Event.Level := DEBUG_LEVEL;
-- Event.Message := Format ("Create logger {0}", Name, "", "");
-- Event.Logger := To_Unbounded_String (Name);
-- Log.Appender.Append (Event);
-- end;
return Logger '(Ada.Finalization.Limited_Controlled with
Instance => Log);
end Create;
-- Create a logger with the given name and use the specified level.
function Create (Name : in String;
Level : in Level_Type) return Logger is
Log : Logger_Info_Access;
begin
Manager.Create (Name, Log);
Log.Level := Level;
return Logger '(Ada.Finalization.Limited_Controlled with
Instance => Log);
end Create;
-- ------------------------------
-- Initialize the logger and create a logger with the given name.
-- ------------------------------
function Create (Name : in String;
Config : in String) return Logger is
begin
Initialize (Config);
return Create (Name);
end Create;
-- ------------------------------
-- Change the log level
-- ------------------------------
procedure Set_Level (Log : in out Logger;
Level : in Level_Type) is
begin
Log.Instance.Level := Level;
end Set_Level;
-- ------------------------------
-- Get the log level.
-- ------------------------------
function Get_Level (Log : in Logger) return Level_Type is
begin
return Log.Instance.Level;
end Get_Level;
-- ------------------------------
-- Get the log level name.
-- ------------------------------
function Get_Level_Name (Log : in Logger) return String is
begin
return Get_Level_Name (Log.Instance.Level);
end Get_Level_Name;
-- ------------------------------
-- Format the message with the arguments
-- ------------------------------
procedure Format (Result : in out Unbounded_String;
Message : in String;
Arg1 : in String;
Arg2 : in String;
Arg3 : in String;
Arg4 : in String) is
Pos : Natural := Message'First;
First : Natural := Pos;
C : Character;
begin
-- Replace {N} with arg1, arg2, arg3 or ?
while Pos <= Message'Last loop
C := Message (Pos);
if C = '{' and then Pos + 2 <= Message'Last and then Message (Pos + 2) = '}' then
if First /= Pos then
Append (Result, Message (First .. Pos - 1));
end if;
C := Message (Pos + 1);
Pos := Pos + 2;
case C is
when '0' =>
Append (Result, Arg1);
when '1' =>
Append (Result, Arg2);
when '2' =>
Append (Result, Arg3);
when '3' =>
Append (Result, Arg4);
when others =>
Append (Result, "?");
end case;
First := Pos + 1;
end if;
Pos := Pos + 1;
end loop;
if First /= Pos then
Append (Result, Message (First .. Pos - 1));
end if;
end Format;
procedure Print (Log : in Logger;
Level : in Level_Type;
Message : in String;
Arg1 : in String := "";
Arg2 : in String := "";
Arg3 : in String := "";
Arg4 : in String := "") is
begin
if Log.Instance /= null and then Log.Instance.Level >= Level then
declare
Event : Util.Log.Appenders.Log_Event;
begin
Event.Time := Ada.Calendar.Clock;
Event.Level := Level;
Event.Logger := Log.Instance;
Format (Event.Message, Message, Arg1, Arg2, Arg3, Arg4);
Log.Instance.Appender.Append (Event);
end;
end if;
end Print;
procedure Debug (Log : in Logger'Class;
Message : in String;
Arg1 : in String := "";
Arg2 : in String := "";
Arg3 : in String := "") is
begin
Print (Log, DEBUG_LEVEL, Message, Arg1, Arg2, Arg3);
end Debug;
procedure Debug (Log : in Logger'Class;
Message : in String;
Arg1 : in Unbounded_String;
Arg2 : in String := "";
Arg3 : in String := "") is
begin
if Log.Instance /= null and then Log.Instance.Level >= DEBUG_LEVEL then
Print (Log, DEBUG_LEVEL, Message, To_String (Arg1), Arg2, Arg3);
end if;
end Debug;
procedure Debug (Log : in Logger'Class;
Message : in String;
Arg1 : in Unbounded_String;
Arg2 : in Unbounded_String;
Arg3 : in String := "") is
begin
if Log.Instance /= null and then Log.Instance.Level >= DEBUG_LEVEL then
Print (Log, DEBUG_LEVEL, Message, To_String (Arg1), To_String (Arg2), Arg3);
end if;
end Debug;
procedure Info (Log : in Logger'Class;
Message : in String;
Arg1 : in String := "";
Arg2 : in String := "";
Arg3 : in String := "") is
begin
Print (Log, INFO_LEVEL, Message, Arg1, Arg2, Arg3);
end Info;
procedure Info (Log : in Logger'Class;
Message : in String;
Arg1 : in Unbounded_String;
Arg2 : in String := "";
Arg3 : in String := "") is
begin
if Log.Instance /= null and then Log.Instance.Level >= INFO_LEVEL then
Print (Log, INFO_LEVEL, Message, To_String (Arg1), Arg2, Arg3);
end if;
end Info;
procedure Warn (Log : in Logger'Class;
Message : in String;
Arg1 : in String := "";
Arg2 : in String := "";
Arg3 : in String := "") is
begin
if Log.Instance /= null and then Log.Instance.Level >= WARN_LEVEL then
Print (Log, WARN_LEVEL, Message, Arg1, Arg2, Arg3);
end if;
end Warn;
procedure Error (Log : in Logger'Class;
Message : in String;
Arg1 : in String := "";
Arg2 : in String := "";
Arg3 : in String := "") is
begin
Print (Log, ERROR_LEVEL, Message, Arg1, Arg2, Arg3);
end Error;
procedure Error (Log : in Logger'Class;
Message : in String;
E : in Exception_Occurrence;
Trace : in Boolean := False) is
begin
if Trace then
Print (Log, ERROR_LEVEL,
"{0}: Exception {1}: {2} at {3}",
Message,
Exception_Name (E),
Exception_Message (E),
Traceback (E));
else
Print (Log, ERROR_LEVEL,
"{0}: Exception {1}: {2}",
Message,
Exception_Name (E),
Exception_Message (E));
end if;
end Error;
-- ------------------------------
-- Set the appender that will handle the log events
-- ------------------------------
procedure Set_Appender (Log : in out Logger'Class;
Appender : in Util.Log.Appenders.Appender_Access) is
begin
Log.Instance.Appender := Appender;
end Set_Appender;
-- ------------------------------
-- Finalize the logger and flush the associated appender
-- ------------------------------
procedure Finalize (Log : in out Logger) is
begin
if Log.Instance.Appender /= null then
Log.Instance.Appender.Flush;
end if;
Manager.Remove (Log.Instance);
end Finalize;
end Util.Log.Loggers;
|
-- Galois Linear Feedback Shift Register
-- https://en.wikipedia.org/wiki/Linear-feedback_shift_register#Galois_LFSRs
package body Random is
State : UInt16 := 16#DEAD#;
function Next
return UInt16
is
Taps : constant UInt16 := 16#B400#;
LFSR : UInt16 := State;
LSB : UInt16;
begin
loop
LSB := LFSR and 1;
LFSR := Shift_Right (LFSR, 1);
LFSR := LFSR xor ((-LSB) and Taps);
exit when LFSR /= State;
end loop;
State := LFSR;
return LFSR;
end Next;
function In_Range
(First, Last : Natural)
return Natural
is (First + (Natural (Next) mod (Last - First + 1)));
end Random;
|
-- 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_glx_get_minmax_parameterfv_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;
pad1 : aliased swig.int8_t_Array (0 .. 3);
n : aliased Interfaces.Unsigned_32;
datum : aliased xcb.xcb_glx_float32_t;
pad2 : aliased swig.int8_t_Array (0 .. 11);
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb
.xcb_glx_get_minmax_parameterfv_reply_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_get_minmax_parameterfv_reply_t.Item,
Element_Array => xcb.xcb_glx_get_minmax_parameterfv_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_glx_get_minmax_parameterfv_reply_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_get_minmax_parameterfv_reply_t.Pointer,
Element_Array =>
xcb.xcb_glx_get_minmax_parameterfv_reply_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_glx_get_minmax_parameterfv_reply_t;
|
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="14">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>call_Loop_LB2D_buf_p_1</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>in_stream_V_value_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>stream&lt;PackedStencil&lt;int, 1, 1, 1, 1&gt; &gt;.V.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>slice_stream_V_value_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</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>25</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name>buffer_0_value_V</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>168</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second class_id="11" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="12" tracking_level="0" version="0">
<first class_id="13" tracking_level="0" version="0">
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>168</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>buffer[0].value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name></name>
<fileName></fileName>
<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>51</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>row</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>row</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>53</item>
<item>54</item>
<item>55</item>
<item>56</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>tmp</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>177</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>177</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>57</item>
<item>59</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>row_1</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>177</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>177</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>row</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>60</item>
<item>62</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>177</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>177</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>63</item>
<item>64</item>
<item>65</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>tmp_s</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>187</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>187</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>79</item>
<item>80</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>179</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>179</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>col</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>col</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>67</item>
<item>68</item>
<item>69</item>
<item>70</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>tmp_1</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>179</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>179</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>71</item>
<item>73</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>col_1</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>179</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>179</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>74</item>
<item>75</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>179</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>179</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>76</item>
<item>77</item>
<item>78</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>col_cast</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>179</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>179</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>tmp_value_V_3</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>186</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>186</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>91</item>
<item>92</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>187</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>187</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>93</item>
<item>94</item>
<item>95</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>buffer_0_value_V_ad_1</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>198</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>198</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>96</item>
<item>97</item>
<item>98</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>p_Val2_s</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>198</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>198</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Val2__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>99</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>p_Result_s</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>206</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>206</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>101</item>
<item>102</item>
<item>103</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>207</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>207</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>105</item>
<item>106</item>
<item>107</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>208</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>208</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>108</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>buffer_0_value_V_ad</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>209</second>
</item>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator=</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>82</item>
<item>84</item>
<item>85</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name></name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>209</second>
</item>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator=</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>86</item>
<item>87</item>
<item>221</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>179</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>179</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>177</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>177</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</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>
<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>6</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_28">
<Value>
<Obj>
<type>2</type>
<id>49</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_29">
<Value>
<Obj>
<type>2</type>
<id>52</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_30">
<Value>
<Obj>
<type>2</type>
<id>58</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>1078</content>
</item>
<item class_id_reference="16" object_id="_31">
<Value>
<Obj>
<type>2</type>
<id>61</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_32">
<Value>
<Obj>
<type>2</type>
<id>72</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>1918</content>
</item>
<item class_id_reference="16" object_id="_33">
<Value>
<Obj>
<type>2</type>
<id>83</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>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_34">
<Obj>
<type>3</type>
<id>9</id>
<name>newFuncRoot</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>7</item>
<item>8</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_35">
<Obj>
<type>3</type>
<id>15</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>10</item>
<item>11</item>
<item>13</item>
<item>14</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_36">
<Obj>
<type>3</type>
<id>20</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>18</item>
<item>19</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_37">
<Obj>
<type>3</type>
<id>25</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>21</item>
<item>22</item>
<item>23</item>
<item>24</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_38">
<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>3</count>
<item_version>0</item_version>
<item>26</item>
<item>30</item>
<item>31</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_39">
<Obj>
<type>3</type>
<id>38</id>
<name>.preheader57</name>
<fileName></fileName>
<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>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
<item>37</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_40">
<Obj>
<type>3</type>
<id>43</id>
<name>._crit_edge</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>39</item>
<item>40</item>
<item>42</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_41">
<Obj>
<type>3</type>
<id>46</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>45</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_42">
<Obj>
<type>3</type>
<id>48</id>
<name>.preheader.exitStub</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>60</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_43">
<id>50</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_44">
<id>51</id>
<edge_type>2</edge_type>
<source_obj>15</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_45">
<id>53</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_46">
<id>54</id>
<edge_type>2</edge_type>
<source_obj>9</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_47">
<id>55</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_48">
<id>56</id>
<edge_type>2</edge_type>
<source_obj>46</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_49">
<id>57</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_50">
<id>59</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_51">
<id>60</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_52">
<id>62</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_53">
<id>63</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_54">
<id>64</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_55">
<id>65</id>
<edge_type>2</edge_type>
<source_obj>48</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_56">
<id>66</id>
<edge_type>2</edge_type>
<source_obj>15</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_57">
<id>67</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_58">
<id>68</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_59">
<id>69</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_60">
<id>70</id>
<edge_type>2</edge_type>
<source_obj>43</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_61">
<id>71</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_62">
<id>73</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_63">
<id>74</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_64">
<id>75</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_65">
<id>76</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_66">
<id>77</id>
<edge_type>2</edge_type>
<source_obj>32</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_67">
<id>78</id>
<edge_type>2</edge_type>
<source_obj>46</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_68">
<id>79</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_69">
<id>80</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_70">
<id>81</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_71">
<id>82</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_72">
<id>84</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_73">
<id>85</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_74">
<id>86</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_75">
<id>87</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_76">
<id>88</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_77">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_78">
<id>92</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_79">
<id>93</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_80">
<id>94</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_81">
<id>95</id>
<edge_type>2</edge_type>
<source_obj>43</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_82">
<id>96</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_83">
<id>97</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_84">
<id>98</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_85">
<id>99</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_86">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_87">
<id>103</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_88">
<id>106</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_89">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_90">
<id>108</id>
<edge_type>2</edge_type>
<source_obj>43</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_91">
<id>210</id>
<edge_type>2</edge_type>
<source_obj>9</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_92">
<id>211</id>
<edge_type>2</edge_type>
<source_obj>15</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_93">
<id>212</id>
<edge_type>2</edge_type>
<source_obj>15</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_94">
<id>213</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_95">
<id>214</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_96">
<id>215</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_97">
<id>216</id>
<edge_type>2</edge_type>
<source_obj>32</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_98">
<id>217</id>
<edge_type>2</edge_type>
<source_obj>32</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_99">
<id>218</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_100">
<id>219</id>
<edge_type>2</edge_type>
<source_obj>43</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_101">
<id>220</id>
<edge_type>2</edge_type>
<source_obj>46</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_102">
<id>221</id>
<edge_type>4</edge_type>
<source_obj>34</source_obj>
<sink_obj>40</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_103">
<mId>1</mId>
<mTag>call_Loop_LB2D_buf_p.1</mTag>
<mType>0</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>7</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>2071917</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_104">
<mId>2</mId>
<mTag>Entry</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_105">
<mId>3</mId>
<mTag>LB2D_buf</mTag>
<mType>1</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>4</item>
<item>5</item>
<item>6</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>1078</mMinTripCount>
<mMaxTripCount>1078</mMaxTripCount>
<mMinLatency>2071916</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_106">
<mId>4</mId>
<mTag>Region 1</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>15</item>
<item>20</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_107">
<mId>5</mId>
<mTag>LB2D_buf.1</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>4</count>
<item_version>0</item_version>
<item>25</item>
<item>32</item>
<item>38</item>
<item>43</item>
</basic_blocks>
<mII>1</mII>
<mDepth>3</mDepth>
<mMinTripCount>1918</mMinTripCount>
<mMaxTripCount>1918</mMaxTripCount>
<mMinLatency>1919</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_108">
<mId>6</mId>
<mTag>Region 2</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_109">
<mId>7</mId>
<mTag>Return</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="-1"></fsm>
<res class_id="-1"></res>
<node_label_latency class_id="26" tracking_level="0" version="0">
<count>25</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>7</first>
<second class_id="28" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>8</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>2</first>
<second>1</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="29" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="0" version="0">
<first>9</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>2</first>
<second>4</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>2</first>
<second>4</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>4</first>
<second>4</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="1" version="0" object_id="_110">
<region_name>LB2D_buf.1</region_name>
<basic_blocks>
<count>4</count>
<item_version>0</item_version>
<item>25</item>
<item>32</item>
<item>38</item>
<item>43</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>3</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="34" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="35" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="36" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core class_id="38" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
|
-----------------------------------------------------------------------
-- AWA.Jobs.Models -- AWA.Jobs.Models
-----------------------------------------------------------------------
-- File generated by ada-gen DO NOT MODIFY
-- Template used: templates/model/package-spec.xhtml
-- Ada Generator: https://ada-gen.googlecode.com/svn/trunk Revision 1095
-----------------------------------------------------------------------
-- Copyright (C) 2019 Stephane Carrez
-- Written by Stephane Carrez (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.
-----------------------------------------------------------------------
pragma Warnings (Off);
with ADO.Sessions;
with ADO.Objects;
with ADO.Statements;
with ADO.SQL;
with ADO.Schemas;
with Ada.Calendar;
with Ada.Containers.Vectors;
with Ada.Strings.Unbounded;
with Util.Beans.Objects;
with Util.Beans.Objects.Enums;
with Util.Beans.Basic.Lists;
with AWA.Events.Models;
with AWA.Users.Models;
pragma Warnings (On);
package AWA.Jobs.Models is
pragma Style_Checks ("-mr");
type Job_Status_Type is (SCHEDULED, RUNNING, CANCELED, FAILED, TERMINATED);
for Job_Status_Type use (SCHEDULED => 0, RUNNING => 1, CANCELED => 2, FAILED => 3, TERMINATED => 4);
package Job_Status_Type_Objects is
new Util.Beans.Objects.Enums (Job_Status_Type);
type Nullable_Job_Status_Type is record
Is_Null : Boolean := True;
Value : Job_Status_Type;
end record;
type Job_Ref is new ADO.Objects.Object_Ref with null record;
-- --------------------
-- The job is associated with a dispatching queue.
-- --------------------
-- Create an object key for Job.
function Job_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key;
-- Create an object key for Job from a string.
-- Raises Constraint_Error if the string cannot be converted into the object key.
function Job_Key (Id : in String) return ADO.Objects.Object_Key;
Null_Job : constant Job_Ref;
function "=" (Left, Right : Job_Ref'Class) return Boolean;
-- Set the job identifier
procedure Set_Id (Object : in out Job_Ref;
Value : in ADO.Identifier);
-- Get the job identifier
function Get_Id (Object : in Job_Ref)
return ADO.Identifier;
-- Set the job status
procedure Set_Status (Object : in out Job_Ref;
Value : in AWA.Jobs.Models.Job_Status_Type);
-- Get the job status
function Get_Status (Object : in Job_Ref)
return AWA.Jobs.Models.Job_Status_Type;
-- Set the job name
procedure Set_Name (Object : in out Job_Ref;
Value : in Ada.Strings.Unbounded.Unbounded_String);
procedure Set_Name (Object : in out Job_Ref;
Value : in String);
-- Get the job name
function Get_Name (Object : in Job_Ref)
return Ada.Strings.Unbounded.Unbounded_String;
function Get_Name (Object : in Job_Ref)
return String;
-- Set the job start date
procedure Set_Start_Date (Object : in out Job_Ref;
Value : in ADO.Nullable_Time);
-- Get the job start date
function Get_Start_Date (Object : in Job_Ref)
return ADO.Nullable_Time;
-- Set the job creation date
procedure Set_Create_Date (Object : in out Job_Ref;
Value : in Ada.Calendar.Time);
-- Get the job creation date
function Get_Create_Date (Object : in Job_Ref)
return Ada.Calendar.Time;
-- Set the job finish date
procedure Set_Finish_Date (Object : in out Job_Ref;
Value : in ADO.Nullable_Time);
-- Get the job finish date
function Get_Finish_Date (Object : in Job_Ref)
return ADO.Nullable_Time;
-- Set the job progress indicator
procedure Set_Progress (Object : in out Job_Ref;
Value : in Integer);
-- Get the job progress indicator
function Get_Progress (Object : in Job_Ref)
return Integer;
-- Set the job parameters
procedure Set_Parameters (Object : in out Job_Ref;
Value : in Ada.Strings.Unbounded.Unbounded_String);
procedure Set_Parameters (Object : in out Job_Ref;
Value : in String);
-- Get the job parameters
function Get_Parameters (Object : in Job_Ref)
return Ada.Strings.Unbounded.Unbounded_String;
function Get_Parameters (Object : in Job_Ref)
return String;
-- Set the job result
procedure Set_Results (Object : in out Job_Ref;
Value : in Ada.Strings.Unbounded.Unbounded_String);
procedure Set_Results (Object : in out Job_Ref;
Value : in String);
-- Get the job result
function Get_Results (Object : in Job_Ref)
return Ada.Strings.Unbounded.Unbounded_String;
function Get_Results (Object : in Job_Ref)
return String;
--
function Get_Version (Object : in Job_Ref)
return Integer;
-- Set the job priority
procedure Set_Priority (Object : in out Job_Ref;
Value : in Integer);
-- Get the job priority
function Get_Priority (Object : in Job_Ref)
return Integer;
--
procedure Set_User (Object : in out Job_Ref;
Value : in AWA.Users.Models.User_Ref'Class);
--
function Get_User (Object : in Job_Ref)
return AWA.Users.Models.User_Ref'Class;
--
procedure Set_Event (Object : in out Job_Ref;
Value : in AWA.Events.Models.Message_Ref'Class);
--
function Get_Event (Object : in Job_Ref)
return AWA.Events.Models.Message_Ref'Class;
--
procedure Set_Session (Object : in out Job_Ref;
Value : in AWA.Users.Models.Session_Ref'Class);
--
function Get_Session (Object : in Job_Ref)
return AWA.Users.Models.Session_Ref'Class;
-- Load the entity identified by 'Id'.
-- Raises the NOT_FOUND exception if it does not exist.
procedure Load (Object : in out Job_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier);
-- Load the entity identified by 'Id'.
-- Returns True in <b>Found</b> if the object was found and False if it does not exist.
procedure Load (Object : in out Job_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier;
Found : out Boolean);
-- Find and load the entity.
overriding
procedure Find (Object : in out Job_Ref;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean);
-- Save the entity. If the entity does not have an identifier, an identifier is allocated
-- and it is inserted in the table. Otherwise, only data fields which have been changed
-- are updated.
overriding
procedure Save (Object : in out Job_Ref;
Session : in out ADO.Sessions.Master_Session'Class);
-- Delete the entity.
overriding
procedure Delete (Object : in out Job_Ref;
Session : in out ADO.Sessions.Master_Session'Class);
overriding
function Get_Value (From : in Job_Ref;
Name : in String) return Util.Beans.Objects.Object;
-- Table definition
JOB_TABLE : constant ADO.Schemas.Class_Mapping_Access;
-- Internal method to allocate the Object_Record instance
overriding
procedure Allocate (Object : in out Job_Ref);
-- Copy of the object.
procedure Copy (Object : in Job_Ref;
Into : in out Job_Ref);
private
JOB_NAME : aliased constant String := "awa_job";
COL_0_1_NAME : aliased constant String := "id";
COL_1_1_NAME : aliased constant String := "status";
COL_2_1_NAME : aliased constant String := "name";
COL_3_1_NAME : aliased constant String := "start_date";
COL_4_1_NAME : aliased constant String := "create_date";
COL_5_1_NAME : aliased constant String := "finish_date";
COL_6_1_NAME : aliased constant String := "progress";
COL_7_1_NAME : aliased constant String := "parameters";
COL_8_1_NAME : aliased constant String := "results";
COL_9_1_NAME : aliased constant String := "version";
COL_10_1_NAME : aliased constant String := "priority";
COL_11_1_NAME : aliased constant String := "user_id";
COL_12_1_NAME : aliased constant String := "event_id";
COL_13_1_NAME : aliased constant String := "session_id";
JOB_DEF : aliased constant ADO.Schemas.Class_Mapping :=
(Count => 14,
Table => JOB_NAME'Access,
Members => (
1 => COL_0_1_NAME'Access,
2 => COL_1_1_NAME'Access,
3 => COL_2_1_NAME'Access,
4 => COL_3_1_NAME'Access,
5 => COL_4_1_NAME'Access,
6 => COL_5_1_NAME'Access,
7 => COL_6_1_NAME'Access,
8 => COL_7_1_NAME'Access,
9 => COL_8_1_NAME'Access,
10 => COL_9_1_NAME'Access,
11 => COL_10_1_NAME'Access,
12 => COL_11_1_NAME'Access,
13 => COL_12_1_NAME'Access,
14 => COL_13_1_NAME'Access)
);
JOB_TABLE : constant ADO.Schemas.Class_Mapping_Access
:= JOB_DEF'Access;
Null_Job : constant Job_Ref
:= Job_Ref'(ADO.Objects.Object_Ref with null record);
type Job_Impl is
new ADO.Objects.Object_Record (Key_Type => ADO.Objects.KEY_INTEGER,
Of_Class => JOB_DEF'Access)
with record
Status : AWA.Jobs.Models.Job_Status_Type;
Name : Ada.Strings.Unbounded.Unbounded_String;
Start_Date : ADO.Nullable_Time;
Create_Date : Ada.Calendar.Time;
Finish_Date : ADO.Nullable_Time;
Progress : Integer;
Parameters : Ada.Strings.Unbounded.Unbounded_String;
Results : Ada.Strings.Unbounded.Unbounded_String;
Version : Integer;
Priority : Integer;
User : AWA.Users.Models.User_Ref;
Event : AWA.Events.Models.Message_Ref;
Session : AWA.Users.Models.Session_Ref;
end record;
type Job_Access is access all Job_Impl;
overriding
procedure Destroy (Object : access Job_Impl);
overriding
procedure Find (Object : in out Job_Impl;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean);
overriding
procedure Load (Object : in out Job_Impl;
Session : in out ADO.Sessions.Session'Class);
procedure Load (Object : in out Job_Impl;
Stmt : in out ADO.Statements.Query_Statement'Class;
Session : in out ADO.Sessions.Session'Class);
overriding
procedure Save (Object : in out Job_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
procedure Create (Object : in out Job_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
overriding
procedure Delete (Object : in out Job_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
procedure Set_Field (Object : in out Job_Ref'Class;
Impl : out Job_Access);
end AWA.Jobs.Models;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2018, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
package USB_Testing is
end USB_Testing;
|
package FLTK.Widgets.Groups.Packed is
type Packed_Group is new Group with private;
type Packed_Group_Reference (Data : not null access Packed_Group'Class) is
limited null record with Implicit_Dereference => Data;
package Forge is
function Create
(X, Y, W, H : in Integer;
Text : in String)
return Packed_Group;
end Forge;
function Get_Spacing
(This : in Packed_Group)
return Integer;
procedure Set_Spacing
(This : in out Packed_Group;
To : in Integer);
procedure Draw
(This : in out Packed_Group);
function Handle
(This : in out Packed_Group;
Event : in Event_Kind)
return Event_Outcome;
private
type Packed_Group is new Group with null record;
overriding procedure Finalize
(This : in out Packed_Group);
pragma Inline (Get_Spacing);
pragma Inline (Set_Spacing);
pragma Inline (Draw);
pragma Inline (Handle);
end FLTK.Widgets.Groups.Packed;
|
with Tkmrpc.Types;
with Tkmrpc.Operations.Ike;
package Tkmrpc.Request.Ike.Esa_Select is
Data_Size : constant := 8;
type Data_Type is record
Esa_Id : Types.Esa_Id_Type;
end record;
for Data_Type use record
Esa_Id at 0 range 0 .. (8 * 8) - 1;
end record;
for Data_Type'Size use Data_Size * 8;
Padding_Size : constant := Request.Body_Size - Data_Size;
subtype Padding_Range is Natural range 1 .. Padding_Size;
subtype Padding_Type is Types.Byte_Sequence (Padding_Range);
type Request_Type is record
Header : Request.Header_Type;
Data : Data_Type;
Padding : Padding_Type;
end record;
for Request_Type use record
Header at 0 range 0 .. (Request.Header_Size * 8) - 1;
Data at Request.Header_Size range 0 .. (Data_Size * 8) - 1;
Padding at Request.Header_Size + Data_Size range
0 .. (Padding_Size * 8) - 1;
end record;
for Request_Type'Size use Request.Request_Size * 8;
Null_Request : constant Request_Type :=
Request_Type'
(Header =>
Request.Header_Type'(Operation => Operations.Ike.Esa_Select,
Request_Id => 0),
Data => Data_Type'(Esa_Id => Types.Esa_Id_Type'First),
Padding => Padding_Type'(others => 0));
end Tkmrpc.Request.Ike.Esa_Select;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- G N A T . S P I T B O L . P A T T E R N S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1997-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. --
-- --
------------------------------------------------------------------------------
-- SPITBOL-like pattern construction and matching
-- This child package of GNAT.SPITBOL provides a complete implementation
-- of the SPITBOL-like pattern construction and matching operations. This
-- package is based on Macro-SPITBOL created by Robert Dewar.
------------------------------------------------------------
-- Summary of Pattern Matching Packages in GNAT Hierarchy --
------------------------------------------------------------
-- There are three related packages that perform pattern 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/g-regexp.adb)
-- This is a simple package providing Unix-style regular expression
-- matching with the restriction that it matches entire strings. It
-- is particularly useful for file name matching, and in particular
-- it provides "globbing patterns" that are useful in implementing
-- unix or DOS style wildcard matching for file names.
-- GNAT.Regpat (files g-regpat.ads/g-regpat.adb)
-- This is a more complete implementation of Unix-style regular
-- expressions, copied from the original V7 style regular expression
-- library written in C by Henry Spencer. It is functionally the
-- same as this library, and uses the same internal data structures
-- stored in a binary compatible manner.
-- GNAT.Spitbol.Patterns (files g-spipat.ads/g-spipat.adb)
-- This is a completely general patterm matching package based on the
-- pattern language of SNOBOL4, as implemented in SPITBOL. The pattern
-- language is modeled on context free grammars, with context sensitive
-- extensions that provide full (type 0) computational capabilities.
with Ada.Strings.Maps; use Ada.Strings.Maps;
with Ada.Text_IO; use Ada.Text_IO;
package GNAT.Spitbol.Patterns is
pragma Elaborate_Body;
-------------------------------
-- Pattern Matching Tutorial --
-------------------------------
-- A pattern matching operation (a call to one of the Match subprograms)
-- takes a subject string and a pattern, and optionally a replacement
-- string. The replacement string option is only allowed if the subject
-- is a variable.
-- The pattern is matched against the subject string, and either the
-- match fails, or it succeeds matching a contiguous substring. If a
-- replacement string is specified, then the subject string is modified
-- by replacing the matched substring with the given replacement.
-- Concatenation and Alternation
-- =============================
-- A pattern consists of a series of pattern elements. The pattern is
-- built up using either the concatenation operator:
-- A & B
-- which means match A followed immediately by matching B, or the
-- alternation operator:
-- A or B
-- which means first attempt to match A, and then if that does not
-- succeed, match B.
-- There is full backtracking, which means that if a given pattern
-- element fails to match, then previous alternatives are matched.
-- For example if we have the pattern:
-- (A or B) & (C or D) & (E or F)
-- First we attempt to match A, if that succeeds, then we go on to try
-- to match C, and if that succeeds, we go on to try to match E. If E
-- fails, then we try F. If F fails, then we go back and try matching
-- D instead of C. Let's make this explicit using a specific example,
-- and introducing the simplest kind of pattern element, which is a
-- literal string. The meaning of this pattern element is simply to
-- match the characters that correspond to the string characters. Now
-- let's rewrite the above pattern form with specific string literals
-- as the pattern elements:
-- ("ABC" or "AB") & ("DEF" or "CDE") & ("GH" or "IJ")
-- The following strings will be attempted in sequence:
-- ABC . DEF . GH
-- ABC . DEF . IJ
-- ABC . CDE . GH
-- ABC . CDE . IJ
-- AB . DEF . GH
-- AB . DEF . IJ
-- AB . CDE . GH
-- AB . CDE . IJ
-- Here we use the dot simply to separate the pieces of the string
-- matched by the three separate elements.
-- Moving the Start Point
-- ======================
-- A pattern is not required to match starting at the first character
-- of the string, and is not required to match to the end of the string.
-- The first attempt does indeed attempt to match starting at the first
-- character of the string, trying all the possible alternatives. But
-- if all alternatives fail, then the starting point of the match is
-- moved one character, and all possible alternatives are attempted at
-- the new anchor point.
-- The entire match fails only when every possible starting point has
-- been attempted. As an example, suppose that we had the subject
-- string
-- "ABABCDEIJKL"
-- matched using the pattern in the previous example:
-- ("ABC" or "AB") & ("DEF" or "CDE") & ("GH" or "IJ")
-- would succeed, after two anchor point moves:
-- "ABABCDEIJKL"
-- ^^^^^^^
-- matched
-- section
-- This mode of pattern matching is called the unanchored mode. It is
-- also possible to put the pattern matcher into anchored mode by
-- setting the global variable Anchored_Mode to True. This will cause
-- all subsequent matches to be performed in anchored mode, where the
-- match is required to start at the first character.
-- We will also see later how the effect of an anchored match can be
-- obtained for a single specified anchor point if this is desired.
-- Other Pattern Elements
-- ======================
-- In addition to strings (or single characters), there are many special
-- pattern elements that correspond to special predefined alternations:
-- Arb Matches any string. First it matches the null string, and
-- then on a subsequent failure, matches one character, and
-- then two characters, and so on. It only fails if the
-- entire remaining string is matched.
-- Bal Matches a non-empty string that is parentheses balanced
-- with respect to ordinary () characters. Examples of
-- balanced strings are "ABC", "A((B)C)", and "A(B)C(D)E".
-- Bal matches the shortest possible balanced string on the
-- first attempt, and if there is a subsequent failure,
-- attempts to extend the string.
-- Cancel Immediately aborts the entire pattern match, signalling
-- failure. This is a specialized pattern element, which is
-- useful in conjunction with some of the special pattern
-- elements that have side effects.
-- Fail The null alternation. Matches no possible strings, so it
-- always signals failure. This is a specialized pattern
-- element, which is useful in conjunction with some of the
-- special pattern elements that have side effects.
-- Fence Matches the null string at first, and then if a failure
-- causes alternatives to be sought, aborts the match (like
-- a Cancel). Note that using Fence at the start of a pattern
-- has the same effect as matching in anchored mode.
-- Rest Matches from the current point to the last character in
-- the string. This is a specialized pattern element, which
-- is useful in conjunction with some of the special pattern
-- elements that have side effects.
-- Succeed Repeatedly matches the null string (it is equivalent to
-- the alternation ("" or "" or "" ....). This is a special
-- pattern element, which is useful in conjunction with some
-- of the special pattern elements that have side effects.
-- Pattern Construction Functions
-- ==============================
-- The following functions construct additional pattern elements
-- Any(S) Where S is a string, matches a single character that is
-- any one of the characters in S. Fails if the current
-- character is not one of the given set of characters.
-- Arbno(P) Where P is any pattern, matches any number of instances
-- of the pattern, starting with zero occurrences. It is
-- thus equivalent to ("" or (P & ("" or (P & ("" ....)))).
-- The pattern P may contain any number of pattern elements
-- including the use of alternation and concatenation.
-- Break(S) Where S is a string, matches a string of zero or more
-- characters up to but not including a break character
-- that is one of the characters given in the string S.
-- Can match the null string, but cannot match the last
-- character in the string, since a break character is
-- required to be present.
-- BreakX(S) Where S is a string, behaves exactly like Break(S) when
-- it first matches, but if a string is successfully matched,
-- then a subsequent failure causes an attempt to extend the
-- matched string.
-- Fence(P) Where P is a pattern, attempts to match the pattern P
-- including trying all possible alternatives of P. If none
-- of these alternatives succeeds, then the Fence pattern
-- fails. If one alternative succeeds, then the pattern
-- match proceeds, but on a subsequent failure, no attempt
-- is made to search for alternative matches of P. The
-- pattern P may contain any number of pattern elements
-- including the use of alternation and concatenation.
-- Len(N) Where N is a natural number, matches the given number of
-- characters. For example, Len(10) matches any string that
-- is exactly ten characters long.
-- NotAny(S) Where S is a string, matches a single character that is
-- not one of the characters of S. Fails if the current
-- character is one of the given set of characters.
-- NSpan(S) Where S is a string, matches a string of zero or more
-- characters that is among the characters given in the
-- string. Always matches the longest possible such string.
-- Always succeeds, since it can match the null string.
-- Pos(N) Where N is a natural number, matches the null string
-- if exactly N characters have been matched so far, and
-- otherwise fails.
-- Rpos(N) Where N is a natural number, matches the null string
-- if exactly N characters remain to be matched, and
-- otherwise fails.
-- Rtab(N) Where N is a natural number, matches characters from
-- the current position until exactly N characters remain
-- to be matched in the string. Fails if fewer than N
-- unmatched characters remain in the string.
-- Tab(N) Where N is a natural number, matches characters from
-- the current position until exactly N characters have
-- been matched in all. Fails if more than N characters
-- have already been matched.
-- Span(S) Where S is a string, matches a string of one or more
-- characters that is among the characters given in the
-- string. Always matches the longest possible such string.
-- Fails if the current character is not one of the given
-- set of characters.
-- Recursive Pattern Matching
-- ==========================
-- The plus operator (+P) where P is a pattern variable, creates
-- a recursive pattern that will, at pattern matching time, follow
-- the pointer to obtain the referenced pattern, and then match this
-- pattern. This may be used to construct recursive patterns. Consider
-- for example:
-- P := ("A" or ("B" & (+P)))
-- On the first attempt, this pattern attempts to match the string "A".
-- If this fails, then the alternative matches a "B", followed by an
-- attempt to match P again. This second attempt first attempts to
-- match "A", and so on. The result is a pattern that will match a
-- string of B's followed by a single A.
-- This particular example could simply be written as NSpan('B') & 'A',
-- but the use of recursive patterns in the general case can construct
-- complex patterns which could not otherwise be built.
-- Pattern Assignment Operations
-- =============================
-- In addition to the overall result of a pattern match, which indicates
-- success or failure, it is often useful to be able to keep track of
-- the pieces of the subject string that are matched by individual
-- pattern elements, or subsections of the pattern.
-- The pattern assignment operators allow this capability. The first
-- form is the immediate assignment:
-- P * S
-- Here P is an arbitrary pattern, and S is a variable of type VString
-- that will be set to the substring matched by P. This assignment
-- happens during pattern matching, so if P matches more than once,
-- then the assignment happens more than once.
-- The deferred assignment operation:
-- P ** S
-- avoids these multiple assignments by deferring the assignment to the
-- end of the match. If the entire match is successful, and if the
-- pattern P was part of the successful match, then at the end of the
-- matching operation the assignment to S of the string matching P is
-- performed.
-- The cursor assignment operation:
-- Setcur(N'Access)
-- assigns the current cursor position to the natural variable N. The
-- cursor position is defined as the count of characters that have been
-- matched so far (including any start point moves).
-- Finally the operations * and ** may be used with values of type
-- Text_IO.File_Access. The effect is to do a Put_Line operation of
-- the matched substring. These are particularly useful in debugging
-- pattern matches.
-- Deferred Matching
-- =================
-- The pattern construction functions (such as Len and Any) all permit
-- the use of pointers to natural or string values, or functions that
-- return natural or string values. These forms cause the actual value
-- to be obtained at pattern matching time. This allows interesting
-- possibilities for constructing dynamic patterns as illustrated in
-- the examples section.
-- In addition the (+S) operator may be used where S is a pointer to
-- string or function returning string, with a similar deferred effect.
-- A special use of deferred matching is the construction of predicate
-- functions. The element (+P) where P is an access to a function that
-- returns a Boolean value, causes the function to be called at the
-- time the element is matched. If the function returns True, then the
-- null string is matched, if the function returns False, then failure
-- is signalled and previous alternatives are sought.
-- Deferred Replacement
-- ====================
-- The simple model given for pattern replacement (where the matched
-- substring is replaced by the string given as the third argument to
-- Match) works fine in simple cases, but this approach does not work
-- in the case where the expression used as the replacement string is
-- dependent on values set by the match.
-- For example, suppose we want to find an instance of a parenthesized
-- character, and replace the parentheses with square brackets. At first
-- glance it would seem that:
-- Match (Subject, '(' & Len (1) * Char & ')', '[' & Char & ']');
-- would do the trick, but that does not work, because the third
-- argument to Match gets evaluated too early, before the call to
-- Match, and before the pattern match has had a chance to set Char.
-- To solve this problem we provide the deferred replacement capability.
-- With this approach, which of course is only needed if the pattern
-- involved has side effects, is to do the match in two stages. The
-- call to Match sets a pattern result in a variable of the private
-- type Match_Result, and then a subsequent Replace operation uses
-- this Match_Result object to perform the required replacement.
-- Using this approach, we can now write the above operation properly
-- in a manner that will work:
-- M : Match_Result;
-- ...
-- Match (Subject, '(' & Len (1) * Char & ')', M);
-- Replace (M, '[' & Char & ']');
-- As with other Match cases, there is a function and procedure form
-- of this match call. A call to Replace after a failed match has no
-- effect. Note that Subject should not be modified between the calls.
-- Examples of Pattern Matching
-- ============================
-- First a simple example of the use of pattern replacement to remove
-- a line number from the start of a string. We assume that the line
-- number has the form of a string of decimal digits followed by a
-- period, followed by one or more spaces.
-- Digs : constant Pattern := Span("0123456789");
-- Lnum : constant Pattern := Pos(0) & Digs & '.' & Span(' ');
-- Now to use this pattern we simply do a match with a replacement:
-- Match (Line, Lnum, "");
-- which replaces the line number by the null string. Note that it is
-- also possible to use an Ada.Strings.Maps.Character_Set value as an
-- argument to Span and similar functions, and in particular all the
-- useful constants 'in Ada.Strings.Maps.Constants are available. This
-- means that we could define Digs as:
-- Digs : constant Pattern := Span(Decimal_Digit_Set);
-- The style we use here, of defining constant patterns and then using
-- them is typical. It is possible to build up patterns dynamically,
-- but it is usually more efficient to build them in pieces in advance
-- using constant declarations. Note in particular that although it is
-- possible to construct a pattern directly as an argument for the
-- Match routine, it is much more efficient to preconstruct the pattern
-- as we did in this example.
-- Now let's look at the use of pattern assignment to break a
-- string into sections. Suppose that the input string has two
-- unsigned decimal integers, separated by spaces or a comma,
-- with spaces allowed anywhere. Then we can isolate the two
-- numbers with the following pattern:
-- Num1, Num2 : aliased VString;
-- B : constant Pattern := NSpan(' ');
-- N : constant Pattern := Span("0123456789");
-- T : constant Pattern :=
-- NSpan(' ') & N * Num1 & Span(" ,") & N * Num2;
-- The match operation Match (" 124, 257 ", T) would assign the
-- string 124 to Num1 and the string 257 to Num2.
-- Now let's see how more complex elements can be built from the
-- set of primitive elements. The following pattern matches strings
-- that have the syntax of Ada 95 based literals:
-- Digs : constant Pattern := Span(Decimal_Digit_Set);
-- UDigs : constant Pattern := Digs & Arbno('_' & Digs);
-- Edig : constant Pattern := Span(Hexadecimal_Digit_Set);
-- UEdig : constant Pattern := Edig & Arbno('_' & Edig);
-- Bnum : constant Pattern := Udigs & '#' & UEdig & '#';
-- A match against Bnum will now match the desired strings, e.g.
-- it will match 16#123_abc#, but not a#b#. However, this pattern
-- is not quite complete, since it does not allow colons to replace
-- the pound signs. The following is more complete:
-- Bchar : constant Pattern := Any("#:");
-- Bnum : constant Pattern := Udigs & Bchar & UEdig & Bchar;
-- but that is still not quite right, since it allows # and : to be
-- mixed, and they are supposed to be used consistently. We solve
-- this by using a deferred match.
-- Temp : aliased VString;
-- Bnum : constant Pattern :=
-- Udigs & Bchar * Temp & UEdig & (+Temp)
-- Here the first instance of the base character is stored in Temp, and
-- then later in the pattern we rematch the value that was assigned.
-- For an example of a recursive pattern, let's define a pattern
-- that is like the built in Bal, but the string matched is balanced
-- with respect to square brackets or curly brackets.
-- The language for such strings might be defined in extended BNF as
-- ELEMENT ::= <any character other than [] or {}>
-- | '[' BALANCED_STRING ']'
-- | '{' BALANCED_STRING '}'
-- BALANCED_STRING ::= ELEMENT {ELEMENT}
-- Here we use {} to indicate zero or more occurrences of a term, as
-- is common practice in extended BNF. Now we can translate the above
-- BNF into recursive patterns as follows:
-- Element, Balanced_String : aliased Pattern;
-- .
-- .
-- .
-- Element := NotAny ("[]{}")
-- or
-- ('[' & (+Balanced_String) & ']')
-- or
-- ('{' & (+Balanced_String) & '}');
-- Balanced_String := Element & Arbno (Element);
-- Note the important use of + here to refer to a pattern not yet
-- defined. Note also that we use assignments precisely because we
-- cannot refer to as yet undeclared variables in initializations.
-- Now that this pattern is constructed, we can use it as though it
-- were a new primitive pattern element, and for example, the match:
-- Match ("xy[ab{cd}]", Balanced_String * Current_Output & Fail);
-- will generate the output:
-- x
-- xy
-- xy[ab{cd}]
-- y
-- y[ab{cd}]
-- [ab{cd}]
-- a
-- ab
-- ab{cd}
-- b
-- b{cd}
-- {cd}
-- c
-- cd
-- d
-- Note that the function of the fail here is simply to force the
-- pattern Balanced_String to match all possible alternatives. Studying
-- the operation of this pattern in detail is highly instructive.
-- Finally we give a rather elaborate example of the use of deferred
-- matching. The following declarations build up a pattern which will
-- find the longest string of decimal digits in the subject string.
-- Max, Cur : VString;
-- Loc : Natural;
-- function GtS return Boolean is
-- begin
-- return Length (Cur) > Length (Max);
-- end GtS;
-- Digit : constant Character_Set := Decimal_Digit_Set;
-- Digs : constant Pattern := Span(Digit);
-- Find : constant Pattern :=
-- "" * Max & Fence & -- initialize Max to null
-- BreakX (Digit) & -- scan looking for digits
-- ((Span(Digit) * Cur & -- assign next string to Cur
-- (+GtS'Unrestricted_Access) & -- check size(Cur) > Size(Max)
-- Setcur(Loc'Access)) -- if so, save location
-- * Max) & -- and assign to Max
-- Fail; -- seek all alternatives
-- As we see from the comments here, complex patterns like this take
-- on aspects of sequential programs. In fact they are sequential
-- programs with general backtracking. In this pattern, we first use
-- a pattern assignment that matches null and assigns it to Max, so
-- that it is initialized for the new match. Now BreakX scans to the
-- next digit. Arb would do here, but BreakX will be more efficient.
-- Once we have found a digit, we scan out the longest string of
-- digits with Span, and assign it to Cur. The deferred call to GtS
-- tests if the string we assigned to Cur is the longest so far. If
-- not, then failure is signalled, and we seek alternatives (this
-- means that BreakX will extend and look for the next digit string).
-- If the call to GtS succeeds then the matched string is assigned
-- as the largest string so far into Max and its location is saved
-- in Loc. Finally Fail forces the match to fail and seek alternatives,
-- so that the entire string is searched.
-- If the pattern Find is matched against a string, the variable Max
-- at the end of the pattern will have the longest string of digits,
-- and Loc will be the starting character location of the string. For
-- example, Match("ab123cd4657ef23", Find) will assign "4657" to Max
-- and 11 to Loc (indicating that the string ends with the eleventh
-- character of the string).
-- Note: the use of Unrestricted_Access to reference GtS will not
-- be needed if GtS is defined at the outer level, but definitely
-- will be necessary if GtS is a nested function (in which case of
-- course the scope of the pattern Find will be restricted to this
-- nested scope, and this cannot be checked, i.e. use of the pattern
-- outside this scope is erroneous). Generally it is a good idea to
-- define patterns and the functions they call at the outer level
-- where possible, to avoid such problems.
-- Correspondence with Pattern Matching in SPITBOL
-- ===============================================
-- Generally the Ada syntax and names correspond closely to SPITBOL
-- syntax for pattern matching construction.
-- The basic pattern construction operators are renamed as follows:
-- Spitbol Ada
-- (space) &
-- | or
-- $ *
-- . **
-- The Ada operators were chosen so that the relative precedences of
-- these operators corresponds to that of the Spitbol operators, but
-- as always, the use of parentheses is advisable to clarify.
-- The pattern construction operators all have similar names except for
-- Spitbol Ada
-- Abort Cancel
-- Rem Rest
-- where we have clashes with Ada reserved names
-- Ada requires the use of 'Access to refer to functions used in the
-- pattern match, and often the use of 'Unrestricted_Access may be
-- necessary to get around the scope restrictions if the functions
-- are not declared at the outer level.
-- The actual pattern matching syntax is modified in Ada as follows:
-- Spitbol Ada
-- X Y Match (X, Y);
-- X Y = Z Match (X, Y, Z);
-- and pattern failure is indicated by returning a Boolean result from
-- the Match function (True for success, False for failure).
-----------------------
-- Type Declarations --
-----------------------
type Pattern is private;
-- Type representing a pattern. This package provides a complete set of
-- operations for constructing patterns that can be used in the pattern
-- matching operations provided.
type Boolean_Func is access function return Boolean;
-- General Boolean function type. When this type is used as a formal
-- parameter type in this package, it indicates a deferred predicate
-- pattern. The function will be called when the pattern element is
-- matched and failure signalled if False is returned.
type Natural_Func is access function return Natural;
-- General Natural function type. When this type is used as a formal
-- parameter type in this package, it indicates a deferred pattern.
-- The function will be called when the pattern element is matched
-- to obtain the currently referenced Natural value.
type VString_Func is access function return VString;
-- General VString function type. When this type is used as a formal
-- parameter type in this package, it indicates a deferred pattern.
-- The function will be called when the pattern element is matched
-- to obtain the currently referenced string value.
subtype PString is String;
-- This subtype is used in the remainder of the package to indicate a
-- formal parameter that is converted to its corresponding pattern,
-- i.e. a pattern that matches the characters of the string.
subtype PChar is Character;
-- Similarly, this subtype is used in the remainder of the package to
-- indicate a formal parameter that is converted to its corresponding
-- pattern, i.e. a pattern that matches this one character.
subtype VString_Var is VString;
subtype Pattern_Var is Pattern;
-- These synonyms are used as formal parameter types to a function where,
-- if the language allowed, we would use in out parameters, but we are
-- not allowed to have in out parameters for functions. Instead we pass
-- actuals which must be variables, and with a bit of trickery in the
-- body, manage to interpret them properly as though they were indeed
-- in out parameters.
pragma Warnings (Off, VString_Var);
pragma Warnings (Off, Pattern_Var);
-- We turn off warnings for these two types so that when variables are used
-- as arguments in this context, warnings about them not being assigned in
-- the source program will be suppressed.
--------------------------------
-- Basic Pattern Construction --
--------------------------------
function "&" (L : Pattern; R : Pattern) return Pattern;
function "&" (L : PString; R : Pattern) return Pattern;
function "&" (L : Pattern; R : PString) return Pattern;
function "&" (L : PChar; R : Pattern) return Pattern;
function "&" (L : Pattern; R : PChar) return Pattern;
-- Pattern concatenation. Matches L followed by R
function "or" (L : Pattern; R : Pattern) return Pattern;
function "or" (L : PString; R : Pattern) return Pattern;
function "or" (L : Pattern; R : PString) return Pattern;
function "or" (L : PString; R : PString) return Pattern;
function "or" (L : PChar; R : Pattern) return Pattern;
function "or" (L : Pattern; R : PChar) return Pattern;
function "or" (L : PChar; R : PChar) return Pattern;
function "or" (L : PString; R : PChar) return Pattern;
function "or" (L : PChar; R : PString) return Pattern;
-- Pattern alternation. Creates a pattern that will first try to match
-- L and then on a subsequent failure, attempts to match R instead.
----------------------------------
-- Pattern Assignment Functions --
----------------------------------
function "*" (P : Pattern; Var : VString_Var) return Pattern;
function "*" (P : PString; Var : VString_Var) return Pattern;
function "*" (P : PChar; Var : VString_Var) return Pattern;
-- Matches P, and if the match succeeds, assigns the matched substring
-- to the given VString variable Var. This assignment happens as soon as
-- the substring is matched, and if the pattern P1 is matched more than
-- once during the course of the match, then the assignment will occur
-- more than once.
function "**" (P : Pattern; Var : VString_Var) return Pattern;
function "**" (P : PString; Var : VString_Var) return Pattern;
function "**" (P : PChar; Var : VString_Var) return Pattern;
-- Like "*" above, except that the assignment happens at most once
-- after the entire match is completed successfully. If the match
-- fails, then no assignment takes place.
----------------------------------
-- Deferred Matching Operations --
----------------------------------
function "+" (Str : VString_Var) return Pattern;
-- Here Str must be a VString variable. This function constructs a
-- pattern which at pattern matching time will access the current
-- value of this variable, and match against these characters.
function "+" (Str : VString_Func) return Pattern;
-- Constructs a pattern which at pattern matching time calls the given
-- function, and then matches against the string or character value
-- that is returned by the call.
function "+" (P : Pattern_Var) return Pattern;
-- Here P must be a Pattern variable. This function constructs a
-- pattern which at pattern matching time will access the current
-- value of this variable, and match against the pattern value.
function "+" (P : Boolean_Func) return Pattern;
-- Constructs a predicate pattern function that at pattern matching time
-- calls the given function. If True is returned, then the pattern matches.
-- If False is returned, then failure is signalled.
--------------------------------
-- Pattern Building Functions --
--------------------------------
function Arb return Pattern;
-- Constructs a pattern that will match any string. On the first attempt,
-- the pattern matches a null string, then on each successive failure, it
-- matches one more character, and only fails if matching the entire rest
-- of the string.
function Arbno (P : Pattern) return Pattern;
function Arbno (P : PString) return Pattern;
function Arbno (P : PChar) return Pattern;
-- Pattern repetition. First matches null, then on a subsequent failure
-- attempts to match an additional instance of the given pattern.
-- Equivalent to (but more efficient than) P & ("" or (P & ("" or ...
function Any (Str : String) return Pattern;
function Any (Str : VString) return Pattern;
function Any (Str : Character) return Pattern;
function Any (Str : Character_Set) return Pattern;
function Any (Str : not null access VString) return Pattern;
function Any (Str : VString_Func) return Pattern;
-- Constructs a pattern that matches a single character that is one of
-- the characters in the given argument. The pattern fails if the current
-- character is not in Str.
function Bal return Pattern;
-- Constructs a pattern that will match any non-empty string that is
-- parentheses balanced with respect to the normal parentheses characters.
-- Attempts to extend the string if a subsequent failure occurs.
function Break (Str : String) return Pattern;
function Break (Str : VString) return Pattern;
function Break (Str : Character) return Pattern;
function Break (Str : Character_Set) return Pattern;
function Break (Str : not null access VString) return Pattern;
function Break (Str : VString_Func) return Pattern;
-- Constructs a pattern that matches a (possibly null) string which
-- is immediately followed by a character in the given argument. This
-- character is not part of the matched string. The pattern fails if
-- the remaining characters to be matched do not include any of the
-- characters in Str.
function BreakX (Str : String) return Pattern;
function BreakX (Str : VString) return Pattern;
function BreakX (Str : Character) return Pattern;
function BreakX (Str : Character_Set) return Pattern;
function BreakX (Str : not null access VString) return Pattern;
function BreakX (Str : VString_Func) return Pattern;
-- Like Break, but the pattern attempts to extend on a failure to find
-- the next occurrence of a character in Str, and only fails when the
-- last such instance causes a failure.
function Cancel return Pattern;
-- Constructs a pattern that immediately aborts the entire match
function Fail return Pattern;
-- Constructs a pattern that always fails
function Fence return Pattern;
-- Constructs a pattern that matches null on the first attempt, and then
-- causes the entire match to be aborted if a subsequent failure occurs.
function Fence (P : Pattern) return Pattern;
-- Constructs a pattern that first matches P. If P fails, then the
-- constructed pattern fails. If P succeeds, then the match proceeds,
-- but if subsequent failure occurs, alternatives in P are not sought.
-- The idea of Fence is that each time the pattern is matched, just
-- one attempt is made to match P, without trying alternatives.
function Len (Count : Natural) return Pattern;
function Len (Count : not null access Natural) return Pattern;
function Len (Count : Natural_Func) return Pattern;
-- Constructs a pattern that matches exactly the given number of
-- characters. The pattern fails if fewer than this number of characters
-- remain to be matched in the string.
function NotAny (Str : String) return Pattern;
function NotAny (Str : VString) return Pattern;
function NotAny (Str : Character) return Pattern;
function NotAny (Str : Character_Set) return Pattern;
function NotAny (Str : not null access VString) return Pattern;
function NotAny (Str : VString_Func) return Pattern;
-- Constructs a pattern that matches a single character that is not
-- one of the characters in the given argument. The pattern Fails if
-- the current character is in Str.
function NSpan (Str : String) return Pattern;
function NSpan (Str : VString) return Pattern;
function NSpan (Str : Character) return Pattern;
function NSpan (Str : Character_Set) return Pattern;
function NSpan (Str : not null access VString) return Pattern;
function NSpan (Str : VString_Func) return Pattern;
-- Constructs a pattern that matches the longest possible string
-- consisting entirely of characters from the given argument. The
-- string may be empty, so this pattern always succeeds.
function Pos (Count : Natural) return Pattern;
function Pos (Count : not null access Natural) return Pattern;
function Pos (Count : Natural_Func) return Pattern;
-- Constructs a pattern that matches the null string if exactly Count
-- characters have already been matched, and otherwise fails.
function Rest return Pattern;
-- Constructs a pattern that always succeeds, matching the remaining
-- unmatched characters in the pattern.
function Rpos (Count : Natural) return Pattern;
function Rpos (Count : not null access Natural) return Pattern;
function Rpos (Count : Natural_Func) return Pattern;
-- Constructs a pattern that matches the null string if exactly Count
-- characters remain to be matched in the string, and otherwise fails.
function Rtab (Count : Natural) return Pattern;
function Rtab (Count : not null access Natural) return Pattern;
function Rtab (Count : Natural_Func) return Pattern;
-- Constructs a pattern that matches from the current location until
-- exactly Count characters remain to be matched in the string. The
-- pattern fails if fewer than Count characters remain to be matched.
function Setcur (Var : not null access Natural) return Pattern;
-- Constructs a pattern that matches the null string, and assigns the
-- current cursor position in the string. This value is the number of
-- characters matched so far. So it is zero at the start of the match.
function Span (Str : String) return Pattern;
function Span (Str : VString) return Pattern;
function Span (Str : Character) return Pattern;
function Span (Str : Character_Set) return Pattern;
function Span (Str : not null access VString) return Pattern;
function Span (Str : VString_Func) return Pattern;
-- Constructs a pattern that matches the longest possible string
-- consisting entirely of characters from the given argument. The
-- string cannot be empty, so the pattern fails if the current
-- character is not one of the characters in Str.
function Succeed return Pattern;
-- Constructs a pattern that succeeds matching null, both on the first
-- attempt, and on any rematch attempt, i.e. it is equivalent to an
-- infinite alternation of null strings.
function Tab (Count : Natural) return Pattern;
function Tab (Count : not null access Natural) return Pattern;
function Tab (Count : Natural_Func) return Pattern;
-- Constructs a pattern that from the current location until Count
-- characters have been matched. The pattern fails if more than Count
-- characters have already been matched.
---------------------------------
-- Pattern Matching Operations --
---------------------------------
-- The Match function performs an actual pattern matching operation.
-- The versions with three parameters perform a match without modifying
-- the subject string and return a Boolean result indicating if the
-- match is successful or not. The Anchor parameter is set to True to
-- obtain an anchored match in which the pattern is required to match
-- the first character of the string. In an unanchored match, which is
-- the default, successive attempts are made to match the given pattern
-- at each character of the subject string until a match succeeds, or
-- until all possibilities have failed.
-- Note that pattern assignment functions in the pattern may generate
-- side effects, so these functions are not necessarily pure.
Anchored_Mode : Boolean := False;
-- This global variable can be set True to cause all subsequent pattern
-- matches to operate in anchored mode. In anchored mode, no attempt is
-- made to move the anchor point, so that if the match succeeds it must
-- succeed starting at the first character. Note that the effect of
-- anchored mode may be achieved in individual pattern matches by using
-- Fence or Pos(0) at the start of the pattern.
Pattern_Stack_Overflow : exception;
-- Exception raised if internal pattern matching stack overflows. This
-- is typically the result of runaway pattern recursion. If there is a
-- genuine case of stack overflow, then either the match must be broken
-- down into simpler steps, or the stack limit must be reset.
Stack_Size : constant Positive := 2000;
-- Size used for internal pattern matching stack. Increase this size if
-- complex patterns cause Pattern_Stack_Overflow to be raised.
-- Simple match functions. The subject is matched against the pattern.
-- Any immediate or deferred assignments or writes are executed, and
-- the returned value indicates whether or not the match succeeded.
function Match
(Subject : VString;
Pat : Pattern) return Boolean;
function Match
(Subject : VString;
Pat : PString) return Boolean;
function Match
(Subject : String;
Pat : Pattern) return Boolean;
function Match
(Subject : String;
Pat : PString) return Boolean;
-- Replacement functions. The subject is matched against the pattern.
-- Any immediate or deferred assignments or writes are executed, and
-- the returned value indicates whether or not the match succeeded.
-- If the match succeeds, then the matched part of the subject string
-- is replaced by the given Replace string.
function Match
(Subject : VString_Var;
Pat : Pattern;
Replace : VString) return Boolean;
function Match
(Subject : VString_Var;
Pat : PString;
Replace : VString) return Boolean;
function Match
(Subject : VString_Var;
Pat : Pattern;
Replace : String) return Boolean;
function Match
(Subject : VString_Var;
Pat : PString;
Replace : String) return Boolean;
-- Simple match procedures. The subject is matched against the pattern.
-- Any immediate or deferred assignments or writes are executed. No
-- indication of success or failure is returned.
procedure Match
(Subject : VString;
Pat : Pattern);
procedure Match
(Subject : VString;
Pat : PString);
procedure Match
(Subject : String;
Pat : Pattern);
procedure Match
(Subject : String;
Pat : PString);
-- Replacement procedures. The subject is matched against the pattern.
-- Any immediate or deferred assignments or writes are executed. No
-- indication of success or failure is returned. If the match succeeds,
-- then the matched part of the subject string is replaced by the given
-- Replace string.
procedure Match
(Subject : in out VString;
Pat : Pattern;
Replace : VString);
procedure Match
(Subject : in out VString;
Pat : PString;
Replace : VString);
procedure Match
(Subject : in out VString;
Pat : Pattern;
Replace : String);
procedure Match
(Subject : in out VString;
Pat : PString;
Replace : String);
-- Deferred Replacement
type Match_Result is private;
-- Type used to record result of pattern match
subtype Match_Result_Var is Match_Result;
-- This synonyms is used as a formal parameter type to a function where,
-- if the language allowed, we would use an in out parameter, but we are
-- not allowed to have in out parameters for functions. Instead we pass
-- actuals which must be variables, and with a bit of trickery in the
-- body, manage to interpret them properly as though they were indeed
-- in out parameters.
function Match
(Subject : VString_Var;
Pat : Pattern;
Result : Match_Result_Var) return Boolean;
procedure Match
(Subject : in out VString;
Pat : Pattern;
Result : out Match_Result);
procedure Replace
(Result : in out Match_Result;
Replace : VString);
-- Given a previous call to Match which set Result, performs a pattern
-- replacement if the match was successful. Has no effect if the match
-- failed. This call should immediately follow the Match call.
------------------------
-- Debugging Routines --
------------------------
-- Debugging pattern matching operations can often be quite complex,
-- since there is no obvious way to trace the progress of the match.
-- The declarations in this section provide some debugging assistance.
Debug_Mode : Boolean := False;
-- This global variable can be set True to generate debugging on all
-- subsequent calls to Match. The debugging output is a full trace of
-- the actions of the pattern matcher, written to Standard_Output. The
-- level of this information is intended to be comprehensible at the
-- abstract level of this package declaration. However, note that the
-- use of this switch often generates large amounts of output.
function "*" (P : Pattern; Fil : File_Access) return Pattern;
function "*" (P : PString; Fil : File_Access) return Pattern;
function "*" (P : PChar; Fil : File_Access) return Pattern;
function "**" (P : Pattern; Fil : File_Access) return Pattern;
function "**" (P : PString; Fil : File_Access) return Pattern;
function "**" (P : PChar; Fil : File_Access) return Pattern;
-- These are similar to the corresponding pattern assignment operations
-- except that instead of setting the value of a variable, the matched
-- substring is written to the appropriate file. This can be useful in
-- following the progress of a match without generating the full amount
-- of information obtained by setting Debug_Mode to True.
Terminal : constant File_Access := Standard_Error;
Output : constant File_Access := Standard_Output;
-- Two handy synonyms for use with the above pattern write operations
-- Finally we have some routines that are useful for determining what
-- patterns are in use, particularly if they are constructed dynamically.
function Image (P : Pattern) return String;
function Image (P : Pattern) return VString;
-- This procedures yield strings that corresponds to the syntax needed
-- to create the given pattern using the functions in this package. The
-- form of this string is such that it could actually be compiled and
-- evaluated to yield the required pattern except for references to
-- variables and functions, which are output using one of the following
-- forms:
--
-- access Natural NP(16#...#)
-- access Pattern PP(16#...#)
-- access VString VP(16#...#)
--
-- Natural_Func NF(16#...#)
-- VString_Func VF(16#...#)
--
-- where 16#...# is the hex representation of the integer address that
-- corresponds to the given access value
procedure Dump (P : Pattern);
-- This procedure writes information about the pattern to Standard_Out.
-- The format of this information is keyed to the internal data structures
-- used to implement patterns. The information provided by Dump is thus
-- more precise than that yielded by Image, but is also a bit more obscure
-- (i.e. it cannot be interpreted solely in terms of this spec, you have
-- to know something about the data structures).
------------------
-- Private Part --
------------------
private
type PE;
-- Pattern element, a pattern is a complex structure of PE's. This type
-- is defined and described in the body of this package.
type PE_Ptr is access all PE;
-- Pattern reference. PE's use PE_Ptr values to reference other PE's
type Pattern is new Controlled with record
Stk : Natural := 0;
-- Maximum number of stack entries required for matching this
-- pattern. See description of pattern history stack in body.
P : PE_Ptr := null;
-- Pointer to initial pattern element for pattern
end record;
pragma Finalize_Storage_Only (Pattern);
procedure Adjust (Object : in out Pattern);
-- Adjust routine used to copy pattern objects
procedure Finalize (Object : in out Pattern);
-- Finalization routine used to release storage allocated for a pattern
type VString_Ptr is access all VString;
type Match_Result is record
Var : VString_Ptr;
-- Pointer to subject string. Set to null if match failed
Start : Natural := 1;
-- Starting index position (1's origin) of matched section of
-- subject string. Only valid if Var is non-null.
Stop : Natural := 0;
-- Ending index position (1's origin) of matched section of
-- subject string. Only valid if Var is non-null.
end record;
pragma Volatile (Match_Result);
-- This ensures that the Result parameter is passed by reference, so
-- that we can play our games with the bogus Match_Result_Var parameter
-- in the function case to treat it as though it were an in out parameter.
end GNAT.Spitbol.Patterns;
|
-- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2018 - 2019 Joakim Strandberg <joakim@mequinox.se>
--
-- 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 Aida.Deepend.XML_DOM_Parser is
type State_T is
(Expecting_Object_Start, -- seems to only apply to the root start tag
-- Expecting_Attribute_Or_Text_Or_Comment_Or_CDATA_Or_Object_Start_Or_Object_End,
Expecting_Default, -- Attribute_Or_Text_Or_Comment_Or_CDATA_Or_Object_Start_Or_Object_End
End_State);
function Name (This : Attribute) return String is
(This.My_Name.all);
function Value (This : Attribute) return String is
(This.My_Value.all);
function Name (This : XML_Tag) return String is
(This.My_Name.all);
function Child_Nodes (This : aliased XML_Tag) return Child_Nodes_Ref is
((Element => This.My_Child_Nodes'Access));
function Attributes (This : aliased XML_Tag) return Attributes_Ref is
((Element => This.My_Attributes'Access));
type Argument_Type is limited record
Current_Nodes : Node_Vectors.Vector;
-- The current node is the last Node pointed to in the container
Root_Node : Node_Ptr := null;
State : State_T := Expecting_Object_Start;
end record;
procedure Handle_Start_Tag
(Argument : in out Argument_Type;
Tag_Name : String;
Call_Result : in out Aida.Call_Result) is
begin
case Argument.State is
when Expecting_Object_Start =>
if
Tag_Name'Length > 0 and
Argument.Current_Nodes.Is_Empty
then
declare
Current_Node : constant not null Node_Ptr
:= new Node;
begin
Current_Node.Tag.My_Name
:= new String'(Tag_Name);
Argument.Current_Nodes.Append (Current_Node);
Argument.Root_Node := Current_Node;
end;
Argument.State := Expecting_Default;
else
Call_Result.Initialize (-2132671123, 1966624808);
end if;
when Expecting_Default =>
if Tag_Name'Length > 0 then
declare
Current_Node : constant not null Node_Ptr := new Node;
begin
Current_Node.Tag.My_Name := new String'(Tag_Name);
if
Argument.Current_Nodes.Constant_Reference
(Argument.Current_Nodes.Last_Index).all.Id = Node_Kind_Tag
then
Argument.Current_Nodes.Constant_Reference
(Argument.Current_Nodes.Last_Index).all.Tag.
My_Child_Nodes.Append (Current_Node);
Argument.Current_Nodes.Append (Current_Node);
else
Call_Result.Initialize (1695756105, 1714042669);
end if;
end;
else
Call_Result.Initialize (-0416079960, -1464855808);
end if;
when End_State =>
Call_Result.Initialize (0561631589, 0761077416);
end case;
end Handle_Start_Tag;
procedure Handle_End_Tag
(Argument : in out Argument_Type;
Tag_Name : String;
Call_Result : in out Aida.Call_Result) is
begin
case Argument.State is
when Expecting_Default =>
if not Argument.Current_Nodes.Is_Empty and then
(Argument.Current_Nodes.Constant_Reference
(Argument.Current_Nodes.Last_Index).all.Id = Node_Kind_Tag)
then
if Argument.Current_Nodes.Constant_Reference
(Argument.Current_Nodes.Last_Index).all.Tag.My_Name.all = Tag_Name
then
Argument.Current_Nodes.Delete_Last;
if Argument.Current_Nodes.Is_Empty then
Argument.State := End_State;
end if;
else
Call_Result.Initialize (-0316487383, -2063296151);
end if;
else
Call_Result.Initialize (-1355522791, 1675536860);
end if;
when Expecting_Object_Start | End_State =>
Call_Result.Initialize (-0728861922, -0299445966);
end case;
end Handle_End_Tag;
procedure Handle_Text
(Argument : in out Argument_Type;
Value : String;
Call_Result : in out Aida.Call_Result) is
begin
case Argument.State is
when Expecting_Default =>
if
Value'Length = 0 or
(Value'Length > 0 and then
(for all I in Value'Range =>
Value (I) = ' ' or
Value (I) = Character'Val (10) or
Value (I) = Character'Val (13)))
then
null;
elsif not Argument.Current_Nodes.Is_Empty then
declare
Current_Node : constant not null Node_Ptr
:= new Node (Node_Kind_Text);
begin
Current_Node.all
:= (Id => Node_Kind_Text,
Text => new String'(Value));
if
Argument.Current_Nodes.Constant_Reference
(Argument.Current_Nodes.Last_Index).all.Id = Node_Kind_Tag
then
Argument.Current_Nodes
(Argument.Current_Nodes.Last_Index).all.Tag.
My_Child_Nodes.Append (Current_Node);
else
Call_Result.Initialize (-0944309962, -0212130363);
end if;
end;
else
Call_Result.Initialize (0536156601, 0921613311);
end if;
when Expecting_Object_Start | End_State =>
Call_Result.Initialize (0240750889, 1723362921);
end case;
end Handle_Text;
procedure Handle_Attribute
(Argument : in out Argument_Type;
Attribute_Name : String;
Attribute_Value : String;
Call_Result : in out Aida.Call_Result) is
begin
case Argument.State is
when Expecting_Default =>
if not Argument.Current_Nodes.Is_Empty then
if Attribute_Name'Length > 0 then
declare
Attr : constant not null Attribute_Ptr := new Attribute;
begin
Attr.My_Name
:= new String'(Attribute_Name);
Attr.My_Value
:= new String'(Attribute_Value);
if
Argument.Current_Nodes.Constant_Reference
(Argument.Current_Nodes.Last_Index).all.Id = Node_Kind_Tag
then
Argument.Current_Nodes
(Argument.Current_Nodes.Last_Index).all.Tag.
My_Attributes.Append (Attr);
else
Call_Result.Initialize (0612916249, -0250963769);
end if;
end;
else
Call_Result.Initialize (-1091502024, -1483543078);
end if;
else
Call_Result.Initialize (-0372407662, -1139199208);
end if;
when Expecting_Object_Start | End_State =>
Call_Result.Initialize (1103012185, 0319457400);
end case;
end Handle_Attribute;
procedure Handle_Comment
(Argument : in out Argument_Type;
Value : String;
Call_Result : in out Aida.Call_Result) is
begin
case Argument.State is
when Expecting_Default =>
if not Argument.Current_Nodes.Is_Empty then
if Value'Length > 0 then
declare
Current_Node : constant Node_Ptr
:= new Node (Node_Kind_Comment);
begin
Current_Node.all
:= (Id => Node_Kind_Comment,
Text => new String'(Value));
if
Argument.Current_Nodes.Constant_Reference
(Argument.Current_Nodes.Last_Index).all.Id = Node_Kind_Tag
then
Argument.Current_Nodes.Constant_Reference
(Argument.Current_Nodes.Last_Index).all.Tag.
My_Child_Nodes.Append (Current_Node);
else
Call_Result.Initialize (2066772500, 1193932906);
end if;
end;
else
Call_Result.Initialize (1366102371, 1421674126);
end if;
else
Call_Result.Initialize (0845969060, 0639006566);
end if;
when Expecting_Object_Start |
End_State =>
Call_Result.Initialize (-1373186804, -0874315849);
end case;
end Handle_Comment;
procedure Handle_CDATA
(Argument : in out Argument_Type;
Value : String;
Call_Result : in out Aida.Call_Result) is
begin
case Argument.State is
when Expecting_Default =>
if
not Argument.Current_Nodes.Is_Empty
then
if Value'Length > 0 then
declare
Current_Node : constant Node_Ptr
:= new Node (Node_Kind_CDATA);
begin
Current_Node.all
:= (Id => Node_Kind_CDATA,
Text => new String'(Value));
if
Argument.Current_Nodes.Constant_Reference
(Argument.Current_Nodes.Last_Index).all.Id = Node_Kind_Tag
then
Argument.Current_Nodes.Constant_Reference
(Argument.Current_Nodes.Last_Index).all.Tag.
My_Child_Nodes.Append (Current_Node);
else
Call_Result.Initialize (-2021174626, -1403249390);
end if;
end;
else
Call_Result.Initialize (1915730777, 1973598725);
end if;
else
Call_Result.Initialize (-0076965217, 0193355440);
end if;
when Expecting_Object_Start | End_State =>
Call_Result.Initialize (0698504230, -0963685542);
end case;
end Handle_CDATA;
procedure SAX_Parse is new Aida.XML_SAX_Parse
(Argument_Type,
Handle_Start_Tag,
Handle_End_Tag,
Handle_Text,
Handle_Attribute,
Handle_Comment,
Handle_CDATA);
procedure Parse
(XML_Message : String;
Call_Result : in out Aida.Call_Result;
Root_Node : out Node_Ptr)
is
Argument : Argument_Type;
begin
SAX_Parse (Argument, XML_Message, Call_Result);
Root_Node := Argument.Root_Node;
end Parse;
end Aida.Deepend.XML_DOM_Parser;
|
-- Copyright 2017 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 = "CIRCL"
type = "api"
function start()
setratelimit(2)
end
function vertical(ctx, domain)
apirequest(ctx, domain)
end
function resolved(ctx, domain)
apirequest(ctx, domain)
end
function apirequest(ctx, domain)
if (api == nil or api.username == "" or api.password == "") then
return
end
local page, err = request({
url=buildurl(domain),
headers={['Content-Type']="application/json"},
id=api['username'],
pass=api['password'],
})
if (err ~= nil and err ~= "") then
return
end
for line in page:gmatch("([^\n]*)\n?") do
local j = json.decode(line)
if (j ~= nil and j.rrname ~= "") then
newname(ctx, j.rrname)
if (j.rrtype == "A" or j.rrtype == "AAAA") then
newaddr(ctx, j.rdata, domain)
else
sendnames(ctx, j.rdata)
end
end
end
end
function buildurl(domain)
return "https://www.circl.lu/pdns/query/" .. domain
end
function sendnames(ctx, content)
local names = find(content, subdomainre)
if names == nil then
return
end
for i, v in pairs(names) do
newname(ctx, v)
end
end
|
------------------------------------------------------------------------------
-- --
-- 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_2bits is
new Giza.Bitmaps.Indexed_Bitmaps (Unsigned_2);
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Slim.Message_Visiters;
package body Slim.Messages.ANIC is
List : constant Field_Description_Array :=
(1 => (Uint_8_Field, 1)); -- Flags
----------
-- Read --
----------
overriding function Read
(Data : not null access
League.Stream_Element_Vectors.Stream_Element_Vector)
return ANIC_Message is
begin
return Result : ANIC_Message do
Read_Fields (Result, List, Data.all);
end return;
end Read;
-----------
-- Visit --
-----------
overriding procedure Visit
(Self : not null access ANIC_Message;
Visiter : in out Slim.Message_Visiters.Visiter'Class) is
begin
Visiter.ANIC (Self);
end Visit;
-----------
-- Write --
-----------
overriding procedure Write
(Self : ANIC_Message;
Tag : out Message_Tag;
Data : out League.Stream_Element_Vectors.Stream_Element_Vector) is
begin
Tag := "ANIC";
Write_Fields (Self, List, Data);
end Write;
end Slim.Messages.ANIC;
|
-- C67002B.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 OPERATOR SYMBOLS CAN BE USED IN (OVERLOADED)
-- FUNCTION SPECIFICATIONS WITH THE REQUIRED NUMBER OF PARAMETERS.
-- THIS TEST CHECKS THE CASE OF CERTAIN OPERATOR SYMBOLS.
-- SUBTESTS ARE:
-- (A) THROUGH (E): "AND", "OR", "XOR", "MOD", "REM"
-- RESPECTIVELY. ALL OF THESE HAVE TWO PARAMETERS.
-- (F) AND (G): "NOT" AND "ABS", RESPECTIVELY,
-- WITH ONE PARAMETER.
-- CPP 6/26/84
WITH REPORT;
PROCEDURE C67002B IS
USE REPORT;
BEGIN
TEST ("C67002B", "USE OF OPERATOR SYMBOLS IN " &
"(OVERLOADED) FUNCTION SPECIFICATIONS");
-------------------------------------------------
DECLARE -- (A)
FUNCTION "And" (I1, I2 : INTEGER) RETURN CHARACTER IS
BEGIN
IF I1 > I2 THEN
RETURN 'G';
ELSE RETURN 'L';
END IF;
END "And";
BEGIN -- (A)
IF (IDENT_INT (10) AND 1) /= 'G' OR
(5 AnD 10) /= 'L' THEN
FAILED ("OVERLOADING OF ""And"" OPERATOR DEFECTIVE");
END IF;
END; -- (A)
-------------------------------------------------
DECLARE -- (B)
FUNCTION "or" (I1, I2 : INTEGER) RETURN CHARACTER IS
BEGIN
IF I1 > I2 THEN
RETURN 'G';
ELSE RETURN 'L';
END IF;
END "or";
BEGIN -- (B)
IF (IDENT_INT (10) Or 1) /= 'G' OR
(5 OR 10) /= 'L' THEN
FAILED ("OVERLOADING OF ""or"" OPERATOR DEFECTIVE");
END IF;
END; -- (B)
-------------------------------------------------
DECLARE -- (C)
FUNCTION "xOR" (I1, I2 : INTEGER) RETURN CHARACTER IS
BEGIN
IF I1 > I2 THEN
RETURN 'G';
ELSE RETURN 'L';
END IF;
END "xOR";
BEGIN -- (C)
IF (IDENT_INT (10) XoR 1) /= 'G' OR
(5 xOR 10) /= 'L' THEN
FAILED ("OVERLOADING OF ""xOR"" OPERATOR DEFECTIVE");
END IF;
END; -- (C)
-------------------------------------------------
DECLARE -- (D)
FUNCTION "mOd" (I1, I2 : INTEGER) RETURN CHARACTER IS
BEGIN
IF I1 > I2 THEN
RETURN 'G';
ELSE RETURN 'L';
END IF;
END "mOd";
BEGIN -- (D)
IF (IDENT_INT (10) MoD 1) /= 'G' OR
(5 moD 10) /= 'L' THEN
FAILED ("OVERLOADING OF ""mOd"" OPERATOR DEFECTIVE");
END IF;
END; -- (D)
-------------------------------------------------
DECLARE -- (E)
FUNCTION "REM" (I1, I2 : INTEGER) RETURN CHARACTER IS
BEGIN
IF I1 > I2 THEN
RETURN 'G';
ELSE RETURN 'L';
END IF;
END "REM";
BEGIN -- (E)
IF (IDENT_INT (10) rem 1) /= 'G' OR
(5 Rem 10) /= 'L' THEN
FAILED ("OVERLOADING OF ""REM"" OPERATOR DEFECTIVE");
END IF;
END; -- (E)
-------------------------------------------------
DECLARE -- (F)
FUNCTION "NOT" (I1 : INTEGER) RETURN CHARACTER IS
BEGIN
IF I1 < IDENT_INT (0) THEN
RETURN 'N';
ELSE RETURN 'P';
END IF;
END "NOT";
BEGIN -- (F)
IF (Not IDENT_INT(25) /= 'P') OR
(noT (0-25) /= 'N') THEN
FAILED ("OVERLOADING OF ""NOT"" " &
"OPERATOR (ONE OPERAND) DEFECTIVE");
END IF;
END; -- (F)
-------------------------------------------------
DECLARE -- (G)
FUNCTION "ABS" (I1 : INTEGER) RETURN CHARACTER IS
BEGIN
IF I1 < IDENT_INT (0) THEN
RETURN 'N';
ELSE RETURN 'P';
END IF;
END "ABS";
BEGIN -- (G)
IF (abs IDENT_INT(25) /= 'P') OR
(Abs (0-25) /= 'N') THEN
FAILED ("OVERLOADING OF ""ABS"" " &
"OPERATOR (ONE OPERAND) DEFECTIVE");
END IF;
END; -- (T)
-------------------------------------------------
RESULT;
END C67002B;
|
-----------------------------------------------------------------------
-- streams.files.tests -- Unit tests for buffered streams
-- Copyright (C) 2010, 2011, 2017, 2019 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.Test_Caller;
with Util.Files;
with Util.Streams.Texts;
package body Util.Streams.Files.Tests is
use Util.Tests;
use Ada.Streams.Stream_IO;
package Caller is new Util.Test_Caller (Test, "Streams.Files");
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite) is
begin
Caller.Add_Test (Suite, "Test Util.Streams.Files.Create, Write, Flush, Close",
Test_Read_Write'Access);
Caller.Add_Test (Suite, "Test Util.Streams.Files.Write, Flush",
Test_Write'Access);
end Add_Tests;
-- ------------------------------
-- Test reading and writing on a buffered stream with various buffer sizes
-- ------------------------------
procedure Test_Read_Write (T : in out Test) is
Stream : aliased File_Stream;
Buffer : Util.Streams.Texts.Print_Stream;
begin
for I in 1 .. 32 loop
Buffer.Initialize (Output => Stream'Access,
Size => I);
Stream.Create (Mode => Out_File, Name => "test-stream.txt");
Buffer.Write ("abcd");
Buffer.Write (" fghij");
Buffer.Flush;
Stream.Close;
declare
Content : Ada.Strings.Unbounded.Unbounded_String;
begin
Util.Files.Read_File (Path => "test-stream.txt",
Into => Content,
Max_Size => 10000);
Assert_Equals (T, "abcd fghij", Content, "Invalid content written to the file stream");
end;
end loop;
end Test_Read_Write;
procedure Test_Write (T : in out Test) is
begin
null;
end Test_Write;
end Util.Streams.Files.Tests;
|
package body Collisions is
function Collide(A, B : not null EntityClassAcc; Col : out Collision) return Boolean
is
begin
Col.A := A; Col.B := B;
return Dispatcher(A.all.EntityType, B.all.EntityType).all(Col);
end Collide;
function CircleOnCircle(Col : in out Collision) return Boolean
is
NormalVec : Vec2D;
TotRadius : Float;
Distance : Float;
A, B : Circles.CircleAcc;
begin
A := Circles.CircleAcc(Col.A);
B := Circles.CircleAcc(Col.B);
NormalVec := B.all.Coords - A.all.Coords;
TotRadius := A.all.Radius + B.all.Radius;
if MagSq(NormalVec) > (TotRadius * TotRadius) then
return False; -- Not colliding
end if;
Distance := Mag(NormalVec);
if Distance /= 0.0 then
Col.Penetration := TotRadius - Distance;
Col.Normal := NormalVec / Distance;
else
Col.Penetration := A.all.Radius;
Col.Normal := Vec2D'(1.0, 0.0);
end if;
return True;
end CircleOnCircle;
function RectangleOnRectangle(Col : in out Collision) return Boolean
is
Normal : Vec2D;
AMid, BMid : Float;
xOverlap, yOverlap : Float;
A, B : Rectangles.RectangleAcc;
begin
A := Rectangles.RectangleAcc(Col.A);
B := Rectangles.RectangleAcc(Col.B);
Normal := B.all.GetCenter - A.all.GetCenter;
AMid := A.all.GetWidth / 2.0;
BMid := B.all.GetWidth / 2.0;
xOverlap := AMid + BMid - (abs Normal.x);
if xOverlap > 0.0 then
AMid := A.all.GetHeight / 2.0;
BMid := B.all.GetHeight / 2.0;
yOverlap := AMid + BMid - (abs Normal.y);
if yOverlap > 0.0 then
if xOverlap < yOverlap then
Col.Normal :=
(
if Normal.x < 0.0 then Vec2D'(-1.0, 0.0) else Vec2D'(1.0, 0.0)
);
Col.Penetration := xOverlap;
else
Col.Normal :=
(
if Normal.y < 0.0 then Vec2D'(0.0, -1.0) else Vec2D'(0.0, 1.0)
);
Col.Penetration := yOverlap;
end if;
return True;
end if;
end if;
return False;
end RectangleOnRectangle;
function CircleOnRectangle(Col : in out Collision) return Boolean
is
Result : Boolean;
Temp : EntityClassAcc;
begin
Temp := Col.A;
Col.A := Col.B;
Col.B := Temp;
Result := RectangleOnCircle(Col);
return Result;
end CircleOnRectangle;
function RectangleOnCircle(Col : in out Collision) return Boolean
is
AtoB : Vec2D;
Normal : Vec2D;
Closest : Vec2D;
xExt, yExt : Float;
Distance : Float;
Inside : Boolean := False;
Radius : Float;
A : Rectangles.RectangleAcc;
B : Circles.CircleAcc;
begin
A := Rectangles.RectangleAcc(Col.A);
B := Circles.CircleAcc(Col.B);
AtoB := B.all.Coords - A.all.GetCenter;
xExt := A.all.GetWidth / 2.0;
yExt := A.all.GetHeight / 2.0;
Closest.x := Clamp(AtoB.x, -xExt, xExt);
Closest.y := Clamp(AtoB.y, -yExt, yExt);
-- special case of circle inside rectangle
if AtoB = Closest then
Inside := True;
if (abs AtoB.x) < (abs AtoB.y) then
Closest.x := (if AtoB.x > 0.0 then xExt else -xExt);
else
Closest.y := (if AtoB.y > 0.0 then yExt else -yExt);
end if;
end if;
Normal := AtoB - Closest;
Distance := MagSq(Normal);
Radius := B.all.Radius;
-- circle not inside of the rectangle
if Distance > Radius * Radius and not Inside then
return False;
end if;
Distance := Mag(Normal);
Col.Penetration := Radius - Distance;
if Inside then
Col.Normal := -Normal / Distance;
else
Col.Normal := Normal / Distance;
end if;
return True;
end RectangleOnCircle;
procedure Resolve(Col : in Collision) is
RelVel : Vec2D;
VelNormal : Float;
FinRestitution : Float;
ImpulseScalar : Float;
Impulse : Vec2D;
A : constant EntityClassAcc := Col.A;
B : constant EntityClassAcc := Col.B;
MuS : Float;
begin
-- Ignore collision between static objects
if A.InvMass + B.InvMass = 0.0 then
A.Velocity := Vec2D'(0.0, 0.0);
B.Velocity := Vec2D'(0.0, 0.0);
return;
end if;
RelVel := B.Velocity - A.Velocity;
VelNormal := RelVel * Col.Normal;
-- objects are moving toward each other
if VelNormal < 0.0 then
FinRestitution := Float'Min(A.Mat.Restitution, B.Mat.Restitution);
ImpulseScalar := -(1.0 + FinRestitution) * VelNormal;
ImpulseScalar := ImpulseScalar / (A.InvMass + B.InvMass);
Impulse := ImpulseScalar * Col.Normal;
A.Velocity := A.Velocity - (A.InvMass * Impulse);
B.Velocity := B.Velocity + (B.InvMass * Impulse);
-- Compute friction
MuS := Friction(A.Mat.StaticFriction, B.Mat.StaticFriction);
if MuS /= 0.0 then
declare
Tangent : Vec2D;
FrictionImpulse : Vec2D;
ImpulseScalarTan : Float;
MuC : Float;
begin
RelVel := B.Velocity - A.Velocity;
Tangent := RelVel - (RelVel * Col.Normal) * Col.Normal;
Tangent := Normalize(Tangent);
ImpulseScalarTan := -(RelVel * Tangent);
ImpulseScalarTan := ImpulseScalarTan / (A.InvMass + B.InvMass);
if (abs ImpulseScalarTan) < (MuS * ImpulseScalar) then
FrictionImpulse := ImpulseScalarTan * Tangent;
else
MuC := Friction(A.Mat.DynamicFriction, B.Mat.DynamicFriction);
FrictionImpulse := -ImpulseScalar * Tangent * MuC;
end if;
A.Velocity := A.Velocity - (A.InvMass * FrictionImpulse);
B.Velocity := B.Velocity + (B.InvMass * FrictionImpulse);
end;
end if;
end if;
end Resolve;
function Friction(A, B : Float) return Float is
begin
return Float'Min(A, B);
end;
procedure PosCorrection(Col : in Collision) is
PosPerCorrection : constant Float := 1.0;
Slop : constant Float := 0.01;
Correction : Vec2D;
ScCo : Float;
A : constant EntityClassAcc := Col.A;
B : constant EntityClassAcc := Col.B;
begin
if A.InvMass + B.InvMass /= 0.0 then
ScCo := Float'Max(Col.Penetration - Slop, 0.0) / (A.InvMass + B.InvMass);
Correction := ScCo * PosPerCorrection * Col.Normal;
A.Velocity := A.Velocity - (A.InvMass * Correction);
B.Velocity := B.Velocity + (B.InvMass * Correction);
end if;
end PosCorrection;
-- for rectangle / rectangle it is accurate
-- for circle / rectangle, approximation of the area of the overlap for this collision
-- for circle / circle, approximation
-- Used for Archimede's force
function OverlapArea(Col : in Collision) return Float
is
begin
if Col.A.EntityType = EntCircle and Col.B.EntityType = EntCircle then
return OverlapAreaCircleCircle(Circles.CircleAcc(Col.A), Circles.CircleAcc(Col.B));
end if;
if Col.A.EntityType = EntRectangle and Col.B.EntityType = EntRectangle then
return OverlapAreaRectangleRectangle(Col.A.Coords, Rectangles.RectangleAcc(Col.A).Dim,
Col.B.Coords, Rectangles.RectangleAcc(Col.B).Dim);
end if;
if Col.A.EntityType = EntRectangle and Col.B.EntityType = EntCircle then
return OverlapAreaCircleRectangle(Circles.CircleAcc(Col.B), Rectangles.RectangleAcc(Col.A));
end if;
if Col.A.EntityType = EntCircle and Col.B.EntityType = EntRectangle then
return OverlapAreaCircleRectangle(Circles.CircleAcc(Col.A), Rectangles.RectangleAcc(Col.B));
end if;
return 0.0;
end OverlapArea;
function IsInside(Pos : Vec2D; Ent : not null EntityClassAcc) return Boolean
is
begin
if Ent.EntityType = EntRectangle then
declare
Rect : constant Rectangles.RectangleAcc := Rectangles.RectangleAcc(Ent);
begin
return Pos.x >= Rect.Coords.x and Pos.x <= Rect.Coords.x + Rect.Dim.x
and Pos.y >= Rect.Coords.y and Pos.y <= Rect.Coords.y + Rect.Dim.y;
end;
elsif Ent.EntityType = EntCircle then
declare
Circ : constant Circles.CircleAcc := Circles.CircleAcc(Ent);
begin
return MagSq(Pos - Circ.Coords) <= Circ.Radius * Circ.Radius;
end;
end if;
return False;
end IsInside;
-- A fast approximation of collision detection. Usefull for when precision is not important
function CollideEx(A, B : not null EntityClassAcc) return Boolean
is
Col : constant Collision := (A, B, (0.0, 0.0), 0.0);
begin
return (OverlapArea(Col) /= 0.0);
end CollideEx;
-- http://jsfiddle.net/Lqh3mjr5/
function OverlapAreaRectangleRectangle(PosA, DimA, PosB, DimB : Vec2D) return Float
is
d1x : constant Float := PosA.x;
d1y : constant Float := PosA.y;
d1xMax : constant Float := d1x + DimA.x;
d1yMax : constant Float := d1y + DimA.y;
d2x : constant Float := PosB.x;
d2y : constant Float := PosB.y;
d2xMax : constant Float := d2x + DimB.x;
d2yMax : constant Float := d2y + DimB.y;
xOverlap : constant Float := Float'Max(0.0, Float'Min(d1xMax, d2xMax) - Float'Max(d1x, d2x));
yOverlap : constant Float := Float'Max(0.0, Float'Min(d1yMax, d2yMax) - Float'Max(d1y, d2y));
begin
return xOverlap * yOverlap;
end OverlapAreaRectangleRectangle;
function OverlapAreaCircleCircle(A, B : Circles.CircleAcc) return Float
is
CheatConst : constant Float := 0.84 * 0.84; -- AreaSquare - AreaCircle = 0.84
PosA : constant Vec2D := A.Coords - (A.Radius, A.Radius);
DimA : constant Vec2D := 2.0 * (A.Radius, A.Radius);
PosB : constant Vec2D := B.Coords - (B.Radius, B.Radius);
DimB : constant Vec2D := 2.0 * (B.Radius, B.Radius);
begin
return CheatConst * OverlapAreaRectangleRectangle(PosA, DimA, PosB, DimB);
end OverlapAreaCircleCircle;
function OverlapAreaCircleRectangle(A : Circles.CircleAcc; B : Rectangles.RectangleAcc) return Float
is
CheatConst : constant Float := 0.84; -- AreaSquare - AreaCircle = 0.84
PosA : constant Vec2D := A.Coords - (A.Radius, A.Radius);
DimA : constant Vec2D := 2.0 * (A.Radius, A.Radius);
begin
return CheatConst * OverlapAreaRectangleRectangle(PosA, DimA, B.Coords, B.Dim);
end OverlapAreaCircleRectangle;
-- with Ada.Numerics.Generic_Elementary_Functions;
-- function OverlapAreaCircleRectangle(Radius, Height : Float) return Float
-- is
-- package TrigoFuncs is new Ada.Numerics.Generic_Elementary_Functions(Float);
-- use TrigoFuncs;
-- Param : constant Float := Clamp((1.0 - (Height / Radius)), -1.0, 1.0);
-- Alpha : constant Float := 2.0 * Arccos(Param);
-- Area : constant Float := 0.5 * Radius * Radius * (Alpha - Sin(Alpha));
-- begin
-- return Area;
-- end OverlapAreaCircleRectangle;
end Collisions;
|
--------------------------------------------------------------------------------
-- --
-- Copyright (C) 2004, RISC OS Ada Library (RASCAL) developers. --
-- --
-- This library is free software; you can redistribute it and/or --
-- modify it under the terms of the GNU Lesser General Public --
-- License as published by the Free Software Foundation; either --
-- version 2.1 of the License, or (at your option) any later version. --
-- --
-- This library is distributed in the hope that it will be useful, --
-- but WITHOUT ANY WARRANTY; without even the implied warranty of --
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU --
-- Lesser General Public License for more details. --
-- --
-- You should have received a copy of the GNU Lesser General Public --
-- License along with this library; if not, write to the Free Software --
-- Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA --
-- --
--------------------------------------------------------------------------------
-- $Author$
-- $Date$
-- $Revision$
with Kernel; use Kernel;
with Interfaces.C; use Interfaces.C;
with Ada.Strings.Unbounded;
with Reporter;
with RASCAL.Memory; use RASCAL.Memory;
with RASCAL.Utility; use RASCAL.Utility;
with RASCAL.ToolboxWindow; use RASCAL.ToolboxWindow;
with RASCAL.OS;
package body RASCAL.ToolboxWritableField is
Toolbox_ObjectMiscOp : constant Interfaces.C.unsigned :=16#44EC6#;
--
function Get_Value (Window : in Object_ID;
Component : in Component_ID;
Flags : in System.Unsigned_Types.unsigned := 0) return String is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
Buffer_Size : integer := 0;
begin
Register.R(0) := int(Unsigned_to_Int(Flags));
Register.R(1) := int(Window);
Register.R(2) := 513;
Register.R(3) := int(Component);
Register.R(4) := 0;
Register.R(5) := 0;
Error := Kernel.swi(Toolbox_ObjectMiscOp,Register'Access,Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWritableField.Get_Value: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
return "";
end if;
Buffer_Size := integer(Register.R(5));
declare
Buffer : String(1..Buffer_Size + 1);
begin
Register.R(0) := int(Unsigned_to_Int(Flags));
Register.R(1) := int(Window);
Register.R(2) := 513;
Register.R(3) := int(Component);
Register.R(4) := Adr_To_Int(Buffer'Address);
Register.R(5) := int(Buffer_Size + 1);
Error := Kernel.swi(Toolbox_ObjectMiscOp,Register'Access,Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWritableField.Get_Value: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
return MemoryToString(Buffer'Address);
end;
end Get_Value;
--
procedure Set_Allowable (Window : in Object_ID;
Component : in Component_ID;
Allowable : in string;
Flags : in System.Unsigned_Types.Unsigned := 0) is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
Allowable_0 : string := Allowable & ASCII.NUL;
begin
Register.R(0) := int(Unsigned_to_Int(Flags));
Register.R(1) := int(Window);
Register.R(2) := 514;
Register.R(3) := int(Component);
Register.R(4) := Adr_To_Int(Allowable_0'Address);
Error := Kernel.swi(Toolbox_ObjectMiscOp,Register'Access,Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWritableField.Set_Allowable: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
end Set_Allowable;
--
procedure Set_Font (Window : in Object_ID;
Component : in Component_ID;
Font : in String;
Font_Width : in integer := 12;
Font_Height : in integer := 12;
Flags : in System.Unsigned_Types.Unsigned := 0) is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
Font_0 : String := Font & ASCII.NUL;
begin
Register.R(0) := int(Unsigned_to_Int(Flags));
Register.R(1) := int(Window);
Register.R(2) := 516;
Register.R(3) := int(Component);
Register.R(4) := Adr_To_Int(Font_0'Address);
Register.R(5) := int(Font_Width);
Register.R(6) := int(Font_Height);
Error := Kernel.swi(Toolbox_ObjectMiscOp,Register'Access,Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWritableField.Set_Font: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
end Set_Font;
--
procedure Set_Value (Window : in Object_ID;
Component : in Component_ID;
New_Value : in string;
Flags : in System.Unsigned_Types.Unsigned := 0) is
Register : aliased Kernel.swi_regs;
Error : oserror_access;
Value_0 : UString := U(New_Value & ASCII.NUL);
Buffer_Size : Integer := (Gadget_Get_BufferSize(Window,Component))-1;
begin
if Buffer_Size > -1 then
if New_Value'Length > Buffer_Size then
Value_0 := Ada.Strings.Unbounded.Head(Value_0,Buffer_Size);
Ada.Strings.Unbounded.Append(Value_0,ASCII.NUL);
end if;
Register.R(0) := int(Unsigned_to_Int(Flags));
Register.R(1) := int(Window);
Register.R(2) := 512;
Register.R(3) := int(Component);
Register.R(4) := Adr_To_Int(S(Value_0)'Address);
Error := Kernel.swi(Toolbox_ObjectMiscOp,Register'Access,Register'Access);
if Error /= null then
pragma Debug(Reporter.Report("ToolboxWritableField.Set_Value: " & To_Ada(Error.ErrMess)));
OS.Raise_Error(Error);
end if;
end if;
end Set_Value;
--
end RASCAL.ToolboxWritableField;
|
with
Ada.Finalization;
private with
Interfaces.C,
System;
package FLTK is
-- Ugly implementation detail, never use this.
-- This is necessary so things like Text_Buffers and
-- Widgets can talk to each other behind the binding.
type Wrapper is new Ada.Finalization.Limited_Controlled with private;
-- with Type_Invariant => Is_Valid (Wrapper);
function Is_Valid
(Object : in Wrapper)
return Boolean;
type Color is new Natural;
type Color_Component is mod 256;
No_Color : constant Color;
type Alignment is private;
Align_Center : constant Alignment;
Align_Top : constant Alignment;
Align_Bottom : constant Alignment;
Align_Left : constant Alignment;
Align_Right : constant Alignment;
type Keypress is private;
subtype Pressable_Key is Character range Character'Val (32) .. Character'Val (126);
function Press (Key : in Pressable_Key) return Keypress;
Enter_Key : constant Keypress;
Keypad_Enter_Key : constant Keypress;
Backspace_Key : constant Keypress;
Insert_Key : constant Keypress;
Delete_Key : constant Keypress;
Home_Key : constant Keypress;
End_Key : constant Keypress;
Page_Down_Key : constant Keypress;
Page_Up_Key : constant Keypress;
Down_Key : constant Keypress;
Left_Key : constant Keypress;
Right_Key : constant Keypress;
Up_Key : constant Keypress;
Escape_Key : constant Keypress;
type Mouse_Button is (No_Button, Left_Button, Middle_Button, Right_Button);
type Key_Combo is private;
function Press (Key : in Pressable_Key) return Key_Combo;
function Press (Key : in Keypress) return Key_Combo;
function Press (Key : in Mouse_Button) return Key_Combo;
No_Key : constant Key_Combo;
type Modifier is private;
function "+" (Left, Right : in Modifier) return Modifier;
function "+" (Left : in Modifier; Right : in Pressable_Key) return Key_Combo;
function "+" (Left : in Modifier; Right : in Keypress) return Key_Combo;
function "+" (Left : in Modifier; Right : in Mouse_Button) return Key_Combo;
function "+" (Left : in Modifier; Right : in Key_Combo) return Key_Combo;
Mod_None : constant Modifier;
Mod_Shift : constant Modifier;
Mod_Ctrl : constant Modifier;
Mod_Alt : constant Modifier;
type Box_Kind is
(No_Box,
Flat_Box,
Up_Box,
Down_Box,
Up_Frame,
Down_Frame,
Thin_Up_Box,
Thin_Down_Box,
Thin_Up_Frame,
Thin_Down_Frame,
Engraved_Box,
Embossed_Box,
Engraved_Frame,
Embossed_Frame,
Border_Box,
Shadow_Box,
Border_Frame,
Shadow_Frame,
Rounded_Box,
RShadow_Box,
Rounded_Frame,
RFlat_Box,
Round_Up_Box,
Round_Down_Box,
Diamond_Up_Box,
Diamond_Down_Box,
Oval_Box,
OShadow_Box,
Oval_Frame,
OFlat_Box,
Plastic_Up_Box,
Plastic_Down_Box,
Plastic_Up_Frame,
Plastic_Down_Frame,
Plastic_Thin_Up_Box,
Plastic_Thin_Down_Box,
Plastic_Round_Up_Box,
Plastic_Round_Down_Box,
Gtk_Up_Box,
Gtk_Down_Box,
Gtk_Up_Frame,
Gtk_Down_Frame,
Gtk_Thin_Up_Box,
Gtk_Thin_Down_Box,
Gtk_Thin_Up_Frame,
Gtk_Thin_Down_Frame,
Gtk_Round_Up_Box,
Gtk_Round_Down_Box,
Gleam_Up_Box,
Gleam_Down_Box,
Gleam_Up_Frame,
Gleam_Down_Frame,
Gleam_Thin_Up_Box,
Gleam_Thin_Down_Box,
Gleam_Round_Up_Box,
Gleam_Round_Down_Box,
Free_Box);
type Font_Kind is
(Helvetica,
Helvetica_Bold,
Helvetica_Italic,
Helvetica_Bold_Italic,
Courier,
Courier_Bold,
Courier_Italic,
Courier_Bold_Italic,
Times,
Times_Bold,
Times_Italic,
Times_Bold_Italic,
Symbol,
Monospace,
Monospace_Bold,
Zapf_Dingbats,
Free_Font);
type Font_Size is new Natural;
Normal_Size : constant Font_Size := 14;
type Font_Size_Array is array (Positive range <>) of Font_Size;
type Label_Kind is
(Normal_Label,
No_Label,
Shadow_Label,
Engraved_Label,
Embossed_Label,
Multi_Label,
Icon_Label,
Image_Label,
Free_Label);
type Event_Kind is
(No_Event,
Push,
Release,
Enter,
Leave,
Drag,
Focus,
Unfocus,
Keydown,
Keyup,
Close,
Move,
Shortcut,
Deactivate,
Activate,
Hide,
Show,
Paste,
Selection_Clear,
Mouse_Wheel,
DnD_Enter,
DnD_Drag,
DnD_Leave,
DnD_Release,
Screen_Config_Changed,
Fullscreen);
type Event_Outcome is (Not_Handled, Handled);
type Menu_Flag is private;
function "+" (Left, Right : in Menu_Flag) return Menu_Flag;
Flag_Normal : constant Menu_Flag;
Flag_Inactive : constant Menu_Flag;
Flag_Toggle : constant Menu_Flag;
Flag_Value : constant Menu_Flag;
Flag_Radio : constant Menu_Flag;
Flag_Invisible : constant Menu_Flag;
Flag_Submenu : constant Menu_Flag;
Flag_Divider : constant Menu_Flag;
type Version_Number is new Natural;
function ABI_Check
(ABI_Ver : in Version_Number)
return Boolean;
function ABI_Version
return Version_Number;
function API_Version
return Version_Number;
function Version
return Version_Number;
procedure Awake;
procedure Lock;
procedure Unlock;
function Is_Damaged
return Boolean;
procedure Set_Damaged
(To : in Boolean);
procedure Flush;
procedure Redraw;
function Check
return Boolean;
function Ready
return Boolean;
function Wait
return Integer;
function Wait
(Seconds : in Long_Float)
return Integer;
function Run
return Integer;
private
pragma Linker_Options ("-lfltk");
pragma Linker_Options ("-lfltk_images");
type Wrapper is new Ada.Finalization.Limited_Controlled with
record
Void_Ptr : System.Address;
Needs_Dealloc : Boolean := True;
end record;
overriding procedure Initialize
(This : in out Wrapper);
No_Color : constant Color := 0;
type Alignment is new Interfaces.Unsigned_16;
Align_Center : constant Alignment := 0;
Align_Top : constant Alignment := 1;
Align_Bottom : constant Alignment := 2;
Align_Left : constant Alignment := 4;
Align_Right : constant Alignment := 8;
type Keypress is new Interfaces.Unsigned_16;
type Modifier is new Interfaces.Unsigned_16;
type Key_Combo is
record
Modcode : Modifier;
Keycode : Keypress;
Mousecode : Mouse_Button;
end record;
function To_C
(Key : in Key_Combo)
return Interfaces.C.unsigned_long;
function To_Ada
(Key : in Interfaces.C.unsigned_long)
return Key_Combo;
function To_C
(Key : in Keypress)
return Interfaces.C.unsigned_long;
function To_Ada
(Key : in Interfaces.C.unsigned_long)
return Keypress;
function To_C
(Modi : in Modifier)
return Interfaces.C.unsigned_long;
function To_Ada
(Modi : in Interfaces.C.unsigned_long)
return Modifier;
function To_C
(Button : in Mouse_Button)
return Interfaces.C.unsigned_long;
function To_Ada
(Button : in Interfaces.C.unsigned_long)
return Mouse_Button;
-- these values designed to align with FLTK enumeration types
Mod_None : constant Modifier := 2#00000000#;
Mod_Shift : constant Modifier := 2#00000001#;
Mod_Ctrl : constant Modifier := 2#00000100#;
Mod_Alt : constant Modifier := 2#00001000#;
No_Key : constant Key_Combo := (Modcode => Mod_None, Keycode => 0, Mousecode => No_Button);
-- these values correspond to constants defined in FLTK Enumerations.H
Enter_Key : constant Keypress := 16#ff0d#;
Keypad_Enter_Key : constant Keypress := 16#ff8d#;
Backspace_Key : constant Keypress := 16#ff08#;
Insert_Key : constant Keypress := 16#ff63#;
Delete_Key : constant Keypress := 16#ffff#;
Home_Key : constant Keypress := 16#ff50#;
End_Key : constant Keypress := 16#ff57#;
Page_Down_Key : constant Keypress := 16#ff56#;
Page_Up_Key : constant Keypress := 16#ff55#;
Down_Key : constant Keypress := 16#ff54#;
Left_Key : constant Keypress := 16#ff51#;
Right_Key : constant Keypress := 16#ff53#;
Up_Key : constant Keypress := 16#ff52#;
Escape_Key : constant Keypress := 16#ff1b#;
type Menu_Flag is new Interfaces.Unsigned_8;
Flag_Normal : constant Menu_Flag := 2#00000000#;
Flag_Inactive : constant Menu_Flag := 2#00000001#;
Flag_Toggle : constant Menu_Flag := 2#00000010#;
Flag_Value : constant Menu_Flag := 2#00000100#;
Flag_Radio : constant Menu_Flag := 2#00001000#;
Flag_Invisible : constant Menu_Flag := 2#00010000#;
-- Flag_Submenu_Pointer unlikely to be used
Flag_Submenu : constant Menu_Flag := 2#01000000#;
Flag_Divider : constant Menu_Flag := 2#10000000#;
pragma Import (C, Awake, "fl_awake");
pragma Import (C, Lock, "fl_lock");
pragma Import (C, Unlock, "fl_unlock");
pragma Import (C, Flush, "fl_flush");
pragma Import (C, Redraw, "fl_redraw");
pragma Inline (ABI_Check);
pragma Inline (ABI_Version);
pragma Inline (API_Version);
pragma Inline (Version);
pragma Inline (Awake);
pragma Inline (Lock);
pragma Inline (Unlock);
pragma Inline (Is_Damaged);
pragma Inline (Set_Damaged);
pragma Inline (Flush);
pragma Inline (Redraw);
pragma Inline (Check);
pragma Inline (Ready);
pragma Inline (Wait);
pragma Inline (Run);
end FLTK;
|
-- CE3804M.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 GET WILL RAISE DATA_ERROR IF THE USE OF # AND :
-- IN BASED LITERALS IS MIXED.
-- APPLICABILITY CRITERIA:
-- THIS TEST IS APPLICABLE ONLY TO IMPLEMENTATIONS WHICH
-- SUPPORT TEXT FILES.
-- HISTORY:
-- VKG 02/07/83
-- JBG 03/30/84
-- RJW 11/04/86 REVISED TEST TO OUTPUT A NON_APPLICABLE
-- RESULT WHEN FILES ARE NOT SUPPORTED.
-- DWC 09/14/87 SPLIT CASE FOR FIXED_IO INTO CE3804N.ADA AND
-- CORRECTED EXCEPTION HANDLING.
WITH TEXT_IO; USE TEXT_IO;
WITH REPORT; USE REPORT;
PROCEDURE CE3804M IS
INCOMPLETE : EXCEPTION;
BEGIN
TEST ("CE3804M", "CHECK THAT FLOAT_IO GET WILL RAISE " &
"DATA_ERROR IF THE USE OF # AND : IN " &
"BASED LITERALS IS MIXED");
DECLARE
FT : FILE_TYPE;
BEGIN
BEGIN
CREATE (FT, OUT_FILE, LEGAL_FILE_NAME);
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("USE_ERROR RAISED; TEXT " &
"CREATE WITH OUT_FILE MODE");
RAISE INCOMPLETE;
WHEN NAME_ERROR =>
NOT_APPLICABLE ("NAME_ERROR RAISED; TEXT " &
"CREATE WITH OUT_FILE MODE");
RAISE INCOMPLETE;
END;
PUT_LINE (FT, "2#1.1#E+2"); -- 2#1.1#E+2
PUT_LINE (FT, "8:1.1:E-2"); -- 8:1.1:E-2
PUT (FT, "2#1.1:E+1"); -- 2#1.1:E+1
NEW_LINE (FT);
PUT (FT, "4:2.23#E+2"); -- 4:2.23#E+2
NEW_LINE (FT);
PUT (FT, "2#1.0#E+1"); -- 2#1.0#E+1
NEW_LINE (FT);
CLOSE (FT);
DECLARE
PACKAGE FL_IO IS NEW FLOAT_IO(FLOAT);
USE FL_IO;
X : FLOAT := 1.00E+10;
BEGIN
BEGIN
OPEN (FT, IN_FILE, LEGAL_FILE_NAME);
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("USE_ERROR RAISED; TEXT " &
"OPEN WITH IN_FILE MODE");
RAISE INCOMPLETE;
END;
GET (FT, X);
IF X /= 2#1.1#E+2 THEN
FAILED ("DID NOT GET RIGHT VALUE - 1");
END IF;
GET (FT, X);
IF X /= 8#1.1#E-2 THEN
FAILED ("DID NOT GET RIGHT VALUE - 2");
END IF;
BEGIN
X := 1.0E+10;
GET (FT,X);
FAILED ("DATA_ERROR NOT RAISED - 1");
EXCEPTION
WHEN DATA_ERROR =>
IF X /= 1.00E+10 THEN
FAILED ("ACTUAL PARAMETER TO GET " &
"AFFECTED ON DATA_ERROR - 1");
END IF;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - 1");
END;
SKIP_LINE (FT);
BEGIN
GET (FT,X);
FAILED ("DATA_ERROR NOT RAISED - 2");
EXCEPTION
WHEN DATA_ERROR =>
IF X /= 1.00E+10 THEN
FAILED ("ACTUAL PARAMETER TO GET " &
"AFFECTED ON DATA_ERROR - 2");
END IF;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - 2");
END;
SKIP_LINE (FT);
GET (FT, X);
IF X /= 2#1.0#E+1 THEN
FAILED ("DID NOT GET RIGHT VALUE - 3");
END IF;
BEGIN
DELETE (FT);
EXCEPTION
WHEN USE_ERROR =>
NULL;
END;
END;
EXCEPTION
WHEN INCOMPLETE =>
NULL;
END;
RESULT;
END CE3804M;
|
-- BSD 3-Clause License
--
-- Copyright (c) 2017, 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 copyright holder nor the names of its
-- contributors may be used to endorse or promote products derived from
-- this software without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
-- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
-- THE POSSIBILITY OF SUCH DAMAGE.
with GNAT.OS_Lib;
with League.Calendars;
with League.Strings;
with League.String_Vectors;
with CvsWeb.Loaders;
package CvsWeb.Pushers is
type Pusher is tagged limited private;
procedure Initialize
(Self : in out Pusher;
Path : League.Strings.Universal_String);
procedure Push
(Self : in out Pusher;
Loader : in out CvsWeb.Loaders.Loader;
Skip : League.Calendars.Date_Time);
private
type Pusher is tagged limited record
Path : League.Strings.Universal_String;
Git : GNAT.OS_Lib.String_Access;
end record;
not overriding procedure Git_Add
(Self : Pusher;
File : League.Strings.Universal_String);
not overriding procedure Git_Commit
(Self : Pusher;
Date : League.Calendars.Date_Time;
Message : League.Strings.Universal_String;
List : League.String_Vectors.Universal_String_Vector);
not overriding procedure Exec
(Self : Pusher;
List : in out GNAT.OS_Lib.Argument_List);
end CvsWeb.Pushers;
|
with GNAT.Command_Line; use GNAT.Command_Line;
with GNAT.Strings; use GNAT.Strings;
package body Command_Line is
function Parse_Command_Line
(Input_Files : out Input_File_Vectors.Vector;
Recurse_Projects : out Boolean;
Directory_Prefix : out SU.Unbounded_String;
Output_File : out SU.Unbounded_String)
return Boolean
is
Config : Command_Line_Configuration;
Output : aliased String_Access := null;
No_Project_Recurse : aliased Boolean;
Prefix : aliased String_Access := null;
begin
Initialize_Option_Scan;
Define_Switch(Config, "-h", "--help", "Display help");
Define_Switch(Config, Output'Access, "-o:", "--output=", "The output GraphML file");
Define_Switch(Config, No_Project_Recurse'Access, "", "--no-project-recurse", "Do not recurse projects");
Define_Switch(Config, Prefix'Access, "-p:", "--prefix=", "Directory prefix stripped from the file names in the output graph");
Getopt(Config);
Output_File := (if Output.all'Length = 0 then SU.Null_Unbounded_String else SU.To_Unbounded_String(Output.all));
Free(Output);
Directory_Prefix := (if Prefix.all'Length = 0 then SU.Null_Unbounded_String else SU.To_Unbounded_String(Prefix.all));
Free(Prefix);
Recurse_Projects := not No_Project_Recurse;
Input_File_Vectors.Clear(Input_Files);
loop
declare
Input : constant String := GNAT.Command_Line.Get_Argument;
begin
exit when Input'Length = 0;
Input_Files.Append(SU.To_Unbounded_String(Input));
end;
end loop;
return True;
exception
when others =>
return False;
end Parse_Command_Line;
end Command_Line;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- M D L L --
-- --
-- S p e c --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package provides the core high level routines used by GNATDLL
-- to build Windows DLL
with GNAT.OS_Lib;
package MDLL is
subtype Argument_List is GNAT.OS_Lib.Argument_List;
subtype Argument_List_Access is GNAT.OS_Lib.Argument_List_Access;
Null_Argument_List : constant Argument_List := (1 .. 0 => new String'(""));
Null_Argument_List_Access : Argument_List_Access
:= new Argument_List (1 .. 0);
Tools_Error : exception;
Verbose : Boolean := False;
Quiet : Boolean := False;
-- Kill_Suffix is used by dlltool to know whether or not the @nn suffix
-- should be removed from the exported names. When Kill_Suffix is set to
-- True then dlltool -k option is used.
Kill_Suffix : Boolean := False;
procedure Build_Dynamic_Library
(Ofiles : Argument_List;
Afiles : Argument_List;
Options : Argument_List;
Bargs_Options : Argument_List;
Largs_Options : Argument_List;
Lib_Filename : String;
Def_Filename : String;
Lib_Address : String := "";
Build_Import : Boolean := False;
Relocatable : Boolean := False);
-- Build a DLL and the import library to link against the DLL.
-- this function handles relocatable and non relocatable DLL.
-- If the Afiles argument list contains some Ada units then it will
-- generate the right adainit and adafinal and integrate it in the DLL.
-- If the Afiles argument list is empty (there is only some object files
-- provided) then it will not try to build a binder file. This is ok to
-- build DLL containing no Ada code.
procedure Build_Import_Library
(Lib_Filename : String;
Def_Filename : String);
-- Build an import library (.a) from a definition files. An import library
-- is needed to link against a DLL.
end MDLL;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- R E S T R I C T --
-- --
-- S p e c --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- This package deals with the implementation of the Restrictions pragma
with Aspects; use Aspects;
with Namet; use Namet;
with Rident; use Rident;
with Snames; use Snames;
with Table;
with Types; use Types;
with Uintp; use Uintp;
package Restrict is
Restrictions : Restrictions_Info := No_Restrictions;
-- This variable records restrictions found in any units in the main
-- extended unit, and in the case of restrictions checked for partition
-- consistency, restrictions found in any with'ed units, parent specs
-- etc., since we may as well check as much as we can at compile time.
-- These variables should not be referenced directly by clients. Instead
-- use Check_Restriction to record a violation of a restriction, and
-- Restriction_Active to test if a given restriction is active.
Restrictions_Loc : array (All_Restrictions) of Source_Ptr :=
(others => No_Location);
-- Locations of Restrictions pragmas for error message purposes.
-- Valid only if corresponding entry in Restrictions is set. A value
-- of No_Location is used for implicit restrictions set by another
-- pragma, and a value of System_Location is used for restrictions
-- set from package Standard by the processing in Targparm.
Restriction_Profile_Name : array (All_Restrictions) of Profile_Name;
-- Entries in this array are valid only if the corresponding restriction in
-- Restrictions is set. The value is the corresponding profile name if the
-- restriction was set by a Profile or Profile_Warnings pragma. The value
-- is No_Profile in all other cases.
Main_Restrictions : Restrictions_Info := No_Restrictions;
-- This variable records only restrictions found in any units of the
-- main extended unit. These are the variables used for ali file output,
-- since we want the binder to be able to accurately diagnose inter-unit
-- restriction violations.
Restriction_Warnings : Rident.Restriction_Flags := (others => False);
-- If one of these flags is set, then it means that violation of the
-- corresponding restriction results only in a warning message, not
-- in an error message, and the restriction is not otherwise enforced.
-- Note that the flags in Restrictions are set to indicate that the
-- restriction is set in this case, but Main_Restrictions is never
-- set if Restriction_Warnings is set, so this does not look like a
-- restriction to the binder.
-- The following declarations establish a mapping between restriction
-- identifiers, and the names of corresponding restricted library units.
type Unit_Entry is record
Res_Id : Restriction_Id;
Filenm : String (1 .. 8);
end record;
Unit_Array : constant array (Positive range <>) of Unit_Entry := (
(No_Asynchronous_Control, "a-astaco"),
(No_Calendar, "a-calend"),
(No_Calendar, "calendar"),
(No_Delay, "a-calend"),
(No_Delay, "calendar"),
(No_Dynamic_Priorities, "a-dynpri"),
(No_Finalization, "a-finali"),
(No_IO, "a-direio"),
(No_IO, "directio"),
(No_IO, "a-sequio"),
(No_IO, "sequenio"),
(No_IO, "a-ststio"),
(No_IO, "a-textio"),
(No_IO, "text_io "),
(No_IO, "a-witeio"),
(No_Task_Attributes_Package, "a-tasatt"),
(No_Unchecked_Conversion, "a-unccon"),
(No_Unchecked_Conversion, "unchconv"),
(No_Unchecked_Deallocation, "a-uncdea"),
(No_Unchecked_Deallocation, "unchdeal"));
-- The following map has True for all GNAT-defined Restrictions. It is used
-- to implement pragma Restrictions (No_Implementation_Restrictions) (which
-- is why this restriction itself is excluded from the list).
Implementation_Restriction : constant array (All_Restrictions) of Boolean :=
(Simple_Barriers => True,
No_Calendar => True,
No_Default_Initialization => True,
No_Direct_Boolean_Operators => True,
No_Dispatching_Calls => True,
No_Dynamic_Attachment => True,
No_Elaboration_Code => True,
No_Enumeration_Maps => True,
No_Entry_Calls_In_Elaboration_Code => True,
No_Entry_Queue => True,
No_Exception_Handlers => True,
No_Exception_Propagation => True,
No_Exception_Registration => True,
No_Finalization => True,
No_Fixed_IO => True,
No_Implementation_Attributes => True,
No_Implementation_Pragmas => True,
No_Implicit_Conditionals => True,
No_Implicit_Aliasing => True,
No_Implicit_Dynamic_Code => True,
No_Implicit_Loops => True,
No_Initialize_Scalars => True,
No_Local_Protected_Objects => True,
No_Long_Long_Integers => True,
No_Multiple_Elaboration => True,
No_Protected_Type_Allocators => True,
No_Relative_Delay => True,
No_Requeue_Statements => True,
No_Secondary_Stack => True,
No_Select_Statements => True,
No_Standard_Storage_Pools => True,
No_Stream_Optimizations => True,
No_Streams => True,
No_Task_Attributes_Package => True,
No_Task_Termination => True,
No_Tasking => True,
No_Wide_Characters => True,
Static_Priorities => True,
Static_Storage_Size => True,
Pure_Barriers => True,
SPARK_05 => True,
others => False);
--------------------------
-- No_Dependences Table --
--------------------------
-- The following table records entries made by Restrictions pragmas
-- that specify a parameter for No_Dependence. Each such pragma makes
-- an entry in this table.
-- Note: we have chosen to implement this restriction in the "syntactic"
-- form, where we do not check that the named package is a language defined
-- package, but instead we allow arbitrary package names. The discussion of
-- this issue is not complete in the ARG, but the sense seems to be leaning
-- in this direction, which makes more sense to us, since it is much more
-- useful, and much easier to implement.
type ND_Entry is record
Unit : Node_Id;
-- The unit parameter from the No_Dependence pragma
Warn : Boolean;
-- True if from Restriction_Warnings, False if from Restrictions
Profile : Profile_Name;
-- Set to name of profile from which No_Dependence entry came, or to
-- No_Profile if a pragma Restriction set the No_Dependence entry.
end record;
package No_Dependences is new Table.Table (
Table_Component_Type => ND_Entry,
Table_Index_Type => Int,
Table_Low_Bound => 0,
Table_Initial => 200,
Table_Increment => 200,
Table_Name => "Name_No_Dependences");
----------------------------
-- No_Use_Of_Entity Table --
----------------------------
-- The following table records entries made by Restrictions pragmas
-- that specify a parameter for No_Use_Of_Entity. Each such pragma makes
-- an entry in this table.
-- Note: we have chosen to implement this restriction in the "syntactic"
-- form, where we allow arbitrary fully qualified names to be specified.
type NE_Entry is record
Entity : Node_Id;
-- The entity parameter from the No_Use_Of_Entity pragma. This is in
-- the form of a selected component, since that is the way the parser
-- processes it, and we don't further analyze it.
Warn : Boolean;
-- True if from Restriction_Warnings, False if from Restrictions
Profile : Profile_Name;
-- Set to name of profile from which No_Use_Of_Entity entry came, or to
-- No_Profile if a pragma Restriction set the No_Use_Of_Entity entry.
end record;
package No_Use_Of_Entity is new Table.Table (
Table_Component_Type => NE_Entry,
Table_Index_Type => Int,
Table_Low_Bound => 0,
Table_Initial => 200,
Table_Increment => 200,
Table_Name => "Name_No_Use_Of_Entity");
-- Note that in addition to making an entry in this table, we also set the
-- Boolean2 flag of the Name_Table entry for the simple name of the entity.
-- This is used to avoid most useless searches of this table.
-----------------
-- Subprograms --
-----------------
-- Note: several of these subprograms can generate error messages (e.g.
-- Check_Restriction). These routines should be called in the analyzer
-- rather than the expander, so that the associated error messages are
-- correctly generated in semantics only (-gnatc) mode.
function Abort_Allowed return Boolean;
pragma Inline (Abort_Allowed);
-- Tests to see if abort is allowed by the current restrictions settings.
-- For abort to be allowed, either No_Abort_Statements must be False,
-- or Max_Asynchronous_Select_Nesting must be non-zero.
procedure Check_Compiler_Unit (Feature : String; N : Node_Id);
-- If unit N is in a unit that has a pragma Compiler_Unit_Warning, then
-- a message is posted on node N noting use of the given feature is not
-- permitted in the compiler (bootstrap considerations).
procedure Check_Compiler_Unit (Feature : String; Loc : Source_Ptr);
-- If unit N is in a unit that has a pragma Compiler_Unit_Warning, then a
-- message is posted at location Loc noting use of the given feature is not
-- permitted in the compiler (bootstrap considerations).
procedure Check_Restricted_Unit (U : Unit_Name_Type; N : Node_Id);
-- Checks if loading of unit U is prohibited by the setting of some
-- restriction (e.g. No_IO restricts the loading of unit Ada.Text_IO).
-- If a restriction exists post error message at the given node.
procedure Check_Restriction
(Msg_Issued : out Boolean;
R : Restriction_Id;
N : Node_Id;
V : Uint := Uint_Minus_1);
-- Checks that the given restriction is not set, and if it is set, an
-- appropriate message is posted on the given node, in which case
-- Msg_Issued is set to True (and False otherwise). Also records the
-- violation in the appropriate internal arrays. Note that it is mandatory
-- to always use this routine to check if a restriction is violated. Such
-- checks must never be done directly by the caller, since otherwise
-- violations in the absence of restrictions are not properly recorded. The
-- value of V is relevant only for parameter restrictions, and in this case
-- indicates the exact count for the violation. If the exact count is not
-- known, V is left at its default of -1 which indicates an unknown count.
procedure Check_Restriction
(R : Restriction_Id;
N : Node_Id;
V : Uint := Uint_Minus_1);
-- Wrapper on Check_Restriction with Msg_Issued, with the out-parameter
-- being ignored here.
procedure Check_Restriction_No_Dependence (U : Node_Id; Err : Node_Id);
-- Called when a dependence on a unit is created (either implicitly, or by
-- an explicit WITH clause). U is a node for the unit involved, and Err is
-- the node to which an error will be attached if necessary.
procedure Check_Restriction_No_Specification_Of_Aspect (N : Node_Id);
-- N is the node id for an N_Aspect_Specification. An error message
-- (warning) will be issued if a restriction (warning) was previously set
-- for this aspect using Set_No_Specification_Of_Aspect.
procedure Check_Restriction_No_Use_Of_Attribute (N : Node_Id);
-- N denotes an attribute definition clause or an attribute reference. An
-- error message (warning) will be issued if a restriction (warning) was
-- previously set for this attribute using Set_No_Use_Of_Attribute.
procedure Check_Restriction_No_Use_Of_Entity (N : Node_Id);
-- N is the node id for an entity reference. An error message (warning)
-- will be issued if a restriction (warning) was previously set for this
-- entity name using Set_No_Use_Of_Entity.
procedure Check_Restriction_No_Use_Of_Pragma (N : Node_Id);
-- N is the node of a pragma. An error message (warning) will be issued
-- if a restriction (warning) was previously set for this pragma using
-- Set_No_Use_Of_Pragma.
procedure Check_Elaboration_Code_Allowed (N : Node_Id);
-- Tests to see if elaboration code is allowed by the current restrictions
-- settings. This function is called by Gigi when it needs to define an
-- elaboration routine. If elaboration code is not allowed, an error
-- message is posted on the node given as argument.
procedure Check_SPARK_05_Restriction
(Msg : String;
N : Node_Id;
Force : Boolean := False);
-- Node N represents a construct not allowed in SPARK_05 mode. If this is
-- a source node, or if the restriction is forced (Force = True), and
-- the SPARK_05 restriction is set, then an error is issued on N. Msg
-- is appended to the restriction failure message.
procedure Check_SPARK_05_Restriction
(Msg1 : String;
Msg2 : String;
N : Node_Id);
-- Same as Check_SPARK_05_Restriction except there is a continuation
-- message Msg2 following the initial message Msg1.
procedure Check_No_Implicit_Aliasing (Obj : Node_Id);
-- Obj is a node for which Is_Aliased_View is True, which is being used in
-- a context (e.g. 'Access) where no implicit aliasing is allowed if the
-- restriction No_Implicit_Aliasing is set. This procedure checks for the
-- case where the restriction is active and Obj does not meet the required
-- rules for avoiding implicit aliases, and issues a restriction message.
procedure Check_Implicit_Dynamic_Code_Allowed (N : Node_Id);
-- Tests to see if dynamic code generation (dynamically generated
-- trampolines, in particular) is allowed by the current restrictions
-- settings. This function is called by Gigi when it needs to generate code
-- that generates a trampoline. If not allowed, an error message is posted
-- on the node given as argument.
procedure Check_No_Implicit_Heap_Alloc (N : Node_Id);
-- Equivalent to Check_Restriction (No_Implicit_Heap_Allocations, N).
-- Provided for easy use by back end, which has to check this restriction.
procedure Check_No_Implicit_Task_Alloc (N : Node_Id);
-- Equivalent to Check_Restriction (No_Implicit_Task_Allocations, N).
-- Provided for easy use by back end, which has to check this restriction.
procedure Check_No_Implicit_Protected_Alloc (N : Node_Id);
-- Equivalent to:
-- Check_Restriction (No_Implicit_Protected_Object_Allocations, N)
-- Provided for easy use by back end, which has to check this restriction.
procedure Check_Obsolescent_2005_Entity (E : Entity_Id; N : Node_Id);
-- This routine checks if the entity E is one of the obsolescent entries
-- in Ada.Characters.Handling in Ada 2005 and No_Obsolescent_Features
-- restriction is active. If so an appropriate message is given. N is
-- the node on which the message is to be placed. It's a bit kludgy to
-- have this highly specialized routine rather than some wonderful general
-- mechanism (e.g. a special pragma) to handle this case, but there are
-- only six cases, and it is not worth the effort to do something general.
procedure Check_Wide_Character_Restriction (E : Entity_Id; N : Node_Id);
-- This procedure checks if the No_Wide_Character restriction is active,
-- and if so, if N Comes_From_Source, and the root type of E is one of
-- [Wide_]Wide_Character or [Wide_]Wide_String, then the restriction
-- violation is recorded, and an appropriate message given.
function Get_Restriction_Id
(N : Name_Id) return Restriction_Id;
-- Given an identifier name, determines if it is a valid restriction
-- identifier, and if so returns the corresponding Restriction_Id value,
-- otherwise returns Not_A_Restriction_Id.
function OK_No_Dependence_Unit_Name (N : Node_Id) return Boolean;
-- Used in checking No_Dependence argument of pragma Restrictions or
-- pragma Restrictions_Warning, or attribute Restriction_Set. Returns
-- True if N has the proper form for a unit name, False otherwise.
function OK_No_Use_Of_Entity_Name (N : Node_Id) return Boolean;
-- Used in checking No_Use_Of_Entity argument of pragma Restrictions or
-- pragma Restrictions_Warning, or attribute Restriction_Set. Returns
-- True if N has the proper form for an entity name, False otherwise.
function Is_In_Hidden_Part_In_SPARK (Loc : Source_Ptr) return Boolean;
-- Determine if given location is covered by a hidden region range in the
-- SPARK hides table.
function No_Exception_Handlers_Set return Boolean;
-- Test to see if current restrictions settings specify that no exception
-- handlers are present. This function is called by Gigi when it needs to
-- expand an AT END clean up identifier with no exception handler. True
-- will be returned if the configurable run-time is activated, and either
-- of the restrictions No_Exception_Handlers or No_Exception_Propagation is
-- set. In the latter case, the source may contain handlers but they either
-- get converted using the local goto transformation or deleted.
function No_Exception_Propagation_Active return Boolean;
-- Test to see if current restrictions settings specify that no
-- exception propagation is activated.
function Process_Restriction_Synonyms (N : Node_Id) return Name_Id;
-- Id is a node whose Chars field contains the name of a restriction.
-- If it is one of synonyms that we allow for historical purposes (for
-- list see System.Rident), then the proper official name is returned.
function Restriction_Active (R : All_Restrictions) return Boolean;
pragma Inline (Restriction_Active);
-- Determines if a given restriction is active. This call should only be
-- used where the compiled code depends on whether the restriction is
-- active. Always use Check_Restriction to record a violation. Note that
-- this returns False if we only have a Restriction_Warnings set, since
-- restriction warnings should never affect generated code. If you want
-- to know if a call to Check_Restriction is needed then use the function
-- Restriction_Check_Required instead.
function Restriction_Check_Required (R : All_Restrictions) return Boolean;
pragma Inline (Restriction_Check_Required);
-- Determines if either a Restriction_Warnings or Restrictions pragma has
-- been given for the specified restriction. If true, then a subsequent
-- call to Check_Restriction is required if the restriction is violated.
-- This must not be used to guard code generation that depends on whether
-- a restriction is active (see Restriction_Active above). Typically it
-- is used to avoid complex code to determine if a restriction is violated,
-- executing this code only if needed.
function Restricted_Profile return Boolean;
-- Tests if set of restrictions corresponding to Restricted_Tasking profile
-- is currently in effect (set by pragma Profile, or by an appropriate set
-- of individual Restrictions pragmas). Returns True only if all the
-- required restrictions are set.
procedure Set_Hidden_Part_In_SPARK (Loc1, Loc2 : Source_Ptr);
-- Insert a new hidden region range in the SPARK hides table. The effect
-- is to hide any SPARK violation messages which are in the range Loc1 to
-- Loc2-1 (i.e. Loc2 is the first location for reenabling checks).
procedure Set_Profile_Restrictions
(P : Profile_Name;
N : Node_Id;
Warn : Boolean);
-- Sets the set of restrictions associated with the given profile name. N
-- is the node of the construct to which error messages are to be attached
-- as required. Warn is set True for the case of Profile_Warnings where the
-- restrictions are set as warnings rather than legality requirements, and
-- is also True for Profile if the Treat_Restrictions_As_Warnings flag is
-- set. It is false for Profile if this flag is not set.
procedure Set_Restriction
(R : All_Boolean_Restrictions;
N : Node_Id);
-- N is a node (typically a pragma node) that has the effect of setting
-- Boolean restriction R. The restriction is set in Restrictions, and
-- also in Main_Restrictions if this is the main unit.
procedure Set_Restriction
(R : All_Parameter_Restrictions;
N : Node_Id;
V : Integer);
-- Similar to the above, except that this is used for the case of a
-- parameter restriction, and the corresponding value V is given.
procedure Set_Restriction_No_Dependence
(Unit : Node_Id;
Warn : Boolean;
Profile : Profile_Name := No_Profile);
-- Sets given No_Dependence restriction in table if not there already. Warn
-- is True if from Restriction_Warnings, or for Restrictions if the flag
-- Treat_Restrictions_As_Warnings is set. False if from Restrictions and
-- this flag is not set. Profile is set to a non-default value if the
-- No_Dependence restriction comes from a Profile pragma.
procedure Set_Restriction_No_Specification_Of_Aspect
(N : Node_Id;
Warning : Boolean);
-- N is the node id for an identifier from a pragma Restrictions for the
-- No_Specification_Of_Aspect pragma. An error message will be issued if
-- the identifier is not a valid aspect name. Warning is set True for the
-- case of a Restriction_Warnings pragma specifying this restriction and
-- False for a Restrictions pragma specifying this restriction.
procedure Set_Restriction_No_Specification_Of_Aspect (A_Id : Aspect_Id);
-- Version used by Get_Target_Parameters (via Tbuild)
procedure Set_Restriction_No_Use_Of_Attribute
(N : Node_Id;
Warning : Boolean);
-- N is the node id for the identifier in a pragma Restrictions for
-- No_Use_Of_Attribute. Caller has verified that this is a valid attribute
-- designator.
procedure Set_Restriction_No_Use_Of_Attribute (A_Id : Attribute_Id);
-- Version used by Get_Target_Parameters (via Tbuild)
procedure Set_Restriction_No_Use_Of_Entity
(Entity : Node_Id;
Warning : Boolean;
Profile : Profile_Name := No_Profile);
-- Sets given No_Use_Of_Entity restriction in table if not there already.
-- Warn is True if from Restriction_Warnings, or for Restrictions if the
-- flag Treat_Restrictions_As_Warnings is set. False if from Restrictions
-- and this flag is not set. Profile is set to a non-default value if the
-- No_Dependence restriction comes from a Profile pragma. This procedure
-- also takes care of setting the Boolean2 flag of the simple name for
-- the entity (to optimize table searches).
procedure Set_Restriction_No_Use_Of_Pragma
(N : Node_Id;
Warning : Boolean);
-- N is the node id for the identifier in a pragma Restrictions for
-- No_Use_Of_Pragma. Caller has verified that this is a valid pragma id.
procedure Set_Restriction_No_Use_Of_Pragma (A_Id : Pragma_Id);
-- Version used in call from Get_Target_Parameters (via Tbuild).
function Tasking_Allowed return Boolean;
pragma Inline (Tasking_Allowed);
-- Tests if tasking operations are allowed by the current restrictions
-- settings. For tasking to be allowed Max_Tasks must be non-zero.
----------------------------------------------
-- Handling of Boolean Compilation Switches --
----------------------------------------------
-- The following declarations are used for proper saving and restoring of
-- restrictions for separate compilation units. There are two cases:
-- For partition-wide restrictions, we just let the restrictions pragmas
-- pile up, and we never reset them. We might as well detect what we can
-- at compile time. If e.g. a with'ed unit has a restriction for one of
-- the partition-wide restrictions, then the binder will enforce it on
-- all units in the partition, including the unit with the WITH. Although
-- it would not be wrong to leave this till bind time, we might as well
-- flag it earlier at compile time.
-- For non-partition-wide restrictions, we have quite a different state
-- of affairs. Here it would be quite wrong to carry a restriction from
-- a with'ed unit to another with'ed unit, or from a package spec to the
-- package body. This means that we have to reset these non-partition
-- wide restrictions at the start of each separate compilation unit. For
-- units in the extended main program, we need to reset them all to the
-- values set by the configuration pragma file(s). For units not in the
-- extended main program, e.g. with'ed units, we might as well reset all
-- of these restrictions to off (False). The actual initial values will
-- be taken from the config files active when those units are compiled
-- as main units.
type Save_Cunit_Boolean_Restrictions is private;
-- Type used for saving and restoring compilation unit restrictions.
function Cunit_Boolean_Restrictions_Save
return Save_Cunit_Boolean_Restrictions;
-- This function saves the compilation unit restriction settings, leaving
-- them unchanged. This is used e.g. at the start of processing a context
-- clause, so that the main unit restrictions can be restored after all
-- the with'ed units have been processed.
procedure Cunit_Boolean_Restrictions_Restore
(R : Save_Cunit_Boolean_Restrictions);
-- This is the corresponding restore procedure to restore restrictions
-- previously saved by Cunit_Boolean_Restrictions_Save. However it does
-- not reset No_Elaboration_Code, this stays set if it was set before
-- the call, and also if it is set before the call, then the Config
-- setting is also updated to include this restriction. This is what
-- implements the special handling of No_Elaboration_Code.
procedure Save_Config_Cunit_Boolean_Restrictions;
-- This saves the current compilation unit restrictions in an internal
-- variable, and leaves them unchanged. This is called immediately after
-- processing the configuration file pragmas, to record the restrictions
-- set by these configuration file pragmas.
procedure Restore_Config_Cunit_Boolean_Restrictions;
-- This restores the value saved by the previous call to save config values
-- saved by Save_Config_Cunit_Boolean_Restrictions. It is called at the
-- start of processing a new unit that is part of the main sources (e.g.
-- a package spec when the main unit is a package body).
procedure Reset_Cunit_Boolean_Restrictions;
-- Turns off all non-partition-wide boolean restrictions
procedure Add_To_Config_Boolean_Restrictions (R : Restriction_Id);
-- Add specified restriction to stored configuration boolean restrictions.
-- This is used for handling the special case of No_Elaboration_Code.
private
type Save_Cunit_Boolean_Restrictions is
array (Cunit_Boolean_Restrictions) of Boolean;
-- Type used for saving and restoring compilation unit restrictions.
-- See Compilation_Unit_Restrictions_[Save|Restore] subprograms.
end Restrict;
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.