hexsha
stringlengths 40
40
| size
int64 3
1.05M
| ext
stringclasses 163
values | lang
stringclasses 53
values | max_stars_repo_path
stringlengths 3
945
| max_stars_repo_name
stringlengths 4
112
| max_stars_repo_head_hexsha
stringlengths 40
78
| max_stars_repo_licenses
sequencelengths 1
10
| max_stars_count
float64 1
191k
⌀ | max_stars_repo_stars_event_min_datetime
stringlengths 24
24
⌀ | max_stars_repo_stars_event_max_datetime
stringlengths 24
24
⌀ | max_issues_repo_path
stringlengths 3
945
| max_issues_repo_name
stringlengths 4
113
| max_issues_repo_head_hexsha
stringlengths 40
78
| max_issues_repo_licenses
sequencelengths 1
10
| max_issues_count
float64 1
116k
⌀ | max_issues_repo_issues_event_min_datetime
stringlengths 24
24
⌀ | max_issues_repo_issues_event_max_datetime
stringlengths 24
24
⌀ | max_forks_repo_path
stringlengths 3
945
| max_forks_repo_name
stringlengths 4
113
| max_forks_repo_head_hexsha
stringlengths 40
78
| max_forks_repo_licenses
sequencelengths 1
10
| max_forks_count
float64 1
105k
⌀ | max_forks_repo_forks_event_min_datetime
stringlengths 24
24
⌀ | max_forks_repo_forks_event_max_datetime
stringlengths 24
24
⌀ | content
stringlengths 3
1.05M
| avg_line_length
float64 1
966k
| max_line_length
int64 1
977k
| alphanum_fraction
float64 0
1
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
103d076430b1dfdc82bba08bd23d66c678cf495f | 2,158 | adb | Ada | src/jsa-debugged.adb | sparre/JSA | 713a8244bcd85d86f14a58b3a94ba72c4d4382c0 | [
"ISC"
] | 1 | 2018-12-17T14:35:33.000Z | 2018-12-17T14:35:33.000Z | src/jsa-debugged.adb | sparre/JSA | 713a8244bcd85d86f14a58b3a94ba72c4d4382c0 | [
"ISC"
] | null | null | null | src/jsa-debugged.adb | sparre/JSA | 713a8244bcd85d86f14a58b3a94ba72c4d4382c0 | [
"ISC"
] | null | null | null | ------------------------------------------------------------------------------
--
-- package Debugged (body)
--
------------------------------------------------------------------------------
-- Update information:
--
-- 1996.07.26 (Jacob Sparre Andersen)
-- Copied from Debugging (1996.07.26).
--
-- (Insert additional update information above this line.)
------------------------------------------------------------------------------
with Ada.Command_Line;
with Ada.Text_IO;
package body JSA.Debugged is
---------------------------------------------------------------------------
-- procedure Message:
--
-- Writes a message to Current_Error if debugging is activated.
procedure Message (Item : in String) is
use Ada.Text_IO;
begin -- Message
if Debug then
Put (Current_Error, Item);
-- Flush (Current_Error);
end if;
end Message;
---------------------------------------------------------------------------
-- procedure Message_Line:
--
-- Writes a message and a new line to Current_Error if debugging is
-- activated.
procedure Message_Line (Item : in String) is
use Ada.Text_IO;
begin -- Message_Line
if Debug then
Put_Line (Current_Error, Item);
-- Flush (Current_Error);
end if;
end Message_Line;
---------------------------------------------------------------------------
use Ada.Command_Line;
use Ada.Text_IO;
Error_Log : File_Type;
Log_To_Current_Error : Boolean := True;
Log_File_Argument_Index : Positive;
begin -- Debugged
for Index in 1 .. Argument_Count - 1 loop
if Argument (Index) = "-errorlog" then
Log_To_Current_Error := False;
Log_File_Argument_Index := Index + 1;
exit;
end if;
end loop;
if not Log_To_Current_Error then
if Argument (Log_File_Argument_Index) = "-" then
Set_Error (Standard_Output);
else
Create (File => Error_Log,
Name => Argument (Log_File_Argument_Index));
Set_Error (Error_Log);
end if;
end if;
end JSA.Debugged;
| 26.975 | 78 | 0.482854 |
c785804fcf597c60aac605887f64aef6a9d72d94 | 40,659 | adb | Ada | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b/conv2d_b2b/hls_target/.autopilot/db/linebuffer_1.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | 1 | 2020-06-18T16:51:39.000Z | 2020-06-18T16:51:39.000Z | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b/conv2d_b2b/hls_target/.autopilot/db/linebuffer_1.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | null | null | null | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b/conv2d_b2b/hls_target/.autopilot/db/linebuffer_1.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | 1 | 2020-03-18T00:43:22.000Z | 2020-03-18T00:43:22.000Z | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="14">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName/>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>linebuffer_1</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>in_axi_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>in_axi_stream.V.value.V</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>in_axi_stream_V_last_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in_axi_stream.V.last.V</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>out_stream_V_value_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>out_stream.V.value.V</originalName>
<rtlName/>
<coreName>FIFO_SRL</coreName>
</Obj>
<bitwidth>288</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>4</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name>in_stream_V_value_V</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>545</lineNumber>
<contextFuncName>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/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>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</second>
</first>
<second>545</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>in_stream.V.value.V</originalName>
<rtlName>in_stream_V_value_V_U</rtlName>
<coreName>FIFO_SRL</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>linebuffer_Loop_1_pr_U0</rtlName>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>18</item>
<item>19</item>
<item>20</item>
<item>21</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name/>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>556</lineNumber>
<contextFuncName>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</second>
</first>
<second>556</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>linebuffer_U0</rtlName>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>23</item>
<item>24</item>
<item>25</item>
<item>107</item>
<item>108</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name/>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>557</lineNumber>
<contextFuncName>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</second>
</first>
<second>557</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_8">
<Value>
<Obj>
<type>2</type>
<id>15</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_9">
<Value>
<Obj>
<type>2</type>
<id>17</id>
<name>linebuffer_Loop_1_pr</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>
<const_type>6</const_type>
<content><constant:linebuffer_Loop_1_pr></content>
</item>
<item class_id_reference="16" object_id="_10">
<Value>
<Obj>
<type>2</type>
<id>22</id>
<name>linebuffer</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>
<const_type>6</const_type>
<content><constant:linebuffer></content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_11">
<Obj>
<type>3</type>
<id>14</id>
<name>linebuffer.1</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>7</item>
<item>11</item>
<item>12</item>
<item>13</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_12">
<id>16</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_13">
<id>18</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_14">
<id>19</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_15">
<id>20</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_16">
<id>21</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_17">
<id>23</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_18">
<id>24</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_19">
<id>25</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_20">
<id>107</id>
<edge_type>4</edge_type>
<source_obj>11</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_21">
<id>108</id>
<edge_type>4</edge_type>
<source_obj>11</source_obj>
<sink_obj>12</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_22">
<mId>1</mId>
<mTag>linebuffer.1</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>2077921</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>1</mIsDfPipe>
<mDfPipe class_id="23" tracking_level="1" version="0" object_id="_23">
<port_list class_id="24" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port_list>
<process_list class_id="25" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_24">
<type>0</type>
<name>linebuffer_Loop_1_pr_U0</name>
<ssdmobj_id>11</ssdmobj_id>
<pins 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="_25">
<port class_id="29" tracking_level="1" version="0" object_id="_26">
<name>in_axi_stream_V_value_V</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id="30" tracking_level="1" version="0" object_id="_27">
<type>0</type>
<name>linebuffer_Loop_1_pr_U0</name>
<ssdmobj_id>11</ssdmobj_id>
</inst>
</item>
<item class_id_reference="28" object_id="_28">
<port class_id_reference="29" object_id="_29">
<name>in_axi_stream_V_last_V</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_27"/>
</item>
<item class_id_reference="28" object_id="_30">
<port class_id_reference="29" object_id="_31">
<name>in_stream_V_value_V</name>
<dir>0</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_27"/>
</item>
</pins>
</item>
<item class_id_reference="26" object_id="_32">
<type>0</type>
<name>linebuffer_U0</name>
<ssdmobj_id>12</ssdmobj_id>
<pins>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_33">
<port class_id_reference="29" object_id="_34">
<name>in_stream_V_value_V</name>
<dir>0</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id="_35">
<type>0</type>
<name>linebuffer_U0</name>
<ssdmobj_id>12</ssdmobj_id>
</inst>
</item>
<item class_id_reference="28" object_id="_36">
<port class_id_reference="29" object_id="_37">
<name>out_stream_V_value_V</name>
<dir>0</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_35"/>
</item>
</pins>
</item>
</process_list>
<channel_list class_id="31" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="32" tracking_level="1" version="0" object_id="_38">
<type>1</type>
<name>in_stream_V_value_V</name>
<ssdmobj_id>7</ssdmobj_id>
<ctype>0</ctype>
<depth>1</depth>
<bitwidth>32</bitwidth>
<source class_id_reference="28" object_id="_39">
<port class_id_reference="29" object_id="_40">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_27"/>
</source>
<sink class_id_reference="28" object_id="_41">
<port class_id_reference="29" object_id="_42">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_35"/>
</sink>
</item>
</channel_list>
<net_list class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</net_list>
</mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="34" tracking_level="1" version="0" object_id="_43">
<states class_id="35" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="36" tracking_level="1" version="0" object_id="_44">
<id>1</id>
<operations class_id="37" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="1" version="0" object_id="_45">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_46">
<id>11</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_47">
<id>2</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_48">
<id>11</id>
<stage>1</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_49">
<id>3</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_50">
<id>12</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_51">
<id>4</id>
<operations>
<count>8</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_52">
<id>4</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_53">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_54">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_55">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_56">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_57">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_58">
<id>12</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="38" object_id="_59">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="39" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="1" version="0" object_id="_60">
<inState>1</inState>
<outState>2</outState>
<condition class_id="41" tracking_level="0" version="0">
<id>0</id>
<sop class_id="42" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="43" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="40" object_id="_61">
<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="40" object_id="_62">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>2</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="44" tracking_level="1" version="0" object_id="_63">
<dp_component_resource class_id="45" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="46" tracking_level="0" version="0">
<first>linebuffer_Loop_1_pr_U0 (linebuffer_Loop_1_pr)</first>
<second class_id="47" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="48" tracking_level="0" version="0">
<first>FF</first>
<second>131</second>
</item>
<item>
<first>LUT</first>
<second>143</second>
</item>
</second>
</item>
<item>
<first>linebuffer_U0 (linebuffer)</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>BRAM</first>
<second>8</second>
</item>
<item>
<first>FF</first>
<second>1097</second>
</item>
<item>
<first>LUT</first>
<second>646</second>
</item>
</second>
</item>
<item>
<first>start_for_linebufeOg_U (start_for_linebufeOg)</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
</dp_component_resource>
<dp_expression_resource>
<count>3</count>
<item_version>0</item_version>
<item>
<first>ap_idle ( 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>linebuffer_Loop_1_pr_U0_start_full_n ( 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>start_write ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
</dp_expression_resource>
<dp_fifo_resource>
<count>1</count>
<item_version>0</item_version>
<item>
<first>in_stream_V_value_V_U</first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>
<first>(0Depth)</first>
<second>1</second>
</item>
<item>
<first>(1Bits)</first>
<second>32</second>
</item>
<item>
<first>(2Size:D*B)</first>
<second>32</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
</dp_fifo_resource>
<dp_memory_resource>
<count>0</count>
<item_version>0</item_version>
</dp_memory_resource>
<dp_multiplexer_resource>
<count>1</count>
<item_version>0</item_version>
<item>
<first>real_start</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
</dp_multiplexer_resource>
<dp_register_resource>
<count>3</count>
<item_version>0</item_version>
<item>
<first>real_start_status_reg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>start_control_reg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>start_once_reg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
</dp_register_resource>
<dp_component_map class_id="49" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="50" tracking_level="0" version="0">
<first>linebuffer_Loop_1_pr_U0 (linebuffer_Loop_1_pr)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>linebuffer_U0 (linebuffer)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
</dp_component_map>
<dp_expression_map>
<count>0</count>
<item_version>0</item_version>
</dp_expression_map>
<dp_fifo_map>
<count>1</count>
<item_version>0</item_version>
<item>
<first>in_stream_V_value_V_U</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
</dp_fifo_map>
<dp_memory_map>
<count>0</count>
<item_version>0</item_version>
</dp_memory_map>
</res>
<node_label_latency class_id="51" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="0" version="0">
<first>7</first>
<second class_id="53" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>2</first>
<second>1</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="54" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="55" tracking_level="0" version="0">
<first>14</first>
<second class_id="56" tracking_level="0" version="0">
<first>0</first>
<second>3</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="57" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="58" tracking_level="1" version="0" object_id="_64">
<region_name>linebuffer.1</region_name>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</basic_blocks>
<nodes>
<count>10</count>
<item_version>0</item_version>
<item>4</item>
<item>5</item>
<item>6</item>
<item>7</item>
<item>8</item>
<item>9</item>
<item>10</item>
<item>11</item>
<item>12</item>
<item>13</item>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>16</region_type>
<interval>0</interval>
<pipe_depth>0</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="59" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="60" tracking_level="0" version="0">
<first>38</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
<item>
<first>42</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>12</item>
<item>12</item>
</second>
</item>
<item>
<first>49</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>11</item>
<item>11</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="62" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="63" tracking_level="0" version="0">
<first>in_stream_V_value_V_fu_38</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>2</count>
<item_version>0</item_version>
<item>
<first>grp_linebuffer_Loop_1_pr_fu_49</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>11</item>
<item>11</item>
</second>
</item>
<item>
<first>grp_linebuffer_fu_42</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>12</item>
<item>12</item>
</second>
</item>
</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="64" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>1</count>
<item_version>0</item_version>
<item>
<first>58</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>1</count>
<item_version>0</item_version>
<item>
<first>in_stream_V_value_V_reg_58</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="65" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="66" tracking_level="0" version="0">
<first>in_axi_stream_V_last_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>call</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
</second>
</item>
<item>
<first>in_axi_stream_V_value_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>call</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
</second>
</item>
<item>
<first>out_stream_V_value_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>call</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="67" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="68" tracking_level="0" version="0">
<first>3</first>
<second>FIFO_SRL</second>
</item>
</port2core>
<node2core>
<count>1</count>
<item_version>0</item_version>
<item>
<first>7</first>
<second>FIFO_SRL</second>
</item>
</node2core>
</syndb>
</boost_serialization>
| 32.869038 | 136 | 0.471925 |
c7d1e49d91eda6e018f30f397b28710a80f5e65f | 213,636 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/sem_aggr.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/sem_aggr.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/sem_aggr.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S E M _ A G G R --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Aspects; use Aspects;
with Atree; use Atree;
with Checks; use Checks;
with Einfo; use Einfo;
with Elists; use Elists;
with Errout; use Errout;
with Expander; use Expander;
with Exp_Ch6; use Exp_Ch6;
with Exp_Tss; use Exp_Tss;
with Exp_Util; use Exp_Util;
with Freeze; use Freeze;
with Itypes; use Itypes;
with Lib; use Lib;
with Lib.Xref; use Lib.Xref;
with Namet; use Namet;
with Namet.Sp; use Namet.Sp;
with Nmake; use Nmake;
with Nlists; use Nlists;
with Opt; use Opt;
with Restrict; use Restrict;
with Rident; use Rident;
with Sem; use Sem;
with Sem_Aux; use Sem_Aux;
with Sem_Cat; use Sem_Cat;
with Sem_Ch3; use Sem_Ch3;
with Sem_Ch5; use Sem_Ch5;
with Sem_Ch8; use Sem_Ch8;
with Sem_Ch13; use Sem_Ch13;
with Sem_Dim; use Sem_Dim;
with Sem_Eval; use Sem_Eval;
with Sem_Res; use Sem_Res;
with Sem_Util; use Sem_Util;
with Sem_Type; use Sem_Type;
with Sem_Warn; use Sem_Warn;
with Sinfo; use Sinfo;
with Snames; use Snames;
with Stringt; use Stringt;
with Stand; use Stand;
with Style; use Style;
with Targparm; use Targparm;
with Tbuild; use Tbuild;
with Ttypes; use Ttypes;
with Uintp; use Uintp;
package body Sem_Aggr is
type Case_Bounds is record
Lo : Node_Id;
-- Low bound of choice. Once we sort the Case_Table, then entries
-- will be in order of ascending Choice_Lo values.
Hi : Node_Id;
-- High Bound of choice. The sort does not pay any attention to the
-- high bound, so choices 1 .. 4 and 1 .. 5 could be in either order.
Highest : Uint;
-- If there are duplicates or missing entries, then in the sorted
-- table, this records the highest value among Choice_Hi values
-- seen so far, including this entry.
Choice : Node_Id;
-- The node of the choice
end record;
type Case_Table_Type is array (Pos range <>) of Case_Bounds;
-- Table type used by Check_Case_Choices procedure
-----------------------
-- Local Subprograms --
-----------------------
procedure Sort_Case_Table (Case_Table : in out Case_Table_Type);
-- Sort the Case Table using the Lower Bound of each Choice as the key. A
-- simple insertion sort is used since the choices in a case statement will
-- usually be in near sorted order.
procedure Check_Can_Never_Be_Null (Typ : Entity_Id; Expr : Node_Id);
-- Ada 2005 (AI-231): Check bad usage of null for a component for which
-- null exclusion (NOT NULL) is specified. Typ can be an E_Array_Type for
-- the array case (the component type of the array will be used) or an
-- E_Component/E_Discriminant entity in the record case, in which case the
-- type of the component will be used for the test. If Typ is any other
-- kind of entity, the call is ignored. Expr is the component node in the
-- aggregate which is known to have a null value. A warning message will be
-- issued if the component is null excluding.
--
-- It would be better to pass the proper type for Typ ???
procedure Check_Expr_OK_In_Limited_Aggregate (Expr : Node_Id);
-- Check that Expr is either not limited or else is one of the cases of
-- expressions allowed for a limited component association (namely, an
-- aggregate, function call, or <> notation). Report error for violations.
-- Expression is also OK in an instance or inlining context, because we
-- have already preanalyzed and it is known to be type correct.
------------------------------------------------------
-- Subprograms used for RECORD AGGREGATE Processing --
------------------------------------------------------
procedure Resolve_Record_Aggregate (N : Node_Id; Typ : Entity_Id);
-- This procedure performs all the semantic checks required for record
-- aggregates. Note that for aggregates analysis and resolution go
-- hand in hand. Aggregate analysis has been delayed up to here and
-- it is done while resolving the aggregate.
--
-- N is the N_Aggregate node.
-- Typ is the record type for the aggregate resolution
--
-- While performing the semantic checks, this procedure builds a new
-- Component_Association_List where each record field appears alone in a
-- Component_Choice_List along with its corresponding expression. The
-- record fields in the Component_Association_List appear in the same order
-- in which they appear in the record type Typ.
--
-- Once this new Component_Association_List is built and all the semantic
-- checks performed, the original aggregate subtree is replaced with the
-- new named record aggregate just built. This new record aggregate has no
-- positional associations, so its Expressions field is set to No_List.
-- Note that subtree substitution is performed with Rewrite so as to be
-- able to retrieve the original aggregate.
--
-- The aggregate subtree manipulation performed by Resolve_Record_Aggregate
-- yields the aggregate format expected by Gigi. Typically, this kind of
-- tree manipulations are done in the expander. However, because the
-- semantic checks that need to be performed on record aggregates really go
-- hand in hand with the record aggregate normalization, the aggregate
-- subtree transformation is performed during resolution rather than
-- expansion. Had we decided otherwise we would have had to duplicate most
-- of the code in the expansion procedure Expand_Record_Aggregate. Note,
-- however, that all the expansion concerning aggregates for tagged records
-- is done in Expand_Record_Aggregate.
--
-- The algorithm of Resolve_Record_Aggregate proceeds as follows:
--
-- 1. Make sure that the record type against which the record aggregate
-- has to be resolved is not abstract. Furthermore if the type is a
-- null aggregate make sure the input aggregate N is also null.
--
-- 2. Verify that the structure of the aggregate is that of a record
-- aggregate. Specifically, look for component associations and ensure
-- that each choice list only has identifiers or the N_Others_Choice
-- node. Also make sure that if present, the N_Others_Choice occurs
-- last and by itself.
--
-- 3. If Typ contains discriminants, the values for each discriminant is
-- looked for. If the record type Typ has variants, we check that the
-- expressions corresponding to each discriminant ruling the (possibly
-- nested) variant parts of Typ, are static. This allows us to determine
-- the variant parts to which the rest of the aggregate must conform.
-- The names of discriminants with their values are saved in a new
-- association list, New_Assoc_List which is later augmented with the
-- names and values of the remaining components in the record type.
--
-- During this phase we also make sure that every discriminant is
-- assigned exactly one value. Note that when several values for a given
-- discriminant are found, semantic processing continues looking for
-- further errors. In this case it's the first discriminant value found
-- which we will be recorded.
--
-- IMPORTANT NOTE: For derived tagged types this procedure expects
-- First_Discriminant and Next_Discriminant to give the correct list
-- of discriminants, in the correct order.
--
-- 4. After all the discriminant values have been gathered, we can set the
-- Etype of the record aggregate. If Typ contains no discriminants this
-- is straightforward: the Etype of N is just Typ, otherwise a new
-- implicit constrained subtype of Typ is built to be the Etype of N.
--
-- 5. Gather the remaining record components according to the discriminant
-- values. This involves recursively traversing the record type
-- structure to see what variants are selected by the given discriminant
-- values. This processing is a little more convoluted if Typ is a
-- derived tagged types since we need to retrieve the record structure
-- of all the ancestors of Typ.
--
-- 6. After gathering the record components we look for their values in the
-- record aggregate and emit appropriate error messages should we not
-- find such values or should they be duplicated.
--
-- 7. We then make sure no illegal component names appear in the record
-- aggregate and make sure that the type of the record components
-- appearing in a same choice list is the same. Finally we ensure that
-- the others choice, if present, is used to provide the value of at
-- least a record component.
--
-- 8. The original aggregate node is replaced with the new named aggregate
-- built in steps 3 through 6, as explained earlier.
--
-- Given the complexity of record aggregate resolution, the primary goal of
-- this routine is clarity and simplicity rather than execution and storage
-- efficiency. If there are only positional components in the aggregate the
-- running time is linear. If there are associations the running time is
-- still linear as long as the order of the associations is not too far off
-- the order of the components in the record type. If this is not the case
-- the running time is at worst quadratic in the size of the association
-- list.
procedure Check_Misspelled_Component
(Elements : Elist_Id;
Component : Node_Id);
-- Give possible misspelling diagnostic if Component is likely to be a
-- misspelling of one of the components of the Assoc_List. This is called
-- by Resolve_Aggr_Expr after producing an invalid component error message.
-----------------------------------------------------
-- Subprograms used for ARRAY AGGREGATE Processing --
-----------------------------------------------------
function Resolve_Array_Aggregate
(N : Node_Id;
Index : Node_Id;
Index_Constr : Node_Id;
Component_Typ : Entity_Id;
Others_Allowed : Boolean) return Boolean;
-- This procedure performs the semantic checks for an array aggregate.
-- True is returned if the aggregate resolution succeeds.
--
-- The procedure works by recursively checking each nested aggregate.
-- Specifically, after checking a sub-aggregate nested at the i-th level
-- we recursively check all the subaggregates at the i+1-st level (if any).
-- Note that for aggregates analysis and resolution go hand in hand.
-- Aggregate analysis has been delayed up to here and it is done while
-- resolving the aggregate.
--
-- N is the current N_Aggregate node to be checked.
--
-- Index is the index node corresponding to the array sub-aggregate that
-- we are currently checking (RM 4.3.3 (8)). Its Etype is the
-- corresponding index type (or subtype).
--
-- Index_Constr is the node giving the applicable index constraint if
-- any (RM 4.3.3 (10)). It "is a constraint provided by certain
-- contexts [...] that can be used to determine the bounds of the array
-- value specified by the aggregate". If Others_Allowed below is False
-- there is no applicable index constraint and this node is set to Index.
--
-- Component_Typ is the array component type.
--
-- Others_Allowed indicates whether an others choice is allowed
-- in the context where the top-level aggregate appeared.
--
-- The algorithm of Resolve_Array_Aggregate proceeds as follows:
--
-- 1. Make sure that the others choice, if present, is by itself and
-- appears last in the sub-aggregate. Check that we do not have
-- positional and named components in the array sub-aggregate (unless
-- the named association is an others choice). Finally if an others
-- choice is present, make sure it is allowed in the aggregate context.
--
-- 2. If the array sub-aggregate contains discrete_choices:
--
-- (A) Verify their validity. Specifically verify that:
--
-- (a) If a null range is present it must be the only possible
-- choice in the array aggregate.
--
-- (b) Ditto for a non static range.
--
-- (c) Ditto for a non static expression.
--
-- In addition this step analyzes and resolves each discrete_choice,
-- making sure that its type is the type of the corresponding Index.
-- If we are not at the lowest array aggregate level (in the case of
-- multi-dimensional aggregates) then invoke Resolve_Array_Aggregate
-- recursively on each component expression. Otherwise, resolve the
-- bottom level component expressions against the expected component
-- type ONLY IF the component corresponds to a single discrete choice
-- which is not an others choice (to see why read the DELAYED
-- COMPONENT RESOLUTION below).
--
-- (B) Determine the bounds of the sub-aggregate and lowest and
-- highest choice values.
--
-- 3. For positional aggregates:
--
-- (A) Loop over the component expressions either recursively invoking
-- Resolve_Array_Aggregate on each of these for multi-dimensional
-- array aggregates or resolving the bottom level component
-- expressions against the expected component type.
--
-- (B) Determine the bounds of the positional sub-aggregates.
--
-- 4. Try to determine statically whether the evaluation of the array
-- sub-aggregate raises Constraint_Error. If yes emit proper
-- warnings. The precise checks are the following:
--
-- (A) Check that the index range defined by aggregate bounds is
-- compatible with corresponding index subtype.
-- We also check against the base type. In fact it could be that
-- Low/High bounds of the base type are static whereas those of
-- the index subtype are not. Thus if we can statically catch
-- a problem with respect to the base type we are guaranteed
-- that the same problem will arise with the index subtype
--
-- (B) If we are dealing with a named aggregate containing an others
-- choice and at least one discrete choice then make sure the range
-- specified by the discrete choices does not overflow the
-- aggregate bounds. We also check against the index type and base
-- type bounds for the same reasons given in (A).
--
-- (C) If we are dealing with a positional aggregate with an others
-- choice make sure the number of positional elements specified
-- does not overflow the aggregate bounds. We also check against
-- the index type and base type bounds as mentioned in (A).
--
-- Finally construct an N_Range node giving the sub-aggregate bounds.
-- Set the Aggregate_Bounds field of the sub-aggregate to be this
-- N_Range. The routine Array_Aggr_Subtype below uses such N_Ranges
-- to build the appropriate aggregate subtype. Aggregate_Bounds
-- information is needed during expansion.
--
-- DELAYED COMPONENT RESOLUTION: The resolution of bottom level component
-- expressions in an array aggregate may call Duplicate_Subexpr or some
-- other routine that inserts code just outside the outermost aggregate.
-- If the array aggregate contains discrete choices or an others choice,
-- this may be wrong. Consider for instance the following example.
--
-- type Rec is record
-- V : Integer := 0;
-- end record;
--
-- type Acc_Rec is access Rec;
-- Arr : array (1..3) of Acc_Rec := (1 .. 3 => new Rec);
--
-- Then the transformation of "new Rec" that occurs during resolution
-- entails the following code modifications
--
-- P7b : constant Acc_Rec := new Rec;
-- RecIP (P7b.all);
-- Arr : array (1..3) of Acc_Rec := (1 .. 3 => P7b);
--
-- This code transformation is clearly wrong, since we need to call
-- "new Rec" for each of the 3 array elements. To avoid this problem we
-- delay resolution of the components of non positional array aggregates
-- to the expansion phase. As an optimization, if the discrete choice
-- specifies a single value we do not delay resolution.
function Array_Aggr_Subtype (N : Node_Id; Typ : Node_Id) return Entity_Id;
-- This routine returns the type or subtype of an array aggregate.
--
-- N is the array aggregate node whose type we return.
--
-- Typ is the context type in which N occurs.
--
-- This routine creates an implicit array subtype whose bounds are
-- those defined by the aggregate. When this routine is invoked
-- Resolve_Array_Aggregate has already processed aggregate N. Thus the
-- Aggregate_Bounds of each sub-aggregate, is an N_Range node giving the
-- sub-aggregate bounds. When building the aggregate itype, this function
-- traverses the array aggregate N collecting such Aggregate_Bounds and
-- constructs the proper array aggregate itype.
--
-- Note that in the case of multidimensional aggregates each inner
-- sub-aggregate corresponding to a given array dimension, may provide a
-- different bounds. If it is possible to determine statically that
-- some sub-aggregates corresponding to the same index do not have the
-- same bounds, then a warning is emitted. If such check is not possible
-- statically (because some sub-aggregate bounds are dynamic expressions)
-- then this job is left to the expander. In all cases the particular
-- bounds that this function will chose for a given dimension is the first
-- N_Range node for a sub-aggregate corresponding to that dimension.
--
-- Note that the Raises_Constraint_Error flag of an array aggregate
-- whose evaluation is determined to raise CE by Resolve_Array_Aggregate,
-- is set in Resolve_Array_Aggregate but the aggregate is not
-- immediately replaced with a raise CE. In fact, Array_Aggr_Subtype must
-- first construct the proper itype for the aggregate (Gigi needs
-- this). After constructing the proper itype we will eventually replace
-- the top-level aggregate with a raise CE (done in Resolve_Aggregate).
-- Of course in cases such as:
--
-- type Arr is array (integer range <>) of Integer;
-- A : Arr := (positive range -1 .. 2 => 0);
--
-- The bounds of the aggregate itype are cooked up to look reasonable
-- (in this particular case the bounds will be 1 .. 2).
procedure Make_String_Into_Aggregate (N : Node_Id);
-- A string literal can appear in a context in which a one dimensional
-- array of characters is expected. This procedure simply rewrites the
-- string as an aggregate, prior to resolution.
---------------------------------
-- Delta aggregate processing --
---------------------------------
procedure Resolve_Delta_Array_Aggregate (N : Node_Id; Typ : Entity_Id);
procedure Resolve_Delta_Record_Aggregate (N : Node_Id; Typ : Entity_Id);
------------------------
-- Array_Aggr_Subtype --
------------------------
function Array_Aggr_Subtype
(N : Node_Id;
Typ : Entity_Id) return Entity_Id
is
Aggr_Dimension : constant Pos := Number_Dimensions (Typ);
-- Number of aggregate index dimensions
Aggr_Range : array (1 .. Aggr_Dimension) of Node_Id := (others => Empty);
-- Constrained N_Range of each index dimension in our aggregate itype
Aggr_Low : array (1 .. Aggr_Dimension) of Node_Id := (others => Empty);
Aggr_High : array (1 .. Aggr_Dimension) of Node_Id := (others => Empty);
-- Low and High bounds for each index dimension in our aggregate itype
Is_Fully_Positional : Boolean := True;
procedure Collect_Aggr_Bounds (N : Node_Id; Dim : Pos);
-- N is an array (sub-)aggregate. Dim is the dimension corresponding
-- to (sub-)aggregate N. This procedure collects and removes the side
-- effects of the constrained N_Range nodes corresponding to each index
-- dimension of our aggregate itype. These N_Range nodes are collected
-- in Aggr_Range above.
--
-- Likewise collect in Aggr_Low & Aggr_High above the low and high
-- bounds of each index dimension. If, when collecting, two bounds
-- corresponding to the same dimension are static and found to differ,
-- then emit a warning, and mark N as raising Constraint_Error.
-------------------------
-- Collect_Aggr_Bounds --
-------------------------
procedure Collect_Aggr_Bounds (N : Node_Id; Dim : Pos) is
This_Range : constant Node_Id := Aggregate_Bounds (N);
-- The aggregate range node of this specific sub-aggregate
This_Low : constant Node_Id := Low_Bound (Aggregate_Bounds (N));
This_High : constant Node_Id := High_Bound (Aggregate_Bounds (N));
-- The aggregate bounds of this specific sub-aggregate
Assoc : Node_Id;
Expr : Node_Id;
begin
Remove_Side_Effects (This_Low, Variable_Ref => True);
Remove_Side_Effects (This_High, Variable_Ref => True);
-- Collect the first N_Range for a given dimension that you find.
-- For a given dimension they must be all equal anyway.
if No (Aggr_Range (Dim)) then
Aggr_Low (Dim) := This_Low;
Aggr_High (Dim) := This_High;
Aggr_Range (Dim) := This_Range;
else
if Compile_Time_Known_Value (This_Low) then
if not Compile_Time_Known_Value (Aggr_Low (Dim)) then
Aggr_Low (Dim) := This_Low;
elsif Expr_Value (This_Low) /= Expr_Value (Aggr_Low (Dim)) then
Set_Raises_Constraint_Error (N);
Error_Msg_Warn := SPARK_Mode /= On;
Error_Msg_N ("sub-aggregate low bound mismatch<<", N);
Error_Msg_N ("\Constraint_Error [<<", N);
end if;
end if;
if Compile_Time_Known_Value (This_High) then
if not Compile_Time_Known_Value (Aggr_High (Dim)) then
Aggr_High (Dim) := This_High;
elsif
Expr_Value (This_High) /= Expr_Value (Aggr_High (Dim))
then
Set_Raises_Constraint_Error (N);
Error_Msg_Warn := SPARK_Mode /= On;
Error_Msg_N ("sub-aggregate high bound mismatch<<", N);
Error_Msg_N ("\Constraint_Error [<<", N);
end if;
end if;
end if;
if Dim < Aggr_Dimension then
-- Process positional components
if Present (Expressions (N)) then
Expr := First (Expressions (N));
while Present (Expr) loop
Collect_Aggr_Bounds (Expr, Dim + 1);
Next (Expr);
end loop;
end if;
-- Process component associations
if Present (Component_Associations (N)) then
Is_Fully_Positional := False;
Assoc := First (Component_Associations (N));
while Present (Assoc) loop
Expr := Expression (Assoc);
Collect_Aggr_Bounds (Expr, Dim + 1);
Next (Assoc);
end loop;
end if;
end if;
end Collect_Aggr_Bounds;
-- Array_Aggr_Subtype variables
Itype : Entity_Id;
-- The final itype of the overall aggregate
Index_Constraints : constant List_Id := New_List;
-- The list of index constraints of the aggregate itype
-- Start of processing for Array_Aggr_Subtype
begin
-- Make sure that the list of index constraints is properly attached to
-- the tree, and then collect the aggregate bounds.
Set_Parent (Index_Constraints, N);
Collect_Aggr_Bounds (N, 1);
-- Build the list of constrained indexes of our aggregate itype
for J in 1 .. Aggr_Dimension loop
Create_Index : declare
Index_Base : constant Entity_Id :=
Base_Type (Etype (Aggr_Range (J)));
Index_Typ : Entity_Id;
begin
-- Construct the Index subtype, and associate it with the range
-- construct that generates it.
Index_Typ :=
Create_Itype (Subtype_Kind (Ekind (Index_Base)), Aggr_Range (J));
Set_Etype (Index_Typ, Index_Base);
if Is_Character_Type (Index_Base) then
Set_Is_Character_Type (Index_Typ);
end if;
Set_Size_Info (Index_Typ, (Index_Base));
Set_RM_Size (Index_Typ, RM_Size (Index_Base));
Set_First_Rep_Item (Index_Typ, First_Rep_Item (Index_Base));
Set_Scalar_Range (Index_Typ, Aggr_Range (J));
if Is_Discrete_Or_Fixed_Point_Type (Index_Typ) then
Set_RM_Size (Index_Typ, UI_From_Int (Minimum_Size (Index_Typ)));
end if;
Set_Etype (Aggr_Range (J), Index_Typ);
Append (Aggr_Range (J), To => Index_Constraints);
end Create_Index;
end loop;
-- Now build the Itype
Itype := Create_Itype (E_Array_Subtype, N);
Set_First_Rep_Item (Itype, First_Rep_Item (Typ));
Set_Convention (Itype, Convention (Typ));
Set_Depends_On_Private (Itype, Has_Private_Component (Typ));
Set_Etype (Itype, Base_Type (Typ));
Set_Has_Alignment_Clause (Itype, Has_Alignment_Clause (Typ));
Set_Is_Aliased (Itype, Is_Aliased (Typ));
Set_Is_Independent (Itype, Is_Independent (Typ));
Set_Depends_On_Private (Itype, Depends_On_Private (Typ));
Copy_Suppress_Status (Index_Check, Typ, Itype);
Copy_Suppress_Status (Length_Check, Typ, Itype);
Set_First_Index (Itype, First (Index_Constraints));
Set_Is_Constrained (Itype, True);
Set_Is_Internal (Itype, True);
if Has_Predicates (Typ) then
Set_Has_Predicates (Itype);
-- If the base type has a predicate, capture the predicated parent
-- or the existing predicate function for SPARK use.
if Present (Predicate_Function (Typ)) then
Set_Predicate_Function (Itype, Predicate_Function (Typ));
elsif Is_Itype (Typ) then
Set_Predicated_Parent (Itype, Predicated_Parent (Typ));
else
Set_Predicated_Parent (Itype, Typ);
end if;
end if;
-- A simple optimization: purely positional aggregates of static
-- components should be passed to gigi unexpanded whenever possible, and
-- regardless of the staticness of the bounds themselves. Subsequent
-- checks in exp_aggr verify that type is not packed, etc.
Set_Size_Known_At_Compile_Time
(Itype,
Is_Fully_Positional
and then Comes_From_Source (N)
and then Size_Known_At_Compile_Time (Component_Type (Typ)));
-- We always need a freeze node for a packed array subtype, so that we
-- can build the Packed_Array_Impl_Type corresponding to the subtype. If
-- expansion is disabled, the packed array subtype is not built, and we
-- must not generate a freeze node for the type, or else it will appear
-- incomplete to gigi.
if Is_Packed (Itype)
and then not In_Spec_Expression
and then Expander_Active
then
Freeze_Itype (Itype, N);
end if;
return Itype;
end Array_Aggr_Subtype;
--------------------------------
-- Check_Misspelled_Component --
--------------------------------
procedure Check_Misspelled_Component
(Elements : Elist_Id;
Component : Node_Id)
is
Max_Suggestions : constant := 2;
Nr_Of_Suggestions : Natural := 0;
Suggestion_1 : Entity_Id := Empty;
Suggestion_2 : Entity_Id := Empty;
Component_Elmt : Elmt_Id;
begin
-- All the components of List are matched against Component and a count
-- is maintained of possible misspellings. When at the end of the
-- analysis there are one or two (not more) possible misspellings,
-- these misspellings will be suggested as possible corrections.
Component_Elmt := First_Elmt (Elements);
while Nr_Of_Suggestions <= Max_Suggestions
and then Present (Component_Elmt)
loop
if Is_Bad_Spelling_Of
(Chars (Node (Component_Elmt)),
Chars (Component))
then
Nr_Of_Suggestions := Nr_Of_Suggestions + 1;
case Nr_Of_Suggestions is
when 1 => Suggestion_1 := Node (Component_Elmt);
when 2 => Suggestion_2 := Node (Component_Elmt);
when others => null;
end case;
end if;
Next_Elmt (Component_Elmt);
end loop;
-- Report at most two suggestions
if Nr_Of_Suggestions = 1 then
Error_Msg_NE -- CODEFIX
("\possible misspelling of&", Component, Suggestion_1);
elsif Nr_Of_Suggestions = 2 then
Error_Msg_Node_2 := Suggestion_2;
Error_Msg_NE -- CODEFIX
("\possible misspelling of& or&", Component, Suggestion_1);
end if;
end Check_Misspelled_Component;
----------------------------------------
-- Check_Expr_OK_In_Limited_Aggregate --
----------------------------------------
procedure Check_Expr_OK_In_Limited_Aggregate (Expr : Node_Id) is
begin
if Is_Limited_Type (Etype (Expr))
and then Comes_From_Source (Expr)
then
if In_Instance_Body or else In_Inlined_Body then
null;
elsif not OK_For_Limited_Init (Etype (Expr), Expr) then
Error_Msg_N
("initialization not allowed for limited types", Expr);
Explain_Limited_Type (Etype (Expr), Expr);
end if;
end if;
end Check_Expr_OK_In_Limited_Aggregate;
-------------------------
-- Is_Others_Aggregate --
-------------------------
function Is_Others_Aggregate (Aggr : Node_Id) return Boolean is
Assoc : constant List_Id := Component_Associations (Aggr);
begin
return No (Expressions (Aggr))
and then Nkind (First (Choice_List (First (Assoc)))) = N_Others_Choice;
end Is_Others_Aggregate;
-------------------------
-- Is_Single_Aggregate --
-------------------------
function Is_Single_Aggregate (Aggr : Node_Id) return Boolean is
Assoc : constant List_Id := Component_Associations (Aggr);
begin
return No (Expressions (Aggr))
and then No (Next (First (Assoc)))
and then No (Next (First (Choice_List (First (Assoc)))));
end Is_Single_Aggregate;
--------------------------------
-- Make_String_Into_Aggregate --
--------------------------------
procedure Make_String_Into_Aggregate (N : Node_Id) is
Exprs : constant List_Id := New_List;
Loc : constant Source_Ptr := Sloc (N);
Str : constant String_Id := Strval (N);
Strlen : constant Nat := String_Length (Str);
C : Char_Code;
C_Node : Node_Id;
New_N : Node_Id;
P : Source_Ptr;
begin
P := Loc + 1;
for J in 1 .. Strlen loop
C := Get_String_Char (Str, J);
Set_Character_Literal_Name (C);
C_Node :=
Make_Character_Literal (P,
Chars => Name_Find,
Char_Literal_Value => UI_From_CC (C));
Set_Etype (C_Node, Any_Character);
Append_To (Exprs, C_Node);
P := P + 1;
-- Something special for wide strings???
end loop;
New_N := Make_Aggregate (Loc, Expressions => Exprs);
Set_Analyzed (New_N);
Set_Etype (New_N, Any_Composite);
Rewrite (N, New_N);
end Make_String_Into_Aggregate;
-----------------------
-- Resolve_Aggregate --
-----------------------
procedure Resolve_Aggregate (N : Node_Id; Typ : Entity_Id) is
Loc : constant Source_Ptr := Sloc (N);
Aggr_Subtyp : Entity_Id;
-- The actual aggregate subtype. This is not necessarily the same as Typ
-- which is the subtype of the context in which the aggregate was found.
Others_Box : Boolean := False;
-- Set to True if N represents a simple aggregate with only
-- (others => <>), not nested as part of another aggregate.
function Within_Aggregate (N : Node_Id) return Boolean;
-- Return True if N is part of an N_Aggregate
----------------------
-- Within_Aggregate --
----------------------
function Within_Aggregate (N : Node_Id) return Boolean is
P : Node_Id := Parent (N);
begin
while Present (P) loop
if Nkind (P) = N_Aggregate then
return True;
end if;
P := Parent (P);
end loop;
return False;
end Within_Aggregate;
begin
-- Ignore junk empty aggregate resulting from parser error
if No (Expressions (N))
and then No (Component_Associations (N))
and then not Null_Record_Present (N)
then
return;
end if;
-- If the aggregate has box-initialized components, its type must be
-- frozen so that initialization procedures can properly be called
-- in the resolution that follows. The replacement of boxes with
-- initialization calls is properly an expansion activity but it must
-- be done during resolution.
if Expander_Active
and then Present (Component_Associations (N))
then
declare
Comp : Node_Id;
First_Comp : Boolean := True;
begin
Comp := First (Component_Associations (N));
while Present (Comp) loop
if Box_Present (Comp) then
if First_Comp
and then No (Expressions (N))
and then Nkind (First (Choices (Comp))) = N_Others_Choice
and then not Within_Aggregate (N)
then
Others_Box := True;
end if;
Insert_Actions (N, Freeze_Entity (Typ, N));
exit;
end if;
First_Comp := False;
Next (Comp);
end loop;
end;
end if;
-- Check for aggregates not allowed in configurable run-time mode.
-- We allow all cases of aggregates that do not come from source, since
-- these are all assumed to be small (e.g. bounds of a string literal).
-- We also allow aggregates of types we know to be small.
if not Support_Aggregates_On_Target
and then Comes_From_Source (N)
and then (not Known_Static_Esize (Typ)
or else Esize (Typ) > System_Max_Integer_Size)
then
Error_Msg_CRT ("aggregate", N);
end if;
-- Ada 2005 (AI-287): Limited aggregates allowed
-- In an instance, ignore aggregate subcomponents tnat may be limited,
-- because they originate in view conflicts. If the original aggregate
-- is legal and the actuals are legal, the aggregate itself is legal.
if Is_Limited_Type (Typ)
and then Ada_Version < Ada_2005
and then not In_Instance
then
Error_Msg_N ("aggregate type cannot be limited", N);
Explain_Limited_Type (Typ, N);
elsif Is_Class_Wide_Type (Typ) then
Error_Msg_N ("type of aggregate cannot be class-wide", N);
elsif Typ = Any_String
or else Typ = Any_Composite
then
Error_Msg_N ("no unique type for aggregate", N);
Set_Etype (N, Any_Composite);
elsif Is_Array_Type (Typ) and then Null_Record_Present (N) then
Error_Msg_N ("null record forbidden in array aggregate", N);
elsif Present (Find_Aspect (Typ, Aspect_Aggregate))
and then Ekind (Typ) /= E_Record_Type
then
Resolve_Container_Aggregate (N, Typ);
elsif Is_Record_Type (Typ) then
Resolve_Record_Aggregate (N, Typ);
elsif Is_Array_Type (Typ) then
-- First a special test, for the case of a positional aggregate of
-- characters which can be replaced by a string literal.
-- Do not perform this transformation if this was a string literal
-- to start with, whose components needed constraint checks, or if
-- the component type is non-static, because it will require those
-- checks and be transformed back into an aggregate. If the index
-- type is not Integer the aggregate may represent a user-defined
-- string type but the context might need the original type so we
-- do not perform the transformation at this point.
if Number_Dimensions (Typ) = 1
and then Is_Standard_Character_Type (Component_Type (Typ))
and then No (Component_Associations (N))
and then not Is_Limited_Composite (Typ)
and then not Is_Private_Composite (Typ)
and then not Is_Bit_Packed_Array (Typ)
and then Nkind (Original_Node (Parent (N))) /= N_String_Literal
and then Is_OK_Static_Subtype (Component_Type (Typ))
and then Base_Type (Etype (First_Index (Typ))) =
Base_Type (Standard_Integer)
then
declare
Expr : Node_Id;
begin
Expr := First (Expressions (N));
while Present (Expr) loop
exit when Nkind (Expr) /= N_Character_Literal;
Next (Expr);
end loop;
if No (Expr) then
Start_String;
Expr := First (Expressions (N));
while Present (Expr) loop
Store_String_Char (UI_To_CC (Char_Literal_Value (Expr)));
Next (Expr);
end loop;
Rewrite (N, Make_String_Literal (Loc, End_String));
Analyze_And_Resolve (N, Typ);
return;
end if;
end;
end if;
-- Here if we have a real aggregate to deal with
Array_Aggregate : declare
Aggr_Resolved : Boolean;
Aggr_Typ : constant Entity_Id := Etype (Typ);
-- This is the unconstrained array type, which is the type against
-- which the aggregate is to be resolved. Typ itself is the array
-- type of the context which may not be the same subtype as the
-- subtype for the final aggregate.
begin
-- In the following we determine whether an OTHERS choice is
-- allowed inside the array aggregate. The test checks the context
-- in which the array aggregate occurs. If the context does not
-- permit it, or the aggregate type is unconstrained, an OTHERS
-- choice is not allowed (except that it is always allowed on the
-- right-hand side of an assignment statement; in this case the
-- constrainedness of the type doesn't matter, because an array
-- object is always constrained).
-- If expansion is disabled (generic context, or semantics-only
-- mode) actual subtypes cannot be constructed, and the type of an
-- object may be its unconstrained nominal type. However, if the
-- context is an assignment statement, OTHERS is allowed, because
-- the target of the assignment will have a constrained subtype
-- when fully compiled. Ditto if the context is an initialization
-- procedure where a component may have a predicate function that
-- carries the base type.
-- Note that there is no node for Explicit_Actual_Parameter.
-- To test for this context we therefore have to test for node
-- N_Parameter_Association which itself appears only if there is a
-- formal parameter. Consequently we also need to test for
-- N_Procedure_Call_Statement or N_Function_Call.
-- The context may be an N_Reference node, created by expansion.
-- Legality of the others clause was established in the source,
-- so the context is legal.
Set_Etype (N, Aggr_Typ); -- May be overridden later on
if Nkind (Parent (N)) = N_Assignment_Statement
or else Inside_Init_Proc
or else (Is_Constrained (Typ)
and then Nkind (Parent (N)) in
N_Parameter_Association
| N_Function_Call
| N_Procedure_Call_Statement
| N_Generic_Association
| N_Formal_Object_Declaration
| N_Simple_Return_Statement
| N_Object_Declaration
| N_Component_Declaration
| N_Parameter_Specification
| N_Qualified_Expression
| N_Reference
| N_Aggregate
| N_Extension_Aggregate
| N_Component_Association
| N_Case_Expression_Alternative
| N_If_Expression
| N_Expression_With_Actions)
then
Aggr_Resolved :=
Resolve_Array_Aggregate
(N,
Index => First_Index (Aggr_Typ),
Index_Constr => First_Index (Typ),
Component_Typ => Component_Type (Typ),
Others_Allowed => True);
else
Aggr_Resolved :=
Resolve_Array_Aggregate
(N,
Index => First_Index (Aggr_Typ),
Index_Constr => First_Index (Aggr_Typ),
Component_Typ => Component_Type (Typ),
Others_Allowed => False);
end if;
if not Aggr_Resolved then
-- A parenthesized expression may have been intended as an
-- aggregate, leading to a type error when analyzing the
-- component. This can also happen for a nested component
-- (see Analyze_Aggr_Expr).
if Paren_Count (N) > 0 then
Error_Msg_N
("positional aggregate cannot have one component", N);
end if;
Aggr_Subtyp := Any_Composite;
else
Aggr_Subtyp := Array_Aggr_Subtype (N, Typ);
end if;
Set_Etype (N, Aggr_Subtyp);
end Array_Aggregate;
elsif Is_Private_Type (Typ)
and then Present (Full_View (Typ))
and then (In_Inlined_Body or In_Instance_Body)
and then Is_Composite_Type (Full_View (Typ))
then
Resolve (N, Full_View (Typ));
else
Error_Msg_N ("illegal context for aggregate", N);
end if;
-- If we can determine statically that the evaluation of the aggregate
-- raises Constraint_Error, then replace the aggregate with an
-- N_Raise_Constraint_Error node, but set the Etype to the right
-- aggregate subtype. Gigi needs this.
if Raises_Constraint_Error (N) then
Aggr_Subtyp := Etype (N);
Rewrite (N,
Make_Raise_Constraint_Error (Loc, Reason => CE_Range_Check_Failed));
Set_Raises_Constraint_Error (N);
Set_Etype (N, Aggr_Subtyp);
Set_Analyzed (N);
end if;
if Warn_On_No_Value_Assigned
and then Others_Box
and then not Is_Fully_Initialized_Type (Etype (N))
then
Error_Msg_N ("?v?aggregate not fully initialized", N);
end if;
Check_Function_Writable_Actuals (N);
end Resolve_Aggregate;
-----------------------------
-- Resolve_Array_Aggregate --
-----------------------------
function Resolve_Array_Aggregate
(N : Node_Id;
Index : Node_Id;
Index_Constr : Node_Id;
Component_Typ : Entity_Id;
Others_Allowed : Boolean) return Boolean
is
Loc : constant Source_Ptr := Sloc (N);
Failure : constant Boolean := False;
Success : constant Boolean := True;
Index_Typ : constant Entity_Id := Etype (Index);
Index_Typ_Low : constant Node_Id := Type_Low_Bound (Index_Typ);
Index_Typ_High : constant Node_Id := Type_High_Bound (Index_Typ);
-- The type of the index corresponding to the array sub-aggregate along
-- with its low and upper bounds.
Index_Base : constant Entity_Id := Base_Type (Index_Typ);
Index_Base_Low : constant Node_Id := Type_Low_Bound (Index_Base);
Index_Base_High : constant Node_Id := Type_High_Bound (Index_Base);
-- Ditto for the base type
Others_Present : Boolean := False;
Nb_Choices : Nat := 0;
-- Contains the overall number of named choices in this sub-aggregate
function Add (Val : Uint; To : Node_Id) return Node_Id;
-- Creates a new expression node where Val is added to expression To.
-- Tries to constant fold whenever possible. To must be an already
-- analyzed expression.
procedure Check_Bound (BH : Node_Id; AH : in out Node_Id);
-- Checks that AH (the upper bound of an array aggregate) is less than
-- or equal to BH (the upper bound of the index base type). If the check
-- fails, a warning is emitted, the Raises_Constraint_Error flag of N is
-- set, and AH is replaced with a duplicate of BH.
procedure Check_Bounds (L, H : Node_Id; AL, AH : Node_Id);
-- Checks that range AL .. AH is compatible with range L .. H. Emits a
-- warning if not and sets the Raises_Constraint_Error flag in N.
procedure Check_Length (L, H : Node_Id; Len : Uint);
-- Checks that range L .. H contains at least Len elements. Emits a
-- warning if not and sets the Raises_Constraint_Error flag in N.
function Dynamic_Or_Null_Range (L, H : Node_Id) return Boolean;
-- Returns True if range L .. H is dynamic or null
procedure Get (Value : out Uint; From : Node_Id; OK : out Boolean);
-- Given expression node From, this routine sets OK to False if it
-- cannot statically evaluate From. Otherwise it stores this static
-- value into Value.
function Resolve_Aggr_Expr
(Expr : Node_Id;
Single_Elmt : Boolean) return Boolean;
-- Resolves aggregate expression Expr. Returns False if resolution
-- fails. If Single_Elmt is set to False, the expression Expr may be
-- used to initialize several array aggregate elements (this can happen
-- for discrete choices such as "L .. H => Expr" or the OTHERS choice).
-- In this event we do not resolve Expr unless expansion is disabled.
-- To know why, see the DELAYED COMPONENT RESOLUTION note above.
--
-- NOTE: In the case of "... => <>", we pass the in the
-- N_Component_Association node as Expr, since there is no Expression in
-- that case, and we need a Sloc for the error message.
procedure Resolve_Iterated_Component_Association
(N : Node_Id;
Index_Typ : Entity_Id);
-- For AI12-061
---------
-- Add --
---------
function Add (Val : Uint; To : Node_Id) return Node_Id is
Expr_Pos : Node_Id;
Expr : Node_Id;
To_Pos : Node_Id;
begin
if Raises_Constraint_Error (To) then
return To;
end if;
-- First test if we can do constant folding
if Compile_Time_Known_Value (To)
or else Nkind (To) = N_Integer_Literal
then
Expr_Pos := Make_Integer_Literal (Loc, Expr_Value (To) + Val);
Set_Is_Static_Expression (Expr_Pos);
Set_Etype (Expr_Pos, Etype (To));
Set_Analyzed (Expr_Pos, Analyzed (To));
if not Is_Enumeration_Type (Index_Typ) then
Expr := Expr_Pos;
-- If we are dealing with enumeration return
-- Index_Typ'Val (Expr_Pos)
else
Expr :=
Make_Attribute_Reference
(Loc,
Prefix => New_Occurrence_Of (Index_Typ, Loc),
Attribute_Name => Name_Val,
Expressions => New_List (Expr_Pos));
end if;
return Expr;
end if;
-- If we are here no constant folding possible
if not Is_Enumeration_Type (Index_Base) then
Expr :=
Make_Op_Add (Loc,
Left_Opnd => Duplicate_Subexpr (To),
Right_Opnd => Make_Integer_Literal (Loc, Val));
-- If we are dealing with enumeration return
-- Index_Typ'Val (Index_Typ'Pos (To) + Val)
else
To_Pos :=
Make_Attribute_Reference
(Loc,
Prefix => New_Occurrence_Of (Index_Typ, Loc),
Attribute_Name => Name_Pos,
Expressions => New_List (Duplicate_Subexpr (To)));
Expr_Pos :=
Make_Op_Add (Loc,
Left_Opnd => To_Pos,
Right_Opnd => Make_Integer_Literal (Loc, Val));
Expr :=
Make_Attribute_Reference
(Loc,
Prefix => New_Occurrence_Of (Index_Typ, Loc),
Attribute_Name => Name_Val,
Expressions => New_List (Expr_Pos));
-- If the index type has a non standard representation, the
-- attributes 'Val and 'Pos expand into function calls and the
-- resulting expression is considered non-safe for reevaluation
-- by the backend. Relocate it into a constant temporary in order
-- to make it safe for reevaluation.
if Has_Non_Standard_Rep (Etype (N)) then
declare
Def_Id : Entity_Id;
begin
Def_Id := Make_Temporary (Loc, 'R', Expr);
Set_Etype (Def_Id, Index_Typ);
Insert_Action (N,
Make_Object_Declaration (Loc,
Defining_Identifier => Def_Id,
Object_Definition =>
New_Occurrence_Of (Index_Typ, Loc),
Constant_Present => True,
Expression => Relocate_Node (Expr)));
Expr := New_Occurrence_Of (Def_Id, Loc);
end;
end if;
end if;
return Expr;
end Add;
-----------------
-- Check_Bound --
-----------------
procedure Check_Bound (BH : Node_Id; AH : in out Node_Id) is
Val_BH : Uint;
Val_AH : Uint;
OK_BH : Boolean;
OK_AH : Boolean;
begin
Get (Value => Val_BH, From => BH, OK => OK_BH);
Get (Value => Val_AH, From => AH, OK => OK_AH);
if OK_BH and then OK_AH and then Val_BH < Val_AH then
Set_Raises_Constraint_Error (N);
Error_Msg_Warn := SPARK_Mode /= On;
Error_Msg_N ("upper bound out of range<<", AH);
Error_Msg_N ("\Constraint_Error [<<", AH);
-- You need to set AH to BH or else in the case of enumerations
-- indexes we will not be able to resolve the aggregate bounds.
AH := Duplicate_Subexpr (BH);
end if;
end Check_Bound;
------------------
-- Check_Bounds --
------------------
procedure Check_Bounds (L, H : Node_Id; AL, AH : Node_Id) is
Val_L : Uint;
Val_H : Uint;
Val_AL : Uint;
Val_AH : Uint;
OK_L : Boolean;
OK_H : Boolean;
OK_AL : Boolean;
OK_AH : Boolean;
pragma Warnings (Off, OK_AL);
pragma Warnings (Off, OK_AH);
begin
if Raises_Constraint_Error (N)
or else Dynamic_Or_Null_Range (AL, AH)
then
return;
end if;
Get (Value => Val_L, From => L, OK => OK_L);
Get (Value => Val_H, From => H, OK => OK_H);
Get (Value => Val_AL, From => AL, OK => OK_AL);
Get (Value => Val_AH, From => AH, OK => OK_AH);
if OK_L and then Val_L > Val_AL then
Set_Raises_Constraint_Error (N);
Error_Msg_Warn := SPARK_Mode /= On;
Error_Msg_N ("lower bound of aggregate out of range<<", N);
Error_Msg_N ("\Constraint_Error [<<", N);
end if;
if OK_H and then Val_H < Val_AH then
Set_Raises_Constraint_Error (N);
Error_Msg_Warn := SPARK_Mode /= On;
Error_Msg_N ("upper bound of aggregate out of range<<", N);
Error_Msg_N ("\Constraint_Error [<<", N);
end if;
end Check_Bounds;
------------------
-- Check_Length --
------------------
procedure Check_Length (L, H : Node_Id; Len : Uint) is
Val_L : Uint;
Val_H : Uint;
OK_L : Boolean;
OK_H : Boolean;
Range_Len : Uint;
begin
if Raises_Constraint_Error (N) then
return;
end if;
Get (Value => Val_L, From => L, OK => OK_L);
Get (Value => Val_H, From => H, OK => OK_H);
if not OK_L or else not OK_H then
return;
end if;
-- If null range length is zero
if Val_L > Val_H then
Range_Len := Uint_0;
else
Range_Len := Val_H - Val_L + 1;
end if;
if Range_Len < Len then
Set_Raises_Constraint_Error (N);
Error_Msg_Warn := SPARK_Mode /= On;
Error_Msg_N ("too many elements<<", N);
Error_Msg_N ("\Constraint_Error [<<", N);
end if;
end Check_Length;
---------------------------
-- Dynamic_Or_Null_Range --
---------------------------
function Dynamic_Or_Null_Range (L, H : Node_Id) return Boolean is
Val_L : Uint;
Val_H : Uint;
OK_L : Boolean;
OK_H : Boolean;
begin
Get (Value => Val_L, From => L, OK => OK_L);
Get (Value => Val_H, From => H, OK => OK_H);
return not OK_L or else not OK_H
or else not Is_OK_Static_Expression (L)
or else not Is_OK_Static_Expression (H)
or else Val_L > Val_H;
end Dynamic_Or_Null_Range;
---------
-- Get --
---------
procedure Get (Value : out Uint; From : Node_Id; OK : out Boolean) is
begin
OK := True;
if Compile_Time_Known_Value (From) then
Value := Expr_Value (From);
-- If expression From is something like Some_Type'Val (10) then
-- Value = 10.
elsif Nkind (From) = N_Attribute_Reference
and then Attribute_Name (From) = Name_Val
and then Compile_Time_Known_Value (First (Expressions (From)))
then
Value := Expr_Value (First (Expressions (From)));
else
Value := Uint_0;
OK := False;
end if;
end Get;
-----------------------
-- Resolve_Aggr_Expr --
-----------------------
function Resolve_Aggr_Expr
(Expr : Node_Id;
Single_Elmt : Boolean) return Boolean
is
Nxt_Ind : constant Node_Id := Next_Index (Index);
Nxt_Ind_Constr : constant Node_Id := Next_Index (Index_Constr);
-- Index is the current index corresponding to the expression
Resolution_OK : Boolean := True;
-- Set to False if resolution of the expression failed
begin
-- Defend against previous errors
if Nkind (Expr) = N_Error
or else Error_Posted (Expr)
then
return True;
end if;
-- If the array type against which we are resolving the aggregate
-- has several dimensions, the expressions nested inside the
-- aggregate must be further aggregates (or strings).
if Present (Nxt_Ind) then
if Nkind (Expr) /= N_Aggregate then
-- A string literal can appear where a one-dimensional array
-- of characters is expected. If the literal looks like an
-- operator, it is still an operator symbol, which will be
-- transformed into a string when analyzed.
if Is_Character_Type (Component_Typ)
and then No (Next_Index (Nxt_Ind))
and then Nkind (Expr) in N_String_Literal | N_Operator_Symbol
then
-- A string literal used in a multidimensional array
-- aggregate in place of the final one-dimensional
-- aggregate must not be enclosed in parentheses.
if Paren_Count (Expr) /= 0 then
Error_Msg_N ("no parenthesis allowed here", Expr);
end if;
Make_String_Into_Aggregate (Expr);
else
Error_Msg_N ("nested array aggregate expected", Expr);
-- If the expression is parenthesized, this may be
-- a missing component association for a 1-aggregate.
if Paren_Count (Expr) > 0 then
Error_Msg_N
("\if single-component aggregate is intended, "
& "write e.g. (1 ='> ...)", Expr);
end if;
return Failure;
end if;
end if;
-- If it's "... => <>", nothing to resolve
if Nkind (Expr) = N_Component_Association then
pragma Assert (Box_Present (Expr));
return Success;
end if;
-- Ada 2005 (AI-231): Propagate the type to the nested aggregate.
-- Required to check the null-exclusion attribute (if present).
-- This value may be overridden later on.
Set_Etype (Expr, Etype (N));
Resolution_OK := Resolve_Array_Aggregate
(Expr, Nxt_Ind, Nxt_Ind_Constr, Component_Typ, Others_Allowed);
else
-- If it's "... => <>", nothing to resolve
if Nkind (Expr) = N_Component_Association then
pragma Assert (Box_Present (Expr));
return Success;
end if;
-- Do not resolve the expressions of discrete or others choices
-- unless the expression covers a single component, or the
-- expander is inactive.
-- In SPARK mode, expressions that can perform side effects will
-- be recognized by the gnat2why back-end, and the whole
-- subprogram will be ignored. So semantic analysis can be
-- performed safely.
if Single_Elmt
or else not Expander_Active
or else In_Spec_Expression
then
Analyze_And_Resolve (Expr, Component_Typ);
Check_Expr_OK_In_Limited_Aggregate (Expr);
Check_Non_Static_Context (Expr);
Aggregate_Constraint_Checks (Expr, Component_Typ);
Check_Unset_Reference (Expr);
end if;
end if;
-- If an aggregate component has a type with predicates, an explicit
-- predicate check must be applied, as for an assignment statement,
-- because the aggregate might not be expanded into individual
-- component assignments. If the expression covers several components
-- the analysis and the predicate check take place later.
if Has_Predicates (Component_Typ)
and then Analyzed (Expr)
then
Apply_Predicate_Check (Expr, Component_Typ);
end if;
if Raises_Constraint_Error (Expr)
and then Nkind (Parent (Expr)) /= N_Component_Association
then
Set_Raises_Constraint_Error (N);
end if;
-- If the expression has been marked as requiring a range check,
-- then generate it here. It's a bit odd to be generating such
-- checks in the analyzer, but harmless since Generate_Range_Check
-- does nothing (other than making sure Do_Range_Check is set) if
-- the expander is not active.
if Do_Range_Check (Expr) then
Generate_Range_Check (Expr, Component_Typ, CE_Range_Check_Failed);
end if;
return Resolution_OK;
end Resolve_Aggr_Expr;
--------------------------------------------
-- Resolve_Iterated_Component_Association --
--------------------------------------------
procedure Resolve_Iterated_Component_Association
(N : Node_Id;
Index_Typ : Entity_Id)
is
Loc : constant Source_Ptr := Sloc (N);
Choice : Node_Id;
Dummy : Boolean;
Ent : Entity_Id;
Expr : Node_Id;
Id : Entity_Id;
begin
-- An element iterator specification cannot appear in
-- an array aggregate because it does not provide index
-- values for the association. This must be a semantic
-- check because the parser cannot tell whether this is
-- an array aggregate or a container aggregate.
if Present (Iterator_Specification (N)) then
Error_Msg_N ("container element Iterator cannot appear "
& "in an array aggregate", N);
return;
end if;
Choice := First (Discrete_Choices (N));
while Present (Choice) loop
if Nkind (Choice) = N_Others_Choice then
Others_Present := True;
else
Analyze (Choice);
-- Choice can be a subtype name, a range, or an expression
if Is_Entity_Name (Choice)
and then Is_Type (Entity (Choice))
and then Base_Type (Entity (Choice)) = Base_Type (Index_Typ)
then
null;
else
Analyze_And_Resolve (Choice, Index_Typ);
end if;
end if;
Next (Choice);
end loop;
-- Create a scope in which to introduce an index, which is usually
-- visible in the expression for the component, and needed for its
-- analysis.
Ent := New_Internal_Entity (E_Loop, Current_Scope, Loc, 'L');
Set_Etype (Ent, Standard_Void_Type);
Set_Parent (Ent, Parent (N));
Push_Scope (Ent);
Id :=
Make_Defining_Identifier (Loc,
Chars => Chars (Defining_Identifier (N)));
-- Insert and decorate the index variable in the current scope.
-- The expression has to be analyzed once the index variable is
-- directly visible. Mark the variable as referenced to prevent
-- spurious warnings, given that subsequent uses of its name in the
-- expression will reference the internal (synonym) loop variable.
Enter_Name (Id);
Set_Etype (Id, Index_Typ);
Set_Ekind (Id, E_Variable);
Set_Scope (Id, Ent);
Set_Referenced (Id);
-- Analyze a copy of the expression, to verify legality. We use
-- a copy because the expression will be analyzed anew when the
-- enclosing aggregate is expanded, and the construct is rewritten
-- as a loop with a new index variable.
Expr := New_Copy_Tree (Expression (N));
Dummy := Resolve_Aggr_Expr (Expr, False);
-- An iterated_component_association may appear in a nested
-- aggregate for a multidimensional structure: preserve the bounds
-- computed for the expression, as well as the anonymous array
-- type generated for it; both are needed during array expansion.
-- This does not work for more than two levels of nesting. ???
if Nkind (Expr) = N_Aggregate then
Set_Aggregate_Bounds (Expression (N), Aggregate_Bounds (Expr));
Set_Etype (Expression (N), Etype (Expr));
end if;
End_Scope;
end Resolve_Iterated_Component_Association;
-- Local variables
Assoc : Node_Id;
Choice : Node_Id;
Expr : Node_Id;
Discard : Node_Id;
Aggr_Low : Node_Id := Empty;
Aggr_High : Node_Id := Empty;
-- The actual low and high bounds of this sub-aggregate
Case_Table_Size : Nat;
-- Contains the size of the case table needed to sort aggregate choices
Choices_Low : Node_Id := Empty;
Choices_High : Node_Id := Empty;
-- The lowest and highest discrete choices values for a named aggregate
Delete_Choice : Boolean;
-- Used when replacing a subtype choice with predicate by a list
Nb_Elements : Uint := Uint_0;
-- The number of elements in a positional aggregate
Nb_Discrete_Choices : Nat := 0;
-- The overall number of discrete choices (not counting others choice)
-- Start of processing for Resolve_Array_Aggregate
begin
-- Ignore junk empty aggregate resulting from parser error
if No (Expressions (N))
and then No (Component_Associations (N))
and then not Null_Record_Present (N)
then
return False;
end if;
-- STEP 1: make sure the aggregate is correctly formatted
if Present (Component_Associations (N)) then
Assoc := First (Component_Associations (N));
while Present (Assoc) loop
if Nkind (Assoc) = N_Iterated_Component_Association then
Resolve_Iterated_Component_Association (Assoc, Index_Typ);
end if;
Choice := First (Choice_List (Assoc));
Delete_Choice := False;
while Present (Choice) loop
if Nkind (Choice) = N_Others_Choice then
Others_Present := True;
if Choice /= First (Choice_List (Assoc))
or else Present (Next (Choice))
then
Error_Msg_N
("OTHERS must appear alone in a choice list", Choice);
return Failure;
end if;
if Present (Next (Assoc)) then
Error_Msg_N
("OTHERS must appear last in an aggregate", Choice);
return Failure;
end if;
if Ada_Version = Ada_83
and then Assoc /= First (Component_Associations (N))
and then Nkind (Parent (N)) in
N_Assignment_Statement | N_Object_Declaration
then
Error_Msg_N
("(Ada 83) illegal context for OTHERS choice", N);
end if;
elsif Is_Entity_Name (Choice) then
Analyze (Choice);
declare
E : constant Entity_Id := Entity (Choice);
New_Cs : List_Id;
P : Node_Id;
C : Node_Id;
begin
if Is_Type (E) and then Has_Predicates (E) then
Freeze_Before (N, E);
if Has_Dynamic_Predicate_Aspect (E) then
Error_Msg_NE
("subtype& has dynamic predicate, not allowed "
& "in aggregate choice", Choice, E);
elsif not Is_OK_Static_Subtype (E) then
Error_Msg_NE
("non-static subtype& has predicate, not allowed "
& "in aggregate choice", Choice, E);
end if;
-- If the subtype has a static predicate, replace the
-- original choice with the list of individual values
-- covered by the predicate.
-- This should be deferred to expansion time ???
if Present (Static_Discrete_Predicate (E)) then
Delete_Choice := True;
New_Cs := New_List;
P := First (Static_Discrete_Predicate (E));
while Present (P) loop
C := New_Copy (P);
Set_Sloc (C, Sloc (Choice));
Append_To (New_Cs, C);
Next (P);
end loop;
Insert_List_After (Choice, New_Cs);
end if;
end if;
end;
end if;
Nb_Choices := Nb_Choices + 1;
declare
C : constant Node_Id := Choice;
begin
Next (Choice);
if Delete_Choice then
Remove (C);
Nb_Choices := Nb_Choices - 1;
Delete_Choice := False;
end if;
end;
end loop;
Next (Assoc);
end loop;
end if;
-- At this point we know that the others choice, if present, is by
-- itself and appears last in the aggregate. Check if we have mixed
-- positional and discrete associations (other than the others choice).
if Present (Expressions (N))
and then (Nb_Choices > 1
or else (Nb_Choices = 1 and then not Others_Present))
then
Error_Msg_N
("named association cannot follow positional association",
First (Choice_List (First (Component_Associations (N)))));
return Failure;
end if;
-- Test for the validity of an others choice if present
if Others_Present and then not Others_Allowed then
Error_Msg_N
("OTHERS choice not allowed here",
First (Choices (First (Component_Associations (N)))));
return Failure;
end if;
-- Protect against cascaded errors
if Etype (Index_Typ) = Any_Type then
return Failure;
end if;
-- STEP 2: Process named components
if No (Expressions (N)) then
if Others_Present then
Case_Table_Size := Nb_Choices - 1;
else
Case_Table_Size := Nb_Choices;
end if;
Step_2 : declare
function Empty_Range (A : Node_Id) return Boolean;
-- If an association covers an empty range, some warnings on the
-- expression of the association can be disabled.
-----------------
-- Empty_Range --
-----------------
function Empty_Range (A : Node_Id) return Boolean is
R : constant Node_Id := First (Choices (A));
begin
return No (Next (R))
and then Nkind (R) = N_Range
and then Compile_Time_Compare
(Low_Bound (R), High_Bound (R), False) = GT;
end Empty_Range;
-- Local variables
Low : Node_Id;
High : Node_Id;
-- Denote the lowest and highest values in an aggregate choice
S_Low : Node_Id := Empty;
S_High : Node_Id := Empty;
-- if a choice in an aggregate is a subtype indication these
-- denote the lowest and highest values of the subtype
Table : Case_Table_Type (1 .. Case_Table_Size);
-- Used to sort all the different choice values
Single_Choice : Boolean;
-- Set to true every time there is a single discrete choice in a
-- discrete association
Prev_Nb_Discrete_Choices : Nat;
-- Used to keep track of the number of discrete choices in the
-- current association.
Errors_Posted_On_Choices : Boolean := False;
-- Keeps track of whether any choices have semantic errors
-- Start of processing for Step_2
begin
-- STEP 2 (A): Check discrete choices validity
Assoc := First (Component_Associations (N));
while Present (Assoc) loop
Prev_Nb_Discrete_Choices := Nb_Discrete_Choices;
Choice := First (Choice_List (Assoc));
loop
Analyze (Choice);
if Nkind (Choice) = N_Others_Choice then
Single_Choice := False;
exit;
-- Test for subtype mark without constraint
elsif Is_Entity_Name (Choice) and then
Is_Type (Entity (Choice))
then
if Base_Type (Entity (Choice)) /= Index_Base then
Error_Msg_N
("invalid subtype mark in aggregate choice",
Choice);
return Failure;
end if;
-- Case of subtype indication
elsif Nkind (Choice) = N_Subtype_Indication then
Resolve_Discrete_Subtype_Indication (Choice, Index_Base);
if Has_Dynamic_Predicate_Aspect
(Entity (Subtype_Mark (Choice)))
then
Error_Msg_NE
("subtype& has dynamic predicate, "
& "not allowed in aggregate choice",
Choice, Entity (Subtype_Mark (Choice)));
end if;
-- Does the subtype indication evaluation raise CE?
Get_Index_Bounds (Subtype_Mark (Choice), S_Low, S_High);
Get_Index_Bounds (Choice, Low, High);
Check_Bounds (S_Low, S_High, Low, High);
-- Case of range or expression
else
Resolve (Choice, Index_Base);
Check_Unset_Reference (Choice);
Check_Non_Static_Context (Choice);
-- If semantic errors were posted on the choice, then
-- record that for possible early return from later
-- processing (see handling of enumeration choices).
if Error_Posted (Choice) then
Errors_Posted_On_Choices := True;
end if;
-- Do not range check a choice. This check is redundant
-- since this test is already done when we check that the
-- bounds of the array aggregate are within range.
Set_Do_Range_Check (Choice, False);
end if;
-- If we could not resolve the discrete choice stop here
if Etype (Choice) = Any_Type then
return Failure;
-- If the discrete choice raises CE get its original bounds
elsif Nkind (Choice) = N_Raise_Constraint_Error then
Set_Raises_Constraint_Error (N);
Get_Index_Bounds (Original_Node (Choice), Low, High);
-- Otherwise get its bounds as usual
else
Get_Index_Bounds (Choice, Low, High);
end if;
if (Dynamic_Or_Null_Range (Low, High)
or else (Nkind (Choice) = N_Subtype_Indication
and then
Dynamic_Or_Null_Range (S_Low, S_High)))
and then Nb_Choices /= 1
then
Error_Msg_N
("dynamic or empty choice in aggregate "
& "must be the only choice", Choice);
return Failure;
end if;
if not (All_Composite_Constraints_Static (Low)
and then All_Composite_Constraints_Static (High)
and then All_Composite_Constraints_Static (S_Low)
and then All_Composite_Constraints_Static (S_High))
then
Check_Restriction (No_Dynamic_Sized_Objects, Choice);
end if;
Nb_Discrete_Choices := Nb_Discrete_Choices + 1;
Table (Nb_Discrete_Choices).Lo := Low;
Table (Nb_Discrete_Choices).Hi := High;
Table (Nb_Discrete_Choices).Choice := Choice;
Next (Choice);
if No (Choice) then
-- Check if we have a single discrete choice and whether
-- this discrete choice specifies a single value.
Single_Choice :=
(Nb_Discrete_Choices = Prev_Nb_Discrete_Choices + 1)
and then (Low = High);
exit;
end if;
end loop;
-- Ada 2005 (AI-231)
if Ada_Version >= Ada_2005
and then Known_Null (Expression (Assoc))
and then not Empty_Range (Assoc)
then
Check_Can_Never_Be_Null (Etype (N), Expression (Assoc));
end if;
-- Ada 2005 (AI-287): In case of default initialized component
-- we delay the resolution to the expansion phase.
if Box_Present (Assoc) then
-- Ada 2005 (AI-287): In case of default initialization of a
-- component the expander will generate calls to the
-- corresponding initialization subprogram. We need to call
-- Resolve_Aggr_Expr to check the rules about
-- dimensionality.
if not Resolve_Aggr_Expr
(Assoc, Single_Elmt => Single_Choice)
then
return Failure;
end if;
elsif Nkind (Assoc) = N_Iterated_Component_Association then
null; -- handled above, in a loop context.
elsif not Resolve_Aggr_Expr
(Expression (Assoc), Single_Elmt => Single_Choice)
then
return Failure;
-- Check incorrect use of dynamically tagged expression
-- We differentiate here two cases because the expression may
-- not be decorated. For example, the analysis and resolution
-- of the expression associated with the others choice will be
-- done later with the full aggregate. In such case we
-- duplicate the expression tree to analyze the copy and
-- perform the required check.
elsif not Present (Etype (Expression (Assoc))) then
declare
Save_Analysis : constant Boolean := Full_Analysis;
Expr : constant Node_Id :=
New_Copy_Tree (Expression (Assoc));
begin
Expander_Mode_Save_And_Set (False);
Full_Analysis := False;
-- Analyze the expression, making sure it is properly
-- attached to the tree before we do the analysis.
Set_Parent (Expr, Parent (Expression (Assoc)));
Analyze (Expr);
-- Compute its dimensions now, rather than at the end of
-- resolution, because in the case of multidimensional
-- aggregates subsequent expansion may lead to spurious
-- errors.
Check_Expression_Dimensions (Expr, Component_Typ);
-- If the expression is a literal, propagate this info
-- to the expression in the association, to enable some
-- optimizations downstream.
if Is_Entity_Name (Expr)
and then Present (Entity (Expr))
and then Ekind (Entity (Expr)) = E_Enumeration_Literal
then
Analyze_And_Resolve
(Expression (Assoc), Component_Typ);
end if;
Full_Analysis := Save_Analysis;
Expander_Mode_Restore;
if Is_Tagged_Type (Etype (Expr)) then
Check_Dynamically_Tagged_Expression
(Expr => Expr,
Typ => Component_Type (Etype (N)),
Related_Nod => N);
end if;
end;
elsif Is_Tagged_Type (Etype (Expression (Assoc))) then
Check_Dynamically_Tagged_Expression
(Expr => Expression (Assoc),
Typ => Component_Type (Etype (N)),
Related_Nod => N);
end if;
Next (Assoc);
end loop;
-- If aggregate contains more than one choice then these must be
-- static. Check for duplicate and missing values.
-- Note: there is duplicated code here wrt Check_Choice_Set in
-- the body of Sem_Case, and it is possible we could just reuse
-- that procedure. To be checked ???
if Nb_Discrete_Choices > 1 then
Check_Choices : declare
Choice : Node_Id;
-- Location of choice for messages
Hi_Val : Uint;
Lo_Val : Uint;
-- High end of one range and Low end of the next. Should be
-- contiguous if there is no hole in the list of values.
Lo_Dup : Uint;
Hi_Dup : Uint;
-- End points of duplicated range
Missing_Or_Duplicates : Boolean := False;
-- Set True if missing or duplicate choices found
procedure Output_Bad_Choices (Lo, Hi : Uint; C : Node_Id);
-- Output continuation message with a representation of the
-- bounds (just Lo if Lo = Hi, else Lo .. Hi). C is the
-- choice node where the message is to be posted.
------------------------
-- Output_Bad_Choices --
------------------------
procedure Output_Bad_Choices (Lo, Hi : Uint; C : Node_Id) is
begin
-- Enumeration type case
if Is_Enumeration_Type (Index_Typ) then
Error_Msg_Name_1 :=
Chars (Get_Enum_Lit_From_Pos (Index_Typ, Lo, Loc));
Error_Msg_Name_2 :=
Chars (Get_Enum_Lit_From_Pos (Index_Typ, Hi, Loc));
if Lo = Hi then
Error_Msg_N ("\\ %!", C);
else
Error_Msg_N ("\\ % .. %!", C);
end if;
-- Integer types case
else
Error_Msg_Uint_1 := Lo;
Error_Msg_Uint_2 := Hi;
if Lo = Hi then
Error_Msg_N ("\\ ^!", C);
else
Error_Msg_N ("\\ ^ .. ^!", C);
end if;
end if;
end Output_Bad_Choices;
-- Start of processing for Check_Choices
begin
Sort_Case_Table (Table);
-- First we do a quick linear loop to find out if we have
-- any duplicates or missing entries (usually we have a
-- legal aggregate, so this will get us out quickly).
for J in 1 .. Nb_Discrete_Choices - 1 loop
Hi_Val := Expr_Value (Table (J).Hi);
Lo_Val := Expr_Value (Table (J + 1).Lo);
if Lo_Val <= Hi_Val
or else (Lo_Val > Hi_Val + 1
and then not Others_Present)
then
Missing_Or_Duplicates := True;
exit;
end if;
end loop;
-- If we have missing or duplicate entries, first fill in
-- the Highest entries to make life easier in the following
-- loops to detect bad entries.
if Missing_Or_Duplicates then
Table (1).Highest := Expr_Value (Table (1).Hi);
for J in 2 .. Nb_Discrete_Choices loop
Table (J).Highest :=
UI_Max
(Table (J - 1).Highest, Expr_Value (Table (J).Hi));
end loop;
-- Loop through table entries to find duplicate indexes
for J in 2 .. Nb_Discrete_Choices loop
Lo_Val := Expr_Value (Table (J).Lo);
Hi_Val := Expr_Value (Table (J).Hi);
-- Case where we have duplicates (the lower bound of
-- this choice is less than or equal to the highest
-- high bound found so far).
if Lo_Val <= Table (J - 1).Highest then
-- We move backwards looking for duplicates. We can
-- abandon this loop as soon as we reach a choice
-- highest value that is less than Lo_Val.
for K in reverse 1 .. J - 1 loop
exit when Table (K).Highest < Lo_Val;
-- Here we may have duplicates between entries
-- for K and J. Get range of duplicates.
Lo_Dup :=
UI_Max (Lo_Val, Expr_Value (Table (K).Lo));
Hi_Dup :=
UI_Min (Hi_Val, Expr_Value (Table (K).Hi));
-- Nothing to do if duplicate range is null
if Lo_Dup > Hi_Dup then
null;
-- Otherwise place proper message
else
-- We place message on later choice, with a
-- line reference to the earlier choice.
if Sloc (Table (J).Choice) <
Sloc (Table (K).Choice)
then
Choice := Table (K).Choice;
Error_Msg_Sloc := Sloc (Table (J).Choice);
else
Choice := Table (J).Choice;
Error_Msg_Sloc := Sloc (Table (K).Choice);
end if;
if Lo_Dup = Hi_Dup then
Error_Msg_N
("index value in array aggregate "
& "duplicates the one given#!", Choice);
else
Error_Msg_N
("index values in array aggregate "
& "duplicate those given#!", Choice);
end if;
Output_Bad_Choices (Lo_Dup, Hi_Dup, Choice);
end if;
end loop;
end if;
end loop;
-- Loop through entries in table to find missing indexes.
-- Not needed if others, since missing impossible.
if not Others_Present then
for J in 2 .. Nb_Discrete_Choices loop
Lo_Val := Expr_Value (Table (J).Lo);
Hi_Val := Table (J - 1).Highest;
if Lo_Val > Hi_Val + 1 then
declare
Error_Node : Node_Id;
begin
-- If the choice is the bound of a range in
-- a subtype indication, it is not in the
-- source lists for the aggregate itself, so
-- post the error on the aggregate. Otherwise
-- post it on choice itself.
Choice := Table (J).Choice;
if Is_List_Member (Choice) then
Error_Node := Choice;
else
Error_Node := N;
end if;
if Hi_Val + 1 = Lo_Val - 1 then
Error_Msg_N
("missing index value "
& "in array aggregate!", Error_Node);
else
Error_Msg_N
("missing index values "
& "in array aggregate!", Error_Node);
end if;
Output_Bad_Choices
(Hi_Val + 1, Lo_Val - 1, Error_Node);
end;
end if;
end loop;
end if;
-- If either missing or duplicate values, return failure
Set_Etype (N, Any_Composite);
return Failure;
end if;
end Check_Choices;
end if;
-- STEP 2 (B): Compute aggregate bounds and min/max choices values
if Nb_Discrete_Choices > 0 then
Choices_Low := Table (1).Lo;
Choices_High := Table (Nb_Discrete_Choices).Hi;
end if;
-- If Others is present, then bounds of aggregate come from the
-- index constraint (not the choices in the aggregate itself).
if Others_Present then
Get_Index_Bounds (Index_Constr, Aggr_Low, Aggr_High);
-- Abandon processing if either bound is already signalled as
-- an error (prevents junk cascaded messages and blow ups).
if Nkind (Aggr_Low) = N_Error
or else
Nkind (Aggr_High) = N_Error
then
return False;
end if;
-- No others clause present
else
-- Special processing if others allowed and not present. This
-- means that the bounds of the aggregate come from the index
-- constraint (and the length must match).
if Others_Allowed then
Get_Index_Bounds (Index_Constr, Aggr_Low, Aggr_High);
-- Abandon processing if either bound is already signalled
-- as an error (stop junk cascaded messages and blow ups).
if Nkind (Aggr_Low) = N_Error
or else
Nkind (Aggr_High) = N_Error
then
return False;
end if;
-- If others allowed, and no others present, then the array
-- should cover all index values. If it does not, we will
-- get a length check warning, but there is two cases where
-- an additional warning is useful:
-- If we have no positional components, and the length is
-- wrong (which we can tell by others being allowed with
-- missing components), and the index type is an enumeration
-- type, then issue appropriate warnings about these missing
-- components. They are only warnings, since the aggregate
-- is fine, it's just the wrong length. We skip this check
-- for standard character types (since there are no literals
-- and it is too much trouble to concoct them), and also if
-- any of the bounds have values that are not known at
-- compile time.
-- Another case warranting a warning is when the length
-- is right, but as above we have an index type that is
-- an enumeration, and the bounds do not match. This is a
-- case where dubious sliding is allowed and we generate a
-- warning that the bounds do not match.
if No (Expressions (N))
and then Nkind (Index) = N_Range
and then Is_Enumeration_Type (Etype (Index))
and then not Is_Standard_Character_Type (Etype (Index))
and then Compile_Time_Known_Value (Aggr_Low)
and then Compile_Time_Known_Value (Aggr_High)
and then Compile_Time_Known_Value (Choices_Low)
and then Compile_Time_Known_Value (Choices_High)
then
-- If any of the expressions or range bounds in choices
-- have semantic errors, then do not attempt further
-- resolution, to prevent cascaded errors.
if Errors_Posted_On_Choices then
return Failure;
end if;
declare
ALo : constant Node_Id := Expr_Value_E (Aggr_Low);
AHi : constant Node_Id := Expr_Value_E (Aggr_High);
CLo : constant Node_Id := Expr_Value_E (Choices_Low);
CHi : constant Node_Id := Expr_Value_E (Choices_High);
Ent : Entity_Id;
begin
-- Warning case 1, missing values at start/end. Only
-- do the check if the number of entries is too small.
if (Enumeration_Pos (CHi) - Enumeration_Pos (CLo))
<
(Enumeration_Pos (AHi) - Enumeration_Pos (ALo))
then
Error_Msg_N
("missing index value(s) in array aggregate??",
N);
-- Output missing value(s) at start
if Chars (ALo) /= Chars (CLo) then
Ent := Prev (CLo);
if Chars (ALo) = Chars (Ent) then
Error_Msg_Name_1 := Chars (ALo);
Error_Msg_N ("\ %??", N);
else
Error_Msg_Name_1 := Chars (ALo);
Error_Msg_Name_2 := Chars (Ent);
Error_Msg_N ("\ % .. %??", N);
end if;
end if;
-- Output missing value(s) at end
if Chars (AHi) /= Chars (CHi) then
Ent := Next (CHi);
if Chars (AHi) = Chars (Ent) then
Error_Msg_Name_1 := Chars (Ent);
Error_Msg_N ("\ %??", N);
else
Error_Msg_Name_1 := Chars (Ent);
Error_Msg_Name_2 := Chars (AHi);
Error_Msg_N ("\ % .. %??", N);
end if;
end if;
-- Warning case 2, dubious sliding. The First_Subtype
-- test distinguishes between a constrained type where
-- sliding is not allowed (so we will get a warning
-- later that Constraint_Error will be raised), and
-- the unconstrained case where sliding is permitted.
elsif (Enumeration_Pos (CHi) - Enumeration_Pos (CLo))
=
(Enumeration_Pos (AHi) - Enumeration_Pos (ALo))
and then Chars (ALo) /= Chars (CLo)
and then
not Is_Constrained (First_Subtype (Etype (N)))
then
Error_Msg_N
("bounds of aggregate do not match target??", N);
end if;
end;
end if;
end if;
-- If no others, aggregate bounds come from aggregate
Aggr_Low := Choices_Low;
Aggr_High := Choices_High;
end if;
end Step_2;
-- STEP 3: Process positional components
else
-- STEP 3 (A): Process positional elements
Expr := First (Expressions (N));
Nb_Elements := Uint_0;
while Present (Expr) loop
Nb_Elements := Nb_Elements + 1;
-- Ada 2005 (AI-231)
if Ada_Version >= Ada_2005 and then Known_Null (Expr) then
Check_Can_Never_Be_Null (Etype (N), Expr);
end if;
if not Resolve_Aggr_Expr (Expr, Single_Elmt => True) then
return Failure;
end if;
-- Check incorrect use of dynamically tagged expression
if Is_Tagged_Type (Etype (Expr)) then
Check_Dynamically_Tagged_Expression
(Expr => Expr,
Typ => Component_Type (Etype (N)),
Related_Nod => N);
end if;
Next (Expr);
end loop;
if Others_Present then
Assoc := Last (Component_Associations (N));
-- Ada 2005 (AI-231)
if Ada_Version >= Ada_2005 and then Known_Null (Assoc) then
Check_Can_Never_Be_Null (Etype (N), Expression (Assoc));
end if;
-- Ada 2005 (AI-287): In case of default initialized component,
-- we delay the resolution to the expansion phase.
if Box_Present (Assoc) then
-- Ada 2005 (AI-287): In case of default initialization of a
-- component the expander will generate calls to the
-- corresponding initialization subprogram. We need to call
-- Resolve_Aggr_Expr to check the rules about
-- dimensionality.
if not Resolve_Aggr_Expr (Assoc, Single_Elmt => False) then
return Failure;
end if;
elsif not Resolve_Aggr_Expr (Expression (Assoc),
Single_Elmt => False)
then
return Failure;
-- Check incorrect use of dynamically tagged expression. The
-- expression of the others choice has not been resolved yet.
-- In order to diagnose the semantic error we create a duplicate
-- tree to analyze it and perform the check.
else
declare
Save_Analysis : constant Boolean := Full_Analysis;
Expr : constant Node_Id :=
New_Copy_Tree (Expression (Assoc));
begin
Expander_Mode_Save_And_Set (False);
Full_Analysis := False;
Analyze (Expr);
Full_Analysis := Save_Analysis;
Expander_Mode_Restore;
if Is_Tagged_Type (Etype (Expr)) then
Check_Dynamically_Tagged_Expression
(Expr => Expr,
Typ => Component_Type (Etype (N)),
Related_Nod => N);
end if;
end;
end if;
end if;
-- STEP 3 (B): Compute the aggregate bounds
if Others_Present then
Get_Index_Bounds (Index_Constr, Aggr_Low, Aggr_High);
else
if Others_Allowed then
Get_Index_Bounds (Index_Constr, Aggr_Low, Discard);
else
Aggr_Low := Index_Typ_Low;
end if;
Aggr_High := Add (Nb_Elements - 1, To => Aggr_Low);
Check_Bound (Index_Base_High, Aggr_High);
end if;
end if;
-- STEP 4: Perform static aggregate checks and save the bounds
-- Check (A)
Check_Bounds (Index_Typ_Low, Index_Typ_High, Aggr_Low, Aggr_High);
Check_Bounds (Index_Base_Low, Index_Base_High, Aggr_Low, Aggr_High);
-- Check (B)
if Others_Present and then Nb_Discrete_Choices > 0 then
Check_Bounds (Aggr_Low, Aggr_High, Choices_Low, Choices_High);
Check_Bounds (Index_Typ_Low, Index_Typ_High,
Choices_Low, Choices_High);
Check_Bounds (Index_Base_Low, Index_Base_High,
Choices_Low, Choices_High);
-- Check (C)
elsif Others_Present and then Nb_Elements > 0 then
Check_Length (Aggr_Low, Aggr_High, Nb_Elements);
Check_Length (Index_Typ_Low, Index_Typ_High, Nb_Elements);
Check_Length (Index_Base_Low, Index_Base_High, Nb_Elements);
end if;
if Raises_Constraint_Error (Aggr_Low)
or else Raises_Constraint_Error (Aggr_High)
then
Set_Raises_Constraint_Error (N);
end if;
Aggr_Low := Duplicate_Subexpr (Aggr_Low);
-- Do not duplicate Aggr_High if Aggr_High = Aggr_Low + Nb_Elements
-- since the addition node returned by Add is not yet analyzed. Attach
-- to tree and analyze first. Reset analyzed flag to ensure it will get
-- analyzed when it is a literal bound whose type must be properly set.
if Others_Present or else Nb_Discrete_Choices > 0 then
Aggr_High := Duplicate_Subexpr (Aggr_High);
if Etype (Aggr_High) = Universal_Integer then
Set_Analyzed (Aggr_High, False);
end if;
end if;
-- If the aggregate already has bounds attached to it, it means this is
-- a positional aggregate created as an optimization by
-- Exp_Aggr.Convert_To_Positional, so we don't want to change those
-- bounds.
if Present (Aggregate_Bounds (N)) and then not Others_Allowed then
Aggr_Low := Low_Bound (Aggregate_Bounds (N));
Aggr_High := High_Bound (Aggregate_Bounds (N));
end if;
Set_Aggregate_Bounds
(N, Make_Range (Loc, Low_Bound => Aggr_Low, High_Bound => Aggr_High));
-- The bounds may contain expressions that must be inserted upwards.
-- Attach them fully to the tree. After analysis, remove side effects
-- from upper bound, if still needed.
Set_Parent (Aggregate_Bounds (N), N);
Analyze_And_Resolve (Aggregate_Bounds (N), Index_Typ);
Check_Unset_Reference (Aggregate_Bounds (N));
if not Others_Present and then Nb_Discrete_Choices = 0 then
Set_High_Bound
(Aggregate_Bounds (N),
Duplicate_Subexpr (High_Bound (Aggregate_Bounds (N))));
end if;
-- Check the dimensions of each component in the array aggregate
Analyze_Dimension_Array_Aggregate (N, Component_Typ);
return Success;
end Resolve_Array_Aggregate;
---------------------------------
-- Resolve_Container_Aggregate --
---------------------------------
procedure Resolve_Container_Aggregate (N : Node_Id; Typ : Entity_Id) is
procedure Resolve_Iterated_Association
(Comp : Node_Id;
Key_Type : Entity_Id;
Elmt_Type : Entity_Id);
-- Resolve choices and expression in an iterated component association
-- or an iterated element association, which has a key_expression.
-- This is similar but not identical to the handling of this construct
-- in an array aggregate.
-- For a named container, the type of each choice must be compatible
-- with the key type. For a positional container, the choice must be
-- a subtype indication or an iterator specification that determines
-- an element type.
Asp : constant Node_Id := Find_Value_Of_Aspect (Typ, Aspect_Aggregate);
Empty_Subp : Node_Id := Empty;
Add_Named_Subp : Node_Id := Empty;
Add_Unnamed_Subp : Node_Id := Empty;
New_Indexed_Subp : Node_Id := Empty;
Assign_Indexed_Subp : Node_Id := Empty;
----------------------------------
-- Resolve_Iterated_Association --
----------------------------------
procedure Resolve_Iterated_Association
(Comp : Node_Id;
Key_Type : Entity_Id;
Elmt_Type : Entity_Id)
is
Choice : Node_Id;
Ent : Entity_Id;
Expr : Node_Id;
Key_Expr : Node_Id;
Id : Entity_Id;
Id_Name : Name_Id;
Iter : Node_Id;
Typ : Entity_Id := Empty;
begin
-- If this is an Iterated_Element_Association then either a
-- an Iterator_Specification or a Loop_Parameter specification
-- is present. In both cases a Key_Expression is present.
if Nkind (Comp) = N_Iterated_Element_Association then
if Present (Loop_Parameter_Specification (Comp)) then
Analyze_Loop_Parameter_Specification
(Loop_Parameter_Specification (Comp));
Id_Name := Chars (Defining_Identifier
(Loop_Parameter_Specification (Comp)));
else
Iter := Copy_Separate_Tree (Iterator_Specification (Comp));
Analyze (Iter);
Typ := Etype (Defining_Identifier (Iter));
Id_Name := Chars (Defining_Identifier
(Iterator_Specification (Comp)));
end if;
-- Key expression must have the type of the key. We analyze
-- a copy of the original expression, because it will be
-- reanalyzed and copied as needed during expansion of the
-- corresponding loop.
Key_Expr := Key_Expression (Comp);
Analyze_And_Resolve (New_Copy_Tree (Key_Expr), Key_Type);
elsif Present (Iterator_Specification (Comp)) then
Iter := Copy_Separate_Tree (Iterator_Specification (Comp));
Id_Name := Chars (Defining_Identifier (Comp));
Analyze (Iter);
Typ := Etype (Defining_Identifier (Iter));
else
Choice := First (Discrete_Choices (Comp));
while Present (Choice) loop
Analyze (Choice);
-- Choice can be a subtype name, a range, or an expression
if Is_Entity_Name (Choice)
and then Is_Type (Entity (Choice))
and then Base_Type (Entity (Choice)) = Base_Type (Key_Type)
then
null;
elsif Present (Key_Type) then
Analyze_And_Resolve (Choice, Key_Type);
else
Typ := Etype (Choice); -- assume unique for now
end if;
Next (Choice);
end loop;
Id_Name := Chars (Defining_Identifier (Comp));
end if;
-- Create a scope in which to introduce an index, which is usually
-- visible in the expression for the component, and needed for its
-- analysis.
Id := Make_Defining_Identifier (Sloc (Comp), Id_Name);
Ent := New_Internal_Entity (E_Loop, Current_Scope, Sloc (Comp), 'L');
Set_Etype (Ent, Standard_Void_Type);
Set_Parent (Ent, Parent (Comp));
Push_Scope (Ent);
-- Insert and decorate the loop variable in the current scope.
-- The expression has to be analyzed once the loop variable is
-- directly visible. Mark the variable as referenced to prevent
-- spurious warnings, given that subsequent uses of its name in the
-- expression will reference the internal (synonym) loop variable.
Enter_Name (Id);
if No (Key_Type) then
pragma Assert (Present (Typ));
Set_Etype (Id, Typ);
else
Set_Etype (Id, Key_Type);
end if;
Set_Ekind (Id, E_Variable);
Set_Scope (Id, Ent);
Set_Referenced (Id);
-- Analyze a copy of the expression, to verify legality. We use
-- a copy because the expression will be analyzed anew when the
-- enclosing aggregate is expanded, and the construct is rewritten
-- as a loop with a new index variable.
Expr := New_Copy_Tree (Expression (Comp));
Preanalyze_And_Resolve (Expr, Elmt_Type);
End_Scope;
end Resolve_Iterated_Association;
begin
pragma Assert (Nkind (Asp) = N_Aggregate);
Set_Etype (N, Typ);
Parse_Aspect_Aggregate (Asp,
Empty_Subp, Add_Named_Subp, Add_Unnamed_Subp,
New_Indexed_Subp, Assign_Indexed_Subp);
if Present (Add_Unnamed_Subp)
and then No (New_Indexed_Subp)
then
declare
Elmt_Type : constant Entity_Id :=
Etype (Next_Formal
(First_Formal (Entity (Add_Unnamed_Subp))));
Comp : Node_Id;
begin
if Present (Expressions (N)) then
-- positional aggregate
Comp := First (Expressions (N));
while Present (Comp) loop
Analyze_And_Resolve (Comp, Elmt_Type);
Next (Comp);
end loop;
end if;
-- Empty aggregate, to be replaced by Empty during
-- expansion, or iterated component association.
if Present (Component_Associations (N)) then
declare
Comp : Node_Id := First (Component_Associations (N));
begin
while Present (Comp) loop
if Nkind (Comp) /=
N_Iterated_Component_Association
then
Error_Msg_N ("illegal component association "
& "for unnamed container aggregate", Comp);
return;
else
Resolve_Iterated_Association
(Comp, Empty, Elmt_Type);
end if;
Next (Comp);
end loop;
end;
end if;
end;
elsif Present (Add_Named_Subp) then
declare
-- Retrieves types of container, key, and element from the
-- specified insertion procedure.
Container : constant Entity_Id :=
First_Formal (Entity (Add_Named_Subp));
Key_Type : constant Entity_Id := Etype (Next_Formal (Container));
Elmt_Type : constant Entity_Id :=
Etype (Next_Formal (Next_Formal (Container)));
Comp : Node_Id;
Choice : Node_Id;
begin
Comp := First (Component_Associations (N));
while Present (Comp) loop
if Nkind (Comp) = N_Component_Association then
Choice := First (Choices (Comp));
while Present (Choice) loop
Analyze_And_Resolve (Choice, Key_Type);
if not Is_Static_Expression (Choice) then
Error_Msg_N ("Choice must be static", Choice);
end if;
Next (Choice);
end loop;
Analyze_And_Resolve (Expression (Comp), Elmt_Type);
elsif Nkind (Comp) in
N_Iterated_Component_Association |
N_Iterated_Element_Association
then
Resolve_Iterated_Association
(Comp, Key_Type, Elmt_Type);
end if;
Next (Comp);
end loop;
end;
else
-- Indexed Aggregate. Both positional and indexed component
-- can be present. Choices must be static values or ranges
-- with static bounds.
declare
Container : constant Entity_Id :=
First_Formal (Entity (Assign_Indexed_Subp));
Index_Type : constant Entity_Id := Etype (Next_Formal (Container));
Comp_Type : constant Entity_Id :=
Etype (Next_Formal (Next_Formal (Container)));
Comp : Node_Id;
Choice : Node_Id;
begin
if Present (Expressions (N)) then
Comp := First (Expressions (N));
while Present (Comp) loop
Analyze_And_Resolve (Comp, Comp_Type);
Next (Comp);
end loop;
end if;
if Present (Component_Associations (N)) then
Comp := First (Expressions (N));
while Present (Comp) loop
if Nkind (Comp) = N_Component_Association then
Choice := First (Choices (Comp));
while Present (Choice) loop
Analyze_And_Resolve (Choice, Index_Type);
Next (Choice);
end loop;
Analyze_And_Resolve (Expression (Comp), Comp_Type);
elsif Nkind (Comp) in
N_Iterated_Component_Association |
N_Iterated_Element_Association
then
Resolve_Iterated_Association
(Comp, Index_Type, Comp_Type);
end if;
Next (Comp);
end loop;
end if;
end;
end if;
end Resolve_Container_Aggregate;
-----------------------------
-- Resolve_Delta_Aggregate --
-----------------------------
procedure Resolve_Delta_Aggregate (N : Node_Id; Typ : Entity_Id) is
Base : constant Node_Id := Expression (N);
begin
if Ada_Version < Ada_2020 then
Error_Msg_N ("delta_aggregate is an Ada 202x feature", N);
Error_Msg_N ("\compile with -gnat2020", N);
end if;
if not Is_Composite_Type (Typ) then
Error_Msg_N ("not a composite type", N);
end if;
Analyze_And_Resolve (Base, Typ);
if Is_Array_Type (Typ) then
Resolve_Delta_Array_Aggregate (N, Typ);
else
Resolve_Delta_Record_Aggregate (N, Typ);
end if;
Set_Etype (N, Typ);
end Resolve_Delta_Aggregate;
-----------------------------------
-- Resolve_Delta_Array_Aggregate --
-----------------------------------
procedure Resolve_Delta_Array_Aggregate (N : Node_Id; Typ : Entity_Id) is
Deltas : constant List_Id := Component_Associations (N);
Index_Type : constant Entity_Id := Etype (First_Index (Typ));
Assoc : Node_Id;
Choice : Node_Id;
begin
Assoc := First (Deltas);
while Present (Assoc) loop
if Nkind (Assoc) = N_Iterated_Component_Association then
Choice := First (Choice_List (Assoc));
while Present (Choice) loop
if Nkind (Choice) = N_Others_Choice then
Error_Msg_N
("others not allowed in delta aggregate", Choice);
else
Analyze_And_Resolve (Choice, Index_Type);
end if;
Next (Choice);
end loop;
declare
Id : constant Entity_Id := Defining_Identifier (Assoc);
Ent : constant Entity_Id :=
New_Internal_Entity
(E_Loop, Current_Scope, Sloc (Assoc), 'L');
begin
Set_Etype (Ent, Standard_Void_Type);
Set_Parent (Ent, Assoc);
if No (Scope (Id)) then
Enter_Name (Id);
Set_Etype (Id, Index_Type);
Set_Ekind (Id, E_Variable);
Set_Scope (Id, Ent);
end if;
Push_Scope (Ent);
Analyze_And_Resolve
(New_Copy_Tree (Expression (Assoc)), Component_Type (Typ));
End_Scope;
end;
else
Choice := First (Choice_List (Assoc));
while Present (Choice) loop
if Nkind (Choice) = N_Others_Choice then
Error_Msg_N
("others not allowed in delta aggregate", Choice);
else
Analyze (Choice);
if Is_Entity_Name (Choice)
and then Is_Type (Entity (Choice))
then
-- Choice covers a range of values
if Base_Type (Entity (Choice)) /=
Base_Type (Index_Type)
then
Error_Msg_NE
("choice does mat match index type of",
Choice, Typ);
end if;
else
Resolve (Choice, Index_Type);
end if;
end if;
Next (Choice);
end loop;
Analyze_And_Resolve (Expression (Assoc), Component_Type (Typ));
end if;
Next (Assoc);
end loop;
end Resolve_Delta_Array_Aggregate;
------------------------------------
-- Resolve_Delta_Record_Aggregate --
------------------------------------
procedure Resolve_Delta_Record_Aggregate (N : Node_Id; Typ : Entity_Id) is
-- Variables used to verify that discriminant-dependent components
-- appear in the same variant.
Comp_Ref : Entity_Id := Empty; -- init to avoid warning
Variant : Node_Id;
procedure Check_Variant (Id : Entity_Id);
-- If a given component of the delta aggregate appears in a variant
-- part, verify that it is within the same variant as that of previous
-- specified variant components of the delta.
function Get_Component (Nam : Node_Id) return Entity_Id;
-- Locate component with a given name and return it. If none found then
-- report error and return Empty.
function Nested_In (V1 : Node_Id; V2 : Node_Id) return Boolean;
-- Determine whether variant V1 is within variant V2
function Variant_Depth (N : Node_Id) return Integer;
-- Determine the distance of a variant to the enclosing type
-- declaration.
--------------------
-- Check_Variant --
--------------------
procedure Check_Variant (Id : Entity_Id) is
Comp : Entity_Id;
Comp_Variant : Node_Id;
begin
if not Has_Discriminants (Typ) then
return;
end if;
Comp := First_Entity (Typ);
while Present (Comp) loop
exit when Chars (Comp) = Chars (Id);
Next_Component (Comp);
end loop;
-- Find the variant, if any, whose component list includes the
-- component declaration.
Comp_Variant := Parent (Parent (List_Containing (Parent (Comp))));
if Nkind (Comp_Variant) = N_Variant then
if No (Variant) then
Variant := Comp_Variant;
Comp_Ref := Comp;
elsif Variant /= Comp_Variant then
declare
D1 : constant Integer := Variant_Depth (Variant);
D2 : constant Integer := Variant_Depth (Comp_Variant);
begin
if D1 = D2
or else
(D1 > D2 and then not Nested_In (Variant, Comp_Variant))
or else
(D2 > D1 and then not Nested_In (Comp_Variant, Variant))
then
pragma Assert (Present (Comp_Ref));
Error_Msg_Node_2 := Comp_Ref;
Error_Msg_NE
("& and & appear in different variants", Id, Comp);
-- Otherwise retain the deeper variant for subsequent tests
elsif D2 > D1 then
Variant := Comp_Variant;
end if;
end;
end if;
end if;
end Check_Variant;
-------------------
-- Get_Component --
-------------------
function Get_Component (Nam : Node_Id) return Entity_Id is
Comp : Entity_Id;
begin
Comp := First_Entity (Typ);
while Present (Comp) loop
if Chars (Comp) = Chars (Nam) then
if Ekind (Comp) = E_Discriminant then
Error_Msg_N ("delta cannot apply to discriminant", Nam);
end if;
return Comp;
end if;
Next_Entity (Comp);
end loop;
Error_Msg_NE ("type& has no component with this name", Nam, Typ);
return Empty;
end Get_Component;
---------------
-- Nested_In --
---------------
function Nested_In (V1, V2 : Node_Id) return Boolean is
Par : Node_Id;
begin
Par := Parent (V1);
while Nkind (Par) /= N_Full_Type_Declaration loop
if Par = V2 then
return True;
end if;
Par := Parent (Par);
end loop;
return False;
end Nested_In;
-------------------
-- Variant_Depth --
-------------------
function Variant_Depth (N : Node_Id) return Integer is
Depth : Integer;
Par : Node_Id;
begin
Depth := 0;
Par := Parent (N);
while Nkind (Par) /= N_Full_Type_Declaration loop
Depth := Depth + 1;
Par := Parent (Par);
end loop;
return Depth;
end Variant_Depth;
-- Local variables
Deltas : constant List_Id := Component_Associations (N);
Assoc : Node_Id;
Choice : Node_Id;
Comp : Entity_Id;
Comp_Type : Entity_Id := Empty; -- init to avoid warning
-- Start of processing for Resolve_Delta_Record_Aggregate
begin
Variant := Empty;
Assoc := First (Deltas);
while Present (Assoc) loop
Choice := First (Choice_List (Assoc));
while Present (Choice) loop
Comp := Get_Component (Choice);
if Present (Comp) then
Check_Variant (Choice);
Comp_Type := Etype (Comp);
-- Decorate the component reference by setting its entity and
-- type, as otherwise backends like GNATprove would have to
-- rediscover this information by themselves.
Set_Entity (Choice, Comp);
Set_Etype (Choice, Comp_Type);
else
Comp_Type := Any_Type;
end if;
Next (Choice);
end loop;
pragma Assert (Present (Comp_Type));
Analyze_And_Resolve (Expression (Assoc), Comp_Type);
Next (Assoc);
end loop;
end Resolve_Delta_Record_Aggregate;
---------------------------------
-- Resolve_Extension_Aggregate --
---------------------------------
-- There are two cases to consider:
-- a) If the ancestor part is a type mark, the components needed are the
-- difference between the components of the expected type and the
-- components of the given type mark.
-- b) If the ancestor part is an expression, it must be unambiguous, and
-- once we have its type we can also compute the needed components as in
-- the previous case. In both cases, if the ancestor type is not the
-- immediate ancestor, we have to build this ancestor recursively.
-- In both cases, discriminants of the ancestor type do not play a role in
-- the resolution of the needed components, because inherited discriminants
-- cannot be used in a type extension. As a result we can compute
-- independently the list of components of the ancestor type and of the
-- expected type.
procedure Resolve_Extension_Aggregate (N : Node_Id; Typ : Entity_Id) is
A : constant Node_Id := Ancestor_Part (N);
A_Type : Entity_Id;
I : Interp_Index;
It : Interp;
function Valid_Limited_Ancestor (Anc : Node_Id) return Boolean;
-- If the type is limited, verify that the ancestor part is a legal
-- expression (aggregate or function call, including 'Input)) that does
-- not require a copy, as specified in 7.5(2).
function Valid_Ancestor_Type return Boolean;
-- Verify that the type of the ancestor part is a non-private ancestor
-- of the expected type, which must be a type extension.
procedure Transform_BIP_Assignment (Typ : Entity_Id);
-- For an extension aggregate whose ancestor part is a build-in-place
-- call returning a nonlimited type, this is used to transform the
-- assignment to the ancestor part to use a temp.
----------------------------
-- Valid_Limited_Ancestor --
----------------------------
function Valid_Limited_Ancestor (Anc : Node_Id) return Boolean is
begin
if Is_Entity_Name (Anc) and then Is_Type (Entity (Anc)) then
return True;
-- The ancestor must be a call or an aggregate, but a call may
-- have been expanded into a temporary, so check original node.
elsif Nkind (Anc) in N_Aggregate
| N_Extension_Aggregate
| N_Function_Call
then
return True;
elsif Nkind (Original_Node (Anc)) = N_Function_Call then
return True;
elsif Nkind (Anc) = N_Attribute_Reference
and then Attribute_Name (Anc) = Name_Input
then
return True;
elsif Nkind (Anc) = N_Qualified_Expression then
return Valid_Limited_Ancestor (Expression (Anc));
elsif Nkind (Anc) = N_Raise_Expression then
return True;
else
return False;
end if;
end Valid_Limited_Ancestor;
-------------------------
-- Valid_Ancestor_Type --
-------------------------
function Valid_Ancestor_Type return Boolean is
Imm_Type : Entity_Id;
begin
Imm_Type := Base_Type (Typ);
while Is_Derived_Type (Imm_Type) loop
if Etype (Imm_Type) = Base_Type (A_Type) then
return True;
-- The base type of the parent type may appear as a private
-- extension if it is declared as such in a parent unit of the
-- current one. For consistency of the subsequent analysis use
-- the partial view for the ancestor part.
elsif Is_Private_Type (Etype (Imm_Type))
and then Present (Full_View (Etype (Imm_Type)))
and then Base_Type (A_Type) = Full_View (Etype (Imm_Type))
then
A_Type := Etype (Imm_Type);
return True;
-- The parent type may be a private extension. The aggregate is
-- legal if the type of the aggregate is an extension of it that
-- is not a private extension.
elsif Is_Private_Type (A_Type)
and then not Is_Private_Type (Imm_Type)
and then Present (Full_View (A_Type))
and then Base_Type (Full_View (A_Type)) = Etype (Imm_Type)
then
return True;
-- The parent type may be a raise expression (which is legal in
-- any expression context).
elsif A_Type = Raise_Type then
A_Type := Etype (Imm_Type);
return True;
else
Imm_Type := Etype (Base_Type (Imm_Type));
end if;
end loop;
-- If previous loop did not find a proper ancestor, report error
Error_Msg_NE ("expect ancestor type of &", A, Typ);
return False;
end Valid_Ancestor_Type;
------------------------------
-- Transform_BIP_Assignment --
------------------------------
procedure Transform_BIP_Assignment (Typ : Entity_Id) is
Loc : constant Source_Ptr := Sloc (N);
Def_Id : constant Entity_Id := Make_Temporary (Loc, 'Y', A);
Obj_Decl : constant Node_Id :=
Make_Object_Declaration (Loc,
Defining_Identifier => Def_Id,
Constant_Present => True,
Object_Definition => New_Occurrence_Of (Typ, Loc),
Expression => A,
Has_Init_Expression => True);
begin
Set_Etype (Def_Id, Typ);
Set_Ancestor_Part (N, New_Occurrence_Of (Def_Id, Loc));
Insert_Action (N, Obj_Decl);
end Transform_BIP_Assignment;
-- Start of processing for Resolve_Extension_Aggregate
begin
-- Analyze the ancestor part and account for the case where it is a
-- parameterless function call.
Analyze (A);
Check_Parameterless_Call (A);
if Is_Entity_Name (A) and then Is_Type (Entity (A)) then
-- AI05-0115: if the ancestor part is a subtype mark, the ancestor
-- must not have unknown discriminants.
if Has_Unknown_Discriminants (Entity (A)) then
Error_Msg_NE
("aggregate not available for type& whose ancestor "
& "has unknown discriminants", N, Typ);
end if;
end if;
if not Is_Tagged_Type (Typ) then
Error_Msg_N ("type of extension aggregate must be tagged", N);
return;
elsif Is_Limited_Type (Typ) then
-- Ada 2005 (AI-287): Limited aggregates are allowed
if Ada_Version < Ada_2005 then
Error_Msg_N ("aggregate type cannot be limited", N);
Explain_Limited_Type (Typ, N);
return;
elsif Valid_Limited_Ancestor (A) then
null;
else
Error_Msg_N
("limited ancestor part must be aggregate or function call", A);
end if;
elsif Is_Class_Wide_Type (Typ) then
Error_Msg_N ("aggregate cannot be of a class-wide type", N);
return;
end if;
if Is_Entity_Name (A) and then Is_Type (Entity (A)) then
A_Type := Get_Full_View (Entity (A));
if Valid_Ancestor_Type then
Set_Entity (A, A_Type);
Set_Etype (A, A_Type);
Validate_Ancestor_Part (N);
Resolve_Record_Aggregate (N, Typ);
end if;
elsif Nkind (A) /= N_Aggregate then
if Is_Overloaded (A) then
A_Type := Any_Type;
Get_First_Interp (A, I, It);
while Present (It.Typ) loop
-- Consider limited interpretations if Ada 2005 or higher
if Is_Tagged_Type (It.Typ)
and then (Ada_Version >= Ada_2005
or else not Is_Limited_Type (It.Typ))
then
if A_Type /= Any_Type then
Error_Msg_N ("cannot resolve expression", A);
return;
else
A_Type := It.Typ;
end if;
end if;
Get_Next_Interp (I, It);
end loop;
if A_Type = Any_Type then
if Ada_Version >= Ada_2005 then
Error_Msg_N
("ancestor part must be of a tagged type", A);
else
Error_Msg_N
("ancestor part must be of a nonlimited tagged type", A);
end if;
return;
end if;
else
A_Type := Etype (A);
end if;
if Valid_Ancestor_Type then
Resolve (A, A_Type);
Check_Unset_Reference (A);
Check_Non_Static_Context (A);
-- The aggregate is illegal if the ancestor expression is a call
-- to a function with a limited unconstrained result, unless the
-- type of the aggregate is a null extension. This restriction
-- was added in AI05-67 to simplify implementation.
if Nkind (A) = N_Function_Call
and then Is_Limited_Type (A_Type)
and then not Is_Null_Extension (Typ)
and then not Is_Constrained (A_Type)
then
Error_Msg_N
("type of limited ancestor part must be constrained", A);
-- Reject the use of CPP constructors that leave objects partially
-- initialized. For example:
-- type CPP_Root is tagged limited record ...
-- pragma Import (CPP, CPP_Root);
-- type CPP_DT is new CPP_Root and Iface ...
-- pragma Import (CPP, CPP_DT);
-- type Ada_DT is new CPP_DT with ...
-- Obj : Ada_DT := Ada_DT'(New_CPP_Root with others => <>);
-- Using the constructor of CPP_Root the slots of the dispatch
-- table of CPP_DT cannot be set, and the secondary tag of
-- CPP_DT is unknown.
elsif Nkind (A) = N_Function_Call
and then Is_CPP_Constructor_Call (A)
and then Enclosing_CPP_Parent (Typ) /= A_Type
then
Error_Msg_NE
("??must use 'C'P'P constructor for type &", A,
Enclosing_CPP_Parent (Typ));
-- The following call is not needed if the previous warning
-- is promoted to an error.
Resolve_Record_Aggregate (N, Typ);
elsif Is_Class_Wide_Type (Etype (A))
and then Nkind (Original_Node (A)) = N_Function_Call
then
-- If the ancestor part is a dispatching call, it appears
-- statically to be a legal ancestor, but it yields any member
-- of the class, and it is not possible to determine whether
-- it is an ancestor of the extension aggregate (much less
-- which ancestor). It is not possible to determine the
-- components of the extension part.
-- This check implements AI-306, which in fact was motivated by
-- an AdaCore query to the ARG after this test was added.
Error_Msg_N ("ancestor part must be statically tagged", A);
else
-- We are using the build-in-place protocol, but we can't build
-- in place, because we need to call the function before
-- allocating the aggregate. Could do better for null
-- extensions, and maybe for nondiscriminated types.
-- This is wrong for limited, but those were wrong already.
if not Is_Limited_View (A_Type)
and then Is_Build_In_Place_Function_Call (A)
then
Transform_BIP_Assignment (A_Type);
end if;
Resolve_Record_Aggregate (N, Typ);
end if;
end if;
else
Error_Msg_N ("no unique type for this aggregate", A);
end if;
Check_Function_Writable_Actuals (N);
end Resolve_Extension_Aggregate;
------------------------------
-- Resolve_Record_Aggregate --
------------------------------
procedure Resolve_Record_Aggregate (N : Node_Id; Typ : Entity_Id) is
New_Assoc_List : constant List_Id := New_List;
-- New_Assoc_List is the newly built list of N_Component_Association
-- nodes.
Others_Etype : Entity_Id := Empty;
-- This variable is used to save the Etype of the last record component
-- that takes its value from the others choice. Its purpose is:
--
-- (a) make sure the others choice is useful
--
-- (b) make sure the type of all the components whose value is
-- subsumed by the others choice are the same.
--
-- This variable is updated as a side effect of function Get_Value.
Box_Node : Node_Id := Empty;
Is_Box_Present : Boolean := False;
Others_Box : Natural := 0;
-- Ada 2005 (AI-287): Variables used in case of default initialization
-- to provide a functionality similar to Others_Etype. Box_Present
-- indicates that the component takes its default initialization;
-- Others_Box counts the number of components of the current aggregate
-- (which may be a sub-aggregate of a larger one) that are default-
-- initialized. A value of One indicates that an others_box is present.
-- Any larger value indicates that the others_box is not redundant.
-- These variables, similar to Others_Etype, are also updated as a side
-- effect of function Get_Value. Box_Node is used to place a warning on
-- a redundant others_box.
procedure Add_Association
(Component : Entity_Id;
Expr : Node_Id;
Assoc_List : List_Id;
Is_Box_Present : Boolean := False);
-- Builds a new N_Component_Association node which associates Component
-- to expression Expr and adds it to the association list being built,
-- either New_Assoc_List, or the association being built for an inner
-- aggregate.
procedure Add_Discriminant_Values
(New_Aggr : Node_Id;
Assoc_List : List_Id);
-- The constraint to a component may be given by a discriminant of the
-- enclosing type, in which case we have to retrieve its value, which is
-- part of the enclosing aggregate. Assoc_List provides the discriminant
-- associations of the current type or of some enclosing record.
function Discriminant_Present (Input_Discr : Entity_Id) return Boolean;
-- If aggregate N is a regular aggregate this routine will return True.
-- Otherwise, if N is an extension aggregate, then Input_Discr denotes
-- a discriminant whose value may already have been specified by N's
-- ancestor part. This routine checks whether this is indeed the case
-- and if so returns False, signaling that no value for Input_Discr
-- should appear in N's aggregate part. Also, in this case, the routine
-- appends to New_Assoc_List the discriminant value specified in the
-- ancestor part.
--
-- If the aggregate is in a context with expansion delayed, it will be
-- reanalyzed. The inherited discriminant values must not be reinserted
-- in the component list to prevent spurious errors, but they must be
-- present on first analysis to build the proper subtype indications.
-- The flag Inherited_Discriminant is used to prevent the re-insertion.
function Find_Private_Ancestor (Typ : Entity_Id) return Entity_Id;
-- AI05-0115: Find earlier ancestor in the derivation chain that is
-- derived from private view Typ. Whether the aggregate is legal depends
-- on the current visibility of the type as well as that of the parent
-- of the ancestor.
function Get_Value
(Compon : Entity_Id;
From : List_Id;
Consider_Others_Choice : Boolean := False) return Node_Id;
-- Given a record component stored in parameter Compon, this function
-- returns its value as it appears in the list From, which is a list
-- of N_Component_Association nodes.
--
-- If no component association has a choice for the searched component,
-- the value provided by the others choice is returned, if there is one,
-- and Consider_Others_Choice is set to true. Otherwise Empty is
-- returned. If there is more than one component association giving a
-- value for the searched record component, an error message is emitted
-- and the first found value is returned.
--
-- If Consider_Others_Choice is set and the returned expression comes
-- from the others choice, then Others_Etype is set as a side effect.
-- An error message is emitted if the components taking their value from
-- the others choice do not have same type.
procedure Propagate_Discriminants
(Aggr : Node_Id;
Assoc_List : List_Id);
-- Nested components may themselves be discriminated types constrained
-- by outer discriminants, whose values must be captured before the
-- aggregate is expanded into assignments.
procedure Resolve_Aggr_Expr (Expr : Node_Id; Component : Entity_Id);
-- Analyzes and resolves expression Expr against the Etype of the
-- Component. This routine also applies all appropriate checks to Expr.
-- It finally saves a Expr in the newly created association list that
-- will be attached to the final record aggregate. Note that if the
-- Parent pointer of Expr is not set then Expr was produced with a
-- New_Copy_Tree or some such.
procedure Rewrite_Range (Root_Type : Entity_Id; Rge : Node_Id);
-- Rewrite a range node Rge when its bounds refer to non-stored
-- discriminants from Root_Type, to replace them with the stored
-- discriminant values. This is required in GNATprove mode, and is
-- adopted in all modes to avoid special-casing GNATprove mode.
---------------------
-- Add_Association --
---------------------
procedure Add_Association
(Component : Entity_Id;
Expr : Node_Id;
Assoc_List : List_Id;
Is_Box_Present : Boolean := False)
is
Choice_List : constant List_Id := New_List;
Loc : Source_Ptr;
begin
-- If this is a box association the expression is missing, so use the
-- Sloc of the aggregate itself for the new association.
pragma Assert (Present (Expr) xor Is_Box_Present);
if Present (Expr) then
Loc := Sloc (Expr);
else
Loc := Sloc (N);
end if;
Append_To (Choice_List, New_Occurrence_Of (Component, Loc));
Append_To (Assoc_List,
Make_Component_Association (Loc,
Choices => Choice_List,
Expression => Expr,
Box_Present => Is_Box_Present));
end Add_Association;
-----------------------------
-- Add_Discriminant_Values --
-----------------------------
procedure Add_Discriminant_Values
(New_Aggr : Node_Id;
Assoc_List : List_Id)
is
Assoc : Node_Id;
Discr : Entity_Id;
Discr_Elmt : Elmt_Id;
Discr_Val : Node_Id;
Val : Entity_Id;
begin
Discr := First_Discriminant (Etype (New_Aggr));
Discr_Elmt := First_Elmt (Discriminant_Constraint (Etype (New_Aggr)));
while Present (Discr_Elmt) loop
Discr_Val := Node (Discr_Elmt);
-- If the constraint is given by a discriminant then it is a
-- discriminant of an enclosing record, and its value has already
-- been placed in the association list.
if Is_Entity_Name (Discr_Val)
and then Ekind (Entity (Discr_Val)) = E_Discriminant
then
Val := Entity (Discr_Val);
Assoc := First (Assoc_List);
while Present (Assoc) loop
if Present (Entity (First (Choices (Assoc))))
and then Entity (First (Choices (Assoc))) = Val
then
Discr_Val := Expression (Assoc);
exit;
end if;
Next (Assoc);
end loop;
end if;
Add_Association
(Discr, New_Copy_Tree (Discr_Val),
Component_Associations (New_Aggr));
-- If the discriminant constraint is a current instance, mark the
-- current aggregate so that the self-reference can be expanded
-- later. The constraint may refer to the subtype of aggregate, so
-- use base type for comparison.
if Nkind (Discr_Val) = N_Attribute_Reference
and then Is_Entity_Name (Prefix (Discr_Val))
and then Is_Type (Entity (Prefix (Discr_Val)))
and then Base_Type (Etype (N)) = Entity (Prefix (Discr_Val))
then
Set_Has_Self_Reference (N);
end if;
Next_Elmt (Discr_Elmt);
Next_Discriminant (Discr);
end loop;
end Add_Discriminant_Values;
--------------------------
-- Discriminant_Present --
--------------------------
function Discriminant_Present (Input_Discr : Entity_Id) return Boolean is
Regular_Aggr : constant Boolean := Nkind (N) /= N_Extension_Aggregate;
Ancestor_Is_Subtyp : Boolean;
Loc : Source_Ptr;
Ancestor : Node_Id;
Ancestor_Typ : Entity_Id;
Comp_Assoc : Node_Id;
Discr : Entity_Id;
Discr_Expr : Node_Id;
Discr_Val : Elmt_Id := No_Elmt;
Orig_Discr : Entity_Id;
begin
if Regular_Aggr then
return True;
end if;
-- Check whether inherited discriminant values have already been
-- inserted in the aggregate. This will be the case if we are
-- re-analyzing an aggregate whose expansion was delayed.
if Present (Component_Associations (N)) then
Comp_Assoc := First (Component_Associations (N));
while Present (Comp_Assoc) loop
if Inherited_Discriminant (Comp_Assoc) then
return True;
end if;
Next (Comp_Assoc);
end loop;
end if;
Ancestor := Ancestor_Part (N);
Ancestor_Typ := Etype (Ancestor);
Loc := Sloc (Ancestor);
-- For a private type with unknown discriminants, use the underlying
-- record view if it is available.
if Has_Unknown_Discriminants (Ancestor_Typ)
and then Present (Full_View (Ancestor_Typ))
and then Present (Underlying_Record_View (Full_View (Ancestor_Typ)))
then
Ancestor_Typ := Underlying_Record_View (Full_View (Ancestor_Typ));
end if;
Ancestor_Is_Subtyp :=
Is_Entity_Name (Ancestor) and then Is_Type (Entity (Ancestor));
-- If the ancestor part has no discriminants clearly N's aggregate
-- part must provide a value for Discr.
if not Has_Discriminants (Ancestor_Typ) then
return True;
-- If the ancestor part is an unconstrained subtype mark then the
-- Discr must be present in N's aggregate part.
elsif Ancestor_Is_Subtyp
and then not Is_Constrained (Entity (Ancestor))
then
return True;
end if;
-- Now look to see if Discr was specified in the ancestor part
if Ancestor_Is_Subtyp then
Discr_Val :=
First_Elmt (Discriminant_Constraint (Entity (Ancestor)));
end if;
Orig_Discr := Original_Record_Component (Input_Discr);
Discr := First_Discriminant (Ancestor_Typ);
while Present (Discr) loop
-- If Ancestor has already specified Disc value then insert its
-- value in the final aggregate.
if Original_Record_Component (Discr) = Orig_Discr then
if Ancestor_Is_Subtyp then
Discr_Expr := New_Copy_Tree (Node (Discr_Val));
else
Discr_Expr :=
Make_Selected_Component (Loc,
Prefix => Duplicate_Subexpr (Ancestor),
Selector_Name => New_Occurrence_Of (Input_Discr, Loc));
end if;
Resolve_Aggr_Expr (Discr_Expr, Input_Discr);
Set_Inherited_Discriminant (Last (New_Assoc_List));
return False;
end if;
Next_Discriminant (Discr);
if Ancestor_Is_Subtyp then
Next_Elmt (Discr_Val);
end if;
end loop;
return True;
end Discriminant_Present;
---------------------------
-- Find_Private_Ancestor --
---------------------------
function Find_Private_Ancestor (Typ : Entity_Id) return Entity_Id is
Par : Entity_Id;
begin
Par := Typ;
loop
if Has_Private_Ancestor (Par)
and then not Has_Private_Ancestor (Etype (Base_Type (Par)))
then
return Par;
elsif not Is_Derived_Type (Par) then
return Empty;
else
Par := Etype (Base_Type (Par));
end if;
end loop;
end Find_Private_Ancestor;
---------------
-- Get_Value --
---------------
function Get_Value
(Compon : Entity_Id;
From : List_Id;
Consider_Others_Choice : Boolean := False) return Node_Id
is
Typ : constant Entity_Id := Etype (Compon);
Assoc : Node_Id;
Expr : Node_Id := Empty;
Selector_Name : Node_Id;
begin
Is_Box_Present := False;
if No (From) then
return Empty;
end if;
Assoc := First (From);
while Present (Assoc) loop
Selector_Name := First (Choices (Assoc));
while Present (Selector_Name) loop
if Nkind (Selector_Name) = N_Others_Choice then
if Consider_Others_Choice and then No (Expr) then
-- We need to duplicate the expression for each
-- successive component covered by the others choice.
-- This is redundant if the others_choice covers only
-- one component (small optimization possible???), but
-- indispensable otherwise, because each one must be
-- expanded individually to preserve side effects.
-- Ada 2005 (AI-287): In case of default initialization
-- of components, we duplicate the corresponding default
-- expression (from the record type declaration). The
-- copy must carry the sloc of the association (not the
-- original expression) to prevent spurious elaboration
-- checks when the default includes function calls.
if Box_Present (Assoc) then
Others_Box := Others_Box + 1;
Is_Box_Present := True;
if Expander_Active then
return
New_Copy_Tree_And_Copy_Dimensions
(Expression (Parent (Compon)),
New_Sloc => Sloc (Assoc));
else
return Expression (Parent (Compon));
end if;
else
if Present (Others_Etype)
and then Base_Type (Others_Etype) /= Base_Type (Typ)
then
-- If the components are of an anonymous access
-- type they are distinct, but this is legal in
-- Ada 2012 as long as designated types match.
if (Ekind (Typ) = E_Anonymous_Access_Type
or else Ekind (Typ) =
E_Anonymous_Access_Subprogram_Type)
and then Designated_Type (Typ) =
Designated_Type (Others_Etype)
then
null;
else
Error_Msg_N
("components in OTHERS choice must have same "
& "type", Selector_Name);
end if;
end if;
Others_Etype := Typ;
-- Copy the expression so that it is resolved
-- independently for each component, This is needed
-- for accessibility checks on components of anonymous
-- access types, even in compile_only mode.
if not Inside_A_Generic then
return
New_Copy_Tree_And_Copy_Dimensions
(Expression (Assoc));
else
return Expression (Assoc);
end if;
end if;
end if;
elsif Chars (Compon) = Chars (Selector_Name) then
if No (Expr) then
-- Ada 2005 (AI-231)
if Ada_Version >= Ada_2005
and then Known_Null (Expression (Assoc))
then
Check_Can_Never_Be_Null (Compon, Expression (Assoc));
end if;
-- We need to duplicate the expression when several
-- components are grouped together with a "|" choice.
-- For instance "filed1 | filed2 => Expr"
-- Ada 2005 (AI-287)
if Box_Present (Assoc) then
Is_Box_Present := True;
-- Duplicate the default expression of the component
-- from the record type declaration, so a new copy
-- can be attached to the association.
-- Note that we always copy the default expression,
-- even when the association has a single choice, in
-- order to create a proper association for the
-- expanded aggregate.
-- Component may have no default, in which case the
-- expression is empty and the component is default-
-- initialized, but an association for the component
-- exists, and it is not covered by an others clause.
-- Scalar and private types have no initialization
-- procedure, so they remain uninitialized. If the
-- target of the aggregate is a constant this
-- deserves a warning.
if No (Expression (Parent (Compon)))
and then not Has_Non_Null_Base_Init_Proc (Typ)
and then not Has_Aspect (Typ, Aspect_Default_Value)
and then not Is_Concurrent_Type (Typ)
and then Nkind (Parent (N)) = N_Object_Declaration
and then Constant_Present (Parent (N))
then
Error_Msg_Node_2 := Typ;
Error_Msg_NE
("component&? of type& is uninitialized",
Assoc, Selector_Name);
-- An additional reminder if the component type
-- is a generic formal.
if Is_Generic_Type (Base_Type (Typ)) then
Error_Msg_NE
("\instance should provide actual type with "
& "initialization for&", Assoc, Typ);
end if;
end if;
return
New_Copy_Tree_And_Copy_Dimensions
(Expression (Parent (Compon)));
else
if Present (Next (Selector_Name)) then
Expr := New_Copy_Tree_And_Copy_Dimensions
(Expression (Assoc));
else
Expr := Expression (Assoc);
end if;
end if;
Generate_Reference (Compon, Selector_Name, 'm');
else
Error_Msg_NE
("more than one value supplied for &",
Selector_Name, Compon);
end if;
end if;
Next (Selector_Name);
end loop;
Next (Assoc);
end loop;
return Expr;
end Get_Value;
-----------------------------
-- Propagate_Discriminants --
-----------------------------
procedure Propagate_Discriminants
(Aggr : Node_Id;
Assoc_List : List_Id)
is
Loc : constant Source_Ptr := Sloc (N);
procedure Process_Component (Comp : Entity_Id);
-- Add one component with a box association to the inner aggregate,
-- and recurse if component is itself composite.
-----------------------
-- Process_Component --
-----------------------
procedure Process_Component (Comp : Entity_Id) is
T : constant Entity_Id := Etype (Comp);
New_Aggr : Node_Id;
begin
if Is_Record_Type (T) and then Has_Discriminants (T) then
New_Aggr := Make_Aggregate (Loc, No_List, New_List);
Set_Etype (New_Aggr, T);
Add_Association
(Comp, New_Aggr, Component_Associations (Aggr));
-- Collect discriminant values and recurse
Add_Discriminant_Values (New_Aggr, Assoc_List);
Propagate_Discriminants (New_Aggr, Assoc_List);
Build_Constrained_Itype
(New_Aggr, T, Component_Associations (New_Aggr));
else
Add_Association
(Comp, Empty, Component_Associations (Aggr),
Is_Box_Present => True);
end if;
end Process_Component;
-- Local variables
Aggr_Type : constant Entity_Id := Base_Type (Etype (Aggr));
Components : constant Elist_Id := New_Elmt_List;
Def_Node : constant Node_Id :=
Type_Definition (Declaration_Node (Aggr_Type));
Comp : Node_Id;
Comp_Elmt : Elmt_Id;
Errors : Boolean;
-- Start of processing for Propagate_Discriminants
begin
-- The component type may be a variant type. Collect the components
-- that are ruled by the known values of the discriminants. Their
-- values have already been inserted into the component list of the
-- current aggregate.
if Nkind (Def_Node) = N_Record_Definition
and then Present (Component_List (Def_Node))
and then Present (Variant_Part (Component_List (Def_Node)))
then
Gather_Components (Aggr_Type,
Component_List (Def_Node),
Governed_By => Component_Associations (Aggr),
Into => Components,
Report_Errors => Errors);
Comp_Elmt := First_Elmt (Components);
while Present (Comp_Elmt) loop
if Ekind (Node (Comp_Elmt)) /= E_Discriminant then
Process_Component (Node (Comp_Elmt));
end if;
Next_Elmt (Comp_Elmt);
end loop;
-- No variant part, iterate over all components
else
Comp := First_Component (Etype (Aggr));
while Present (Comp) loop
Process_Component (Comp);
Next_Component (Comp);
end loop;
end if;
end Propagate_Discriminants;
-----------------------
-- Resolve_Aggr_Expr --
-----------------------
procedure Resolve_Aggr_Expr (Expr : Node_Id; Component : Entity_Id) is
function Has_Expansion_Delayed (Expr : Node_Id) return Boolean;
-- If the expression is an aggregate (possibly qualified) then its
-- expansion is delayed until the enclosing aggregate is expanded
-- into assignments. In that case, do not generate checks on the
-- expression, because they will be generated later, and will other-
-- wise force a copy (to remove side effects) that would leave a
-- dynamic-sized aggregate in the code, something that gigi cannot
-- handle.
---------------------------
-- Has_Expansion_Delayed --
---------------------------
function Has_Expansion_Delayed (Expr : Node_Id) return Boolean is
begin
return
(Nkind (Expr) in N_Aggregate | N_Extension_Aggregate
and then Present (Etype (Expr))
and then Is_Record_Type (Etype (Expr))
and then Expansion_Delayed (Expr))
or else
(Nkind (Expr) = N_Qualified_Expression
and then Has_Expansion_Delayed (Expression (Expr)));
end Has_Expansion_Delayed;
-- Local variables
Expr_Type : Entity_Id := Empty;
New_C : Entity_Id := Component;
New_Expr : Node_Id;
Relocate : Boolean;
-- Set to True if the resolved Expr node needs to be relocated when
-- attached to the newly created association list. This node need not
-- be relocated if its parent pointer is not set. In fact in this
-- case Expr is the output of a New_Copy_Tree call. If Relocate is
-- True then we have analyzed the expression node in the original
-- aggregate and hence it needs to be relocated when moved over to
-- the new association list.
-- Start of processing for Resolve_Aggr_Expr
begin
-- If the type of the component is elementary or the type of the
-- aggregate does not contain discriminants, use the type of the
-- component to resolve Expr.
if Is_Elementary_Type (Etype (Component))
or else not Has_Discriminants (Etype (N))
then
Expr_Type := Etype (Component);
-- Otherwise we have to pick up the new type of the component from
-- the new constrained subtype of the aggregate. In fact components
-- which are of a composite type might be constrained by a
-- discriminant, and we want to resolve Expr against the subtype were
-- all discriminant occurrences are replaced with their actual value.
else
New_C := First_Component (Etype (N));
while Present (New_C) loop
if Chars (New_C) = Chars (Component) then
Expr_Type := Etype (New_C);
exit;
end if;
Next_Component (New_C);
end loop;
pragma Assert (Present (Expr_Type));
-- For each range in an array type where a discriminant has been
-- replaced with the constraint, check that this range is within
-- the range of the base type. This checks is done in the init
-- proc for regular objects, but has to be done here for
-- aggregates since no init proc is called for them.
if Is_Array_Type (Expr_Type) then
declare
Index : Node_Id;
-- Range of the current constrained index in the array
Orig_Index : Node_Id := First_Index (Etype (Component));
-- Range corresponding to the range Index above in the
-- original unconstrained record type. The bounds of this
-- range may be governed by discriminants.
Unconstr_Index : Node_Id := First_Index (Etype (Expr_Type));
-- Range corresponding to the range Index above for the
-- unconstrained array type. This range is needed to apply
-- range checks.
begin
Index := First_Index (Expr_Type);
while Present (Index) loop
if Depends_On_Discriminant (Orig_Index) then
Apply_Range_Check (Index, Etype (Unconstr_Index));
end if;
Next_Index (Index);
Next_Index (Orig_Index);
Next_Index (Unconstr_Index);
end loop;
end;
end if;
end if;
-- If the Parent pointer of Expr is not set, Expr is an expression
-- duplicated by New_Tree_Copy (this happens for record aggregates
-- that look like (Field1 | Filed2 => Expr) or (others => Expr)).
-- Such a duplicated expression must be attached to the tree
-- before analysis and resolution to enforce the rule that a tree
-- fragment should never be analyzed or resolved unless it is
-- attached to the current compilation unit.
if No (Parent (Expr)) then
Set_Parent (Expr, N);
Relocate := False;
else
Relocate := True;
end if;
Analyze_And_Resolve (Expr, Expr_Type);
Check_Expr_OK_In_Limited_Aggregate (Expr);
Check_Non_Static_Context (Expr);
Check_Unset_Reference (Expr);
-- Check wrong use of class-wide types
if Is_Class_Wide_Type (Etype (Expr)) then
Error_Msg_N ("dynamically tagged expression not allowed", Expr);
end if;
if not Has_Expansion_Delayed (Expr) then
Aggregate_Constraint_Checks (Expr, Expr_Type);
end if;
-- If an aggregate component has a type with predicates, an explicit
-- predicate check must be applied, as for an assignment statement,
-- because the aggregate might not be expanded into individual
-- component assignments.
if Has_Predicates (Expr_Type)
and then Analyzed (Expr)
then
Apply_Predicate_Check (Expr, Expr_Type);
end if;
if Raises_Constraint_Error (Expr) then
Set_Raises_Constraint_Error (N);
end if;
-- If the expression has been marked as requiring a range check, then
-- generate it here. It's a bit odd to be generating such checks in
-- the analyzer, but harmless since Generate_Range_Check does nothing
-- (other than making sure Do_Range_Check is set) if the expander is
-- not active.
if Do_Range_Check (Expr) then
Generate_Range_Check (Expr, Expr_Type, CE_Range_Check_Failed);
end if;
-- Add association Component => Expr if the caller requests it
if Relocate then
New_Expr := Relocate_Node (Expr);
-- Since New_Expr is not gonna be analyzed later on, we need to
-- propagate here the dimensions form Expr to New_Expr.
Copy_Dimensions (Expr, New_Expr);
else
New_Expr := Expr;
end if;
Add_Association (New_C, New_Expr, New_Assoc_List);
end Resolve_Aggr_Expr;
-------------------
-- Rewrite_Range --
-------------------
procedure Rewrite_Range (Root_Type : Entity_Id; Rge : Node_Id) is
procedure Rewrite_Bound
(Bound : Node_Id;
Disc : Entity_Id;
Expr_Disc : Node_Id);
-- Rewrite a bound of the range Bound, when it is equal to the
-- non-stored discriminant Disc, into the stored discriminant
-- value Expr_Disc.
-------------------
-- Rewrite_Bound --
-------------------
procedure Rewrite_Bound
(Bound : Node_Id;
Disc : Entity_Id;
Expr_Disc : Node_Id)
is
begin
if Nkind (Bound) /= N_Identifier then
return;
end if;
-- We expect either the discriminant or the discriminal
if Entity (Bound) = Disc
or else (Ekind (Entity (Bound)) = E_In_Parameter
and then Discriminal_Link (Entity (Bound)) = Disc)
then
Rewrite (Bound, New_Copy_Tree (Expr_Disc));
end if;
end Rewrite_Bound;
-- Local variables
Low, High : Node_Id;
Disc : Entity_Id;
Expr_Disc : Elmt_Id;
-- Start of processing for Rewrite_Range
begin
if Has_Discriminants (Root_Type) and then Nkind (Rge) = N_Range then
Low := Low_Bound (Rge);
High := High_Bound (Rge);
Disc := First_Discriminant (Root_Type);
Expr_Disc := First_Elmt (Stored_Constraint (Etype (N)));
while Present (Disc) loop
Rewrite_Bound (Low, Disc, Node (Expr_Disc));
Rewrite_Bound (High, Disc, Node (Expr_Disc));
Next_Discriminant (Disc);
Next_Elmt (Expr_Disc);
end loop;
end if;
end Rewrite_Range;
-- Local variables
Components : constant Elist_Id := New_Elmt_List;
-- Components is the list of the record components whose value must be
-- provided in the aggregate. This list does include discriminants.
Component : Entity_Id;
Component_Elmt : Elmt_Id;
Expr : Node_Id;
Positional_Expr : Node_Id;
-- Start of processing for Resolve_Record_Aggregate
begin
-- A record aggregate is restricted in SPARK:
-- Each named association can have only a single choice.
-- OTHERS cannot be used.
-- Positional and named associations cannot be mixed.
if Present (Component_Associations (N))
and then Present (First (Component_Associations (N)))
then
declare
Assoc : Node_Id;
begin
Assoc := First (Component_Associations (N));
while Present (Assoc) loop
if Nkind (Assoc) = N_Iterated_Component_Association then
Error_Msg_N
("iterated component association can only appear in an "
& "array aggregate", N);
raise Unrecoverable_Error;
end if;
Next (Assoc);
end loop;
end;
end if;
-- We may end up calling Duplicate_Subexpr on expressions that are
-- attached to New_Assoc_List. For this reason we need to attach it
-- to the tree by setting its parent pointer to N. This parent point
-- will change in STEP 8 below.
Set_Parent (New_Assoc_List, N);
-- STEP 1: abstract type and null record verification
if Is_Abstract_Type (Typ) then
Error_Msg_N ("type of aggregate cannot be abstract", N);
end if;
if No (First_Entity (Typ)) and then Null_Record_Present (N) then
Set_Etype (N, Typ);
return;
elsif Present (First_Entity (Typ))
and then Null_Record_Present (N)
and then not Is_Tagged_Type (Typ)
then
Error_Msg_N ("record aggregate cannot be null", N);
return;
-- If the type has no components, then the aggregate should either
-- have "null record", or in Ada 2005 it could instead have a single
-- component association given by "others => <>". For Ada 95 we flag an
-- error at this point, but for Ada 2005 we proceed with checking the
-- associations below, which will catch the case where it's not an
-- aggregate with "others => <>". Note that the legality of a <>
-- aggregate for a null record type was established by AI05-016.
elsif No (First_Entity (Typ))
and then Ada_Version < Ada_2005
then
Error_Msg_N ("record aggregate must be null", N);
return;
end if;
-- STEP 2: Verify aggregate structure
Step_2 : declare
Assoc : Node_Id;
Bad_Aggregate : Boolean := False;
Selector_Name : Node_Id;
begin
if Present (Component_Associations (N)) then
Assoc := First (Component_Associations (N));
else
Assoc := Empty;
end if;
while Present (Assoc) loop
Selector_Name := First (Choices (Assoc));
while Present (Selector_Name) loop
if Nkind (Selector_Name) = N_Identifier then
null;
elsif Nkind (Selector_Name) = N_Others_Choice then
if Selector_Name /= First (Choices (Assoc))
or else Present (Next (Selector_Name))
then
Error_Msg_N
("OTHERS must appear alone in a choice list",
Selector_Name);
return;
elsif Present (Next (Assoc)) then
Error_Msg_N
("OTHERS must appear last in an aggregate",
Selector_Name);
return;
-- (Ada 2005): If this is an association with a box,
-- indicate that the association need not represent
-- any component.
elsif Box_Present (Assoc) then
Others_Box := 1;
Box_Node := Assoc;
end if;
else
Error_Msg_N
("selector name should be identifier or OTHERS",
Selector_Name);
Bad_Aggregate := True;
end if;
Next (Selector_Name);
end loop;
Next (Assoc);
end loop;
if Bad_Aggregate then
return;
end if;
end Step_2;
-- STEP 3: Find discriminant Values
Step_3 : declare
Discrim : Entity_Id;
Missing_Discriminants : Boolean := False;
begin
if Present (Expressions (N)) then
Positional_Expr := First (Expressions (N));
else
Positional_Expr := Empty;
end if;
-- AI05-0115: if the ancestor part is a subtype mark, the ancestor
-- must not have unknown discriminants.
-- ??? We are not checking any subtype mark here and this code is not
-- exercised by any test, so it's likely wrong (in particular
-- we should not use Root_Type here but the subtype mark, if any),
-- and possibly not needed.
if Is_Derived_Type (Typ)
and then Has_Unknown_Discriminants (Root_Type (Typ))
and then Nkind (N) /= N_Extension_Aggregate
then
Error_Msg_NE
("aggregate not available for type& whose ancestor "
& "has unknown discriminants ", N, Typ);
end if;
if Has_Unknown_Discriminants (Typ)
and then Present (Underlying_Record_View (Typ))
then
Discrim := First_Discriminant (Underlying_Record_View (Typ));
elsif Has_Discriminants (Typ) then
Discrim := First_Discriminant (Typ);
else
Discrim := Empty;
end if;
-- First find the discriminant values in the positional components
while Present (Discrim) and then Present (Positional_Expr) loop
if Discriminant_Present (Discrim) then
Resolve_Aggr_Expr (Positional_Expr, Discrim);
-- Ada 2005 (AI-231)
if Ada_Version >= Ada_2005
and then Known_Null (Positional_Expr)
then
Check_Can_Never_Be_Null (Discrim, Positional_Expr);
end if;
Next (Positional_Expr);
end if;
if Present (Get_Value (Discrim, Component_Associations (N))) then
Error_Msg_NE
("more than one value supplied for discriminant&",
N, Discrim);
end if;
Next_Discriminant (Discrim);
end loop;
-- Find remaining discriminant values if any among named components
while Present (Discrim) loop
Expr := Get_Value (Discrim, Component_Associations (N), True);
if not Discriminant_Present (Discrim) then
if Present (Expr) then
Error_Msg_NE
("more than one value supplied for discriminant &",
N, Discrim);
end if;
elsif No (Expr) then
Error_Msg_NE
("no value supplied for discriminant &", N, Discrim);
Missing_Discriminants := True;
else
Resolve_Aggr_Expr (Expr, Discrim);
end if;
Next_Discriminant (Discrim);
end loop;
if Missing_Discriminants then
return;
end if;
-- At this point and until the beginning of STEP 6, New_Assoc_List
-- contains only the discriminants and their values.
end Step_3;
-- STEP 4: Set the Etype of the record aggregate
if Has_Discriminants (Typ)
or else (Has_Unknown_Discriminants (Typ)
and then Present (Underlying_Record_View (Typ)))
then
Build_Constrained_Itype (N, Typ, New_Assoc_List);
else
Set_Etype (N, Typ);
end if;
-- STEP 5: Get remaining components according to discriminant values
Step_5 : declare
Dnode : Node_Id;
Errors_Found : Boolean := False;
Record_Def : Node_Id;
Parent_Typ : Entity_Id;
Parent_Typ_List : Elist_Id;
Parent_Elmt : Elmt_Id;
Root_Typ : Entity_Id;
begin
if Is_Derived_Type (Typ) and then Is_Tagged_Type (Typ) then
Parent_Typ_List := New_Elmt_List;
-- If this is an extension aggregate, the component list must
-- include all components that are not in the given ancestor type.
-- Otherwise, the component list must include components of all
-- ancestors, starting with the root.
if Nkind (N) = N_Extension_Aggregate then
Root_Typ := Base_Type (Etype (Ancestor_Part (N)));
else
-- AI05-0115: check legality of aggregate for type with a
-- private ancestor.
Root_Typ := Root_Type (Typ);
if Has_Private_Ancestor (Typ) then
declare
Ancestor : constant Entity_Id :=
Find_Private_Ancestor (Typ);
Ancestor_Unit : constant Entity_Id :=
Cunit_Entity
(Get_Source_Unit (Ancestor));
Parent_Unit : constant Entity_Id :=
Cunit_Entity (Get_Source_Unit
(Base_Type (Etype (Ancestor))));
begin
-- Check whether we are in a scope that has full view
-- over the private ancestor and its parent. This can
-- only happen if the derivation takes place in a child
-- unit of the unit that declares the parent, and we are
-- in the private part or body of that child unit, else
-- the aggregate is illegal.
if Is_Child_Unit (Ancestor_Unit)
and then Scope (Ancestor_Unit) = Parent_Unit
and then In_Open_Scopes (Scope (Ancestor))
and then
(In_Private_Part (Scope (Ancestor))
or else In_Package_Body (Scope (Ancestor)))
then
null;
else
Error_Msg_NE
("type of aggregate has private ancestor&!",
N, Root_Typ);
Error_Msg_N ("must use extension aggregate!", N);
return;
end if;
end;
end if;
Dnode := Declaration_Node (Base_Type (Root_Typ));
-- If we don't get a full declaration, then we have some error
-- which will get signalled later so skip this part. Otherwise
-- gather components of root that apply to the aggregate type.
-- We use the base type in case there is an applicable stored
-- constraint that renames the discriminants of the root.
if Nkind (Dnode) = N_Full_Type_Declaration then
Record_Def := Type_Definition (Dnode);
Gather_Components
(Base_Type (Typ),
Component_List (Record_Def),
Governed_By => New_Assoc_List,
Into => Components,
Report_Errors => Errors_Found);
if Errors_Found then
Error_Msg_N
("discriminant controlling variant part is not static",
N);
return;
end if;
end if;
end if;
Parent_Typ := Base_Type (Typ);
while Parent_Typ /= Root_Typ loop
Prepend_Elmt (Parent_Typ, To => Parent_Typ_List);
Parent_Typ := Etype (Parent_Typ);
if Nkind (Parent (Base_Type (Parent_Typ))) =
N_Private_Type_Declaration
or else Nkind (Parent (Base_Type (Parent_Typ))) =
N_Private_Extension_Declaration
then
if Nkind (N) /= N_Extension_Aggregate then
Error_Msg_NE
("type of aggregate has private ancestor&!",
N, Parent_Typ);
Error_Msg_N ("must use extension aggregate!", N);
return;
elsif Parent_Typ /= Root_Typ then
Error_Msg_NE
("ancestor part of aggregate must be private type&",
Ancestor_Part (N), Parent_Typ);
return;
end if;
-- The current view of ancestor part may be a private type,
-- while the context type is always non-private.
elsif Is_Private_Type (Root_Typ)
and then Present (Full_View (Root_Typ))
and then Nkind (N) = N_Extension_Aggregate
then
exit when Base_Type (Full_View (Root_Typ)) = Parent_Typ;
end if;
end loop;
-- Now collect components from all other ancestors, beginning
-- with the current type. If the type has unknown discriminants
-- use the component list of the Underlying_Record_View, which
-- needs to be used for the subsequent expansion of the aggregate
-- into assignments.
Parent_Elmt := First_Elmt (Parent_Typ_List);
while Present (Parent_Elmt) loop
Parent_Typ := Node (Parent_Elmt);
if Has_Unknown_Discriminants (Parent_Typ)
and then Present (Underlying_Record_View (Typ))
then
Parent_Typ := Underlying_Record_View (Parent_Typ);
end if;
Record_Def := Type_Definition (Parent (Base_Type (Parent_Typ)));
Gather_Components (Empty,
Component_List (Record_Extension_Part (Record_Def)),
Governed_By => New_Assoc_List,
Into => Components,
Report_Errors => Errors_Found);
Next_Elmt (Parent_Elmt);
end loop;
-- Typ is not a derived tagged type
else
Record_Def := Type_Definition (Parent (Base_Type (Typ)));
if Null_Present (Record_Def) then
null;
elsif not Has_Unknown_Discriminants (Typ) then
Gather_Components
(Base_Type (Typ),
Component_List (Record_Def),
Governed_By => New_Assoc_List,
Into => Components,
Report_Errors => Errors_Found);
else
Gather_Components
(Base_Type (Underlying_Record_View (Typ)),
Component_List (Record_Def),
Governed_By => New_Assoc_List,
Into => Components,
Report_Errors => Errors_Found);
end if;
end if;
if Errors_Found then
return;
end if;
end Step_5;
-- STEP 6: Find component Values
Component := Empty;
Component_Elmt := First_Elmt (Components);
-- First scan the remaining positional associations in the aggregate.
-- Remember that at this point Positional_Expr contains the current
-- positional association if any is left after looking for discriminant
-- values in step 3.
while Present (Positional_Expr) and then Present (Component_Elmt) loop
Component := Node (Component_Elmt);
Resolve_Aggr_Expr (Positional_Expr, Component);
-- Ada 2005 (AI-231)
if Ada_Version >= Ada_2005 and then Known_Null (Positional_Expr) then
Check_Can_Never_Be_Null (Component, Positional_Expr);
end if;
if Present (Get_Value (Component, Component_Associations (N))) then
Error_Msg_NE
("more than one value supplied for Component &", N, Component);
end if;
Next (Positional_Expr);
Next_Elmt (Component_Elmt);
end loop;
if Present (Positional_Expr) then
Error_Msg_N
("too many components for record aggregate", Positional_Expr);
end if;
-- Now scan for the named arguments of the aggregate
while Present (Component_Elmt) loop
Component := Node (Component_Elmt);
Expr := Get_Value (Component, Component_Associations (N), True);
-- Note: The previous call to Get_Value sets the value of the
-- variable Is_Box_Present.
-- Ada 2005 (AI-287): Handle components with default initialization.
-- Note: This feature was originally added to Ada 2005 for limited
-- but it was finally allowed with any type.
if Is_Box_Present then
Check_Box_Component : declare
Ctyp : constant Entity_Id := Etype (Component);
begin
-- If there is a default expression for the aggregate, copy
-- it into a new association. This copy must modify the scopes
-- of internal types that may be attached to the expression
-- (e.g. index subtypes of arrays) because in general the type
-- declaration and the aggregate appear in different scopes,
-- and the backend requires the scope of the type to match the
-- point at which it is elaborated.
-- If the component has an initialization procedure (IP) we
-- pass the component to the expander, which will generate
-- the call to such IP.
-- If the component has discriminants, their values must
-- be taken from their subtype. This is indispensable for
-- constraints that are given by the current instance of an
-- enclosing type, to allow the expansion of the aggregate to
-- replace the reference to the current instance by the target
-- object of the aggregate.
if Present (Parent (Component))
and then Nkind (Parent (Component)) = N_Component_Declaration
and then Present (Expression (Parent (Component)))
then
Expr :=
New_Copy_Tree_And_Copy_Dimensions
(Expression (Parent (Component)),
New_Scope => Current_Scope,
New_Sloc => Sloc (N));
-- As the type of the copied default expression may refer
-- to discriminants of the record type declaration, these
-- non-stored discriminants need to be rewritten into stored
-- discriminant values for the aggregate. This is required
-- in GNATprove mode, and is adopted in all modes to avoid
-- special-casing GNATprove mode.
if Is_Array_Type (Etype (Expr)) then
declare
Rec_Typ : constant Entity_Id := Scope (Component);
-- Root record type whose discriminants may be used as
-- bounds in range nodes.
Assoc : Node_Id;
Choice : Node_Id;
Index : Node_Id;
begin
-- Rewrite the range nodes occurring in the indexes
-- and their types.
Index := First_Index (Etype (Expr));
while Present (Index) loop
Rewrite_Range (Rec_Typ, Index);
Rewrite_Range
(Rec_Typ, Scalar_Range (Etype (Index)));
Next_Index (Index);
end loop;
-- Rewrite the range nodes occurring as aggregate
-- bounds and component associations.
if Nkind (Expr) = N_Aggregate then
if Present (Aggregate_Bounds (Expr)) then
Rewrite_Range (Rec_Typ, Aggregate_Bounds (Expr));
end if;
if Present (Component_Associations (Expr)) then
Assoc := First (Component_Associations (Expr));
while Present (Assoc) loop
Choice := First (Choices (Assoc));
while Present (Choice) loop
Rewrite_Range (Rec_Typ, Choice);
Next (Choice);
end loop;
Next (Assoc);
end loop;
end if;
end if;
end;
end if;
Add_Association
(Component => Component,
Expr => Expr,
Assoc_List => New_Assoc_List);
Set_Has_Self_Reference (N);
-- A box-defaulted access component gets the value null. Also
-- included are components of private types whose underlying
-- type is an access type. In either case set the type of the
-- literal, for subsequent use in semantic checks.
elsif Present (Underlying_Type (Ctyp))
and then Is_Access_Type (Underlying_Type (Ctyp))
then
-- If the component's type is private with an access type as
-- its underlying type then we have to create an unchecked
-- conversion to satisfy type checking.
if Is_Private_Type (Ctyp) then
declare
Qual_Null : constant Node_Id :=
Make_Qualified_Expression (Sloc (N),
Subtype_Mark =>
New_Occurrence_Of
(Underlying_Type (Ctyp), Sloc (N)),
Expression => Make_Null (Sloc (N)));
Convert_Null : constant Node_Id :=
Unchecked_Convert_To
(Ctyp, Qual_Null);
begin
Analyze_And_Resolve (Convert_Null, Ctyp);
Add_Association
(Component => Component,
Expr => Convert_Null,
Assoc_List => New_Assoc_List);
end;
-- Otherwise the component type is non-private
else
Expr := Make_Null (Sloc (N));
Set_Etype (Expr, Ctyp);
Add_Association
(Component => Component,
Expr => Expr,
Assoc_List => New_Assoc_List);
end if;
-- Ada 2012: If component is scalar with default value, use it
-- by converting it to Ctyp, so that subtype constraints are
-- checked.
elsif Is_Scalar_Type (Ctyp)
and then Has_Default_Aspect (Ctyp)
then
declare
Conv : constant Node_Id :=
Convert_To
(Typ => Ctyp,
Expr =>
New_Copy_Tree
(Default_Aspect_Value
(First_Subtype (Underlying_Type (Ctyp)))));
begin
Analyze_And_Resolve (Conv, Ctyp);
Add_Association
(Component => Component,
Expr => Conv,
Assoc_List => New_Assoc_List);
end;
elsif Has_Non_Null_Base_Init_Proc (Ctyp)
or else not Expander_Active
then
if Is_Record_Type (Ctyp)
and then Has_Discriminants (Ctyp)
and then not Is_Private_Type (Ctyp)
then
-- We build a partially initialized aggregate with the
-- values of the discriminants and box initialization
-- for the rest, if other components are present.
-- The type of the aggregate is the known subtype of
-- the component. The capture of discriminants must be
-- recursive because subcomponents may be constrained
-- (transitively) by discriminants of enclosing types.
-- For a private type with discriminants, a call to the
-- initialization procedure will be generated, and no
-- subaggregate is needed.
Capture_Discriminants : declare
Loc : constant Source_Ptr := Sloc (N);
Expr : Node_Id;
begin
Expr := Make_Aggregate (Loc, No_List, New_List);
Set_Etype (Expr, Ctyp);
-- If the enclosing type has discriminants, they have
-- been collected in the aggregate earlier, and they
-- may appear as constraints of subcomponents.
-- Similarly if this component has discriminants, they
-- might in turn be propagated to their components.
if Has_Discriminants (Typ) then
Add_Discriminant_Values (Expr, New_Assoc_List);
Propagate_Discriminants (Expr, New_Assoc_List);
elsif Has_Discriminants (Ctyp) then
Add_Discriminant_Values
(Expr, Component_Associations (Expr));
Propagate_Discriminants
(Expr, Component_Associations (Expr));
Build_Constrained_Itype
(Expr, Ctyp, Component_Associations (Expr));
else
declare
Comp : Entity_Id;
begin
-- If the type has additional components, create
-- an OTHERS box association for them.
Comp := First_Component (Ctyp);
while Present (Comp) loop
if Ekind (Comp) = E_Component then
if not Is_Record_Type (Etype (Comp)) then
Append_To
(Component_Associations (Expr),
Make_Component_Association (Loc,
Choices =>
New_List (
Make_Others_Choice (Loc)),
Expression => Empty,
Box_Present => True));
end if;
exit;
end if;
Next_Component (Comp);
end loop;
end;
end if;
Add_Association
(Component => Component,
Expr => Expr,
Assoc_List => New_Assoc_List);
end Capture_Discriminants;
-- Otherwise the component type is not a record, or it has
-- not discriminants, or it is private.
else
Add_Association
(Component => Component,
Expr => Empty,
Assoc_List => New_Assoc_List,
Is_Box_Present => True);
end if;
-- Otherwise we only need to resolve the expression if the
-- component has partially initialized values (required to
-- expand the corresponding assignments and run-time checks).
elsif Present (Expr)
and then Is_Partially_Initialized_Type (Ctyp)
then
Resolve_Aggr_Expr (Expr, Component);
end if;
end Check_Box_Component;
elsif No (Expr) then
-- Ignore hidden components associated with the position of the
-- interface tags: these are initialized dynamically.
if not Present (Related_Type (Component)) then
Error_Msg_NE
("no value supplied for component &!", N, Component);
end if;
else
Resolve_Aggr_Expr (Expr, Component);
end if;
Next_Elmt (Component_Elmt);
end loop;
-- STEP 7: check for invalid components + check type in choice list
Step_7 : declare
Assoc : Node_Id;
New_Assoc : Node_Id;
Selectr : Node_Id;
-- Selector name
Typech : Entity_Id;
-- Type of first component in choice list
begin
if Present (Component_Associations (N)) then
Assoc := First (Component_Associations (N));
else
Assoc := Empty;
end if;
Verification : while Present (Assoc) loop
Selectr := First (Choices (Assoc));
Typech := Empty;
if Nkind (Selectr) = N_Others_Choice then
-- Ada 2005 (AI-287): others choice may have expression or box
if No (Others_Etype) and then Others_Box = 0 then
Error_Msg_N
("OTHERS must represent at least one component", Selectr);
elsif Others_Box = 1 and then Warn_On_Redundant_Constructs then
Error_Msg_N ("others choice is redundant?", Box_Node);
Error_Msg_N
("\previous choices cover all components?", Box_Node);
end if;
exit Verification;
end if;
while Present (Selectr) loop
New_Assoc := First (New_Assoc_List);
while Present (New_Assoc) loop
Component := First (Choices (New_Assoc));
if Chars (Selectr) = Chars (Component) then
if Style_Check then
Check_Identifier (Selectr, Entity (Component));
end if;
exit;
end if;
Next (New_Assoc);
end loop;
-- If no association, this is not a legal component of the type
-- in question, unless its association is provided with a box.
if No (New_Assoc) then
if Box_Present (Parent (Selectr)) then
-- This may still be a bogus component with a box. Scan
-- list of components to verify that a component with
-- that name exists.
declare
C : Entity_Id;
begin
C := First_Component (Typ);
while Present (C) loop
if Chars (C) = Chars (Selectr) then
-- If the context is an extension aggregate,
-- the component must not be inherited from
-- the ancestor part of the aggregate.
if Nkind (N) /= N_Extension_Aggregate
or else
Scope (Original_Record_Component (C)) /=
Etype (Ancestor_Part (N))
then
exit;
end if;
end if;
Next_Component (C);
end loop;
if No (C) then
Error_Msg_Node_2 := Typ;
Error_Msg_N ("& is not a component of}", Selectr);
end if;
end;
elsif Chars (Selectr) /= Name_uTag
and then Chars (Selectr) /= Name_uParent
then
if not Has_Discriminants (Typ) then
Error_Msg_Node_2 := Typ;
Error_Msg_N ("& is not a component of}", Selectr);
else
Error_Msg_N
("& is not a component of the aggregate subtype",
Selectr);
end if;
Check_Misspelled_Component (Components, Selectr);
end if;
elsif No (Typech) then
Typech := Base_Type (Etype (Component));
-- AI05-0199: In Ada 2012, several components of anonymous
-- access types can appear in a choice list, as long as the
-- designated types match.
elsif Typech /= Base_Type (Etype (Component)) then
if Ada_Version >= Ada_2012
and then Ekind (Typech) = E_Anonymous_Access_Type
and then
Ekind (Etype (Component)) = E_Anonymous_Access_Type
and then Base_Type (Designated_Type (Typech)) =
Base_Type (Designated_Type (Etype (Component)))
and then
Subtypes_Statically_Match (Typech, (Etype (Component)))
then
null;
elsif not Box_Present (Parent (Selectr)) then
Error_Msg_N
("components in choice list must have same type",
Selectr);
end if;
end if;
Next (Selectr);
end loop;
Next (Assoc);
end loop Verification;
end Step_7;
-- STEP 8: replace the original aggregate
Step_8 : declare
New_Aggregate : constant Node_Id := New_Copy (N);
begin
Set_Expressions (New_Aggregate, No_List);
Set_Etype (New_Aggregate, Etype (N));
Set_Component_Associations (New_Aggregate, New_Assoc_List);
Set_Check_Actuals (New_Aggregate, Check_Actuals (N));
Rewrite (N, New_Aggregate);
end Step_8;
-- Check the dimensions of the components in the record aggregate
Analyze_Dimension_Extension_Or_Record_Aggregate (N);
end Resolve_Record_Aggregate;
-----------------------------
-- Check_Can_Never_Be_Null --
-----------------------------
procedure Check_Can_Never_Be_Null (Typ : Entity_Id; Expr : Node_Id) is
Comp_Typ : Entity_Id;
begin
pragma Assert
(Ada_Version >= Ada_2005
and then Present (Expr)
and then Known_Null (Expr));
case Ekind (Typ) is
when E_Array_Type =>
Comp_Typ := Component_Type (Typ);
when E_Component
| E_Discriminant
=>
Comp_Typ := Etype (Typ);
when others =>
return;
end case;
if Can_Never_Be_Null (Comp_Typ) then
-- Here we know we have a constraint error. Note that we do not use
-- Apply_Compile_Time_Constraint_Error here to the Expr, which might
-- seem the more natural approach. That's because in some cases the
-- components are rewritten, and the replacement would be missed.
-- We do not mark the whole aggregate as raising a constraint error,
-- because the association may be a null array range.
Error_Msg_N
("(Ada 2005) null not allowed in null-excluding component??", Expr);
Error_Msg_N
("\Constraint_Error will be raised at run time??", Expr);
Rewrite (Expr,
Make_Raise_Constraint_Error
(Sloc (Expr), Reason => CE_Access_Check_Failed));
Set_Etype (Expr, Comp_Typ);
Set_Analyzed (Expr);
end if;
end Check_Can_Never_Be_Null;
---------------------
-- Sort_Case_Table --
---------------------
procedure Sort_Case_Table (Case_Table : in out Case_Table_Type) is
U : constant Int := Case_Table'Last;
K : Int;
J : Int;
T : Case_Bounds;
begin
K := 1;
while K < U loop
T := Case_Table (K + 1);
J := K + 1;
while J > 1
and then Expr_Value (Case_Table (J - 1).Lo) > Expr_Value (T.Lo)
loop
Case_Table (J) := Case_Table (J - 1);
J := J - 1;
end loop;
Case_Table (J) := T;
K := K + 1;
end loop;
end Sort_Case_Table;
end Sem_Aggr;
| 38.800581 | 79 | 0.534896 |
1a4e8890cef72f2817eb01191e00d348f61fd5e7 | 5,113 | adb | Ada | regtests/asf-views-facelets-tests.adb | jquorning/ada-asf | ddc697c5dfa4e22c57c6958f4cff27e14d02ce98 | [
"Apache-2.0"
] | 12 | 2015-01-18T23:02:20.000Z | 2022-03-25T15:30:30.000Z | regtests/asf-views-facelets-tests.adb | jquorning/ada-asf | ddc697c5dfa4e22c57c6958f4cff27e14d02ce98 | [
"Apache-2.0"
] | 3 | 2021-01-06T09:44:02.000Z | 2022-02-04T20:20:53.000Z | regtests/asf-views-facelets-tests.adb | jquorning/ada-asf | ddc697c5dfa4e22c57c6958f4cff27e14d02ce98 | [
"Apache-2.0"
] | 4 | 2016-04-12T05:29:00.000Z | 2022-01-24T23:53:59.000Z | -----------------------------------------------------------------------
-- Facelet Tests - Unit tests for ASF.Views.Facelet
-- Copyright (C) 2009, 2010, 2011, 2018 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Test_Caller;
with EL.Objects;
with ASF.Converters;
with ASF.Validators;
with ASF.Contexts.Facelets;
package body ASF.Views.Facelets.Tests is
use ASF.Contexts.Facelets;
type Facelet_Context is new ASF.Contexts.Facelets.Facelet_Context with null record;
-- Get a converter from a name.
-- Returns the converter object or null if there is no converter.
overriding
function Get_Converter (Context : in Facelet_Context;
Name : in EL.Objects.Object)
return ASF.Converters.Converter_Access;
-- Get a validator from a name.
-- Returns the validator object or null if there is no validator.
overriding
function Get_Validator (Context : in Facelet_Context;
Name : in EL.Objects.Object)
return ASF.Validators.Validator_Access;
-- ------------------------------
-- Get a converter from a name.
-- Returns the converter object or null if there is no converter.
-- ------------------------------
overriding
function Get_Converter (Context : in Facelet_Context;
Name : in EL.Objects.Object)
return ASF.Converters.Converter_Access is
pragma Unreferenced (Context, Name);
begin
return null;
end Get_Converter;
-- ------------------------------
-- Get a validator from a name.
-- Returns the validator object or null if there is no validator.
-- ------------------------------
overriding
function Get_Validator (Context : in Facelet_Context;
Name : in EL.Objects.Object)
return ASF.Validators.Validator_Access is
pragma Unreferenced (Context, Name);
begin
return null;
end Get_Validator;
-- ------------------------------
-- Set up performed before each test case
-- ------------------------------
overriding
procedure Set_Up (T : in out Test) is
begin
null;
end Set_Up;
-- ------------------------------
-- Tear down performed after each test case
-- ------------------------------
overriding
procedure Tear_Down (T : in out Test) is
begin
null;
end Tear_Down;
-- ------------------------------
-- Test loading of facelet file
-- ------------------------------
procedure Test_Load_Facelet (T : in out Test) is
Factory : ASF.Views.Facelets.Facelet_Factory;
Components : aliased ASF.Factory.Component_Factory;
View : ASF.Views.Facelets.Facelet;
Ctx : Facelet_Context;
begin
Initialize (Factory, Components'Unchecked_Access, "regtests/files/views;.",
True, True, True);
Find_Facelet (Factory, "text.xhtml", Ctx, View);
T.Assert (Condition => not Is_Null (View),
Message => "Loading an existing facelet should return a view");
end Test_Load_Facelet;
-- ------------------------------
-- Test loading of an unknown file
-- ------------------------------
procedure Test_Load_Unknown_Facelet (T : in out Test) is
Factory : ASF.Views.Facelets.Facelet_Factory;
Components : aliased ASF.Factory.Component_Factory;
View : ASF.Views.Facelets.Facelet;
Ctx : Facelet_Context;
begin
Initialize (Factory, Components'Unchecked_Access, "regtests/files;.", True, True, True);
Find_Facelet (Factory, "not-found-file.xhtml", Ctx, View);
T.Assert (Condition => Is_Null (View),
Message => "Loading a missing facelet should not raise any exception");
end Test_Load_Unknown_Facelet;
package Caller is new Util.Test_Caller (Test, "Views.Facelets");
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite) is
begin
-- To document what is tested, register the test methods for each
-- operation that is tested.
Caller.Add_Test (Suite, "Test ASF.Views.Facelets.Find_Facelet",
Test_Load_Facelet'Access);
Caller.Add_Test (Suite, "Test ASF.Views.Facelets.Find_Facelet",
Test_Load_Unknown_Facelet'Access);
end Add_Tests;
end ASF.Views.Facelets.Tests;
| 37.595588 | 94 | 0.585957 |
13e63b00648f5cca97a6c0c4241bfa5fd0511f84 | 1,524 | adb | Ada | 1-base/lace/applet/demo/event/simple/lace_demo_keyboard.adb | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 1-base/lace/applet/demo/event/simple/lace_demo_keyboard.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 1-base/lace/applet/demo/event/simple/lace_demo_keyboard.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | with
lace_demo_Events,
ada.real_Time;
package body lace_demo_Keyboard
is
use lace_demo_Events,
Lace,
ada.real_Time;
--- Simulated Keyboard
--
the_event_Subject : constant Subject.local.view := Subject.local.forge.new_Subject ("demo.Subject");
task type simulated_Keyboard
is
entry start;
entry stop;
end simulated_Keyboard;
task body simulated_Keyboard
is
Count : Natural := 0;
Now : ada.real_Time.Time := ada.real_Time.Clock;
Done : Boolean := False;
begin
accept start;
loop
select
accept stop
do
Done := True;
end stop;
or
delay until Now;
end select;
exit when Done;
if Count mod 3 = 0
then
the_event_Subject.emit (the_Event => keyboard_Event'(key => 'a'));
else
the_event_Subject.emit (the_Event => keyboard_Event'(key => 'b'));
end if;
Count := Count + 1;
Now := Now + to_time_Span (0.5);
end loop;
end simulated_Keyboard;
the_simulated_Keyboard : simulated_Keyboard;
function as_event_Subject return lace.Subject.local.view
is
begin
return the_event_Subject;
end as_event_Subject;
procedure start
is
begin
the_simulated_Keyboard.start;
end start;
procedure stop
is
begin
the_simulated_Keyboard.stop;
end stop;
end lace_demo_Keyboard;
| 19.538462 | 103 | 0.586614 |
ad4ac20ffe929af27da684e41eb70c7d0fee89cd | 4,996 | adb | Ada | dependencies/agar/ada-gui/agar-gui-widget-tlist.adb | alexakuzin/GUCEF-1 | 436035c4266c5d90cd8716c1d0fad519c7059e34 | [
"Apache-2.0"
] | 286 | 2017-07-31T20:05:16.000Z | 2022-03-26T20:26:24.000Z | dependencies/agar/ada-gui/agar-gui-widget-tlist.adb | alexakuzin/GUCEF-1 | 436035c4266c5d90cd8716c1d0fad519c7059e34 | [
"Apache-2.0"
] | 67 | 2017-08-30T18:56:21.000Z | 2021-09-08T03:38:20.000Z | dependencies/agar/ada-gui/agar-gui-widget-tlist.adb | alexakuzin/GUCEF-1 | 436035c4266c5d90cd8716c1d0fad519c7059e34 | [
"Apache-2.0"
] | 31 | 2017-08-14T13:34:12.000Z | 2022-03-14T15:33:49.000Z | package body agar.gui.widget.tlist is
package cbinds is
procedure set_item_height
(tlist : tlist_access_t;
height : c.int);
pragma import (c, set_item_height, "AG_TlistSetItemHeight");
procedure size_hint
(tlist : tlist_access_t;
text : cs.chars_ptr;
num_items : c.int);
pragma import (c, size_hint, "AG_TlistSizeHint");
procedure size_hint_pixels
(tlist : tlist_access_t;
width : c.int;
num_items : c.int);
pragma import (c, size_hint_pixels, "AG_TlistSizeHintPixels");
procedure size_hint_largest
(tlist : tlist_access_t;
num_items : c.int);
pragma import (c, size_hint_largest, "AG_TlistSizeHintLargest");
procedure set_double_click_callback
(tlist : tlist_access_t;
callback : agar.core.event.callback_t;
fmt : agar.core.types.void_ptr_t);
pragma import (c, set_double_click_callback, "AG_TlistSetDblClickFn");
procedure set_changed_callback
(tlist : tlist_access_t;
callback : agar.core.event.callback_t;
fmt : agar.core.types.void_ptr_t);
pragma import (c, set_changed_callback, "AG_TlistSetChangedFn");
function list_select_text
(tlist : tlist_access_t;
text : cs.chars_ptr) return item_access_t;
pragma import (c, list_select_text, "AG_TlistSelectText");
function list_find_by_index
(tlist : tlist_access_t;
index : c.int) return item_access_t;
pragma import (c, list_find_by_index, "AG_TlistFindByIndex");
function set_popup_callback
(tlist : tlist_access_t;
callback : agar.core.event.callback_t;
fmt : agar.core.types.void_ptr_t) return agar.gui.widget.menu.item_access_t;
pragma import (c, set_popup_callback, "AG_TlistSetPopupFn");
function set_popup
(tlist : tlist_access_t;
category : cs.chars_ptr) return agar.gui.widget.menu.item_access_t;
pragma import (c, set_popup, "AG_TlistSetPopup");
end cbinds;
procedure set_item_height
(tlist : tlist_access_t;
height : natural) is
begin
cbinds.set_item_height
(tlist => tlist,
height => c.int (height));
end set_item_height;
procedure size_hint
(tlist : tlist_access_t;
text : string;
num_items : natural)
is
c_text : aliased c.char_array := c.to_c (text);
begin
cbinds.size_hint
(tlist => tlist,
text => cs.to_chars_ptr (c_text'unchecked_access),
num_items => c.int (num_items));
end size_hint;
procedure size_hint_pixels
(tlist : tlist_access_t;
width : natural;
num_items : natural) is
begin
cbinds.size_hint_pixels
(tlist => tlist,
width => c.int (width),
num_items => c.int (num_items));
end size_hint_pixels;
procedure size_hint_largest
(tlist : tlist_access_t;
num_items : natural) is
begin
cbinds.size_hint_largest
(tlist => tlist,
num_items => c.int (num_items));
end size_hint_largest;
procedure set_double_click_callback
(tlist : tlist_access_t;
callback : agar.core.event.callback_t) is
begin
cbinds.set_double_click_callback
(tlist => tlist,
callback => callback,
fmt => agar.core.types.null_ptr);
end set_double_click_callback;
procedure set_changed_callback
(tlist : tlist_access_t;
callback : agar.core.event.callback_t) is
begin
cbinds.set_changed_callback
(tlist => tlist,
callback => callback,
fmt => agar.core.types.null_ptr);
end set_changed_callback;
function list_select_text
(tlist : tlist_access_t;
text : string) return item_access_t
is
c_text : aliased c.char_array := c.to_c (text);
begin
return cbinds.list_select_text
(tlist => tlist,
text => cs.to_chars_ptr (c_text'unchecked_access));
end list_select_text;
function list_find_by_index
(tlist : tlist_access_t;
index : integer) return item_access_t is
begin
return cbinds.list_find_by_index
(tlist => tlist,
index => c.int (index));
end list_find_by_index;
function set_popup_callback
(tlist : tlist_access_t;
callback : agar.core.event.callback_t) return agar.gui.widget.menu.item_access_t is
begin
return cbinds.set_popup_callback
(tlist => tlist,
callback => callback,
fmt => agar.core.types.null_ptr);
end set_popup_callback;
function set_popup
(tlist : tlist_access_t;
category : string) return agar.gui.widget.menu.item_access_t
is
c_cat : aliased c.char_array := c.to_c (category);
begin
return cbinds.set_popup
(tlist => tlist,
category => cs.to_chars_ptr (c_cat'unchecked_access));
end set_popup;
function widget (tlist : tlist_access_t) return widget_access_t is
begin
return tlist.widget'access;
end widget;
end agar.gui.widget.tlist;
| 29.56213 | 88 | 0.664131 |
2e9988c33bbec4ea45c4eb6878410279326533a9 | 186 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/fixedpnt.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/fixedpnt.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/fixedpnt.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-do run }
procedure Fixedpnt is
A : Duration := 1.0;
B : Duration := Duration ((-1.0) * A);
begin
if B > 0.0 then
raise Constraint_Error;
end if;
end;
| 16.909091 | 41 | 0.537634 |
c75db1a842eee978bab3ab23d4a6f690bac7378d | 43,231 | ads | Ada | src/pulse/pulse_def_h.ads | fintatarta/pulsada | 043ab895a8cf3b4b491dcf30ca2693de54daf2da | [
"MIT"
] | null | null | null | src/pulse/pulse_def_h.ads | fintatarta/pulsada | 043ab895a8cf3b4b491dcf30ca2693de54daf2da | [
"MIT"
] | null | null | null | src/pulse/pulse_def_h.ads | fintatarta/pulsada | 043ab895a8cf3b4b491dcf30ca2693de54daf2da | [
"MIT"
] | null | null | null | pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
-- with stdint_h;
-- with x86_64_linux_gnu_bits_time_h;
with pulse_sample_h;
-- with x86_64_linux_gnu_sys_types_h;
with System;
package pulse_def_h is
PA_STREAM_EVENT_REQUEST_CORK : aliased constant String := "request-cork" & ASCII.NUL; -- /usr/include/pulse/def.h:1021
PA_STREAM_EVENT_REQUEST_UNCORK : aliased constant String := "request-uncork" & ASCII.NUL; -- /usr/include/pulse/def.h:1026
PA_STREAM_EVENT_FORMAT_LOST : aliased constant String := "format-lost" & ASCII.NUL; -- /usr/include/pulse/def.h:1033
--**
-- This file is part of PulseAudio.
-- Copyright 2004-2006 Lennart Poettering
-- Copyright 2006 Pierre Ossman <[email protected]> for Cendio AB
-- PulseAudio is free software; you can redistribute it and/or modify
-- it under the terms of the GNU Lesser General Public License as
-- published by the Free Software Foundation; either version 2.1 of the
-- License, or (at your option) any later version.
-- PulseAudio is distributed in the hope that it will be useful, but
-- WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
-- Lesser General Public License for more details.
-- You should have received a copy of the GNU Lesser General Public
-- License along with PulseAudio; if not, write to the Free Software
-- Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
-- USA.
--**
--* \file
-- * Global definitions
--* The state of a connection context
type pa_context_state is
(PA_CONTEXT_UNCONNECTED,
PA_CONTEXT_CONNECTING,
PA_CONTEXT_AUTHORIZING,
PA_CONTEXT_SETTING_NAME,
PA_CONTEXT_READY,
PA_CONTEXT_FAILED,
PA_CONTEXT_TERMINATED);
pragma Convention (C, pa_context_state); -- /usr/include/pulse/def.h:39
--*< The context hasn't been connected yet
--*< A connection is being established
--*< The client is authorizing itself to the daemon
--*< The client is passing its application name to the daemon
--*< The connection is established, the context is ready to execute operations
--*< The connection failed or was disconnected
--*< The connection was terminated cleanly
subtype pa_context_state_t is pa_context_state; -- /usr/include/pulse/def.h:47
--* Return non-zero if the passed state is one of the connected states. \since 0.9.11
function PA_CONTEXT_IS_GOOD (x : pa_context_state_t) return int; -- /usr/include/pulse/def.h:50
pragma Import (C, PA_CONTEXT_IS_GOOD, "PA_CONTEXT_IS_GOOD");
--* \cond fulldocs
--* \endcond
--* The state of a stream
type pa_stream_state is
(PA_STREAM_UNCONNECTED,
PA_STREAM_CREATING,
PA_STREAM_READY,
PA_STREAM_FAILED,
PA_STREAM_TERMINATED);
pragma Convention (C, pa_stream_state); -- /usr/include/pulse/def.h:70
--*< The stream is not yet connected to any sink or source
--*< The stream is being created
--*< The stream is established, you may pass audio data to it now
--*< An error occurred that made the stream invalid
--*< The stream has been terminated cleanly
subtype pa_stream_state_t is pa_stream_state; -- /usr/include/pulse/def.h:76
--* Return non-zero if the passed state is one of the connected states. \since 0.9.11
function PA_STREAM_IS_GOOD (x : pa_stream_state_t) return int; -- /usr/include/pulse/def.h:79
pragma Import (C, PA_STREAM_IS_GOOD, "PA_STREAM_IS_GOOD");
--* \cond fulldocs
--* \endcond
--* The state of an operation
type pa_operation_state is
(PA_OPERATION_RUNNING,
PA_OPERATION_DONE,
PA_OPERATION_CANCELLED);
pragma Convention (C, pa_operation_state); -- /usr/include/pulse/def.h:95
--*< The operation is still running
--*< The operation has completed
--*< The operation has been cancelled. Operations may get cancelled by the
-- * application, or as a result of the context getting disconneted while the
-- * operation is pending.
subtype pa_operation_state_t is pa_operation_state; -- /usr/include/pulse/def.h:104
--* \cond fulldocs
--* \endcond
--* An invalid index
--* Some special flags for contexts.
type pa_context_flags is
(PA_CONTEXT_NOFLAGS,
PA_CONTEXT_NOAUTOSPAWN,
PA_CONTEXT_NOFAIL);
pragma Convention (C, pa_context_flags); -- /usr/include/pulse/def.h:117
--*< Flag to pass when no specific options are needed (used to avoid casting) \since 0.9.19
--*< Disabled autospawning of the PulseAudio daemon if required
--*< Don't fail if the daemon is not available when pa_context_connect() is called, instead enter PA_CONTEXT_CONNECTING state and wait for the daemon to appear. \since 0.9.15
subtype pa_context_flags_t is pa_context_flags; -- /usr/include/pulse/def.h:124
--* \cond fulldocs
-- Allow clients to check with #ifdef for those flags
--* \endcond
--* Direction bitfield - while we currently do not expose anything bidirectional,
-- one should test against the bit instead of the value (e.g.\ if (d & PA_DIRECTION_OUTPUT)),
-- because we might add bidirectional stuff in the future. \since 2.0
--
subtype pa_direction is unsigned;
PA_DIRECTION_OUTPUT : constant unsigned := 1;
PA_DIRECTION_INPUT : constant unsigned := 2; -- /usr/include/pulse/def.h:136
--*< Output direction
--*< Input direction
subtype pa_direction_t is pa_direction; -- /usr/include/pulse/def.h:139
--* \cond fulldocs
--* \endcond
--* The type of device we are dealing with
type pa_device_type is
(PA_DEVICE_TYPE_SINK,
PA_DEVICE_TYPE_SOURCE);
pragma Convention (C, pa_device_type); -- /usr/include/pulse/def.h:147
--*< Playback device
--*< Recording device
subtype pa_device_type_t is pa_device_type; -- /usr/include/pulse/def.h:150
--* \cond fulldocs
--* \endcond
--* The direction of a pa_stream object
type pa_stream_direction is
(PA_STREAM_NODIRECTION,
PA_STREAM_PLAYBACK,
PA_STREAM_RECORD,
PA_STREAM_UPLOAD);
pragma Convention (C, pa_stream_direction); -- /usr/include/pulse/def.h:158
--*< Invalid direction
--*< Playback stream
--*< Record stream
--*< Sample upload stream
subtype pa_stream_direction_t is pa_stream_direction; -- /usr/include/pulse/def.h:163
--* \cond fulldocs
--* \endcond
--* Some special flags for stream connections.
subtype pa_stream_flags is unsigned;
PA_STREAM_NOFLAGS : constant unsigned := 0;
PA_STREAM_START_CORKED : constant unsigned := 1;
PA_STREAM_INTERPOLATE_TIMING : constant unsigned := 2;
PA_STREAM_NOT_MONOTONIC : constant unsigned := 4;
PA_STREAM_AUTO_TIMING_UPDATE : constant unsigned := 8;
PA_STREAM_NO_REMAP_CHANNELS : constant unsigned := 16;
PA_STREAM_NO_REMIX_CHANNELS : constant unsigned := 32;
PA_STREAM_FIX_FORMAT : constant unsigned := 64;
PA_STREAM_FIX_RATE : constant unsigned := 128;
PA_STREAM_FIX_CHANNELS : constant unsigned := 256;
PA_STREAM_DONT_MOVE : constant unsigned := 512;
PA_STREAM_VARIABLE_RATE : constant unsigned := 1024;
PA_STREAM_PEAK_DETECT : constant unsigned := 2048;
PA_STREAM_START_MUTED : constant unsigned := 4096;
PA_STREAM_ADJUST_LATENCY : constant unsigned := 8192;
PA_STREAM_EARLY_REQUESTS : constant unsigned := 16384;
PA_STREAM_DONT_INHIBIT_AUTO_SUSPEND : constant unsigned := 32768;
PA_STREAM_START_UNMUTED : constant unsigned := 65536;
PA_STREAM_FAIL_ON_SUSPEND : constant unsigned := 131072;
PA_STREAM_RELATIVE_VOLUME : constant unsigned := 262144;
PA_STREAM_PASSTHROUGH : constant unsigned := 524288; -- /usr/include/pulse/def.h:173
--*< Flag to pass when no specific options are needed (used to avoid casting) \since 0.9.19
--*< Create the stream corked, requiring an explicit
-- * pa_stream_cork() call to uncork it.
--*< Interpolate the latency for this stream. When enabled,
-- * pa_stream_get_latency() and pa_stream_get_time() will try to
-- * estimate the current record/playback time based on the local
-- * time that passed since the last timing info update. Using this
-- * option has the advantage of not requiring a whole roundtrip
-- * when the current playback/recording time is needed. Consider
-- * using this option when requesting latency information
-- * frequently. This is especially useful on long latency network
-- * connections. It makes a lot of sense to combine this option
-- * with PA_STREAM_AUTO_TIMING_UPDATE.
--*< Don't force the time to increase monotonically. If this
-- * option is enabled, pa_stream_get_time() will not necessarily
-- * return always monotonically increasing time values on each
-- * call. This may confuse applications which cannot deal with time
-- * going 'backwards', but has the advantage that bad transport
-- * latency estimations that caused the time to to jump ahead can
-- * be corrected quickly, without the need to wait. (Please note
-- * that this flag was named PA_STREAM_NOT_MONOTONOUS in releases
-- * prior to 0.9.11. The old name is still defined too, for
-- * compatibility reasons.
--*< If set timing update requests are issued periodically
-- * automatically. Combined with PA_STREAM_INTERPOLATE_TIMING you
-- * will be able to query the current time and latency with
-- * pa_stream_get_time() and pa_stream_get_latency() at all times
-- * without a packet round trip.
--*< Don't remap channels by their name, instead map them simply
-- * by their index. Implies PA_STREAM_NO_REMIX_CHANNELS. Only
-- * supported when the server is at least PA 0.9.8. It is ignored
-- * on older servers.\since 0.9.8
--*< When remapping channels by name, don't upmix or downmix them
-- * to related channels. Copy them into matching channels of the
-- * device 1:1. Only supported when the server is at least PA
-- * 0.9.8. It is ignored on older servers. \since 0.9.8
--*< Use the sample format of the sink/device this stream is being
-- * connected to, and possibly ignore the format the sample spec
-- * contains -- but you still have to pass a valid value in it as a
-- * hint to PulseAudio what would suit your stream best. If this is
-- * used you should query the used sample format after creating the
-- * stream by using pa_stream_get_sample_spec(). Also, if you
-- * specified manual buffer metrics it is recommended to update
-- * them with pa_stream_set_buffer_attr() to compensate for the
-- * changed frame sizes. Only supported when the server is at least
-- * PA 0.9.8. It is ignored on older servers.
-- *
-- * When creating streams with pa_stream_new_extended(), this flag has no
-- * effect. If you specify a format with PCM encoding, and you want the
-- * server to choose the sample format, then you should leave the sample
-- * format unspecified in the pa_format_info object. This also means that
-- * you can't use pa_format_info_from_sample_spec(), because that function
-- * always sets the sample format.
-- *
-- * \since 0.9.8
--*< Use the sample rate of the sink, and possibly ignore the rate
-- * the sample spec contains. Usage similar to
-- * PA_STREAM_FIX_FORMAT. Only supported when the server is at least
-- * PA 0.9.8. It is ignored on older servers.
-- *
-- * When creating streams with pa_stream_new_extended(), this flag has no
-- * effect. If you specify a format with PCM encoding, and you want the
-- * server to choose the sample rate, then you should leave the rate
-- * unspecified in the pa_format_info object. This also means that you can't
-- * use pa_format_info_from_sample_spec(), because that function always sets
-- * the sample rate.
-- *
-- * \since 0.9.8
--*< Use the number of channels and the channel map of the sink,
-- * and possibly ignore the number of channels and the map the
-- * sample spec and the passed channel map contains. Usage similar
-- * to PA_STREAM_FIX_FORMAT. Only supported when the server is at
-- * least PA 0.9.8. It is ignored on older servers.
-- *
-- * When creating streams with pa_stream_new_extended(), this flag has no
-- * effect. If you specify a format with PCM encoding, and you want the
-- * server to choose the channel count and/or channel map, then you should
-- * leave the channels and/or the channel map unspecified in the
-- * pa_format_info object. This also means that you can't use
-- * pa_format_info_from_sample_spec(), because that function always sets
-- * the channel count (but if you only want to leave the channel map
-- * unspecified, then pa_format_info_from_sample_spec() works, because it
-- * accepts a NULL channel map).
-- *
-- * \since 0.9.8
--*< Don't allow moving of this stream to another
-- * sink/device. Useful if you use any of the PA_STREAM_FIX_ flags
-- * and want to make sure that resampling never takes place --
-- * which might happen if the stream is moved to another
-- * sink/source with a different sample spec/channel map. Only
-- * supported when the server is at least PA 0.9.8. It is ignored
-- * on older servers. \since 0.9.8
--*< Allow dynamic changing of the sampling rate during playback
-- * with pa_stream_update_sample_rate(). Only supported when the
-- * server is at least PA 0.9.8. It is ignored on older
-- * servers. \since 0.9.8
--*< Find peaks instead of resampling. \since 0.9.11
--*< Create in muted state. If neither PA_STREAM_START_UNMUTED nor
-- * PA_STREAM_START_MUTED it is left to the server to decide
-- * whether to create the stream in muted or in unmuted
-- * state. \since 0.9.11
--*< Try to adjust the latency of the sink/source based on the
-- * requested buffer metrics and adjust buffer metrics
-- * accordingly. Also see pa_buffer_attr. This option may not be
-- * specified at the same time as PA_STREAM_EARLY_REQUESTS. \since
-- * 0.9.11
--*< Enable compatibility mode for legacy clients that rely on a
-- * "classic" hardware device fragment-style playback model. If
-- * this option is set, the minreq value of the buffer metrics gets
-- * a new meaning: instead of just specifying that no requests
-- * asking for less new data than this value will be made to the
-- * client it will also guarantee that requests are generated as
-- * early as this limit is reached. This flag should only be set in
-- * very few situations where compatibility with a fragment-based
-- * playback model needs to be kept and the client applications
-- * cannot deal with data requests that are delayed to the latest
-- * moment possible. (Usually these are programs that use usleep()
-- * or a similar call in their playback loops instead of sleeping
-- * on the device itself.) Also see pa_buffer_attr. This option may
-- * not be specified at the same time as
-- * PA_STREAM_ADJUST_LATENCY. \since 0.9.12
--*< If set this stream won't be taken into account when it is
-- * checked whether the device this stream is connected to should
-- * auto-suspend. \since 0.9.15
--*< Create in unmuted state. If neither PA_STREAM_START_UNMUTED
-- * nor PA_STREAM_START_MUTED it is left to the server to decide
-- * whether to create the stream in muted or in unmuted
-- * state. \since 0.9.15
--*< If the sink/source this stream is connected to is suspended
-- * during the creation of this stream, cause it to fail. If the
-- * sink/source is being suspended during creation of this stream,
-- * make sure this stream is terminated. \since 0.9.15
--*< If a volume is passed when this stream is created, consider
-- * it relative to the sink's current volume, never as absolute
-- * device volume. If this is not specified the volume will be
-- * consider absolute when the sink is in flat volume mode,
-- * relative otherwise. \since 0.9.20
--*< Used to tag content that will be rendered by passthrough sinks.
-- * The data will be left as is and not reformatted, resampled.
-- * \since 1.0
subtype pa_stream_flags_t is pa_stream_flags; -- /usr/include/pulse/def.h:357
--* \cond fulldocs
-- English is an evil language
-- Allow clients to check with #ifdef for those flags
--* \endcond
--* Playback and record buffer metrics
type pa_buffer_attr is record
maxlength : aliased Interfaces.Unsigned_32; -- /usr/include/pulse/def.h:390
tlength : aliased Interfaces.Unsigned_32; -- /usr/include/pulse/def.h:401
prebuf : aliased Interfaces.Unsigned_32; -- /usr/include/pulse/def.h:419
minreq : aliased Interfaces.Unsigned_32; -- /usr/include/pulse/def.h:430
fragsize : aliased Interfaces.Unsigned_32; -- /usr/include/pulse/def.h:440
end record;
pragma Convention (C_Pass_By_Copy, pa_buffer_attr); -- /usr/include/pulse/def.h:389
--*< Maximum length of the buffer in bytes. Setting this to (uint32_t) -1
-- * will initialize this to the maximum value supported by server,
-- * which is recommended.
-- *
-- * In strict low-latency playback scenarios you might want to set this to
-- * a lower value, likely together with the PA_STREAM_ADJUST_LATENCY flag.
-- * If you do so, you ensure that the latency doesn't grow beyond what is
-- * acceptable for the use case, at the cost of getting more underruns if
-- * the latency is lower than what the server can reliably handle.
--*< Playback only: target length of the buffer. The server tries
-- * to assure that at least tlength bytes are always available in
-- * the per-stream server-side playback buffer. It is recommended
-- * to set this to (uint32_t) -1, which will initialize this to a
-- * value that is deemed sensible by the server. However, this
-- * value will default to something like 2s, i.e. for applications
-- * that have specific latency requirements this value should be
-- * set to the maximum latency that the application can deal
-- * with. When PA_STREAM_ADJUST_LATENCY is not set this value will
-- * influence only the per-stream playback buffer size. When
-- * PA_STREAM_ADJUST_LATENCY is set the overall latency of the sink
-- * plus the playback buffer size is configured to this value. Set
-- * PA_STREAM_ADJUST_LATENCY if you are interested in adjusting the
-- * overall latency. Don't set it if you are interested in
-- * configuring the server-side per-stream playback buffer
-- * size.
--*< Playback only: pre-buffering. The server does not start with
-- * playback before at least prebuf bytes are available in the
-- * buffer. It is recommended to set this to (uint32_t) -1, which
-- * will initialize this to the same value as tlength, whatever
-- * that may be. Initialize to 0 to enable manual start/stop
-- * control of the stream. This means that playback will not stop
-- * on underrun and playback will not start automatically. Instead
-- * pa_stream_cork() needs to be called explicitly. If you set
-- * this value to 0 you should also set PA_STREAM_START_CORKED.
--*< Playback only: minimum request. The server does not request
-- * less than minreq bytes from the client, instead waits until the
-- * buffer is free enough to request more bytes at once. It is
-- * recommended to set this to (uint32_t) -1, which will initialize
-- * this to a value that is deemed sensible by the server. This
-- * should be set to a value that gives PulseAudio enough time to
-- * move the data from the per-stream playback buffer into the
-- * hardware playback buffer.
--*< Recording only: fragment size. The server sends data in
-- * blocks of fragsize bytes size. Large values diminish
-- * interactivity with other operations on the connection context
-- * but decrease control overhead. It is recommended to set this to
-- * (uint32_t) -1, which will initialize this to a value that is
-- * deemed sensible by the server. However, this value will default
-- * to something like 2s, i.e. for applications that have specific
-- * latency requirements this value should be set to the maximum
-- * latency that the application can deal with. If
-- * PA_STREAM_ADJUST_LATENCY is set the overall source latency will
-- * be adjusted according to this value. If it is not set the
-- * source latency is left unmodified.
--* Error values as used by pa_context_errno(). Use pa_strerror() to convert these values to human readable strings
type pa_error_code is
(PA_OK,
PA_ERR_ACCESS,
PA_ERR_COMMAND,
PA_ERR_INVALID,
PA_ERR_EXIST,
PA_ERR_NOENTITY,
PA_ERR_CONNECTIONREFUSED,
PA_ERR_PROTOCOL,
PA_ERR_TIMEOUT,
PA_ERR_AUTHKEY,
PA_ERR_INTERNAL,
PA_ERR_CONNECTIONTERMINATED,
PA_ERR_KILLED,
PA_ERR_INVALIDSERVER,
PA_ERR_MODINITFAILED,
PA_ERR_BADSTATE,
PA_ERR_NODATA,
PA_ERR_VERSION,
PA_ERR_TOOLARGE,
PA_ERR_NOTSUPPORTED,
PA_ERR_UNKNOWN,
PA_ERR_NOEXTENSION,
PA_ERR_OBSOLETE,
PA_ERR_NOTIMPLEMENTED,
PA_ERR_FORKED,
PA_ERR_IO,
PA_ERR_BUSY,
PA_ERR_MAX);
pragma Convention (C, pa_error_code); -- /usr/include/pulse/def.h:457
--*< No error
--*< Access failure
--*< Unknown command
--*< Invalid argument
--*< Entity exists
--*< No such entity
--*< Connection refused
--*< Protocol error
--*< Timeout
--*< No authorization key
--*< Internal error
--*< Connection terminated
--*< Entity killed
--*< Invalid server
--*< Module initialization failed
--*< Bad state
--*< No data
--*< Incompatible protocol version
--*< Data too large
--*< Operation not supported \since 0.9.5
--*< The error code was unknown to the client
--*< Extension does not exist. \since 0.9.12
--*< Obsolete functionality. \since 0.9.15
--*< Missing implementation. \since 0.9.15
--*< The caller forked without calling execve() and tried to reuse the context. \since 0.9.15
--*< An IO error happened. \since 0.9.16
--*< Device or resource busy. \since 0.9.17
--*< Not really an error but the first invalid error code
subtype pa_error_code_t is pa_error_code; -- /usr/include/pulse/def.h:486
--* \cond fulldocs
--* \endcond
--* Subscription event mask, as used by pa_context_subscribe()
subtype pa_subscription_mask is unsigned;
PA_SUBSCRIPTION_MASK_NULL : constant unsigned := 0;
PA_SUBSCRIPTION_MASK_SINK : constant unsigned := 1;
PA_SUBSCRIPTION_MASK_SOURCE : constant unsigned := 2;
PA_SUBSCRIPTION_MASK_SINK_INPUT : constant unsigned := 4;
PA_SUBSCRIPTION_MASK_SOURCE_OUTPUT : constant unsigned := 8;
PA_SUBSCRIPTION_MASK_MODULE : constant unsigned := 16;
PA_SUBSCRIPTION_MASK_CLIENT : constant unsigned := 32;
PA_SUBSCRIPTION_MASK_SAMPLE_CACHE : constant unsigned := 64;
PA_SUBSCRIPTION_MASK_SERVER : constant unsigned := 128;
PA_SUBSCRIPTION_MASK_AUTOLOAD : constant unsigned := 256;
PA_SUBSCRIPTION_MASK_CARD : constant unsigned := 512;
PA_SUBSCRIPTION_MASK_ALL : constant unsigned := 767; -- /usr/include/pulse/def.h:518
--*< No events
--*< Sink events
--*< Source events
--*< Sink input events
--*< Source output events
--*< Module events
--*< Client events
--*< Sample cache events
--*< Other global server changes.
--* \cond fulldocs
--*< \deprecated Autoload table events.
--* \endcond
--*< Card events. \since 0.9.15
--*< Catch all events
subtype pa_subscription_mask_t is pa_subscription_mask; -- /usr/include/pulse/def.h:556
--* Subscription event types, as used by pa_context_subscribe()
subtype pa_subscription_event_type is unsigned;
PA_SUBSCRIPTION_EVENT_SINK : constant unsigned := 0;
PA_SUBSCRIPTION_EVENT_SOURCE : constant unsigned := 1;
PA_SUBSCRIPTION_EVENT_SINK_INPUT : constant unsigned := 2;
PA_SUBSCRIPTION_EVENT_SOURCE_OUTPUT : constant unsigned := 3;
PA_SUBSCRIPTION_EVENT_MODULE : constant unsigned := 4;
PA_SUBSCRIPTION_EVENT_CLIENT : constant unsigned := 5;
PA_SUBSCRIPTION_EVENT_SAMPLE_CACHE : constant unsigned := 6;
PA_SUBSCRIPTION_EVENT_SERVER : constant unsigned := 7;
PA_SUBSCRIPTION_EVENT_AUTOLOAD : constant unsigned := 8;
PA_SUBSCRIPTION_EVENT_CARD : constant unsigned := 9;
PA_SUBSCRIPTION_EVENT_FACILITY_MASK : constant unsigned := 15;
PA_SUBSCRIPTION_EVENT_NEW : constant unsigned := 0;
PA_SUBSCRIPTION_EVENT_CHANGE : constant unsigned := 16;
PA_SUBSCRIPTION_EVENT_REMOVE : constant unsigned := 32;
PA_SUBSCRIPTION_EVENT_TYPE_MASK : constant unsigned := 48; -- /usr/include/pulse/def.h:559
--*< Event type: Sink
--*< Event type: Source
--*< Event type: Sink input
--*< Event type: Source output
--*< Event type: Module
--*< Event type: Client
--*< Event type: Sample cache item
--*< Event type: Global server change, only occurring with PA_SUBSCRIPTION_EVENT_CHANGE.
--* \cond fulldocs
--*< \deprecated Event type: Autoload table changes.
--* \endcond
--*< Event type: Card \since 0.9.15
--*< A mask to extract the event type from an event value
--*< A new object was created
--*< A property of the object was modified
--*< An object was removed
--*< A mask to extract the event operation from an event value
subtype pa_subscription_event_type_t is pa_subscription_event_type; -- /usr/include/pulse/def.h:607
--* Return one if an event type t matches an event mask bitfield
--* \cond fulldocs
--* \endcond
--* A structure for all kinds of timing information of a stream. See
-- * pa_stream_update_timing_info() and pa_stream_get_timing_info(). The
-- * total output latency a sample that is written with
-- * pa_stream_write() takes to be played may be estimated by
-- * sink_usec+buffer_usec+transport_usec. (where buffer_usec is defined
-- * as pa_bytes_to_usec(write_index-read_index)) The output buffer
-- * which buffer_usec relates to may be manipulated freely (with
-- * pa_stream_write()'s seek argument, pa_stream_flush() and friends),
-- * the buffers sink_usec and source_usec relate to are first-in
-- * first-out (FIFO) buffers which cannot be flushed or manipulated in
-- * any way. The total input latency a sample that is recorded takes to
-- * be delivered to the application is:
-- * source_usec+buffer_usec+transport_usec-sink_usec. (Take care of
-- * sign issues!) When connected to a monitor source sink_usec contains
-- * the latency of the owning sink. The two latency estimations
-- * described here are implemented in pa_stream_get_latency(). Please
-- * note that this structure can be extended as part of evolutionary
-- * API updates at any time in any new release.
subtype uu_time_t is long; -- /usr/include/x86_64-linux-gnu/bits/types.h:139
-- Count of microseconds.
subtype uu_useconds_t is unsigned; -- /usr/include/x86_64-linux-gnu/bits/types.h:140
-- Signed count of microseconds.
subtype uu_suseconds_t is long;
type timeval is record
tv_sec : aliased uu_time_t; -- /usr/include/x86_64-linux-gnu/bits/time.h:32
tv_usec : aliased uu_suseconds_t; -- /usr/include/x86_64-linux-gnu/bits/time.h:33
end record;
pragma Convention (C_Pass_By_Copy, timeval);
type pa_timing_info is record
timestamp : aliased timeval; -- /usr/include/pulse/def.h:661
synchronized_clocks : aliased int; -- /usr/include/pulse/def.h:664
sink_usec : aliased pulse_sample_h.pa_usec_t; -- /usr/include/pulse/def.h:671
source_usec : aliased pulse_sample_h.pa_usec_t; -- /usr/include/pulse/def.h:676
transport_usec : aliased pulse_sample_h.pa_usec_t; -- /usr/include/pulse/def.h:680
playing : aliased int; -- /usr/include/pulse/def.h:684
write_index_corrupt : aliased int; -- /usr/include/pulse/def.h:691
write_index : aliased Interfaces.Unsigned_64; -- /usr/include/pulse/def.h:698
read_index_corrupt : aliased int; -- /usr/include/pulse/def.h:704
read_index : aliased Interfaces.Unsigned_64; -- /usr/include/pulse/def.h:709
configured_sink_usec : aliased pulse_sample_h.pa_usec_t; -- /usr/include/pulse/def.h:715
configured_source_usec : aliased pulse_sample_h.pa_usec_t; -- /usr/include/pulse/def.h:718
since_underrun : aliased Interfaces.Unsigned_64; -- /usr/include/pulse/def.h:721
end record;
pragma Convention (C_Pass_By_Copy, pa_timing_info); -- /usr/include/pulse/def.h:660
--*< The time when this timing info structure was current
--*< Non-zero if the local and the remote machine have
-- * synchronized clocks. If synchronized clocks are detected
-- * transport_usec becomes much more reliable. However, the code
-- * that detects synchronized clocks is very limited and unreliable
-- * itself.
--*< Time in usecs a sample takes to be played on the sink. For
-- * playback streams and record streams connected to a monitor
-- * source.
--*< Time in usecs a sample takes from being recorded to being
-- * delivered to the application. Only for record streams.
--*< Estimated time in usecs a sample takes to be transferred
-- * to/from the daemon. For both playback and record streams.
--*< Non-zero when the stream is currently not underrun and data
-- * is being passed on to the device. Only for playback
-- * streams. This field does not say whether the data is actually
-- * already being played. To determine this check whether
-- * since_underrun (converted to usec) is larger than sink_usec.
--*< Non-zero if write_index is not up-to-date because a local
-- * write command that corrupted it has been issued in the time
-- * since this latency info was current . Only write commands with
-- * SEEK_RELATIVE_ON_READ and SEEK_RELATIVE_END can corrupt
-- * write_index.
--*< Current write index into the playback buffer in bytes. Think
-- * twice before using this for seeking purposes: it might be out
-- * of date a the time you want to use it. Consider using
-- * PA_SEEK_RELATIVE instead.
--*< Non-zero if read_index is not up-to-date because a local
-- * pause or flush request that corrupted it has been issued in the
-- * time since this latency info was current.
--*< Current read index into the playback buffer in bytes. Think
-- * twice before using this for seeking purposes: it might be out
-- * of date a the time you want to use it. Consider using
-- * PA_SEEK_RELATIVE_ON_READ instead.
--*< The configured latency for the sink. \since 0.9.11
--*< The configured latency for the source. \since 0.9.11
--*< Bytes that were handed to the sink since the last underrun
-- * happened, or since playback started again after the last
-- * underrun. playing will tell you which case it is. \since
-- * 0.9.11
--* A structure for the spawn api. This may be used to integrate auto
-- * spawned daemons into your application. For more information see
-- * pa_context_connect(). When spawning a new child process the
-- * waitpid() is used on the child's PID. The spawn routine will not
-- * block or ignore SIGCHLD signals, since this cannot be done in a
-- * thread compatible way. You might have to do this in
-- * prefork/postfork.
type pa_spawn_api is record
prefork : access procedure; -- /usr/include/pulse/def.h:737
postfork : access procedure; -- /usr/include/pulse/def.h:741
atfork : access procedure; -- /usr/include/pulse/def.h:745
end record;
pragma Convention (C_Pass_By_Copy, pa_spawn_api); -- /usr/include/pulse/def.h:736
--*< Is called just before the fork in the parent process. May be
-- * NULL.
--*< Is called immediately after the fork in the parent
-- * process. May be NULL.
--*< Is called immediately after the fork in the child
-- * process. May be NULL. It is not safe to close all file
-- * descriptors in this function unconditionally, since a UNIX
-- * socket (created using socketpair()) is passed to the new
-- * process.
--* Seek type for pa_stream_write().
type pa_seek_mode is
(PA_SEEK_RELATIVE,
PA_SEEK_ABSOLUTE,
PA_SEEK_RELATIVE_ON_READ,
PA_SEEK_RELATIVE_END);
pragma Convention (C, pa_seek_mode); -- /usr/include/pulse/def.h:754
--*< Seek relatively to the write index
--*< Seek relatively to the start of the buffer queue
--*< Seek relatively to the read index.
--*< Seek relatively to the current end of the buffer queue.
subtype pa_seek_mode_t is pa_seek_mode; -- /usr/include/pulse/def.h:766
--* \cond fulldocs
--* \endcond
--* Special sink flags.
subtype pa_sink_flags is unsigned;
PA_SINK_NOFLAGS : constant unsigned := 0;
PA_SINK_HW_VOLUME_CTRL : constant unsigned := 1;
PA_SINK_LATENCY : constant unsigned := 2;
PA_SINK_HARDWARE : constant unsigned := 4;
PA_SINK_NETWORK : constant unsigned := 8;
PA_SINK_HW_MUTE_CTRL : constant unsigned := 16;
PA_SINK_DECIBEL_VOLUME : constant unsigned := 32;
PA_SINK_FLAT_VOLUME : constant unsigned := 64;
PA_SINK_DYNAMIC_LATENCY : constant unsigned := 128;
PA_SINK_SET_FORMATS : constant unsigned := 256; -- /usr/include/pulse/def.h:776
--*< Flag to pass when no specific options are needed (used to avoid casting) \since 0.9.19
--*< Supports hardware volume control. This is a dynamic flag and may
-- * change at runtime after the sink has initialized
--*< Supports latency querying
--*< Is a hardware sink of some kind, in contrast to
-- * "virtual"/software sinks \since 0.9.3
--*< Is a networked sink of some kind. \since 0.9.7
--*< Supports hardware mute control. This is a dynamic flag and may
-- * change at runtime after the sink has initialized \since 0.9.11
--*< Volume can be translated to dB with pa_sw_volume_to_dB(). This is a
-- * dynamic flag and may change at runtime after the sink has initialized
-- * \since 0.9.11
--*< This sink is in flat volume mode, i.e.\ always the maximum of
-- * the volume of all connected inputs. \since 0.9.15
--*< The latency can be adjusted dynamically depending on the
-- * needs of the connected streams. \since 0.9.15
--*< The sink allows setting what formats are supported by the connected
-- * hardware. The actual functionality to do this might be provided by an
-- * extension. \since 1.0
--* \cond fulldocs
-- PRIVATE: Server-side values -- do not try to use these at client-side.
-- * The server will filter out these flags anyway, so you should never see
-- * these flags in sinks.
--*< This sink shares the volume with the master sink (used by some filter
-- * sinks).
--*< The HW volume changes are syncronized with SW volume.
--* \endcond
subtype pa_sink_flags_t is pa_sink_flags; -- /usr/include/pulse/def.h:831
--* \cond fulldocs
--* \endcond
--* Sink state. \since 0.9.15
-- enum serialized in u8
subtype pa_sink_state is int;
PA_SINK_INVALID_STATE : constant int := -1;
PA_SINK_RUNNING : constant int := 0;
PA_SINK_IDLE : constant int := 1;
PA_SINK_SUSPENDED : constant int := 2;
PA_SINK_INIT : constant int := -2;
PA_SINK_UNLINKED : constant int := -3; -- /usr/include/pulse/def.h:850
--*< This state is used when the server does not support sink state introspection \since 0.9.15
--*< Running, sink is playing and used by at least one non-corked sink-input \since 0.9.15
--*< When idle, the sink is playing but there is no non-corked sink-input attached to it \since 0.9.15
--*< When suspended, actual sink access can be closed, for instance \since 0.9.15
--* \cond fulldocs
-- PRIVATE: Server-side values -- DO NOT USE THIS ON THE CLIENT
-- * SIDE! These values are *not* considered part of the official PA
-- * API/ABI. If you use them your application might break when PA
-- * is upgraded. Also, please note that these values are not useful
-- * on the client side anyway.
--*< Initialization state
--*< The state when the sink is getting unregistered and removed from client access
--* \endcond
subtype pa_sink_state_t is pa_sink_state; -- /usr/include/pulse/def.h:877
--* Returns non-zero if sink is playing: running or idle. \since 0.9.15
function PA_SINK_IS_OPENED (x : pa_sink_state_t) return int; -- /usr/include/pulse/def.h:880
pragma Import (C, PA_SINK_IS_OPENED, "PA_SINK_IS_OPENED");
--* Returns non-zero if sink is running. \since 1.0
function PA_SINK_IS_RUNNING (x : pa_sink_state_t) return int; -- /usr/include/pulse/def.h:885
pragma Import (C, PA_SINK_IS_RUNNING, "PA_SINK_IS_RUNNING");
--* \cond fulldocs
--* \endcond
--* Special source flags.
subtype pa_source_flags is unsigned;
PA_SOURCE_NOFLAGS : constant unsigned := 0;
PA_SOURCE_HW_VOLUME_CTRL : constant unsigned := 1;
PA_SOURCE_LATENCY : constant unsigned := 2;
PA_SOURCE_HARDWARE : constant unsigned := 4;
PA_SOURCE_NETWORK : constant unsigned := 8;
PA_SOURCE_HW_MUTE_CTRL : constant unsigned := 16;
PA_SOURCE_DECIBEL_VOLUME : constant unsigned := 32;
PA_SOURCE_DYNAMIC_LATENCY : constant unsigned := 64;
PA_SOURCE_FLAT_VOLUME : constant unsigned := 128; -- /usr/include/pulse/def.h:900
--*< Flag to pass when no specific options are needed (used to avoid casting) \since 0.9.19
--*< Supports hardware volume control. This is a dynamic flag and may
-- * change at runtime after the source has initialized
--*< Supports latency querying
--*< Is a hardware source of some kind, in contrast to
-- * "virtual"/software source \since 0.9.3
--*< Is a networked source of some kind. \since 0.9.7
--*< Supports hardware mute control. This is a dynamic flag and may
-- * change at runtime after the source has initialized \since 0.9.11
--*< Volume can be translated to dB with pa_sw_volume_to_dB(). This is a
-- * dynamic flag and may change at runtime after the source has initialized
-- * \since 0.9.11
--*< The latency can be adjusted dynamically depending on the
-- * needs of the connected streams. \since 0.9.15
--*< This source is in flat volume mode, i.e.\ always the maximum of
-- * the volume of all connected outputs. \since 1.0
--* \cond fulldocs
-- PRIVATE: Server-side values -- do not try to use these at client-side.
-- * The server will filter out these flags anyway, so you should never see
-- * these flags in sources.
--*< This source shares the volume with the master source (used by some filter
-- * sources).
--*< The HW volume changes are syncronized with SW volume.
subtype pa_source_flags_t is pa_source_flags; -- /usr/include/pulse/def.h:948
--* \cond fulldocs
--* \endcond
--* Source state. \since 0.9.15
subtype pa_source_state is int;
PA_SOURCE_INVALID_STATE : constant int := -1;
PA_SOURCE_RUNNING : constant int := 0;
PA_SOURCE_IDLE : constant int := 1;
PA_SOURCE_SUSPENDED : constant int := 2;
PA_SOURCE_INIT : constant int := -2;
PA_SOURCE_UNLINKED : constant int := -3; -- /usr/include/pulse/def.h:966
--*< This state is used when the server does not support source state introspection \since 0.9.15
--*< Running, source is recording and used by at least one non-corked source-output \since 0.9.15
--*< When idle, the source is still recording but there is no non-corked source-output \since 0.9.15
--*< When suspended, actual source access can be closed, for instance \since 0.9.15
--* \cond fulldocs
-- PRIVATE: Server-side values -- DO NOT USE THIS ON THE CLIENT
-- * SIDE! These values are *not* considered part of the official PA
-- * API/ABI. If you use them your application might break when PA
-- * is upgraded. Also, please note that these values are not useful
-- * on the client side anyway.
--*< Initialization state
--*< The state when the source is getting unregistered and removed from client access
--* \endcond
subtype pa_source_state_t is pa_source_state; -- /usr/include/pulse/def.h:993
--* Returns non-zero if source is recording: running or idle. \since 0.9.15
function PA_SOURCE_IS_OPENED (x : pa_source_state_t) return int; -- /usr/include/pulse/def.h:996
pragma Import (C, PA_SOURCE_IS_OPENED, "PA_SOURCE_IS_OPENED");
--* Returns non-zero if source is running \since 1.0
function PA_SOURCE_IS_RUNNING (x : pa_source_state_t) return int; -- /usr/include/pulse/def.h:1001
pragma Import (C, PA_SOURCE_IS_RUNNING, "PA_SOURCE_IS_RUNNING");
--* \cond fulldocs
--* \endcond
--* A generic free() like callback prototype
type pa_free_cb_t is access procedure (arg1 : System.Address);
pragma Convention (C, pa_free_cb_t); -- /usr/include/pulse/def.h:1016
--* A stream policy/meta event requesting that an application should
-- * cork a specific stream. See pa_stream_event_cb_t for more
-- * information. \since 0.9.15
--* A stream policy/meta event requesting that an application should
-- * cork a specific stream. See pa_stream_event_cb_t for more
-- * information, \since 0.9.15
--* A stream event notifying that the stream is going to be
-- * disconnected because the underlying sink changed and no longer
-- * supports the format that was originally negotiated. Clients need
-- * to connect a new stream to renegotiate a format and continue
-- * playback. \since 1.0
--* Port availability / jack detection status
-- * \since 2.0
type pa_port_available is
(PA_PORT_AVAILABLE_UNKNOWN,
PA_PORT_AVAILABLE_NO,
PA_PORT_AVAILABLE_YES);
pragma Convention (C, pa_port_available); -- /usr/include/pulse/def.h:1038
--*< This port does not support jack detection \since 2.0
--*< This port is not available, likely because the jack is not plugged in. \since 2.0
--*< This port is available, likely because the jack is plugged in. \since 2.0
subtype pa_port_available_t is pa_port_available; -- /usr/include/pulse/def.h:1042
--* \cond fulldocs
--* \endcond
end pulse_def_h;
| 47.821903 | 179 | 0.688696 |
3d7c2f1a962bf5c5559c80c3d82f70461adb332a | 15,385 | adb | Ada | kv-avm-tuples.adb | davidkristola/vole | aa8e19d9deff2efe98fcd4dc0028c2895d624693 | [
"Unlicense"
] | 4 | 2015-02-02T12:11:41.000Z | 2020-12-19T02:14:21.000Z | kv-avm-tuples.adb | davidkristola/vole | aa8e19d9deff2efe98fcd4dc0028c2895d624693 | [
"Unlicense"
] | null | null | null | kv-avm-tuples.adb | davidkristola/vole | aa8e19d9deff2efe98fcd4dc0028c2895d624693 | [
"Unlicense"
] | 3 | 2017-02-22T10:44:02.000Z | 2021-05-16T09:34:39.000Z | with Ada.Unchecked_Deallocation;
with Ada.Text_IO; use Ada.Text_IO;
with Interfaces;
with kv.avm.Registers;
with kv.avm.Memories;
package body kv.avm.Tuples is
use kv.avm.Registers; --!@#$ obe?
use kv.avm.Memories;
type Tuple_Reference_Counter_Type is
record
Count : Natural := 0;
Length : Natural := 0; -- Empty tuples are allowed in which case Data will be null.
Data : kv.avm.Memories.Register_Set_Access;
end record;
-----------------------------------------------------------------------------
procedure Free is new Ada.Unchecked_Deallocation(kv.avm.Memories.Register_Set_Type, kv.avm.Memories.Register_Set_Access);
-----------------------------------------------------------------------------
procedure Free is new Ada.Unchecked_Deallocation(Tuple_Reference_Counter_Type, Tuple_Reference_Counter_Access);
type Map_Reference_Counter_Type is
record
Count : Natural := 0;
Length : Natural := 0; -- Length of Data (Data remains null if Length = 0; empty tuples are allowed)
Data : kv.avm.References.Reference_Array_Access;
end record;
-----------------------------------------------------------------------------
procedure Free is new Ada.Unchecked_Deallocation(kv.avm.References.Reference_Array_Type, kv.avm.References.Reference_Array_Access);
-----------------------------------------------------------------------------
procedure Free is new Ada.Unchecked_Deallocation(Map_Reference_Counter_Type, Map_Reference_Counter_Access);
----------------------------------------------------------------------------
procedure Adjust
(Self : in out Map_Type) is
begin
if Self.Ref /= null then
Self.Ref.Count := Self.Ref.Count + 1;
end if;
end Adjust;
----------------------------------------------------------------------------
procedure Finalize
(Self : in out Map_Type) is
Ref : Map_Reference_Counter_Access := Self.Ref;
begin
Self.Ref := null;
if Ref /= null then
Ref.Count := Ref.Count - 1;
if Ref.Count = 0 then
if Ref.Length /= 0 then
Free(Ref.Data);
end if;
Free(Ref);
end if;
end if;
end Finalize;
----------------------------------------------------------------------------
procedure Set
(Self : in out Map_Type;
Data : access constant kv.avm.References.Reference_Array_Type) is
begin
if Self.Ref /= null then
raise Immutability_Error;
end if;
Self.Ref := new Map_Reference_Counter_Type;
Self.Ref.Length := Data.all'LENGTH;
if Self.Ref.Length /= 0 then
Self.Ref.Data := new kv.avm.References.Reference_Array_Type(0 .. Data.all'LENGTH - 1);
Self.Ref.Data.all := Data.all;
end if;
Self.Ref.Count := Self.Ref.Count + 1;
end Set;
----------------------------------------------------------------------------
function Get(Self : Map_Type) return access constant kv.avm.References.Reference_Array_Type is
begin
if Self.Ref = null or else Self.Ref.Data = null then
return null;
end if;
return Self.Ref.Data.all'ACCESS;
end Get;
----------------------------------------------------------------------------
procedure Tuple_Map_Write(Stream : not null access Ada.Streams.Root_Stream_Type'CLASS; Item : in Map_Type) is
begin
Natural'OUTPUT(Stream, Item.Ref.Length);
if Item.Ref.Length /= 0 then
kv.avm.References.Reference_Array_Type'OUTPUT(Stream, Item.Ref.Data.all);
end if;
end Tuple_Map_Write;
----------------------------------------------------------------------------
procedure Tuple_Map_Read(Stream : not null access Ada.Streams.Root_Stream_Type'CLASS; Item : out Map_Type) is
Length : Natural;
begin
Length := Natural'INPUT(Stream);
if Length /= 0 then
declare
Data : aliased constant kv.avm.References.Reference_Array_Type := kv.avm.References.Reference_Array_Type'INPUT(Stream);
begin
Item.Set(Data'ACCESS);
end;
else
-- Make an empty tuple map
Item.Ref := new Map_Reference_Counter_Type;
Item.Ref.Length := Length;
Item.Ref.Count := 1;
end if;
end Tuple_Map_Read;
----------------------------------------------------------------------------
function "="(L, R: Map_Type) return Boolean is
begin
if L.Ref = Null or R.Ref = Null then
return False;
end if;
if L.Ref.Data = Null or R.Ref.Data = Null then
return False;
end if;
return (L.Ref.Data.all = R.Ref.Data.all);
end "=";
----------------------------------------------------------------------------
procedure Initialize
(Self : in out Tuple_Type) is
begin
-- Don't need to do anything here with Ref.
null;
end Initialize;
----------------------------------------------------------------------------
procedure Adjust
(Self : in out Tuple_Type) is
begin
if Self.Ref /= null then
Self.Ref.Count := Self.Ref.Count + 1;
end if;
end Adjust;
----------------------------------------------------------------------------
procedure Finalize
(Self : in out Tuple_Type) is
Ref : Tuple_Reference_Counter_Access := Self.Ref;
begin
Self.Ref := null;
if Ref /= null then
Ref.Count := Ref.Count - 1;
if Ref.Count = 0 then
if Ref.Length /= 0 then
Free(Ref.Data);
end if;
Free(Ref);
end if;
end if;
end Finalize;
----------------------------------------------------------------------------
procedure Fold
(Self : in out Tuple_Type;
Data : in kv.avm.Memories.Register_Array_Type) is
Registers : kv.avm.Memories.Register_Set_Access;
begin
if Self.Ref /= null then
raise Immutability_Error;
end if;
Self.Ref := new Tuple_Reference_Counter_Type;
Registers := Data.Get;
Self.Ref.Length := Registers.all'LENGTH;
if Self.Ref.Length /= 0 then
Self.Ref.Data := new kv.avm.Memories.Register_Set_Type(0 .. Registers.all'LENGTH - 1);
Self.Ref.Data.all := Registers.all;
end if;
Self.Ref.Count := Self.Ref.Count + 1;
end Fold;
----------------------------------------------------------------------------
procedure Fold_Empty
(Self : in out Tuple_Type) is
begin
if Self.Ref /= null then
raise Immutability_Error;
end if;
Self.Ref := new Tuple_Reference_Counter_Type;
Self.Ref.Length := 0;
Self.Ref.Count := Self.Ref.Count + 1;
end Fold_Empty;
----------------------------------------------------------------------------
procedure Fold_One
(Self : in out Tuple_Type;
Data : access kv.avm.Registers.Register_Type) is
begin
if Self.Ref /= null then
raise Immutability_Error;
end if;
Self.Ref := new Tuple_Reference_Counter_Type;
Self.Ref.Length := 1;
Self.Ref.Data := new kv.avm.Memories.Register_Set_Type(0 .. 0);
Self.Ref.Data(0) := Data.all;
Self.Ref.Count := Self.Ref.Count + 1;
end Fold_One;
----------------------------------------------------------------------------
procedure Fold
(Self : in out Tuple_Type;
Data : in kv.avm.Memories.Memory_Type;
Map : in Map_Type'CLASS) is
Pick_List : access constant kv.avm.References.Reference_Array_Type := Map.Get;
begin
if Self.Ref /= null then
raise Immutability_Error;
end if;
Self.Ref := new Tuple_Reference_Counter_Type;
if Pick_List = null then
Self.Ref.Length := 0;
else
Self.Ref.Length := Pick_List.all'LENGTH;
end if;
if Self.Ref.Length /= 0 then
Self.Ref.Data := new kv.avm.Memories.Register_Set_Type(0 .. Pick_List.all'LENGTH - 1);
for I in Pick_List'RANGE loop
Self.Ref.Data(I) := Data.Read(Pick_List(I));
end loop;
end if;
Self.Ref.Count := Self.Ref.Count + 1;
end Fold;
----------------------------------------------------------------------------
function Peek
(Self : in Tuple_Type;
Index : in Interfaces.Unsigned_32) return access constant kv.avm.Registers.Register_Type is
begin
if Self.Ref = null or else Self.Ref.Data = null then
--Put_Line("WARNING: kv.avm.tuple.Peek, Data is null!");
return null;
end if;
return Self.Ref.Data(Index)'ACCESS;
end Peek;
----------------------------------------------------------------------------
function Unfolded(Self : Tuple_Type) return access constant kv.avm.Memories.Register_Set_Type is
begin
if Self.Ref = null or else Self.Ref.Data = null then
--Put_Line("WARNING: kv.avm.tuple.Unfolded, Data is null!");
return null;
end if;
return Self.Ref.Data.all'ACCESS;
end Unfolded;
----------------------------------------------------------------------------
function To_String(Self : Tuple_Type) return String is
begin
if Self.Ref = null or else Self.Ref.Data = null then
return "<>";
end if;
return kv.avm.Memories.To_String(Self.Ref.Data.all);
end To_String;
-----------------------------------------------------------------------------
function Reachable(Self : Tuple_Type) return kv.avm.Actor_References.Sets.Set is
begin
if Self.Ref = null or else Self.Ref.Data = null then
return kv.avm.Memories.Reachable(Self.Ref.Data);
else
return kv.avm.Actor_References.Sets.Empty_Set;
end if;
end Reachable;
----------------------------------------------------------------------------
function Length(Self : Tuple_Type) return Natural is
begin
if Self.Ref = null then
return 0;
end if;
return Self.Ref.Length;
end Length;
----------------------------------------------------------------------------
function "="(L, R: Tuple_Type) return Boolean is
begin
if L.Ref = Null or R.Ref = Null then
return False;
end if;
if L.Ref.Data = Null or R.Ref.Data = Null then
return False;
end if;
return (L.Ref.Data.all = R.Ref.Data.all);
end "=";
----------------------------------------------------------------------------
procedure Tuple_Write(Stream : not null access Ada.Streams.Root_Stream_Type'CLASS; Item : in Tuple_Type) is
begin
Natural'OUTPUT(Stream, Item.Ref.Length);
if Item.Ref.Length /= 0 then
for Index in Item.Ref.Data.all'RANGE loop
kv.avm.Registers.Register_Type'OUTPUT(Stream, Item.Ref.Data(Index));
end loop;
end if;
end Tuple_Write;
----------------------------------------------------------------------------
procedure Tuple_Read(Stream : not null access Ada.Streams.Root_Stream_Type'CLASS; Item : out Tuple_Type) is
Length : Natural;
begin
Item.Finalize; -- Clear out the old one, if there was something there.
Length := Natural'INPUT(Stream);
if Length /= 0 then
Item.Ref := new Tuple_Reference_Counter_Type;
Item.Ref.Length := Length;
Item.Ref.Data := new kv.avm.Memories.Register_Set_Type(0 .. Interfaces.Unsigned_32(Length) - 1);
for Index in Item.Ref.Data'RANGE loop
Item.Ref.Data(Index) := kv.avm.Registers.Register_Type'INPUT(Stream);
end loop;
Item.Ref.Count := 1;
else
-- Make an empty tuple
Item.Fold_Empty;
end if;
end Tuple_Read;
type Definition_Reference_Counter_Type is
record
Count : Natural := 0;
Length : Natural := 0; -- Length of Data (Data remains null if Length = 0; empty tuples are allowed)
Data : kv.avm.Registers.Signature_Access;
end record;
-----------------------------------------------------------------------------
procedure Free is new Ada.Unchecked_Deallocation(kv.avm.Registers.Signature_Type, kv.avm.Registers.Signature_Access);
-----------------------------------------------------------------------------
procedure Free is new Ada.Unchecked_Deallocation(Definition_Reference_Counter_Type, Definition_Reference_Counter_Access);
----------------------------------------------------------------------------
procedure Initialize
(Self : in out Definition_Type) is
begin
-- Don't need to do anything here with Ref.
null;
end Initialize;
----------------------------------------------------------------------------
procedure Adjust
(Self : in out Definition_Type) is
begin
if Self.Ref /= null then
Self.Ref.Count := Self.Ref.Count + 1;
end if;
end Adjust;
----------------------------------------------------------------------------
procedure Finalize
(Self : in out Definition_Type) is
Ref : Definition_Reference_Counter_Access := Self.Ref;
begin
Self.Ref := null;
if Ref /= null then
Ref.Count := Ref.Count - 1;
if Ref.Count = 0 then
if Ref.Length /= 0 then
Free(Ref.Data);
end if;
Free(Ref);
end if;
end if;
end Finalize;
----------------------------------------------------------------------------
function "="(L, R: Definition_Type) return Boolean is
begin
if L.Ref = Null or R.Ref = Null then
return False;
end if;
if L.Ref.Length = 0 or R.Ref.Length = 0 then
return L.Ref.Length = R.Ref.Length; -- True if both are 0 length
end if;
return (L.Ref.Data.all = R.Ref.Data.all);
end "=";
----------------------------------------------------------------------------
procedure Make
(Self : in out Definition_Type;
Tuple : in Tuple_Type'CLASS) is
begin
if Self.Ref /= null then
raise Immutability_Error;
end if;
Self.Ref := new Definition_Reference_Counter_Type;
Self.Ref.Length := Tuple.Length;
if Self.Ref.Length /= 0 then
Self.Ref.Data := new kv.avm.Registers.Signature_Type(1 .. Self.Ref.Length);
for Index in Tuple.Ref.Data.all'RANGE loop
Self.Ref.Data(Integer(Index+1)) := Tuple.Ref.Data(Index).Format;
end loop;
end if;
Self.Ref.Count := Self.Ref.Count + 1;
end Make;
----------------------------------------------------------------------------
function To_String(Self : Definition_Type) return String is
begin
if Self.Ref = null or else Self.Ref.Length = 0 then
return "";
else
declare
Answer : string(1..Self.Ref.Length);
begin
for Index in Self.Ref.Data'RANGE loop
Answer(Index) := kv.avm.Registers.Signature(Self.Ref.Data(Index));
end loop;
return Answer;
end;
end if;
end To_String;
----------------------------------------------------------------------------
function Length(Self : Definition_Type) return Natural is
begin
if Self.Ref = null then
return 0;
end if;
return Self.Ref.Length;
end Length;
end kv.avm.Tuples;
| 33.228942 | 134 | 0.506727 |
2e869d56db3a99fb7cea5a08d9a06a114645e7f2 | 8,871 | ads | Ada | 3-mid/opengl/source/lean/text/opengl-font.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/opengl/source/lean/text/opengl-font.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/opengl/source/lean/text/opengl-font.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | with
openGL.Glyph.Container,
openGL.FontImpl,
freetype.Face,
freetype_c.FT_GlyphSlot,
ada.Containers.hashed_Maps;
package openGL.Font
--
-- Specific font classes are derived from this class. It uses the helper
-- classes 'freetype_c.Face' and 'freetype_c.FTSize' to access the Freetype library.
--
-- This class is abstract and derived classes must implement the protected
-- 'MakeGlyph' function to create glyphs of the appropriate type.
--
is
type Item is abstract tagged limited private;
type View is access all Item'Class;
----------
-- Font_Id
--
type font_Id is
record
Name : asset_Name;
Size : Integer;
end record;
function Hash (the_Id : in font_Id) return ada.Containers.Hash_type;
------------
-- Font Maps
--
package font_id_Maps_of_font is new ada.Containers.hashed_Maps (Key_Type => font_Id,
Element_Type => Font.view,
Hash => Hash,
Equivalent_Keys => "=");
subtype font_id_Map_of_font is font_id_Maps_of_font.Map;
---------
-- Forge
--
procedure destruct (Self : in out Item);
procedure free (Self : in out View);
--------------
-- Attributes
--
function CharMap (Self : in Item; Encoding : in freetype_c.FT_Encoding) return Boolean;
--
-- Set the character map for the face.
--
-- Encoding: Freetype enumerate for char map code.
--
-- Returns True if charmap was valid and set correctly.
function CharMapCount (Self : in Item) return Natural;
--
-- Get the number of character maps in this face.
--
-- Returns the character map count.
function CharMapList (Self : access Item) return freetype.face.FT_Encodings_view;
--
-- Get a list of character maps in this face.
--
-- Returns aceess to the array of encodings.
function Ascender (Self : in Item) return Real;
--
-- Get the global ascender height for the face.
--
-- Returns the Ascender height.
function Descender (Self : in Item) return Real;
--
-- Gets the global descender height for the face.
--
-- Returns the Descender height.
function LineHeight (Self : in Item) return Real;
--
-- Gets the line spacing for the font.
--
-- Returns the line height.
function FaceSize (Self : access Item; size : in Natural;
x_Res, y_Res : in Natural) return Boolean;
--
-- Set the character size for the current face.
--
-- Returns True if size was set correctly.
function FaceSize (Self : in Item) return Natural;
--
-- Get the current face size in points (1/72 inch).
--
-- Returns the face size.
procedure Depth (Self : in out Item; Depth : in Real);
--
-- Set the extrusion distance for the font. Only implemented by FTExtrudeFont.
--
-- Depth: The extrusion distance.
procedure Outset (Self : in out Item; Outset : in Real);
--
-- Set the outset distance for the font. Only implemented by FTOutlineFont, FTPolygonFont and FTExtrudeFont.
--
-- Outset: The outset distance.
procedure Outset (Self : in out Item; Front : in Real;
Back : in Real);
--
-- Set the front and back outset distances for the font. Only implemented by FTExtrudeFont.
--
-- Front: The front outset distance.
-- Back: The back outset distance.
function BBox (Self : access Item; Text : in String;
Length : in Integer := -1;
Position : in Vector_3 := Origin_3D;
Spacing : in Vector_3 := Origin_3D) return Bounds;
--
-- Get the bounding box for a string.
--
-- Text: A character buffer.
-- Length: The length of the string. If < 0 then all characters will be checked until a null character is encountered.
-- Position: The pen position of the first character.
-- Spacing: A displacement vector to add after each character has been checked.
--
-- Returns the corresponding bounding box.
function Error (Self : in Item) return freetype_c.FT_Error;
--
-- Queries the font for errors.
--
-- Returns the current error code.
--------------
-- Operations
--
function attach (Self : in Item; Font_File_Path : in String) return Boolean;
--
-- Attach auxilliary file to font e.g font metrics.
-- Note: Not all font formats implement this function.
--
-- fontFilePath: The auxilliary font file path.
--
-- Returns True if file has been attached successfully.
function attach (Self : in Item; pBufferBytes : in FontImpl.unsigned_char_Pointer;
bufferSizeInBytes : in Natural) return Boolean;
--
-- Attach auxilliary data to font e.g font metrics, from memory.
-- Note: Not all font formats implement this function.
--
-- 'pBufferBytes' The in-memory buffer.
-- 'bufferSizeInBytes' The length of the buffer in bytes.
--
-- Returns True if file has been attached successfully.
procedure glyph_load_Flags (Self : in out Item; Flags : in freetype_c.FT_Int);
--
-- Set the glyph loading flags. By default, fonts use the most
-- sensible flags when loading a font's glyph using FT_Load_Glyph().
-- This function allows to override the default flags.
--
-- Flags: The glyph loading flags.
function Advance (Self : access Item; Text : in String;
Length : in Integer := -1;
Spacing : in Vector_3 := Origin_3D) return Real;
--
-- Get the advance for a string.
--
-- Text: String to be checked.
-- Length: The length of the string. If < 0 then all characters will be checked until
-- a null character is encountered.
-- Spacing: A displacement vector to add after each character has been checked.
--
-- Returns the string's advance width.
function kern_Advance (Self : in Item; From, To : in Character) return Real;
function x_PPEM (Self : in Item) return Real;
function x_Scale (Self : in Item) return Real;
function y_Scale (Self : in Item) return Real;
function check_Glyphs (Self : access Item; Text : in String;
Length : in Integer := -1;
Position : in Vector_3 := math.Origin_3D;
Spacing : in Vector_3 := math.Origin_3D;
Mode : in fontImpl.RenderMode := fontImpl.RENDER_ALL) return Vector_3;
--
-- Render a string of characters.
--
-- Text: String to be output.
-- Length: The length of the string. If < 0 then all characters will be displayed until a null character is encountered.
-- Position: The pen position of the first character.
-- Spacing: A displacement vector to add after each character has been displayed
-- Mode: Render mode to use for display.
--
-- Returns the new pen position after the last character was output.
function MakeGlyph (Self : access Item; Slot : in freetype_c.FT_GlyphSlot.item) return glyph.Container.Glyph_view
is abstract;
--
-- Construct a glyph of the correct type.
-- Clients must override the function and return their specialised glyph.
--
-- Slot: A FreeType glyph slot.
--
-- Returns an FTGlyph or null on failure.
private
type Item is abstract tagged limited
record
Impl : FontImpl.view; -- Internal FTGL FTFont implementation object. For private use only.
end record;
procedure define (Self : in out Item; fontFilePath : in String);
--
-- Open and read a font file. Sets Error flag.
procedure define (Self : in out Item; pBufferBytes : in FontImpl.unsigned_char_Pointer;
bufferSizeInBytes : in Natural);
--
-- Open and read a font from a buffer in memory. Sets Error flag.
-- The buffer is owned by the client and is NOT copied by FTGL. The pointer must be valid while using FTGL.
procedure define (Self : in out Item; pImpl : in FontImpl.view);
--
-- Internal FTGL FTFont constructor. For private use only.
--
-- pImpl: An internal implementation object, which will be destroyed upon FTFont deletion.
end openGL.Font;
| 32.258182 | 126 | 0.594747 |
2e8873f672b973694d35cf9ac15571ce7129522e | 1,788 | ads | Ada | tier-1/xcb/source/thin/xcb-xcb_render_query_pict_index_values_reply_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 2 | 2015-11-12T11:16:20.000Z | 2021-08-24T22:32:04.000Z | tier-1/xcb/source/thin/xcb-xcb_render_query_pict_index_values_reply_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 1 | 2018-06-05T05:19:35.000Z | 2021-11-20T01:13:23.000Z | tier-1/xcb/source/thin/xcb-xcb_render_query_pict_index_values_reply_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | null | null | null | -- This file is generated by SWIG. Please do not modify by hand.
--
with Interfaces;
with swig;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_render_query_pict_index_values_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;
num_values : aliased Interfaces.Unsigned_32;
pad1 : aliased swig.int8_t_Array (0 .. 19);
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb
.xcb_render_query_pict_index_values_reply_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_render_query_pict_index_values_reply_t.Item,
Element_Array =>
xcb.xcb_render_query_pict_index_values_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_render_query_pict_index_values_reply_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_render_query_pict_index_values_reply_t.Pointer,
Element_Array =>
xcb.xcb_render_query_pict_index_values_reply_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_render_query_pict_index_values_reply_t;
| 28.380952 | 78 | 0.680649 |
ad55243fc3ce468b67b5fbe048b5eec149ca08df | 2,984 | adb | Ada | llvm-gcc-4.2-2.9/gcc/ada/s-wchcon.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | llvm-gcc-4.2-2.9/gcc/ada/s-wchcon.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/s-wchcon.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . W C H _ C O N --
-- --
-- B o d y --
-- --
-- Copyright (C) 2005, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
package body System.WCh_Con is
----------------------------
-- Get_WC_Encoding_Method --
----------------------------
function Get_WC_Encoding_Method (C : Character) return WC_Encoding_Method is
begin
for Method in WC_Encoding_Method loop
if C = WC_Encoding_Letters (Method) then
return Method;
end if;
end loop;
raise Constraint_Error;
end Get_WC_Encoding_Method;
end System.WCh_Con;
| 57.384615 | 79 | 0.434987 |
04087925f7d9ded71f21a6857e861272fcfe2776 | 6,984 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/a-strfix.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | llvm-gcc-4.2-2.9/gcc/ada/a-strfix.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/a-strfix.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . S T R I N G S . F I X E D --
-- --
-- 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.Strings.Maps;
package Ada.Strings.Fixed is
pragma Preelaborate;
--------------------------------------------------------------
-- Copy Procedure for Strings of Possibly Different Lengths --
--------------------------------------------------------------
procedure Move
(Source : String;
Target : out String;
Drop : Truncation := Error;
Justify : Alignment := Left;
Pad : Character := Space);
------------------------
-- Search Subprograms --
------------------------
function Index
(Source : String;
Pattern : String;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping := Maps.Identity) return Natural;
function Index
(Source : String;
Pattern : String;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping_Function) return Natural;
function Index
(Source : String;
Set : Maps.Character_Set;
Test : Membership := Inside;
Going : Direction := Forward) return Natural;
function Index
(Source : String;
Pattern : String;
From : Positive;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping := Maps.Identity) return Natural;
pragma Ada_05 (Index);
function Index
(Source : String;
Pattern : String;
From : Positive;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping_Function) return Natural;
pragma Ada_05 (Index);
function Index
(Source : String;
Set : Maps.Character_Set;
From : Positive;
Test : Membership := Inside;
Going : Direction := Forward) return Natural;
pragma Ada_05 (Index);
function Index_Non_Blank
(Source : String;
Going : Direction := Forward) return Natural;
function Index_Non_Blank
(Source : String;
From : Positive;
Going : Direction := Forward) return Natural;
pragma Ada_05 (Index_Non_Blank);
function Count
(Source : String;
Pattern : String;
Mapping : Maps.Character_Mapping := Maps.Identity) return Natural;
function Count
(Source : String;
Pattern : String;
Mapping : Maps.Character_Mapping_Function) return Natural;
function Count
(Source : String;
Set : Maps.Character_Set) return Natural;
procedure Find_Token
(Source : String;
Set : Maps.Character_Set;
Test : Membership;
First : out Positive;
Last : out Natural);
------------------------------------
-- String Translation Subprograms --
------------------------------------
function Translate
(Source : String;
Mapping : Maps.Character_Mapping) return String;
procedure Translate
(Source : in out String;
Mapping : Maps.Character_Mapping);
function Translate
(Source : String;
Mapping : Maps.Character_Mapping_Function) return String;
procedure Translate
(Source : in out String;
Mapping : Maps.Character_Mapping_Function);
---------------------------------------
-- String Transformation Subprograms --
---------------------------------------
function Replace_Slice
(Source : String;
Low : Positive;
High : Natural;
By : String) return String;
procedure Replace_Slice
(Source : in out String;
Low : Positive;
High : Natural;
By : String;
Drop : Truncation := Error;
Justify : Alignment := Left;
Pad : Character := Space);
function Insert
(Source : String;
Before : Positive;
New_Item : String) return String;
procedure Insert
(Source : in out String;
Before : Positive;
New_Item : String;
Drop : Truncation := Error);
function Overwrite
(Source : String;
Position : Positive;
New_Item : String) return String;
procedure Overwrite
(Source : in out String;
Position : Positive;
New_Item : String;
Drop : Truncation := Right);
function Delete
(Source : String;
From : Positive;
Through : Natural) return String;
procedure Delete
(Source : in out String;
From : Positive;
Through : Natural;
Justify : Alignment := Left;
Pad : Character := Space);
---------------------------------
-- String Selector Subprograms --
---------------------------------
function Trim
(Source : String;
Side : Trim_End) return String;
procedure Trim
(Source : in out String;
Side : Trim_End;
Justify : Alignment := Left;
Pad : Character := Space);
function Trim
(Source : String;
Left : Maps.Character_Set;
Right : Maps.Character_Set) return String;
procedure Trim
(Source : in out String;
Left : Maps.Character_Set;
Right : Maps.Character_Set;
Justify : Alignment := Strings.Left;
Pad : Character := Space);
function Head
(Source : String;
Count : Natural;
Pad : Character := Space) return String;
procedure Head
(Source : in out String;
Count : Natural;
Justify : Alignment := Left;
Pad : Character := Space);
function Tail
(Source : String;
Count : Natural;
Pad : Character := Space) return String;
procedure Tail
(Source : in out String;
Count : Natural;
Justify : Alignment := Left;
Pad : Character := Space);
----------------------------------
-- String Constructor Functions --
----------------------------------
function "*"
(Left : Natural;
Right : Character) return String;
function "*"
(Left : Natural;
Right : String) return String;
end Ada.Strings.Fixed;
| 28.740741 | 78 | 0.501575 |
1d61a151bfb51d7453573e5decaa91b512df9898 | 2,113 | ads | Ada | source/compiler/compiler-file_descriptors.ads | mgrojo/protobuf | ffc50782c0c5bbb60e8f1504fcfc5a5fbafdb7dd | [
"MIT"
] | 12 | 2020-05-04T09:30:21.000Z | 2022-02-08T21:47:32.000Z | source/compiler/compiler-file_descriptors.ads | mgrojo/protobuf | ffc50782c0c5bbb60e8f1504fcfc5a5fbafdb7dd | [
"MIT"
] | 6 | 2021-03-16T15:17:33.000Z | 2022-03-31T21:32:47.000Z | source/compiler/compiler-file_descriptors.ads | mgrojo/protobuf | ffc50782c0c5bbb60e8f1504fcfc5a5fbafdb7dd | [
"MIT"
] | 1 | 2021-03-16T15:09:27.000Z | 2021-03-16T15:09:27.000Z | -- MIT License
--
-- Copyright (c) 2020 Max Reznik
--
-- Permission is hereby granted, free of charge, to any person obtaining a
-- copy of this software and associated documentation files (the "Software"),
-- to deal in the Software without restriction, including without limitation
-- the rights to use, copy, modify, merge, publish, distribute, sublicense,
-- and/or sell copies of the Software, and to permit persons to whom the
-- Software is furnished to do so, subject to the following conditions:
--
-- The above copyright notice and this permission notice shall be included in
-- all copies or substantial portions of the Software.
--
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
-- THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
-- FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
-- DEALINGS IN THE SOFTWARE.
with League.Strings;
with Google.Protobuf.Descriptor;
with Google.Protobuf.Compiler.Plugin;
with Compiler.Context;
package Compiler.File_Descriptors is
procedure Populate_Named_Types
(Self : Google.Protobuf.Descriptor.File_Descriptor_Proto;
Map : in out Compiler.Context.Named_Type_Maps.Map);
-- Fill Map with type information found in a file descriptor
function File_Name
(Self : Google.Protobuf.Descriptor.File_Descriptor_Proto)
return League.Strings.Universal_String;
-- Return base name for Ada package
function Specification_Text
(Self : Google.Protobuf.Descriptor.File_Descriptor_Proto;
Request : Google.Protobuf.Compiler.Plugin.Code_Generator_Request)
return League.Strings.Universal_String;
-- Return base name for Ada package
function Body_Text
(Self : Google.Protobuf.Descriptor.File_Descriptor_Proto)
return League.Strings.Universal_String;
end Compiler.File_Descriptors;
| 39.867925 | 78 | 0.759584 |
ad5da50a09dce495c8db7ce1cda4f04d6166bb6a | 3,895 | ads | Ada | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-pack20.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-pack20.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-pack20.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 2 0 --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2019, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Handling of packed arrays with Component_Size = 20
package System.Pack_20 is
pragma Preelaborate;
Bits : constant := 20;
type Bits_20 is mod 2 ** Bits;
for Bits_20'Size use Bits;
-- In all subprograms below, Rev_SSO is set True if the array has the
-- non-default scalar storage order.
function Get_20
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_20 with Inline;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned.
procedure Set_20
(Arr : System.Address;
N : Natural;
E : Bits_20;
Rev_SSO : Boolean) with Inline;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is set to the given value.
function GetU_20
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_20 with Inline;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned. This version
-- is used when Arr may represent an unaligned address.
procedure SetU_20
(Arr : System.Address;
N : Natural;
E : Bits_20;
Rev_SSO : Boolean) with Inline;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is set to the given value. This version
-- is used when Arr may represent an unaligned address
end System.Pack_20;
| 49.935897 | 78 | 0.474711 |
41b3cc89fd49a29f2fc052363d88631b1e6c6d26 | 6,381 | ads | Ada | src/vulkan-math/vulkan-math-dmat4x3.ads | zrmyers/VulkanAda | ed8c46d923bc8936db3a5d55d36afebb928a9ede | [
"MIT"
] | 1 | 2021-01-29T21:10:45.000Z | 2021-01-29T21:10:45.000Z | src/vulkan-math/vulkan-math-dmat4x3.ads | zrmyers/VulkanAda | ed8c46d923bc8936db3a5d55d36afebb928a9ede | [
"MIT"
] | 8 | 2020-04-22T14:55:20.000Z | 2021-11-22T03:58:08.000Z | src/vulkan-math/vulkan-math-dmat4x3.ads | zrmyers/VulkanAda | ed8c46d923bc8936db3a5d55d36afebb928a9ede | [
"MIT"
] | 1 | 2021-04-05T13:19:21.000Z | 2021-04-05T13:19:21.000Z | --------------------------------------------------------------------------------
-- MIT License
--
-- Copyright (c) 2021 Zane Myers
--
-- Permission is hereby granted, free of charge, to any person obtaining a copy
-- of this software and associated documentation files (the "Software"), to deal
-- in the Software without restriction, including without limitation the rights
-- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-- copies of the Software, and to permit persons to whom the Software is
-- furnished to do so, subject to the following conditions:
--
-- The above copyright notice and this permission notice shall be included in all
-- copies or substantial portions of the Software.
--
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-- SOFTWARE.
--------------------------------------------------------------------------------
with Vulkan.Math.GenDMatrix;
with Vulkan.Math.Dvec3;
use Vulkan.Math.GenDMatrix;
use Vulkan.Math.Dvec3;
--------------------------------------------------------------------------------
--< @group Vulkan Math Basic Types
--------------------------------------------------------------------------------
--< @summary
--< This package provides a single precision floating point matrix with 3 rows
--< and 3 columns.
--------------------------------------------------------------------------------
package Vulkan.Math.Dmat4x3 is
pragma Preelaborate;
pragma Pure;
--< A 4x3 matrix of single-precision floating point numbers.
subtype Vkm_Dmat4x3 is Vkm_Dmat(
last_row_index => 3, last_column_index => 2);
----------------------------------------------------------------------------
--< @summary
--< Constructor for Vkm_Dmat4x3 type.
--<
--< @description
--< Construct a 4x3 matrix with each component set to the corresponding
--< component in the identity matrix.
--<
--< @return
--< A 4x3 matrix.
----------------------------------------------------------------------------
function Make_Dmat4x3 return Vkm_Dmat4x3 is
(GDM.Make_GenMatrix(cN => 2, rN => 3)) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Constructor for Vkm_Dmat4x3 type.
--<
--< @description
--< Construct a 4x3 matrix with each component set to a different value.
--<
--< @param value1
--< The first value to set for the matrix.
--<
--< @param value2
--< The second value to set for the matrix.
--<
--< @param value3
--< The third value to set for the matrix.
--<
--< @param value4
--< The fourth value to set for the matrix.
--<
--< @param value5
--< The fifth value to set for the matrix.
--<
--< @param value6
--< The sixth value to set for the matrix.
--<
--< @param value7
--< The seventh value to set for the matrix.
--<
--< @param value8
--< The eighth value to set for the matrix.
--<
--< @param value9
--< The ninth value to set for the matrix.
--<
--< @return
--< A 4x3 matrix.
----------------------------------------------------------------------------
function Make_Dmat4x3 (
value1 , value2 , value3 ,
value4 , value5 , value6 ,
value7 , value8 , value9 ,
value10, value11, value12 : in Vkm_Double) return Vkm_Dmat4x3 is
(GDM.Make_GenMatrix(
cN => 2, rN => 3,
c0r0_val => value1, c0r1_val => value4, c0r2_val => value7, c0r3_val => value10,
c1r0_val => value2, c1r1_val => value5, c1r2_val => value8, c1r3_val => value11,
c2r0_val => value3, c2r1_val => value6, c2r2_val => value9, c2r3_val => value12)) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Constructor for Vkm_Dmat4x3 type.
--<
--< @description
--< Construct a 4x3 matrix with each column set to the value of a 2 dimmensional
--< vector.
--<
--< @param value1
--< The first value to set for the matrix.
--<
--< @param value2
--< The second value to set for the matrix.
--<
--< @return
--< A 4x3 matrix.
----------------------------------------------------------------------------
function Make_Dmat4x3 (
value1, value2, value3, value4 : in Vkm_Dvec3) return Vkm_Dmat4x3 is
(GDM.Make_GenMatrix(
cN => 2, rN => 3,
c0r0_val => value1.x, c0r1_val => value2.x, c0r2_val => value3.x, c0r3_val => value4.x,
c1r0_val => value1.y, c1r1_val => value2.y, c1r2_val => value3.y, c1r3_val => value4.y,
c2r0_val => value1.z, c2r1_val => value2.z, c2r2_val => value3.z, c2r3_val => value4.z)) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Constructor for Vkm_Dmat4x3 type.
--<
--< @description
--< Construct a 4x3 matrix using values from an existing matrix.
--<
--< If the provided matrix has dimmensions that are not the same as this
--< matrix, the corresponding element in the 4x4 identity matrix is used for
--< out of bounds accesses.
--<
--< @param value1
--< The submatrix to extract values from.
--<
--< @return
--< A 4x3 matrix.
----------------------------------------------------------------------------
function Make_Dmat4x3 (
value1 : in Vkm_Dmat) return Vkm_Dmat4x3 is
(GDM.Make_GenMatrix(
cN => 2, rN => 3,
c0r0_val => value1.c0r0, c0r1_val => value1.c0r1, c0r2_val => value1.c0r2, c0r3_val => value1.c0r3,
c1r0_val => value1.c1r0, c1r1_val => value1.c1r1, c1r2_val => value1.c1r2, c1r3_val => value1.c1r3,
c2r0_val => value1.c2r0, c2r1_val => value1.c2r1, c2r2_val => value1.c2r2, c2r3_val => value1.c2r3)) with Inline;
end Vulkan.Math.Dmat4x3;
| 39.388889 | 126 | 0.527974 |
2e4a0174ff417b3727357ee14c58da20460be030 | 3,333 | adb | Ada | examples/zlibwrap/zlib/contrib/ada/zlib-thin.adb | gahr/critcl | bceac8a8e959c40357c0ebdc0f0ec6c14408b5bf | [
"TCL"
] | 41 | 2015-03-19T09:26:55.000Z | 2022-03-22T09:41:33.000Z | examples/zlibwrap/zlib/contrib/ada/zlib-thin.adb | apnadkarni/critcl | db00b6cd251cfdfca6c685772941e559fdf9b6a1 | [
"TCL"
] | 69 | 2015-02-06T17:30:53.000Z | 2022-03-25T16:27:43.000Z | examples/zlibwrap/zlib/contrib/ada/zlib-thin.adb | apnadkarni/critcl | db00b6cd251cfdfca6c685772941e559fdf9b6a1 | [
"TCL"
] | 11 | 2015-02-05T15:46:39.000Z | 2021-03-24T18:43:53.000Z | ----------------------------------------------------------------
-- ZLib for Ada thick binding. --
-- --
-- Copyright (C) 2002-2003 Dmitriy Anisimkov --
-- --
-- Open source license information is in the zlib.ads file. --
----------------------------------------------------------------
-- $Id: zlib-thin.adb 66 2005-08-17 18:20:58Z andreas_kupries $
package body ZLib.Thin is
ZLIB_VERSION : constant Chars_Ptr := zlibVersion;
Z_Stream_Size : constant Int := Z_Stream'Size / System.Storage_Unit;
--------------
-- Avail_In --
--------------
function Avail_In (Strm : in Z_Stream) return UInt is
begin
return Strm.Avail_In;
end Avail_In;
---------------
-- Avail_Out --
---------------
function Avail_Out (Strm : in Z_Stream) return UInt is
begin
return Strm.Avail_Out;
end Avail_Out;
------------------
-- Deflate_Init --
------------------
function Deflate_Init
(strm : Z_Streamp;
level : Int;
method : Int;
windowBits : Int;
memLevel : Int;
strategy : Int)
return Int is
begin
return deflateInit2
(strm,
level,
method,
windowBits,
memLevel,
strategy,
ZLIB_VERSION,
Z_Stream_Size);
end Deflate_Init;
------------------
-- Inflate_Init --
------------------
function Inflate_Init (strm : Z_Streamp; windowBits : Int) return Int is
begin
return inflateInit2 (strm, windowBits, ZLIB_VERSION, Z_Stream_Size);
end Inflate_Init;
------------------------
-- Last_Error_Message --
------------------------
function Last_Error_Message (Strm : in Z_Stream) return String is
use Interfaces.C.Strings;
begin
if Strm.msg = Null_Ptr then
return "";
else
return Value (Strm.msg);
end if;
end Last_Error_Message;
------------
-- Set_In --
------------
procedure Set_In
(Strm : in out Z_Stream;
Buffer : in Voidp;
Size : in UInt) is
begin
Strm.Next_In := Buffer;
Strm.Avail_In := Size;
end Set_In;
------------------
-- Set_Mem_Func --
------------------
procedure Set_Mem_Func
(Strm : in out Z_Stream;
Opaque : in Voidp;
Alloc : in alloc_func;
Free : in free_func) is
begin
Strm.opaque := Opaque;
Strm.zalloc := Alloc;
Strm.zfree := Free;
end Set_Mem_Func;
-------------
-- Set_Out --
-------------
procedure Set_Out
(Strm : in out Z_Stream;
Buffer : in Voidp;
Size : in UInt) is
begin
Strm.Next_Out := Buffer;
Strm.Avail_Out := Size;
end Set_Out;
--------------
-- Total_In --
--------------
function Total_In (Strm : in Z_Stream) return ULong is
begin
return Strm.Total_In;
end Total_In;
---------------
-- Total_Out --
---------------
function Total_Out (Strm : in Z_Stream) return ULong is
begin
return Strm.Total_Out;
end Total_Out;
end ZLib.Thin;
| 23.471831 | 75 | 0.460846 |
a1bcde8c5a830a8e5c24a74e10be91b58febfce9 | 4,301 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/s-exctab.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | llvm-gcc-4.2-2.9/gcc/ada/s-exctab.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/s-exctab.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . E X C E P T I O N _ T A B L E --
-- --
-- S p e c --
-- --
-- Copyright (C) 1996-2005 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package implements the interface used to maintain a table of
-- registered exception names, for the implementation of the mapping
-- of names to exceptions (used for exception streams and attributes)
with System.Standard_Library;
package System.Exception_Table is
pragma Elaborate_Body;
package SSL renames System.Standard_Library;
procedure Register_Exception (X : SSL.Exception_Data_Ptr);
pragma Inline (Register_Exception);
-- Register an exception in the hash table mapping. This function is
-- called during elaboration of library packages. For exceptions that
-- are declared within subprograms, the registration occurs the first
-- time that an exception is elaborated during a call of the subprogram.
--
-- Note: all calls to Register_Exception other than those to register the
-- predefined exceptions are suppressed if the application is compiled
-- with pragma Restrictions (No_Exception_Registration).
function Internal_Exception
(X : String;
Create_If_Not_Exist : Boolean := True) return SSL.Exception_Data_Ptr;
-- Given an exception_name X, returns a pointer to the actual internal
-- exception data. A new entry is created in the table if X does not
-- exist yet and Create_If_Not_Exist is True. If it is false and X
-- does not exist yet, null is returned.
function Registered_Exceptions_Count return Natural;
-- Return the number of currently registered exceptions.
type Exception_Data_Array is array (Natural range <>)
of SSL.Exception_Data_Ptr;
procedure Get_Registered_Exceptions
(List : out Exception_Data_Array;
Last : out Integer);
-- Return the list of registered exceptions.
end System.Exception_Table;
| 56.592105 | 78 | 0.548942 |
13e199e4294d930b6b094b6e957b62b15658dec7 | 93,835 | adb | Ada | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d/conv2d/hls_target/.autopilot/db/call_Loop_LB2D_shift.sched.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | 1 | 2020-06-18T16:51:39.000Z | 2020-06-18T16:51:39.000Z | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d/conv2d/hls_target/.autopilot/db/call_Loop_LB2D_shift.sched.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | null | null | null | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d/conv2d/hls_target/.autopilot/db/call_Loop_LB2D_shift.sched.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | 1 | 2020-03-18T00:43:22.000Z | 2020-03-18T00:43:22.000Z | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="14">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>call_Loop_LB2D_shift</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>slice_stream_V_value_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in_stream.V.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>96</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>out_stream_V_value_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>out_stream.V.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>288</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>36</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>3</id>
<name>buffer_1_value_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>buffer[1].value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>96</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>62</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>4</id>
<name>buffer_0_value_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>buffer[0].value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>96</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>n1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>n1</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>65</item>
<item>66</item>
<item>68</item>
<item>69</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>tmp_9</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>216</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</first>
<second class_id="12" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="13" tracking_level="0" version="0">
<first class_id="14" tracking_level="0" version="0">
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>216</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>70</item>
<item>72</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>n1_1</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>216</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_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>216</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>n1</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>73</item>
<item>75</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>216</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_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>216</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>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="_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_8_shifts/conv2d</fileDirectory>
<lineNumber>32</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_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>32</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</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>92</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>i_0_i_i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>80</item>
<item>81</item>
<item>82</item>
<item>83</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>tmp_4</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>32</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_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>32</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>84</item>
<item>86</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>i</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>32</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_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>32</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>87</item>
<item>88</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>25</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>32</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_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>32</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</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>89</item>
<item>90</item>
<item>91</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>30</id>
<name>tmp_value_V_1</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>40</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_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>40</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>96</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>100</item>
<item>101</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>31</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_8_shifts/conv2d</fileDirectory>
<lineNumber>42</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_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>42</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>103</item>
<item>104</item>
<item>105</item>
<item>107</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>icmp</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>42</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_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>42</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</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>108</item>
<item>110</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>42</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_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>42</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</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>111</item>
<item>112</item>
<item>113</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>buffer_1_value_V_lo_1</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>50</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_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>50</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>96</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>114</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>36</id>
<name>buffer_0_value_V_lo</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>50</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_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>50</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>96</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>37</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_8_shifts/conv2d</fileDirectory>
<lineNumber>50</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_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>50</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</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>116</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>tmp_2</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>50</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_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>50</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</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>117</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>tmp_5</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>50</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_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>50</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</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>118</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>p_Result_5_1</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>50</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_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>50</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>120</item>
<item>121</item>
<item>123</item>
<item>125</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>p_Result_5_1_1</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>50</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_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>50</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>126</item>
<item>127</item>
<item>128</item>
<item>129</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>42</id>
<name>p_Result_5_1_2</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>50</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_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>50</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>130</item>
<item>131</item>
<item>132</item>
<item>133</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>p_Result_5_2</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>50</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_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>50</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>134</item>
<item>135</item>
<item>137</item>
<item>139</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>44</id>
<name>p_Result_5_2_1</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>50</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_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>50</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>140</item>
<item>141</item>
<item>142</item>
<item>143</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>p_Result_5_2_2</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>50</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_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>50</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>144</item>
<item>145</item>
<item>146</item>
<item>147</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>tmp_value_V</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>50</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_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>50</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>288</bitwidth>
</Value>
<oprand_edges>
<count>10</count>
<item_version>0</item_version>
<item>149</item>
<item>150</item>
<item>151</item>
<item>152</item>
<item>153</item>
<item>154</item>
<item>155</item>
<item>156</item>
<item>157</item>
<item>158</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>52</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_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>52</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</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>160</item>
<item>161</item>
<item>162</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>53</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_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>53</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</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>163</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>buffer_1_value_V_lo</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>37</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</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>96</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>93</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name></name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>37</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</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>94</item>
<item>95</item>
<item>279</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>40</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_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>40</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>96</item>
<item>97</item>
<item>277</item>
<item>278</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>32</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_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>32</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1920, 3, 1, 1, 1, 3, unsigned int&gt;</second>
</first>
<second>143</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>98</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>216</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_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>216</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>79</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>59</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>11</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_39">
<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>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_40">
<Value>
<Obj>
<type>2</type>
<id>67</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="_41">
<Value>
<Obj>
<type>2</type>
<id>71</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="_42">
<Value>
<Obj>
<type>2</type>
<id>74</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_43">
<Value>
<Obj>
<type>2</type>
<id>85</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>1920</content>
</item>
<item class_id_reference="16" object_id="_44">
<Value>
<Obj>
<type>2</type>
<id>106</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>10</content>
</item>
<item class_id_reference="16" object_id="_45">
<Value>
<Obj>
<type>2</type>
<id>109</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_46">
<Value>
<Obj>
<type>2</type>
<id>122</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>32</content>
</item>
<item class_id_reference="16" object_id="_47">
<Value>
<Obj>
<type>2</type>
<id>124</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>63</content>
</item>
<item class_id_reference="16" object_id="_48">
<Value>
<Obj>
<type>2</type>
<id>136</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>64</content>
</item>
<item class_id_reference="16" object_id="_49">
<Value>
<Obj>
<type>2</type>
<id>138</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>95</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="_50">
<Obj>
<type>3</type>
<id>10</id>
<name>newFuncRoot</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>3</item>
<item>4</item>
<item>9</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_51">
<Obj>
<type>3</type>
<id>16</id>
<name>.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>4</count>
<item_version>0</item_version>
<item>11</item>
<item>12</item>
<item>14</item>
<item>15</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_52">
<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>1</count>
<item_version>0</item_version>
<item>19</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_53">
<Obj>
<type>3</type>
<id>26</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>24</item>
<item>25</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_54">
<Obj>
<type>3</type>
<id>34</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>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_55">
<Obj>
<type>3</type>
<id>49</id>
<name>.preheader.i.i.preheader.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>14</count>
<item_version>0</item_version>
<item>35</item>
<item>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
<item>40</item>
<item>41</item>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
<item>46</item>
<item>47</item>
<item>48</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_56">
<Obj>
<type>3</type>
<id>55</id>
<name>._crit_edge.i.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>50</item>
<item>52</item>
<item>53</item>
<item>54</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_57">
<Obj>
<type>3</type>
<id>58</id>
<name>linebuffer_1D<1920ul, 3ul, 1ul, 1ul, 1ul, 3ul, unsigned int>.exit</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_58">
<Obj>
<type>3</type>
<id>60</id>
<name>.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>59</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>91</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_59">
<id>62</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>3</sink_obj>
</item>
<item class_id_reference="20" object_id="_60">
<id>63</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>4</sink_obj>
</item>
<item class_id_reference="20" object_id="_61">
<id>64</id>
<edge_type>2</edge_type>
<source_obj>16</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_62">
<id>65</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_63">
<id>66</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_64">
<id>68</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_65">
<id>69</id>
<edge_type>2</edge_type>
<source_obj>10</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_66">
<id>70</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_67">
<id>72</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_68">
<id>73</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_69">
<id>75</id>
<edge_type>1</edge_type>
<source_obj>74</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_70">
<id>76</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_71">
<id>77</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_72">
<id>78</id>
<edge_type>2</edge_type>
<source_obj>60</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_73">
<id>79</id>
<edge_type>2</edge_type>
<source_obj>16</source_obj>
<sink_obj>57</sink_obj>
</item>
<item class_id_reference="20" object_id="_74">
<id>80</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_75">
<id>81</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_76">
<id>82</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_77">
<id>83</id>
<edge_type>2</edge_type>
<source_obj>55</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_78">
<id>84</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_79">
<id>86</id>
<edge_type>1</edge_type>
<source_obj>85</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_80">
<id>87</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_81">
<id>88</id>
<edge_type>1</edge_type>
<source_obj>74</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_82">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_83">
<id>90</id>
<edge_type>2</edge_type>
<source_obj>34</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_84">
<id>91</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_85">
<id>92</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_86">
<id>93</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_87">
<id>94</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_88">
<id>95</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_89">
<id>96</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_90">
<id>97</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_91">
<id>98</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_92">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_93">
<id>104</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_94">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_95">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>106</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_96">
<id>108</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_97">
<id>110</id>
<edge_type>1</edge_type>
<source_obj>109</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_98">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_99">
<id>112</id>
<edge_type>2</edge_type>
<source_obj>49</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_100">
<id>113</id>
<edge_type>2</edge_type>
<source_obj>55</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_101">
<id>114</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_102">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_103">
<id>116</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_104">
<id>117</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_105">
<id>118</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_106">
<id>121</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_107">
<id>123</id>
<edge_type>1</edge_type>
<source_obj>122</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_108">
<id>125</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_109">
<id>127</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_110">
<id>128</id>
<edge_type>1</edge_type>
<source_obj>122</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_111">
<id>129</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_112">
<id>131</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_113">
<id>132</id>
<edge_type>1</edge_type>
<source_obj>122</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_114">
<id>133</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_115">
<id>135</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_116">
<id>137</id>
<edge_type>1</edge_type>
<source_obj>136</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_117">
<id>139</id>
<edge_type>1</edge_type>
<source_obj>138</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_118">
<id>141</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_119">
<id>142</id>
<edge_type>1</edge_type>
<source_obj>136</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_120">
<id>143</id>
<edge_type>1</edge_type>
<source_obj>138</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_121">
<id>145</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_122">
<id>146</id>
<edge_type>1</edge_type>
<source_obj>136</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_123">
<id>147</id>
<edge_type>1</edge_type>
<source_obj>138</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_124">
<id>150</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_125">
<id>151</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_126">
<id>152</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_127">
<id>153</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_128">
<id>154</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_129">
<id>155</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_130">
<id>156</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_131">
<id>157</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_132">
<id>158</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_133">
<id>161</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_134">
<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="_135">
<id>163</id>
<edge_type>2</edge_type>
<source_obj>55</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_136">
<id>266</id>
<edge_type>2</edge_type>
<source_obj>10</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_137">
<id>267</id>
<edge_type>2</edge_type>
<source_obj>16</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_138">
<id>268</id>
<edge_type>2</edge_type>
<source_obj>16</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_139">
<id>269</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_140">
<id>270</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_141">
<id>271</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_142">
<id>272</id>
<edge_type>2</edge_type>
<source_obj>34</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_143">
<id>273</id>
<edge_type>2</edge_type>
<source_obj>34</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_144">
<id>274</id>
<edge_type>2</edge_type>
<source_obj>49</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_145">
<id>275</id>
<edge_type>2</edge_type>
<source_obj>55</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_146">
<id>276</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_147">
<id>277</id>
<edge_type>4</edge_type>
<source_obj>50</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_148">
<id>278</id>
<edge_type>4</edge_type>
<source_obj>35</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_149">
<id>279</id>
<edge_type>4</edge_type>
<source_obj>36</source_obj>
<sink_obj>52</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="_150">
<mId>1</mId>
<mTag>call_Loop_LB2D_shift</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>2072995</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_151">
<mId>2</mId>
<mTag>Entry</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_152">
<mId>3</mId>
<mTag>LB2D_shift</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>2072994</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_153">
<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>16</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="_154">
<mId>5</mId>
<mTag>LB1D_shiftreg</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>26</item>
<item>34</item>
<item>49</item>
<item>55</item>
</basic_blocks>
<mII>1</mII>
<mDepth>2</mDepth>
<mMinTripCount>1920</mMinTripCount>
<mMaxTripCount>1920</mMaxTripCount>
<mMinLatency>1920</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_155">
<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>58</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="_156">
<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>60</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>36</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>3</first>
<second class_id="28" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>4</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>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>24</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>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>32</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>35</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>3</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>3</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>59</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>10</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>16</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>26</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>2</first>
<second>3</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>60</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="_157">
<region_name>LB1D_shiftreg</region_name>
<basic_blocks>
<count>4</count>
<item_version>0</item_version>
<item>26</item>
<item>34</item>
<item>49</item>
<item>55</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>2</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="34" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="35" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="36" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core class_id="38" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 27.869023 | 135 | 0.590899 |
2e388d25ef64fb3af246e2acd884467ea13fb6d4 | 345 | ads | Ada | source/tasking/machine-pc-linux-gnu/s-multip.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/tasking/machine-pc-linux-gnu/s-multip.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/tasking/machine-pc-linux-gnu/s-multip.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | pragma License (Unrestricted);
-- Ada 2012, specialized for Linux
package System.Multiprocessors is
pragma Preelaborate;
type CPU_Range is range 0 .. Integer'Last;
Not_A_Specific_CPU : constant CPU_Range := 0;
subtype CPU is CPU_Range range 1 .. CPU_Range'Last;
function Number_Of_CPUs return CPU;
end System.Multiprocessors;
| 26.538462 | 54 | 0.75942 |
2ea8256eb470108b69da9c14d24179b3b76441e2 | 2,100 | ads | Ada | ADL/src/full/adl_config.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ADL/src/full/adl_config.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ADL/src/full/adl_config.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | -- This package was generated by the Ada_Drivers_Library project wizard script
package ADL_Config is
Board : constant String := "NUCLEO_F334R8"; -- From user input
Architecture : constant String := "ARM"; -- From board definition
Vendor : constant String := "STMicro"; -- From board definition
Device_Family : constant String := "STM32F3"; -- From board definition
Device_Name : constant String := "STM32F334x"; -- From board definition
CPU_Core : constant String := "ARM Cortex-M4F"; -- From mcu definition
High_Speed_External_Clock : constant := 8_000_000; -- From board definition
Number_Of_Interrupts : constant := 125; -- From MCU definition
Has_ZFP_Runtime : constant String := "False"; -- From board definition
Has_Ravenscar_SFP_Runtime : constant String := "True"; -- From board definition
Has_Ravenscar_Full_Runtime : constant String := "True"; -- From board definition
Runtime_Profile : constant String := "full"; -- From user input
Runtime_Name_Suffix : constant String := "stm32f3x4"; -- From board definition
Runtime_Name : constant String := "full-stm32f3x4"; -- From user input
Use_Startup_Gen : constant Boolean := False; -- From user input
Has_Custom_Memory_Area_1 : constant Boolean := False; -- From user input
Boot_Memory : constant String := "flash"; -- From user input
Max_Path_Length : constant := 1024; -- From user input
Max_Mount_Points : constant := 2; -- From user input
Max_Mount_Name_Length : constant := 128; -- From user input
end ADL_Config;
| 87.5 | 101 | 0.529524 |
a19f6167e291e5d124f5d2a72dd54a7729abea19 | 1,268 | adb | Ada | src/smk-main-put_error.adb | LionelDraghi/smk | 2ba79048e1d2579bbbdd1004a78c5cff1796261e | [
"Apache-2.0"
] | 10 | 2018-11-27T22:07:50.000Z | 2020-04-12T21:00:03.000Z | src/smk-main-put_error.adb | LionelDraghi/smk | 2ba79048e1d2579bbbdd1004a78c5cff1796261e | [
"Apache-2.0"
] | 18 | 2018-11-27T22:11:06.000Z | 2019-01-25T20:52:49.000Z | src/smk-main-put_error.adb | LionelDraghi/smk | 2ba79048e1d2579bbbdd1004a78c5cff1796261e | [
"Apache-2.0"
] | 1 | 2018-12-05T23:05:05.000Z | 2018-12-05T23:05:05.000Z | -- -----------------------------------------------------------------------------
-- smk, the smart make (http://lionel.draghi.free.fr/smk/)
-- © 2018, 2019 Lionel Draghi <[email protected]>
-- SPDX-License-Identifier: APSL-2.0
-- -----------------------------------------------------------------------------
-- 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; use Ada.Text_IO;
separate (Smk.Main)
-- -----------------------------------------------------------------------------
procedure Put_Error (Msg : in String := "";
With_Help : in Boolean := False) is
begin
IO.Put_Error (Msg);
if With_Help then Put_Help; end if;
end Put_Error;
| 45.285714 | 80 | 0.533123 |
ad634e59ccb4ca94623d0832290de17a7e68d485 | 1,008 | adb | Ada | gnu/src/gdb/gdb/testsuite/gdb.ada/iwide/p.adb | ghsecuritylab/ellcc-mirror | b03a4afac74d50cf0987554b8c0cd8209bcb92a2 | [
"BSD-2-Clause"
] | null | null | null | gnu/src/gdb/gdb/testsuite/gdb.ada/iwide/p.adb | ghsecuritylab/ellcc-mirror | b03a4afac74d50cf0987554b8c0cd8209bcb92a2 | [
"BSD-2-Clause"
] | null | null | null | gnu/src/gdb/gdb/testsuite/gdb.ada/iwide/p.adb | ghsecuritylab/ellcc-mirror | b03a4afac74d50cf0987554b8c0cd8209bcb92a2 | [
"BSD-2-Clause"
] | null | null | null | -- Copyright 2012-2015 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
With Classes; use Classes;
procedure P is
SP_Access : Shape_Access := new Circle'(My_Circle);
DP_Access : Drawable_Access := new Circle'(My_Circle);
SP_Array : Shape_Array := (others => S_Access);
DP_Array : Drawable_Array := (others => D_Access);
begin
null; -- BREAK
end P;
| 38.769231 | 73 | 0.723214 |
2e87fa9bac989ab56630421e59f713ff9ee2937e | 11,913 | adb | Ada | tests/ships-test_data-tests.adb | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 80 | 2017-04-08T23:14:07.000Z | 2022-02-10T22:30:51.000Z | tests/ships-test_data-tests.adb | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 89 | 2017-06-24T08:18:26.000Z | 2021-11-12T04:37:36.000Z | tests/ships-test_data-tests.adb | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 9 | 2018-04-14T16:37:25.000Z | 2020-03-21T14:33:49.000Z | -- This package has been generated automatically by GNATtest.
-- You are allowed to add your code to the bodies of test routines.
-- Such changes will be kept during further regeneration of this file.
-- All code placed outside of test routine bodies will be lost. The
-- code intended to set up and tear down the test environment should be
-- placed into Ships.Test_Data.
with AUnit.Assertions; use AUnit.Assertions;
with System.Assertions;
-- begin read only
-- id:2.2/00/
--
-- This section can be used to add with clauses if necessary.
--
-- end read only
-- begin read only
-- end read only
package body Ships.Test_Data.Tests is
-- begin read only
-- id:2.2/01/
--
-- This section can be used to add global variables and other elements.
--
-- end read only
-- begin read only
-- end read only
-- begin read only
function Wrap_Test_Create_Ship_14edf1_469250
(Proto_Index, Name: Unbounded_String; X: Map_X_Range; Y: Map_Y_Range;
Speed: Ship_Speed; Random_Upgrades: Boolean := True)
return Ship_Record is
begin
begin
pragma Assert(Proto_Ships_List.Contains(Key => Proto_Index));
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(ships.ads:0):Test_CreateShip test requirement violated");
end;
declare
Test_Create_Ship_14edf1_469250_Result: constant Ship_Record :=
GNATtest_Generated.GNATtest_Standard.Ships.Create_Ship
(Proto_Index, Name, X, Y, Speed, Random_Upgrades);
begin
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(ships.ads:0:):Test_CreateShip test commitment violated");
end;
return Test_Create_Ship_14edf1_469250_Result;
end;
end Wrap_Test_Create_Ship_14edf1_469250;
-- end read only
-- begin read only
procedure Test_Create_Ship_test_createship(Gnattest_T: in out Test);
procedure Test_Create_Ship_14edf1_469250(Gnattest_T: in out Test) renames
Test_Create_Ship_test_createship;
-- id:2.2/14edf110e8654721/Create_Ship/1/0/test_createship/
procedure Test_Create_Ship_test_createship(Gnattest_T: in out Test) is
function Create_Ship
(Proto_Index, Name: Unbounded_String; X: Map_X_Range; Y: Map_Y_Range;
Speed: Ship_Speed; Random_Upgrades: Boolean := True)
return Ship_Record renames
Wrap_Test_Create_Ship_14edf1_469250;
-- end read only
pragma Unreferenced(Gnattest_T);
TestShip: constant Ship_Record :=
Create_Ship
(To_Unbounded_String("2"), Null_Unbounded_String, 5, 5, FULL_SPEED);
begin
Assert
(TestShip.Name = To_Unbounded_String("Tiny pirates ship"),
"Failed to create a new NPC ship.");
-- begin read only
end Test_Create_Ship_test_createship;
-- end read only
-- begin read only
function Wrap_Test_Count_Ship_Weight_dec0b9_0591fd
(Ship: Ship_Record) return Positive is
begin
declare
Test_Count_Ship_Weight_dec0b9_0591fd_Result: constant Positive :=
GNATtest_Generated.GNATtest_Standard.Ships.Count_Ship_Weight(Ship);
begin
return Test_Count_Ship_Weight_dec0b9_0591fd_Result;
end;
end Wrap_Test_Count_Ship_Weight_dec0b9_0591fd;
-- end read only
-- begin read only
procedure Test_Count_Ship_Weight_test_countshipweight
(Gnattest_T: in out Test);
procedure Test_Count_Ship_Weight_dec0b9_0591fd
(Gnattest_T: in out Test) renames
Test_Count_Ship_Weight_test_countshipweight;
-- id:2.2/dec0b99ac9e9a6b9/Count_Ship_Weight/1/0/test_countshipweight/
procedure Test_Count_Ship_Weight_test_countshipweight
(Gnattest_T: in out Test) is
function Count_Ship_Weight(Ship: Ship_Record) return Positive renames
Wrap_Test_Count_Ship_Weight_dec0b9_0591fd;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
if Count_Ship_Weight(Player_Ship) = 1 then
Assert(True, "This test can only crash.");
return;
end if;
Assert(True, "This test can only crash.");
-- begin read only
end Test_Count_Ship_Weight_test_countshipweight;
-- end read only
-- begin read only
function Wrap_Test_Generate_Ship_Name_7b8806_7313c0
(Owner: Unbounded_String) return Unbounded_String is
begin
begin
pragma Assert(Owner /= Null_Unbounded_String);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(ships.ads:0):Test_GenerateShipName test requirement violated");
end;
declare
Test_Generate_Ship_Name_7b8806_7313c0_Result: constant Unbounded_String :=
GNATtest_Generated.GNATtest_Standard.Ships.Generate_Ship_Name
(Owner);
begin
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(ships.ads:0:):Test_GenerateShipName test commitment violated");
end;
return Test_Generate_Ship_Name_7b8806_7313c0_Result;
end;
end Wrap_Test_Generate_Ship_Name_7b8806_7313c0;
-- end read only
-- begin read only
procedure Test_Generate_Ship_Name_test_generateshipname
(Gnattest_T: in out Test);
procedure Test_Generate_Ship_Name_7b8806_7313c0
(Gnattest_T: in out Test) renames
Test_Generate_Ship_Name_test_generateshipname;
-- id:2.2/7b880651d3391b98/Generate_Ship_Name/1/0/test_generateshipname/
procedure Test_Generate_Ship_Name_test_generateshipname
(Gnattest_T: in out Test) is
function Generate_Ship_Name
(Owner: Unbounded_String) return Unbounded_String renames
Wrap_Test_Generate_Ship_Name_7b8806_7313c0;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
Assert
(Generate_Ship_Name(To_Unbounded_String("POLEIS")) /=
Null_Unbounded_String,
"Failed to generate ship name.");
-- begin read only
end Test_Generate_Ship_Name_test_generateshipname;
-- end read only
-- begin read only
function Wrap_Test_Count_Combat_Value_145322_424a30 return Natural is
begin
declare
Test_Count_Combat_Value_145322_424a30_Result: constant Natural :=
GNATtest_Generated.GNATtest_Standard.Ships.Count_Combat_Value;
begin
return Test_Count_Combat_Value_145322_424a30_Result;
end;
end Wrap_Test_Count_Combat_Value_145322_424a30;
-- end read only
-- begin read only
procedure Test_Count_Combat_Value_test_countcombatvalue
(Gnattest_T: in out Test);
procedure Test_Count_Combat_Value_145322_424a30
(Gnattest_T: in out Test) renames
Test_Count_Combat_Value_test_countcombatvalue;
-- id:2.2/145322adc54fa48a/Count_Combat_Value/1/0/test_countcombatvalue/
procedure Test_Count_Combat_Value_test_countcombatvalue
(Gnattest_T: in out Test) is
function Count_Combat_Value return Natural renames
Wrap_Test_Count_Combat_Value_145322_424a30;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
if Count_Combat_Value = 0 then
Assert(True, "This test can only crash");
return;
end if;
Assert(True, "This test can only crash");
-- begin read only
end Test_Count_Combat_Value_test_countcombatvalue;
-- end read only
-- begin read only
function Wrap_Test_Get_Cabin_Quality_3a9d5d_bc7a0e
(Quality: Natural) return String is
begin
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(ships.ads:0):Test_GetCabinQuality test requirement violated");
end;
declare
Test_Get_Cabin_Quality_3a9d5d_bc7a0e_Result: constant String :=
GNATtest_Generated.GNATtest_Standard.Ships.Get_Cabin_Quality
(Quality);
begin
begin
pragma Assert
(Test_Get_Cabin_Quality_3a9d5d_bc7a0e_Result'Length > 0);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(ships.ads:0:):Test_GetCabinQuality test commitment violated");
end;
return Test_Get_Cabin_Quality_3a9d5d_bc7a0e_Result;
end;
end Wrap_Test_Get_Cabin_Quality_3a9d5d_bc7a0e;
-- end read only
-- begin read only
procedure Test_Get_Cabin_Quality_test_getcabinquality
(Gnattest_T: in out Test);
procedure Test_Get_Cabin_Quality_3a9d5d_bc7a0e
(Gnattest_T: in out Test) renames
Test_Get_Cabin_Quality_test_getcabinquality;
-- id:2.2/3a9d5d1acf73079a/Get_Cabin_Quality/1/0/test_getcabinquality/
procedure Test_Get_Cabin_Quality_test_getcabinquality
(Gnattest_T: in out Test) is
function Get_Cabin_Quality(Quality: Natural) return String renames
Wrap_Test_Get_Cabin_Quality_3a9d5d_bc7a0e;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
Assert
(Get_Cabin_Quality(10) = "Empty room",
"Failed to get quality of cabin.");
-- begin read only
end Test_Get_Cabin_Quality_test_getcabinquality;
-- end read only
-- begin read only
procedure Wrap_Test_Damage_Module_222cf0_819b51
(Ship: in out Ship_Record; Module_Index: Modules_Container.Extended_Index;
Damage: Positive; Death_Reason: String) is
begin
begin
pragma Assert
(Module_Index in
Ship.Modules.First_Index .. Ship.Modules.Last_Index and
Death_Reason'Length > 0);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(ships.ads:0):Test_DamageModule test requirement violated");
end;
GNATtest_Generated.GNATtest_Standard.Ships.Damage_Module
(Ship, Module_Index, Damage, Death_Reason);
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(ships.ads:0:):Test_DamageModule test commitment violated");
end;
end Wrap_Test_Damage_Module_222cf0_819b51;
-- end read only
-- begin read only
procedure Test_Damage_Module_test_damagemodule(Gnattest_T: in out Test);
procedure Test_Damage_Module_222cf0_819b51(Gnattest_T: in out Test) renames
Test_Damage_Module_test_damagemodule;
-- id:2.2/222cf0d00b136333/Damage_Module/1/0/test_damagemodule/
procedure Test_Damage_Module_test_damagemodule(Gnattest_T: in out Test) is
procedure Damage_Module
(Ship: in out Ship_Record;
Module_Index: Modules_Container.Extended_Index; Damage: Positive;
Death_Reason: String) renames
Wrap_Test_Damage_Module_222cf0_819b51;
-- end read only
pragma Unreferenced(Gnattest_T);
OldDurability: constant Positive := Player_Ship.Modules(1).Durability;
begin
Damage_Module(Player_Ship, 1, 10, "during tests");
AUnit.Assertions.Assert
(Player_Ship.Modules(1).Durability + 10 = OldDurability,
"Failed to damage player ship hull.");
Player_Ship.Modules(1).Durability := OldDurability;
-- begin read only
end Test_Damage_Module_test_damagemodule;
-- end read only
-- begin read only
-- id:2.2/02/
--
-- This section can be used to add elaboration code for the global state.
--
begin
-- end read only
null;
-- begin read only
-- end read only
end Ships.Test_Data.Tests;
| 33.183844 | 91 | 0.697725 |
1a92657f265530a467da728fd0921480935ab5b3 | 1,133 | adb | Ada | week1/hello.adb | adammw/rtp_labs | 21d8936d301808256f937acb8d0a7056c1065b48 | [
"MIT"
] | null | null | null | week1/hello.adb | adammw/rtp_labs | 21d8936d301808256f937acb8d0a7056c1065b48 | [
"MIT"
] | null | null | null | week1/hello.adb | adammw/rtp_labs | 21d8936d301808256f937acb8d0a7056c1065b48 | [
"MIT"
] | null | null | null | with Ada.Text_IO, Ada.Strings.Unbounded, Ada.Strings.Unbounded.Text_IO, Ada.Characters.Handling;
use Ada.Text_IO, Ada.Strings.Unbounded, Ada.Strings.Unbounded.Text_IO, Ada.Characters.Handling;
procedure Hello is
Name : Unbounded_String;
Input : Character;
function Title_Case (Str : in String) return String is
Result : String(Str'Range);
LastCharacterWasSpace : Boolean := True;
begin
for C in Str'Range loop
if Str(C) = ' ' then
LastCharacterWasSpace := True;
Result(C) := Str(C);
elsif LastCharacterWasSpace then
Result(C) := To_Upper(Str(C));
LastCharacterWasSpace := False;
else
Result(C) := To_Lower(Str(C));
LastCharacterWasSpace := False;
end if;
end loop;
return Result;
end Title_Case;
begin
Put_Line("It's the Hello World example.");
loop
Put_Line("What's your name?");
Get_Line(Name);
Put_Line("Hello " & Title_Case(To_String(Name)) & "!");
Put_Line("It's a me, Mario!");
Put_Line("Again? (Y/N)");
Get(Input); Skip_Line;
exit when Input /= 'y' and Input /= 'Y';
end loop;
end Hello;
| 29.815789 | 96 | 0.646072 |
c7c72aff8c97c05c8ea1128e93ce1c85535e9cc0 | 1,374 | ads | Ada | tools/scitools/conf/understand/ada/ada95/a-sfwtio.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 1 | 2020-01-20T21:26:46.000Z | 2020-01-20T21:26:46.000Z | tools/scitools/conf/understand/ada/ada95/a-sfwtio.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada95/a-sfwtio.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME 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 --
-- --
-- $Revision: 2 $ --
-- --
-- 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.Wide_Text_IO;
package Ada.Short_Float_Wide_Text_IO is
new Ada.Wide_Text_IO.Float_IO (Short_Float);
| 62.454545 | 78 | 0.284571 |
3db0aed292561b2f7a52697159f373d9ce4ea364 | 2,069 | adb | Ada | PFactorial/pfactorial.adb | veyselharun/ABench2020 | 1a6aace6ee05f2a3b30b707f42a47eb66910823e | [
"MIT"
] | null | null | null | PFactorial/pfactorial.adb | veyselharun/ABench2020 | 1a6aace6ee05f2a3b30b707f42a47eb66910823e | [
"MIT"
] | null | null | null | PFactorial/pfactorial.adb | veyselharun/ABench2020 | 1a6aace6ee05f2a3b30b707f42a47eb66910823e | [
"MIT"
] | 1 | 2021-11-22T14:56:29.000Z | 2021-11-22T14:56:29.000Z | --
-- ABench2020 Benchmark Suite
--
-- Parallel Factorial Program
--
-- Licensed under the MIT License. See LICENSE file in the ABench root
-- directory for license information.
--
-- Uncomment the line below to print the result.
-- with Ada.Text_IO; use Ada.Text_IO;
with Ada.Command_Line; use Ada.Command_Line;
procedure PFactorial is
function Calculate_Factorial (Start_Value : Long_Integer; End_Value : Long_Integer) return Long_Integer is
Result : Long_Integer := 1;
begin
for I in Long_Integer range Start_Value .. End_Value loop
Result := Result * I;
end loop;
return Result;
end;
task type Factorial_Task is
entry Start (Start_Value : in Long_Integer; End_Value : in Long_Integer);
entry Report (Result_Value : out Long_Integer);
end Factorial_Task;
task body Factorial_Task is
Local_Start_Value : Long_Integer;
Local_End_Value : Long_Integer;
Local_Result_Value : Long_Integer;
begin
accept Start (Start_Value : in Long_Integer; End_Value : in Long_Integer) do
Local_Start_Value := Start_Value;
Local_End_Value := End_Value;
end Start;
Local_Result_Value := Calculate_Factorial (Local_Start_Value, Local_End_Value);
accept Report (Result_Value : out Long_Integer) do
Result_Value := Local_Result_Value;
end Report;
end;
Task1 : Factorial_Task;
Task2 : Factorial_Task;
External_Value : Long_Integer := Long_Integer'Value (Ada.Command_Line.Argument (1));
Factorial_Value : Long_Integer := 1;
Thread1_Value : Long_Integer := 1;
Thread2_Value : Long_Integer := 1;
begin
Task1.Start (1, External_Value / 2);
Task2.Start (External_Value / 2 + 1 , External_Value);
Task1.Report (Thread1_Value);
Task2.Report (Thread2_Value);
Factorial_Value := Thread1_Value * Thread2_Value;
-- Uncomment the line below to print the result.
-- Put_Line (Long_Integer'Image (Factorial_Value));
end;
| 28.736111 | 110 | 0.677622 |
59628e005143ada44d9078390416acda8ce583a4 | 4,657 | ads | Ada | regtests/gen-integration-tests.ads | My-Colaborations/dynamo | 09704417a23050d5bb52d48a65a14a1c2d926184 | [
"Apache-2.0"
] | null | null | null | regtests/gen-integration-tests.ads | My-Colaborations/dynamo | 09704417a23050d5bb52d48a65a14a1c2d926184 | [
"Apache-2.0"
] | null | null | null | regtests/gen-integration-tests.ads | My-Colaborations/dynamo | 09704417a23050d5bb52d48a65a14a1c2d926184 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- gen-integration-tests -- Tests for integration
-- Copyright (C) 2012, 2013, 2014, 2016, 2017, 2018 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Strings.Unbounded;
with Util.Tests;
package Gen.Integration.Tests is
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite);
type Test is new Util.Tests.Test with null record;
-- Execute the command and get the output in a string.
procedure Execute (T : in out Test;
Command : in String;
Result : out Ada.Strings.Unbounded.Unbounded_String;
Status : in Natural := 0);
-- Test dynamo create-project command.
procedure Test_Create_Project (T : in out Test);
-- Test dynamo create-project command --ado.
procedure Test_Create_ADO_Project (T : in out Test);
-- Test dynamo create-project command --gtk.
procedure Test_Create_GTK_Project (T : in out Test);
-- Test dynamo create-project command --lib.
procedure Test_Create_Lib_Project (T : in out Test);
-- Test project configure.
procedure Test_Configure (T : in out Test);
-- Test propset command.
procedure Test_Change_Property (T : in out Test);
-- Test add-module command.
procedure Test_Add_Module (T : in out Test);
-- Test add-model command.
procedure Test_Add_Model (T : in out Test);
-- Test add-module-operation command.
procedure Test_Add_Module_Operation (T : in out Test);
-- Test add-service command.
procedure Test_Add_Service (T : in out Test);
-- Test add-query command.
procedure Test_Add_Query (T : in out Test);
-- Test add-page command.
procedure Test_Add_Page (T : in out Test);
-- Test add-layout command.
procedure Test_Add_Layout (T : in out Test);
-- Test add-ajax-form command.
procedure Test_Add_Ajax_Form (T : in out Test);
-- Test generate command.
procedure Test_Generate (T : in out Test);
-- Test help command.
procedure Test_Help (T : in out Test);
-- Test dist command.
procedure Test_Dist (T : in out Test);
-- Test dist with exclude support command.
procedure Test_Dist_Exclude (T : in out Test);
-- Test dist command.
procedure Test_Info (T : in out Test);
-- Test build-doc command.
procedure Test_Build_Doc (T : in out Test);
-- Test generate command with Hibernate XML mapping files.
procedure Test_Generate_Hibernate (T : in out Test);
-- Test generate command (XMI enum).
procedure Test_Generate_XMI_Enum (T : in out Test);
-- Test generate command (XMI Ada Bean).
procedure Test_Generate_XMI_Bean (T : in out Test);
-- Test generate command (XMI Ada Bean with inheritance).
procedure Test_Generate_XMI_Bean_Table (T : in out Test);
-- Test generate command (XMI Ada Table).
procedure Test_Generate_XMI_Table (T : in out Test);
-- Test generate command (XMI Associations between Tables).
procedure Test_Generate_XMI_Association (T : in out Test);
-- Test generate command using the ArgoUML file directly (runs unzip -cq and parse the output).
procedure Test_Generate_Zargo_Association (T : in out Test);
-- Test UML with several tables that have dependencies between each of them (non circular).
procedure Test_Generate_Zargo_Dependencies (T : in out Test);
-- Test UML with several tables in several packages (non circular).
procedure Test_Generate_Zargo_Packages (T : in out Test);
-- Test UML with serialization code.
procedure Test_Generate_Zargo_Serialization (T : in out Test);
-- Test UML with several errors in the UML model.
procedure Test_Generate_Zargo_Errors (T : in out Test);
-- Test GNAT compilation of the final project.
procedure Test_Build (T : in out Test);
-- Test GNAT compilation of the generated model files.
procedure Test_Build_Model (T : in out Test);
end Gen.Integration.Tests;
| 35.015038 | 99 | 0.677475 |
1a6444838a73d8449b448250c9172e7367470053 | 16,050 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/s-tasuti.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/ada/s-tasuti.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/s-tasuti.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . T A S K I N G . U T I L I T I E S --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2014, Free Software Foundation, Inc. --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- This package provides RTS Internal Declarations
-- These declarations are not part of the GNARLI
pragma Polling (Off);
-- Turn off polling, we do not want ATC polling to take place during tasking
-- operations. It causes infinite loops and other problems.
with System.Tasking.Debug;
with System.Task_Primitives.Operations;
with System.Tasking.Initialization;
with System.Tasking.Queuing;
with System.Parameters;
with System.Traces.Tasking;
package body System.Tasking.Utilities is
package STPO renames System.Task_Primitives.Operations;
use Parameters;
use Tasking.Debug;
use Task_Primitives;
use Task_Primitives.Operations;
use System.Traces;
use System.Traces.Tasking;
--------------------
-- Abort_One_Task --
--------------------
-- Similar to Locked_Abort_To_Level (Self_ID, T, 0), but:
-- (1) caller should be holding no locks except RTS_Lock when Single_Lock
-- (2) may be called for tasks that have not yet been activated
-- (3) always aborts whole task
procedure Abort_One_Task (Self_ID : Task_Id; T : Task_Id) is
begin
if Parameters.Runtime_Traces then
Send_Trace_Info (T_Abort, Self_ID, T);
end if;
Write_Lock (T);
if T.Common.State = Unactivated then
T.Common.Activator := null;
T.Common.State := Terminated;
T.Callable := False;
Cancel_Queued_Entry_Calls (T);
elsif T.Common.State /= Terminated then
Initialization.Locked_Abort_To_Level (Self_ID, T, 0);
end if;
Unlock (T);
end Abort_One_Task;
-----------------
-- Abort_Tasks --
-----------------
-- This must be called to implement the abort statement.
-- Much of the actual work of the abort is done by the abortee,
-- via the Abort_Handler signal handler, and propagation of the
-- Abort_Signal special exception.
procedure Abort_Tasks (Tasks : Task_List) is
Self_Id : constant Task_Id := STPO.Self;
C : Task_Id;
P : Task_Id;
begin
-- If pragma Detect_Blocking is active then Program_Error must be
-- raised if this potentially blocking operation is called from a
-- protected action.
if System.Tasking.Detect_Blocking
and then Self_Id.Common.Protected_Action_Nesting > 0
then
raise Program_Error with "potentially blocking operation";
end if;
Initialization.Defer_Abort_Nestable (Self_Id);
-- ?????
-- Really should not be nested deferral here.
-- Patch for code generation error that defers abort before
-- evaluating parameters of an entry call (at least, timed entry
-- calls), and so may propagate an exception that causes abort
-- to remain undeferred indefinitely. See C97404B. When all
-- such bugs are fixed, this patch can be removed.
Lock_RTS;
for J in Tasks'Range loop
C := Tasks (J);
Abort_One_Task (Self_Id, C);
end loop;
C := All_Tasks_List;
while C /= null loop
if C.Pending_ATC_Level > 0 then
P := C.Common.Parent;
while P /= null loop
if P.Pending_ATC_Level = 0 then
Abort_One_Task (Self_Id, C);
exit;
end if;
P := P.Common.Parent;
end loop;
end if;
C := C.Common.All_Tasks_Link;
end loop;
Unlock_RTS;
Initialization.Undefer_Abort_Nestable (Self_Id);
end Abort_Tasks;
-------------------------------
-- Cancel_Queued_Entry_Calls --
-------------------------------
-- This should only be called by T, unless T is a terminated previously
-- unactivated task.
procedure Cancel_Queued_Entry_Calls (T : Task_Id) is
Next_Entry_Call : Entry_Call_Link;
Entry_Call : Entry_Call_Link;
Self_Id : constant Task_Id := STPO.Self;
Caller : Task_Id;
pragma Unreferenced (Caller);
-- Should this be removed ???
Level : Integer;
pragma Unreferenced (Level);
-- Should this be removed ???
begin
pragma Assert (T = Self or else T.Common.State = Terminated);
for J in 1 .. T.Entry_Num loop
Queuing.Dequeue_Head (T.Entry_Queues (J), Entry_Call);
while Entry_Call /= null loop
-- Leave Entry_Call.Done = False, since this is cancelled
Caller := Entry_Call.Self;
Entry_Call.Exception_To_Raise := Tasking_Error'Identity;
Queuing.Dequeue_Head (T.Entry_Queues (J), Next_Entry_Call);
Level := Entry_Call.Level - 1;
Unlock (T);
Write_Lock (Entry_Call.Self);
Initialization.Wakeup_Entry_Caller
(Self_Id, Entry_Call, Cancelled);
Unlock (Entry_Call.Self);
Write_Lock (T);
Entry_Call.State := Done;
Entry_Call := Next_Entry_Call;
end loop;
end loop;
end Cancel_Queued_Entry_Calls;
------------------------
-- Exit_One_ATC_Level --
------------------------
-- Call only with abort deferred and holding lock of Self_Id.
-- This is a bit of common code for all entry calls.
-- The effect is to exit one level of ATC nesting.
-- If we have reached the desired ATC nesting level, reset the
-- requested level to effective infinity, to allow further calls.
-- In any case, reset Self_Id.Aborting, to allow re-raising of
-- Abort_Signal.
procedure Exit_One_ATC_Level (Self_ID : Task_Id) is
begin
Self_ID.ATC_Nesting_Level := Self_ID.ATC_Nesting_Level - 1;
pragma Debug
(Debug.Trace (Self_ID, "EOAL: exited to ATC level: " &
ATC_Level'Image (Self_ID.ATC_Nesting_Level), 'A'));
pragma Assert (Self_ID.ATC_Nesting_Level >= 1);
if Self_ID.Pending_ATC_Level < ATC_Level_Infinity then
if Self_ID.Pending_ATC_Level = Self_ID.ATC_Nesting_Level then
Self_ID.Pending_ATC_Level := ATC_Level_Infinity;
Self_ID.Aborting := False;
else
-- Force the next Undefer_Abort to re-raise Abort_Signal
pragma Assert
(Self_ID.Pending_ATC_Level < Self_ID.ATC_Nesting_Level);
if Self_ID.Aborting then
Self_ID.ATC_Hack := True;
Self_ID.Pending_Action := True;
end if;
end if;
end if;
end Exit_One_ATC_Level;
----------------------
-- Make_Independent --
----------------------
function Make_Independent return Boolean is
Self_Id : constant Task_Id := STPO.Self;
Environment_Task : constant Task_Id := STPO.Environment_Task;
Parent : constant Task_Id := Self_Id.Common.Parent;
begin
if Self_Id.Known_Tasks_Index /= -1 then
Known_Tasks (Self_Id.Known_Tasks_Index) := null;
end if;
Initialization.Defer_Abort (Self_Id);
if Single_Lock then
Lock_RTS;
end if;
Write_Lock (Environment_Task);
Write_Lock (Self_Id);
-- The run time assumes that the parent of an independent task is the
-- environment task.
pragma Assert (Parent = Environment_Task);
Self_Id.Master_of_Task := Independent_Task_Level;
-- Update Independent_Task_Count that is needed for the GLADE
-- termination rule. See also pending update in
-- System.Tasking.Stages.Check_Independent
Independent_Task_Count := Independent_Task_Count + 1;
-- This should be called before the task reaches its "begin" (see spec),
-- which ensures that the environment task cannot race ahead and be
-- already waiting for children to complete.
Unlock (Self_Id);
pragma Assert (Environment_Task.Common.State /= Master_Completion_Sleep);
Unlock (Environment_Task);
if Single_Lock then
Unlock_RTS;
end if;
Initialization.Undefer_Abort (Self_Id);
-- Return True. Actually the return value is junk, since we expect it
-- always to be ignored (see spec), but we have to return something!
return True;
end Make_Independent;
------------------
-- Make_Passive --
------------------
procedure Make_Passive (Self_ID : Task_Id; Task_Completed : Boolean) is
C : Task_Id := Self_ID;
P : Task_Id := C.Common.Parent;
Master_Completion_Phase : Integer;
begin
if P /= null then
Write_Lock (P);
end if;
Write_Lock (C);
if Task_Completed then
Self_ID.Common.State := Terminated;
if Self_ID.Awake_Count = 0 then
-- We are completing via a terminate alternative.
-- Our parent should wait in Phase 2 of Complete_Master.
Master_Completion_Phase := 2;
pragma Assert (Task_Completed);
pragma Assert (Self_ID.Terminate_Alternative);
pragma Assert (Self_ID.Alive_Count = 1);
else
-- We are NOT on a terminate alternative.
-- Our parent should wait in Phase 1 of Complete_Master.
Master_Completion_Phase := 1;
pragma Assert (Self_ID.Awake_Count >= 1);
end if;
-- We are accepting with a terminate alternative
else
if Self_ID.Open_Accepts = null then
-- Somebody started a rendezvous while we had our lock open.
-- Skip the terminate alternative.
Unlock (C);
if P /= null then
Unlock (P);
end if;
return;
end if;
Self_ID.Terminate_Alternative := True;
Master_Completion_Phase := 0;
pragma Assert (Self_ID.Terminate_Alternative);
pragma Assert (Self_ID.Awake_Count >= 1);
end if;
if Master_Completion_Phase = 2 then
-- Since our Awake_Count is zero but our Alive_Count
-- is nonzero, we have been accepting with a terminate
-- alternative, and we now have been told to terminate
-- by a completed master (in some ancestor task) that
-- is waiting (with zero Awake_Count) in Phase 2 of
-- Complete_Master.
pragma Debug (Debug.Trace (Self_ID, "Make_Passive: Phase 2", 'M'));
pragma Assert (P /= null);
C.Alive_Count := C.Alive_Count - 1;
if C.Alive_Count > 0 then
Unlock (C);
Unlock (P);
return;
end if;
-- C's count just went to zero, indicating that
-- all of C's dependents are terminated.
-- C has a parent, P.
loop
-- C's count just went to zero, indicating that all of C's
-- dependents are terminated. C has a parent, P. Notify P that
-- C and its dependents have all terminated.
P.Alive_Count := P.Alive_Count - 1;
exit when P.Alive_Count > 0;
Unlock (C);
Unlock (P);
C := P;
P := C.Common.Parent;
-- Environment task cannot have terminated yet
pragma Assert (P /= null);
Write_Lock (P);
Write_Lock (C);
end loop;
if P.Common.State = Master_Phase_2_Sleep
and then C.Master_of_Task = P.Master_Within
then
pragma Assert (P.Common.Wait_Count > 0);
P.Common.Wait_Count := P.Common.Wait_Count - 1;
if P.Common.Wait_Count = 0 then
Wakeup (P, Master_Phase_2_Sleep);
end if;
end if;
Unlock (C);
Unlock (P);
return;
end if;
-- We are terminating in Phase 1 or Complete_Master,
-- or are accepting on a terminate alternative.
C.Awake_Count := C.Awake_Count - 1;
if Task_Completed then
C.Alive_Count := C.Alive_Count - 1;
end if;
if C.Awake_Count > 0 or else P = null then
Unlock (C);
if P /= null then
Unlock (P);
end if;
return;
end if;
-- C's count just went to zero, indicating that all of C's
-- dependents are terminated or accepting with terminate alt.
-- C has a parent, P.
loop
-- Notify P that C has gone passive
if P.Awake_Count > 0 then
P.Awake_Count := P.Awake_Count - 1;
end if;
if Task_Completed and then C.Alive_Count = 0 then
P.Alive_Count := P.Alive_Count - 1;
end if;
exit when P.Awake_Count > 0;
Unlock (C);
Unlock (P);
C := P;
P := C.Common.Parent;
if P = null then
return;
end if;
Write_Lock (P);
Write_Lock (C);
end loop;
-- P has non-passive dependents
if P.Common.State = Master_Completion_Sleep
and then C.Master_of_Task = P.Master_Within
then
pragma Debug
(Debug.Trace
(Self_ID, "Make_Passive: Phase 1, parent waiting", 'M'));
-- If parent is in Master_Completion_Sleep, it cannot be on a
-- terminate alternative, hence it cannot have Wait_Count of zero.
pragma Assert (P.Common.Wait_Count > 0);
P.Common.Wait_Count := P.Common.Wait_Count - 1;
if P.Common.Wait_Count = 0 then
Wakeup (P, Master_Completion_Sleep);
end if;
else
pragma Debug
(Debug.Trace (Self_ID, "Make_Passive: Phase 1, parent awake", 'M'));
null;
end if;
Unlock (C);
Unlock (P);
end Make_Passive;
end System.Tasking.Utilities;
| 32.1 | 79 | 0.558131 |
2e53cffee2fbc702f6ed69bded2426051d04491f | 2,820 | adb | Ada | source/database-events.adb | jquorning/iDoNu | 1618b679f7d0895729dded62f22b0826e7da7cb1 | [
"blessing"
] | 1 | 2016-08-09T20:47:23.000Z | 2016-08-09T20:47:23.000Z | source/database-events.adb | jquorning/iDoNu | 1618b679f7d0895729dded62f22b0826e7da7cb1 | [
"blessing"
] | null | null | null | source/database-events.adb | jquorning/iDoNu | 1618b679f7d0895729dded62f22b0826e7da7cb1 | [
"blessing"
] | null | null | null | --
-- The author disclaims copyright to this source code. In place of
-- a legal notice, here is a blessing:
--
-- May you do good and not evil.
-- May you find forgiveness for yourself and forgive others.
-- May you share freely, not taking more than you give.
--
with GNAT.Calendar.Time_IO;
with SQLite;
package body Database.Events is
SQL_Add_Event_S : constant String := "SELECT MAX(Id) + 1 FROM Event";
SQL_Add_Event_I : constant String
:= "INSERT INTO Event (Id, Job, Stamp, Kind) VALUES (?,?,?,?)";
SQL_Is_Done_S : constant String
:= "SELECT Stamp, Kind FROM Event WHERE Job=? ORDER BY Stamp DESC";
SQL_Get_Events_S : constant String
:= "SELECT Stamp, Kind FROM Event WHERE Job=? ORDER BY Stamp ASC";
procedure Add_Event (Job : in Types.Job_Id;
Stamp : in Ada.Calendar.Time;
Kind : in Event_Kind;
Id : out Event_Id)
is
use SQLite, Interfaces;
use GNAT.Calendar.Time_IO;
Command_1 : constant Statement := Database.DB.Prepare (SQL_Add_Event_S);
Command_2 : constant Statement := Database.DB.Prepare (SQL_Add_Event_I);
begin
Command_1.Step;
Id := Event_Id (Integer_64'(Command_1.Column (1)));
Command_2.Bind (1, Integer_64 (Id));
Command_2.Bind (2, Integer_64 (Job));
Command_2.Bind (3, Image (Stamp, ISO_Date & " %H:%M:%S"));
Command_2.Bind (4, Event_Kind'Image (Kind));
Command_2.Step;
end Add_Event;
function Get_Job_Events (Job : in Types.Job_Id)
return Event_Lists.Vector
is
use SQLite, Interfaces;
use Ada.Strings.Unbounded;
Command : constant Statement := Database.DB.Prepare (SQL_Get_Events_S);
Events : Event_Lists.Vector;
begin
Command.Bind (1, Integer_64 (Job));
while Command.Step loop
declare
Stamp : constant String := Command.Column (1);
Kind : constant String := Command.Column (2);
begin
Events.Append ((To_Unbounded_String (Stamp),
To_Unbounded_String (Kind)));
end;
end loop;
return Events;
end Get_Job_Events;
function Is_Done (Job : in Types.Job_Id)
return Boolean
is
use SQLite;
Command : constant Statement := Database.DB.Prepare (SQL_Is_Done_S);
begin
Command.Bind (1, Interfaces.Integer_64 (Job));
if Command.Step then
declare
-- Stamp_Image : constant String := Command.Column (1);
Kind_Image : constant String := Command.Column (2);
begin
return Kind_Image = "DONE";
end;
end if;
return False; -- No events for Job
end Is_Done;
end Database.Events;
| 30.652174 | 78 | 0.604255 |
adce20360b7afbd4b2bb3afb0794ca842cc0f3c8 | 17,820 | adb | Ada | source/amf/uml/amf-internals-uml_activity_partitions.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-internals-uml_activity_partitions.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-internals-uml_activity_partitions.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.Elements;
with AMF.Internals.Element_Collections;
with AMF.Internals.Helpers;
with AMF.Internals.Tables.UML_Attributes;
with AMF.Visitors.UML_Iterators;
with AMF.Visitors.UML_Visitors;
with League.Strings.Internals;
with Matreshka.Internals.Strings;
package body AMF.Internals.UML_Activity_Partitions is
-------------------
-- Enter_Element --
-------------------
overriding procedure Enter_Element
(Self : not null access constant UML_Activity_Partition_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.UML_Visitors.UML_Visitor'Class then
AMF.Visitors.UML_Visitors.UML_Visitor'Class
(Visitor).Enter_Activity_Partition
(AMF.UML.Activity_Partitions.UML_Activity_Partition_Access (Self),
Control);
end if;
end Enter_Element;
-------------------
-- Leave_Element --
-------------------
overriding procedure Leave_Element
(Self : not null access constant UML_Activity_Partition_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.UML_Visitors.UML_Visitor'Class then
AMF.Visitors.UML_Visitors.UML_Visitor'Class
(Visitor).Leave_Activity_Partition
(AMF.UML.Activity_Partitions.UML_Activity_Partition_Access (Self),
Control);
end if;
end Leave_Element;
-------------------
-- Visit_Element --
-------------------
overriding procedure Visit_Element
(Self : not null access constant UML_Activity_Partition_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Iterator in AMF.Visitors.UML_Iterators.UML_Iterator'Class then
AMF.Visitors.UML_Iterators.UML_Iterator'Class
(Iterator).Visit_Activity_Partition
(Visitor,
AMF.UML.Activity_Partitions.UML_Activity_Partition_Access (Self),
Control);
end if;
end Visit_Element;
--------------
-- Get_Edge --
--------------
overriding function Get_Edge
(Self : not null access constant UML_Activity_Partition_Proxy)
return AMF.UML.Activity_Edges.Collections.Set_Of_UML_Activity_Edge is
begin
return
AMF.UML.Activity_Edges.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Edge
(Self.Element)));
end Get_Edge;
----------------------
-- Get_Is_Dimension --
----------------------
overriding function Get_Is_Dimension
(Self : not null access constant UML_Activity_Partition_Proxy)
return Boolean is
begin
return
AMF.Internals.Tables.UML_Attributes.Internal_Get_Is_Dimension
(Self.Element);
end Get_Is_Dimension;
----------------------
-- Set_Is_Dimension --
----------------------
overriding procedure Set_Is_Dimension
(Self : not null access UML_Activity_Partition_Proxy;
To : Boolean) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Is_Dimension
(Self.Element, To);
end Set_Is_Dimension;
---------------------
-- Get_Is_External --
---------------------
overriding function Get_Is_External
(Self : not null access constant UML_Activity_Partition_Proxy)
return Boolean is
begin
return
AMF.Internals.Tables.UML_Attributes.Internal_Get_Is_External
(Self.Element);
end Get_Is_External;
---------------------
-- Set_Is_External --
---------------------
overriding procedure Set_Is_External
(Self : not null access UML_Activity_Partition_Proxy;
To : Boolean) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Is_External
(Self.Element, To);
end Set_Is_External;
--------------
-- Get_Node --
--------------
overriding function Get_Node
(Self : not null access constant UML_Activity_Partition_Proxy)
return AMF.UML.Activity_Nodes.Collections.Set_Of_UML_Activity_Node is
begin
return
AMF.UML.Activity_Nodes.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Node
(Self.Element)));
end Get_Node;
--------------------
-- Get_Represents --
--------------------
overriding function Get_Represents
(Self : not null access constant UML_Activity_Partition_Proxy)
return AMF.UML.Elements.UML_Element_Access is
begin
return
AMF.UML.Elements.UML_Element_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Represents
(Self.Element)));
end Get_Represents;
--------------------
-- Set_Represents --
--------------------
overriding procedure Set_Represents
(Self : not null access UML_Activity_Partition_Proxy;
To : AMF.UML.Elements.UML_Element_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Represents
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Represents;
----------------------
-- Get_Subpartition --
----------------------
overriding function Get_Subpartition
(Self : not null access constant UML_Activity_Partition_Proxy)
return AMF.UML.Activity_Partitions.Collections.Set_Of_UML_Activity_Partition is
begin
return
AMF.UML.Activity_Partitions.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Subpartition
(Self.Element)));
end Get_Subpartition;
-------------------------
-- Get_Super_Partition --
-------------------------
overriding function Get_Super_Partition
(Self : not null access constant UML_Activity_Partition_Proxy)
return AMF.UML.Activity_Partitions.UML_Activity_Partition_Access is
begin
return
AMF.UML.Activity_Partitions.UML_Activity_Partition_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Super_Partition
(Self.Element)));
end Get_Super_Partition;
-------------------------
-- Set_Super_Partition --
-------------------------
overriding procedure Set_Super_Partition
(Self : not null access UML_Activity_Partition_Proxy;
To : AMF.UML.Activity_Partitions.UML_Activity_Partition_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Super_Partition
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Super_Partition;
------------------------
-- Get_Contained_Edge --
------------------------
overriding function Get_Contained_Edge
(Self : not null access constant UML_Activity_Partition_Proxy)
return AMF.UML.Activity_Edges.Collections.Set_Of_UML_Activity_Edge is
begin
return
AMF.UML.Activity_Edges.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Contained_Edge
(Self.Element)));
end Get_Contained_Edge;
------------------------
-- Get_Contained_Node --
------------------------
overriding function Get_Contained_Node
(Self : not null access constant UML_Activity_Partition_Proxy)
return AMF.UML.Activity_Nodes.Collections.Set_Of_UML_Activity_Node is
begin
return
AMF.UML.Activity_Nodes.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Contained_Node
(Self.Element)));
end Get_Contained_Node;
---------------------
-- Get_In_Activity --
---------------------
overriding function Get_In_Activity
(Self : not null access constant UML_Activity_Partition_Proxy)
return AMF.UML.Activities.UML_Activity_Access is
begin
return
AMF.UML.Activities.UML_Activity_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_In_Activity
(Self.Element)));
end Get_In_Activity;
---------------------
-- Set_In_Activity --
---------------------
overriding procedure Set_In_Activity
(Self : not null access UML_Activity_Partition_Proxy;
To : AMF.UML.Activities.UML_Activity_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_In_Activity
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_In_Activity;
------------------
-- Get_Subgroup --
------------------
overriding function Get_Subgroup
(Self : not null access constant UML_Activity_Partition_Proxy)
return AMF.UML.Activity_Groups.Collections.Set_Of_UML_Activity_Group is
begin
return
AMF.UML.Activity_Groups.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Subgroup
(Self.Element)));
end Get_Subgroup;
---------------------
-- Get_Super_Group --
---------------------
overriding function Get_Super_Group
(Self : not null access constant UML_Activity_Partition_Proxy)
return AMF.UML.Activity_Groups.UML_Activity_Group_Access is
begin
return
AMF.UML.Activity_Groups.UML_Activity_Group_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Super_Group
(Self.Element)));
end Get_Super_Group;
---------------------------
-- Get_Client_Dependency --
---------------------------
overriding function Get_Client_Dependency
(Self : not null access constant UML_Activity_Partition_Proxy)
return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency is
begin
return
AMF.UML.Dependencies.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Client_Dependency
(Self.Element)));
end Get_Client_Dependency;
-------------------------
-- Get_Name_Expression --
-------------------------
overriding function Get_Name_Expression
(Self : not null access constant UML_Activity_Partition_Proxy)
return AMF.UML.String_Expressions.UML_String_Expression_Access is
begin
return
AMF.UML.String_Expressions.UML_String_Expression_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Name_Expression
(Self.Element)));
end Get_Name_Expression;
-------------------------
-- Set_Name_Expression --
-------------------------
overriding procedure Set_Name_Expression
(Self : not null access UML_Activity_Partition_Proxy;
To : AMF.UML.String_Expressions.UML_String_Expression_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Name_Expression
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Name_Expression;
-------------------
-- Get_Namespace --
-------------------
overriding function Get_Namespace
(Self : not null access constant UML_Activity_Partition_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access is
begin
return
AMF.UML.Namespaces.UML_Namespace_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Namespace
(Self.Element)));
end Get_Namespace;
------------------------
-- Get_Qualified_Name --
------------------------
overriding function Get_Qualified_Name
(Self : not null access constant UML_Activity_Partition_Proxy)
return AMF.Optional_String is
begin
declare
use type Matreshka.Internals.Strings.Shared_String_Access;
Aux : constant Matreshka.Internals.Strings.Shared_String_Access
:= AMF.Internals.Tables.UML_Attributes.Internal_Get_Qualified_Name (Self.Element);
begin
if Aux = null then
return (Is_Empty => True);
else
return (False, League.Strings.Internals.Create (Aux));
end if;
end;
end Get_Qualified_Name;
-------------------------
-- All_Owning_Packages --
-------------------------
overriding function All_Owning_Packages
(Self : not null access constant UML_Activity_Partition_Proxy)
return AMF.UML.Packages.Collections.Set_Of_UML_Package is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Owning_Packages unimplemented");
raise Program_Error with "Unimplemented procedure UML_Activity_Partition_Proxy.All_Owning_Packages";
return All_Owning_Packages (Self);
end All_Owning_Packages;
-----------------------------
-- Is_Distinguishable_From --
-----------------------------
overriding function Is_Distinguishable_From
(Self : not null access constant UML_Activity_Partition_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access;
Ns : AMF.UML.Namespaces.UML_Namespace_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Distinguishable_From unimplemented");
raise Program_Error with "Unimplemented procedure UML_Activity_Partition_Proxy.Is_Distinguishable_From";
return Is_Distinguishable_From (Self, N, Ns);
end Is_Distinguishable_From;
---------------
-- Namespace --
---------------
overriding function Namespace
(Self : not null access constant UML_Activity_Partition_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Namespace unimplemented");
raise Program_Error with "Unimplemented procedure UML_Activity_Partition_Proxy.Namespace";
return Namespace (Self);
end Namespace;
end AMF.Internals.UML_Activity_Partitions;
| 37.280335 | 110 | 0.604209 |
29bfb6ccc9987da6c296ffe9345de2433af1339f | 2,938 | ads | Ada | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-widllu.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-widllu.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-widllu.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . W I D _ L L U --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2019, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains the routine used for Width attribute for all
-- non-static unsigned integer (modular integer) subtypes. Note we only
-- have one routine, since this seems a fairly marginal function.
with System.Unsigned_Types;
package System.Wid_LLU is
pragma Pure;
function Width_Long_Long_Unsigned
(Lo, Hi : System.Unsigned_Types.Long_Long_Unsigned)
return Natural;
-- Compute Width attribute for non-static type derived from a modular
-- integer type. The arguments Lo, Hi are the bounds of the type.
end System.Wid_LLU;
| 61.208333 | 78 | 0.439074 |
ade3374da8bd4b8e5301ad9204e8a66391fc91dc | 1,061 | adb | Ada | Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/mi_var_array/bar.adb | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/mi_var_array/bar.adb | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/mi_var_array/bar.adb | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | -- Copyright 2015-2017 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with Pck; use Pck;
procedure Bar is
M : Integer := 35;
subtype Int is Integer range 0 .. M;
type Variant_Type (N : Int := 0) is record
F : String(1 .. N) := (others => 'x');
end record;
type Variant_Type_Access is access all Variant_Type;
VTA : Variant_Type_Access;
begin
Do_Nothing (VTA'Address); -- STOP
end Bar;
| 35.366667 | 73 | 0.704995 |
2e4a2a0eba2ee948c12a0555778e53e20c0e008b | 11,489 | ads | Ada | src/asis/asis-implementation.ads | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 15 | 2015-01-18T23:04:19.000Z | 2022-03-01T20:27:08.000Z | src/asis/asis-implementation.ads | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 16 | 2018-06-10T07:09:30.000Z | 2022-03-26T18:28:40.000Z | src/asis/asis-implementation.ads | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 3 | 2015-11-11T18:00:14.000Z | 2022-01-30T23:08:45.000Z | ------------------------------------------------------------------------------
-- --
-- ASIS-for-GNAT INTERFACE COMPONENTS --
-- --
-- A S I S . I M P L E M E N T A T I O N --
-- --
-- S p e c --
-- --
-- Copyright (c) 2006, Free Software Foundation, Inc. --
-- --
-- This specification is adapted from the Ada Semantic Interface --
-- Specification Standard (ISO/IEC 15291) 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. The copyright notice --
-- above, and the license provisions that follow apply solely to the --
-- contents of the part following the private keyword. --
-- --
-- ASIS-for-GNAT is free software; you can redistribute it and/or modify it --
-- under terms of the GNU General Public License as published by the Free --
-- Software Foundation; either version 2, or (at your option) any later --
-- version. ASIS-for-GNAT is distributed in the hope that it will be use- --
-- ful, but WITHOUT ANY WARRANTY; without even the implied warranty of MER- --
-- CHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General --
-- Public License for more details. You should have received a copy of the --
-- GNU General Public License distributed with ASIS-for-GNAT; see file --
-- COPYING. If not, write to the Free Software Foundation, 51 Franklin --
-- Street, Fifth Floor, Boston, MA 02110-1301, USA. --
-- --
-- --
-- --
-- --
-- --
-- --
-- --
-- --
-- ASIS-for-GNAT was originally developed by the ASIS-for-GNAT team at the --
-- Software Engineering Laboratory of the Swiss Federal Institute of --
-- Technology (LGL-EPFL) in Lausanne, Switzerland, in cooperation with the --
-- Scientific Research Computer Center of Moscow State University (SRCC --
-- MSU), Russia, with funding partially provided by grants from the Swiss --
-- National Science Foundation and the Swiss Academy of Engineering --
-- Sciences. ASIS-for-GNAT is now maintained by AdaCore --
-- (http://www.adacore.com). --
-- --
------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- 6 package Asis.Implementation
------------------------------------------------------------------------------
------------------------------------------------------------------------------
with Asis.Errors;
package Asis.Implementation is
------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- Asis.Implementation provides queries to initialize, finalize, and query the
-- error status of the ASIS Implementation.
------------------------------------------------------------------------------
------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- 6.1 function ASIS_Version
------------------------------------------------------------------------------
function ASIS_Version return Wide_String;
------------------------------------------------------------------------------
-- 6.2 function ASIS_Implementor
------------------------------------------------------------------------------
function ASIS_Implementor return Wide_String;
------------------------------------------------------------------------------
-- 6.3 function ASIS_Implementor_Version
------------------------------------------------------------------------------
function ASIS_Implementor_Version return Wide_String;
------------------------------------------------------------------------------
-- 6.4 function ASIS_Implementor_Information
------------------------------------------------------------------------------
function ASIS_Implementor_Information return Wide_String;
------------------------------------------------------------------------------
-- Returns values which identify:
--
-- ASIS_Version - the version of the ASIS interface,
-- e.g., "2.1"
-- ASIS_Implementor - the name of the implementor,
-- e.g., "Ada Inc."
-- ASIS_Implementor_Version - the implementation's version,
-- e.g., "5.2a"
-- ASIS_Implementor_Information - implementation information,
-- e.g., "Copyright ..."
--
------------------------------------------------------------------------------
-- 6.5 function Is_Initialized
------------------------------------------------------------------------------
function Is_Initialized return Boolean;
------------------------------------------------------------------------------
-- Returns True if ASIS is currently initialized.
--
------------------------------------------------------------------------------
-- 6.6 procedure Initialize
------------------------------------------------------------------------------
procedure Initialize (Parameters : Wide_String := "");
------------------------------------------------------------------------------
-- Parameters - Specifies implementation specific parameters.
--
-- Performs any necessary initialization activities. This shall be invoked
-- at least once before any other ASIS services are used. Parameter values
-- are implementation dependent. The call is ignored if ASIS is already
-- initialized. All ASIS queries and services are ready for use once this
-- call completes.
--
-- Raises ASIS_Failed if ASIS failed to initialize or if the Parameters
-- argument is invalid. Status is Environment_Error or Parameter_Error.
--
-- --|AN Application Note:
-- --|AN
-- --|AN The ASIS implementation may be Initialized and Finalized any number
-- --|AN of times during the operation of an ASIS program. However, all
-- --|AN existing Context, Compilation_Unit and Element values become invalid
-- --|AN when ASIS Is_Finalized. Subsequent calls to ASIS queries or services
-- --|AN using such invalid Compilation_Unit or Element values will cause
-- --|AN ASIS_Inappropriate_Context to be raised.
--
------------------------------------------------------------------------------
-- 6.7 function Is_Finalized
------------------------------------------------------------------------------
function Is_Finalized return Boolean;
------------------------------------------------------------------------------
-- Returns True if ASIS is currently finalized or if ASIS has never been
-- initialized.
--
------------------------------------------------------------------------------
-- 6.8 procedure Finalize
------------------------------------------------------------------------------
procedure Finalize (Parameters : Wide_String := "");
------------------------------------------------------------------------------
-- Parameters - Specifies any implementation required parameter values.
--
-- Performs any necessary ASIS termination activities. This should be invoked
-- once following the last use of other ASIS queries. Parameter values are
-- implementation dependent. The call is ignored if ASIS is already finalized.
-- Subsequent calls to ASIS Environment, Compilation_Unit, and Element
-- queries, are erroneous while the environment Is_Finalized.
--
-- Raises ASIS_Failed if the ASIS implementation failed to finalize. Status
-- is likely to be Internal_Error and will not be Not_An_Error.
--
-------------------------------------------------------------------------------
-- Whenever an error condition is detected, and any ASIS exception is raised,
-- an Asis.Errors.Error_Kinds value and a Diagnosis string is stored. These
-- values can be retrieved by the Status and Diagnosis functions. The
-- Diagnosis function will retrieve the diagnostic message describing the
-- error.
--
-- Error information always refers to the most recently recorded error.
--
-- Note that Diagnosis values are implementation dependent and may vary
-- greatly among ASIS implementations.
--
------------------------------------------------------------------------------
-- 6.9 function Status
------------------------------------------------------------------------------
function Status return Asis.Errors.Error_Kinds;
------------------------------------------------------------------------------
-- Returns the Error_Kinds value for the most recent error.
--
------------------------------------------------------------------------------
-- 6.10 function Diagnosis
------------------------------------------------------------------------------
function Diagnosis return Wide_String;
------------------------------------------------------------------------------
-- Returns a string value describing the most recent error.
--
-- Will typically return a null string if Status = Not_An_Error.
--
------------------------------------------------------------------------------
-- 6.11 procedure Set_Status
------------------------------------------------------------------------------
procedure Set_Status
(Status : Asis.Errors.Error_Kinds := Asis.Errors.Not_An_Error;
Diagnosis : Wide_String := "");
------------------------------------------------------------------------------
-- Status - Specifies the new status to be recorded
-- Diagnosis - Specifies the new diagnosis to be recorded
--
-- Sets (clears, if the defaults are used) the Status and Diagnosis
-- information. Future calls to Status will return this Status (Not_An_Error)
-- and this Diagnosis (a null string).
--
-- Raises ASIS_Failed, with a Status of Internal_Error and a Diagnosis of
-- a null string, if the Status parameter is Not_An_Error and the Diagnosis
-- parameter is not a null string.
--
------------------------------------------------------------------------------
--
end Asis.Implementation;
| 53.189815 | 79 | 0.421534 |
ad124fc88eba4939439dc90c3933110d9d8ef8d3 | 126,514 | adb | Ada | Vivado_HLS_Tutorial/Introduction/lab3/fir_prj/solution2/.autopilot/db/fir.adb | williambong/Vivado | 68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb | [
"MIT"
] | null | null | null | Vivado_HLS_Tutorial/Introduction/lab3/fir_prj/solution2/.autopilot/db/fir.adb | williambong/Vivado | 68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb | [
"MIT"
] | null | null | null | Vivado_HLS_Tutorial/Introduction/lab3/fir_prj/solution2/.autopilot/db/fir.adb | williambong/Vivado | 68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb | [
"MIT"
] | null | null | null | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="11">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName/>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>fir</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>y</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>y</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>c</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>c</originalName>
<rtlName/>
<coreName>RAM_1P_BRAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>11</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>x</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>x</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<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>30</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>x_read</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>x</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>52</item>
<item>53</item>
</oprand_edges>
<opcode>read</opcode>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name/>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>66</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second class_id="12" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="13" tracking_level="0" version="0">
<first class_id="14" tracking_level="0" version="0">
<first>fir.c</first>
<second>fir</second>
</first>
<second>66</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>acc</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>acc</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>56</item>
<item>57</item>
<item>58</item>
<item>59</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>i</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>61</item>
<item>62</item>
<item>63</item>
<item>64</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>i_cast</name>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>66</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>66</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>i_cast_fu_138_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>tmp</name>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>66</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>66</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_fu_142_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>67</item>
<item>68</item>
<item>70</item>
</oprand_edges>
<opcode>bitselect</opcode>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name/>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>66</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>66</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>71</item>
<item>72</item>
<item>73</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>tmp_1</name>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>67</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>67</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_1_fu_150_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>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name/>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>67</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>67</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>77</item>
<item>78</item>
<item>79</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>tmp_7</name>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>66</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>66</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_7_fu_156_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>tmp_2</name>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_2_fu_160_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>87</item>
<item>88</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>tmp_3</name>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_3_fu_166_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>shift_reg_addr</name>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>90</item>
<item>92</item>
<item>93</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>data</name>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>data</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>tmp_4</name>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_4_fu_171_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>shift_reg_addr_1</name>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</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>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name/>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>99</item>
<item>100</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>101</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name/>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>68</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>68</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>80</item>
<item>83</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name/>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>70</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>70</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>data1</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>data</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>102</item>
<item>103</item>
<item>104</item>
<item>105</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>tmp_5</name>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_5_fu_175_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>c_addr</name>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>107</item>
<item>108</item>
<item>109</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>c_load</name>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>tmp_6</name>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>fir_mul_32s_32s_32_3_U0</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>111</item>
<item>112</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>acc_1</name>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>acc</originalName>
<rtlName>acc_1_fu_190_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>113</item>
<item>114</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>i_1</name>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>66</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>66</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName>i_1_fu_179_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>115</item>
<item>117</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name/>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>66</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>66</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>118</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name/>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>120</item>
<item>121</item>
<item>122</item>
</oprand_edges>
<opcode>write</opcode>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name/>
<fileName>fir.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>77</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_34">
<Value>
<Obj>
<type>2</type>
<id>55</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_35">
<Value>
<Obj>
<type>2</type>
<id>60</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>10</content>
</item>
<item class_id_reference="16" object_id="_36">
<Value>
<Obj>
<type>2</type>
<id>69</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="_37">
<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>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_38">
<Value>
<Obj>
<type>2</type>
<id>81</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>3</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_39">
<Value>
<Obj>
<type>2</type>
<id>86</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>15</content>
</item>
<item class_id_reference="16" object_id="_40">
<Value>
<Obj>
<type>2</type>
<id>91</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_41">
<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>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>31</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_42">
<Obj>
<type>3</type>
<id>14</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>9</item>
<item>13</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_43">
<Obj>
<type>3</type>
<id>21</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>5</count>
<item_version>0</item_version>
<item>15</item>
<item>16</item>
<item>17</item>
<item>18</item>
<item>20</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_44">
<Obj>
<type>3</type>
<id>25</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>23</item>
<item>24</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_45">
<Obj>
<type>3</type>
<id>35</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>9</count>
<item_version>0</item_version>
<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>
</node_objs>
</item>
<item class_id_reference="18" object_id="_46">
<Obj>
<type>3</type>
<id>38</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>36</item>
<item>37</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_47">
<Obj>
<type>3</type>
<id>47</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>8</count>
<item_version>0</item_version>
<item>39</item>
<item>40</item>
<item>41</item>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
<item>46</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_48">
<Obj>
<type>3</type>
<id>50</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>48</item>
<item>49</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>66</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_49">
<id>53</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_50">
<id>54</id>
<edge_type>2</edge_type>
<source_obj>21</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_51">
<id>56</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_52">
<id>57</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_53">
<id>58</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_54">
<id>59</id>
<edge_type>2</edge_type>
<source_obj>47</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_55">
<id>61</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_56">
<id>62</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_57">
<id>63</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_58">
<id>64</id>
<edge_type>2</edge_type>
<source_obj>47</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_59">
<id>65</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_60">
<id>68</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_61">
<id>70</id>
<edge_type>1</edge_type>
<source_obj>69</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_62">
<id>71</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_63">
<id>72</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_64">
<id>73</id>
<edge_type>2</edge_type>
<source_obj>50</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_65">
<id>74</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_66">
<id>76</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_67">
<id>77</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_68">
<id>78</id>
<edge_type>2</edge_type>
<source_obj>35</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_69">
<id>79</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_70">
<id>80</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_71">
<id>82</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>81</sink_obj>
</item>
<item class_id_reference="20" object_id="_72">
<id>83</id>
<edge_type>1</edge_type>
<source_obj>81</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_73">
<id>84</id>
<edge_type>2</edge_type>
<source_obj>47</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_74">
<id>85</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_75">
<id>87</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_76">
<id>88</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_77">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_78">
<id>90</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_79">
<id>92</id>
<edge_type>1</edge_type>
<source_obj>91</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_80">
<id>93</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_81">
<id>94</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_82">
<id>95</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_83">
<id>96</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_84">
<id>97</id>
<edge_type>1</edge_type>
<source_obj>91</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_85">
<id>98</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_86">
<id>99</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_87">
<id>100</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_88">
<id>101</id>
<edge_type>2</edge_type>
<source_obj>47</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_89">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_90">
<id>103</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_91">
<id>104</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_92">
<id>105</id>
<edge_type>2</edge_type>
<source_obj>35</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_93">
<id>106</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_94">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_95">
<id>108</id>
<edge_type>1</edge_type>
<source_obj>91</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_96">
<id>109</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_97">
<id>110</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_98">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_99">
<id>112</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_100">
<id>113</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_101">
<id>114</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_102">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_103">
<id>117</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_104">
<id>118</id>
<edge_type>2</edge_type>
<source_obj>21</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_105">
<id>121</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_106">
<id>122</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_107">
<id>179</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_108">
<id>180</id>
<edge_type>2</edge_type>
<source_obj>21</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_109">
<id>181</id>
<edge_type>2</edge_type>
<source_obj>21</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_110">
<id>182</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_111">
<id>183</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_112">
<id>184</id>
<edge_type>2</edge_type>
<source_obj>35</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_113">
<id>185</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_114">
<id>186</id>
<edge_type>2</edge_type>
<source_obj>47</source_obj>
<sink_obj>21</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="_115">
<mId>1</mId>
<mTag>fir</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>78</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_116">
<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>14</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="_117">
<mId>3</mId>
<mTag>Shift_Accum_Loop</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>5</count>
<item_version>0</item_version>
<item>21</item>
<item>25</item>
<item>35</item>
<item>38</item>
<item>47</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>11</mMinTripCount>
<mMaxTripCount>11</mMaxTripCount>
<mMinLatency>77</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_118">
<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>50</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="_119">
<states class_id="25" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_120">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_121">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_122">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_123">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_124">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_125">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_126">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_127">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_128">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_129">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_130">
<id>2</id>
<operations>
<count>18</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_131">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_132">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_133">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_134">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_135">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_136">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_137">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_138">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_139">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_140">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_141">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_142">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_143">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_144">
<id>30</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_145">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_146">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_147">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_148">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_149">
<id>3</id>
<operations>
<count>9</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_150">
<id>30</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_151">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_152">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_153">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_154">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_155">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_156">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_157">
<id>42</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_158">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_159">
<id>4</id>
<operations>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_160">
<id>39</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_161">
<id>42</id>
<stage>1</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_162">
<id>5</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_163">
<id>43</id>
<stage>3</stage>
<latency>3</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_164">
<id>6</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_165">
<id>43</id>
<stage>2</stage>
<latency>3</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_166">
<id>7</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_167">
<id>43</id>
<stage>1</stage>
<latency>3</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_168">
<id>8</id>
<operations>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_169">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_170">
<id>46</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_171">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>26</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="_172">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>27</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item class_id="34" tracking_level="0" version="0">
<first class_id="35" tracking_level="0" version="0">
<first>18</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_173">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>29</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="_174">
<inState>4</inState>
<outState>5</outState>
<condition>
<id>32</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_175">
<inState>5</inState>
<outState>6</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="_176">
<inState>6</inState>
<outState>7</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="_177">
<inState>7</inState>
<outState>8</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="_178">
<inState>8</inState>
<outState>2</outState>
<condition>
<id>37</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="36" tracking_level="1" version="0" object_id="_179">
<dp_component_resource class_id="37" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>fir_mul_32s_32s_32_3_U0 (fir_mul_32s_32s_32_3)</first>
<second class_id="39" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="0" version="0">
<first>DSP48E</first>
<second>4</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>0</second>
</item>
</second>
</item>
</dp_component_resource>
<dp_expression_resource>
<count>5</count>
<item_version>0</item_version>
<item>
<first>acc_1_fu_190_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>32</second>
</item>
<item>
<first>(1P1)</first>
<second>32</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>ap_sig_bdd_64 ( or ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>i_1_fu_179_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>5</second>
</item>
<item>
<first>(1P1)</first>
<second>2</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>5</second>
</item>
</second>
</item>
<item>
<first>tmp_1_fu_150_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>5</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_2_fu_160_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>2</second>
</item>
<item>
<first>(1P1)</first>
<second>4</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</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>1</count>
<item_version>0</item_version>
<item>
<first>shift_reg_U</first>
<second>
<count>7</count>
<item_version>0</item_version>
<item>
<first>(0Words)</first>
<second>11</second>
</item>
<item>
<first>(1Bits)</first>
<second>32</second>
</item>
<item>
<first>(2Banks)</first>
<second>1</second>
</item>
<item>
<first>(3W*Bits*Banks)</first>
<second>352</second>
</item>
<item>
<first>BRAM</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>64</second>
</item>
<item>
<first>LUT</first>
<second>6</second>
</item>
</second>
</item>
</dp_memory_resource>
<dp_multiplexer_resource>
<count>9</count>
<item_version>0</item_version>
<item>
<first>acc_reg_103</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>32</second>
</item>
<item>
<first>(2Count)</first>
<second>64</second>
</item>
<item>
<first>LUT</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>ap_NS_fsm</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>9</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>9</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>data1_reg_128</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>32</second>
</item>
<item>
<first>(2Count)</first>
<second>64</second>
</item>
<item>
<first>LUT</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>i_reg_116</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>5</second>
</item>
<item>
<first>(2Count)</first>
<second>10</second>
</item>
<item>
<first>LUT</first>
<second>5</second>
</item>
</second>
</item>
<item>
<first>shift_reg_address0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>4</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>16</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>shift_reg_d0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>32</second>
</item>
<item>
<first>(2Count)</first>
<second>96</second>
</item>
<item>
<first>LUT</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>x_ap_vld_in_sig</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>1</second>
</item>
</second>
</item>
<item>
<first>x_ap_vld_preg</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>1</second>
</item>
</second>
</item>
<item>
<first>x_in_sig</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>32</second>
</item>
<item>
<first>(2Count)</first>
<second>64</second>
</item>
<item>
<first>LUT</first>
<second>32</second>
</item>
</second>
</item>
</dp_multiplexer_resource>
<dp_register_resource>
<count>11</count>
<item_version>0</item_version>
<item>
<first>acc_reg_103</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>32</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>ap_CS_fsm</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>c_load_reg_234</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>32</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>data1_reg_128</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>32</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>i_1_reg_229</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>5</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>5</second>
</item>
</second>
</item>
<item>
<first>i_cast_reg_201</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>32</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>i_reg_116</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>5</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>5</second>
</item>
</second>
</item>
<item>
<first>tmp_1_reg_210</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_6_reg_239</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>32</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>x_ap_vld_preg</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>x_preg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>32</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>32</second>
</item>
</second>
</item>
</dp_register_resource>
<dp_component_map class_id="41" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="42" tracking_level="0" version="0">
<first>fir_mul_32s_32s_32_3_U0 (fir_mul_32s_32s_32_3)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
</dp_component_map>
<dp_expression_map>
<count>4</count>
<item_version>0</item_version>
<item>
<first>acc_1_fu_190_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>i_1_fu_179_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>tmp_1_fu_150_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>tmp_2_fu_160_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
</dp_expression_map>
<dp_fifo_map>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_map>
<dp_memory_map>
<count>1</count>
<item_version>0</item_version>
<item>
<first>shift_reg_U</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
</dp_memory_map>
</res>
<node_label_latency class_id="43" tracking_level="0" version="0">
<count>30</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="0" version="0">
<first>9</first>
<second class_id="45" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>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>20</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>3</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>1</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>4</first>
<second>2</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="46" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="47" tracking_level="0" version="0">
<first>14</first>
<second class_id="48" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>1</first>
<second>2</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>2</first>
<second>7</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="49" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="50" tracking_level="0" version="0">
<count>21</count>
<item_version>0</item_version>
<item class_id="51" tracking_level="0" version="0">
<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>48</item>
</second>
</item>
<item>
<first>69</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>76</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>30</item>
<item>30</item>
<item>36</item>
<item>33</item>
</second>
</item>
<item>
<first>82</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>91</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>98</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>42</item>
<item>42</item>
</second>
</item>
<item>
<first>107</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>120</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>131</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>138</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>142</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>150</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>156</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>160</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>166</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>171</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>175</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>179</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>185</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>43</item>
<item>43</item>
<item>43</item>
</second>
</item>
<item>
<first>190</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="53" tracking_level="0" version="0">
<count>16</count>
<item_version>0</item_version>
<item class_id="54" tracking_level="0" version="0">
<first>acc_1_fu_190</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>acc_phi_fu_107</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>c_addr_gep_fu_91</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>data1_phi_fu_131</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>i_1_fu_179</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>i_cast_fu_138</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>i_phi_fu_120</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>shift_reg_addr_1_gep_fu_82</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>shift_reg_addr_gep_fu_69</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>tmp_1_fu_150</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>tmp_2_fu_160</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>tmp_3_fu_166</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>tmp_4_fu_171</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>tmp_5_fu_175</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>tmp_7_fu_156</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>tmp_fu_142</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>1</count>
<item_version>0</item_version>
<item>
<first>grp_fu_185</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>43</item>
<item>43</item>
<item>43</item>
</second>
</item>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>2</count>
<item_version>0</item_version>
<item>
<first>stg_34_write_fu_62</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>x_read_read_fu_56</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="55" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="56" tracking_level="0" version="0">
<first class_id="57" tracking_level="0" version="0">
<first>c</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>42</item>
<item>42</item>
</second>
</item>
<item>
<first>
<first>shift_reg</first>
<second>0</second>
</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>30</item>
<item>30</item>
<item>36</item>
<item>33</item>
</second>
</item>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>13</count>
<item_version>0</item_version>
<item>
<first>103</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>116</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>128</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>195</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>201</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>210</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>214</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>219</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>224</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>229</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>234</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>239</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>244</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>13</count>
<item_version>0</item_version>
<item>
<first>acc_1_reg_244</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>acc_reg_103</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>c_addr_reg_224</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>c_load_reg_234</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>data1_reg_128</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>data_reg_219</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>i_1_reg_229</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>i_cast_reg_201</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>i_reg_116</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>shift_reg_addr_reg_214</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>tmp_1_reg_210</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>tmp_6_reg_239</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>x_read_reg_195</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>3</count>
<item_version>0</item_version>
<item>
<first>103</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>116</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>128</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>3</count>
<item_version>0</item_version>
<item>
<first>acc_reg_103</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>data1_reg_128</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>i_reg_116</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="58" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="59" tracking_level="0" version="0">
<first>c(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>load</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>42</item>
<item>42</item>
</second>
</item>
</second>
</item>
<item>
<first>x</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
</second>
</item>
<item>
<first>y</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="60" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="61" tracking_level="0" version="0">
<first>2</first>
<second>RAM_1P_BRAM</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 29.873436 | 91 | 0.43562 |
2e55a838bb84966ef837071f5c8765ad11deab27 | 3,568 | ads | Ada | source/oasis/program-elements-procedure_instantiations.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/oasis/program-elements-procedure_instantiations.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/oasis/program-elements-procedure_instantiations.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | 2 | 2019-09-14T23:18:50.000Z | 2019-10-02T10:11:40.000Z | -- Copyright (c) 2019 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Program.Elements.Declarations;
with Program.Lexical_Elements;
with Program.Elements.Defining_Names;
with Program.Elements.Expressions;
with Program.Elements.Parameter_Associations;
with Program.Elements.Aspect_Specifications;
package Program.Elements.Procedure_Instantiations is
pragma Pure (Program.Elements.Procedure_Instantiations);
type Procedure_Instantiation is
limited interface and Program.Elements.Declarations.Declaration;
type Procedure_Instantiation_Access is
access all Procedure_Instantiation'Class with Storage_Size => 0;
not overriding function Name
(Self : Procedure_Instantiation)
return not null Program.Elements.Defining_Names.Defining_Name_Access
is abstract;
not overriding function Generic_Procedure_Name
(Self : Procedure_Instantiation)
return not null Program.Elements.Expressions.Expression_Access
is abstract;
not overriding function Parameters
(Self : Procedure_Instantiation)
return Program.Elements.Parameter_Associations
.Parameter_Association_Vector_Access is abstract;
not overriding function Aspects
(Self : Procedure_Instantiation)
return Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access is abstract;
not overriding function Has_Not
(Self : Procedure_Instantiation)
return Boolean is abstract;
not overriding function Has_Overriding
(Self : Procedure_Instantiation)
return Boolean is abstract;
type Procedure_Instantiation_Text is limited interface;
type Procedure_Instantiation_Text_Access is
access all Procedure_Instantiation_Text'Class with Storage_Size => 0;
not overriding function To_Procedure_Instantiation_Text
(Self : aliased in out Procedure_Instantiation)
return Procedure_Instantiation_Text_Access is abstract;
not overriding function Not_Token
(Self : Procedure_Instantiation_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Overriding_Token
(Self : Procedure_Instantiation_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Procedure_Token
(Self : Procedure_Instantiation_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Is_Token
(Self : Procedure_Instantiation_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function New_Token
(Self : Procedure_Instantiation_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Left_Bracket_Token
(Self : Procedure_Instantiation_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Right_Bracket_Token
(Self : Procedure_Instantiation_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function With_Token
(Self : Procedure_Instantiation_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Semicolon_Token
(Self : Procedure_Instantiation_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
end Program.Elements.Procedure_Instantiations;
| 34.980392 | 74 | 0.778868 |
ad9a48daf62899c1c7c93f26c3565a21d3637650 | 5,096 | ads | Ada | source/amf/dd/amf-dg-linear_gradients-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/dd/amf-dg-linear_gradients-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/dd/amf-dg-linear_gradients-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Generic_Collections;
package AMF.DG.Linear_Gradients.Collections is
pragma Preelaborate;
package DG_Linear_Gradient_Collections is
new AMF.Generic_Collections
(DG_Linear_Gradient,
DG_Linear_Gradient_Access);
type Set_Of_DG_Linear_Gradient is
new DG_Linear_Gradient_Collections.Set with null record;
Empty_Set_Of_DG_Linear_Gradient : constant Set_Of_DG_Linear_Gradient;
type Ordered_Set_Of_DG_Linear_Gradient is
new DG_Linear_Gradient_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_DG_Linear_Gradient : constant Ordered_Set_Of_DG_Linear_Gradient;
type Bag_Of_DG_Linear_Gradient is
new DG_Linear_Gradient_Collections.Bag with null record;
Empty_Bag_Of_DG_Linear_Gradient : constant Bag_Of_DG_Linear_Gradient;
type Sequence_Of_DG_Linear_Gradient is
new DG_Linear_Gradient_Collections.Sequence with null record;
Empty_Sequence_Of_DG_Linear_Gradient : constant Sequence_Of_DG_Linear_Gradient;
private
Empty_Set_Of_DG_Linear_Gradient : constant Set_Of_DG_Linear_Gradient
:= (DG_Linear_Gradient_Collections.Set with null record);
Empty_Ordered_Set_Of_DG_Linear_Gradient : constant Ordered_Set_Of_DG_Linear_Gradient
:= (DG_Linear_Gradient_Collections.Ordered_Set with null record);
Empty_Bag_Of_DG_Linear_Gradient : constant Bag_Of_DG_Linear_Gradient
:= (DG_Linear_Gradient_Collections.Bag with null record);
Empty_Sequence_Of_DG_Linear_Gradient : constant Sequence_Of_DG_Linear_Gradient
:= (DG_Linear_Gradient_Collections.Sequence with null record);
end AMF.DG.Linear_Gradients.Collections;
| 55.391304 | 88 | 0.524529 |
ad89d61dd435f5ae9847e6dcccb59175c5b0cd65 | 3,645 | ads | Ada | tools/scitools/conf/understand/ada/ada95/a-teiopi.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 1 | 2020-01-20T21:26:46.000Z | 2020-01-20T21:26:46.000Z | tools/scitools/conf/understand/ada/ada95/a-teiopi.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada95/a-teiopi.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- A D A . T E X T _ I O . P I C T U R E S --
-- --
-- S p e c --
-- --
-- $Revision: 2 $ --
-- --
-- Copyright (c) 1992,1993,1994 NYU, All Rights Reserved --
-- --
-- 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, 675 Mass Ave, Cambridge, MA 02139, USA. --
-- --
------------------------------------------------------------------------------
package Ada.Text_IO.Pictures is
type Picture is private;
function Valid (Item : in String) return Boolean;
function To_Picture (Item : in String) return Picture;
function To_String (Item : in Picture) return String;
Max_Picture_Length : constant := 30;
Picture_Error : exception;
-- Localization features:
Max_Currency_Length : constant := 10;
subtype Currency_Length_Range is
Integer range 1 .. Max_Currency_Length;
type Locale (Length : Currency_Length_Range := 1) is record
Currency : String (1 .. Length) := "$";
Fill : Character := '*';
Separator : Character := ',';
Radix_Mark : Character := '.';
end record;
generic
type Num is delta <> digits <>;
package Edited_Output is
Default_Locale : Locale;
function Length (Pic : in Picture;
Symbols : in Locale := Default_Locale)
return Natural;
function Image (Item : in Num;
Pic : in Picture;
Symbols : in Locale := Default_Locale)
return String;
procedure Put (File : in File_Type;
Item : in Num;
Pic : in Picture;
Symbols : in Locale := Default_Locale);
procedure Put (Item : in Num;
Pic : in Picture;
Symbols : in Locale := Default_Locale);
procedure Put (To : out String;
Item : in Num;
Pic : in Picture;
Symbols : in Locale := Default_Locale);
end Edited_Output;
private
type Picture is record
Length : Natural;
Data : String (1 .. 30);
end record;
end Ada.Text_IO.Pictures;
| 39.193548 | 78 | 0.433471 |
1af4928a5ecf75aa4dd907330ee4e426609c7550 | 1,608 | ads | Ada | src/tom/library/sl/ada/muvarstrategy.ads | rewriting/tom | 2918e95c78006f08a2a0919ef440413fa5c2342a | [
"BSD-3-Clause"
] | 36 | 2016-02-19T12:09:49.000Z | 2022-02-03T13:13:21.000Z | src/tom/library/sl/ada/muvarstrategy.ads | rewriting/tom | 2918e95c78006f08a2a0919ef440413fa5c2342a | [
"BSD-3-Clause"
] | null | null | null | src/tom/library/sl/ada/muvarstrategy.ads | rewriting/tom | 2918e95c78006f08a2a0919ef440413fa5c2342a | [
"BSD-3-Clause"
] | 6 | 2017-11-30T17:07:10.000Z | 2022-03-12T14:46:21.000Z | with ObjectPack, AbstractStrategyCombinatorPackage, IntrospectorPackage, StrategyPackage;
use ObjectPack, AbstractStrategyCombinatorPackage, IntrospectorPackage, StrategyPackage;
package MuVarStrategy is
type MuVar is new AbstractStrategyCombinator and Object with
record
instance : StrategyPtr := null;
name : access String := null;
end record;
type MuVarPtr is access all MuVar;
----------------------------------------------------------------------------
-- Object implementation
----------------------------------------------------------------------------
function toString(c: MuVar) return String;
----------------------------------------------------------------------------
-- Strategy implementation
----------------------------------------------------------------------------
function visitLight(str:access MuVar; any: ObjectPtr; i: access Introspector'Class) return ObjectPtr;
function visit(str: access MuVar; i: access Introspector'Class) return Integer;
----------------------------------------------------------------------------
function newMuVar(s : access String) return StrategyPtr;
function newMuVar(s : String) return StrategyPtr;
function equals(m : access MuVar; o : ObjectPtr) return Boolean;
function hashCode(m : access MuVar) return Integer;
function getInstance(m: access MuVar) return StrategyPtr;
procedure setInstance(m: access MuVar; s: StrategyPtr);
procedure setName(m: access MuVar; n: access String);
function isExpanded(m: access Muvar) return Boolean;
function getName(m: access Muvar) return access String;
end MuVarStrategy;
| 42.315789 | 103 | 0.595771 |
c74c3ed1043823ea41838b5f43339bfd7454faf1 | 1,771 | ads | Ada | regtests/openapi-tests.ads | mgrojo/swagger-ada | ba592a8c9cd76304bef8f1d48738069b8c73b4a6 | [
"Apache-2.0"
] | null | null | null | regtests/openapi-tests.ads | mgrojo/swagger-ada | ba592a8c9cd76304bef8f1d48738069b8c73b4a6 | [
"Apache-2.0"
] | null | null | null | regtests/openapi-tests.ads | mgrojo/swagger-ada | ba592a8c9cd76304bef8f1d48738069b8c73b4a6 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- openapi-tests -- Unit tests for REST clients
-- Copyright (C) 2018, 2022 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Strings.Unbounded;
with Util.Tests;
with OpenAPI.Credentials.OAuth;
with TestAPI.Clients;
package OpenAPI.Tests is
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite);
type Test is new Util.Tests.Test with record
Server : Ada.Strings.Unbounded.Unbounded_String;
end record;
overriding
procedure Set_Up (T : in out Test);
procedure Configure (T : in out Test;
Client : in out TestAPI.Clients.Client_Type);
procedure Authenticate (T : in out Test;
Cred : in out OpenAPI.Credentials.OAuth.OAuth2_Credential_Type);
-- Test unauthorized operations.
procedure Test_Unauthorized (T : in out Test);
-- Test authorized operations.
procedure Test_Authorized (T : in out Test);
-- Test API that uses text/plain response.
procedure Test_Text_Response (T : in out Test);
end OpenAPI.Tests;
| 36.142857 | 91 | 0.652174 |
41884d85c58950da78e53b89510f0b84e42a4121 | 9,035 | adb | Ada | arch/ARM/STM32/driver_demos/demo_adc_timer_dma/src/demo_adc_timer_dma.adb | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 192 | 2016-06-01T18:32:04.000Z | 2022-03-26T22:52:31.000Z | arch/ARM/STM32/driver_demos/demo_adc_timer_dma/src/demo_adc_timer_dma.adb | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | arch/ARM/STM32/driver_demos/demo_adc_timer_dma/src/demo_adc_timer_dma.adb | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2017, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- This program demonstrates reading the VBat (battery voltage) value from
-- an ADC unit, using a timer to drive the ADC conversions and DMA
-- to transfer the raw counts from the ADC unit to the application variable.
with Last_Chance_Handler; pragma Unreferenced (Last_Chance_Handler);
with STM32.Device; use STM32.Device;
with STM32.Board; use STM32.Board;
with HAL; use HAL;
with STM32.ADC; use STM32.ADC;
with STM32.DMA; use STM32.DMA;
with STM32.GPIO; use STM32.GPIO;
with STM32.Timers; use STM32.Timers;
with STM32.PWM; use STM32.PWM;
with Ada.Real_Time; use Ada.Real_Time;
with LCD_Std_Out;
procedure Demo_ADC_Timer_DMA is
Selected_Timer : Timer renames Timer_1;
Triggering_Signal : PWM_Modulator;
-- the PWM modulator used to generate the square wave that triggers the ADC
-- conversions
Controller : DMA_Controller renames DMA_2;
Stream : constant DMA_Stream_Selector := Stream_0;
Counts : UInt32 with Volatile;
-- The raw counts from the ADC sampling the VBat channel. The value is
-- updated by the DMA controller.
procedure Configure_ADC;
-- Set up ADC1 to read the VBat voltage value. Note that only ADC1 can
-- do this. Conversions are not triggered by software but are instead
-- triggered by Timer1. Each conversion generates an interrupt signalling
-- conversion complete.
procedure Configure_Timer;
-- Set up Timer1 to generare a square wave of arbitrary frequency, in
-- order to trigger the ADC conversions. The timer is configured as a PWM
-- generator since that is the waveform required. The duty cycle determines
-- the number of rising/falling edges, and it is the edge(s) that triggers
-- the ADC, so the frequency and duty cycle are significant.
procedure Configure_DMA;
function Voltage return UInt32;
procedure Print (X, Y : Natural; Value : UInt32; Suffix : String := "")
with Inline;
-- Print the image of Value at the location indicated, with the suffix
-- appended
function Voltage return UInt32 is
Result : UInt32;
begin
Result := ((Counts * VBat_Bridge_Divisor) * ADC_Supply_Voltage) / 16#FFF#;
-- 16#FFF# because we are using 12-bit conversion resolution
return Result;
end Voltage;
-----------
-- Print --
-----------
procedure Print (X, Y : Natural; Value : UInt32; Suffix : String := "") is
Value_Image : constant String := Value'Img;
begin
LCD_Std_Out.Put (X, Y, Value_Image (2 .. Value_Image'Last) & Suffix);
end Print;
-------------------
-- Configure_ADC --
-------------------
procedure Configure_ADC is
All_Regular_Conversions : constant Regular_Channel_Conversions :=
(1 => (Channel => VBat.Channel,
Sample_Time => Sample_3_Cycles)); -- arbitrary
begin
Enable_Clock (VBat.ADC.all);
Configure_Common_Properties
(Mode => Independent,
Prescalar => PCLK2_Div_2,
DMA_Mode => Disabled,
Sampling_Delay => Sampling_Delay_5_Cycles); -- arbitrary
Configure_Unit
(VBat.ADC.all,
Resolution => ADC_Resolution_12_Bits,
Alignment => Right_Aligned);
Configure_Regular_Conversions
(VBat.ADC.all,
Continuous => False, -- False is ESSENTIAL when externally triggered!
Trigger => (Trigger_Rising_Edge, Event => Timer1_CC1_Event),
Enable_EOC => True,
Conversions => All_Regular_Conversions);
-- Either rising or falling edge should work. Note that the Event must
-- match the timer used!
Enable_DMA (VBat.ADC.all);
Enable_DMA_After_Last_Transfer (VBat.ADC.all);
end Configure_ADC;
---------------------
-- Configure_Timer --
---------------------
procedure Configure_Timer is
Timer_AF : constant STM32.GPIO_Alternate_Function := GPIO_AF_TIM1_1;
Output_Channel : constant Timer_Channel := Channel_1; -- must match ADC trigger
Frequency : constant Hertz := 10_000; -- arbitrary
Output_Pin : constant GPIO_Point := PA8; -- timer 1, channel 1
-- note that the output pin is not used since we are reading the
-- internal VBat channel, which is ADC1_IN18
begin
Configure_PWM_Timer (Selected_Timer'Access, Frequency);
Triggering_Signal.Attach_PWM_Channel
(Selected_Timer'Access,
Output_Channel,
Output_Pin,
Timer_AF);
Triggering_Signal.Set_Duty_Cycle (Value => 10);
-- An arbitrary percentage, but determines the number of rising/falling
-- transitions
end Configure_Timer;
-------------------
-- Configure_DMA --
-------------------
procedure Configure_DMA is
Config : DMA_Stream_Configuration;
begin
Enable_Clock (Controller);
Reset (Controller, Stream);
Config.Channel := Channel_0;
Config.Direction := Peripheral_To_Memory;
Config.Memory_Data_Format := HalfWords;
Config.Peripheral_Data_Format := HalfWords;
Config.Increment_Peripheral_Address := False;
Config.Increment_Memory_Address := False;
Config.Operation_Mode := Circular_Mode;
Config.Priority := Priority_Very_High;
Config.FIFO_Enabled := False;
Config.Memory_Burst_Size := Memory_Burst_Single;
Config.Peripheral_Burst_Size := Peripheral_Burst_Single;
Configure (Controller, Stream, Config);
Clear_All_Status (Controller, Stream);
end Configure_DMA;
begin
Initialize_LEDs;
delay until Clock + Milliseconds (1000);
-- Give the LCD time to get ready after the unit's elaboration-based
-- initialization. This is only necessary when the display prints garbage,
-- as if out of synch somehow. After it starts printing junk the full
-- second is apparently required. But once it starts working correctly the
-- delay can be reduced to nothing but don't be foooled by that, it can
-- come back. TODO: fix the LCD driver...
LCD_Std_Out.Clear_Screen;
Configure_ADC;
Configure_Timer;
Configure_DMA;
Start_Transfer
(Controller,
Stream,
Source => Data_Register_Address (VBat.ADC.all),
Destination => Counts'Address,
Data_Count => 1); -- ie, 1 halfword
Enable (VBat.ADC.all);
Triggering_Signal.Enable_Output;
loop
Print (0, 24, Voltage, "mv");
delay until Clock + Milliseconds (100); -- arbitrary
end loop;
end Demo_ADC_Timer_DMA;
| 40.155556 | 86 | 0.613614 |
13a34202389ed72c8d1c008f4de89c9eb0db2abf | 3,859 | adb | Ada | Ada95/src/terminal_interface-curses-text_io-fixed_io.adb | Ancient-Rom/android_external_libncurses | cfb80399910df8d55602d879d5cf0bc5ceaa2f89 | [
"X11"
] | 1,167 | 2017-08-21T21:21:24.000Z | 2022-03-31T15:42:10.000Z | release/src/router/libncurses/Ada95/src/terminal_interface-curses-text_io-fixed_io.adb | mon-routeur/Firmware | b25fef7cdab7fe306853baa471ad4a96a9da4600 | [
"FSFAP"
] | 374 | 2015-11-03T12:37:22.000Z | 2021-12-17T14:18:08.000Z | release/src/router/libncurses/Ada95/src/terminal_interface-curses-text_io-fixed_io.adb | mon-routeur/Firmware | b25fef7cdab7fe306853baa471ad4a96a9da4600 | [
"FSFAP"
] | 96 | 2015-11-22T07:47:26.000Z | 2022-01-20T19:52:19.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding --
-- --
-- Terminal_Interface.Curses.Text_IO.Fixed_IO --
-- --
-- B O D Y --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 1998-2003,2009 Free Software Foundation, Inc. --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, distribute with modifications, sublicense, and/or sell --
-- copies of the Software, and to permit persons to whom the Software is --
-- furnished to do so, subject to the following conditions: --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, --
-- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR --
-- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR --
-- THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
-- --
-- Except as contained in this notice, the name(s) of the above copyright --
-- holders shall not be used in advertising or otherwise to promote the --
-- sale, use or other dealings in this Software without prior written --
-- authorization. --
------------------------------------------------------------------------------
-- Author: Juergen Pfeifer, 1996
-- Version Control:
-- $Revision: 1.11 $
-- Binding Version 01.00
------------------------------------------------------------------------------
with Ada.Text_IO;
with Terminal_Interface.Curses.Text_IO.Aux;
package body Terminal_Interface.Curses.Text_IO.Fixed_IO is
package Aux renames Terminal_Interface.Curses.Text_IO.Aux;
package FIXIO is new Ada.Text_IO.Fixed_IO (Num);
procedure Put
(Win : Window;
Item : Num;
Fore : Field := Default_Fore;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp)
is
Buf : String (1 .. Field'Last);
Len : Field := Fore + 1 + Aft;
begin
if Exp > 0 then
Len := Len + 1 + Exp;
end if;
FIXIO.Put (Buf, Item, Aft, Exp);
Aux.Put_Buf (Win, Buf, Len, False);
end Put;
procedure Put
(Item : Num;
Fore : Field := Default_Fore;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp) is
begin
Put (Get_Window, Item, Fore, Aft, Exp);
end Put;
end Terminal_Interface.Curses.Text_IO.Fixed_IO;
| 50.776316 | 78 | 0.456854 |
2e1d5dab41dbe237c2cf7ac11dc38b972af4d564 | 108 | adb | Ada | firmware/coreboot/3rdparty/libgfxinit/gfxtest/gfx_test_main.adb | fabiojna02/OpenCellular | 45b6a202d6b2e2485c89955b9a6da920c4d56ddb | [
"CC-BY-4.0",
"BSD-3-Clause"
] | 1 | 2019-11-04T07:11:25.000Z | 2019-11-04T07:11:25.000Z | firmware/coreboot/3rdparty/libgfxinit/gfxtest/gfx_test_main.adb | aimin-wang/OpenCellular | 5308146bf7edf43cc81c0e4d15305b711117070a | [
"CC-BY-4.0",
"BSD-3-Clause"
] | 13 | 2018-10-12T21:29:09.000Z | 2018-10-25T20:06:51.000Z | firmware/coreboot/3rdparty/libgfxinit/gfxtest/gfx_test_main.adb | aimin-wang/OpenCellular | 5308146bf7edf43cc81c0e4d15305b711117070a | [
"CC-BY-4.0",
"BSD-3-Clause"
] | null | null | null | with HW.GFX.GMA.GFX_Test;
procedure GFX_Test_Main is
begin
HW.GFX.GMA.GFX_Test.Main;
end GFX_Test_Main;
| 15.428571 | 28 | 0.787037 |
22a1a2158f37c948c9872f4ed8cd782e4d4a872d | 476 | ads | Ada | Sources/Globe_3d/gl/gl-buffer-normals.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | 1 | 2019-09-21T09:40:34.000Z | 2019-09-21T09:40:34.000Z | Sources/Globe_3d/gl/gl-buffer-normals.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | null | null | null | Sources/Globe_3d/gl/gl-buffer-normals.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | 1 | 2019-09-25T12:29:27.000Z | 2019-09-25T12:29:27.000Z |
with GL.Buffer.general; pragma Elaborate_All (GL.Buffer.general);
with GL.Geometry;
package GL.Buffer.normals is new GL.Buffer.general (base_object => GL.Buffer.array_Object,
index => GL.Geometry.positive_vertex_Id,
element => GL.Geometry.GL_Normal,
element_array => GL.Geometry.GL_Normals_Vertex_Id);
| 52.888889 | 103 | 0.508403 |
ad4605f81c0d55187a918618adf16e7f55f21843 | 6,126 | adb | Ada | tools-src/gnu/gcc/gcc/ada/51osinte.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 80 | 2015-01-02T10:14:04.000Z | 2021-06-07T06:29:49.000Z | tools-src/gnu/gcc/gcc/ada/51osinte.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 9 | 2015-05-14T11:03:12.000Z | 2018-01-04T07:12:58.000Z | tools-src/gnu/gcc/gcc/ada/51osinte.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNU ADA RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . O S _ I N T E R F A C E --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1999-2001 Free Software Foundation, Inc. --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNARL is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNARL; see file COPYING. If not, write --
-- to the Free Software Foundation, 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. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This is a UnixWare (Native) version of this package
pragma Polling (Off);
-- Turn off polling, we do not want ATC polling to take place during
-- tasking operations. It causes infinite loops and other problems.
with Interfaces.C;
package body System.OS_Interface is
use Interfaces.C;
-----------------
-- To_Duration --
-----------------
function To_Duration (TS : timespec) return Duration is
begin
return Duration (TS.tv_sec) + Duration (TS.tv_nsec) / 10#1#E9;
end To_Duration;
function To_Duration (TV : struct_timeval) return Duration is
begin
return Duration (TV.tv_sec) + Duration (TV.tv_usec) / 10#1#E6;
end To_Duration;
-----------------
-- To_Timespec --
-----------------
function To_Timespec (D : Duration) return timespec is
S : time_t;
F : Duration;
begin
S := time_t (Long_Long_Integer (D));
F := D - Duration (S);
-- If F has negative value due to a round-up, adjust for positive F
-- value.
if F < 0.0 then
S := S - 1;
F := F + 1.0;
end if;
return timespec' (tv_sec => S,
tv_nsec => long (Long_Long_Integer (F * 10#1#E9)));
end To_Timespec;
----------------
-- To_Timeval --
----------------
function To_Timeval (D : Duration) return struct_timeval is
S : long;
F : Duration;
begin
S := long (Long_Long_Integer (D));
F := D - Duration (S);
-- If F has negative value due to a round-up, adjust for positive F
-- value.
if F < 0.0 then
S := S - 1;
F := F + 1.0;
end if;
return struct_timeval' (tv_sec => S,
tv_usec => long (Long_Long_Integer (F * 10#1#E6)));
end To_Timeval;
-------------------
-- clock_gettime --
-------------------
function clock_gettime
(clock_id : clockid_t;
tp : access timespec) return int
is
Result : int;
tv : aliased struct_timeval;
function gettimeofday
(tv : access struct_timeval;
tz : System.Address := System.Null_Address) return int;
pragma Import (C, gettimeofday, "gettimeofday");
begin
Result := gettimeofday (tv'Unchecked_Access);
tp.all := To_Timespec (To_Duration (tv));
return Result;
end clock_gettime;
---------------------------
-- POSIX.1c Section 3 --
---------------------------
function sigwait (set : access sigset_t; sig : access Signal) return int is
Result : int;
function sigwait (set : access sigset_t) return int;
pragma Import (C, sigwait, "sigwait");
begin
Result := sigwait (set);
if Result < 0 then
sig.all := 0;
return errno;
end if;
sig.all := Signal (Result);
return 0;
end sigwait;
function pthread_kill (thread : pthread_t; sig : Signal) return int is
function pthread_kill_base
(thread : access pthread_t; sig : access Signal) return int;
pragma Import (C, pthread_kill_base, "pthread_kill");
thr : aliased pthread_t := thread;
signo : aliased Signal := sig;
begin
return pthread_kill_base (thr'Unchecked_Access, signo'Unchecked_Access);
end pthread_kill;
function Get_Stack_Base (thread : pthread_t) return Address is
begin
return Null_Address;
end Get_Stack_Base;
procedure pthread_init is
begin
null;
end pthread_init;
end System.OS_Interface;
| 34.610169 | 78 | 0.498694 |
13c218cc2f39936891320f27f1d741daf9c50d48 | 10,848 | ads | Ada | source/web/spikedog/aws/matreshka-servlet_aws_responses.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | null | null | null | source/web/spikedog/aws/matreshka-servlet_aws_responses.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/web/spikedog/aws/matreshka-servlet_aws_responses.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2014-2015, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
private with Ada.Streams;
private with AWS.Resources.Streams.Memory;
with AWS.Response;
private with League.Calendars;
private with League.Holders;
private with League.IRIs;
private with League.Strings;
private with League.String_Vectors;
private with League.Text_Codecs;
with Matreshka.Servlet_HTTP_Responses;
with Matreshka.Servlet_HTTP_Requests;
private with Servlet.HTTP_Cookies;
with Servlet.HTTP_Responses;
with Servlet.Output_Streams;
private with Servlet.Write_Listeners;
package Matreshka.Servlet_AWS_Responses is
type AWS_Servlet_Response is
new Matreshka.Servlet_HTTP_Responses.Abstract_HTTP_Servlet_Response
and Servlet.Output_Streams.Servlet_Output_Stream
with private;
procedure Initialize
(Self : in out AWS_Servlet_Response'Class;
Request :
not null Matreshka.Servlet_HTTP_Requests.HTTP_Servlet_Request_Access);
function Build
(Self : in out AWS_Servlet_Response'Class) return AWS.Response.Data;
-- Build AWS response data.
private
type Stream_Access is
access all AWS.Resources.Streams.Memory.Stream_Type'Class;
type Text_Codec_Access is access all League.Text_Codecs.Text_Codec'Class;
type AWS_Servlet_Response is
new Matreshka.Servlet_HTTP_Responses.Abstract_HTTP_Servlet_Response
and Servlet.Output_Streams.Servlet_Output_Stream with
record
Data : AWS.Response.Data;
Encoding : League.Strings.Universal_String;
Content_Type : League.Strings.Universal_String;
Stream : Stream_Access;
Codec : Text_Codec_Access;
Output : access Servlet.Output_Streams.Servlet_Output_Stream'Class;
end record;
overriding procedure Add_Cookie
(Self : in out AWS_Servlet_Response;
Cookie : Servlet.HTTP_Cookies.Cookie);
-- Adds the specified cookie to the response. This method can be called
-- multiple times to set more than one cookie.
overriding procedure Add_Date_Header
(Self : in out AWS_Servlet_Response;
Name : League.Strings.Universal_String;
Value : League.Calendars.Date_Time);
-- Adds a response header with the given name and date-value. This method
-- allows response headers to have multiple values.
overriding procedure Add_Header
(Self : in out AWS_Servlet_Response;
Name : League.Strings.Universal_String;
Value : League.Strings.Universal_String);
-- Adds a response header with the given name and value. This method allows
-- response headers to have multiple values.
overriding procedure Add_Integer_Header
(Self : in out AWS_Servlet_Response;
Name : League.Strings.Universal_String;
Value : League.Holders.Universal_Integer);
-- Adds a response header with the given name and integer value. This
-- method allows response headers to have multiple values.
overriding function Contains_Header
(Self : in out AWS_Servlet_Response;
Name : League.Strings.Universal_String) return Boolean;
-- Returns a boolean indicating whether the named response header has
-- already been set.
overriding function Get_Header_Names
(Self : in out AWS_Servlet_Response)
return League.String_Vectors.Universal_String_Vector;
-- Return all the header names set for this response.
overriding function Get_Headers
(Self : in out AWS_Servlet_Response;
Name : League.Strings.Universal_String)
return League.String_Vectors.Universal_String_Vector;
-- Return all the header values associated with the specified header name.
overriding procedure Send_Redirect
(Self : in out AWS_Servlet_Response;
Location : League.IRIs.IRI);
-- Sends a temporary redirect response to the client using the specified
-- redirect location URL and clears the buffer.
overriding procedure Set_Character_Encoding
(Self : in out AWS_Servlet_Response;
Encoding : League.Strings.Universal_String);
-- Sets the character encoding (MIME charset) of the response being sent to
-- the client, for example, to UTF-8. If the character encoding has already
-- been set by setContentType(java.lang.String) or
-- setLocale(java.util.Locale), this method overrides it. Calling
-- setContentType(java.lang.String) with the String of text/html and
-- calling this method with the String of UTF-8 is equivalent with calling
-- setContentType with the String of text/html; charset=UTF-8.
overriding procedure Set_Content_Type
(Self : in out AWS_Servlet_Response;
To : League.Strings.Universal_String);
-- Sets the content type of the response being sent to the client, if the
-- response has not been committed yet. The given content type may include
-- a character encoding specification, for example,
-- text/html;charset=UTF-8. The response's character encoding is only set
-- from the given content type if this method is called before getWriter is
-- called.
overriding procedure Set_Date_Header
(Self : in out AWS_Servlet_Response;
Name : League.Strings.Universal_String;
Value : League.Calendars.Date_Time);
-- Sets a response header with the given name and date-value. If the header
-- had already been set, the new value overwrites the previous one. The
-- Contains_Header method can be used to test for the presence of a header
-- before setting its value.
overriding procedure Set_Header
(Self : in out AWS_Servlet_Response;
Name : League.Strings.Universal_String;
Value : League.Strings.Universal_String);
-- Sets a response header with the given name and value. If the header had
-- already been set, the new value overwrites the previous one. The
-- Contains_Header method can be used to test for the presence of a header
-- before setting its value.
overriding procedure Set_Integer_Header
(Self : in out AWS_Servlet_Response;
Name : League.Strings.Universal_String;
Value : League.Holders.Universal_Integer);
-- Sets a response header with the given name and integer value. If the
-- header had already been set, the new value overwrites the previous one.
-- The Contains_Header method can be used to test for the presence of a
-- header before setting its value.
overriding procedure Set_Status
(Self : in out AWS_Servlet_Response;
Status : Servlet.HTTP_Responses.Status_Code);
-- Sets the status code for this response.
overriding function Get_Output_Stream
(Self : AWS_Servlet_Response)
return
not null access Servlet.Output_Streams.Servlet_Output_Stream'Class;
-- Returns a ServletOutputStream suitable for writing binary data in the
-- response. The servlet container does not encode the binary data.
overriding function Is_Ready (Self : AWS_Servlet_Response) return Boolean;
-- This method can be used to determine if data can be written without
-- blocking.
overriding procedure Set_Write_Listener
(Self : in out AWS_Servlet_Response;
Listener : not null access Servlet.Write_Listeners.Write_Listener'Class);
-- Instructs the ServletOutputStream to invoke the provided WriteListener
-- when it is possible to write.
overriding procedure Write
(Self : in out AWS_Servlet_Response;
Item : Ada.Streams.Stream_Element_Array);
overriding procedure Write
(Self : in out AWS_Servlet_Response;
Item : League.Strings.Universal_String);
end Matreshka.Servlet_AWS_Responses;
| 47.788546 | 79 | 0.63385 |
1ab7f81c5824ea7f643474de849567a5017cce9d | 2,201 | adb | Ada | src/sdl-inputs-joysticks-makers.adb | Fabien-Chouteau/sdlada | f08d72e3f5dcec228d68fb5b6681ea831f81ef47 | [
"Zlib"
] | 1 | 2021-10-30T14:41:56.000Z | 2021-10-30T14:41:56.000Z | src/sdl-inputs-joysticks-makers.adb | Fabien-Chouteau/sdlada | f08d72e3f5dcec228d68fb5b6681ea831f81ef47 | [
"Zlib"
] | null | null | null | src/sdl-inputs-joysticks-makers.adb | Fabien-Chouteau/sdlada | f08d72e3f5dcec228d68fb5b6681ea831f81ef47 | [
"Zlib"
] | null | null | null | --------------------------------------------------------------------------------------------------------------------
-- Copyright (c) 2013-2020, Luke A. Guest
--
-- This software is provided 'as-is', without any express or implied
-- warranty. In no event will the authors be held liable for any damages
-- arising from the use of this software.
--
-- Permission is granted to anyone to use this software for any purpose,
-- including commercial applications, and to alter it and redistribute it
-- freely, subject to the following restrictions:
--
-- 1. The origin of this software must not be misrepresented; you must not
-- claim that you wrote the original software. If you use this software
-- in a product, an acknowledgment in the product documentation would be
-- appreciated but is not required.
--
-- 2. Altered source versions must be plainly marked as such, and must not be
-- misrepresented as being the original software.
--
-- 3. This notice may not be removed or altered from any source
-- distribution.
--------------------------------------------------------------------------------------------------------------------
-- SDL.Inputs.Joysticks.Makers
--------------------------------------------------------------------------------------------------------------------
with Interfaces.C;
private with SDL.C_Pointers;
package body SDL.Inputs.Joysticks.Makers is
package C renames Interfaces.C;
use type C.int;
use type SDL.C_Pointers.Joystick_Pointer;
function SDL_Joystick_Open (Device : in C.int) return SDL.C_Pointers.Joystick_Pointer with
Import => True,
Convention => C,
External_Name => "SDL_JoystickOpen";
function Create (Device : in Devices) return Joystick is
begin
return J : Joystick := (Ada.Finalization.Limited_Controlled with
Internal => SDL_Joystick_Open (C.int (Device) - 1), Owns => True) do
null;
end return;
end Create;
procedure Create (Device : in Devices; Actual_Stick : out Joystick) is
begin
Actual_Stick.Internal := SDL_Joystick_Open (C.int (Device) - 1);
end Create;
end SDL.Inputs.Joysticks.Makers;
| 42.326923 | 116 | 0.58746 |
adea0d42c2e954f0d909e960a2d8319d527f63e5 | 27,049 | adb | Ada | .emacs.d/elpa/wisi-3.0.1/sal-gen_unbounded_definite_red_black_trees.adb | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/wisi-3.0.1/sal-gen_unbounded_definite_red_black_trees.adb | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/wisi-3.0.1/sal-gen_unbounded_definite_red_black_trees.adb | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | -- Abstract :
--
-- Generic unbounded red-black tree with definite elements.
--
-- Copyright (C) 2017 - 2019 Free Software Foundation, Inc.
--
-- This library is free software; you can redistribute it and/or modify it
-- under terms of the GNU General Public License as published by the Free
-- Software Foundation; either version 3, or (at your option) any later
-- version. This library is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHAN-
-- TABILITY or FITNESS FOR A PARTICULAR PURPOSE.
-- As a special exception under Section 7 of GPL version 3, you are granted
-- additional permissions described in the GCC Runtime Library Exception,
-- version 3.1, as published by the Free Software Foundation.
pragma License (Modified_GPL);
package body SAL.Gen_Unbounded_Definite_Red_Black_Trees is
-- Local declarations (alphabetical order)
function Count_Tree (Item : in Node_Access; Nil : in Node_Access) return Ada.Containers.Count_Type
with Pre => Nil /= null;
procedure Delete_Fixup (T : in out Tree; X : in out Node_Access);
function Find (Root : in Node_Access; Key : in Key_Type; Nil : in Node_Access) return Node_Access
with Pre => Nil /= null;
procedure Left_Rotate (Tree : in out Pkg.Tree; X : in Node_Access)
with Pre => X /= null;
procedure Right_Rotate (Tree : in out Pkg.Tree; X : in Node_Access)
with Pre => X /= null;
procedure Transplant (T : in out Pkg.Tree; U, V : in Node_Access)
with Pre => U /= null and T.Root /= null;
----------
-- local bodies (alphabetical order)
function Count_Tree (Item : in Node_Access; Nil : in Node_Access) return Ada.Containers.Count_Type
is
use all type Ada.Containers.Count_Type;
Result : Ada.Containers.Count_Type := 0;
begin
if Item.Left /= Nil then
Result := Result + Count_Tree (Item.Left, Nil);
end if;
if Item.Right /= Nil then
Result := Result + Count_Tree (Item.Right, Nil);
end if;
return Result + 1;
end Count_Tree;
procedure Delete_Fixup (T : in out Tree; X : in out Node_Access)
is
W : Node_Access;
begin
-- [1] 13.3 RB-Delete-Fixup
-- X is either "doubly black" or "red and black"
-- X.Parent is set, even if X = Nil.
-- In all cases, Nil.Left = null.Right = null.
while X /= T.Root and X.Color = Black loop
if X = X.Parent.Left then
W := X.Parent.Right;
if W.Color = Red then
W.Color := Black;
X.Parent.Color := Red;
Left_Rotate (T, X.Parent);
W := X.Parent.Right;
end if;
if W.Left.Color = Black and W.Right.Color = Black then
W.Color := Red;
X := X.Parent;
else
if W.Right.Color = Black then
W.Left.Color := Black;
W.Color := Red;
Right_Rotate (T, W);
W := X.Parent.Right;
end if;
W.Color := X.Parent.Color;
X.Parent.Color := Black;
W.Right.Color := Black;
Left_Rotate (T, X.Parent);
X := T.Root;
end if;
else
W := X.Parent.Left;
if W.Color = Red then
W.Color := Black;
X.Parent.Color := Red;
Right_Rotate (T, X.Parent);
W := X.Parent.Left;
end if;
if W.Right.Color = Black and W.Left.Color = Black then
W.Color := Red;
X := X.Parent;
else
if W.Left.Color = Black then
W.Right.Color := Black;
W.Color := Red;
Left_Rotate (T, W);
W := X.Parent.Left;
end if;
W.Color := X.Parent.Color;
X.Parent.Color := Black;
W.Left.Color := Black;
Right_Rotate (T, X.Parent);
X := T.Root;
end if;
end if;
end loop;
X.Color := Black;
end Delete_Fixup;
function Find (Root : in Node_Access; Key : in Key_Type; Nil : in Node_Access) return Node_Access
is
Node : Node_Access := Root;
begin
while Node /= Nil loop
case Key_Compare (Key, Pkg.Key (Node.Element)) is
when Equal =>
return Node;
when Less =>
Node := Node.Left;
when Greater =>
Node := Node.Right;
end case;
end loop;
return null;
end Find;
procedure Free_Tree (Item : in out Node_Access; Nil : in Node_Access)
is begin
if Item = Nil or Item = null then
raise Programmer_Error;
end if;
if Item.Left /= Nil then
Free_Tree (Item.Left, Nil);
end if;
if Item.Right /= Nil then
Free_Tree (Item.Right, Nil);
end if;
Free (Item);
end Free_Tree;
procedure Insert_Fixup (Tree : in out Pkg.Tree; Z : in out Node_Access)
is
-- [1] 13.3 RB-Insert-Fixup (T, z)
Nil : Node_Access renames Tree.Nil;
Y : Node_Access;
begin
while Z.Parent /= Nil and then Z.Parent.Color = Red loop
if Z.Parent = Z.Parent.Parent.Left then
Y := Z.Parent.Parent.Right;
if Y /= Nil and then Y.Color = Red then
Z.Parent.Color := Black;
Y.Color := Black;
Z.Parent.Parent.Color := Red;
Z := Z.Parent.Parent;
else
if Z = Z.Parent.Right then
Z := Z.Parent;
Left_Rotate (Tree, Z);
end if;
Z.Parent.Color := Black;
Z.Parent.Parent.Color := Red;
Right_Rotate (Tree, Z.Parent.Parent);
end if;
else
Y := Z.Parent.Parent.Left;
if Y /= Nil and then Y.Color = Red then
Z.Parent.Color := Black;
Y.Color := Black;
Z.Parent.Parent.Color := Red;
Z := Z.Parent.Parent;
else
if Z = Z.Parent.Left then
Z := Z.Parent;
Right_Rotate (Tree, Z);
end if;
Z.Parent.Color := Black;
Z.Parent.Parent.Color := Red;
Left_Rotate (Tree, Z.Parent.Parent);
end if;
end if;
end loop;
Tree.Root.Color := Black;
end Insert_Fixup;
procedure Left_Rotate (Tree : in out Pkg.Tree; X : in Node_Access)
is
-- [1] 13.2 Left-Rotate (T, x)
Nil : Node_Access renames Tree.Nil;
Y : constant Node_Access := X.Right;
begin
X.Right := Y.Left;
if Y.Left /= Nil then
Y.Left.Parent := X;
end if;
Y.Parent := X.Parent;
if X.Parent = Nil then
Tree.Root := Y;
elsif X = X.Parent.Left then
X.Parent.Left := Y;
else
X.Parent.Right := Y;
end if;
Y.Left := X;
X.Parent := Y;
end Left_Rotate;
function Minimum (Node : in Node_Access; Nil : in Node_Access) return Node_Access
is begin
return Result : Node_Access := Node
do
while Result.Left /= Nil loop
Result := Result.Left;
end loop;
end return;
end Minimum;
procedure Right_Rotate (Tree : in out Pkg.Tree; X : in Node_Access)
is
-- [1] 13.2 Right-Rotate (T, x)
Nil : Node_Access renames Tree.Nil;
Y : constant Node_Access := X.Left;
begin
X.Left := Y.Right;
if Y.Right /= Nil then
Y.Right.Parent := X;
end if;
Y.Parent := X.Parent;
if X.Parent = Nil then
Tree.Root := Y;
elsif X = X.Parent.Right then
X.Parent.Right := Y;
else
X.Parent.Left := Y;
end if;
Y.Right := X;
X.Parent := Y;
end Right_Rotate;
procedure Transplant (T : in out Pkg.Tree; U, V : in Node_Access)
is
Nil : Node_Access renames T.Nil;
begin
-- [1] 13.4 RB-Transplant, 12.3 Transplant
if U.Parent = Nil then
T.Root := V;
elsif U = U.Parent.Left then
U.Parent.Left := V;
else
U.Parent.Right := V;
end if;
V.Parent := U.Parent;
end Transplant;
----------
-- Public subprograms, spec order
overriding procedure Finalize (Object : in out Tree)
is begin
if Object.Root /= null then
if Object.Root = Object.Nil then
Free (Object.Nil);
Object.Root := null;
else
Free_Tree (Object.Root, Object.Nil);
Free (Object.Nil);
end if;
end if;
end Finalize;
overriding procedure Initialize (Object : in out Tree)
is begin
Object.Nil := new Node;
Object.Nil.Color := Black;
Object.Root := Object.Nil;
end Initialize;
function Has_Element (Cursor : in Pkg.Cursor) return Boolean
is begin
return Cursor.Node /= null;
end Has_Element;
function Constant_Reference
(Container : aliased in Tree;
Position : in Cursor)
return Constant_Reference_Type
is
pragma Unreferenced (Container);
begin
return (Element => Position.Node.all.Element'Access, Dummy => 1);
end Constant_Reference;
function Constant_Reference
(Container : aliased in Tree;
Key : in Key_Type)
return Constant_Reference_Type
is
Node : constant Node_Access := Find (Container.Root, Key, Container.Nil);
begin
if Node = null then
raise Not_Found;
else
return (Element => Node.all.Element'Access, Dummy => 1);
end if;
end Constant_Reference;
function Variable_Reference
(Container : aliased in Tree;
Position : in Cursor)
return Variable_Reference_Type
is
pragma Unreferenced (Container);
begin
return (Element => Position.Node.all.Element'Access, Dummy => 1);
end Variable_Reference;
function Variable_Reference
(Container : aliased in Tree;
Key : in Key_Type)
return Variable_Reference_Type
is
Node : constant Node_Access := Find (Container.Root, Key, Container.Nil);
begin
if Node = null then
raise Not_Found;
else
return (Element => Node.all.Element'Access, Dummy => 1);
end if;
end Variable_Reference;
function Iterate (Tree : in Pkg.Tree'Class) return Iterator
is begin
return (Tree.Root, Tree.Nil);
end Iterate;
overriding function First (Iterator : in Pkg.Iterator) return Cursor
is
Nil : Node_Access renames Iterator.Nil;
Node : Node_Access := Iterator.Root;
begin
if Node = Nil then
return
(Node => null,
Direction => Unknown,
Left_Done => True,
Right_Done => True);
else
loop
exit when Node.Left = Nil;
Node := Node.Left;
end loop;
return
(Node => Node,
Direction => Ascending,
Left_Done => True,
Right_Done => False);
end if;
end First;
overriding function Next (Iterator : in Pkg.Iterator; Position : in Cursor) return Cursor
is
Nil : Node_Access renames Iterator.Nil;
begin
if Position.Direction /= Ascending then
raise Programmer_Error;
end if;
if Position.Node = null then
return
(Node => null,
Direction => Unknown,
Left_Done => True,
Right_Done => True);
elsif Position.Left_Done or Position.Node.Left = Nil then
if Position.Right_Done or Position.Node.Right = Nil then
if Position.Node.Parent = Nil then
return
(Node => null,
Direction => Unknown,
Left_Done => True,
Right_Done => True);
else
declare
Node : constant Node_Access := Position.Node.Parent;
Temp : constant Cursor :=
(Node => Node,
Direction => Ascending,
Left_Done => Node.Right = Position.Node or Node.Left = Position.Node,
Right_Done => Node.Right = Position.Node);
begin
if Temp.Right_Done then
return Next (Iterator, Temp);
else
return Temp;
end if;
end;
end if;
else
declare
Node : constant Node_Access := Position.Node.Right;
Temp : constant Cursor :=
(Node => Node,
Direction => Ascending,
Left_Done => Node.Left = Nil,
Right_Done => False);
begin
if Temp.Left_Done then
return Temp;
else
return Next (Iterator, Temp);
end if;
end;
end if;
else
declare
Node : constant Node_Access := Position.Node.Left;
Temp : constant Cursor :=
(Node => Node,
Direction => Ascending,
Left_Done => Node.Left = Nil,
Right_Done => False);
begin
if Temp.Left_Done then
return Temp;
else
return Next (Iterator, Temp);
end if;
end;
end if;
end Next;
overriding function Last (Iterator : in Pkg.Iterator) return Cursor
is
Nil : Node_Access renames Iterator.Nil;
Node : Node_Access := Iterator.Root;
begin
if Node = Nil then
return
(Node => null,
Direction => Unknown,
Left_Done => True,
Right_Done => True);
else
loop
exit when Node.Right = Nil;
Node := Node.Right;
end loop;
return
(Node => Node,
Direction => Descending,
Right_Done => True,
Left_Done => False);
end if;
end Last;
overriding function Previous (Iterator : in Pkg.Iterator; Position : in Cursor) return Cursor
is
Nil : Node_Access renames Iterator.Nil;
begin
if Position.Direction /= Descending then
raise Programmer_Error;
end if;
if Position.Node = null then
return
(Node => null,
Direction => Unknown,
Left_Done => True,
Right_Done => True);
elsif Position.Right_Done or Position.Node.Right = Nil then
if Position.Left_Done or Position.Node.Left = Nil then
if Position.Node.Parent = Nil then
return
(Node => null,
Direction => Unknown,
Left_Done => True,
Right_Done => True);
else
declare
Node : constant Node_Access := Position.Node.Parent;
Temp : constant Cursor :=
(Node => Node,
Direction => Descending,
Right_Done => Node.Left = Position.Node or Node.Right = Position.Node,
Left_Done => Node.Left = Position.Node);
begin
if Temp.Left_Done then
return Previous (Iterator, Temp);
else
return Temp;
end if;
end;
end if;
else
declare
Node : constant Node_Access := Position.Node.Left;
Temp : constant Cursor :=
(Node => Node,
Direction => Descending,
Right_Done => Node.Right = Nil,
Left_Done => False);
begin
if Temp.Right_Done then
return Temp;
else
return Previous (Iterator, Temp);
end if;
end;
end if;
else
declare
Node : constant Node_Access := Position.Node.Right;
Temp : constant Cursor :=
(Node => Node,
Direction => Descending,
Right_Done => Node.Right = Nil,
Left_Done => False);
begin
if Temp.Right_Done then
return Temp;
else
return Previous (Iterator, Temp);
end if;
end;
end if;
end Previous;
function Previous (Iterator : in Pkg.Iterator; Key : in Key_Type) return Cursor
is
Nil : Node_Access renames Iterator.Nil;
Node : Node_Access := Iterator.Root;
begin
while Node /= Nil loop
declare
Current_Key : Key_Type renames Pkg.Key (Node.Element);
begin
case Key_Compare (Key, Current_Key) is
when Equal =>
return Previous (Iterator, (Node, Descending, Right_Done => True, Left_Done => False));
when Less =>
if Node.Left = Nil then
return Previous (Iterator, (Node, Descending, Right_Done => True, Left_Done => True));
else
Node := Node.Left;
end if;
when Greater =>
if Node.Right = Nil then
return (Node, Descending, Right_Done => True, Left_Done => False);
else
Node := Node.Right;
end if;
end case;
end;
end loop;
return
(Node => null,
Direction => Unknown,
Left_Done => True,
Right_Done => True);
end Previous;
function Find
(Iterator : in Pkg.Iterator;
Key : in Key_Type;
Direction : in Direction_Type := Ascending)
return Cursor
is
Nil : Node_Access renames Iterator.Nil;
Node : constant Node_Access := Find (Iterator.Root, Key, Nil);
begin
if Node = null then
return
(Node => null,
Direction => Unknown,
Left_Done => True,
Right_Done => True);
else
return
(Node => Node,
Direction => Direction,
Left_Done =>
(case Direction is
when Ascending | Unknown => True,
when Descending => Node.Left = Nil),
Right_Done =>
(case Direction is
when Ascending => Node.Right = Nil,
when Descending | Unknown => True));
end if;
end Find;
function Find_In_Range
(Iterator : in Pkg.Iterator;
Direction : in Known_Direction_Type;
First, Last : in Key_Type)
return Cursor
is
Nil : Node_Access renames Iterator.Nil;
Node : Node_Access := Iterator.Root;
Candidate : Node_Access := null; -- best result found so far
begin
while Node /= Nil loop
declare
Current_Key : Key_Type renames Key (Node.Element);
begin
case Direction is
when Ascending =>
case Key_Compare (First, Current_Key) is
when Equal =>
return (Node, Ascending, Right_Done => False, Left_Done => True);
when Less =>
if Node.Left = Nil then
case Key_Compare (Current_Key, Last) is
when Less | Equal =>
return (Node, Ascending, Right_Done => False, Left_Done => True);
when Greater =>
if Candidate = null then
return No_Element;
else
return (Candidate, Ascending, Right_Done => False, Left_Done => True);
end if;
end case;
else
case Key_Compare (Last, Current_Key) is
when Greater | Equal =>
Candidate := Node;
when Less =>
null;
end case;
Node := Node.Left;
end if;
when Greater =>
if Node.Right = Nil then
if Candidate = null then
return No_Element;
else
return (Candidate, Ascending, Right_Done => False, Left_Done => True);
end if;
else
Node := Node.Right;
end if;
end case;
when Descending =>
if Last = Current_Key then
return (Node, Descending, Right_Done => True, Left_Done => False);
else
case Key_Compare (Last, Current_Key) is
when Greater =>
if Node.Right = Nil then
case Key_Compare (Current_Key, First) is
when Greater | Equal =>
return (Node, Descending, Right_Done => True, Left_Done => False);
when Less =>
if Candidate = null then
return No_Element;
else
return (Candidate, Ascending, Right_Done => False, Left_Done => True);
end if;
end case;
else
case Key_Compare (First, Current_Key) is
when Less | Equal =>
Candidate := Node;
when Greater =>
null;
end case;
Node := Node.Right;
end if;
when Equal | Less =>
if Node.Left = Nil then
if Candidate = null then
return No_Element;
else
return (Candidate, Ascending, Right_Done => False, Left_Done => True);
end if;
else
Node := Node.Left;
end if;
end case;
end if;
end case;
end;
end loop;
return No_Element;
end Find_In_Range;
function Count (Tree : in Pkg.Tree) return Ada.Containers.Count_Type
is begin
if Tree.Root = Tree.Nil then
return 0;
else
return Count_Tree (Tree.Root, Tree.Nil);
end if;
end Count;
function Present (Container : in Tree; Key : in Key_Type) return Boolean
is
Nil : Node_Access renames Container.Nil;
Node : Node_Access := Container.Root;
begin
while Node /= Nil loop
case Key_Compare (Key, Pkg.Key (Node.Element)) is
when Equal =>
return True;
when Less =>
Node := Node.Left;
when Greater =>
Node := Node.Right;
end case;
end loop;
return False;
end Present;
function Insert (Tree : in out Pkg.Tree; Element : in Element_Type) return Cursor
is
-- [1] 13.3 RB-Insert (T, z)
Nil : Node_Access renames Tree.Nil;
Z : Node_Access := new Node'(Element, Nil, Nil, Nil, Red);
Key_Z : constant Key_Type := Key (Z.Element);
Y : Node_Access := Nil;
X : Node_Access := Tree.Root;
Result : Node_Access;
Compare_Z_Y : Compare_Result;
begin
Nil.Parent := null;
Nil.Left := null;
Nil.Right := null;
while X /= Nil loop
Y := X;
Compare_Z_Y := Key_Compare (Key_Z, Key (X.Element));
case Compare_Z_Y is
when Less =>
X := X.Left;
when Equal | Greater =>
X := X.Right;
end case;
end loop;
Z.Parent := Y;
if Y = Nil then
Tree.Root := Z;
else
case Compare_Z_Y is
when Less =>
Y.Left := Z;
when Equal | Greater =>
Y.Right := Z;
end case;
end if;
Result := Z;
if Z = Tree.Root then
Z.Color := Black;
else
Insert_Fixup (Tree, Z);
end if;
return
(Node => Result,
Direction => Unknown,
Left_Done => True,
Right_Done => True);
end Insert;
procedure Insert (Tree : in out Pkg.Tree; Element : in Element_Type)
is
Temp : Cursor := Insert (Tree, Element);
pragma Unreferenced (Temp);
begin
null;
end Insert;
procedure Delete (Tree : in out Pkg.Tree; Position : in out Cursor)
is
Nil : Node_Access renames Tree.Nil;
T : Pkg.Tree renames Tree;
Z : constant Node_Access :=
(if Position.Node = null then raise Parameter_Error else Position.Node);
Y : Node_Access := Z;
Y_Orig_Color : Color := Y.Color;
X : Node_Access;
begin
-- Catch logic errors in use of Nil
Nil.Parent := null;
Nil.Left := null;
Nil.Right := null;
-- [1] 13.4 RB-Delete.
if Z.Left = Nil then
X := Z.Right;
Transplant (T, Z, Z.Right);
elsif Z.Right = Nil then
X := Z.Left;
Transplant (T, Z, Z.Left);
else
Y := Minimum (Z.Right, Nil);
Y_Orig_Color := Y.Color;
X := Y.Right;
if Y.Parent = Z then
X.Parent := Y;
-- This is already true unless X = Nil, in which case delete_fixup
-- needs the info.
else
Transplant (T, Y, Y.Right);
Y.Right := Z.Right;
Y.Right.Parent := Y;
-- This is already true unless Y.Right = Nil, in which case
-- delete_fixup needs the info.
end if;
Transplant (T, Z, Y);
Y.Left := Z.Left;
Y.Left.Parent := Y;
-- This is already true unless Y.Left = Nil, in which case
-- delete_fixup needs the info.
Y.Color := Z.Color;
end if;
if Y_Orig_Color = Black then
Delete_Fixup (T, X);
end if;
Free (Position.Node);
end Delete;
end SAL.Gen_Unbounded_Definite_Red_Black_Trees;
| 31.306713 | 105 | 0.491774 |
2e6ad6893a8284005fd35cba9a8365c4401fcf42 | 2,479 | ads | Ada | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/same_component_name/pck.ads | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | 3 | 2021-05-04T17:09:06.000Z | 2021-10-04T07:19:26.000Z | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/same_component_name/pck.ads | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | null | null | null | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/same_component_name/pck.ads | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | null | null | null | -- Copyright 2017-2020 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with System;
package Pck is
package Top is
type Top_T is tagged private;
type Top_A is access Top_T'Class;
procedure Assign (Obj: in out Top_T; TV : Integer);
private
type Top_T is tagged record
N : Integer := 1;
A : Integer := 48;
end record;
end Top;
package Middle is
type Middle_T is new Top.Top_T with private;
type Middle_A is access Middle_T'Class;
procedure Assign (Obj: in out Middle_T; MV : Character);
private
type Middle_T is new Top.Top_T with record
N : Character := 'a';
end record;
end Middle;
type Bottom_T is new Middle.Middle_T with record
N : Float := 4.0;
X : Integer := 6;
A : Character := 'J';
end record;
type Bottom_A is access Bottom_T'Class;
procedure Assign (Obj: in out Bottom_T; BV : Float);
procedure Do_Nothing (A : System.Address);
type Integer_Array is array (Natural range <>) of Integer;
package Dyn_Top is
type Dyn_Top_T (Disc : Natural) is tagged private;
type Dyn_Top_A is access Dyn_Top_T'Class;
procedure Assign (Obj: in out Dyn_Top_T; TV : Integer);
private
type Dyn_Top_T (Disc : Natural) is tagged record
S : Integer_Array (1 .. Disc) := (others => Disc);
N : Integer := 1;
A : Integer := 48;
end record;
end Dyn_Top;
package Dyn_Middle is
type Dyn_Middle_T is new Dyn_Top.Dyn_Top_T with private;
type Dyn_Middle_A is access Dyn_Middle_T'Class;
procedure Assign (Obj: in out Dyn_Middle_T; MV : Character);
private
type Dyn_Middle_T is new Dyn_Top.Dyn_Top_T with record
N : Character := 'a';
U : Integer := 42;
end record;
end Dyn_Middle;
end Pck;
| 32.194805 | 73 | 0.66075 |
4180c6bfa1da5efaf60f736cb8ecd5ca1af03583 | 465 | ads | Ada | Sources/Globe_3d/gl/gl-buffer-indices.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | 1 | 2019-09-21T09:40:34.000Z | 2019-09-21T09:40:34.000Z | Sources/Globe_3d/gl/gl-buffer-indices.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | null | null | null | Sources/Globe_3d/gl/gl-buffer-indices.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | 1 | 2019-09-25T12:29:27.000Z | 2019-09-25T12:29:27.000Z |
with GL.Buffer.general; pragma Elaborate_All (GL.Buffer.general);
with GL.Geometry;
package GL.Buffer.indices is new GL.Buffer.general (base_object => GL.Buffer.element_array_Object,
index => GL.positive_uInt,
element => GL.geometry.vertex_Id,
element_array => GL.geometry.vertex_Id_Array);
| 51.666667 | 100 | 0.498925 |
13678506814b05898501a8a34fbddb6a2b5dd71e | 4,578 | ads | Ada | source/web/tools/a2js/webapi/dom/webapi-dom-rects.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/web/tools/a2js/webapi/dom/webapi-dom-rects.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/web/tools/a2js/webapi/dom/webapi-dom-rects.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Web API Definition --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2016, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with WebAPI.DOM.Rect_Read_Onlys;
package WebAPI.DOM.Rects is
pragma Preelaborate;
type DOM_Rect is limited interface
and WebAPI.DOM.Rect_Read_Onlys.DOM_Rect_Read_Only;
type DOM_Rect_Access is access all DOM_Rect'Class
with Storage_Size => 0;
not overriding procedure Set_X
(Self : not null access DOM_Rect;
To : WebAPI.DOM_Double) is abstract
with Import => True,
Convention => JavaScript_Property_Setter,
Link_Name => "x";
not overriding procedure Set_Y
(Self : not null access DOM_Rect;
To : WebAPI.DOM_Double) is abstract
with Import => True,
Convention => JavaScript_Property_Setter,
Link_Name => "y";
not overriding procedure Set_Width
(Self : not null access DOM_Rect;
To : WebAPI.DOM_Double) is abstract
with Import => True,
Convention => JavaScript_Property_Setter,
Link_Name => "width";
not overriding procedure Set_Height
(Self : not null access DOM_Rect;
To : WebAPI.DOM_Double) is abstract
with Import => True,
Convention => JavaScript_Property_Setter,
Link_Name => "height";
end WebAPI.DOM.Rects;
| 53.858824 | 78 | 0.454128 |
1377de8450c69f9e7e0646021be9aef94cf24311 | 104,399 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/opt.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/opt.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/opt.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- O P T --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains global flags set by the initialization routine from
-- the command line and referenced throughout the compiler, the binder, or
-- other GNAT tools. The comments indicate which options are used by which
-- programs (GNAT, GNATBIND, GNATLINK, GNATMAKE, etc).
-- Some flags are labelled "PROJECT MANAGER". These are used by tools that
-- use the Project Manager. These tools include gnatmake, gnatname, the gnat
-- driver, gnatclean, gprbuild and gprclean.
with Hostparm; use Hostparm;
with Types; use Types;
pragma Warnings (Off);
-- This package is used also by gnatcoll
with System.Strings; use System.Strings;
with System.WCh_Con; use System.WCh_Con;
pragma Warnings (On);
package Opt is
----------------------
-- Checksum Control --
----------------------
-- Checksums are computed for sources to check for sources being the same
-- from a compilation point of view (e.g. spelling of identifiers and
-- white space layout do not count in this computation).
Checksum_Accumulate_Limited_Checksum : Boolean := False;
-- Used to control the computation of the limited view of a package.
-- (Not currently used, possible optimization for ALI files of units
-- in limited with_clauses).
----------------------------------------------
-- Settings of Modes for Current Processing --
----------------------------------------------
-- The following mode values represent the current state of processing.
-- The values set here are the default values. Unless otherwise noted,
-- the value may be reset in Switch-? with an appropriate switch. In
-- some cases, the values can also be modified by pragmas, and in the
-- case of some binder variables, Gnatbind.Scan_Bind_Arg may modify
-- the default values.
Latest_Ada_Only : Boolean := False;
-- If True, the only value valid for Ada_Version is Ada_Version_Type'Last,
-- trying to specify other values will be ignored (in case of pragma
-- Ada_xxx) or generate an error (in case of -gnat83/95/xx switches).
type Ada_Version_Type is (Ada_83, Ada_95, Ada_2005, Ada_2012, Ada_2020);
pragma Ordered (Ada_Version_Type);
pragma Convention (C, Ada_Version_Type);
-- Versions of Ada for Ada_Version below. Note that these are ordered,
-- so that tests like Ada_Version >= Ada_95 are legitimate and useful.
-- Think twice before using "="; Ada_Version >= Ada_2012 is more likely
-- what you want, because it will apply to future versions of the language.
-- WARNING: There is a matching C declaration of this type in fe.h
Ada_Version_Default : constant Ada_Version_Type := Ada_2012;
pragma Warnings (Off, Ada_Version_Default);
-- GNAT
-- Default Ada version if no switch given. The Warnings off is to kill
-- constant condition warnings.
Ada_Version : Ada_Version_Type := Ada_Version_Default;
-- GNAT
-- Current Ada version for compiler, as set by configuration pragmas,
-- compiler switches, or implicitly (to Ada_Version_Runtime) when a
-- predefined or internal file is compiled.
-- WARNING: There is a matching C declaration of this variable in fe.h
Ada_Version_Pragma : Node_Id := Empty;
-- Reflects the Ada_xxx pragma that resulted in setting Ada_Version. Used
-- to specialize error messages complaining about the Ada version in use.
Ada_Version_Explicit : Ada_Version_Type := Ada_Version_Default;
-- GNAT
-- Like Ada_Version, but does not get set implicitly for predefined or
-- internal units, so it reflects the Ada version explicitly set using
-- configuration pragmas or compiler switches (or if neither appears, it
-- remains set to Ada_Version_Default). This is used in the rare cases
-- (notably pragma Obsolescent) where we want the explicit version set.
Ada_Version_Runtime : Ada_Version_Type := Ada_2020;
-- GNAT
-- Ada version used to compile the runtime. Used to set Ada_Version (but
-- not Ada_Version_Explicit) when compiling predefined or internal units.
Ada_Final_Suffix : constant String := "final";
Ada_Final_Name : String_Ptr := new String'("ada" & Ada_Final_Suffix);
-- GNATBIND
-- The name of the procedure that performs the finalization at the end of
-- execution. This variable may be modified by Gnatbind.Scan_Bind_Arg.
Ada_Init_Suffix : constant String := "init";
Ada_Init_Name : String_Ptr := new String'("ada" & Ada_Init_Suffix);
-- GNATBIND
-- The name of the procedure that performs initialization at the start
-- of execution. This variable may be modified by Gnatbind.Scan_Bind_Arg.
Ada_Main_Name_Suffix : constant String := "main";
-- GNATBIND
-- The suffix for Ada_Main_Name. Defined as a constant here so that it
-- can be referenced in a uniform manner to create either the default
-- value of Ada_Main_Name (declared below), or the non-default name
-- set by Gnatbind.Scan_Bind_Arg.
Ada_Main_Name : String_Ptr := new String'("ada_" & Ada_Main_Name_Suffix);
-- GNATBIND
-- The name of the Ada package generated by the binder (when in Ada mode).
-- This variable may be modified by Gnatbind.Scan_Bind_Arg.
Address_Clause_Overlay_Warnings : Boolean := True;
-- GNAT
-- Set False to disable address clause warnings. Modified by use of
-- -gnatwo/O.
Address_Is_Private : Boolean := False;
-- GNAT, GNATBIND
-- Set True if package System has the line "type Address is private;"
Aggregate_Individually_Assign : Boolean := False;
-- GNAT
-- Set True if record aggregates are to be always converted into assignment
-- statements. Set through the corresponding pragma.
All_Errors_Mode : Boolean := False;
-- GNAT
-- Flag set to force display of multiple errors on a single line and
-- also repeated error messages for references to undefined identifiers
-- and certain other repeated error messages. Set by use of -gnatf.
Allow_Integer_Address : Boolean := False;
-- GNAT
-- Allow use of integer expression in a context requiring System.Address.
-- Set by the use of configuration pragma Allow_Integer_Address. Also set
-- in relaxed semantics mode for use by CodePeer or when -gnatd.M is used.
All_Sources : Boolean := False;
-- GNATBIND
-- Set to True to require all source files to be present. This flag is
-- directly modified by gnatmake to affect the shared binder routines.
Alternate_Main_Name : String_Ptr := null;
-- GNATBIND
-- Set to non-null when Bind_Alternate_Main_Name is True. This value
-- is modified as needed by Gnatbind.Scan_Bind_Arg.
Assertions_Enabled : Boolean := False;
-- GNAT
-- Indicates default policy (True = Check, False = Ignore) to be applied
-- to all assertion aspects and pragmas, and to pragma Debug, if there is
-- no overriding Assertion_Policy, Check_Policy, or Debug_Policy pragma.
-- Set True by use of -gnata.
Assume_No_Invalid_Values : Boolean := False;
-- GNAT Normally, in accordance with (RM 13.9.1 (9-11)) the front end
-- assumes that values could have invalid representations, unless it can
-- clearly prove that the values are valid. If this switch is set (by
-- pragma Assume_No_Invalid_Values (On)), then the compiler assumes values
-- are valid and in range of their representations. This feature is now
-- fully enabled in the compiler.
Back_Annotate_Rep_Info : Boolean := False;
-- GNAT
-- If set True, enables back annotation of representation information
-- by gigi, even in -gnatc mode. This is set True by the use of -gnatR
-- (list representation information). It is also set true if certain
-- Unchecked_Conversion instantiations require checking based on annotated
-- values.
Back_End_Handles_Limited_Types : Boolean;
-- This flag is set true if the back end can properly handle limited or
-- other by reference types, and avoid copies. If this flag is False, then
-- the front end does special expansion for if/case expressions to make
-- sure that no copy occurs. If the flag is True, then the expansion for
-- if and case expressions relies on the back end properly handling things.
-- Currently the default is False for all cases (set in gnat1drv). The
-- default can be modified using -gnatd.L (sets the flag True). This is
-- used to test the possibility of having the backend handle this.
Back_End_Inlining : Boolean := False;
-- GNAT
-- Set True to activate inlining by back-end expansion. This is the normal
-- default mode for gcc targets, so it is True on such targets unless the
-- switches -gnatN or -gnatd.z are used. See circuitry in gnat1drv for the
-- exact conditions for setting this switch.
-- WARNING: There is a matching C declaration of this variable in fe.h
Bind_Alternate_Main_Name : Boolean := False;
-- GNATBIND
-- True if main should be called Alternate_Main_Name.all.
-- This variable may be set to True by Gnatbind.Scan_Bind_Arg.
Bind_Main_Program : Boolean := True;
-- GNATBIND
-- Set to False if not binding main Ada program
Bind_For_Library : Boolean := False;
-- GNATBIND
-- Set to True if the binder needs to generate a file designed for building
-- a library. May be set to True by Gnatbind.Scan_Bind_Arg.
Bind_Only : Boolean := False;
-- GNATMAKE, GPRBUILD
-- Set to True to skip compile and link steps
-- (except when Compile_Only and/or Link_Only are True).
Blank_Deleted_Lines : Boolean := False;
-- GNAT, GNATPREP
-- Output empty lines for each line of preprocessed input that is deleted
-- in the output, including preprocessor lines starting with a '#'.
Brief_Output : Boolean := False;
-- GNAT, GNATBIND
-- Force brief error messages to standard error, even if verbose mode is
-- set (so that main error messages go to standard output).
Build_Bind_And_Link_Full_Project : Boolean := False;
-- GNATMAKE
-- Set to True to build, bind and link all the sources of a project file
-- (switch -B)
Check_Aliasing_Of_Parameters : Boolean := False;
-- GNAT
-- Set to True to detect whether subprogram parameters and function results
-- alias the same object(s).
Check_Float_Overflow : Boolean := False;
-- GNAT
-- Set to True to check that operations on predefined unconstrained float
-- types (e.g. Float, Long_Float) do not overflow and generate infinities
-- or invalid values. Set by the Check_Float_Overflow pragma, or by use
-- of the -gnateF switch.
Check_Object_Consistency : Boolean := False;
-- GNATBIND, GNATMAKE
-- Set to True to check whether every object file is consistent with its
-- corresponding ada library information (ALI) file. An object file is
-- inconsistent with the corresponding ALI file if the object file does
-- not exist or if it has an older time stamp than the ALI file. Default
-- above is for GNATBIND. GNATMAKE overrides this default to True (see
-- Make.Initialize) since we normally do need to check source consistencies
-- in gnatmake.
Check_Only : Boolean := False;
-- GNATBIND
-- Set to True to do checks only, no output of binder file
Check_Policy_List : Node_Id := Empty;
-- GNAT
-- This points to the list of N_Pragma nodes for Check_Policy pragmas
-- that are linked through the Next_Pragma fields, with the list being
-- terminated by Empty. The order is most recently processed first. Note
-- that Push_Scope and Pop_Scope in Sem_Ch8 save and restore the value
-- of this variable, implementing the required scope control for pragmas
-- appearing in a declarative part.
Check_Readonly_Files : Boolean := False;
-- GNATMAKE
-- Set to True to check readonly files during the make process
Check_Source_Files : Boolean := True;
-- GNATBIND, GNATMAKE
-- Set to True to enable consistency checking for any source files that
-- are present (i.e. date must match the date in the library info file).
-- Set to False for object file consistency check only. This flag is
-- directly modified by gnatmake, to affect the shared binder routines.
Check_Switches : Boolean := False;
-- GNATMAKE, GPBUILD
-- Set to True to check compiler options during the make process
Check_Unreferenced : Boolean := False;
-- GNAT
-- Set to True to enable checking for unreferenced entities other
-- than formal parameters (for which see Check_Unreferenced_Formals)
-- Modified by use of -gnatwu/U.
Check_Unreferenced_Formals : Boolean := False;
-- GNAT
-- Set to True to check for unreferenced formals. This is turned on by
-- -gnatwa/wf/wu and turned off by -gnatwA/wF/wU.
Check_Validity_Of_Parameters : Boolean := False;
-- GNAT
-- Set to True to check for proper scalar initialization of subprogram
-- parameters on both entry and exit. This is turned on by -gnateV.
Check_Withs : Boolean := False;
-- GNAT
-- Set to True to enable checking for unused withs, and also the case
-- of withing a package and using none of the entities in the package.
-- Modified by use of -gnatwu/U.
CodePeer_Mode : Boolean := False;
-- GNAT, GNATBIND, GPRBUILD
-- Enable full CodePeer mode (SCIL generation, disable switches that
-- interact badly with it, etc...). This is turned on by -gnatC.
Commands_To_Stdout : Boolean := False;
-- GNATMAKE
-- True if echoed commands to be written to stdout instead of stderr
Comment_Deleted_Lines : Boolean := False;
-- GNATPREP
-- True if source lines removed by the preprocessor should be commented
-- in the output file.
Compilation_Time : String (1 .. 19);
-- GNAT
-- Compilation date and time in form YYYY-MM-DD HH:MM:SS
Compile_Only : Boolean := False;
-- GNATMAKE, GNATCLEAN, GPBUILD, GPRCLEAN
-- GNATMAKE, GPRBUILD:
-- set True to skip bind and link steps (except when Bind_Only is True)
-- GNATCLEAN, GPRCLEAN:
-- set True to delete only the files produced by the compiler but not the
-- library files or the executable files.
Compiler_Unit : Boolean := False;
-- GNAT1
-- Set True by an occurrence of pragma Compiler_Unit_Warning (or of the
-- obsolete pragma Compiler_Unit) in the main unit. Once set True, stays
-- True, since any units that are with'ed directly or indirectly by
-- a Compiler_Unit_Warning main unit are subject to the same restrictions.
-- Such units really should have their own pragmas, but we do not bother to
-- check for that, so this transitivity provides extra checking.
Config_File : Boolean := True;
-- GNAT
-- Set to False to inhibit reading and processing of gnat.adc file
Config_File_Names : String_List_Access := null;
-- GNAT
-- Names of configuration pragmas files (given by switches -gnatec)
Configurable_Run_Time_Mode : Boolean := False;
-- GNAT, GNATBIND
-- Set True if the compiler is operating in configurable run-time mode.
-- This happens if the flag Targparm.Configurable_Run_Time_On_Target is
-- True, or if pragma No_Run_Time is used. See the spec of Rtsfind for
-- details on the handling of the latter pragma.
Constant_Condition_Warnings : Boolean := False;
-- GNAT
-- Set to True to activate warnings on constant conditions. Modified by
-- use of -gnatwc/C.
Create_Mapping_File : Boolean := False;
-- GNATMAKE
-- Set to True (-C switch) to indicate that the compiler will be invoked
-- with a mapping file (-gnatem compiler switch).
subtype Debug_Level_Value is Nat range 0 .. 3;
Debugger_Level : Debug_Level_Value := 0;
-- GNAT, GNATBIND
-- The value given to the -g parameter. The default value for -g with
-- no value is 2. If no -g is specified, defaults to 0.
-- Note that the generated code should never depend on this variable,
-- since we want debug info to be nonintrusive on the generate code.
Default_Exit_Status : Int := 0;
-- GNATBIND
-- Set the default exit status value. Set by the -Xnnn switch for the
-- binder.
Debug_Generated_Code : Boolean := False;
-- GNAT
-- Set True (-gnatD switch) to debug generated expanded code instead
-- of the original source code. Causes debugging information to be
-- written with respect to the generated code file that is written.
-- WARNING: There is a matching C declaration of this variable in fe.h
Default_Pool : Node_Id := Empty;
-- GNAT
-- Used to record the storage pool name (or null literal) that is the
-- argument of an applicable pragma Default_Storage_Pool.
-- Empty: No pragma Default_Storage_Pool applies.
-- N_Null node: "pragma Default_Storage_Pool (null);" applies.
-- otherwise: "pragma Default_Storage_Pool (X);" applies, and
-- this points to the name X.
-- Push_Scope and Pop_Scope in Sem_Ch8 save and restore this value.
No_Stack_Size : constant := -1;
Default_Stack_Size : Int := No_Stack_Size;
-- GNATBIND
-- Set to default primary stack size in units of bytes. Set by the -dnnn
-- switch for the binder. A value of No_Stack_Size indicates that
-- no default was set by the binder.
Default_Sec_Stack_Size : Int := No_Stack_Size;
-- GNATBIND
-- Set to default secondary stack size in units of bytes. Set by the -Dnnn
-- switch for the binder. A value of No_Stack_Size indicates that no
-- default was set by the binder and the run-time value should be used
-- instead.
Default_SSO : Character := ' ';
-- GNAT
-- Set if a pragma Default_Scalar_Storage_Order has been given. The value
-- of ' ' indicates that no default has been set, otherwise the value is
-- either 'H' for High_Order_First or 'L' for Lower_Order_First.
Detect_Blocking : Boolean := False;
-- GNAT
-- Set True to force the run time to raise Program_Error if calls to
-- potentially blocking operations are detected from protected actions.
Directories_Must_Exist_In_Projects : Boolean := True;
-- PROJECT MANAGER
-- Set to False with switch -f of gnatclean and gprclean
Disable_FE_Inline : Boolean := False;
-- GNAT
-- Request to disable front end inlining from pragma Inline in the
-- presence of the -fno-inline back end flag on the command line,
-- regardless of any other switches that are set.
-- It remains the back end's reponsibility to honor -fno-inline at the
-- back end level.
Display_Compilation_Progress : Boolean := False;
-- GNATMAKE, GPRBUILD
-- Set True (-d switch) to display information on progress while compiling
-- files. Internal flag to be used in conjunction with an IDE
-- (e.g GNAT Studio).
type Distribution_Stub_Mode_Type is
-- GNAT
(No_Stubs,
-- Normal mode, no generation of distribution stubs
Generate_Receiver_Stub_Body,
-- The unit being compiled is the RCI body, and the compiler will
-- generate the body for the receiver stubs and compile it.
Generate_Caller_Stub_Body);
-- The unit being compiled is the RCI spec, and the compiler will
-- generate the body for the caller stubs and compile it.
Distribution_Stub_Mode : Distribution_Stub_Mode_Type := No_Stubs;
-- GNAT
-- This enumeration variable indicates the three states of distribution
-- annex stub generation.
Do_Not_Execute : Boolean := False;
-- GNATMAKE
-- Set to True if no actual compilations should be undertaken
Dump_Source_Text : Boolean := False;
-- GNAT
-- Set to True (by -gnatL) to dump source text intermingled with generated
-- code. Effective only if either of Debug/Print_Generated_Code is true.
Dynamic_Elaboration_Checks : Boolean := False;
-- GNAT
-- Set True for dynamic elaboration checking mode, as set by the -gnatE
-- switch or by the use of pragma Elaboration_Checks (Dynamic).
Dynamic_Stack_Measurement : Boolean := False;
-- GNATBIND
-- Set True to enable dynamic stack measurement (-u flag for gnatbind)
Dynamic_Stack_Measurement_Array_Size : Nat := 100;
-- GNATBIND
-- Number of measurements we want to store during dynamic stack analysis.
-- When the buffer is full, non-storable results will be output on the fly.
-- The value is relevant only if Dynamic_Stack_Measurement is set. Set
-- by processing of -u flag for gnatbind.
Elab_Dependency_Output : Boolean := False;
-- GNATBIND
-- Set to True to output complete list of elaboration constraints
Elab_Order_Output : Boolean := False;
-- GNATBIND
-- Set to True to output chosen elaboration order
Elab_Info_Messages : Boolean := False;
-- GNAT
-- Set to True to output info messages for static elabmodel (-gnatel)
Elab_Warnings : Boolean := True;
-- GNAT
-- Set to True to generate elaboration warnings (-gnatwl). The warnings are
-- enabled by default because they carry the same importance as errors. The
-- compiler cannot emit actual errors because elaboration diagnostics need
-- dataflow analysis, which is not available. This behavior parallels that
-- of the old ABE mechanism.
Enable_128bit_Types : Boolean := False;
-- GNAT
-- Set to True to enable the support for 128-bit types in the compiler.
-- The prerequisite is a 64-bit target that supports 128-bit computation.
-- WARNING: There is a matching C declaration of this variable in fe.h
Error_Msg_Line_Length : Nat := 0;
-- GNAT
-- Records the error message line length limit. If this is set to zero,
-- then we get the old style behavior, in which each call to the error
-- message routines generates one line of output as a separate message.
-- If it is set to a non-zero value, then continuation lines are folded
-- to make a single long message, and then this message is split up into
-- multiple lines not exceeding the specified length. Set by -gnatj=nn.
Error_To_Warning : Boolean := False;
-- GNAT
-- If True, then certain error messages (e.g. parameter overlap messages
-- for procedure calls in Ada 2012 mode) are treated as warnings instead
-- of errors. Set by debug flag -gnatd.E. A search for Error_To_Warning
-- will identify affected messages.
Exception_Handler_Encountered : Boolean := False;
-- GNAT
-- This flag is set true if the parser encounters an exception handler.
-- It is used to set Warn_On_Exception_Propagation True if the restriction
-- No_Exception_Propagation is set.
Exception_Extra_Info : Boolean := False;
-- GNAT
-- True when switch -gnateE is used. When True, generate extra information
-- associated with exception messages (in particular range and index
-- checks).
-- WARNING: There is a matching C declaration of this variable in fe.h
Exception_Locations_Suppressed : Boolean := False;
-- GNAT
-- Set to True if a Suppress_Exception_Locations configuration pragma is
-- currently active.
-- WARNING: There is a matching C declaration of this variable in fe.h
type Exception_Mechanism_Type is
-- Determines the kind of mechanism used to handle exceptions
--
(Front_End_SJLJ,
-- Exceptions use setjmp/longjmp generated explicitly by the front end
-- (this includes gigi or other equivalent parts of the code generator).
-- AT END handlers are converted into exception handlers by the front
-- end in this mode.
Back_End_ZCX,
-- Exceptions are handled by the back end. The front end simply
-- generates the handlers as they appear in the source, and AT END
-- handlers are left untouched (they are not converted into exception
-- handlers when operating in this mode). Propagation is performed
-- using a frame unwinding scheme and requires no particular setup code
-- at handler sites on regular execution paths.
Back_End_SJLJ);
-- Similar to Back_End_ZCX with respect to the front-end processing
-- of regular and AT-END handlers. A setjmp/longjmp scheme is used to
-- propagate and setup handler contexts on regular execution paths.
pragma Convention (C, Exception_Mechanism_Type);
-- WARNING: There is a matching C declaration of this type in fe.h
Exception_Mechanism : Exception_Mechanism_Type := Front_End_SJLJ;
-- GNAT
-- Set to the appropriate value depending on the flags in system.ads
-- (Frontend_Exceptions + ZCX_By_Default). The C convention is there to
-- allow access by gigi.
-- WARNING: There is a matching C declaration of this variable in fe.h
function Back_End_Exceptions return Boolean;
function Front_End_Exceptions return Boolean;
function ZCX_Exceptions return Boolean;
function SJLJ_Exceptions return Boolean;
-- GNAT
-- Various properties of the active Exception_Mechanism
-- WARNING: There is a matching C declaration of these subprograms in fe.h
Exception_Tracebacks : Boolean := False;
-- GNATBIND
-- Set to True to store tracebacks in exception occurrences (-Ea or -E)
Exception_Tracebacks_Symbolic : Boolean := False;
-- GNATBIND
-- Set to True to store tracebacks in exception occurrences and enable
-- symbolic tracebacks (-Es).
Expand_Nonbinary_Modular_Ops : Boolean := False;
-- Set to True to convert nonbinary modular additions into code
-- that relies on the front-end expansion of operator Mod.
Extensions_Allowed : Boolean := False;
-- GNAT
-- Set to True by switch -gnatX if GNAT specific language extensions
-- are allowed. See GNAT RM for details.
type External_Casing_Type is (
As_Is, -- External names cased as they appear in the Ada source
Uppercase, -- External names forced to all uppercase letters
Lowercase); -- External names forced to all lowercase letters
External_Name_Imp_Casing : External_Casing_Type := Lowercase;
-- GNAT
-- The setting of this flag determines the casing of external names
-- when the name is implicitly derived from an entity name (i.e. either
-- no explicit External_Name or Link_Name argument is used, or, in the
-- case of extended DEC pragmas, the external name is given using an
-- identifier. The As_Is setting is not permitted here (since this would
-- create Ada source programs that were case sensitive).
External_Name_Exp_Casing : External_Casing_Type := As_Is;
-- GNAT
-- The setting of this flag determines the casing of an external name
-- specified explicitly with a string literal. As_Is means the string
-- literal is used as given with no modification to the casing. If
-- Lowercase or Uppercase is set, then the string is forced to all
-- lowercase or all uppercase letters as appropriate. Note that this
-- setting has no effect if the external name is given using an identifier
-- in the case of extended DEC import/export pragmas (in this case the
-- casing is controlled by External_Name_Imp_Casing), and also has no
-- effect if an explicit Link_Name is supplied (a link name is always
-- used exactly as given).
External_Unit_Compilation_Allowed : Boolean := False;
-- GNATMAKE
-- When True (set by gnatmake switch -x), allow compilation of sources
-- that are not part of any project file.
Fast_Math : Boolean := False;
-- GNAT
-- Indicates the current setting of Fast_Math mode, as set by the use
-- of a Fast_Math pragma (set True by Fast_Math (On)).
Force_ALI_File : Boolean := False;
-- GNAT
-- Force generation of ALI file even if errors are encountered.
-- Set on by use of -gnatQ.
Disable_ALI_File : Boolean := False;
-- GNAT
-- Disable generation of ALI file
Follow_Links_For_Files : Boolean := False;
-- PROJECT MANAGER
-- Set to True (-eL) to process the project files in trusted mode. If
-- Follow_Links is False, it is assumed that the project doesn't contain
-- any file duplicated through symbolic links (although the latter are
-- still valid if they point to a file which is outside of the project),
-- and that no directory has a name which is a valid source name.
Follow_Links_For_Dirs : Boolean := False;
-- PROJECT MANAGER
-- Set to True if directories can be links in this project, and therefore
-- additional system calls must be performed to ensure that we always see
-- the same full name for each directory.
Force_Checking_Of_Elaboration_Flags : Boolean := False;
-- GNATBIND
-- True if binding with forced checking of the elaboration flags
-- (-F switch set).
Force_Compilations : Boolean := False;
-- GNATMAKE, GPRBUILD
-- Set to force recompilations even when the objects are up-to-date.
Force_Elab_Order_File : String_Ptr := null;
-- GNATBIND
-- File name specified for -f switch (the forced elaboration order file)
Front_End_Inlining : Boolean := False;
-- GNAT
-- Set True to activate inlining by front-end expansion (even on GCC
-- targets, where inlining is normally handled by the back end). Set by
-- the flag -gnatN (which is now considered obsolescent, since the GCC
-- back end can do a better job of inlining than the front end these days).
Full_Path_Name_For_Brief_Errors : Boolean := False;
-- PROJECT MANAGER
-- When True, in Brief_Output mode, each error message line will start with
-- the full path name of the source. When False, only the file name without
-- directory information is used.
Full_List : Boolean := False;
-- GNAT
-- Set True to generate full source listing with embedded errors
Full_List_File_Name : String_Ptr := null;
-- GNAT
-- Set to file name to generate full source listing to named file (or if
-- the name is of the form .xxx, then to name.xxx where name is the source
-- file name with extension stripped.
Generate_C_Code : Boolean := False;
-- GNAT, GNATBIND
-- If True, the Cprint circuitry to generate C code output is activated.
-- Set True by use of -gnateg or -gnatd.V for GNAT, and -G for GNATBIND.
Generate_CodePeer_Messages : Boolean := False;
-- GNAT
-- Generate CodePeer messages. Ignored if CodePeer_Mode is false. This is
-- turned on by -gnateC.
Generate_Processed_File : Boolean := False;
-- GNAT
-- True when switch -gnateG is used. When True, create in a file
-- <source>.prep, if the source is preprocessed.
Generate_SCIL : Boolean := False;
-- GNAT
-- Set True to activate SCIL code generation.
Generate_SCO : Boolean := False;
-- GNAT
-- True when switch -fdump-scos (or -gnateS) is used. When True, Source
-- Coverage Obligation (SCO) information is generated and output in the ALI
-- file. See unit Par_SCO for full details.
Generate_SCO_Instance_Table : Boolean := False;
-- GNAT
-- True when switch -fdump-scos is used. When True, a table of instances is
-- included in SCOs.
-- WARNING: There is a matching C declaration of this variable in fe.h
Generating_Code : Boolean := False;
-- GNAT
-- True if the frontend finished its work and has called the backend to
-- process the tree and generate the object file.
type Ghost_Mode_Type is (None, Check, Ignore);
-- Possible legal modes that can be set by aspect/pragma Ghost as well as
-- value None, which indicates that no such aspect/pragma applies.
Ghost_Mode : Ghost_Mode_Type := None;
-- GNAT
-- The current Ghost mode in effect
Global_Discard_Names : Boolean := False;
-- GNAT, GNATBIND
-- True if a pragma Discard_Names appeared as a configuration pragma for
-- the current compilation unit.
GNAT_Encodings : Int;
pragma Import (C, GNAT_Encodings, "gnat_encodings");
-- Constant controlling the balance between GNAT encodings and standard
-- DWARF to emit in the debug information. It accepts the following values.
DWARF_GNAT_Encodings_All : constant Int := 0;
DWARF_GNAT_Encodings_GDB : constant Int := 1;
DWARF_GNAT_Encodings_Minimal : constant Int := 2;
Identifier_Character_Set : Character;
-- GNAT
-- This variable indicates the character set to be used for identifiers.
-- The possible settings are:
-- '1' Latin-1 (ISO-8859-1)
-- '2' Latin-2 (ISO-8859-2)
-- '3' Latin-3 (ISO-8859-3)
-- '4' Latin-4 (ISO-8859-4)
-- '5' Latin-Cyrillic (ISO-8859-5)
-- '9' Latin-9 (ISO-8859-15)
-- 'p' PC (US, IBM page 437)
-- '8' PC (European, IBM page 850)
-- 'f' Full upper set (all distinct)
-- 'n' No upper characters (Ada 83 rules)
-- 'w' Latin-1 plus wide characters allowed in identifiers
--
-- The setting affects the set of letters allowed in identifiers and the
-- upper/lower case equivalences. It does not affect the interpretation of
-- character and string literals, which are always stored using the actual
-- coding in the source program. This variable is initialized to the
-- default value appropriate to the system (in Osint.Initialize), and then
-- reset if a command line switch is used to change the setting.
Ignore_Rep_Clauses : Boolean := False;
-- GNAT
-- Set True to ignore all representation clauses. Useful when compiling
-- code from foreign compilers for checking purposes. Can be
-- set True by use of -gnatI.
Ignore_SPARK_Mode_Pragmas_In_Instance : Boolean := False;
-- GNAT
-- Set True to ignore the semantics and effects of pragma SPARK_Mode when
-- the pragma appears inside an instance whose enclosing context is subject
-- to SPARK_Mode "off". This property applies to nested instances.
Ignore_Style_Checks_Pragmas : Boolean := False;
-- GNAT
-- Set True to ignore all Style_Checks pragmas. Can be set True by use
-- of -gnateY.
Ignore_Unrecognized_VWY_Switches : Boolean := False;
-- GNAT
-- Set True to ignore unrecognized y, V, w switches. Can be set True by
-- use of -gnateu, causing subsequent unrecognized switches to result in
-- a warning rather than an error.
Ignored_Ghost_Region : Node_Id := Empty;
-- GNAT
-- The start of the current ignored Ghost region. This value must always
-- reflect the starting node of the outermost ignored Ghost region. If a
-- nested ignored Ghost region is entered, the value must remain unchanged.
Implementation_Unit_Warnings : Boolean := True;
-- GNAT
-- Set True to active warnings for use of implementation internal units.
-- Modified by use of -gnatwi/-gnatwI.
Implicit_Packing : Boolean := False;
-- GNAT
-- If set True, then a Size attribute clause on an array is allowed to
-- cause implicit packing instead of generating an error message. Set by
-- use of pragma Implicit_Packing.
Include_Subprogram_In_Messages : Boolean := False;
-- GNAT
-- Set True to include the enclosing subprogram in compiler messages.
Ineffective_Inline_Warnings : Boolean := False;
-- GNAT
-- Set True to activate warnings if front-end inlining (-gnatN) is not able
-- to actually inline a particular call (or all calls). Can be controlled
-- by use of -gnatwp/-gnatwP. Also set True to activate warnings if
-- frontend inlining is not able to inline a subprogram expected to
-- be inlined in GNATprove mode.
Init_Or_Norm_Scalars : Boolean := False;
-- GNAT, GNATBIND
-- Set True if a pragma Initialize_Scalars applies to the current unit.
-- Also set True if a pragma Restriction (Normalize_Scalars) applies.
Initialize_Scalars : Boolean := False;
-- GNAT
-- Set True if a pragma Initialize_Scalars applies to the current unit.
-- Note that Init_Or_Norm_Scalars is also set to True if this is True.
Initialize_Scalars_Mode1 : Character := 'I';
Initialize_Scalars_Mode2 : Character := 'N';
-- GNATBIND
-- Set to two characters from -S switch (IN/LO/HI/EV/xx). The default
-- is IN (invalid values), used if no -S switch is used.
Inline_Active : Boolean := False;
-- GNAT
-- Set True to activate pragma Inline processing across modules. Default
-- for now is not to inline across module boundaries.
Inline_Level : Nat := 0;
-- GNAT
-- Set to indicate the inlining level: 0 means that an appropriate value is
-- to be computed by the compiler based on the optimization level (-gnatn),
-- 1 is for moderate inlining across modules (-gnatn1) and 2 for full
-- inlining across modules (-gnatn2).
Interface_Library_Unit : Boolean := False;
-- GNATBIND
-- Set to True to indicate that at least one ALI file is an interface ALI:
-- then elaboration flag checks are to be generated in the binder
-- generated file.
Invalid_Value_Used : Boolean := False;
-- GNAT
-- Set True if a valid Invalid_Value attribute is encountered
Inline_Processing_Required : Boolean := False;
-- GNAT
-- Set True if inline processing is required. Inline processing is required
-- if an active Inline pragma is processed. The flag is set for a pragma
-- Inline or Inline_Always that is actually active.
In_Place_Mode : Boolean := False;
-- GNATMAKE
-- Set True to store ALI and object files in place i.e. in the object
-- directory if these files already exist or in the source directory
-- if not.
Keep_Going : Boolean := False;
-- GNATMAKE, GPRBUILD
-- When True signals to ignore compilation errors and keep processing
-- sources until there is no more work.
Keep_Temporary_Files : Boolean := False;
-- GNATCMD, GNATMAKE, GPRBUILD
-- When True the temporary files are not deleted. Set by switches -dn or
-- --keep-temp-files.
Leap_Seconds_Support : Boolean := False;
-- GNATBIND
-- Set to True to enable leap seconds support in Ada.Calendar and its
-- children. Set by -y.
Legacy_Elaboration_Checks : Boolean := False;
-- GNAT
-- Set to True when the pre-18.x access-before-elaboration model is to be
-- used. Modified by use of -gnatH.
Legacy_Elaboration_Order : Boolean := False;
-- GNATBIND
-- Set to True when the pre-20.x elaboration-order model is to be used.
-- Modified by use of -H.
Link_Only : Boolean := False;
-- GNATMAKE, GPRBUILD
-- Set to True to skip compile and bind steps (except when Bind_Only is
-- set to True).
List_Body_Required_Info : Boolean := False;
-- GNATMAKE
-- List info messages about why a package requires a body. Modified by use
-- of -gnatw.y/.Y.
List_Inherited_Aspects : Boolean := False;
-- GNAT
-- List inherited invariants, preconditions, and postconditions from
-- Invariant'Class, Pre'Class, and Post'Class aspects. Also list inherited
-- subtype predicates. Modified by use of -gnatw.l/.L.
List_Restrictions : Boolean := False;
-- GNATBIND
-- Set to True to list restrictions pragmas that could apply to partition
List_Units : Boolean := False;
-- GNAT
-- List units in the active library for a compilation (-gnatu switch)
List_Closure : Boolean := False;
-- GNATBIND
-- List all sources in the closure of a main (-R or -Ra gnatbind switch)
List_Closure_All : Boolean := False;
-- GNATBIND
-- List all sources in closure of main including run-time units (-Ra
-- gnatbind switch).
List_Dependencies : Boolean := False;
-- GNATMAKE
-- When True gnatmake verifies that the objects are up to date and outputs
-- the list of object dependencies (-M switch). Output depends if -a switch
-- is used or not. This list can be used directly in a Makefile.
List_Representation_Info : Int range 0 .. 4 := 0;
-- GNAT
-- Set non-zero by -gnatR switch to list representation information.
-- The settings are as follows:
--
-- 0 = no listing of representation information (default as above)
-- 1 = list rep info for user-defined record and array types
-- 2 = list rep info for all user-defined types and objects
-- 3 = like 2, but variable fields are decoded symbolically
-- 4 = like 3, but list rep info for relevant compiler-generated types
-- WARNING: There is a matching C declaration of this variable in fe.h
List_Representation_Info_To_File : Boolean := False;
-- GNAT
-- Set true by -gnatRs switch. Causes information from -gnatR[1-4]m to be
-- written to file.rep (where file is the name of the source file) instead
-- of stdout. For example, if file x.adb is compiled using -gnatR2s then
-- representation info is written to x.adb.ref.
List_Representation_Info_To_JSON : Boolean := False;
-- GNAT
-- Set true by -gnatRj switch. Causes information from -gnatR[1-4]m to be
-- output in the JSON data interchange format.
List_Representation_Info_Mechanisms : Boolean := False;
-- GNAT
-- Set true by -gnatRm switch. Causes information on mechanisms to be
-- included in the representation output information.
List_Representation_Info_Extended : Boolean := False;
-- GNAT
-- Set true by -gnatRe switch. Causes extended information for record types
-- to be included in the representation output information.
List_Preprocessing_Symbols : Boolean := False;
-- GNAT, GNATPREP
-- Set to True if symbols for preprocessing a source are to be listed
-- before preprocessing occurs. Set to True by switch -s of gnatprep or
-- -s in preprocessing data file for the compiler.
XDR_Stream : Boolean := False;
-- GNATBIND
-- Set to True to enable XDR in s-stratt.adb. Set by -xdr.
type Create_Repinfo_File_Proc is access procedure (Src : String);
type Write_Repinfo_Line_Proc is access procedure (Info : String);
type Close_Repinfo_File_Proc is access procedure;
-- Types used for procedure addresses below
Create_Repinfo_File_Access : Create_Repinfo_File_Proc := null;
Write_Repinfo_Line_Access : Write_Repinfo_Line_Proc := null;
Close_Repinfo_File_Access : Close_Repinfo_File_Proc := null;
-- GNAT
-- These three locations are left null when operating in non-compiler (e.g.
-- ASIS mode), but when operating in compiler mode, they are set to point
-- to the three corresponding procedures in Osint-C. The reason for this
-- slightly strange interface is to stop Repinfo from dragging in Osint in
-- ASIS mode, which would include lots of unwanted units in the ASIS build.
-- ??? Revisit this now that ASIS mode is gone.
type Create_List_File_Proc is access procedure (S : String);
type Write_List_Info_Proc is access procedure (S : String);
type Close_List_File_Proc is access procedure;
-- Types used for procedure addresses below
Create_List_File_Access : Create_List_File_Proc := null;
Write_List_Info_Access : Write_List_Info_Proc := null;
Close_List_File_Access : Close_List_File_Proc := null;
-- GNAT
-- These three locations are left null when operating in non-compiler
-- (e.g. from the binder), but when operating in compiler mode, they are
-- set to point to the three corresponding procedures in Osint-C. The
-- reason for this slightly strange interface is to prevent Repinfo
-- from dragging in Osint-C in the binder, which would include unwanted
-- units in the binder.
Locking_Policy : Character := ' ';
-- GNAT, GNATBIND
-- Set to ' ' for the default case (no locking policy specified). Otherwise
-- set based on the pragma Locking_Policy:
-- Ceiling_Locking: 'C'
-- Concurrent_Readers_Locking: 'R'
-- Inheritance_Locking: 'I'
Locking_Policy_Sloc : Source_Ptr := No_Location;
-- GNAT, GNATBIND
-- Remember location of previous Locking_Policy pragma. This is used for
-- inconsistency error messages. A value of System_Location is used if the
-- policy is set in package System.
Look_In_Primary_Dir : Boolean := True;
-- GNAT, GNATBIND, GNATMAKE, GNATCLEAN
-- Set to False if a -I- was present on the command line. When True we are
-- allowed to look in the primary directory to locate other source or
-- library files.
Make_Steps : Boolean := False;
-- GNATMAKE
-- Set to True when either Compile_Only, Bind_Only or Link_Only is
-- set to True.
Main_Index : Int := 0;
-- GNATMAKE
-- This is set to non-zero by gnatmake switch -eInnn to indicate that
-- the main program is the nnn unit in a multi-unit source file.
Mapping_File_Name : String_Ptr := null;
-- GNAT
-- File name of mapping between unit names, file names and path names.
-- (given by switch -gnatem)
Maximum_Messages : Int := 9999;
-- GNAT, GNATBIND
-- Maximum default number of errors before compilation is terminated, or in
-- the case of GNAT, maximum number of warnings before further warnings are
-- suppressed. Can be overridden by -gnatm (GNAT) or -m (GNATBIND) switch.
Maximum_File_Name_Length : Int;
-- GNAT, GNATBIND
-- Maximum number of characters allowed in a file name, not counting the
-- extension, as set by the appropriate switch. If no switch is given,
-- then this value is initialized by Osint to the appropriate value.
Maximum_Instantiations : Int := 8000;
-- GNAT
-- Maximum number of instantiations permitted (to stop runaway cases
-- of nested instantiations). These situations probably only occur in
-- specially concocted test cases. Can be modified by -gnateinn switch.
Maximum_Processes : Positive := 1;
-- GNATMAKE, GPRBUILD
-- Maximum number of processes that should be spawned to carry out
-- compilations.
Minimal_Binder : Boolean := False;
-- GNATBIND
-- Set to True to suppress the generation of objects by the binder that
-- are not strictly required for a program to run. Intended for ZFP
-- applications that have tight memory constraints.
Minimal_Recompilation : Boolean := False;
-- GNATMAKE
-- Set to True if minimal recompilation mode requested
Minimize_Expression_With_Actions : Boolean := False;
-- GNAT
-- If True, minimize the use of N_Expression_With_Actions node.
-- This can be used in particular on some back-ends where this node is
-- difficult to support.
Modify_Tree_For_C : Boolean := False;
-- GNAT
-- If this switch is set True (currently it is set only by -gnatd.V), then
-- certain meaning-preserving transformations are applied to the tree to
-- make it easier to interface with back ends that implement C semantics.
-- There is a section in Sinfo which describes the transformations made.
Multiple_Unit_Index : Int := 0;
-- GNAT
-- This is set non-zero if the current unit is being compiled in multiple
-- unit per file mode, meaning that the current unit is selected from the
-- sequence of units in the current source file, using the value stored
-- in this variable (e.g. 2 = select second unit in file). A value of
-- zero indicates that we are in normal (one unit per file) mode.
No_Backup : Boolean := False;
-- GNATNAME
-- Do not create backup copies of project files. Set by switch --no-backup.
No_Component_Reordering : Boolean := False;
-- GNAT
-- Set True if pragma No_Component_Reordering with no parameter encountered
No_Deletion : Boolean := False;
-- GNATPREP
-- Set by preprocessor switch -a. Do not eliminate any source text. Implies
-- Undefined_Symbols_Are_False. Useful to perform a syntax check on all
-- branches of #if constructs.
No_Elab_Code_All_Pragma : Node_Id := Empty;
-- Set to point to a No_Elaboration_Code_All pragma or aspect encountered
-- in the spec of the extended main unit. Used to determine if we need to
-- do special tests for violation of this aspect.
No_Heap_Finalization_Pragma : Node_Id := Empty;
-- GNAT
-- Set to point to a No_Heap_Finalization pragma defined in a configuration
-- file.
No_Main_Subprogram : Boolean := False;
-- GNATMAKE, GNATBIND
-- Set to True if compilation/binding of a program without main
-- subprogram requested.
No_Run_Time_Mode : Boolean := False;
-- GNAT, GNATBIND
-- This flag is set True if a No_Run_Time pragma is encountered. See spec
-- of Rtsfind for a full description of handling of this pragma.
No_Split_Units : Boolean := False;
-- GPRBUILD
-- Set to True with switch --no-split-units. When True, unit sources, spec,
-- body and subunits, must all be in the same project. This is checked
-- after each compilation.
No_Stdinc : Boolean := False;
-- GNAT, GNATBIND, GNATMAKE, GNATFIND, GNATXREF
-- Set to True if no default source search dirs added to search list.
No_Stdlib : Boolean := False;
-- GNATMAKE, GNATBIND, GNATFIND, GNATXREF
-- Set to True if no default library search dirs added to search list.
No_Strict_Aliasing : Boolean := False;
-- GNAT
-- Set True if pragma No_Strict_Aliasing with no parameters encountered.
-- WARNING: There is a matching C declaration of this variable in fe.h
No_Tagged_Streams : Node_Id := Empty;
-- GNAT
-- If a pragma No_Tagged_Streams is active for the current scope, this
-- points to the corresponding pragma.
Nodes_Size_In_Meg : Nat := 0;
-- GNAT
-- Amount of memory to allocate for all nodes, in units of 2**20 bytes.
-- Set by the -gnaten switch; 0 means -gnaten was not given, and a default
-- value should be used.
Normalize_Scalars : Boolean := False;
-- GNAT, GNATBIND
-- Set True if a pragma Normalize_Scalars applies to the current unit.
-- Note that Init_Or_Norm_Scalars is also set to True if this is True.
Object_Directory_Present : Boolean := False;
-- GNATMAKE
-- Set to True when an object directory is specified with option -D
Object_Path_File_Name : String_Ptr := null;
-- GNAT2WHY
-- Path of the temporary file that contains a list of object directories
-- passed by -gnateO=<obj_path_file>.
One_Compilation_Per_Obj_Dir : Boolean := False;
-- GNATMAKE, GPRBUILD
-- Set to True with switch --single-compile-per-obj-dir. When True, there
-- cannot be simultaneous compilations with the object files in the same
-- object directory, if project files are used.
type Operating_Mode_Type is (Check_Syntax, Check_Semantics, Generate_Code);
pragma Ordered (Operating_Mode_Type);
Operating_Mode : Operating_Mode_Type := Generate_Code;
-- GNAT
-- Indicates the operating mode of the compiler. The default is generate
-- code, which runs the parser, semantics and backend. Switches can be
-- used to set syntax checking only mode, or syntax and semantics checking
-- only mode. Operating_Mode can also be modified as a result of detecting
-- errors during the compilation process. In particular if any serious
-- error is detected then this flag is reset from Generate_Code to
-- Check_Semantics after generating an error message. This is an ordered
-- type with the semantics that each value does more than the previous one.
Optimize_Alignment : Character := 'O';
-- GNAT
-- Setting of Optimize_Alignment, set to T/S/O for time/space/off. Can
-- be modified by use of pragma Optimize_Alignment.
Optimize_Alignment_Local : Boolean := False;
-- GNAT
-- Set True if Optimize_Alignment mode is set by a local configuration
-- pragma that overrides the gnat.adc (or other configuration file) default
-- so that the unit is not dependent on the default setting. Also always
-- set True for internal units, since these always have a default setting
-- of Optimize_Alignment (Off) that is enforced (essentially equivalent to
-- them all having such an explicit pragma in each unit).
Original_Operating_Mode : Operating_Mode_Type := Generate_Code;
-- GNAT
-- Indicates the original operating mode of the compiler as set by compiler
-- options. This is identical to Operating_Mode except that this is not
-- affected by errors.
Optimization_Level : Int;
pragma Import (C, Optimization_Level, "optimize");
-- GNAT
-- Constant reflecting the optimization level (0,1,2,3 for -O0,-O1,-O2,-O3)
Optimize_Size : Int;
pragma Import (C, Optimize_Size, "optimize_size");
-- GNAT
-- Constant reflecting setting of -Os (optimize for size). Set to nonzero
-- in -Os mode and set to zero otherwise.
Output_File_Name_Present : Boolean := False;
-- GNATBIND, GNAT, GNATMAKE
-- Set to True when the output C file name is given with option -o for
-- GNATBIND, when the object file name is given with option -gnatO for GNAT
-- or when the executable is given with option -o for GNATMAKE.
Output_Linker_Option_List : Boolean := False;
-- GNATBIND
-- True if output of list of linker options is requested (-K switch set)
Output_ALI_List : Boolean := False;
ALI_List_Filename : String_Ptr;
-- GNATBIND
-- True if output of list of ALIs is requested (-A switch set). List is
-- output under the given filename, or standard output if not specified.
Output_Object_List : Boolean := False;
Object_List_Filename : String_Ptr;
-- GNATBIND
-- True if output of list of objects is requested (-O switch set). List is
-- output under the given filename, or standard output if not specified.
Partition_Elaboration_Policy : Character := ' ';
-- GNAT, GNATBIND
-- Set to ' ' for the default case (no elaboration policy specified). Reset
-- to first character (uppercase) of locking policy name if a valid pragma
-- Partition_Elaboration_Policy is encountered.
Partition_Elaboration_Policy_Sloc : Source_Ptr := No_Location;
-- GNAT, GNATBIND
-- Remember location of previous Partition_Elaboration_Policy pragma. This
-- is used for inconsistency error messages. A value of System_Location is
-- used if the policy is set in package System.
Persistent_BSS_Mode : Boolean := False;
-- GNAT
-- True if a Persistent_BSS configuration pragma is in effect, causing
-- potentially persistent data to be placed in the persistent_bss section.
Pessimistic_Elab_Order : Boolean := False;
-- GNATBIND
-- True if pessimistic elaboration order is to be chosen (-p switch set)
Prefix_Exception_Messages : Boolean := False;
-- GNAT
-- Set True to prefix exception messages with entity-name:
Preprocessing_Data_File : String_Ptr := null;
-- GNAT
-- Set by switch -gnatep=. The file name of the preprocessing data file.
Preprocessing_Symbol_Defs : String_List_Access := new String_List (1 .. 4);
-- An extensible array to temporarily stores symbol definitions specified
-- on the command line with -gnateD switches. The value 4 is an arbitrary
-- starting point, if more space is needed it is allocated as required.
Preprocessing_Symbol_Last : Natural := 0;
-- Index of last symbol definition in array Symbol_Definitions
Print_Generated_Code : Boolean := False;
-- GNAT
-- Set to True to enable output of generated code in source form. This
-- flag is set by the -gnatG switch.
Print_Standard : Boolean := False;
-- GNAT
-- Set to true to enable printing of package standard in source form.
-- This flag is set by the -gnatS switch
type Usage is (Unknown, Not_In_Use, In_Use);
Project_File_In_Use : Usage := Unknown;
-- GNAT
-- Indicates if a project file is used or not. Set to In_Use by the first
-- SFNP pragma.
Quantity_Of_Default_Size_Sec_Stacks : Int := -1;
-- GNATBIND
-- The number of default sized secondary stacks that the binder should
-- generate. Allows ZFP users to have the binder generate extra stacks if
-- needed to support multithreaded applications. A value of -1 indicates
-- that no size was set by the binder.
Queuing_Policy : Character := ' ';
-- GNAT, GNATBIND
-- Set to ' ' for the default case (no queuing policy specified). Reset to
-- first character (uppercase) of locking policy name if a valid
-- Queuing_Policy pragma is encountered.
Queuing_Policy_Sloc : Source_Ptr := No_Location;
-- GNAT, GNATBIND
-- Remember location of previous Queuing_Policy pragma. This is used for
-- inconsistency error messages. A value of System_Location is used if the
-- policy is set in package System.
Quiet_Output : Boolean := False;
-- GNATMAKE, GNATCLEAN, GPRBUILD, GPRCLEAN
-- Set to True if the tool should not have any output if there are no
-- errors or warnings.
Overriding_Renamings : Boolean := False;
-- GNAT
-- Set to True to enable compatibility mode with Rational compiler, and
-- to accept renamings of implicit operations in their own scope.
Relaxed_Elaboration_Checks : Boolean := False;
-- GNAT
-- Set to True to ignore certain elaboration scenarios, thus making the
-- current ABE mechanism more permissive. This behavior is applicable to
-- both the default and the legacy ABE models. Modified by use of -gnatJ.
Relaxed_RM_Semantics : Boolean := False;
-- GNAT
-- Set to True to ignore some Ada semantic error to help parse legacy Ada
-- code for use in e.g. static analysis (such as CodePeer). This deals
-- with cases where other compilers allow illegal constructs. Tools such as
-- CodePeer are interested in analyzing code rather than enforcing legality
-- rules, so as long as these illegal constructs end up with code that can
-- be handled by the tool in question, there is no reason to reject the
-- code that is considered correct by the other compiler.
Replace_In_Comments : Boolean := False;
-- GNATPREP
-- Set to True if -C switch used.
RTS_Lib_Path_Name : String_Ptr := null;
RTS_Src_Path_Name : String_Ptr := null;
-- GNAT
-- Set to the "adalib" and "adainclude" directories of the run time
-- specified by --RTS=.
RTS_Switch : Boolean := False;
-- GNAT, GNATMAKE, GNATBIND, GNATLS, GNATFIND, GNATXREF
-- Set to True when the --RTS switch is set
Run_Path_Option : Boolean := True;
-- GNATMAKE, GNATLINK
-- Set to False when no run_path_option should be issued to the linker
Search_Directory_Present : Boolean := False;
-- GNAT
-- Set to True when argument is -I. Reset to False when next argument, a
-- search directory path is taken into account. Note that this is quite
-- different from other switches in this section in that it is only set in
-- a transitory manner as a result of scanning a -I switch with no file
-- name, and if set, is an indication that the next argument is to be
-- treated as a file name.
Sec_Stack_Used : Boolean := False;
-- GNAT, GBATBIND
-- Set True if generated code uses the System.Secondary_Stack package. For
-- the binder, set if any unit uses the secondary stack package.
Setup_Projects : Boolean := False;
-- GNAT DRIVER
-- Set to True for GNAT SETUP: the Project Manager creates nonexistent
-- object, library, and exec directories.
Shared_Libgnat : Boolean;
-- GNATBIND
-- Set to True if a shared libgnat is requested by using the -shared option
-- for GNATBIND and to False when using the -static option. The value of
-- this flag is set by Gnatbind.Scan_Bind_Arg.
Short_Circuit_And_Or : Boolean := False;
-- GNAT
-- Set True if a pragma Short_Circuit_And_Or applies to the current unit.
type SPARK_Mode_Type is (None, Off, On);
-- Possible legal modes that can be set by aspect/pragma SPARK_Mode, as
-- well as the value None, which indicates no such pragma/aspect applies.
SPARK_Mode : SPARK_Mode_Type := None;
-- GNAT
-- Current SPARK mode setting.
SPARK_Mode_Pragma : Node_Id := Empty;
-- GNAT
-- If the current SPARK_Mode (above) was set by a pragma, this records
-- the pragma that set this mode.
SPARK_Switches_File_Name : String_Ptr := null;
-- GNAT
-- Set to non-null file name by use of the -gnates switch to specify
-- SPARK (gnat2why) specific switches in the given file name.
Special_Exception_Package_Used : Boolean := False;
-- GNAT
-- Set to True if either of the unit GNAT.Most_Recent_Exception or
-- GNAT.Exception_Traces is with'ed. Used to inhibit transformation of
-- local raise statements into gotos in the presence of either package.
Sprint_Line_Limit : Nat := 72;
-- GNAT
-- Limit values for chopping long lines in Cprint/Sprint output, can be
-- reset by use of NNN parameter with -gnatG or -gnatD switches.
Stack_Checking_Enabled : Boolean := False;
-- GNAT
-- Set to indicate if stack checking is enabled for the compilation. This
-- is set directly from the value in the gcc back end in the body of the
-- gcc version of back_end.adb.
Style_Check : Boolean := False;
-- GNAT
-- Set True to perform style checks. Activates checks carried out in
-- package Style (see body of this package for details of checks). This
-- flag is set True by use of either the -gnatg or -gnaty switches, or
-- by the Style_Check pragma.
Style_Check_Main : Boolean := False;
-- GNAT
-- Set True if Style_Check was set for the main unit. This is used to
-- enable style checks for units in the main extended source that get
-- with'ed indirectly. It is set True by use of either the -gnatg or
-- -gnaty switches, but not by use of the Style_Checks pragma.
Suppress_Control_Flow_Optimizations : Boolean := False;
-- GNAT
-- Set by -fpreserve-control-flow. Suppresses control flow optimizations
-- that interfere with coverage analysis based on the object code.
System_Extend_Pragma_Arg : Node_Id := Empty;
-- GNAT
-- Set non-empty if and only if a correct Extend_System pragma was present
-- in which case it points to the argument of the pragma, and the name can
-- be located as Chars (Expression (System_Extend_Pragma_Arg)).
System_Extend_Unit : Node_Id := Empty;
-- GNAT
-- This is set to Empty if GNAT_Mode is set, since pragma Extend_System
-- is never appropriate in GNAT_Mode (and causes troubles, including
-- bogus circularities, if we try to compile the run-time library with
-- a System extension). If GNAT_Mode is not set, then System_Extend_Unit
-- is a copy of the value set in System_Extend_Pragma_Arg.
Subunits_Missing : Boolean := False;
-- GNAT
-- This flag is set true if missing subunits are detected with code
-- generation active. This causes code generation to be skipped.
Suppress_Checks : Boolean := False;
-- GNAT
-- Set to True if -gnatp (suppress all checks) switch present.
-- WARNING: There is a matching C declaration of this variable in fe.h
Suppress_Options : Suppress_Record;
-- GNAT
-- Indicates outer level setting of check suppression. This initializes
-- the settings of the outer scope level in any unit compiled. This is
-- initialized by Osint.Initialize, and further initialized by the
-- Adjust_Global_Switches flag in Gnat1drv.
Table_Factor : Int := 1;
-- GNAT
-- Factor by which all initial table sizes set in Alloc are multiplied.
-- Used in Table to calculate initial table sizes (the initial table size
-- is the value in Alloc, used as the Table_Initial parameter value,
-- multiplied by the factor given here. The default value is used if no
-- -gnatT switch appears.
Tagged_Type_Expansion : Boolean := True;
-- GNAT
-- Set True if tagged types and interfaces should be expanded by the
-- front-end. If False, the original tree is left unexpanded for tagged
-- types and dispatching calls, assuming the underlying target supports it.
Target_Dependent_Info_Read_Name : String_Ptr := null;
-- GNAT
-- Set non-null to override the normal processing in Get_Targ and set the
-- necessary information by reading the target dependent information file
-- whose name is given here (see packages Get_Targ and Set_Targ for full
-- details). Set to non-null file name by use of the -gnateT switch.
Target_Dependent_Info_Write_Name : String_Ptr := null;
-- GNAT
-- Set non-null to enable a call to Set_Targ.Write_Target_Dependent_Info
-- which writes a target independent information file (see packages
-- Get_Targ and Set_Targ for full details) using the name given by
-- this switch. Set to non-null file name by use of the -gnatet switch.
type Origin_Of_Target is (Unknown, Default, Specified);
Target_Origin : Origin_Of_Target := Unknown;
-- GPRBUILD
-- Indicates the origin of attribute Target in project files
Target_Value : String_Access := null;
-- GPRBUILD
-- Indicates the value of attribute Target in project files
Task_Dispatching_Policy : Character := ' ';
-- GNAT, GNATBIND
-- Set to ' ' for the default case (no task dispatching policy specified).
-- Reset to first character (uppercase) of task dispatching policy name
-- if a valid Task_Dispatching_Policy pragma is encountered.
Task_Dispatching_Policy_Sloc : Source_Ptr := No_Location;
-- GNAT, GNATBIND
-- Remember location of previous Task_Dispatching_Policy pragma. This is
-- used for inconsistency error messages. A value of System_Location is
-- used if the policy is set in package System.
Tasking_Used : Boolean := False;
-- Set True if any tasking construct is encountered. Used to activate the
-- output of the Q, L and T lines in ALI files.
Time_Slice_Set : Boolean := False;
-- GNATBIND
-- Set True if a pragma Time_Slice is processed in the main unit, or
-- if the -gnatTnn switch is present to set a time slice value.
Time_Slice_Value : Nat;
-- GNATBIND
-- Time slice value. Valid only if Time_Slice_Set is True, i.e. if
-- Time_Slice pragma has been processed. Set to the time slice value in
-- microseconds. Negative values are stored as zero, and the value is not
-- larger than 1_000_000_000 (1000 seconds). Values larger than this are
-- reset to this maximum. This can also be set with the -gnatTnn switch.
Tolerate_Consistency_Errors : Boolean := False;
-- GNATBIND
-- Tolerate time stamp and other consistency errors. If this flag is set to
-- True (-t), then inconsistencies result in warnings rather than errors.
Treat_Categorization_Errors_As_Warnings : Boolean := False;
-- Normally categorization errors are true illegalities. If this switch
-- is set, then such errors result in warning messages rather than error
-- messages. Set True by -gnateP (P for Pure/Preelaborate). Also set in
-- Relaxed_RM_Semantics mode since some old Ada 83 compilers treated
-- pragma Preelaborate differently.
Treat_Restrictions_As_Warnings : Boolean := False;
-- GNAT
-- Set True to treat pragma Restrictions as Restriction_Warnings. Set by
-- -gnatr switch.
Try_Semantics : Boolean := False;
-- GNAT
-- Flag set to force attempt at semantic analysis, even if parser errors
-- occur. This will probably cause blowups at this stage in the game. On
-- the other hand, most such blowups will be caught cleanly and simply
-- say compilation abandoned. This flag is set True by -gnatq or -gnatQ.
Unchecked_Shared_Lib_Imports : Boolean := False;
-- GPRBUILD
-- Set to True when shared library projects are allowed to import projects
-- that are not shared library projects. Set on by use of the switch
-- --unchecked-shared-lib-imports.
Undefined_Symbols_Are_False : Boolean := False;
-- GNAT, GNATPREP
-- Set to True by switch -u of gnatprep or -u in the preprocessing data
-- file for the compiler. Indicates that while preprocessing sources,
-- symbols that are not defined have the value FALSE.
Uneval_Old : Character := 'E';
-- GNAT
-- Set to 'E'/'W'/'A' for use of Error/Warn/Allow in a valid pragma
-- Unevaluated_Use_Of_Old. Default in the absence of the pragma is 'E'
-- for the RM default behavior of giving an error.
Unique_Error_Tag : Boolean := Tag_Errors;
-- GNAT
-- Indicates if error messages are to be prefixed by the string error:
-- Initialized from Tag_Errors, can be forced on with the -gnatU switch.
Unnest_Subprogram_Mode : Boolean := False;
-- If true, activates the circuitry for unnesting subprograms (see the spec
-- of Exp_Unst for full details). Currently set only by use of -gnatd.1.
Unreserve_All_Interrupts : Boolean := False;
-- GNAT, GNATBIND
-- Normally set False, set True if a valid Unreserve_All_Interrupts pragma
-- appears anywhere in the main unit for GNAT, or if any ALI file has the
-- corresponding attribute set in GNATBIND.
Upper_Half_Encoding : Boolean := False;
-- GNAT, GNATBIND
-- Normally set False, indicating that upper half ISO 8859-1 characters are
-- used in the normal way to represent themselves. If the wide character
-- encoding method uses the upper bit for this encoding, then this flag is
-- set True, and upper half characters in the source indicate the start of
-- a wide character sequence. Set by -gnatW or -W switches.
Use_Include_Path_File : Boolean := False;
-- GNATMAKE, GPRBUILD
-- When True, create a source search path file, even when a mapping file
-- is used.
Usage_Requested : Boolean := False;
-- GNAT, GNATBIND, GNATMAKE
-- Set to True if -h (-gnath for the compiler) switch encountered
-- requesting usage information
Use_Pragma_Linker_Constructor : Boolean := False;
-- GNATBIND
-- True if pragma Linker_Constructor applies to adainit
Use_VADS_Size : Boolean := False;
-- GNAT
-- Set to True if a valid pragma Use_VADS_Size is processed
Validity_Checks_On : Boolean := True;
-- GNAT
-- This flag determines if validity checking is on or off. The initial
-- state is on, and the required default validity checks are active. The
-- actual set of checks that is performed if Validity_Checks_On is set is
-- defined by the switches in package Validsw. The Validity_Checks_On flag
-- is controlled by pragma Validity_Checks (On | Off), and also some
-- generated compiler code (typically code that has to do with validity
-- check generation) is compiled with this flag set to False. This flag is
-- set to False by the -gnatp switch.
Verbose_Mode : Boolean := False;
-- GNAT, GNATBIND, GNATMAKE, GNATLINK, GNATLS, GNATNAME, GNATCLEAN,
-- GPRBUILD, GPRCLEAN
-- Set to True to get verbose mode (full error message text and location
-- information sent to standard output, also header, copyright and summary)
type Verbosity_Level_Type is (None, Low, Medium, High);
pragma Ordered (Verbosity_Level_Type);
Verbosity_Level : Verbosity_Level_Type := High;
-- GNATMAKE
-- Modified by gnatmake switches -v, -vl, -vm, -vh. Indicates
-- the level of verbosity of informational messages:
--
-- In Low Verbosity, the reasons why a source is recompiled, the name
-- of the executable and the reason it must be rebuilt is output.
--
-- In Medium Verbosity, additional lines are output for each ALI file
-- that is checked.
--
-- In High Verbosity, additional lines are output when the ALI file
-- is part of an Ada library, is read-only or is part of the runtime.
Warn_On_Ada_2005_Compatibility : Boolean := True;
-- GNAT
-- Set to True to generate all warnings on Ada 2005 compatibility issues,
-- including warnings on Ada 2005 obsolescent features used in Ada 2005
-- mode. Set by default, modified by use of -gnatwy/Y.
Warn_On_Ada_2012_Compatibility : Boolean := True;
-- GNAT
-- Set to True to generate all warnings on Ada 2012 compatibility issues,
-- including warnings on Ada 2012 obsolescent features used in Ada 2012
-- mode. Modified by use of -gnatwy/Y.
Warn_On_Ada_202X_Compatibility : Boolean := True;
-- GNAT
-- Set to True to generate all warnings on Ada 202X compatibility issues,
-- including warnings on Ada 202X obsolescent features used in Ada 202X
-- mode. ???There is no warning switch for this yet.
Warn_On_All_Unread_Out_Parameters : Boolean := False;
-- GNAT
-- Set to True to generate warnings in all cases where a variable is
-- modified by being passed as to an OUT formal, but the resulting value is
-- never read. The default is that this warning is suppressed. Modified
-- by use of gnatw.o/.O.
Warn_On_Assertion_Failure : Boolean := True;
-- GNAT
-- Set to True to activate warnings on assertions that can be determined
-- at compile time will always fail. Modified by use of -gnatw.a/.A.
Warn_On_Assumed_Low_Bound : Boolean := True;
-- GNAT
-- Set to True to activate warnings for string parameters that are indexed
-- with literals or S'Length, presumably assuming a lower bound of one.
-- Modified by use of -gnatww/W.
Warn_On_Atomic_Synchronization : Boolean := False;
-- GNAT
-- Set to True to generate information messages for atomic synchronization.
-- Modified by use of -gnatw.n/.N.
Warn_On_Bad_Fixed_Value : Boolean := False;
-- GNAT
-- Set to True to generate warnings for static fixed-point expression
-- values that are not an exact multiple of the small value of the type.
-- Odd by default, modified by use of -gnatwb/B.
Warn_On_Biased_Representation : Boolean := True;
-- GNAT
-- Set to True to generate warnings for size clauses, component clauses
-- and component_size clauses that force biased representation. Modified
-- by use of -gnatw.b/.B.
Warn_On_Constant : Boolean := False;
-- GNAT
-- Set to True to generate warnings for variables that could be declared
-- as constants. Modified by use of -gnatwk/K.
Warn_On_Deleted_Code : Boolean := False;
-- GNAT
-- Set to True to generate warnings for code deleted by the front end
-- for conditional statements whose outcome is known at compile time.
-- Modified by use of -gnatwt/T.
Warn_On_Dereference : Boolean := False;
-- GNAT
-- Set to True to generate warnings for implicit dereferences for array
-- indexing and record component access. Modified by use of -gnatwd/D.
Warn_On_Export_Import : Boolean := True;
-- GNAT
-- Set to True to generate warnings for suspicious use of export or
-- import pragmas. Modified by use of -gnatwx/X.
Warn_On_Elab_Access : Boolean := False;
-- GNAT
-- Set to True to generate warnings for P'Access in the case where
-- subprogram P is in the same package as the P'Access, and the P'Access is
-- evaluated at package elaboration time, and occurs before the body of P
-- has been elaborated.
Warn_On_Hiding : Boolean := False;
-- GNAT
-- Set to True to generate warnings if a declared entity hides another
-- entity. The default is that this warning is suppressed. Modified by
-- use of -gnatwh/H.
Warn_On_Modified_Unread : Boolean := False;
-- GNAT
-- Set to True to generate warnings if a variable is assigned but is never
-- read. Also controls warnings for similar cases involving out parameters,
-- but only if there is only one out parameter for the procedure involved.
-- The default is that this warning is suppressed, modified by use of
-- -gnatwm/M.
Warn_On_No_Value_Assigned : Boolean := True;
-- GNAT
-- Set to True to generate warnings if no value is ever assigned to a
-- variable that is at least partially uninitialized. Set to false to
-- suppress such warnings. The default is that such warnings are enabled.
-- Modified by use of -gnatwv/V.
Warn_On_Non_Local_Exception : Boolean := False;
-- GNAT
-- Set to True to generate warnings for non-local exception raises and also
-- handlers that can never handle a local raise. This warning is only ever
-- generated if pragma Restrictions (No_Exception_Propagation) is set. The
-- default is not to generate the warnings except that if the source has
-- at least one exception handler, and this restriction is set, and the
-- warning was not explicitly turned off, then it is turned on by default.
-- Modified by use of -gnatw.x/.X.
No_Warn_On_Non_Local_Exception : Boolean := False;
-- GNAT
-- This is set to True if the above warning is explicitly suppressed. We
-- use this to avoid turning it on by default when No_Exception_Propagation
-- restriction is set and an exception handler is present.
Warn_On_Object_Renames_Function : Boolean := False;
-- GNAT
-- Set to True to generate warnings when a function result is renamed as
-- an object. The default is that this warning is disabled. Modified by
-- use of -gnatw.r/.R.
Warn_On_Obsolescent_Feature : Boolean := False;
-- GNAT
-- Set to True to generate warnings on use of any feature in Annex or if a
-- subprogram is called for which a pragma Obsolescent applies. Modified
-- by use of -gnatwj/J.
Warn_On_Overlap : Boolean := False;
-- GNAT
-- Set to True to generate warnings when a writable actual overlaps with
-- another actual in a subprogram call. This applies only in modes before
-- Ada 2012. Starting with Ada 2012, such overlaps are illegal.
-- Modified by use of -gnatw.i/.I.
Warn_On_Questionable_Missing_Parens : Boolean := True;
-- GNAT
-- Set to True to generate warnings for cases where parentheses are missing
-- and the usage is questionable, because the intent is unclear. On by
-- default, modified by use of -gnatwq/Q.
Warn_On_Parameter_Order : Boolean := False;
-- GNAT
-- Set to True to generate warnings for cases where the argument list for
-- a call is a sequence of identifiers that match the formal identifiers,
-- but are in the wrong order.
Warn_On_Redundant_Constructs : Boolean := False;
-- GNAT
-- Set to True to generate warnings for redundant constructs (e.g. useless
-- assignments/conversions). The default is that this warning is disabled.
-- Modified by use of -gnatwr/R.
Warn_On_Reverse_Bit_Order : Boolean := True;
-- GNAT
-- Set to True to generate warning (informational) messages for component
-- clauses that are affected by non-standard bit-order. The default is
-- that this warning is enabled. Modified by -gnatw.v/.V.
Warn_On_Suspicious_Contract : Boolean := True;
-- GNAT
-- Set to True to generate warnings for suspicious contracts expressed as
-- pragmas or aspects precondition and postcondition, as well as other
-- suspicious cases of expressions typically found in contracts like
-- quantified expressions and uses of Update attribute. The default is that
-- this warning is enabled. Modified by use of -gnatw.t/.T.
Warn_On_Suspicious_Modulus_Value : Boolean := True;
-- GNAT
-- Set to True to generate warnings for suspicious modulus values. The
-- default is that this warning is enabled. Modified by -gnatw.m/.M.
Warn_On_Unchecked_Conversion : Boolean := True;
-- GNAT
-- Set to True to generate warnings for unchecked conversions that may have
-- non-portable semantics (e.g. because sizes of types differ). Modified
-- by use of -gnatwz/Z.
Warn_On_Unordered_Enumeration_Type : Boolean := False;
-- GNAT
-- Set to True to generate warnings for inappropriate uses (comparisons
-- and explicit ranges) on unordered enumeration types (which includes
-- all enumeration types for which pragma Ordered is not given). The
-- default is that this warning is disabled. Modified by -gnat.u/.U.
Warn_On_Unrecognized_Pragma : Boolean := True;
-- GNAT
-- Set to True to generate warnings for unrecognized pragmas. The default
-- is that this warning is enabled. Modified by use of -gnatwg/G.
Warn_On_Unrepped_Components : Boolean := False;
-- GNAT
-- Set to True to generate warnings for the case of components of record
-- which have a record representation clause but this component does not
-- have a component clause. Modified by use of -gnatw.c/.C.
Warn_On_Warnings_Off : Boolean := False;
-- GNAT
-- Set to True to generate warnings for use of Pragma Warnings (Off, ent),
-- where either the pragma is never used, or it could be replaced by a
-- pragma Unmodified or Unreferenced. Also generates warnings for pragma
-- Warning (Off, string) which either has no matching pragma Warning On,
-- or where no warning has been suppressed by the use of the pragma.
-- Modified by use of -gnatw.w/.W.
type Warning_Mode_Type is
(Suppress, Normal, Treat_As_Error, Treat_Run_Time_Warnings_As_Errors);
Warning_Mode : Warning_Mode_Type := Normal;
-- GNAT, GNATBIND
-- Controls treatment of warning messages. If set to Suppress, warning
-- messages are not generated at all. In Normal mode, they are generated
-- but do not count as errors. In Treat_As_Error mode, warning messages are
-- generated and treated as errors, except for warnings emitted by the
-- Compile_Time_Warning pragma. In Treat_Run_Time_Warnings_As_Errors,
-- warning messages regarding errors raised at run time are treated as
-- errors. Note that Warning_Mode = Suppress causes pragma Warnings to be
-- ignored (except for legality checks), unless we are in GNATprove_Mode,
-- which requires pragma Warnings to be stored for the formal verification
-- backend.
Wide_Character_Encoding_Method : WC_Encoding_Method := WCEM_Brackets;
-- GNAT, GNATBIND
-- Method used for encoding wide characters in the source program. See
-- description of type in unit System.WCh_Con for a list of the methods
-- that are currently supported. Note that brackets notation is always
-- recognized in source programs regardless of the setting of this
-- variable. The default setting causes only the brackets notation to be
-- recognized. If this is the main unit, this setting also controls the
-- output of the W=? parameter in the ALI file, which is used to provide
-- the default for encoding [Wide_[Wide_]]Text_IO files. For the binder,
-- the value set here overrides this main unit default.
Wide_Character_Encoding_Method_Specified : Boolean := False;
-- GNAT, GNATBIND
-- Set True if the value in Wide_Character_Encoding_Method was set as
-- a result of an explicit -gnatW? or -W? switch. False otherwise.
Xref_Active : Boolean := True;
-- GNAT
-- Set if cross-referencing is enabled (i.e. xref info in ALI files)
Zero_Formatting : Boolean := False;
-- GNATBIND
-- Do no formatting (no title, no leading spaces, no empty lines) in
-- auxiliary outputs (-e, -K, -l, -R).
----------------------------
-- Configuration Settings --
----------------------------
-- These are settings that are used to establish the mode at the start of
-- each unit. The values defined below can be affected either by command
-- line switches, or by the use of appropriate configuration pragmas in a
-- configuration pragma file (but NOT by a local use of a configuration
-- pragma in a single file).
Ada_Version_Config : Ada_Version_Type;
-- GNAT
-- This is the value of the configuration switch for the Ada 83 mode, as
-- set by the command line switches -gnat83/95/2005/2012, and possibly
-- modified by the use of configuration pragmas Ada_*. This switch is used
-- to set the initial value for Ada_Version mode at the start of analysis
-- of a unit. Note however that the setting of this flag is ignored for
-- internal and predefined units (which are always compiled in the most up
-- to date version of Ada).
Ada_Version_Pragma_Config : Node_Id;
-- This will be set nonempty if it is set by a configuration pragma
Ada_Version_Explicit_Config : Ada_Version_Type;
-- GNAT
-- This is set in the same manner as Ada_Version_Config. The difference is
-- that the setting of this flag is not ignored for internal and predefined
-- units, which for some purposes do indeed access this value, regardless
-- of the fact that they are compiled the most up to date ada version).
Assertions_Enabled_Config : Boolean;
-- GNAT
-- This is the value of the configuration switch for assertions enabled
-- mode, as possibly set by the command line switch -gnata, and possibly
-- modified by the use of the configuration pragma Assertion_Policy.
Assume_No_Invalid_Values_Config : Boolean;
-- GNAT
-- This is the value of the configuration switch for assuming "no invalid
-- values enabled" mode, as possibly set by the command line switch
-- -gnatB, and possibly modified by the use of the configuration pragma
-- Assume_No_Invalid_Values.
Check_Float_Overflow_Config : Boolean;
-- GNAT
-- Set to True to check that operations on predefined unconstrained float
-- types (e.g. Float, Long_Float) do not overflow and generate infinities
-- or invalid values. Set by the Check_Float_Overflow pragma, or by use
-- of the -gnateF switch.
Check_Policy_List_Config : Node_Id;
-- GNAT
-- This points to the list of N_Pragma nodes for Check_Policy pragmas
-- that are linked through the Next_Pragma fields, with the list being
-- terminated by Empty. The order is most recently processed first. This
-- list includes only those pragmas in configuration pragma files.
Default_Pool_Config : Node_Id := Empty;
-- GNAT
-- Same as Default_Pool above, except this is only for Default_Storage_Pool
-- pragmas that are configuration pragmas.
Default_SSO_Config : Character := ' ';
-- GNAT
-- Set if a pragma Default_Scalar_Storage_Order appears as a configuration
-- pragma. A value of ' ' means that no pragma was given, otherwise the
-- value is 'H' for High_Order_First or 'L' for Low_Order_First.
Dynamic_Elaboration_Checks_Config : Boolean := False;
-- GNAT
-- Set True for dynamic elaboration checking mode, as set by the -gnatE
-- switch or by the use of pragma Elaboration_Checking (Dynamic).
Exception_Locations_Suppressed_Config : Boolean := False;
-- GNAT
-- Set True by use of the configuration pragma Suppress_Exception_Messages
Extensions_Allowed_Config : Boolean;
-- GNAT
-- This is the flag that indicates whether extensions are allowed. It can
-- be set True either by use of the -gnatX switch, or by use of the
-- configuration pragma Extensions_Allowed (On). It is always set to True
-- for internal GNAT units, since extensions are always permitted in such
-- units.
External_Name_Exp_Casing_Config : External_Casing_Type;
-- GNAT
-- This is the value of the configuration switch that controls casing of
-- external symbols for which an explicit external name is given. It can be
-- set to Uppercase by the command line switch -gnatF, and further modified
-- by the use of the configuration pragma External_Name_Casing in the
-- gnat.adc file. This flag is used to set the initial value for
-- External_Name_Exp_Casing at the start of analyzing each unit. Note
-- however that the setting of this flag is ignored for internal and
-- predefined units (which are always compiled with As_Is mode).
External_Name_Imp_Casing_Config : External_Casing_Type;
-- GNAT
-- This is the value of the configuration switch that controls casing of
-- external symbols where the external name is implicitly given. It can be
-- set to Uppercase by the command line switch -gnatF, and further modified
-- by the use of the configuration pragma External_Name_Casing in the
-- gnat.adc file. This flag is used to set the initial value for
-- External_Name_Imp_Casing at the start of analyzing each unit. Note
-- however that the setting of this flag is ignored for internal and
-- predefined units (which are always compiled with Lowercase mode).
Fast_Math_Config : Boolean;
-- GNAT
-- This is the value of the configuration switch that controls Fast_Math
-- mode, as set by a Fast_Math pragma in configuration pragmas. It is
-- used to set the initial value of Fast_Math at the start of each new
-- compilation unit.
Initialize_Scalars_Config : Boolean;
-- GNAT
-- This is the value of the configuration switch that is set by the
-- pragma Initialize_Scalars when it appears in the gnat.adc file.
-- This switch is not set when the pragma appears ahead of a given
-- unit, so it does not affect the compilation of other units.
No_Component_Reordering_Config : Boolean;
-- GNAT
-- This is the value of the configuration switch that is set by the
-- pragma No_Component_Reordering when it appears in the gnat.adc file.
-- This flag is used to set the initial value of No_Component_Reordering
-- at the start of each compilation unit, except that it is always set
-- False for predefined units.
No_Exit_Message : Boolean := False;
-- GNATMAKE, GPRBUILD
-- Set with switch --no-exit-message. When True, if there are compilation
-- failures, the builder does not issue an exit error message.
Optimize_Alignment_Config : Character;
-- GNAT
-- This is the value of the configuration switch that controls the
-- alignment optimization mode, as set by an Optimize_Alignment pragma.
-- It is used to set the initial value of Optimize_Alignment at the start
-- of each new compilation unit, except that it is always set to 'O' (off)
-- for internal units.
Persistent_BSS_Mode_Config : Boolean;
-- GNAT
-- This is the value of the configuration switch that controls whether
-- potentially persistent data is to be placed in the persistent_bss
-- section. It can be set True by use of the pragma Persistent_BSS.
-- This flag is used to set the initial value of Persistent_BSS_Mode
-- at the start of each compilation unit, except that it is always
-- set False for predefined units.
Prefix_Exception_Messages_Config : Boolean;
-- The setting of Prefix_Exception_Messages from configuration pragmas
SPARK_Mode_Config : SPARK_Mode_Type := None;
-- GNAT
-- The setting of SPARK_Mode from configuration pragmas
SPARK_Mode_Pragma_Config : Node_Id := Empty;
-- If a SPARK_Mode pragma appeared in the configuration pragmas (setting
-- SPARK_Mode_Config appropriately), then this points to the N_Pragma node.
Uneval_Old_Config : Character;
-- GNAT
-- The setting of Uneval_Old from configuration pragmas
Use_VADS_Size_Config : Boolean;
-- GNAT
-- This is the value of the configuration switch that controls the use of
-- VADS_Size instead of Size wherever the attribute Size is used. It can
-- be set True by the use of the pragma Use_VADS_Size in the gnat.adc file.
-- This flag is used to set the initial value for Use_VADS_Size at the
-- start of analyzing each unit. Note however that the setting of this flag
-- is ignored for internal and predefined units (which are always compiled
-- with the standard Size semantics).
type Config_Switches_Type is private;
-- Type used to save values of the switches set from Config values
procedure Register_Config_Switches;
-- This procedure is called after processing the gnat.adc file and other
-- configuration pragma files to record the values of the Config switches,
-- as possibly modified by the use of command line switches and pragmas
-- appearing in these files.
procedure Restore_Config_Switches (Save : Config_Switches_Type);
-- This procedure restores a set of switch values previously saved by a
-- call to Save_Config_Switches.
function Save_Config_Switches return Config_Switches_Type;
-- Return the current state of all configuration-related attributes
procedure Set_Config_Switches
(Internal_Unit : Boolean;
Main_Unit : Boolean);
-- This procedure sets the switches to the appropriate initial values. The
-- parameter Internal_Unit is True for an internal or predefined unit, and
-- affects the way the switches are set (see above). Main_Unit is true if
-- switches are being set for the main unit or for the spec of the main
-- unit. This affects setting of the assert/debug pragma switches, which
-- are normally set false by default for an internal unit, except when the
-- internal unit is the main unit, in which case we use the command line
-- settings.
------------------------
-- Other Global Flags --
------------------------
Building_Static_Dispatch_Tables : Boolean := True;
-- This flag indicates if the backend supports generation of statically
-- allocated dispatch tables. If it is True, then the front end will
-- generate static aggregates for dispatch tables that contain forward
-- references to addresses of subprograms not seen yet, and the back end
-- must be prepared to handle this case. If it is False, then the front end
-- generates assignments to initialize the dispatch table, and there are
-- no such forward references. By default we build statically allocated
-- dispatch tables for all library-level tagged types in all platforms.
-- This behavior can be disabled using switch -gnatd.t which will set
-- this flag to False and revert to the previous dynamic behavior.
Expander_Active : Boolean := False;
-- A flag that indicates if expansion is active (True) or deactivated
-- (False). When expansion is deactivated all calls to expander routines
-- have no effect. Note that the initial setting of False is merely to
-- prevent saving of an undefined value for an initial call to the
-- Expander_Mode_Save_And_Set procedure. For more information on the use of
-- this flag, see package Expander. Indeed this flag might more logically
-- be in the spec of Expander, but it is referenced by Errout, and it
-- really seems wrong for Errout to depend on Expander.
Tagged_Seen : Boolean := False;
-- Set True by the parser if the "tagged" reserved word is seen. This is
-- needed in Exp_Put_Image (see that package for documentation).
-----------------------------------
-- Modes for Formal Verification --
-----------------------------------
GNATprove_Mode : Boolean := False;
-- Specific compiling mode targeting formal verification for those parts
-- of the input code that belong to the SPARK 2014 subset of Ada. Set True
-- by the gnat2why executable or by use of the -gnatd.F debug switch. Note
-- that this is completely separate from the SPARK restriction defined in
-- GNAT to detect violations of a subset of SPARK 2005 rules.
---------------------------
-- Error/Warning Control --
---------------------------
-- The following array would more reasonably be located in Err_Vars or
-- Errout, but we put them here to deal with licensing issues (we need
-- this to have the GPL exception licensing, since these variables and
-- subprograms are accessed from units with this licensing).
Warnings_As_Errors : array (1 .. 10_000) of String_Ptr;
-- Table for recording Warning_As_Error pragmas as they are processed. It
-- would be nicer to use Table, but there are circular elaboration problems
-- if we try to do this, and an attempt to find some other appropriately
-- licensed unit to declare this as a Table failed with various elaboration
-- circularities.
Warnings_As_Errors_Count : Natural;
-- GNAT
-- Number of entries stored in Warnings_As_Errors table
Warnings_As_Errors_Count_Config : Natural;
-- GNAT
-- Count of pattern strings stored from Warning_As_Error pragmas
---------------
-- GNAT_Mode --
---------------
GNAT_Mode : Boolean := False;
-- GNAT
-- True if compiling in GNAT system mode (-gnatg switch)
-- WARNING: There is a matching C declaration of this variable in fe.h
GNAT_Mode_Config : Boolean := False;
-- GNAT
-- True if -gnatg switch is present. GNAT_Mode may be temporary set to
-- True during the analysis of a system unit, but GNAT_Mode_Config must
-- not change once scanned and set.
-- Setting GNAT mode has the following effects on the language that is
-- accepted. Note that several of the following have the effect of changing
-- an error to a warning. But warnings are usually treated as fatal errors
-- in -gnatg mode, so to actually take advantage of such a change, it is
-- necessary to add an explicit pragma Warnings (Off) in the source and
-- this requires clear documentation of why this is necessary.
-- The identifier character set is set to 'n' (7-bit ASCII)
-- Pragma Extend_System is ignored
-- Warning_Mode is set to Treat_As_Error (-gnatwe)
-- Standard style checks are set (See Set_GNAT_Style_Check_Options)
-- Standard warnings are turned on (see Set_GNAT_Mode_Warnings)
-- The Ada version is set to Ada 2012
-- Task priorities are always allowed to be in the range Any_Priority
-- Overflow checks are suppressed, overflow checking set to strict mode
-- ALI files are always generated for predefined generic packages
-- Obsolescent feature warnings are suppressed
-- Recompilation of children of GNAT, System, Ada, Interfaces is allowed
-- The Scalar_Storage_Order attribute applies to generic types
-- Categorization errors are treated as warnings rather than errors
-- Statements in preelaborated units give warnings rather than errors
-- Private objects are allowed in preelaborated units
-- Non-static constants in preelaborated units give warnings not errors
-- The warning about component size being ignored is suppressed
-- The warning about size clauses being ignored is suppressed
-- Initializing limited types gives a warning rather than an error
-- Copying of limited objects is allowed
-- Returning objects of limited types is allowed
-- Non-static call in preelaborated unit give a warning, not an error
-- Warnings on possible elaboration errors are suppressed
-- Warnings about packing being ignored are suppressed
-- Warnings in internal units are not suppressed (they normally are)
-- The only special comment sequence allowed is --!
--------------------------
-- Private Declarations --
--------------------------
private
-- The following type is used to save and restore settings of switches in
-- Opt that represent the configuration (i.e. result of config pragmas).
-- Note that Ada_Version_Explicit is not included, since this is a sticky
-- flag that once set does not get reset, since the whole idea of this flag
-- is to record the setting for the main unit.
type Config_Switches_Type is record
Ada_Version : Ada_Version_Type;
Ada_Version_Explicit : Ada_Version_Type;
Ada_Version_Pragma : Node_Id;
Assertions_Enabled : Boolean;
Assume_No_Invalid_Values : Boolean;
Check_Float_Overflow : Boolean;
Check_Policy_List : Node_Id;
Default_Pool : Node_Id;
Default_SSO : Character;
Dynamic_Elaboration_Checks : Boolean;
Exception_Locations_Suppressed : Boolean;
Extensions_Allowed : Boolean;
External_Name_Exp_Casing : External_Casing_Type;
External_Name_Imp_Casing : External_Casing_Type;
Fast_Math : Boolean;
Initialize_Scalars : Boolean;
No_Component_Reordering : Boolean;
Normalize_Scalars : Boolean;
Optimize_Alignment : Character;
Optimize_Alignment_Local : Boolean;
Persistent_BSS_Mode : Boolean;
Prefix_Exception_Messages : Boolean;
SPARK_Mode : SPARK_Mode_Type;
SPARK_Mode_Pragma : Node_Id;
Uneval_Old : Character;
Use_VADS_Size : Boolean;
Warnings_As_Errors_Count : Natural;
end record;
-- The following declarations are for GCC version dependent flags. We do
-- not let client code in the compiler test GCC_Version directly, but
-- instead use deferred constants for relevant feature tags.
-- Note: there currently are no such constants defined in this section,
-- since the compiler front end is currently entirely independent of the
-- GCC version, which is a desirable state of affairs.
function get_gcc_version return Int;
pragma Import (C, get_gcc_version, "get_gcc_version");
GCC_Version : constant Nat := get_gcc_version;
-- GNATMAKE
-- Indicates which version of gcc is in use (3 = 3.x, 4 = 4.x). Note that
-- gcc 2.8.1 (which used to be a value of 2) is no longer supported.
end Opt;
| 44.255617 | 79 | 0.694442 |
c7cd8f9ea1642120f4f314a0056025df09741ae6 | 45 | ads | Ada | test/aircraft/test_aircraft.ads | skill-lang/skillAdaTestSuite | 279ea0c0cd489c2e39d7532a3b68c564497101e2 | [
"BSD-3-Clause"
] | 1 | 2019-02-09T22:04:10.000Z | 2019-02-09T22:04:10.000Z | test/aircraft/test_aircraft.ads | skill-lang/skillAdaTestSuite | 279ea0c0cd489c2e39d7532a3b68c564497101e2 | [
"BSD-3-Clause"
] | null | null | null | test/aircraft/test_aircraft.ads | skill-lang/skillAdaTestSuite | 279ea0c0cd489c2e39d7532a3b68c564497101e2 | [
"BSD-3-Clause"
] | null | null | null | package Test_Aircraft is
end Test_Aircraft;
| 11.25 | 24 | 0.844444 |
2f92e31503006e297b2abb8cba68d8c8c1b953ae | 6,671 | adb | Ada | source/nodes/program-nodes-object_access_types.adb | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/nodes/program-nodes-object_access_types.adb | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/nodes/program-nodes-object_access_types.adb | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | 2 | 2019-09-14T23:18:50.000Z | 2019-10-02T10:11:40.000Z | -- Copyright (c) 2019 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
package body Program.Nodes.Object_Access_Types is
function Create
(Not_Token : Program.Lexical_Elements.Lexical_Element_Access;
Null_Token : Program.Lexical_Elements.Lexical_Element_Access;
Access_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
All_Token : Program.Lexical_Elements.Lexical_Element_Access;
Constant_Token : Program.Lexical_Elements.Lexical_Element_Access;
Subtype_Indication : not null Program.Elements.Subtype_Indications
.Subtype_Indication_Access)
return Object_Access_Type is
begin
return Result : Object_Access_Type :=
(Not_Token => Not_Token, Null_Token => Null_Token,
Access_Token => Access_Token, All_Token => All_Token,
Constant_Token => Constant_Token,
Subtype_Indication => Subtype_Indication, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
function Create
(Subtype_Indication : not null Program.Elements.Subtype_Indications
.Subtype_Indication_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False;
Has_Not_Null : Boolean := False;
Has_All : Boolean := False;
Has_Constant : Boolean := False)
return Implicit_Object_Access_Type is
begin
return Result : Implicit_Object_Access_Type :=
(Subtype_Indication => Subtype_Indication,
Is_Part_Of_Implicit => Is_Part_Of_Implicit,
Is_Part_Of_Inherited => Is_Part_Of_Inherited,
Is_Part_Of_Instance => Is_Part_Of_Instance,
Has_Not_Null => Has_Not_Null, Has_All => Has_All,
Has_Constant => Has_Constant, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
overriding function Subtype_Indication
(Self : Base_Object_Access_Type)
return not null Program.Elements.Subtype_Indications
.Subtype_Indication_Access is
begin
return Self.Subtype_Indication;
end Subtype_Indication;
overriding function Not_Token
(Self : Object_Access_Type)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Not_Token;
end Not_Token;
overriding function Null_Token
(Self : Object_Access_Type)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Null_Token;
end Null_Token;
overriding function Access_Token
(Self : Object_Access_Type)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Access_Token;
end Access_Token;
overriding function All_Token
(Self : Object_Access_Type)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.All_Token;
end All_Token;
overriding function Constant_Token
(Self : Object_Access_Type)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Constant_Token;
end Constant_Token;
overriding function Has_Not_Null
(Self : Object_Access_Type)
return Boolean is
begin
return Self.Null_Token.Assigned;
end Has_Not_Null;
overriding function Has_All (Self : Object_Access_Type) return Boolean is
begin
return Self.All_Token.Assigned;
end Has_All;
overriding function Has_Constant
(Self : Object_Access_Type)
return Boolean is
begin
return Self.Constant_Token.Assigned;
end Has_Constant;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Object_Access_Type)
return Boolean is
begin
return Self.Is_Part_Of_Implicit;
end Is_Part_Of_Implicit;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Object_Access_Type)
return Boolean is
begin
return Self.Is_Part_Of_Inherited;
end Is_Part_Of_Inherited;
overriding function Is_Part_Of_Instance
(Self : Implicit_Object_Access_Type)
return Boolean is
begin
return Self.Is_Part_Of_Instance;
end Is_Part_Of_Instance;
overriding function Has_Not_Null
(Self : Implicit_Object_Access_Type)
return Boolean is
begin
return Self.Has_Not_Null;
end Has_Not_Null;
overriding function Has_All
(Self : Implicit_Object_Access_Type)
return Boolean is
begin
return Self.Has_All;
end Has_All;
overriding function Has_Constant
(Self : Implicit_Object_Access_Type)
return Boolean is
begin
return Self.Has_Constant;
end Has_Constant;
procedure Initialize
(Self : aliased in out Base_Object_Access_Type'Class) is
begin
Set_Enclosing_Element (Self.Subtype_Indication, Self'Unchecked_Access);
null;
end Initialize;
overriding function Is_Object_Access_Type_Element
(Self : Base_Object_Access_Type)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Object_Access_Type_Element;
overriding function Is_Access_Type_Element
(Self : Base_Object_Access_Type)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Access_Type_Element;
overriding function Is_Type_Definition_Element
(Self : Base_Object_Access_Type)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Type_Definition_Element;
overriding function Is_Definition_Element
(Self : Base_Object_Access_Type)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Definition_Element;
overriding procedure Visit
(Self : not null access Base_Object_Access_Type;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is
begin
Visitor.Object_Access_Type (Self);
end Visit;
overriding function To_Object_Access_Type_Text
(Self : aliased in out Object_Access_Type)
return Program.Elements.Object_Access_Types
.Object_Access_Type_Text_Access is
begin
return Self'Unchecked_Access;
end To_Object_Access_Type_Text;
overriding function To_Object_Access_Type_Text
(Self : aliased in out Implicit_Object_Access_Type)
return Program.Elements.Object_Access_Types
.Object_Access_Type_Text_Access is
pragma Unreferenced (Self);
begin
return null;
end To_Object_Access_Type_Text;
end Program.Nodes.Object_Access_Types;
| 30.18552 | 77 | 0.715935 |
ada618c3e6363f32b75d18c9b80800a9af63bd67 | 3,487 | ads | Ada | hal/src/hal-audio.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2018-05-16T03:56:39.000Z | 2019-07-31T13:53:56.000Z | hal/src/hal-audio.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | hal/src/hal-audio.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015-2016, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with Interfaces; use Interfaces;
package HAL.Audio is
type Audio_Buffer is array (Natural range <>) of Integer_16
with Component_Size => 16, Alignment => 16;
type Audio_Volume is new Natural range 0 .. 100;
type Audio_Frequency is
(Audio_Freq_8kHz,
Audio_Freq_11kHz,
Audio_Freq_16kHz,
Audio_Freq_22kHz,
Audio_Freq_44kHz,
Audio_Freq_48kHz,
Audio_Freq_96kHz)
with Size => 32;
for Audio_Frequency use
(Audio_Freq_8kHz => 8_000,
Audio_Freq_11kHz => 11_025,
Audio_Freq_16kHz => 16_000,
Audio_Freq_22kHz => 22_050,
Audio_Freq_44kHz => 44_100,
Audio_Freq_48kHz => 48_000,
Audio_Freq_96kHz => 96_000);
type Audio_Stream is limited interface;
procedure Set_Frequency (This : in out Audio_Stream;
Frequency : Audio_Frequency) is abstract;
procedure Transmit (This : in out Audio_Stream;
Data : Audio_Buffer) is abstract;
procedure Receive (This : in out Audio_Stream;
Data : out Audio_Buffer) is abstract;
end HAL.Audio;
| 49.112676 | 78 | 0.550903 |
c7f90cb022af5defb0c4f4c8b2c16f90cc9f7d2a | 8,994 | adb | Ada | boards/stm32f407_discovery/src/stm32-board.adb | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2018-05-16T03:56:39.000Z | 2019-07-31T13:53:56.000Z | boards/stm32f407_discovery/src/stm32-board.adb | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | boards/stm32f407_discovery/src/stm32-board.adb | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of STMicroelectronics nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
-- --
-- This file is based on: --
-- --
-- @file stm32f4_discovery.c --
-- @author MCD Application Team --
-- @version V1.1.0 --
-- @date 19-June-2014 --
-- @brief This file provides set of firmware functions to manage Leds --
-- and push-button available on STM32F42-Discovery Kit from --
-- STMicroelectronics. --
-- --
-- COPYRIGHT(c) 2014 STMicroelectronics --
------------------------------------------------------------------------------
with Ada.Real_Time; use Ada.Real_Time;
with STM32.Setup;
with HAL.SPI;
with LIS3DSH; use LIS3DSH;
package body STM32.Board is
------------------
-- All_LEDs_Off --
------------------
procedure All_LEDs_Off is
begin
Clear (All_LEDs);
end All_LEDs_Off;
-----------------
-- All_LEDs_On --
-----------------
procedure All_LEDs_On is
begin
Set (All_LEDs);
end All_LEDs_On;
---------------------
-- Initialize_LEDs --
---------------------
procedure Initialize_LEDs is
Configuration : GPIO_Port_Configuration;
begin
Enable_Clock (All_LEDs);
Configuration.Mode := Mode_Out;
Configuration.Output_Type := Push_Pull;
Configuration.Speed := Speed_100MHz;
Configuration.Resistors := Floating;
Configure_IO (All_LEDs,
Config => Configuration);
end Initialize_LEDs;
----------------------
-- Initialize_Audio --
----------------------
procedure Initialize_Audio is
procedure Initialize_GPIO;
---------------------
-- Initialize_GPIO --
---------------------
procedure Initialize_GPIO is
begin
-- I2S --
Enable_Clock (Audio_I2S_Points);
Configure_IO (Audio_I2S_Points,
(Speed => Speed_High,
Mode => Mode_AF,
Output_Type => Push_Pull,
Resistors => Floating));
Configure_Alternate_Function (Audio_I2S_Points, GPIO_AF_I2S3_6);
Lock (Audio_I2S_Points);
-- DAC reset --
Enable_Clock (DAC_Reset_Point);
Configure_IO (DAC_Reset_Point,
(Speed => Speed_High,
Mode => Mode_Out,
Output_Type => Push_Pull,
Resistors => Pull_Down));
Lock (DAC_Reset_Point);
end Initialize_GPIO;
Conf : I2S_Configuration;
begin
Initialize_GPIO;
STM32.Setup.Setup_I2C_Master (Port => I2C_1,
SDA => Audio_I2C_SDA,
SCL => Audio_I2C_SCL,
SDA_AF => GPIO_AF_I2C1_4,
SCL_AF => GPIO_AF_I2C1_4,
Clock_Speed => 100_000);
Set_PLLI2S_Factors (Pll_N => 258,
Pll_R => 3);
Enable_PLLI2S;
Enable_Clock (Audio_I2S);
Conf.Mode := Master_Transmit;
Conf.Standard := I2S_Philips_Standard;
Conf.Clock_Polarity := Steady_State_Low;
Conf.Data_Length := Data_16bits;
Conf.Chan_Length := Channel_16bits;
Conf.Master_Clock_Out_Enabled := True;
Conf.Transmit_DMA_Enabled := True;
Conf.Receive_DMA_Enabled := False;
Audio_I2S.Configure (Conf);
Audio_I2S.Set_Frequency (Audio_Freq_48kHz);
Audio_I2S.Enable;
DAC_Reset_Point.Clear;
delay until Clock + Microseconds (200);
DAC_Reset_Point.Set;
delay until Clock + Microseconds (200);
Audio_DAC.Init (Output => CS43L22.Headphone,
Volume => 0,
Frequency => Audio_Rate);
end Initialize_Audio;
--------------------------------
-- Configure_User_Button_GPIO --
--------------------------------
procedure Configure_User_Button_GPIO is
Config : GPIO_Port_Configuration;
begin
Enable_Clock (User_Button_Point);
Config.Mode := Mode_In;
Config.Resistors := Floating;
Configure_IO (User_Button_Point, Config);
end Configure_User_Button_GPIO;
------------------------------
-- Initialize_Accelerometer --
------------------------------
procedure Initialize_Accelerometer is
procedure Init_SPI;
procedure Init_GPIO;
--------------
-- Init_SPI --
--------------
procedure Init_SPI is
Config : SPI_Configuration;
begin
Enable_Clock (Acc_SPI);
Config.Mode := Master;
Config.Baud_Rate_Prescaler := BRP_32;
Config.Clock_Polarity := Low;
Config.Clock_Phase := P1Edge;
Config.First_Bit := MSB;
Config.CRC_Poly := 7;
Config.Slave_Management := Software_Managed; -- essential!!
Config.Direction := D2Lines_FullDuplex;
Config.Data_Size := HAL.SPI.Data_Size_8b;
Disable (Acc_SPI);
Configure (Acc_SPI, Config);
Enable (Acc_SPI);
end Init_SPI;
---------------
-- Init_GPIO --
---------------
procedure Init_GPIO is
Config : GPIO_Port_Configuration;
SPI_Points : constant GPIO_Points := Acc_SPI_MOSI_Pin &
Acc_SPI_MISO_Pin & Acc_SPI_SCK_Pin;
begin
Enable_Clock (SPI_Points);
Config.Output_Type := Push_Pull;
Config.Resistors := Floating;
Config.Speed := Speed_50MHz;
Config.Mode := Mode_AF;
Configure_IO (SPI_Points, Config);
Configure_Alternate_Function (SPI_Points, Acc_SPI_AF);
Enable_Clock (Acc_Chip_Select_Pin);
Config.Mode := Mode_Out;
Config.Output_Type := Push_Pull;
Config.Resistors := Pull_Up;
Config.Speed := Speed_25MHz;
Acc_Chip_Select_Pin.Configure_IO (Config);
Acc_Chip_Select_Pin.Set;
end Init_GPIO;
begin
Init_GPIO;
Init_SPI;
end Initialize_Accelerometer;
end STM32.Board;
| 35.270588 | 78 | 0.489993 |
add331697b7b4c9663dff0d2e85dcf95d506cfba | 289 | ada | Ada | Task/Command-line-arguments/Ada/command-line-arguments-2.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:38.000Z | 2018-11-09T22:08:38.000Z | Task/Command-line-arguments/Ada/command-line-arguments-2.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Command-line-arguments/Ada/command-line-arguments-2.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:40.000Z | 2018-11-09T22:08:40.000Z | with Ada.Wide_Wide_Text_IO;
with League.Application;
with League.Strings;
procedure Main is
begin
for J in 1 .. League.Application.Arguments.Length loop
Ada.Wide_Wide_Text_IO.Put_Line
(League.Application.Arguments.Element (J).To_Wide_Wide_String);
end loop;
end Main;
| 22.230769 | 70 | 0.761246 |
13d28d46fd052c67f39568fc526efd1bb11f97ab | 1,277 | ads | Ada | tier-1/xcb/source/thin/xcb-xcb_id_choice_error_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 2 | 2015-11-12T11:16:20.000Z | 2021-08-24T22:32:04.000Z | tier-1/xcb/source/thin/xcb-xcb_id_choice_error_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 1 | 2018-06-05T05:19:35.000Z | 2021-11-20T01:13:23.000Z | tier-1/xcb/source/thin/xcb-xcb_id_choice_error_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | null | null | null | -- This file is generated by SWIG. Please do not modify by hand.
--
with xcb.xcb_value_error_t;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_id_choice_error_t is
-- Item
--
subtype Item is xcb.xcb_value_error_t.Item;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C.size_t range <>) of aliased xcb.xcb_id_choice_error_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_id_choice_error_t.Item,
Element_Array => xcb.xcb_id_choice_error_t.Item_Array,
Default_Terminator => (others => <>));
subtype Pointer is C_Pointers.Pointer;
-- Pointer_Array
--
type Pointer_Array is
array
(Interfaces.C.size_t range <>) of aliased xcb.xcb_id_choice_error_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_id_choice_error_t.Pointer,
Element_Array => xcb.xcb_id_choice_error_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_id_choice_error_t;
| 26.604167 | 74 | 0.668755 |
06863c211dd972a584df033b193fab8a26db364e | 3,599 | ads | Ada | source/amf/uml/amf-uml-durations-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-uml-durations-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-uml-durations-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements.Generic_Hash;
function AMF.UML.Durations.Hash is
new AMF.Elements.Generic_Hash (UML_Duration, UML_Duration_Access);
| 71.98 | 78 | 0.400389 |
1a3efe4cfd78da166feaaa60dcd9b060e3fbd377 | 4,931 | ads | Ada | source/amf/uml/amf-uml-extensions-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-uml-extensions-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-uml-extensions-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Generic_Collections;
package AMF.UML.Extensions.Collections is
pragma Preelaborate;
package UML_Extension_Collections is
new AMF.Generic_Collections
(UML_Extension,
UML_Extension_Access);
type Set_Of_UML_Extension is
new UML_Extension_Collections.Set with null record;
Empty_Set_Of_UML_Extension : constant Set_Of_UML_Extension;
type Ordered_Set_Of_UML_Extension is
new UML_Extension_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_UML_Extension : constant Ordered_Set_Of_UML_Extension;
type Bag_Of_UML_Extension is
new UML_Extension_Collections.Bag with null record;
Empty_Bag_Of_UML_Extension : constant Bag_Of_UML_Extension;
type Sequence_Of_UML_Extension is
new UML_Extension_Collections.Sequence with null record;
Empty_Sequence_Of_UML_Extension : constant Sequence_Of_UML_Extension;
private
Empty_Set_Of_UML_Extension : constant Set_Of_UML_Extension
:= (UML_Extension_Collections.Set with null record);
Empty_Ordered_Set_Of_UML_Extension : constant Ordered_Set_Of_UML_Extension
:= (UML_Extension_Collections.Ordered_Set with null record);
Empty_Bag_Of_UML_Extension : constant Bag_Of_UML_Extension
:= (UML_Extension_Collections.Bag with null record);
Empty_Sequence_Of_UML_Extension : constant Sequence_Of_UML_Extension
:= (UML_Extension_Collections.Sequence with null record);
end AMF.UML.Extensions.Collections;
| 53.597826 | 78 | 0.50943 |
2e6662edd63d05ac9d8289b91e15c15160e0da9e | 20,369 | adb | Ada | src/keystore-repository-entries.adb | thierr26/ada-keystore | 25099a9df3ce9b48a401148eb1b84442011759a0 | [
"Apache-2.0"
] | null | null | null | src/keystore-repository-entries.adb | thierr26/ada-keystore | 25099a9df3ce9b48a401148eb1b84442011759a0 | [
"Apache-2.0"
] | null | null | null | src/keystore-repository-entries.adb | thierr26/ada-keystore | 25099a9df3ce9b48a401148eb1b84442011759a0 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- keystore-repository-entries -- Repository management for the keystore
-- Copyright (C) 2019 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Log.Loggers;
with Ada.IO_Exceptions;
with Ada.Unchecked_Deallocation;
with Keystore.Logs;
with Keystore.Marshallers;
-- === Directory Entries ===
-- The wallet repository block is encrypted with the wallet directory key.
--
-- ```
-- +------------------+
-- | 02 02 | 2b
-- | Encrypt size | 2b = BT_DATA_LENGTH
-- | Wallet id | 4b
-- | PAD 0 | 4b
-- | PAD 0 | 4b
-- +------------------+
-- | Next block ID | 4b Block number for next repository block with same storage
-- | Data key offset | 2b Starts at IO.Block_Index'Last, decreasing
-- +------------------+
-- | Entry ID | 4b ^
-- | Entry type | 2b | = T_STRING, T_BINARY
-- | Name size | 2b |
-- | Name | Nb | DATA_NAME_ENTRY_SIZE + Name'Length
-- | Create date | 8b |
-- | Update date | 8b |
-- | Entry size | 8b v
-- +------------------+
-- | Entry ID | 4b ^
-- | Entry type | 2b | = T_WALLET
-- | Name size | 2b |
-- | Name | Nb | DATA_NAME_ENTRY_SIZE + Name'Length
-- | Create date | 8b |
-- | Update date | 8b |
-- | Wallet lid | 4b |
-- | Wallet master ID | 4b v
-- +------------------+
-- | ... |
-- +------------------+--
-- | 0 0 0 0 | 16b (End of name entry list)
-- +------------------+--
-- | ... | (random or zero)
-- +------------------+--
-- | 0 0 0 0 | 16b (End of data key list)
-- +------------------+--
-- | ... |
-- +------------------+
-- | Storage ID | 4b ^ Repeats "Data key count" times
-- | Data block ID | 4b |
-- | Data size | 2b | DATA_KEY_ENTRY_SIZE = 58b
-- | Content IV | 16b |
-- | Content key | 32b v
-- +------------------+
-- | Entry ID | 4b ^
-- | Data key count | 2b | DATA_KEY_HEADER_SIZE = 10b
-- | Data offset | 4b v
-- +------------------+
-- | Block HMAC-256 | 32b
-- +------------------+--
-- ```
--
package body Keystore.Repository.Entries is
use type Interfaces.Unsigned_16;
use type Interfaces.Unsigned_32;
Log : constant Util.Log.Loggers.Logger
:= Util.Log.Loggers.Create ("Keystore.Repository.Entries");
procedure Free is
new Ada.Unchecked_Deallocation (Object => Wallet_Entry,
Name => Wallet_Entry_Access);
-- ------------------------------
-- Load the wallet directory block in the wallet manager buffer.
-- Extract the directory if this is the first time the data block is read.
-- ------------------------------
procedure Load_Directory (Manager : in out Wallet_Manager;
Directory : in Wallet_Directory_Entry_Access;
Into : in out IO.Marshaller) is
Btype : Interfaces.Unsigned_16;
Wid : Interfaces.Unsigned_32;
Size : IO.Block_Index;
begin
Keystore.Logs.Debug (Log, "Load directory block{0}", Directory.Block);
-- Get the directory block from the cache.
Into.Buffer := Buffers.Find (Manager.Cache, Directory.Block);
if not Buffers.Is_Null (Into.Buffer) then
return;
end if;
-- Get it from the modified list in case it has some pending changes not written yet.
Into.Buffer := Buffers.Find (Manager.Modified, Directory.Block);
if not Buffers.Is_Null (Into.Buffer) then
return;
end if;
-- Allocate block storage.
Into.Buffer := Buffers.Allocate (Directory.Block);
-- Read wallet meta data block.
Keys.Set_IV (Manager.Config.Dir, Directory.Block.Block);
Manager.Stream.Read (Decipher => Manager.Config.Dir.Decipher,
Sign => Manager.Config.Dir.Sign,
Decrypt_Size => Size,
Into => Into.Buffer);
-- Check block type.
Btype := Marshallers.Get_Header_16 (Into);
if Btype /= IO.BT_WALLET_DIRECTORY then
Logs.Error (Log, "Block{0} invalid block type", Directory.Block);
raise Keystore.Corrupted;
end if;
Marshallers.Skip (Into, 2);
-- Check that this is a block for the current wallet.
Wid := Marshallers.Get_Unsigned_32 (Into);
if Wid /= Interfaces.Unsigned_32 (Manager.Id) then
Logs.Error (Log, "Block{0} invalid block wallet identifier", Directory.Block);
raise Keystore.Corrupted;
end if;
-- This is the first time we load this directory block, scan the directory.
if not Directory.Ready then
Marshallers.Skip (Into, 8);
declare
Item : Wallet_Entry_Access;
Index : Interfaces.Unsigned_32;
Count : Interfaces.Unsigned_16;
Offset : IO.Block_Index;
Pos : Wallet_Indexs.Cursor;
Data_Key : Wallet_Data_Key_Entry;
begin
Directory.Next_Block := Marshallers.Get_Unsigned_32 (Into);
Directory.Key_Pos := Marshallers.Get_Block_Index (Into);
-- Scan each named entry
loop
Offset := Into.Pos;
Index := Marshallers.Get_Unsigned_32 (Into);
exit when Index = 0;
declare
Kind : constant Entry_Type := Marshallers.Get_Kind (Into);
Len : constant Natural := Natural (Marshallers.Get_Unsigned_16 (Into));
Name : constant String := Marshallers.Get_String (Into, Len);
begin
Item := new Wallet_Entry (Length => Len, Is_Wallet => Kind = T_WALLET);
Item.Entry_Offset := Offset;
Item.Kind := Kind;
Item.Id := Wallet_Entry_Index (Index);
Item.Create_Date := Marshallers.Get_Date (Into);
Item.Update_Date := Marshallers.Get_Date (Into);
if Kind = T_WALLET then
Item.Wallet_Id := Wallet_Identifier (Marshallers.Get_Unsigned_32 (Into));
Item.Master := Marshallers.Get_Block_Number (Into);
else
Item.Size := Marshallers.Get_Unsigned_64 (Into);
end if;
Item.Header := Directory;
Item.Name := Name;
if Item.Id >= Manager.Next_Id then
Manager.Next_Id := Item.Id + 1;
end if;
Manager.Map.Insert (Key => Name, New_Item => Item);
Manager.Entry_Indexes.Insert (Key => Item.Id, New_Item => Item);
Directory.Count := Directory.Count + 1;
exception
when others =>
Free (Item);
Logs.Error (Log, "Block{0} contains invalid data entry", Directory.Block);
raise Keystore.Corrupted;
end;
end loop;
Directory.Last_Pos := Into.Pos - 4;
-- Scan each data key entry starting from the end of the directory block
-- moving backward until we reach the directory key position. For each data entry
-- add a link to the directory block in 'Data_Blocks' list so that we can iterate
-- over that list to get the whole data content for the data entry.
Data_Key.Directory := Directory;
Offset := IO.Block_Index'Last;
while Offset > Directory.Key_Pos loop
Offset := Offset - DATA_KEY_HEADER_SIZE;
Into.Pos := Offset;
Index := Marshallers.Get_Unsigned_32 (Into);
Count := Marshallers.Get_Unsigned_16 (Into);
if Index /= 0 then
Pos := Manager.Entry_Indexes.Find (Wallet_Entry_Index (Index));
if Wallet_Indexs.Has_Element (Pos) then
Item := Wallet_Indexs.Element (Pos);
Item.Data_Blocks.Append (Data_Key);
Item.Block_Count := Item.Block_Count + Natural (Count);
end if;
end if;
-- Compute sum of sizes of every data block.
Data_Key.Size := 0;
while Count > 0 and Offset > Directory.Key_Pos loop
Offset := Offset - DATA_KEY_ENTRY_SIZE;
-- Set marshaller to the data key size position.
Into.Pos := Offset + 8;
Data_Key.Size := Data_Key.Size + Marshallers.Get_Buffer_Size (Into);
Count := Count - 1;
end loop;
end loop;
end;
if Directory.Last_Pos + 4 < Directory.Key_Pos then
Directory.Available := Directory.Key_Pos - Directory.Last_Pos - 4;
else
Directory.Available := 0;
end if;
Directory.Ready := True;
end if;
exception
when Ada.IO_Exceptions.End_Error | Ada.IO_Exceptions.Data_Error =>
Logs.Error (Log, "Block{0} cannot be read", Directory.Block);
raise Keystore.Corrupted;
end Load_Directory;
-- ------------------------------
-- Load the complete wallet directory by starting at the given block.
-- ------------------------------
procedure Load_Complete_Directory (Manager : in out Wallet_Manager;
Block : in Keystore.IO.Storage_Block) is
Next : Interfaces.Unsigned_32;
Directory : Wallet_Directory_Entry_Access;
begin
Manager.Root := Block;
Manager.Next_Id := Wallet_Entry_Index'First;
Next := Interfaces.Unsigned_32 (Block.Block);
while Next /= 0 loop
Directory := new Wallet_Directory_Entry;
Directory.Block := IO.Storage_Block '(Storage => Block.Storage,
Block => IO.Block_Number (Next));
Manager.Directory_List.Append (Directory);
Load_Directory (Manager, Directory, Manager.Current);
Next := Directory.Next_Block;
end loop;
end Load_Complete_Directory;
procedure Initialize_Directory_Block (Manager : in out Wallet_Manager;
Block : in IO.Storage_Block;
Space : in IO.Buffer_Size;
Directory : out Wallet_Directory_Entry_Access) is
begin
-- We need a new wallet directory block.
Directory := new Wallet_Directory_Entry;
Directory.Available := IO.Block_Index'Last - IO.BT_DATA_START - Space - 4 - 2;
Directory.Count := 0;
Directory.Key_Pos := IO.Block_Index'Last;
Directory.Last_Pos := IO.BT_DATA_START + 4 + 2 - 1;
Directory.Ready := True;
Directory.Block := Block;
Logs.Info (Log, "Adding directory block{0}", Directory.Block);
if not Manager.Directory_List.Is_Empty then
declare
Last : constant Wallet_Directory_Entry_Access := Manager.Directory_List.Last_Element;
begin
-- Update the last directory block to link to the new one.
Load_Directory (Manager, Last, Manager.Current);
Last.Next_Block := Interfaces.Unsigned_32 (Directory.Block.Block);
Manager.Current.Pos := IO.BT_DATA_START - 1;
Marshallers.Put_Block_Number (Manager.Current, Directory.Block.Block);
Manager.Modified.Include (Manager.Current.Buffer.Block, Manager.Current.Buffer.Data);
end;
end if;
Manager.Directory_List.Append (Directory);
end Initialize_Directory_Block;
-- ------------------------------
-- Find and load a directory block to hold a new entry that occupies the given space.
-- The first directory block that has enough space is used otherwise a new block
-- is allocated and initialized.
-- ------------------------------
procedure Find_Directory_Block (Manager : in out Wallet_Manager;
Space : in IO.Block_Index;
Directory : out Wallet_Directory_Entry_Access) is
Block : IO.Storage_Block;
begin
-- Scan for a block having enough space for us.
for Block of Manager.Directory_List loop
if Block.Available >= Space then
Block.Available := Block.Available - Space;
Block.Count := Block.Count + 1;
Directory := Block;
return;
end if;
end loop;
Manager.Stream.Allocate (IO.DIRECTORY_BLOCK, Block);
Initialize_Directory_Block (Manager, Block, Space, Directory);
Manager.Current.Buffer := Buffers.Allocate (Block);
-- Prepare the new directory block.
-- Fill the new block with random values or with zeros.
if Manager.Config.Randomize then
Manager.Random.Generate (Manager.Current.Buffer.Data.Value.Data);
else
Manager.Current.Buffer.Data.Value.Data := (others => 0);
end if;
Marshallers.Set_Header (Into => Manager.Current,
Tag => IO.BT_WALLET_DIRECTORY,
Id => Manager.Id);
Marshallers.Put_Unsigned_32 (Manager.Current, 0);
Marshallers.Put_Block_Index (Manager.Current, IO.Block_Index'Last);
Marshallers.Put_Unsigned_32 (Manager.Current, 0);
Manager.Modified.Include (Manager.Current.Buffer.Block, Manager.Current.Buffer.Data);
end Find_Directory_Block;
-- ------------------------------
-- Add a new entry in the wallet directory.
-- ------------------------------
procedure Add_Entry (Manager : in out Wallet_Manager;
Name : in String;
Kind : in Entry_Type;
Item : out Wallet_Entry_Access) is
begin
if Manager.Map.Contains (Name) then
Log.Info ("Name '{0}' is already used", Name);
raise Name_Exist;
end if;
Log.Info ("Adding data entry {0}", Name);
-- Create the new wallet entry.
Item := new Wallet_Entry (Length => Name'Length, Is_Wallet => Kind = T_WALLET);
Item.Name := Name;
Item.Create_Date := Ada.Calendar.Clock;
Item.Update_Date := Item.Create_Date;
Item.Id := Manager.Next_Id;
Item.Kind := Kind;
Manager.Next_Id := Manager.Next_Id + 1;
if Item.Is_Wallet then
Item.Wallet_Id := Manager.Next_Wallet_Id;
Manager.Next_Wallet_Id := Manager.Next_Wallet_Id + 1;
end if;
-- Find and load the directory block that can hold the new entry.
Find_Directory_Block (Manager, Entry_Size (Item), Item.Header);
-- Write the new entry at end of existing entries.
Item.Entry_Offset := Item.Header.Last_Pos;
-- Remember the last valid position for the next entry to add.
Item.Header.Last_Pos := Item.Entry_Offset + Entry_Size (Item);
Item.Header.Count := Item.Header.Count + 1;
-- Register it in the local repository.
Manager.Map.Insert (Name, Item);
Manager.Entry_Indexes.Insert (Item.Id, Item);
end Add_Entry;
-- ------------------------------
-- Update an existing entry in the wallet directory.
-- ------------------------------
procedure Update_Entry (Manager : in out Wallet_Manager;
Item : in Wallet_Entry_Access;
Kind : in Entry_Type;
Size : in Interfaces.Unsigned_64) is
begin
Item.Kind := Kind;
if not Item.Is_Wallet then
Item.Size := Size;
end if;
Item.Update_Date := Ada.Calendar.Clock;
Item.Access_Date := Item.Update_Date;
if Item.Header.Count > 0 then
-- Find and load the directory block that can hold the new entry.
Load_Directory (Manager, Item.Header, Manager.Current);
end if;
-- Write the new entry.
Manager.Current.Pos := Item.Entry_Offset;
Marshallers.Put_Unsigned_32 (Manager.Current, Interfaces.Unsigned_32 (Item.Id));
Marshallers.Put_Kind (Manager.Current, Item.Kind);
Marshallers.Put_String (Manager.Current, Item.Name);
Marshallers.Put_Date (Manager.Current, Item.Create_Date);
Marshallers.Put_Date (Manager.Current, Item.Update_Date);
if Item.Is_Wallet then
Marshallers.Put_Unsigned_32 (Manager.Current, Interfaces.Unsigned_32 (Item.Wallet_Id));
Marshallers.Put_Block_Number (Manager.Current, Item.Master);
else
Marshallers.Put_Unsigned_64 (Manager.Current, Item.Size);
end if;
pragma Assert (Check => Manager.Current.Pos = Item.Entry_Offset + Entry_Size (Item));
if Manager.Current.Pos = Item.Header.Last_Pos then
Marshallers.Put_Unsigned_32 (Manager.Current, 0);
end if;
Manager.Modified.Include (Manager.Current.Buffer.Block, Manager.Current.Buffer.Data);
end Update_Entry;
-- ------------------------------
-- Delete the entry from the repository.
-- ------------------------------
procedure Delete_Entry (Manager : in out Wallet_Manager;
Item : in Wallet_Entry_Access) is
Directory : constant Wallet_Directory_Entry_Access := Item.Header;
Size : IO.Block_Index;
End_Entry : IO.Block_Index;
begin
Keystore.Logs.Debug (Log, "Delete entry from block{0}", Directory.Block);
Directory.Count := Directory.Count - 1;
-- Load the directory block .
Load_Directory (Manager, Directory, Manager.Current);
declare
Buf : constant Buffers.Buffer_Accessor := Manager.Current.Buffer.Data.Value;
begin
-- Move the data entry.
Size := Entry_Size (Item);
End_Entry := Item.Entry_Offset + Size;
if End_Entry /= Directory.Last_Pos then
Buf.Data (Item.Entry_Offset + 1 .. Directory.Last_Pos - Size)
:= Buf.Data (End_Entry + 1 .. Directory.Last_Pos);
end if;
if Manager.Config.Randomize then
-- When strong security is necessary, fill with random values
-- (except the first 4 bytes).
Buf.Data (Directory.Last_Pos - Size + 1 .. Directory.Last_Pos - Size + 3)
:= (others => 0);
Manager.Random.Generate
(Buf.Data (Directory.Last_Pos - Size + 4 .. Directory.Last_Pos));
else
Buf.Data (Directory.Last_Pos - Size .. Directory.Last_Pos) := (others => 0);
end if;
Directory.Last_Pos := Directory.Last_Pos - Size;
Manager.Modified.Include (Manager.Current.Buffer.Block, Manager.Current.Buffer.Data);
end;
end Delete_Entry;
-- ------------------------------
-- Save the directory blocks that have been modified.
-- ------------------------------
procedure Save (Manager : in out Wallet_Manager) is
Buffer : Buffers.Storage_Buffer;
begin
while not Manager.Modified.Is_Empty loop
Buffer.Block := Manager.Modified.First_Key;
Buffer.Data := Manager.Modified.First_Element;
Manager.Modified.Delete_First;
Keys.Set_IV (Manager.Config.Dir, Buffer.Block.Block);
Manager.Stream.Write (From => Buffer,
Cipher => Manager.Config.Dir.Cipher,
Sign => Manager.Config.Dir.Sign);
end loop;
end Save;
end Keystore.Repository.Entries;
| 41.484725 | 97 | 0.562276 |
06004838af1c9b45f358859ff87df08894d8be5e | 339 | ads | Ada | Sources/Globe_3d/unzip/zip-crc.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | 1 | 2019-09-21T09:40:34.000Z | 2019-09-21T09:40:34.000Z | Sources/Globe_3d/unzip/zip-crc.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | null | null | null | Sources/Globe_3d/unzip/zip-crc.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | 1 | 2019-09-25T12:29:27.000Z | 2019-09-25T12:29:27.000Z | -- Cyclic redundancy check to verify archived data integrity
package Zip.CRC is
use Interfaces;
procedure Init (Current_CRC : out Unsigned_32);
function Final (Current_CRC : Unsigned_32) return Unsigned_32;
procedure Update (Current_CRC : in out Unsigned_32; InBuf : Zip.Byte_Buffer);
pragma Inline (Update);
end Zip.CRC;
| 22.6 | 79 | 0.755162 |
ad29e945f61b171243a77e06052e04634b654a21 | 2,265 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/osint-l.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/osint-l.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/osint-l.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- O S I N T - L --
-- --
-- B o d y --
-- --
-- Copyright (C) 2001-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. --
-- --
------------------------------------------------------------------------------
package body Osint.L is
--------------------
-- More_Lib_Files --
--------------------
function More_Lib_Files return Boolean renames More_Files;
------------------------
-- Next_Main_Lib_File --
------------------------
function Next_Main_Lib_File return File_Name_Type renames Next_Main_File;
begin
Set_Program (Gnatls);
end Osint.L;
| 52.674419 | 78 | 0.393819 |
ad60caf4b0cb45a76ab16b9212b41932a77c2ac4 | 7,944 | adb | Ada | ncurses/ncurses-5.9/Ada95/samples/sample-header_handler.adb | imx6uldev/depedency_tools | 0748392a4e97ded2a770b6fbcab281dd3fda2db7 | [
"MIT"
] | 1 | 2018-04-10T19:19:15.000Z | 2018-04-10T19:19:15.000Z | Ada95/samples/sample-header_handler.adb | thabongshot/ncurses-5.9-mac | 8475dcacfcad55dda5e69f3c8d89de0264fc4429 | [
"DOC",
"Unlicense"
] | 1 | 2018-08-21T03:43:31.000Z | 2018-08-21T03:43:31.000Z | Ada95/samples/sample-header_handler.adb | thabongshot/ncurses-5.9-mac | 8475dcacfcad55dda5e69f3c8d89de0264fc4429 | [
"DOC",
"Unlicense"
] | 1 | 2020-03-08T12:52:49.000Z | 2020-03-08T12:52:49.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding Samples --
-- --
-- Sample.Header_Handler --
-- --
-- B O D Y --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 1998-2009,2011 Free Software Foundation, Inc. --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, distribute with modifications, sublicense, and/or sell --
-- copies of the Software, and to permit persons to whom the Software is --
-- furnished to do so, subject to the following conditions: --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, --
-- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR --
-- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR --
-- THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
-- --
-- Except as contained in this notice, the name(s) of the above copyright --
-- holders shall not be used in advertising or otherwise to promote the --
-- sale, use or other dealings in this Software without prior written --
-- authorization. --
------------------------------------------------------------------------------
-- Author: Juergen Pfeifer, 1996
-- Version Control
-- $Revision: 1.19 $
-- $Date: 2011/03/22 23:54:38 $
-- Binding Version 01.00
------------------------------------------------------------------------------
with Ada.Calendar; use Ada.Calendar;
with Terminal_Interface.Curses.Text_IO.Integer_IO;
with Sample.Manifest; use Sample.Manifest;
pragma Elaborate_All (Terminal_Interface.Curses.Text_Io.Integer_IO);
-- This package handles the painting of the header line of the screen.
--
package body Sample.Header_Handler is
package Int_IO is new
Terminal_Interface.Curses.Text_IO.Integer_IO (Integer);
use Int_IO;
Header_Window : Window := Null_Window;
Display_Hour : Integer := -1; -- hour last displayed
Display_Min : Integer := -1; -- minute last displayed
Display_Day : Integer := -1; -- day last displayed
Display_Month : Integer := -1; -- month last displayed
-- This is the routine handed over to the curses library to be called
-- as initialization routine when ripping of the header lines from
-- the screen. This routine must follow C conventions.
function Init_Header_Window (Win : Window;
Columns : Column_Count) return Integer;
pragma Convention (C, Init_Header_Window);
procedure Internal_Update_Header_Window (Do_Update : Boolean);
-- The initialization must be called before Init_Screen. It steals two
-- lines from the top of the screen.
procedure Init_Header_Handler
is
begin
Rip_Off_Lines (2, Init_Header_Window'Access);
end Init_Header_Handler;
procedure N_Out (N : Integer);
-- Emit a two digit number and ensure that a leading zero is generated if
-- necessary.
procedure N_Out (N : Integer)
is
begin
if N < 10 then
Add (Header_Window, '0');
Put (Header_Window, N, 1);
else
Put (Header_Window, N, 2);
end if;
end N_Out;
-- Paint the header window. The input parameter is a flag indicating
-- whether or not the screen should be updated physically after painting.
procedure Internal_Update_Header_Window (Do_Update : Boolean)
is
type Month_Name_Array is
array (Month_Number'First .. Month_Number'Last) of String (1 .. 9);
Month_Names : constant Month_Name_Array :=
("January ",
"February ",
"March ",
"April ",
"May ",
"June ",
"July ",
"August ",
"September",
"October ",
"November ",
"December ");
Now : constant Time := Clock;
Sec : constant Integer := Integer (Seconds (Now));
Hour : constant Integer := Sec / 3600;
Minute : constant Integer := (Sec - Hour * 3600) / 60;
Mon : constant Month_Number := Month (Now);
D : constant Day_Number := Day (Now);
begin
if Header_Window /= Null_Window then
if Minute /= Display_Min or else Hour /= Display_Hour
or else Display_Day /= D or else Display_Month /= Mon then
Move_Cursor (Header_Window, 0, 0);
N_Out (D); Add (Header_Window, '.');
Add (Header_Window, Month_Names (Mon));
Move_Cursor (Header_Window, 1, 0);
N_Out (Hour); Add (Header_Window, ':');
N_Out (Minute);
Display_Min := Minute;
Display_Hour := Hour;
Display_Month := Mon;
Display_Day := D;
Refresh_Without_Update (Header_Window);
if Do_Update then
Update_Screen;
end if;
end if;
end if;
end Internal_Update_Header_Window;
-- This routine is called in the keyboard input timeout handler. So it will
-- periodically update the header line of the screen.
procedure Update_Header_Window
is
begin
Internal_Update_Header_Window (True);
end Update_Header_Window;
function Init_Header_Window (Win : Window;
Columns : Column_Count) return Integer
is
Title : constant String := "Ada 95 ncurses Binding Sample";
Pos : Column_Position;
begin
Header_Window := Win;
if Win /= Null_Window then
if Has_Colors then
Set_Background (Win => Win,
Ch => (Ch => ' ',
Color => Header_Color,
Attr => Normal_Video));
Set_Character_Attributes (Win => Win,
Attr => Normal_Video,
Color => Header_Color);
Erase (Win);
end if;
Leave_Cursor_After_Update (Win, True);
Pos := Columns - Column_Position (Title'Length);
Add (Win, 0, Pos / 2, Title);
-- In this phase we must not allow a physical update, because
-- ncurses is not properly initialized at this point.
Internal_Update_Header_Window (False);
return 0;
else
return -1;
end if;
end Init_Header_Window;
end Sample.Header_Handler;
| 43.409836 | 79 | 0.521148 |
2e664875958c880ffadc202d215e435e0d361cd0 | 3,817 | adb | Ada | src/util-dates-iso8601.adb | Letractively/ada-util | e4c63b93635dc07c46e95f12ba02d18903b307b3 | [
"Apache-2.0"
] | null | null | null | src/util-dates-iso8601.adb | Letractively/ada-util | e4c63b93635dc07c46e95f12ba02d18903b307b3 | [
"Apache-2.0"
] | null | null | null | src/util-dates-iso8601.adb | Letractively/ada-util | e4c63b93635dc07c46e95f12ba02d18903b307b3 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- util-dates-iso8601 -- ISO8601 dates
-- Copyright (C) 2011, 2013 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
package body Util.Dates.ISO8601 is
-- ------------------------------
-- Parses an ISO8601 date and return it as a calendar time.
-- Raises Constraint_Error if the date format is not recognized.
-- ------------------------------
function Value (Date : in String) return Ada.Calendar.Time is
use Ada.Calendar;
Result : Date_Record;
begin
if Date'Length < 4 then
raise Constraint_Error with "Invalid date";
end if;
Result.Year := Year_Number'Value (Date (Date'First .. Date'First + 3));
if Date'Length = 4 then
-- ISO8601 date: YYYY
Result.Month := 1;
Result.Month_Day := 1;
elsif Date'Length = 7 and Date (Date'First + 4) = '-' then
-- ISO8601 date: YYYY-MM
Result.Month := Month_Number'Value (Date (Date'First + 4 .. Date'Last));
Result.Month_Day := 1;
elsif Date'Length = 8 then
-- ISO8601 date: YYYYMMDD
Result.Month := Month_Number'Value (Date (Date'First + 4 .. Date'First + 5));
Result.Month_Day := Day_Number'Value (Date (Date'First + 6 .. Date'First + 7));
elsif Date'Length >= 9 and then Date (Date'First + 4) = '-'
and then Date (Date'First + 7) = '-' then
-- ISO8601 date: YYYY-MM-DD
Result.Month := Month_Number'Value (Date (Date'First + 5 .. Date'First + 6));
Result.Month_Day := Day_Number'Value (Date (Date'First + 8 .. Date'First + 9));
else
raise Constraint_Error with "invalid date";
end if;
return Ada.Calendar.Formatting.Time_Of (Year => Result.Year,
Month => Result.Month,
Day => Result.Month_Day,
Hour => 0,
Minute => 0,
Second => 0,
Sub_Second => 0.0);
end Value;
-- ------------------------------
-- Return the ISO8601 date.
-- ------------------------------
function Image (Date : in Ada.Calendar.Time) return String is
D : Date_Record;
begin
Split (D, Date);
return Image (D);
end Image;
function Image (Date : in Date_Record) return String is
To_Char : constant array (0 .. 9) of Character := "0123456789";
Result : String (1 .. 10) := "0000-00-00";
begin
Result (1) := To_Char (Date.Year / 1000);
Result (2) := To_Char (Date.Year / 100 mod 10);
Result (3) := To_Char (Date.Year / 10 mod 10);
Result (4) := To_Char (Date.Year mod 10);
Result (6) := To_Char (Date.Month / 10);
Result (7) := To_Char (Date.Month mod 10);
Result (9) := To_Char (Date.Month_Day / 10);
Result (10) := To_Char (Date.Month_Day mod 10);
return Result;
end Image;
end Util.Dates.ISO8601;
| 41.043011 | 88 | 0.527116 |
1379071b531cbcaa379293016806c9ef3f982ef4 | 3,051 | ads | Ada | src/common/keccak-keccak_100-rounds_12.ads | damaki/libkeccak | d06217e525f7927380690d6c37b485bdbe8aa96e | [
"BSD-3-Clause"
] | 26 | 2015-09-20T17:52:38.000Z | 2021-07-29T21:47:04.000Z | src/common/keccak-keccak_100-rounds_12.ads | damaki/libkeccak | d06217e525f7927380690d6c37b485bdbe8aa96e | [
"BSD-3-Clause"
] | 3 | 2019-03-12T16:01:36.000Z | 2020-05-23T13:06:43.000Z | src/common/keccak-keccak_100-rounds_12.ads | damaki/libkeccak | d06217e525f7927380690d6c37b485bdbe8aa96e | [
"BSD-3-Clause"
] | 2 | 2019-04-15T18:02:19.000Z | 2020-11-22T11:22:18.000Z | -------------------------------------------------------------------------------
-- Copyright (c) 2019, Daniel King
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
-- * Redistributions of source code must retain the above copyright
-- notice, this list of conditions and the following disclaimer.
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
-- * The name of the copyright holder may not be used to endorse or promote
-- Products derived from this software without specific prior written
-- permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE FOR ANY
-- DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
-- (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-- LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
-- ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
-- THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-------------------------------------------------------------------------------
with Keccak.Generic_Duplex;
with Keccak.Generic_Sponge;
pragma Elaborate_All (Keccak.Generic_Duplex);
pragma Elaborate_All (Keccak.Generic_Sponge);
-- @summary
-- Instantiation of Keccak-p[100,12], with a Sponge and Duplex built on top of it.
package Keccak.Keccak_100.Rounds_12
with SPARK_Mode => On
is
procedure Permute is new KeccakF_100_Permutation.Permute
(Num_Rounds => 12);
package Sponge is new Keccak.Generic_Sponge
(State_Size_Bits => KeccakF_100.State_Size_Bits,
State_Type => State,
Init_State => KeccakF_100.Init,
Permute => Permute,
XOR_Bits_Into_State => KeccakF_100_Lanes.XOR_Bits_Into_State,
Extract_Data => KeccakF_100_Lanes.Extract_Bytes,
Pad => Keccak.Padding.Pad101_Multi_Blocks);
package Duplex is new Keccak.Generic_Duplex
(State_Size_Bits => KeccakF_100.State_Size_Bits,
State_Type => State,
Init_State => KeccakF_100.Init,
Permute => Permute,
XOR_Bits_Into_State => KeccakF_100_Lanes.XOR_Bits_Into_State,
Extract_Bits => KeccakF_100_Lanes.Extract_Bits,
Pad => Keccak.Padding.Pad101_Single_Block,
Min_Padding_Bits => Keccak.Padding.Pad101_Min_Bits);
end Keccak.Keccak_100.Rounds_12;
| 49.209677 | 83 | 0.678466 |
1283de5e8add7e459db70215e34de2c40ad0f885 | 915 | adb | Ada | bucket_7E/matreshka/patches/patch-tools_configure_configure-tests-postgresql.adb | jrmarino/ravensource | 91d599fd1f2af55270258d15e72c62774f36033e | [
"FTL"
] | 17 | 2017-04-22T21:53:52.000Z | 2021-01-21T16:57:55.000Z | bucket_7E/matreshka/patches/patch-tools_configure_configure-tests-postgresql.adb | jrmarino/ravensource | 91d599fd1f2af55270258d15e72c62774f36033e | [
"FTL"
] | 186 | 2017-09-12T20:46:52.000Z | 2021-11-27T18:15:14.000Z | bucket_7E/matreshka/patches/patch-tools_configure_configure-tests-postgresql.adb | jrmarino/ravensource | 91d599fd1f2af55270258d15e72c62774f36033e | [
"FTL"
] | 74 | 2017-09-06T14:48:01.000Z | 2021-08-28T02:48:27.000Z | --- tools/configure/configure-tests-postgresql.adb.orig 2011-12-27 08:20:56 UTC
+++ tools/configure/configure-tests-postgresql.adb
@@ -187,7 +187,7 @@ package body Configure.Tests.PostgreSQL
(PostgreSQL_Library_Options,
+"""-L"
& Self.Switches.Libdir
- & """, ""-lpq""");
+ & """, ""-lpq"", ""-Wl,-rpath,@PREFIX@/lib""");
Self.Report_Status ("yes (command line)");
@@ -197,7 +197,7 @@ package body Configure.Tests.PostgreSQL
elsif Has_Pg_Config then
Self.Report_Status ("yes (pg_config)");
Substitutions.Insert
- (PostgreSQL_Library_Options, +"""-L" & Pg_Libdir & """, ""-lpq""");
+ (PostgreSQL_Library_Options, +"""-L" & Pg_Libdir & """, ""-lpq"", ""-Wl,-rpath,@PREFIX@/lib""");
else
Self.Report_Status ("no (pg_config not found)");
| 43.571429 | 110 | 0.536612 |
1316551258d25eede99a55b505e362bccf198236 | 2,718 | adb | Ada | day16/opcode_helper.adb | thorstel/Advent-of-Code-2018 | d67cb7ffeac9e68560af34ca1bc29928bad1d3b9 | [
"BSD-3-Clause"
] | 2 | 2019-09-15T04:52:09.000Z | 2020-11-17T16:46:46.000Z | day16/opcode_helper.adb | thorstel/Advent-of-Code-2018 | d67cb7ffeac9e68560af34ca1bc29928bad1d3b9 | [
"BSD-3-Clause"
] | null | null | null | day16/opcode_helper.adb | thorstel/Advent-of-Code-2018 | d67cb7ffeac9e68560af34ca1bc29928bad1d3b9 | [
"BSD-3-Clause"
] | null | null | null | package body Opcode_Helper is
function Execute_Instruction
(Op : String;
Reg : Registers;
A, B, C : Unsigned_64) return Registers
is
type Operations is
(addr, addi, mulr, muli, banr, bani, borr, bori,
setr, seti, gtir, gtri, gtrr, eqir, eqri, eqrr);
Result : Registers := Reg;
begin
case Operations'Value (Op) is
when addr =>
Result (Natural (C)) :=
Result (Natural (A)) + Result (Natural (B));
when addi =>
Result (Natural (C)) := Result (Natural (A)) + B;
when mulr =>
Result (Natural (C)) :=
Result (Natural (A)) * Result (Natural (B));
when muli =>
Result (Natural (C)) := Result (Natural (A)) * B;
when banr =>
Result (Natural (C)) :=
Result (Natural (A)) and Result (Natural (B));
when bani =>
Result (Natural (C)) := Result (Natural (A)) and B;
when borr =>
Result (Natural (C)) :=
Result (Natural (A)) or Result (Natural (B));
when bori =>
Result (Natural (C)) := Result (Natural (A)) or B;
when setr =>
Result (Natural (C)) := Result (Natural (A));
when seti =>
Result (Natural (C)) := A;
when gtir =>
if A > Result (Natural (B)) then
Result (Natural (C)) := 1;
else
Result (Natural (C)) := 0;
end if;
when gtri =>
if Result (Natural (A)) > B then
Result (Natural (C)) := 1;
else
Result (Natural (C)) := 0;
end if;
when gtrr =>
if Result (Natural (A)) > Result (Natural (B)) then
Result (Natural (C)) := 1;
else
Result (Natural (C)) := 0;
end if;
when eqir =>
if A = Result (Natural (B)) then
Result (Natural (C)) := 1;
else
Result (Natural (C)) := 0;
end if;
when eqri =>
if Result (Natural (A)) = B then
Result (Natural (C)) := 1;
else
Result (Natural (C)) := 0;
end if;
when eqrr =>
if Result (Natural (A)) = Result (Natural (B)) then
Result (Natural (C)) := 1;
else
Result (Natural (C)) := 0;
end if;
end case;
return Result;
exception
when Constraint_Error =>
raise Constraint_Error with "There is no " & Op & " operation";
end Execute_Instruction;
end Opcode_Helper;
| 28.020619 | 72 | 0.445916 |
1ab05fff2ff506dc062ce76edc3931e5dd5d148d | 101,785 | adb | Ada | honeybee_proj/HBH/.autopilot/db/honeybee.bind.adb | AnthonyKenny98/HoneyBee | 5b1859fe8c50cb5bd709f53780c4e5ce7160b987 | [
"MIT"
] | null | null | null | honeybee_proj/HBH/.autopilot/db/honeybee.bind.adb | AnthonyKenny98/HoneyBee | 5b1859fe8c50cb5bd709f53780c4e5ce7160b987 | [
"MIT"
] | null | null | null | honeybee_proj/HBH/.autopilot/db/honeybee.bind.adb | AnthonyKenny98/HoneyBee | 5b1859fe8c50cb5bd709f53780c4e5ce7160b987 | [
"MIT"
] | null | null | null | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="15">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>honeybee</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>edge_y.p1.x</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>edge_y.p1.z</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>edge_y.p1.y</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>edge_y.p2.x</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>edge_y.p2.z</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>edge_y.p2.y</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>12</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>edge_p2_z_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>159</lineNumber>
<contextFuncName>honeybee</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>honeybee</second>
</first>
<second>159</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>29</item>
<item>30</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>16</id>
<name>edge_p2_y_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>159</lineNumber>
<contextFuncName>honeybee</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>honeybee</second>
</first>
<second>159</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>31</item>
<item>32</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>17</id>
<name>edge_p2_x_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>159</lineNumber>
<contextFuncName>honeybee</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>honeybee</second>
</first>
<second>159</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>33</item>
<item>34</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>18</id>
<name>edge_p1_z_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>159</lineNumber>
<contextFuncName>honeybee</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>honeybee</second>
</first>
<second>159</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>35</item>
<item>36</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>19</id>
<name>edge_p1_y_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>159</lineNumber>
<contextFuncName>honeybee</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>honeybee</second>
</first>
<second>159</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>37</item>
<item>38</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>20</id>
<name>edge_p1_x_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>159</lineNumber>
<contextFuncName>honeybee</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>honeybee</second>
</first>
<second>159</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>39</item>
<item>40</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>21</id>
<name>collisions_z</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>166</lineNumber>
<contextFuncName>honeybee</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>honeybee</second>
</first>
<second>166</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>collisions_z</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>7</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>
</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>22</id>
<name>collisions_y</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>167</lineNumber>
<contextFuncName>honeybee</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>honeybee</second>
</first>
<second>167</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>collisions_y</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>7</count>
<item_version>0</item_version>
<item>50</item>
<item>51</item>
<item>52</item>
<item>53</item>
<item>54</item>
<item>55</item>
<item>56</item>
</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="_15">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>collisions_x</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>168</lineNumber>
<contextFuncName>honeybee</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>honeybee</second>
</first>
<second>168</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>collisions_x</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>7</count>
<item_version>0</item_version>
<item>58</item>
<item>59</item>
<item>60</item>
<item>61</item>
<item>62</item>
<item>63</item>
<item>64</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="_16">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>or_ln170</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>170</lineNumber>
<contextFuncName>honeybee</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>honeybee</second>
</first>
<second>170</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>65</item>
<item>66</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>10</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>collisions</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>170</lineNumber>
<contextFuncName>honeybee</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>honeybee</second>
</first>
<second>170</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>collisions</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>67</item>
<item>68</item>
</oprand_edges>
<opcode>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>11</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>_ln171</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>171</lineNumber>
<contextFuncName>honeybee</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>honeybee</second>
</first>
<second>171</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>69</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>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_19">
<Value>
<Obj>
<type>2</type>
<id>41</id>
<name>checkAxis_2</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:checkAxis.2></content>
</item>
<item class_id_reference="16" object_id="_20">
<Value>
<Obj>
<type>2</type>
<id>49</id>
<name>checkAxis_0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:checkAxis.0></content>
</item>
<item class_id_reference="16" object_id="_21">
<Value>
<Obj>
<type>2</type>
<id>57</id>
<name>checkAxis_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:checkAxis.1></content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_22">
<Obj>
<type>3</type>
<id>27</id>
<name>honeybee</name>
<fileName></fileName>
<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>15</item>
<item>16</item>
<item>17</item>
<item>18</item>
<item>19</item>
<item>20</item>
<item>21</item>
<item>22</item>
<item>23</item>
<item>24</item>
<item>25</item>
<item>26</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>32</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_23">
<id>30</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_24">
<id>32</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_25">
<id>34</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_26">
<id>36</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_27">
<id>38</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_28">
<id>40</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_29">
<id>42</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_30">
<id>43</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_31">
<id>44</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_32">
<id>45</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_33">
<id>46</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_34">
<id>47</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_35">
<id>48</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="_36">
<id>50</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_37">
<id>51</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_38">
<id>52</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_39">
<id>53</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_40">
<id>54</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_41">
<id>55</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_42">
<id>56</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="_43">
<id>58</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_44">
<id>59</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_45">
<id>60</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_46">
<id>61</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_47">
<id>62</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_48">
<id>63</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_49">
<id>64</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_50">
<id>65</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="_51">
<id>66</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="_52">
<id>67</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="_53">
<id>68</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_54">
<id>69</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>26</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="_55">
<mId>1</mId>
<mTag>honeybee</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>27</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>53</mMinLatency>
<mMaxLatency>53</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_56">
<states class_id="25" tracking_level="0" version="0">
<count>54</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_57">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_58">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_59">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_60">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_61">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_62">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_63">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_64">
<id>21</id>
<stage>53</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_65">
<id>22</id>
<stage>53</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_66">
<id>23</id>
<stage>53</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_67">
<id>2</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_68">
<id>21</id>
<stage>52</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_69">
<id>22</id>
<stage>52</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_70">
<id>23</id>
<stage>52</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_71">
<id>3</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_72">
<id>21</id>
<stage>51</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_73">
<id>22</id>
<stage>51</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_74">
<id>23</id>
<stage>51</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_75">
<id>4</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_76">
<id>21</id>
<stage>50</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_77">
<id>22</id>
<stage>50</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_78">
<id>23</id>
<stage>50</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_79">
<id>5</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_80">
<id>21</id>
<stage>49</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_81">
<id>22</id>
<stage>49</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_82">
<id>23</id>
<stage>49</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_83">
<id>6</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_84">
<id>21</id>
<stage>48</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_85">
<id>22</id>
<stage>48</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_86">
<id>23</id>
<stage>48</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_87">
<id>7</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_88">
<id>21</id>
<stage>47</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_89">
<id>22</id>
<stage>47</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_90">
<id>23</id>
<stage>47</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_91">
<id>8</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_92">
<id>21</id>
<stage>46</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_93">
<id>22</id>
<stage>46</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_94">
<id>23</id>
<stage>46</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_95">
<id>9</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_96">
<id>21</id>
<stage>45</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_97">
<id>22</id>
<stage>45</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_98">
<id>23</id>
<stage>45</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_99">
<id>10</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_100">
<id>21</id>
<stage>44</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_101">
<id>22</id>
<stage>44</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_102">
<id>23</id>
<stage>44</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_103">
<id>11</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_104">
<id>21</id>
<stage>43</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_105">
<id>22</id>
<stage>43</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_106">
<id>23</id>
<stage>43</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_107">
<id>12</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_108">
<id>21</id>
<stage>42</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_109">
<id>22</id>
<stage>42</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_110">
<id>23</id>
<stage>42</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_111">
<id>13</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_112">
<id>21</id>
<stage>41</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_113">
<id>22</id>
<stage>41</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_114">
<id>23</id>
<stage>41</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_115">
<id>14</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_116">
<id>21</id>
<stage>40</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_117">
<id>22</id>
<stage>40</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_118">
<id>23</id>
<stage>40</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_119">
<id>15</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_120">
<id>21</id>
<stage>39</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_121">
<id>22</id>
<stage>39</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_122">
<id>23</id>
<stage>39</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_123">
<id>16</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_124">
<id>21</id>
<stage>38</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_125">
<id>22</id>
<stage>38</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_126">
<id>23</id>
<stage>38</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_127">
<id>17</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_128">
<id>21</id>
<stage>37</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_129">
<id>22</id>
<stage>37</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_130">
<id>23</id>
<stage>37</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_131">
<id>18</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_132">
<id>21</id>
<stage>36</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_133">
<id>22</id>
<stage>36</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_134">
<id>23</id>
<stage>36</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_135">
<id>19</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_136">
<id>21</id>
<stage>35</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_137">
<id>22</id>
<stage>35</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_138">
<id>23</id>
<stage>35</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_139">
<id>20</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_140">
<id>21</id>
<stage>34</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_141">
<id>22</id>
<stage>34</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_142">
<id>23</id>
<stage>34</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_143">
<id>21</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_144">
<id>21</id>
<stage>33</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_145">
<id>22</id>
<stage>33</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_146">
<id>23</id>
<stage>33</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_147">
<id>22</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_148">
<id>21</id>
<stage>32</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_149">
<id>22</id>
<stage>32</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_150">
<id>23</id>
<stage>32</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_151">
<id>23</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_152">
<id>21</id>
<stage>31</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_153">
<id>22</id>
<stage>31</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_154">
<id>23</id>
<stage>31</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_155">
<id>24</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_156">
<id>21</id>
<stage>30</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_157">
<id>22</id>
<stage>30</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_158">
<id>23</id>
<stage>30</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_159">
<id>25</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_160">
<id>21</id>
<stage>29</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_161">
<id>22</id>
<stage>29</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_162">
<id>23</id>
<stage>29</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_163">
<id>26</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_164">
<id>21</id>
<stage>28</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_165">
<id>22</id>
<stage>28</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_166">
<id>23</id>
<stage>28</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_167">
<id>27</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_168">
<id>21</id>
<stage>27</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_169">
<id>22</id>
<stage>27</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_170">
<id>23</id>
<stage>27</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_171">
<id>28</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_172">
<id>21</id>
<stage>26</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_173">
<id>22</id>
<stage>26</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_174">
<id>23</id>
<stage>26</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_175">
<id>29</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_176">
<id>21</id>
<stage>25</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_177">
<id>22</id>
<stage>25</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_178">
<id>23</id>
<stage>25</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_179">
<id>30</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_180">
<id>21</id>
<stage>24</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_181">
<id>22</id>
<stage>24</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_182">
<id>23</id>
<stage>24</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_183">
<id>31</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_184">
<id>21</id>
<stage>23</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_185">
<id>22</id>
<stage>23</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_186">
<id>23</id>
<stage>23</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_187">
<id>32</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_188">
<id>21</id>
<stage>22</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_189">
<id>22</id>
<stage>22</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_190">
<id>23</id>
<stage>22</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_191">
<id>33</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_192">
<id>21</id>
<stage>21</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_193">
<id>22</id>
<stage>21</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_194">
<id>23</id>
<stage>21</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_195">
<id>34</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_196">
<id>21</id>
<stage>20</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_197">
<id>22</id>
<stage>20</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_198">
<id>23</id>
<stage>20</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_199">
<id>35</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_200">
<id>21</id>
<stage>19</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_201">
<id>22</id>
<stage>19</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_202">
<id>23</id>
<stage>19</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_203">
<id>36</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_204">
<id>21</id>
<stage>18</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_205">
<id>22</id>
<stage>18</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_206">
<id>23</id>
<stage>18</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_207">
<id>37</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_208">
<id>21</id>
<stage>17</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_209">
<id>22</id>
<stage>17</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_210">
<id>23</id>
<stage>17</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_211">
<id>38</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_212">
<id>21</id>
<stage>16</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_213">
<id>22</id>
<stage>16</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_214">
<id>23</id>
<stage>16</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_215">
<id>39</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_216">
<id>21</id>
<stage>15</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_217">
<id>22</id>
<stage>15</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_218">
<id>23</id>
<stage>15</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_219">
<id>40</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_220">
<id>21</id>
<stage>14</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_221">
<id>22</id>
<stage>14</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_222">
<id>23</id>
<stage>14</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_223">
<id>41</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_224">
<id>21</id>
<stage>13</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_225">
<id>22</id>
<stage>13</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_226">
<id>23</id>
<stage>13</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_227">
<id>42</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_228">
<id>21</id>
<stage>12</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_229">
<id>22</id>
<stage>12</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_230">
<id>23</id>
<stage>12</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_231">
<id>43</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_232">
<id>21</id>
<stage>11</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_233">
<id>22</id>
<stage>11</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_234">
<id>23</id>
<stage>11</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_235">
<id>44</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_236">
<id>21</id>
<stage>10</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_237">
<id>22</id>
<stage>10</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_238">
<id>23</id>
<stage>10</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_239">
<id>45</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_240">
<id>21</id>
<stage>9</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_241">
<id>22</id>
<stage>9</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_242">
<id>23</id>
<stage>9</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_243">
<id>46</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_244">
<id>21</id>
<stage>8</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_245">
<id>22</id>
<stage>8</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_246">
<id>23</id>
<stage>8</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_247">
<id>47</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_248">
<id>21</id>
<stage>7</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_249">
<id>22</id>
<stage>7</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_250">
<id>23</id>
<stage>7</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_251">
<id>48</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_252">
<id>21</id>
<stage>6</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_253">
<id>22</id>
<stage>6</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_254">
<id>23</id>
<stage>6</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_255">
<id>49</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_256">
<id>21</id>
<stage>5</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_257">
<id>22</id>
<stage>5</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_258">
<id>23</id>
<stage>5</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_259">
<id>50</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_260">
<id>21</id>
<stage>4</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_261">
<id>22</id>
<stage>4</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_262">
<id>23</id>
<stage>4</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_263">
<id>51</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_264">
<id>21</id>
<stage>3</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_265">
<id>22</id>
<stage>3</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_266">
<id>23</id>
<stage>3</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_267">
<id>52</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_268">
<id>21</id>
<stage>2</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_269">
<id>22</id>
<stage>2</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_270">
<id>23</id>
<stage>2</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_271">
<id>53</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_272">
<id>21</id>
<stage>1</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_273">
<id>22</id>
<stage>1</stage>
<latency>53</latency>
</item>
<item class_id_reference="28" object_id="_274">
<id>23</id>
<stage>1</stage>
<latency>53</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_275">
<id>54</id>
<operations>
<count>11</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_276">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_277">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_278">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_279">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_280">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_281">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_282">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_283">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_284">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_285">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_286">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>53</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_287">
<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="_288">
<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="_289">
<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="_290">
<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="_291">
<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="_292">
<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="_293">
<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="_294">
<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="_295">
<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="_296">
<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="_297">
<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="_298">
<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="_299">
<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="_300">
<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="_301">
<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="_302">
<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="_303">
<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="_304">
<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="_305">
<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="_306">
<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="_307">
<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="_308">
<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="_309">
<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="_310">
<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="_311">
<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="_312">
<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="_313">
<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="_314">
<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="_315">
<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="_316">
<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="_317">
<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="_318">
<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="_319">
<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="_320">
<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="_321">
<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="_322">
<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="_323">
<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="_324">
<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="_325">
<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="_326">
<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="_327">
<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="_328">
<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="_329">
<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="_330">
<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="_331">
<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="_332">
<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="_333">
<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="_334">
<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="_335">
<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="_336">
<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="_337">
<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>
<item class_id_reference="30" object_id="_338">
<inState>52</inState>
<outState>53</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="_339">
<inState>53</inState>
<outState>54</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>12</count>
<item_version>0</item_version>
<item class_id="36" tracking_level="0" version="0">
<first>15</first>
<second class_id="37" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>0</first>
<second>52</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>0</first>
<second>52</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>0</first>
<second>52</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="38" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="39" tracking_level="0" version="0">
<first>27</first>
<second class_id="40" tracking_level="0" version="0">
<first>0</first>
<second>53</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="41" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="42" tracking_level="0" version="0">
<count>11</count>
<item_version>0</item_version>
<item class_id="43" tracking_level="0" version="0">
<first>28</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>34</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>40</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>46</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>58</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>64</first>
<second>
<count>53</count>
<item_version>0</item_version>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
</second>
</item>
<item>
<first>80</first>
<second>
<count>53</count>
<item_version>0</item_version>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
</second>
</item>
<item>
<first>96</first>
<second>
<count>53</count>
<item_version>0</item_version>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
</second>
</item>
<item>
<first>112</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>116</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="45" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="46" tracking_level="0" version="0">
<first>collisions_fu_116</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>or_ln170_fu_112</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>3</count>
<item_version>0</item_version>
<item>
<first>grp_checkAxis_0_fu_96</first>
<second>
<count>53</count>
<item_version>0</item_version>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
<item>22</item>
</second>
</item>
<item>
<first>grp_checkAxis_1_fu_80</first>
<second>
<count>53</count>
<item_version>0</item_version>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
<item>23</item>
</second>
</item>
<item>
<first>grp_checkAxis_2_fu_64</first>
<second>
<count>53</count>
<item_version>0</item_version>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</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_58</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>edge_p1_y_read_read_fu_52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>edge_p1_z_read_read_fu_46</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>edge_p2_x_read_read_fu_40</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>edge_p2_y_read_read_fu_34</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>edge_p2_z_read_read_fu_28</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</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="47" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>9</count>
<item_version>0</item_version>
<item>
<first>121</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>128</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>135</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>142</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>149</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>156</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>163</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>168</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>173</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>9</count>
<item_version>0</item_version>
<item>
<first>collisions_x_reg_173</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>collisions_y_reg_168</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>collisions_z_reg_163</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>edge_p1_x_read_reg_156</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>edge_p1_y_read_reg_149</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>edge_p1_z_read_reg_142</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>edge_p2_x_read_reg_135</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>edge_p2_y_read_reg_128</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>edge_p2_z_read_reg_121</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="48" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="49" 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>20</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>19</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>18</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>17</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>16</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>15</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="50" 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>
| 24.837726 | 72 | 0.573945 |
57fcd6c5e4c600165c8788450ec69fc87dcb71d1 | 171 | adb | Ada | PMOO/ADA/LAB2/PARTE_2/es_divisor.adb | usainzg/EHU | ada8fae57566e76a9a0bc3d6de906cde167828a7 | [
"MIT"
] | null | null | null | PMOO/ADA/LAB2/PARTE_2/es_divisor.adb | usainzg/EHU | ada8fae57566e76a9a0bc3d6de906cde167828a7 | [
"MIT"
] | null | null | null | PMOO/ADA/LAB2/PARTE_2/es_divisor.adb | usainzg/EHU | ada8fae57566e76a9a0bc3d6de906cde167828a7 | [
"MIT"
] | null | null | null | function Es_Divisor(N, M: Integer) return Boolean is
begin
if (M mod N) = 0 then
return True;
end if;
return False;
end Es_Divisor; | 24.428571 | 52 | 0.573099 |
2225ab9fedbe852d474662142f497b8ee4adab73 | 133 | ads | Ada | source/adalang/adam-parse.ads | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | 3 | 2017-04-29T14:25:22.000Z | 2017-09-29T10:15:28.000Z | source/adalang/adam-parse.ads | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | null | null | null | source/adalang/adam-parse.ads | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | null | null | null | with
AdaM.Environment;
procedure AdaM.parse (File : in String;
Into : in out AdaM.Environment.item);
| 22.166667 | 59 | 0.578947 |
3d8ecdcdca580bfecc240b7e36a7116bb9189bd3 | 5,081 | ads | Ada | src/mysql/ado-connections-mysql.ads | My-Colaborations/ada-ado | cebf1f9b38c0c259c44935e8bca05a5bff12aace | [
"Apache-2.0"
] | null | null | null | src/mysql/ado-connections-mysql.ads | My-Colaborations/ada-ado | cebf1f9b38c0c259c44935e8bca05a5bff12aace | [
"Apache-2.0"
] | null | null | null | src/mysql/ado-connections-mysql.ads | My-Colaborations/ada-ado | cebf1f9b38c0c259c44935e8bca05a5bff12aace | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- ado-connections-mysql -- MySQL Database connections
-- Copyright (C) 2009, 2010, 2017, 2019 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Mysql.Mysql; use Mysql.Mysql;
private with Ada.Strings.Unbounded;
package ADO.Connections.Mysql is
type Mysql_Driver is limited private;
-- Initialize the Mysql driver.
procedure Initialize;
private
use Ada.Strings.Unbounded;
-- Create a new MySQL connection using the configuration parameters.
procedure Create_Connection (D : in out Mysql_Driver;
Config : in Configuration'Class;
Result : in out Ref.Ref'Class);
type Mysql_Driver is new ADO.Connections.Driver with record
Id : Natural := 0;
end record;
-- Create the database and initialize it with the schema SQL file.
-- The `Admin` parameter describes the database connection with administrator access.
-- The `Config` parameter describes the target database connection.
overriding
procedure Create_Database (D : in out Mysql_Driver;
Admin : in Configs.Configuration'Class;
Config : in Configs.Configuration'Class;
Schema_Path : in String;
Messages : out Util.Strings.Vectors.Vector);
-- Deletes the Mysql driver.
overriding
procedure Finalize (D : in out Mysql_Driver);
-- Database connection implementation
type Database_Connection is new ADO.Connections.Database_Connection with record
Name : Unbounded_String := Null_Unbounded_String;
Server_Name : Unbounded_String := Null_Unbounded_String;
Login_Name : Unbounded_String := Null_Unbounded_String;
Password : Unbounded_String := Null_Unbounded_String;
Server : Mysql_Access := null;
Connected : Boolean := False;
-- MySQL autocommit flag
Autocommit : Boolean := True;
end record;
type Database_Connection_Access is access all Database_Connection'Class;
-- Get the database driver which manages this connection.
overriding
function Get_Driver (Database : in Database_Connection)
return Driver_Access;
overriding
function Create_Statement (Database : in Database_Connection;
Table : in ADO.Schemas.Class_Mapping_Access)
return Query_Statement_Access;
overriding
function Create_Statement (Database : in Database_Connection;
Query : in String)
return Query_Statement_Access;
-- Create a delete statement.
overriding
function Create_Statement (Database : in Database_Connection;
Table : in ADO.Schemas.Class_Mapping_Access)
return Delete_Statement_Access;
-- Create an insert statement.
overriding
function Create_Statement (Database : in Database_Connection;
Table : in ADO.Schemas.Class_Mapping_Access)
return Insert_Statement_Access;
-- Create an update statement.
overriding
function Create_Statement (Database : in Database_Connection;
Table : in ADO.Schemas.Class_Mapping_Access)
return Update_Statement_Access;
-- Start a transaction.
overriding
procedure Begin_Transaction (Database : in out Database_Connection);
-- Commit the current transaction.
overriding
procedure Commit (Database : in out Database_Connection);
-- Rollback the current transaction.
overriding
procedure Rollback (Database : in out Database_Connection);
procedure Execute (Database : in out Database_Connection;
SQL : in Query_String);
-- Closes the database connection
overriding
procedure Close (Database : in out Database_Connection);
overriding
procedure Finalize (Database : in out Database_Connection);
-- Load the database schema definition for the current database.
overriding
procedure Load_Schema (Database : in Database_Connection;
Schema : out ADO.Schemas.Schema_Definition);
end ADO.Connections.Mysql;
| 37.91791 | 89 | 0.639047 |
58b3fcaf9bb36cf820ab46086ab82acce7765e55 | 2,983 | ads | Ada | tools/scitools/conf/understand/ada/ada12/s-pack43.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 1 | 2020-01-20T21:26:46.000Z | 2020-01-20T21:26:46.000Z | tools/scitools/conf/understand/ada/ada12/s-pack43.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada12/s-pack43.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 4 3 --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2009, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Handling of packed arrays with Component_Size = 43
package System.Pack_43 is
pragma Preelaborate;
Bits : constant := 43;
type Bits_43 is mod 2 ** Bits;
for Bits_43'Size use Bits;
function Get_43 (Arr : System.Address; N : Natural) return Bits_43;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned.
procedure Set_43 (Arr : System.Address; N : Natural; E : Bits_43);
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is set to the given value.
end System.Pack_43;
| 58.490196 | 78 | 0.376802 |
2e1cd5d52a73b5a176bf28c9a7127f4c3f108efa | 21,217 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-stzmap.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-stzmap.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-stzmap.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . S T R I N G S . W I D E _ W I D E _ M A P S --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Unchecked_Deallocation;
package body Ada.Strings.Wide_Wide_Maps is
---------
-- "-" --
---------
function "-"
(Left, Right : Wide_Wide_Character_Set) return Wide_Wide_Character_Set
is
LS : constant Wide_Wide_Character_Ranges_Access := Left.Set;
RS : constant Wide_Wide_Character_Ranges_Access := Right.Set;
Result : Wide_Wide_Character_Ranges (1 .. LS'Last + RS'Last);
-- Each range on the right can generate at least one more range in
-- the result, by splitting one of the left operand ranges.
N : Natural := 0;
R : Natural := 1;
L : Natural := 1;
Left_Low : Wide_Wide_Character;
-- Left_Low is lowest character of the L'th range not yet dealt with
begin
if LS'Last = 0 or else RS'Last = 0 then
return Left;
end if;
Left_Low := LS (L).Low;
while R <= RS'Last loop
-- If next right range is below current left range, skip it
if RS (R).High < Left_Low then
R := R + 1;
-- If next right range above current left range, copy remainder of
-- the left range to the result
elsif RS (R).Low > LS (L).High then
N := N + 1;
Result (N).Low := Left_Low;
Result (N).High := LS (L).High;
L := L + 1;
exit when L > LS'Last;
Left_Low := LS (L).Low;
else
-- Next right range overlaps bottom of left range
if RS (R).Low <= Left_Low then
-- Case of right range complete overlaps left range
if RS (R).High >= LS (L).High then
L := L + 1;
exit when L > LS'Last;
Left_Low := LS (L).Low;
-- Case of right range eats lower part of left range
else
Left_Low := Wide_Wide_Character'Succ (RS (R).High);
R := R + 1;
end if;
-- Next right range overlaps some of left range, but not bottom
else
N := N + 1;
Result (N).Low := Left_Low;
Result (N).High := Wide_Wide_Character'Pred (RS (R).Low);
-- Case of right range splits left range
if RS (R).High < LS (L).High then
Left_Low := Wide_Wide_Character'Succ (RS (R).High);
R := R + 1;
-- Case of right range overlaps top of left range
else
L := L + 1;
exit when L > LS'Last;
Left_Low := LS (L).Low;
end if;
end if;
end if;
end loop;
-- Copy remainder of left ranges to result
if L <= LS'Last then
N := N + 1;
Result (N).Low := Left_Low;
Result (N).High := LS (L).High;
loop
L := L + 1;
exit when L > LS'Last;
N := N + 1;
Result (N) := LS (L);
end loop;
end if;
return (AF.Controlled with
Set => new Wide_Wide_Character_Ranges'(Result (1 .. N)));
end "-";
---------
-- "=" --
---------
-- The sorted, discontiguous form is canonical, so equality can be used
function "=" (Left, Right : Wide_Wide_Character_Set) return Boolean is
begin
return Left.Set.all = Right.Set.all;
end "=";
-----------
-- "and" --
-----------
function "and"
(Left, Right : Wide_Wide_Character_Set) return Wide_Wide_Character_Set
is
LS : constant Wide_Wide_Character_Ranges_Access := Left.Set;
RS : constant Wide_Wide_Character_Ranges_Access := Right.Set;
Result : Wide_Wide_Character_Ranges (1 .. LS'Last + RS'Last);
N : Natural := 0;
L, R : Natural := 1;
begin
-- Loop to search for overlapping character ranges
while L <= LS'Last and then R <= RS'Last loop
if LS (L).High < RS (R).Low then
L := L + 1;
elsif RS (R).High < LS (L).Low then
R := R + 1;
-- Here we have LS (L).High >= RS (R).Low
-- and RS (R).High >= LS (L).Low
-- so we have an overlapping range
else
N := N + 1;
Result (N).Low :=
Wide_Wide_Character'Max (LS (L).Low, RS (R).Low);
Result (N).High :=
Wide_Wide_Character'Min (LS (L).High, RS (R).High);
if RS (R).High = LS (L).High then
L := L + 1;
R := R + 1;
elsif RS (R).High < LS (L).High then
R := R + 1;
else
L := L + 1;
end if;
end if;
end loop;
return (AF.Controlled with
Set => new Wide_Wide_Character_Ranges'(Result (1 .. N)));
end "and";
-----------
-- "not" --
-----------
function "not"
(Right : Wide_Wide_Character_Set) return Wide_Wide_Character_Set
is
RS : constant Wide_Wide_Character_Ranges_Access := Right.Set;
Result : Wide_Wide_Character_Ranges (1 .. RS'Last + 1);
N : Natural := 0;
begin
if RS'Last = 0 then
N := 1;
Result (1) := (Low => Wide_Wide_Character'First,
High => Wide_Wide_Character'Last);
else
if RS (1).Low /= Wide_Wide_Character'First then
N := N + 1;
Result (N).Low := Wide_Wide_Character'First;
Result (N).High := Wide_Wide_Character'Pred (RS (1).Low);
end if;
for K in 1 .. RS'Last - 1 loop
N := N + 1;
Result (N).Low := Wide_Wide_Character'Succ (RS (K).High);
Result (N).High := Wide_Wide_Character'Pred (RS (K + 1).Low);
end loop;
if RS (RS'Last).High /= Wide_Wide_Character'Last then
N := N + 1;
Result (N).Low := Wide_Wide_Character'Succ (RS (RS'Last).High);
Result (N).High := Wide_Wide_Character'Last;
end if;
end if;
return (AF.Controlled with
Set => new Wide_Wide_Character_Ranges'(Result (1 .. N)));
end "not";
----------
-- "or" --
----------
function "or"
(Left, Right : Wide_Wide_Character_Set) return Wide_Wide_Character_Set
is
LS : constant Wide_Wide_Character_Ranges_Access := Left.Set;
RS : constant Wide_Wide_Character_Ranges_Access := Right.Set;
Result : Wide_Wide_Character_Ranges (1 .. LS'Last + RS'Last);
N : Natural;
L, R : Natural;
begin
N := 0;
L := 1;
R := 1;
-- Loop through ranges in output file
loop
-- If no left ranges left, copy next right range
if L > LS'Last then
exit when R > RS'Last;
N := N + 1;
Result (N) := RS (R);
R := R + 1;
-- If no right ranges left, copy next left range
elsif R > RS'Last then
N := N + 1;
Result (N) := LS (L);
L := L + 1;
else
-- We have two ranges, choose lower one
N := N + 1;
if LS (L).Low <= RS (R).Low then
Result (N) := LS (L);
L := L + 1;
else
Result (N) := RS (R);
R := R + 1;
end if;
-- Loop to collapse ranges into last range
loop
-- Collapse next length range into current result range
-- if possible.
if L <= LS'Last
and then LS (L).Low <=
Wide_Wide_Character'Succ (Result (N).High)
then
Result (N).High :=
Wide_Wide_Character'Max (Result (N).High, LS (L).High);
L := L + 1;
-- Collapse next right range into current result range
-- if possible
elsif R <= RS'Last
and then RS (R).Low <=
Wide_Wide_Character'Succ (Result (N).High)
then
Result (N).High :=
Wide_Wide_Character'Max (Result (N).High, RS (R).High);
R := R + 1;
-- If neither range collapses, then done with this range
else
exit;
end if;
end loop;
end if;
end loop;
return (AF.Controlled with
Set => new Wide_Wide_Character_Ranges'(Result (1 .. N)));
end "or";
-----------
-- "xor" --
-----------
function "xor"
(Left, Right : Wide_Wide_Character_Set) return Wide_Wide_Character_Set
is
begin
return (Left or Right) - (Left and Right);
end "xor";
------------
-- Adjust --
------------
procedure Adjust (Object : in out Wide_Wide_Character_Mapping) is
begin
Object.Map := new Wide_Wide_Character_Mapping_Values'(Object.Map.all);
end Adjust;
procedure Adjust (Object : in out Wide_Wide_Character_Set) is
begin
Object.Set := new Wide_Wide_Character_Ranges'(Object.Set.all);
end Adjust;
--------------
-- Finalize --
--------------
procedure Finalize (Object : in out Wide_Wide_Character_Mapping) is
procedure Free is new Ada.Unchecked_Deallocation
(Wide_Wide_Character_Mapping_Values,
Wide_Wide_Character_Mapping_Values_Access);
begin
if Object.Map /= Null_Map'Unrestricted_Access then
Free (Object.Map);
end if;
end Finalize;
procedure Finalize (Object : in out Wide_Wide_Character_Set) is
procedure Free is new Ada.Unchecked_Deallocation
(Wide_Wide_Character_Ranges,
Wide_Wide_Character_Ranges_Access);
begin
if Object.Set /= Null_Range'Unrestricted_Access then
Free (Object.Set);
end if;
end Finalize;
----------------
-- Initialize --
----------------
procedure Initialize (Object : in out Wide_Wide_Character_Mapping) is
begin
Object := Identity;
end Initialize;
procedure Initialize (Object : in out Wide_Wide_Character_Set) is
begin
Object := Null_Set;
end Initialize;
-----------
-- Is_In --
-----------
function Is_In
(Element : Wide_Wide_Character;
Set : Wide_Wide_Character_Set) return Boolean
is
L, R, M : Natural;
SS : constant Wide_Wide_Character_Ranges_Access := Set.Set;
begin
L := 1;
R := SS'Last;
-- Binary search loop. The invariant is that if Element is in any of
-- of the constituent ranges it is in one between Set (L) and Set (R).
loop
if L > R then
return False;
else
M := (L + R) / 2;
if Element > SS (M).High then
L := M + 1;
elsif Element < SS (M).Low then
R := M - 1;
else
return True;
end if;
end if;
end loop;
end Is_In;
---------------
-- Is_Subset --
---------------
function Is_Subset
(Elements : Wide_Wide_Character_Set;
Set : Wide_Wide_Character_Set) return Boolean
is
ES : constant Wide_Wide_Character_Ranges_Access := Elements.Set;
SS : constant Wide_Wide_Character_Ranges_Access := Set.Set;
S : Positive := 1;
E : Positive := 1;
begin
loop
-- If no more element ranges, done, and result is true
if E > ES'Last then
return True;
-- If more element ranges, but no more set ranges, result is false
elsif S > SS'Last then
return False;
-- Remove irrelevant set range
elsif SS (S).High < ES (E).Low then
S := S + 1;
-- Get rid of element range that is properly covered by set
elsif SS (S).Low <= ES (E).Low
and then ES (E).High <= SS (S).High
then
E := E + 1;
-- Otherwise we have a non-covered element range, result is false
else
return False;
end if;
end loop;
end Is_Subset;
---------------
-- To_Domain --
---------------
function To_Domain
(Map : Wide_Wide_Character_Mapping) return Wide_Wide_Character_Sequence
is
begin
return Map.Map.Domain;
end To_Domain;
----------------
-- To_Mapping --
----------------
function To_Mapping
(From, To : Wide_Wide_Character_Sequence)
return Wide_Wide_Character_Mapping
is
Domain : Wide_Wide_Character_Sequence (1 .. From'Length);
Rangev : Wide_Wide_Character_Sequence (1 .. To'Length);
N : Natural := 0;
begin
if From'Length /= To'Length then
raise Translation_Error;
else
pragma Warnings (Off); -- apparent uninit use of Domain
for J in From'Range loop
for M in 1 .. N loop
if From (J) = Domain (M) then
raise Translation_Error;
elsif From (J) < Domain (M) then
Domain (M + 1 .. N + 1) := Domain (M .. N);
Rangev (M + 1 .. N + 1) := Rangev (M .. N);
Domain (M) := From (J);
Rangev (M) := To (J);
goto Continue;
end if;
end loop;
Domain (N + 1) := From (J);
Rangev (N + 1) := To (J);
<<Continue>>
N := N + 1;
end loop;
pragma Warnings (On);
return (AF.Controlled with
Map => new Wide_Wide_Character_Mapping_Values'(
Length => N,
Domain => Domain (1 .. N),
Rangev => Rangev (1 .. N)));
end if;
end To_Mapping;
--------------
-- To_Range --
--------------
function To_Range
(Map : Wide_Wide_Character_Mapping) return Wide_Wide_Character_Sequence
is
begin
return Map.Map.Rangev;
end To_Range;
---------------
-- To_Ranges --
---------------
function To_Ranges
(Set : Wide_Wide_Character_Set) return Wide_Wide_Character_Ranges
is
begin
return Set.Set.all;
end To_Ranges;
-----------------
-- To_Sequence --
-----------------
function To_Sequence
(Set : Wide_Wide_Character_Set) return Wide_Wide_Character_Sequence
is
SS : constant Wide_Wide_Character_Ranges_Access := Set.Set;
N : Natural := 0;
Count : Natural := 0;
begin
for J in SS'Range loop
Count :=
Count + (Wide_Wide_Character'Pos (SS (J).High) -
Wide_Wide_Character'Pos (SS (J).Low) + 1);
end loop;
return Result : Wide_Wide_String (1 .. Count) do
for J in SS'Range loop
for K in SS (J).Low .. SS (J).High loop
N := N + 1;
Result (N) := K;
end loop;
end loop;
end return;
end To_Sequence;
------------
-- To_Set --
------------
-- Case of multiple range input
function To_Set
(Ranges : Wide_Wide_Character_Ranges) return Wide_Wide_Character_Set
is
Result : Wide_Wide_Character_Ranges (Ranges'Range);
N : Natural := 0;
J : Natural;
begin
-- The output of To_Set is required to be sorted by increasing Low
-- values, and discontiguous, so first we sort them as we enter them,
-- using a simple insertion sort.
pragma Warnings (Off);
-- Kill bogus warning on Result being uninitialized
for J in Ranges'Range loop
for K in 1 .. N loop
if Ranges (J).Low < Result (K).Low then
Result (K + 1 .. N + 1) := Result (K .. N);
Result (K) := Ranges (J);
goto Continue;
end if;
end loop;
Result (N + 1) := Ranges (J);
<<Continue>>
N := N + 1;
end loop;
pragma Warnings (On);
-- Now collapse any contiguous or overlapping ranges
J := 1;
while J < N loop
if Result (J).High < Result (J).Low then
N := N - 1;
Result (J .. N) := Result (J + 1 .. N + 1);
elsif Wide_Wide_Character'Succ (Result (J).High) >=
Result (J + 1).Low
then
Result (J).High :=
Wide_Wide_Character'Max (Result (J).High, Result (J + 1).High);
N := N - 1;
Result (J + 1 .. N) := Result (J + 2 .. N + 1);
else
J := J + 1;
end if;
end loop;
if Result (N).High < Result (N).Low then
N := N - 1;
end if;
return (AF.Controlled with
Set => new Wide_Wide_Character_Ranges'(Result (1 .. N)));
end To_Set;
-- Case of single range input
function To_Set
(Span : Wide_Wide_Character_Range) return Wide_Wide_Character_Set
is
begin
if Span.Low > Span.High then
return Null_Set;
-- This is safe, because there is no procedure with parameter
-- Wide_Wide_Character_Set of mode "out" or "in out".
else
return (AF.Controlled with
Set => new Wide_Wide_Character_Ranges'(1 => Span));
end if;
end To_Set;
-- Case of wide string input
function To_Set
(Sequence : Wide_Wide_Character_Sequence) return Wide_Wide_Character_Set
is
R : Wide_Wide_Character_Ranges (1 .. Sequence'Length);
begin
for J in R'Range loop
R (J) := (Sequence (J), Sequence (J));
end loop;
return To_Set (R);
end To_Set;
-- Case of single wide character input
function To_Set
(Singleton : Wide_Wide_Character) return Wide_Wide_Character_Set
is
begin
return
(AF.Controlled with
Set => new Wide_Wide_Character_Ranges'(1 => (Singleton, Singleton)));
end To_Set;
-----------
-- Value --
-----------
function Value
(Map : Wide_Wide_Character_Mapping;
Element : Wide_Wide_Character) return Wide_Wide_Character
is
L, R, M : Natural;
MV : constant Wide_Wide_Character_Mapping_Values_Access := Map.Map;
begin
L := 1;
R := MV.Domain'Last;
-- Binary search loop
loop
-- If not found, identity
if L > R then
return Element;
-- Otherwise do binary divide
else
M := (L + R) / 2;
if Element < MV.Domain (M) then
R := M - 1;
elsif Element > MV.Domain (M) then
L := M + 1;
else -- Element = MV.Domain (M) then
return MV.Rangev (M);
end if;
end if;
end loop;
end Value;
end Ada.Strings.Wide_Wide_Maps;
| 28.364973 | 78 | 0.489513 |
139f032b697390b37a1b521967bf1c38dca78103 | 252,939 | adb | Ada | model_multistart/0/hls4ml_prj/myproject_prj/solution1/.autopilot/db/dense_large_rf_gt_ni.sched.adb | filipemlins/nas-hls4ml | b35afc4f684d803d352776c40f3a6cbbf47c4b1c | [
"MIT"
] | null | null | null | model_multistart/0/hls4ml_prj/myproject_prj/solution1/.autopilot/db/dense_large_rf_gt_ni.sched.adb | filipemlins/nas-hls4ml | b35afc4f684d803d352776c40f3a6cbbf47c4b1c | [
"MIT"
] | null | null | null | model_multistart/0/hls4ml_prj/myproject_prj/solution1/.autopilot/db/dense_large_rf_gt_ni.sched.adb | filipemlins/nas-hls4ml | b35afc4f684d803d352776c40f3a6cbbf47c4b1c | [
"MIT"
] | null | null | null | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="15">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>dense_large_rf_gt_ni</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>data_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>data.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>32</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>res_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>res.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>16</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>91</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>5</id>
<name>acc_V</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>126</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</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>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>126</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>acc.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>127</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>6</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>130</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>130</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>128</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.76</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>iacc</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>iacc</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>129</item>
<item>130</item>
<item>132</item>
<item>133</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>exitcond4</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>130</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>130</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>134</item>
<item>136</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.36</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>iacc_1</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>130</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>130</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>iacc</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>137</item>
<item>139</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.78</m_delay>
<m_topoIndex>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>130</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>130</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>140</item>
<item>141</item>
<item>142</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>tmp</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>132</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>132</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>144</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>acc_V_addr</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>132</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>132</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>145</item>
<item>147</item>
<item>148</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>132</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>132</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>150</item>
<item>151</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.32</m_delay>
<m_topoIndex>9</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>130</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>130</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>152</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>10</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>151</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>151</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>143</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.76</m_delay>
<m_topoIndex>11</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>w_index</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ir</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>153</item>
<item>154</item>
<item>156</item>
<item>157</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>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>in_index</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>168</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>168</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>158</item>
<item>159</item>
<item>161</item>
<item>162</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>13</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>w_index_cast</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>151</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>151</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>163</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>14</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>exitcond</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>151</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>151</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>164</item>
<item>166</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.66</m_delay>
<m_topoIndex>15</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>ir</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>151</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>151</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>ir</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>167</item>
<item>169</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.82</m_delay>
<m_topoIndex>16</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>151</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>151</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>170</item>
<item>171</item>
<item>172</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>17</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>tmp_s</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>155</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>155</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>174</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>18</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>outidx6_addr</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>155</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>155</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>175</item>
<item>176</item>
<item>177</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>19</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>out_index</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>155</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>155</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>out_index</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>178</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.25</m_delay>
<m_topoIndex>20</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>out_index_cast</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>155</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>155</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>179</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>25</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>tmp_67</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</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>180</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>22</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>data_V_addr</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>181</item>
<item>182</item>
<item>183</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>23</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>data_V_load</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>184</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.32</m_delay>
<m_topoIndex>24</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>158</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>158</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>185</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.76</m_delay>
<m_topoIndex>26</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>im</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>im</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>187</item>
<item>188</item>
<item>189</item>
<item>190</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>27</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>out_index1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>out_index</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>191</item>
<item>192</item>
<item>193</item>
<item>194</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>28</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>w_index1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>w_index</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>195</item>
<item>196</item>
<item>197</item>
<item>198</item>
</oprand_edges>
<opcode>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>29</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>tmp_91</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>158</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>158</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>200</item>
<item>201</item>
<item>203</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>30</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>im_1</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>158</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>158</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>im</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>204</item>
<item>206</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.56</m_delay>
<m_topoIndex>31</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>158</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>158</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>207</item>
<item>208</item>
<item>209</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>32</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>tmp_71</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</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>47</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name>tmp_92</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>211</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>33</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>tmp_5</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</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>212</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>34</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>w7_V_addr</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>213</item>
<item>214</item>
<item>215</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>35</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name>w7_V_load</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>25</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>216</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.25</m_delay>
<m_topoIndex>36</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>w7_V_load_cast</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>28</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>217</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>43</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>tmp_13</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>151</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>151</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>219</item>
<item>220</item>
<item>222</item>
<item>224</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>37</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>tmp_93</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>151</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>151</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>226</item>
<item>227</item>
<item>228</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>38</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name>p_shl8</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>151</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>151</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>230</item>
<item>231</item>
<item>233</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>39</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name>tmp_94</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>151</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>151</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>235</item>
<item>236</item>
<item>238</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>40</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name>tmp_95</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>151</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>151</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>239</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<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="_45">
<Value>
<Obj>
<type>0</type>
<id>61</id>
<name>tmp_96</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>240</item>
<item>241</item>
</oprand_edges>
<opcode>sub</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.78</m_delay>
<m_topoIndex>42</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>62</id>
<name>tmp_97</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>28</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>242</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>44</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name>tmp_98</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>28</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>243</item>
<item>244</item>
</oprand_edges>
<opcode>lshr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>4.23</m_delay>
<m_topoIndex>45</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>tmp_99</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>245</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>46</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>65</id>
<name>p_Val2_5</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Val2__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>247</item>
<item>248</item>
<item>249</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>3.89</m_delay>
<m_topoIndex>48</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>66</id>
<name>acc_V_addr_2</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>250</item>
<item>251</item>
<item>252</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>49</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>67</id>
<name>p_Val2_s</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Val2__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>253</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.32</m_delay>
<m_topoIndex>50</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>68</id>
<name>lhs_V</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>lhs.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>254</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>51</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name>rhs_V</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>rhs.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>255</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>52</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>70</id>
<name>ret_V</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>ret.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>256</item>
<item>257</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.81</m_delay>
<m_topoIndex>53</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name>p_Result_s</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>259</item>
<item>260</item>
<item>262</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>54</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name>p_Val2_7</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Val2__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>263</item>
<item>264</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.81</m_delay>
<m_topoIndex>55</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>73</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</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>265</item>
<item>266</item>
<item>419</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.32</m_delay>
<m_topoIndex>56</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>74</id>
<name>p_Result_13</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>268</item>
<item>269</item>
<item>271</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>57</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>75</id>
<name>tmp_15</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</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>272</item>
<item>274</item>
</oprand_edges>
<opcode>xor</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>58</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>76</id>
<name>overflow</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>overflow</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>275</item>
<item>276</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.97</m_delay>
<m_topoIndex>59</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>77</id>
<name>tmp_72</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</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>277</item>
<item>278</item>
</oprand_edges>
<opcode>xor</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>60</m_topoIndex>
<m_clusterGroupNumber>2</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>78</id>
<name>underflow</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>underflow</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>279</item>
<item>280</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.97</m_delay>
<m_topoIndex>61</m_topoIndex>
<m_clusterGroupNumber>2</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_63">
<Value>
<Obj>
<type>0</type>
<id>79</id>
<name>brmerge6</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</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>281</item>
<item>282</item>
</oprand_edges>
<opcode>xor</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.97</m_delay>
<m_topoIndex>62</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_64">
<Value>
<Obj>
<type>0</type>
<id>80</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</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>283</item>
<item>284</item>
<item>285</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>63</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_65">
<Value>
<Obj>
<type>0</type>
<id>82</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</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>286</item>
<item>287</item>
<item>288</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>64</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_66">
<Value>
<Obj>
<type>0</type>
<id>84</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</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>293</item>
<item>294</item>
<item>295</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>65</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_67">
<Value>
<Obj>
<type>0</type>
<id>86</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>297</item>
<item>298</item>
<item>422</item>
<item>423</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.32</m_delay>
<m_topoIndex>66</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_68">
<Value>
<Obj>
<type>0</type>
<id>87</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>299</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>67</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_69">
<Value>
<Obj>
<type>0</type>
<id>89</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>300</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>68</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_70">
<Value>
<Obj>
<type>0</type>
<id>91</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>290</item>
<item>291</item>
<item>420</item>
<item>421</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.32</m_delay>
<m_topoIndex>69</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_71">
<Value>
<Obj>
<type>0</type>
<id>92</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>292</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>70</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_72">
<Value>
<Obj>
<type>0</type>
<id>94</id>
<name>w_index_1</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>162</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>162</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>w_index</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>301</item>
<item>303</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.73</m_delay>
<m_topoIndex>71</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_73">
<Value>
<Obj>
<type>0</type>
<id>95</id>
<name>tmp_102</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>163</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>163</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>304</item>
<item>305</item>
<item>306</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>72</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_74">
<Value>
<Obj>
<type>0</type>
<id>96</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>163</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>163</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>307</item>
<item>308</item>
<item>309</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>73</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_75">
<Value>
<Obj>
<type>0</type>
<id>98</id>
<name>out_index_1</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>164</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>164</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>out_index</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>310</item>
<item>312</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.78</m_delay>
<m_topoIndex>74</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_76">
<Value>
<Obj>
<type>0</type>
<id>99</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>158</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>158</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>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.00</m_delay>
<m_topoIndex>75</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_77">
<Value>
<Obj>
<type>0</type>
<id>101</id>
<name>in_index_1</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>167</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>167</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>in_index</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>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.55</m_delay>
<m_topoIndex>76</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_78">
<Value>
<Obj>
<type>0</type>
<id>102</id>
<name>tmp_103</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>168</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>168</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>27</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>317</item>
<item>318</item>
<item>320</item>
<item>322</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>77</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_79">
<Value>
<Obj>
<type>0</type>
<id>103</id>
<name>icmp</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>168</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>168</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>323</item>
<item>325</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.45</m_delay>
<m_topoIndex>78</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_80">
<Value>
<Obj>
<type>0</type>
<id>104</id>
<name>p_s</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>168</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>168</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>326</item>
<item>327</item>
<item>328</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.69</m_delay>
<m_topoIndex>79</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_81">
<Value>
<Obj>
<type>0</type>
<id>106</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>151</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>151</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>329</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>80</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_82">
<Value>
<Obj>
<type>0</type>
<id>108</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>176</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>176</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>173</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.76</m_delay>
<m_topoIndex>21</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_83">
<Value>
<Obj>
<type>0</type>
<id>110</id>
<name>ires</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ires</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>330</item>
<item>331</item>
<item>332</item>
<item>333</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>81</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_84">
<Value>
<Obj>
<type>0</type>
<id>111</id>
<name>tmp_68</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>176</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>176</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>334</item>
<item>335</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.36</m_delay>
<m_topoIndex>82</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_85">
<Value>
<Obj>
<type>0</type>
<id>113</id>
<name>ires_1</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>176</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>176</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>ires</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>336</item>
<item>337</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.78</m_delay>
<m_topoIndex>83</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_86">
<Value>
<Obj>
<type>0</type>
<id>114</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>176</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>176</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>338</item>
<item>339</item>
<item>340</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>84</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_87">
<Value>
<Obj>
<type>0</type>
<id>117</id>
<name>tmp_70</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>178</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>178</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>341</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>85</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_88">
<Value>
<Obj>
<type>0</type>
<id>118</id>
<name>acc_V_addr_1</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>178</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>178</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>342</item>
<item>343</item>
<item>344</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>86</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_89">
<Value>
<Obj>
<type>0</type>
<id>119</id>
<name>acc_V_load</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>178</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>178</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>345</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.32</m_delay>
<m_topoIndex>87</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_90">
<Value>
<Obj>
<type>0</type>
<id>120</id>
<name>res_V_addr</name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>178</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>178</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>346</item>
<item>347</item>
<item>348</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>89</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_91">
<Value>
<Obj>
<type>0</type>
<id>121</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>178</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>178</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>349</item>
<item>350</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.32</m_delay>
<m_topoIndex>90</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_92">
<Value>
<Obj>
<type>0</type>
<id>122</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>176</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>176</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>351</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>91</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_93">
<Value>
<Obj>
<type>0</type>
<id>124</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>180</lineNumber>
<contextFuncName>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large_rf_gt_nin_rem0&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config7_mult&gt;</second>
</first>
<second>180</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>88</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>28</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_94">
<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>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_95">
<Value>
<Obj>
<type>2</type>
<id>131</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_96">
<Value>
<Obj>
<type>2</type>
<id>135</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>16</content>
</item>
<item class_id_reference="16" object_id="_97">
<Value>
<Obj>
<type>2</type>
<id>138</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_98">
<Value>
<Obj>
<type>2</type>
<id>146</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="_99">
<Value>
<Obj>
<type>2</type>
<id>149</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>14</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_100">
<Value>
<Obj>
<type>2</type>
<id>155</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_101">
<Value>
<Obj>
<type>2</type>
<id>160</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_102">
<Value>
<Obj>
<type>2</type>
<id>165</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>9</bitwidth>
</Value>
<const_type>0</const_type>
<content>256</content>
</item>
<item class_id_reference="16" object_id="_103">
<Value>
<Obj>
<type>2</type>
<id>168</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>9</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_104">
<Value>
<Obj>
<type>2</type>
<id>186</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>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_105">
<Value>
<Obj>
<type>2</type>
<id>202</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_106">
<Value>
<Obj>
<type>2</type>
<id>205</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>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_107">
<Value>
<Obj>
<type>2</type>
<id>221</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="_108">
<Value>
<Obj>
<type>2</type>
<id>223</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>9</content>
</item>
<item class_id_reference="16" object_id="_109">
<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>1</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_110">
<Value>
<Obj>
<type>2</type>
<id>237</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_111">
<Value>
<Obj>
<type>2</type>
<id>246</id>
<name>product</name>
<fileName></fileName>
<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>14</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:product></content>
</item>
<item class_id_reference="16" object_id="_112">
<Value>
<Obj>
<type>2</type>
<id>261</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>14</content>
</item>
<item class_id_reference="16" object_id="_113">
<Value>
<Obj>
<type>2</type>
<id>270</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>13</content>
</item>
<item class_id_reference="16" object_id="_114">
<Value>
<Obj>
<type>2</type>
<id>273</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_115">
<Value>
<Obj>
<type>2</type>
<id>289</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>14</bitwidth>
</Value>
<const_type>0</const_type>
<content>8191</content>
</item>
<item class_id_reference="16" object_id="_116">
<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>14</bitwidth>
</Value>
<const_type>0</const_type>
<content>8192</content>
</item>
<item class_id_reference="16" object_id="_117">
<Value>
<Obj>
<type>2</type>
<id>302</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<const_type>0</const_type>
<content>256</content>
</item>
<item class_id_reference="16" object_id="_118">
<Value>
<Obj>
<type>2</type>
<id>311</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_119">
<Value>
<Obj>
<type>2</type>
<id>319</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>5</content>
</item>
<item class_id_reference="16" object_id="_120">
<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>31</content>
</item>
<item class_id_reference="16" object_id="_121">
<Value>
<Obj>
<type>2</type>
<id>324</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>27</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>20</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_122">
<Obj>
<type>3</type>
<id>7</id>
<name>.preheader76.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>2</count>
<item_version>0</item_version>
<item>5</item>
<item>6</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_123">
<Obj>
<type>3</type>
<id>13</id>
<name>.preheader76</name>
<fileName></fileName>
<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>8</item>
<item>9</item>
<item>11</item>
<item>12</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_124">
<Obj>
<type>3</type>
<id>19</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>15</item>
<item>16</item>
<item>17</item>
<item>18</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_125">
<Obj>
<type>3</type>
<id>21</id>
<name>.preheader74.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>1</count>
<item_version>0</item_version>
<item>20</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_126">
<Obj>
<type>3</type>
<id>29</id>
<name>.preheader74</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>22</item>
<item>23</item>
<item>24</item>
<item>25</item>
<item>27</item>
<item>28</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_127">
<Obj>
<type>3</type>
<id>40</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>8</count>
<item_version>0</item_version>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_128">
<Obj>
<type>3</type>
<id>48</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>41</item>
<item>42</item>
<item>43</item>
<item>44</item>
<item>46</item>
<item>47</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_129">
<Obj>
<type>3</type>
<id>81</id>
<name>_ZN13ap_fixed_baseILi15ELi3ELb1EL9ap_q_mode5EL9ap_o_mode3ELi0EEC1ILi14ELi2ELb1ELS0_0ELS1_0ELi0EEERKS_IXT_EXT0_EXT1_EXT2_EXT3_EXT4_EE.exit9.i.i_ifconv</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>31</count>
<item_version>0</item_version>
<item>50</item>
<item>51</item>
<item>52</item>
<item>53</item>
<item>54</item>
<item>55</item>
<item>56</item>
<item>57</item>
<item>58</item>
<item>59</item>
<item>60</item>
<item>61</item>
<item>62</item>
<item>63</item>
<item>64</item>
<item>65</item>
<item>66</item>
<item>67</item>
<item>68</item>
<item>69</item>
<item>70</item>
<item>71</item>
<item>72</item>
<item>73</item>
<item>74</item>
<item>75</item>
<item>76</item>
<item>77</item>
<item>78</item>
<item>79</item>
<item>80</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_130">
<Obj>
<type>3</type>
<id>83</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>82</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_131">
<Obj>
<type>3</type>
<id>85</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>84</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_132">
<Obj>
<type>3</type>
<id>88</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>86</item>
<item>87</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_133">
<Obj>
<type>3</type>
<id>90</id>
<name>._crit_edge77</name>
<fileName></fileName>
<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>89</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_134">
<Obj>
<type>3</type>
<id>93</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>91</item>
<item>92</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_135">
<Obj>
<type>3</type>
<id>97</id>
<name>_ZN13ap_fixed_baseILi14ELi2ELb1EL9ap_q_mode0EL9ap_o_mode0ELi0EEpLILi14ELi2ELb1ELS0_0ELS1_0ELi0EEERS2_RKS_IXT_EXT0_EXT1_EXT2_EXT3_EXT4_EE.exit</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>94</item>
<item>95</item>
<item>96</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_136">
<Obj>
<type>3</type>
<id>100</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>98</item>
<item>99</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_137">
<Obj>
<type>3</type>
<id>107</id>
<name>.loopexit</name>
<fileName></fileName>
<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>101</item>
<item>102</item>
<item>103</item>
<item>104</item>
<item>106</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_138">
<Obj>
<type>3</type>
<id>109</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>1</count>
<item_version>0</item_version>
<item>108</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_139">
<Obj>
<type>3</type>
<id>115</id>
<name>.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>4</count>
<item_version>0</item_version>
<item>110</item>
<item>111</item>
<item>113</item>
<item>114</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_140">
<Obj>
<type>3</type>
<id>123</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>117</item>
<item>118</item>
<item>119</item>
<item>120</item>
<item>121</item>
<item>122</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_141">
<Obj>
<type>3</type>
<id>125</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>124</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>213</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_142">
<id>127</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>5</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_143">
<id>128</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>6</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_144">
<id>129</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>8</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_145">
<id>130</id>
<edge_type>2</edge_type>
<source_obj>19</source_obj>
<sink_obj>8</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_146">
<id>132</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>8</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_147">
<id>133</id>
<edge_type>2</edge_type>
<source_obj>7</source_obj>
<sink_obj>8</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_148">
<id>134</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_149">
<id>136</id>
<edge_type>1</edge_type>
<source_obj>135</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_150">
<id>137</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>11</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_151">
<id>139</id>
<edge_type>1</edge_type>
<source_obj>138</source_obj>
<sink_obj>11</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_152">
<id>140</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_153">
<id>141</id>
<edge_type>2</edge_type>
<source_obj>19</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_154">
<id>142</id>
<edge_type>2</edge_type>
<source_obj>21</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_155">
<id>143</id>
<edge_type>2</edge_type>
<source_obj>29</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_156">
<id>144</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_157">
<id>145</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_158">
<id>147</id>
<edge_type>1</edge_type>
<source_obj>146</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_159">
<id>148</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_160">
<id>150</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_161">
<id>151</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_162">
<id>152</id>
<edge_type>2</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="_163">
<id>153</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_164">
<id>154</id>
<edge_type>2</edge_type>
<source_obj>107</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_165">
<id>156</id>
<edge_type>1</edge_type>
<source_obj>155</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_166">
<id>157</id>
<edge_type>2</edge_type>
<source_obj>21</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_167">
<id>158</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_168">
<id>159</id>
<edge_type>2</edge_type>
<source_obj>107</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_169">
<id>161</id>
<edge_type>1</edge_type>
<source_obj>160</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_170">
<id>162</id>
<edge_type>2</edge_type>
<source_obj>21</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_171">
<id>163</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_172">
<id>164</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_173">
<id>166</id>
<edge_type>1</edge_type>
<source_obj>165</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_174">
<id>167</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_175">
<id>169</id>
<edge_type>1</edge_type>
<source_obj>168</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_176">
<id>170</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_177">
<id>171</id>
<edge_type>2</edge_type>
<source_obj>40</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_178">
<id>172</id>
<edge_type>2</edge_type>
<source_obj>109</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_179">
<id>173</id>
<edge_type>2</edge_type>
<source_obj>115</source_obj>
<sink_obj>108</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_180">
<id>174</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_181">
<id>175</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_182">
<id>176</id>
<edge_type>1</edge_type>
<source_obj>146</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_183">
<id>177</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_184">
<id>178</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_185">
<id>179</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_186">
<id>180</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_187">
<id>181</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_188">
<id>182</id>
<edge_type>1</edge_type>
<source_obj>146</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_189">
<id>183</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_190">
<id>184</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_191">
<id>185</id>
<edge_type>2</edge_type>
<source_obj>48</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_192">
<id>187</id>
<edge_type>1</edge_type>
<source_obj>186</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_193">
<id>188</id>
<edge_type>2</edge_type>
<source_obj>40</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_194">
<id>189</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_195">
<id>190</id>
<edge_type>2</edge_type>
<source_obj>100</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_196">
<id>191</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_197">
<id>192</id>
<edge_type>2</edge_type>
<source_obj>40</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_198">
<id>193</id>
<edge_type>1</edge_type>
<source_obj>98</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_199">
<id>194</id>
<edge_type>2</edge_type>
<source_obj>100</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_200">
<id>195</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_201">
<id>196</id>
<edge_type>2</edge_type>
<source_obj>40</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_202">
<id>197</id>
<edge_type>1</edge_type>
<source_obj>94</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_203">
<id>198</id>
<edge_type>2</edge_type>
<source_obj>100</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_204">
<id>201</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_205">
<id>203</id>
<edge_type>1</edge_type>
<source_obj>202</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_206">
<id>204</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_207">
<id>206</id>
<edge_type>1</edge_type>
<source_obj>205</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_208">
<id>207</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_209">
<id>208</id>
<edge_type>2</edge_type>
<source_obj>81</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_210">
<id>209</id>
<edge_type>2</edge_type>
<source_obj>107</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_211">
<id>210</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_212">
<id>211</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_213">
<id>212</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="_214">
<id>213</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_215">
<id>214</id>
<edge_type>1</edge_type>
<source_obj>146</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_216">
<id>215</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_217">
<id>216</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_218">
<id>217</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_219">
<id>220</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_220">
<id>222</id>
<edge_type>1</edge_type>
<source_obj>221</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_221">
<id>224</id>
<edge_type>1</edge_type>
<source_obj>223</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_222">
<id>227</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_223">
<id>228</id>
<edge_type>1</edge_type>
<source_obj>221</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_224">
<id>231</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="_225">
<id>233</id>
<edge_type>1</edge_type>
<source_obj>232</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_226">
<id>236</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_227">
<id>238</id>
<edge_type>1</edge_type>
<source_obj>237</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_228">
<id>239</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="_229">
<id>240</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_230">
<id>241</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="_231">
<id>242</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_232">
<id>243</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_233">
<id>244</id>
<edge_type>1</edge_type>
<source_obj>62</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_234">
<id>245</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_235">
<id>247</id>
<edge_type>1</edge_type>
<source_obj>246</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_236">
<id>248</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_237">
<id>249</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="_238">
<id>250</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_239">
<id>251</id>
<edge_type>1</edge_type>
<source_obj>146</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_240">
<id>252</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_241">
<id>253</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="_242">
<id>254</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="_243">
<id>255</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_244">
<id>256</id>
<edge_type>1</edge_type>
<source_obj>68</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_245">
<id>257</id>
<edge_type>1</edge_type>
<source_obj>69</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_246">
<id>260</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="_247">
<id>262</id>
<edge_type>1</edge_type>
<source_obj>261</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_248">
<id>263</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_249">
<id>264</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_250">
<id>265</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="_251">
<id>266</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_252">
<id>269</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>74</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_253">
<id>271</id>
<edge_type>1</edge_type>
<source_obj>270</source_obj>
<sink_obj>74</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_254">
<id>272</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_255">
<id>274</id>
<edge_type>1</edge_type>
<source_obj>273</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_256">
<id>275</id>
<edge_type>1</edge_type>
<source_obj>74</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_257">
<id>276</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_258">
<id>277</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="_259">
<id>278</id>
<edge_type>1</edge_type>
<source_obj>273</source_obj>
<sink_obj>77</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_260">
<id>279</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_261">
<id>280</id>
<edge_type>1</edge_type>
<source_obj>77</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_262">
<id>281</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>79</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_263">
<id>282</id>
<edge_type>1</edge_type>
<source_obj>74</source_obj>
<sink_obj>79</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_264">
<id>283</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_265">
<id>284</id>
<edge_type>2</edge_type>
<source_obj>97</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_266">
<id>285</id>
<edge_type>2</edge_type>
<source_obj>83</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_267">
<id>286</id>
<edge_type>1</edge_type>
<source_obj>76</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_268">
<id>287</id>
<edge_type>2</edge_type>
<source_obj>85</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_269">
<id>288</id>
<edge_type>2</edge_type>
<source_obj>93</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_270">
<id>290</id>
<edge_type>1</edge_type>
<source_obj>289</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_271">
<id>291</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_272">
<id>292</id>
<edge_type>2</edge_type>
<source_obj>97</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_273">
<id>293</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_274">
<id>294</id>
<edge_type>2</edge_type>
<source_obj>90</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_275">
<id>295</id>
<edge_type>2</edge_type>
<source_obj>88</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_276">
<id>297</id>
<edge_type>1</edge_type>
<source_obj>296</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_277">
<id>298</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_278">
<id>299</id>
<edge_type>2</edge_type>
<source_obj>90</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_279">
<id>300</id>
<edge_type>2</edge_type>
<source_obj>97</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_280">
<id>301</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>94</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_281">
<id>303</id>
<edge_type>1</edge_type>
<source_obj>302</source_obj>
<sink_obj>94</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_282">
<id>305</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="_283">
<id>306</id>
<edge_type>1</edge_type>
<source_obj>223</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_284">
<id>307</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="_285">
<id>308</id>
<edge_type>2</edge_type>
<source_obj>100</source_obj>
<sink_obj>96</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_286">
<id>309</id>
<edge_type>2</edge_type>
<source_obj>107</source_obj>
<sink_obj>96</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_287">
<id>310</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>98</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_288">
<id>312</id>
<edge_type>1</edge_type>
<source_obj>311</source_obj>
<sink_obj>98</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_289">
<id>313</id>
<edge_type>2</edge_type>
<source_obj>48</source_obj>
<sink_obj>99</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_290">
<id>314</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_291">
<id>315</id>
<edge_type>1</edge_type>
<source_obj>202</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_292">
<id>318</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="_293">
<id>320</id>
<edge_type>1</edge_type>
<source_obj>319</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_294">
<id>322</id>
<edge_type>1</edge_type>
<source_obj>321</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_295">
<id>323</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="_296">
<id>325</id>
<edge_type>1</edge_type>
<source_obj>324</source_obj>
<sink_obj>103</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_297">
<id>326</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>104</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_298">
<id>327</id>
<edge_type>1</edge_type>
<source_obj>160</source_obj>
<sink_obj>104</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_299">
<id>328</id>
<edge_type>1</edge_type>
<source_obj>101</source_obj>
<sink_obj>104</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_300">
<id>329</id>
<edge_type>2</edge_type>
<source_obj>29</source_obj>
<sink_obj>106</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_301">
<id>330</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>110</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_302">
<id>331</id>
<edge_type>2</edge_type>
<source_obj>123</source_obj>
<sink_obj>110</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_303">
<id>332</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>110</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_304">
<id>333</id>
<edge_type>2</edge_type>
<source_obj>109</source_obj>
<sink_obj>110</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_305">
<id>334</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>111</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_306">
<id>335</id>
<edge_type>1</edge_type>
<source_obj>135</source_obj>
<sink_obj>111</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_307">
<id>336</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>113</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_308">
<id>337</id>
<edge_type>1</edge_type>
<source_obj>138</source_obj>
<sink_obj>113</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_309">
<id>338</id>
<edge_type>1</edge_type>
<source_obj>111</source_obj>
<sink_obj>114</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_310">
<id>339</id>
<edge_type>2</edge_type>
<source_obj>123</source_obj>
<sink_obj>114</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_311">
<id>340</id>
<edge_type>2</edge_type>
<source_obj>125</source_obj>
<sink_obj>114</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_312">
<id>341</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>117</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_313">
<id>342</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>118</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_314">
<id>343</id>
<edge_type>1</edge_type>
<source_obj>146</source_obj>
<sink_obj>118</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_315">
<id>344</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>118</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_316">
<id>345</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>119</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_317">
<id>346</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_318">
<id>347</id>
<edge_type>1</edge_type>
<source_obj>146</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_319">
<id>348</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_320">
<id>349</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>121</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_321">
<id>350</id>
<edge_type>1</edge_type>
<source_obj>120</source_obj>
<sink_obj>121</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_322">
<id>351</id>
<edge_type>2</edge_type>
<source_obj>115</source_obj>
<sink_obj>122</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_323">
<id>392</id>
<edge_type>2</edge_type>
<source_obj>7</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_324">
<id>393</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_325">
<id>394</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_326">
<id>395</id>
<edge_type>2</edge_type>
<source_obj>19</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_327">
<id>396</id>
<edge_type>2</edge_type>
<source_obj>21</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_328">
<id>397</id>
<edge_type>2</edge_type>
<source_obj>29</source_obj>
<sink_obj>109</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_329">
<id>398</id>
<edge_type>2</edge_type>
<source_obj>29</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_330">
<id>399</id>
<edge_type>2</edge_type>
<source_obj>40</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_331">
<id>400</id>
<edge_type>2</edge_type>
<source_obj>48</source_obj>
<sink_obj>107</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_332">
<id>401</id>
<edge_type>2</edge_type>
<source_obj>48</source_obj>
<sink_obj>81</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_333">
<id>402</id>
<edge_type>2</edge_type>
<source_obj>81</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_334">
<id>403</id>
<edge_type>2</edge_type>
<source_obj>81</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_335">
<id>404</id>
<edge_type>2</edge_type>
<source_obj>83</source_obj>
<sink_obj>93</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_336">
<id>405</id>
<edge_type>2</edge_type>
<source_obj>83</source_obj>
<sink_obj>85</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_337">
<id>406</id>
<edge_type>2</edge_type>
<source_obj>85</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_338">
<id>407</id>
<edge_type>2</edge_type>
<source_obj>85</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_339">
<id>408</id>
<edge_type>2</edge_type>
<source_obj>88</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_340">
<id>409</id>
<edge_type>2</edge_type>
<source_obj>90</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_341">
<id>410</id>
<edge_type>2</edge_type>
<source_obj>93</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_342">
<id>411</id>
<edge_type>2</edge_type>
<source_obj>97</source_obj>
<sink_obj>107</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_343">
<id>412</id>
<edge_type>2</edge_type>
<source_obj>97</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_344">
<id>413</id>
<edge_type>2</edge_type>
<source_obj>100</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_345">
<id>414</id>
<edge_type>2</edge_type>
<source_obj>107</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_346">
<id>415</id>
<edge_type>2</edge_type>
<source_obj>109</source_obj>
<sink_obj>115</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_347">
<id>416</id>
<edge_type>2</edge_type>
<source_obj>115</source_obj>
<sink_obj>125</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_348">
<id>417</id>
<edge_type>2</edge_type>
<source_obj>115</source_obj>
<sink_obj>123</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_349">
<id>418</id>
<edge_type>2</edge_type>
<source_obj>123</source_obj>
<sink_obj>115</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_350">
<id>419</id>
<edge_type>4</edge_type>
<source_obj>67</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_351">
<id>420</id>
<edge_type>4</edge_type>
<source_obj>67</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_352">
<id>421</id>
<edge_type>4</edge_type>
<source_obj>73</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_353">
<id>422</id>
<edge_type>4</edge_type>
<source_obj>67</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_354">
<id>423</id>
<edge_type>4</edge_type>
<source_obj>73</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>11</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_355">
<mId>1</mId>
<mTag>dense_large_rf_gt_ni</mTag>
<mType>0</mType>
<sub_regions>
<count>7</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
<item>5</item>
<item>9</item>
<item>10</item>
<item>11</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>4163</mMinLatency>
<mMaxLatency>8771</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_356">
<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>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_357">
<mId>3</mId>
<mTag>InitAccum</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>13</item>
<item>19</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>16</mMinTripCount>
<mMaxTripCount>16</mMaxTripCount>
<mMinLatency>16</mMinLatency>
<mMaxLatency>16</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_358">
<mId>4</mId>
<mTag>Region 1</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_359">
<mId>5</mId>
<mTag>ReuseLoop</mTag>
<mType>1</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>6</item>
<item>7</item>
<item>8</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>256</mMinTripCount>
<mMaxTripCount>256</mMaxTripCount>
<mMinLatency>4096</mMinLatency>
<mMaxLatency>8704</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_360">
<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>2</count>
<item_version>0</item_version>
<item>29</item>
<item>40</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>2</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_361">
<mId>7</mId>
<mTag>MultLoop</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>9</count>
<item_version>0</item_version>
<item>48</item>
<item>81</item>
<item>83</item>
<item>85</item>
<item>88</item>
<item>90</item>
<item>93</item>
<item>97</item>
<item>100</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>1</mMinTripCount>
<mMaxTripCount>2</mMaxTripCount>
<mMinLatency>11</mMinLatency>
<mMaxLatency>28</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_362">
<mId>8</mId>
<mTag>Region 3</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>107</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>1</mMinLatency>
<mMaxLatency>1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_363">
<mId>9</mId>
<mTag>Region 4</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>109</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_364">
<mId>10</mId>
<mTag>Result</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>115</item>
<item>123</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>16</mMinTripCount>
<mMaxTripCount>16</mMaxTripCount>
<mMinLatency>48</mMinLatency>
<mMaxLatency>48</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_365">
<mId>11</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>125</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="-1"></fsm>
<res class_id="-1"></res>
<node_label_latency class_id="26" tracking_level="0" version="0">
<count>91</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>5</first>
<second class_id="28" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>6</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>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>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>15</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>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>20</first>
<second>
<first>1</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>25</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>32</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>3</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>3</first>
<second>1</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>5</first>
<second>1</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>8</first>
<second>1</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>8</first>
<second>1</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>73</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>74</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>77</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>78</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>79</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>80</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>82</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>84</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>86</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>87</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>89</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>91</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>92</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>94</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>95</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>96</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>98</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>99</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>101</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>102</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>103</first>
<second>
<first>12</first>
<second>0</second>
</second>
</item>
<item>
<first>104</first>
<second>
<first>12</first>
<second>0</second>
</second>
</item>
<item>
<first>106</first>
<second>
<first>12</first>
<second>0</second>
</second>
</item>
<item>
<first>108</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>110</first>
<second>
<first>13</first>
<second>0</second>
</second>
</item>
<item>
<first>111</first>
<second>
<first>13</first>
<second>0</second>
</second>
</item>
<item>
<first>113</first>
<second>
<first>13</first>
<second>0</second>
</second>
</item>
<item>
<first>114</first>
<second>
<first>13</first>
<second>0</second>
</second>
</item>
<item>
<first>117</first>
<second>
<first>13</first>
<second>0</second>
</second>
</item>
<item>
<first>118</first>
<second>
<first>13</first>
<second>0</second>
</second>
</item>
<item>
<first>119</first>
<second>
<first>13</first>
<second>1</second>
</second>
</item>
<item>
<first>120</first>
<second>
<first>15</first>
<second>0</second>
</second>
</item>
<item>
<first>121</first>
<second>
<first>15</first>
<second>0</second>
</second>
</item>
<item>
<first>122</first>
<second>
<first>15</first>
<second>0</second>
</second>
</item>
<item>
<first>124</first>
<second>
<first>13</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="29" tracking_level="0" version="0">
<count>20</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="0" version="0">
<first>7</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>2</first>
<second>4</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>5</first>
<second>5</second>
</second>
</item>
<item>
<first>81</first>
<second>
<first>5</first>
<second>10</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>10</first>
<second>10</second>
</second>
</item>
<item>
<first>85</first>
<second>
<first>10</first>
<second>10</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>10</first>
<second>11</second>
</second>
</item>
<item>
<first>90</first>
<second>
<first>11</first>
<second>11</second>
</second>
</item>
<item>
<first>93</first>
<second>
<first>10</first>
<second>11</second>
</second>
</item>
<item>
<first>97</first>
<second>
<first>11</first>
<second>11</second>
</second>
</item>
<item>
<first>100</first>
<second>
<first>11</first>
<second>11</second>
</second>
</item>
<item>
<first>107</first>
<second>
<first>11</first>
<second>12</second>
</second>
</item>
<item>
<first>109</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>115</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>123</first>
<second>
<first>3</first>
<second>5</second>
</second>
</item>
<item>
<first>125</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="32" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="34" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="35" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="36" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 30.703933 | 175 | 0.621502 |
2e217a3fb0f66c389635dff741dfb6550e29873d | 1,981 | adb | Ada | to_lower_2.adb | ne-oss/urban-os | 1c2f386b2b9d784138887589d5ccdde42cdef521 | [
"MIT"
] | null | null | null | to_lower_2.adb | ne-oss/urban-os | 1c2f386b2b9d784138887589d5ccdde42cdef521 | [
"MIT"
] | null | null | null | to_lower_2.adb | ne-oss/urban-os | 1c2f386b2b9d784138887589d5ccdde42cdef521 | [
"MIT"
] | null | null | null | -- {{Ada/Sourceforge|to_lower_2.adb}}
pragma License (Gpl);
pragma Ada_95;
with Ada.Text_IO;
with Ada.Command_Line;
with Ada.Characters.Handling;
procedure To_Lower_2 is
package CL renames Ada.Command_Line;
package T_IO renames Ada.Text_IO;
function Equal_Ignore_Case
(S : String;
T : String)
return Boolean;
Value_1 : constant String := CL.Argument (1);
Value_2 : constant String := CL.Argument (2);
function To_Lower (C : Character) return Character renames
Ada.Characters.Handling.To_Lower;
-- equal-ignore-case -- returns true if s or t are equal,
-- ignoring case
function Equal_Ignore_Case
(S : String;
T : String)
return Boolean
is
O : constant Integer := S'First - T'First;
begin
if T'Length /= S'Length then
return False; -- if they aren't the same length, they
-- aren't equal
else
for I in S'Range loop
if To_Lower (S (I)) /=
To_Lower (T (I + O))
then
return False;
end if;
end loop;
end if;
return True;
end Equal_Ignore_Case;
begin
T_IO.Put (Value_1);
T_IO.Put (" and ");
T_IO.Put (Value_2);
T_IO.Put (" are ");
if not Equal_Ignore_Case (Value_1, Value_2) then
T_IO.Put ("not ");
end if;
T_IO.Put ("same.");
return;
end To_Lower_2;
----------------------------------------------------------------------------
-- $Author: krischik $
--
-- $Revision: 226 $
-- $Date: 2007-12-02 15:11:44 +0000 (Sun, 02 Dec 2007) $
--
-- $Id: to_lower_2.adb 226 2007-12-02 15:11:44Z krischik $
-- $HeadURL: file:///svn/p/wikibook-ada/code/trunk/demos/Source/to_lower_2.adb $
----------------------------------------------------------------------------
-- vim: textwidth=0 nowrap tabstop=8 shiftwidth=3 softtabstop=3 expandtab
-- vim: filetype=ada encoding=utf-8 fileformat=unix foldmethod=indent
| 26.77027 | 81 | 0.560828 |
2e46ae75dc204e0bafcebf91ed115c1613ca147c | 1,412 | ads | Ada | source/asis/spec/ada-finalization.ads | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | 4 | 2016-02-05T15:51:56.000Z | 2022-03-25T20:38:32.000Z | source/asis/spec/ada-finalization.ads | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | null | null | null | source/asis/spec/ada-finalization.ads | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- A d a r u n - t i m e s p e c i f i c a t i o n --
-- ASIS implementation for Gela project, a portable Ada compiler --
-- http://gela.ada-ru.org --
-- - - - - - - - - - - - - - - - --
-- Read copyright and license at the end of ada.ads file --
------------------------------------------------------------------------------
-- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $
package Ada.Finalization is
pragma Preelaborate (Finalization);
pragma Remote_Types (Finalization);
type Controlled is abstract tagged private;
pragma Preelaborable_Initialization (Controlled);
procedure Initialize (Object : in out Controlled) is null;
procedure Adjust (Object : in out Controlled) is null;
procedure Finalize (Object : in out Controlled) is null;
type Limited_Controlled is abstract tagged limited private;
pragma Preelaborable_Initialization (Limited_Controlled);
procedure Initialize (Object : in out Limited_Controlled) is null;
procedure Finalize (Object : in out Limited_Controlled) is null;
private
pragma Import (Ada, Controlled);
pragma Import (Ada, Limited_Controlled);
end Ada.Finalization;
| 39.222222 | 78 | 0.544618 |
041fecd48aa2e59ff6976876139526d9be1f0967 | 724 | ads | Ada | extern/gnat_sdl/gnat_sdl/src/sdl_sdl_loadso_h.ads | AdaCore/training_material | 6651eb2c53f8c39649b8e0b3c757bc8ff963025a | [
"CC-BY-4.0"
] | 15 | 2020-10-07T08:56:45.000Z | 2022-02-08T23:13:22.000Z | extern/gnat_sdl/gnat_sdl/src/sdl_sdl_loadso_h.ads | AdaCore/training_material | 6651eb2c53f8c39649b8e0b3c757bc8ff963025a | [
"CC-BY-4.0"
] | 20 | 2020-11-05T14:35:20.000Z | 2022-01-13T15:59:33.000Z | extern/gnat_sdl/gnat_sdl/src/sdl_sdl_loadso_h.ads | AdaCore/training_material | 6651eb2c53f8c39649b8e0b3c757bc8ff963025a | [
"CC-BY-4.0"
] | 6 | 2020-10-08T15:57:06.000Z | 2021-08-31T12:03:08.000Z | pragma Ada_2005;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
with Interfaces.C.Strings;
with System;
package SDL_SDL_loadso_h is
function SDL_LoadObject (sofile : Interfaces.C.Strings.chars_ptr) return System.Address; -- ../include/SDL/SDL_loadso.h:60
pragma Import (C, SDL_LoadObject, "SDL_LoadObject");
function SDL_LoadFunction (handle : System.Address; name : Interfaces.C.Strings.chars_ptr) return System.Address; -- ../include/SDL/SDL_loadso.h:67
pragma Import (C, SDL_LoadFunction, "SDL_LoadFunction");
procedure SDL_UnloadObject (handle : System.Address); -- ../include/SDL/SDL_loadso.h:70
pragma Import (C, SDL_UnloadObject, "SDL_UnloadObject");
end SDL_SDL_loadso_h;
| 36.2 | 151 | 0.76105 |
c77a4c40ea9f7a889ae90bd3202f7c4ad00f18b9 | 21,304 | adb | Ada | src/gen-artifacts-hibernate.adb | My-Colaborations/dynamo | 09704417a23050d5bb52d48a65a14a1c2d926184 | [
"Apache-2.0"
] | null | null | null | src/gen-artifacts-hibernate.adb | My-Colaborations/dynamo | 09704417a23050d5bb52d48a65a14a1c2d926184 | [
"Apache-2.0"
] | null | null | null | src/gen-artifacts-hibernate.adb | My-Colaborations/dynamo | 09704417a23050d5bb52d48a65a14a1c2d926184 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- gen-artifacts-hibernate -- Hibernate artifact for Code Generator
-- Copyright (C) 2011, 2012, 2013, 2014, 2015, 2017, 2018, 2020 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Strings.Unbounded;
with Ada.Directories;
with Ada.Exceptions;
with Ada.Containers;
with Gen.Configs;
with Gen.Utils;
with Gen.Model.Enums;
with Gen.Model.Tables;
with Gen.Model.Projects;
with Gen.Model.Mappings;
with Util.Files;
with Util.Log.Loggers;
with Util.Strings.Sets;
with Util.Encoders;
package body Gen.Artifacts.Hibernate is
use Ada.Strings.Unbounded;
use Gen.Model;
use Gen.Model.Enums;
use Gen.Model.Tables;
use Gen.Configs;
use type DOM.Core.Node;
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("Gen.Artifacts.Hibernate");
-- ------------------------------
-- After the configuration file is read, processes the node whose root
-- is passed in <b>Node</b> and initializes the <b>Model</b> with the information.
-- ------------------------------
overriding
procedure Initialize (Handler : in out Artifact;
Path : in String;
Node : in DOM.Core.Node;
Model : in out Gen.Model.Packages.Model_Definition'Class;
Context : in out Generator'Class) is
procedure Register_Mapping (Model : in out Gen.Model.Packages.Model_Definition;
Node : in DOM.Core.Node);
-- Register the column definition in the table
procedure Register_Column (Table : in out Table_Definition;
Column : in DOM.Core.Node);
-- Register the association definition in the table
procedure Register_Association (Table : in out Table_Definition;
Column : in DOM.Core.Node);
-- Register all the columns defined in the table
procedure Register_Columns (Table : in out Table_Definition;
Node : in DOM.Core.Node);
procedure Register_Class (O : in out Gen.Model.Packages.Model_Definition;
Node : in DOM.Core.Node);
-- Register a new enum definition in the model.
procedure Register_Enum (O : in out Gen.Model.Packages.Model_Definition;
Node : in DOM.Core.Node);
-- Register the value definition in the enum
procedure Register_Enum_Value (Enum : in out Enum_Definition;
Value : in DOM.Core.Node);
Is_Version : Boolean := False;
Is_Key : Boolean := False;
-- ------------------------------
-- Register the column definition in the table
-- ------------------------------
procedure Register_Column (Table : in out Table_Definition;
Column : in DOM.Core.Node) is
Name : constant Unbounded_String := Gen.Utils.Get_Attribute (Column, "name");
G : constant DOM.Core.Node := Gen.Utils.Get_Child (Column, "generator");
C : Column_Definition_Access;
begin
Table.Add_Column (Name, C);
C.Initialize (Name, Column);
C.Set_Location (Path);
C.Is_Inserted := Gen.Utils.Get_Attribute (Column, "insert", True);
C.Is_Updated := Gen.Utils.Get_Attribute (Column, "update", True);
C.Is_Version := Is_Version;
C.Is_Key := Is_Key;
if G /= null then
C.Generator := Gen.Utils.Get_Attribute (G, "class");
end if;
-- Get the SQL mapping from an optional <column> element.
declare
N : DOM.Core.Node := Gen.Utils.Get_Child (Column, "column");
T : constant DOM.Core.Node := Gen.Utils.Get_Child (Column, "type");
begin
if T /= null then
C.Set_Type (Gen.Utils.Get_Normalized_Type (T, "name"));
else
C.Set_Type (Gen.Utils.Get_Normalized_Type (Column, "type"));
end if;
Log.Debug ("Register column {0} of type {1}", Name, To_String (C.Type_Name));
if N /= null then
C.Sql_Name := Gen.Utils.Get_Attribute (N, "name");
C.Sql_Type := Gen.Utils.Get_Attribute (N, "sql-type");
else
N := Column;
C.Sql_Name := Gen.Utils.Get_Attribute (N, "column");
C.Sql_Type := C.Type_Name;
end if;
if C.Is_Version then
C.Not_Null := True;
else
C.Not_Null := Gen.Utils.Get_Attribute (N, "not-null");
end if;
C.Unique := Gen.Utils.Get_Attribute (N, "unique");
end;
end Register_Column;
-- ------------------------------
-- Register the association definition in the table
-- ------------------------------
procedure Register_Association (Table : in out Table_Definition;
Column : in DOM.Core.Node) is
Name : constant Unbounded_String := Gen.Utils.Get_Attribute (Column, "name");
C : Association_Definition_Access;
begin
Log.Debug ("Register association {0}", Name);
Table.Add_Association (Name, C);
C.Initialize (Name, Column);
C.Set_Location (Path);
-- Get the SQL mapping from an optional <column> element.
declare
N : DOM.Core.Node := Gen.Utils.Get_Child (Column, "column");
begin
C.Set_Type (Gen.Utils.Get_Attribute (Column, "class"));
if N /= null then
C.Sql_Name := Gen.Utils.Get_Attribute (N, "name");
C.Sql_Type := Gen.Utils.Get_Attribute (N, "sql-type");
else
N := Column;
C.Sql_Name := Gen.Utils.Get_Attribute (N, "column");
C.Sql_Type := C.Type_Name;
end if;
C.Not_Null := Gen.Utils.Get_Attribute (N, "not-null");
C.Unique := Gen.Utils.Get_Attribute (N, "unique");
end;
end Register_Association;
-- ------------------------------
-- Register all the columns defined in the table
-- ------------------------------
procedure Register_Columns (Table : in out Table_Definition;
Node : in DOM.Core.Node) is
procedure Iterate is
new Gen.Utils.Iterate_Nodes (T => Table_Definition,
Process => Register_Column);
procedure Iterate_Association is
new Gen.Utils.Iterate_Nodes (T => Table_Definition,
Process => Register_Association);
begin
Log.Debug ("Register columns from table {0}", Table.Name);
Is_Key := True;
Is_Version := False;
Iterate (Table, Node, "id");
Is_Key := False;
Is_Version := True;
Iterate (Table, Node, "version");
Is_Key := False;
Is_Version := False;
Iterate (Table, Node, "property");
Iterate_Association (Table, Node, "many-to-one");
end Register_Columns;
-- ------------------------------
-- Register a new class definition in the model.
-- ------------------------------
procedure Register_Class (O : in out Gen.Model.Packages.Model_Definition;
Node : in DOM.Core.Node) is
Name : constant Unbounded_String := Gen.Utils.Get_Attribute (Node, "name");
Table_Name : constant Unbounded_String := Gen.Utils.Get_Attribute (Node, "table");
Table : constant Table_Definition_Access := Gen.Model.Tables.Create_Table (Name);
begin
Table.Initialize (Name, Node);
Table.Set_Location (Path);
Log.Debug ("Register class {0}", Table.Name);
if Length (Table_Name) > 0 then
Table.Table_Name := Table_Name;
end if;
Table.Has_List := Gen.Utils.Get_Attribute (Node, "list", True);
O.Register_Table (Table);
Register_Columns (Table_Definition (Table.all), Node);
end Register_Class;
-- ------------------------------
-- Register the value definition in the enum
-- ------------------------------
procedure Register_Enum_Value (Enum : in out Enum_Definition;
Value : in DOM.Core.Node) is
Name : constant Unbounded_String := Gen.Utils.Get_Attribute (Value, "name");
V : Value_Definition_Access;
begin
Log.Debug ("Register enum value {0}", Name);
Enum.Add_Value (To_String (Name), V);
end Register_Enum_Value;
-- ------------------------------
-- Register a new enum definition in the model.
-- ------------------------------
procedure Register_Enum (O : in out Gen.Model.Packages.Model_Definition;
Node : in DOM.Core.Node) is
procedure Iterate is
new Gen.Utils.Iterate_Nodes (T => Enum_Definition,
Process => Register_Enum_Value);
Name : constant Unbounded_String := Gen.Utils.Get_Attribute (Node, "name");
Enum : constant Enum_Definition_Access := Gen.Model.Enums.Create_Enum (Name);
begin
Enum.Initialize (Name, Node);
Enum.Set_Location (Path);
Log.Debug ("Register enum {0}", Enum.Name);
O.Register_Enum (Enum);
Log.Debug ("Register enum values from enum {0}", Enum.Name);
Iterate (Enum_Definition (Enum.all), Node, "value");
end Register_Enum;
-- ------------------------------
-- Register a model mapping
-- ------------------------------
procedure Register_Mapping (Model : in out Gen.Model.Packages.Model_Definition;
Node : in DOM.Core.Node) is
procedure Iterate is
new Gen.Utils.Iterate_Nodes (T => Gen.Model.Packages.Model_Definition,
Process => Register_Class);
procedure Iterate_Enum is
new Gen.Utils.Iterate_Nodes (T => Gen.Model.Packages.Model_Definition,
Process => Register_Enum);
begin
Iterate_Enum (Model, Node, "enum");
Iterate (Model, Node, "class");
Iterate (Model, Node, "subclass");
end Register_Mapping;
procedure Iterate is new Gen.Utils.Iterate_Nodes (T => Gen.Model.Packages.Model_Definition,
Process => Register_Mapping);
begin
Log.Debug ("Initializing hibernate artifact for the configuration");
Gen.Artifacts.Artifact (Handler).Initialize (Path, Node, Model, Context);
Iterate (Gen.Model.Packages.Model_Definition (Model), Node, "hibernate-mapping");
exception
when E : Name_Exist =>
Context.Error (Ada.Exceptions.Exception_Message (E));
end Initialize;
-- ------------------------------
-- Prepare the generation of the package:
-- o identify the column types which are used
-- o build a list of package for the with clauses.
-- ------------------------------
overriding
procedure Prepare (Handler : in out Artifact;
Model : in out Gen.Model.Packages.Model_Definition'Class;
Context : in out Generator'Class) is
pragma Unreferenced (Handler);
begin
Log.Debug ("Preparing the model for hibernate");
if Model.Has_Packages then
Context.Add_Generation (Name => GEN_PACKAGE_SPEC, Mode => ITERATION_PACKAGE,
Mapping => Gen.Model.Mappings.ADA_MAPPING);
Context.Add_Generation (Name => GEN_PACKAGE_BODY, Mode => ITERATION_PACKAGE,
Mapping => Gen.Model.Mappings.ADA_MAPPING);
Context.Add_Generation (Name => GEN_MYSQL_SQL_FILE, Mode => ITERATION_TABLE,
Mapping => Gen.Model.Mappings.MySQL_MAPPING);
Context.Add_Generation (Name => GEN_MYSQL_DROP_SQL_FILE, Mode => ITERATION_TABLE,
Mapping => Gen.Model.Mappings.MySQL_MAPPING);
Context.Add_Generation (Name => GEN_SQLITE_SQL_FILE, Mode => ITERATION_TABLE,
Mapping => Gen.Model.Mappings.SQLite_MAPPING);
Context.Add_Generation (Name => GEN_SQLITE_DROP_SQL_FILE, Mode => ITERATION_TABLE,
Mapping => Gen.Model.Mappings.SQLite_MAPPING);
Context.Add_Generation (Name => GEN_POSTGRESQL_SQL_FILE, Mode => ITERATION_TABLE,
Mapping => Gen.Model.Mappings.Postgresql_MAPPING);
Context.Add_Generation (Name => GEN_POSTGRESQL_DROP_SQL_FILE, Mode => ITERATION_TABLE,
Mapping => Gen.Model.Mappings.Postgresql_MAPPING);
end if;
end Prepare;
-- ------------------------------
-- After the generation, perform a finalization step for the generation process.
-- For each database SQL mapping, collect the schema files from the different modules
-- of the project and generate an SQL script that can be used to create the database tables.
-- ------------------------------
overriding
procedure Finish (Handler : in out Artifact;
Model : in out Gen.Model.Packages.Model_Definition'Class;
Project : in out Gen.Model.Projects.Project_Definition'Class;
Context : in out Generator'Class) is
pragma Unreferenced (Handler, Context);
procedure Collect_SQL (Project : in Gen.Model.Projects.Project_Definition'Class;
Dir : in String;
Driver : in String;
Prefix : in String;
Dynamo : in String;
Content : in out Unbounded_String);
procedure Build_SQL_Schemas (Driver : in String;
Prefix : in String;
Name : in String;
Is_Reverse : in Boolean);
procedure Print_Info;
use Util.Encoders;
SQL_Content : Unbounded_String;
-- SHA for each SQL content that is appended in the SQL content.
-- This is used to avoid appending the same SQL file several times in the final SQL file.
-- (this happens due to the SQL path being different in some cases)
SHA_Files : Util.Strings.Sets.Set;
SHA_Encoder : constant Encoder := Util.Encoders.Create (Util.Encoders.HASH_SHA1);
-- The module names whose data model is imported by the current project.
-- This is only used to report a message to the user.
Modules : Util.Strings.Sets.Set;
Model_Dir : constant String := Model.Get_Model_Directory;
-- ------------------------------
-- Check if an SQL file exists for the given driver. If such file exist,
-- read the content and append it to the <b>Content</b> buffer.
-- ------------------------------
procedure Collect_SQL (Project : in Gen.Model.Projects.Project_Definition'Class;
Dir : in String;
Driver : in String;
Prefix : in String;
Dynamo : in String;
Content : in out Unbounded_String) is
Name : constant String := Project.Get_Project_Name;
Dir2 : constant String := Util.Files.Compose (Dir, Driver);
Path : constant String := Util.Files.Compose (Dir2, Name & "-"
& Prefix & Driver & ".sql");
SQL : Unbounded_String;
begin
Log.Debug ("Checking SQL file {0}", Path);
if Ada.Directories.Exists (Path) then
Util.Files.Read_File (Path => Path,
Into => SQL);
declare
H : constant String := SHA_Encoder.Encode (To_String (SQL));
begin
if not SHA_Files.Contains (H) then
if Dynamo'Length > 0 then
Modules.Include (Dynamo);
end if;
SHA_Files.Include (H);
Append (Content, "/* Copied from ");
Append (Content, Ada.Directories.Simple_Name (Path));
Append (Content, "*/");
Append (Content, ASCII.LF);
Append (Content, SQL);
end if;
end;
end if;
end Collect_SQL;
-- ------------------------------
-- Collect the SQL schemas defined by the projects and modules used by the main project.
-- ------------------------------
procedure Build_SQL_Schemas (Driver : in String;
Prefix : in String;
Name : in String;
Is_Reverse : in Boolean) is
use type Gen.Model.Projects.Project_Definition_Access;
Out_Dir : constant String := Util.Files.Compose (Model_Dir, Driver);
Path : constant String := Util.Files.Compose (Out_Dir, Name);
Pos : Integer;
Incr : Integer;
begin
SQL_Content := Null_Unbounded_String;
SHA_Files.Clear;
if Driver = "sqlite" then
Append (SQL_Content, "pragma synchronous=OFF;" & ASCII.LF);
end if;
if Is_Reverse then
Pos := Project.Dynamo_Files.Last_Index;
Incr := -1;
Collect_SQL (Project, Model_Dir, Driver, Prefix, "", SQL_Content);
else
Pos := Project.Dynamo_Files.First_Index;
Incr := 1;
end if;
while Pos >= Project.Dynamo_Files.First_Index
and Pos <= Project.Dynamo_Files.Last_Index loop
declare
Name : constant String := Project.Dynamo_Files.Element (Pos);
Dir : constant String := Ada.Directories.Containing_Directory (Name);
Prj : constant Gen.Model.Projects.Project_Definition_Access
:= Project.Find_Project (Name);
begin
Log.Debug ("Checking project {0}", Name);
if Prj /= null then
Collect_SQL (Prj.all, Util.Files.Compose (Dir, "db"), Driver,
Prefix, Name, SQL_Content);
end if;
end;
Pos := Pos + Incr;
end loop;
if not Is_Reverse then
Collect_SQL (Project, Model_Dir, Driver, Prefix, "", SQL_Content);
end if;
if Prefix = "" then
Collect_SQL (Project, Model_Dir, Driver, "init-", "", SQL_Content);
end if;
Log.Info ("Generating " & Driver & " creation schema in '{0}'",
Path & "-" & Driver & ".sql");
Util.Files.Write_File (Path => Path & "-" & Driver & ".sql",
Content => SQL_Content);
end Build_SQL_Schemas;
-- ------------------------------
-- Print information about the generated SQLfiles.
-- ------------------------------
procedure Print_Info is
Iter : Util.Strings.Sets.Cursor := Modules.First;
begin
if Util.Strings.Sets.Has_Element (Iter) then
Log.Info ("Generated the SQL model from{0} Dynamo projects: ",
Ada.Containers.Count_Type'Image (Modules.Length));
while Util.Strings.Sets.Has_Element (Iter) loop
Log.Info (" {0}", Util.Strings.Sets.Element (Iter));
Util.Strings.Sets.Next (Iter);
end loop;
end if;
end Print_Info;
Name : constant String := Project.Get_Project_Name;
begin
if not Project.Is_Plugin then
Build_SQL_Schemas ("mysql", "", "create-" & Name, False);
Build_SQL_Schemas ("postgresql", "", "create-" & Name, False);
Build_SQL_Schemas ("sqlite", "", "create-" & Name, False);
Build_SQL_Schemas ("mysql", "drop-", "drop-" & Name, True);
Build_SQL_Schemas ("postgresql", "drop-", "drop-" & Name, True);
Build_SQL_Schemas ("sqlite", "drop-", "drop-" & Name, True);
Print_Info;
end if;
end Finish;
end Gen.Artifacts.Hibernate;
| 43.655738 | 97 | 0.538772 |
138301a4002958fa7f5639dccaa859a47e5f65d4 | 1,802 | adb | Ada | src/date.adb | GauBen/Arbre-Genealogique | 410dfd4e783871846a87aa2198ab37e05413f5b6 | [
"MIT"
] | 1 | 2021-01-26T16:03:10.000Z | 2021-01-26T16:03:10.000Z | src/date.adb | GauBen/Arbre-Genealogique | 410dfd4e783871846a87aa2198ab37e05413f5b6 | [
"MIT"
] | null | null | null | src/date.adb | GauBen/Arbre-Genealogique | 410dfd4e783871846a87aa2198ab37e05413f5b6 | [
"MIT"
] | null | null | null | package body Date is
function D1_Inf_D2 (Date1 : T_Date; Date2 : T_Date) return Boolean is
begin
if Date1.Annee < Date2.Annee then
return True;
elsif Date1.Annee > Date2.Annee then
return False;
elsif Date1.Mois < Date2.Mois then
return True;
elsif Date1.Mois > Date2.Mois then
return False;
elsif Date1.Jour < Date2.Jour then
return True;
else
return False;
end if;
end D1_Inf_D2;
function D1_Egal_D2 (Date1 : T_Date; Date2 : T_Date) return Boolean is
begin
return Date1.Annee = Date2.Annee and Date1.Mois = Date2.Mois and
Date1.Jour = Date2.Jour;
end D1_Egal_D2;
-- Renvoie le nombre de jours d'un mois donné.
function Nombre_Jours (Mois : T_Mois; Annee : Integer) return Integer is
begin
case Mois is
when Janvier | Mars | Mai | Juillet | Aout | Octobre | Decembre =>
return 31;
when Fevrier =>
if Annee mod 400 = 0 then
return 29;
elsif Annee mod 100 = 0 then
return 28;
elsif Annee mod 4 = 0 then
return 29;
else
return 28;
end if;
when others =>
return 30;
end case;
end Nombre_Jours;
function Creer_Date
(Jour : Integer; Mois : Integer; Annee : Integer) return T_Date
is
Date : T_Date;
begin
if Mois < 1 or Mois > 12 or Jour < 1 or Jour > 31 then
raise Date_Incorrecte;
end if;
Date.Mois := T_Mois'Val (Mois - 1);
Date.Annee := Annee;
if Jour > Nombre_Jours (Date.Mois, Date.Annee) then
raise Date_Incorrecte;
end if;
Date.Jour := Jour;
return Date;
end Creer_Date;
end Date;
| 27.30303 | 75 | 0.569922 |
0410467b1dd41f9dcd15fe59a1569899eb9871f8 | 27,692 | ads | Ada | src/servlet-core.ads | jquorning/ada-servlet | 97db5fcdd59e01441c717b95a9e081aa7d6a7bbe | [
"Apache-2.0"
] | 6 | 2018-01-04T07:19:46.000Z | 2020-12-27T14:49:44.000Z | src/servlet-core.ads | jquorning/ada-servlet | 97db5fcdd59e01441c717b95a9e081aa7d6a7bbe | [
"Apache-2.0"
] | 9 | 2020-12-20T15:29:18.000Z | 2022-02-04T20:13:58.000Z | src/servlet-core.ads | jquorning/ada-servlet | 97db5fcdd59e01441c717b95a9e081aa7d6a7bbe | [
"Apache-2.0"
] | 2 | 2021-01-06T08:32:38.000Z | 2022-01-24T23:46:36.000Z | -----------------------------------------------------------------------
-- servlet-servlets -- Servlet.Core
-- Copyright (C) 2010, 2011, 2012, 2013, 2015, 2016, 2017, 2018, 2020 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Servlet.Requests;
with Servlet.Responses;
with Servlet.Sessions;
with Servlet.Sessions.Factory;
with Servlet.Routes;
limited with Servlet.Filters;
with Ada.Finalization;
with Ada.Strings.Unbounded;
with Ada.Strings.Hash;
with Ada.Calendar;
with Ada.Exceptions;
with Util.Log;
with Util.Properties;
with Util.Strings.Vectors;
with EL.Contexts;
private with Ada.Containers.Indefinite_Hashed_Maps;
-- The <b>Servlet.Core</b> package implements a subset of the
-- Java Servlet Specification adapted for the Ada language.
--
-- The rationale for this implementation is to provide a set of
-- interfaces and ways of developing a Web application which
-- benefit from the architecture expertise defined in Java applications.
--
-- The <b>Servlet.Core</b>, <b>Servlet.Requests</b>, <b>Servlet.Responses</b>
-- and <b>Servlet.Sessions</b> packages are independent of the web server
-- which will be used (such as <b>AWS</b>, <b>Apache</b> or <b>Lighthttpd</b>).
--
package Servlet.Core is
Servlet_Error : exception;
type Status_Type is (Ready, Disabled, Started, Suspended, Stopped);
-- Filter chain as defined by JSR 315 6. Filtering
type Filter_Chain is limited private;
type Filter_Config is private;
type Filter_Access is access all Servlet.Filters.Filter'Class;
type Filter_List_Access is access all Servlet.Filters.Filter_List;
-- Causes the next filter in the chain to be invoked, or if the calling
-- filter is the last filter in the chain, causes the resource at the end
-- of the chain to be invoked.
procedure Do_Filter (Chain : in out Filter_Chain;
Request : in out Requests.Request'Class;
Response : in out Responses.Response'Class);
-- Get the filter name.
function Get_Filter_Name (Config : in Filter_Config) return String;
-- Returns a String containing the value of the named context-wide initialization
-- parameter, or the default value if the parameter does not exist.
--
-- The filter parameter name is automatically prefixed by the filter name followed by '.'.
function Get_Init_Parameter (Config : in Filter_Config;
Name : in String;
Default : in String := "") return String;
function Get_Init_Parameter (Config : in Filter_Config;
Name : in String;
Default : in String := "")
return Ada.Strings.Unbounded.Unbounded_String;
-- type Servlet_Registry;
type Servlet_Registry is new Servlet.Sessions.Factory.Session_Factory with private;
type Servlet_Registry_Access is access all Servlet_Registry'Class;
-- Get the servlet context associated with the filter chain.
function Get_Servlet_Context (Chain : in Filter_Chain) return Servlet_Registry_Access;
-- Get the servlet context associated with the filter config.
function Get_Servlet_Context (Config : in Filter_Config) return Servlet_Registry_Access;
-- The <b>Servlet</b> represents the component that will handle
-- an HTTP request received by the server.
--
-- JSR 315 - 2. The Servlet Interface
type Servlet is tagged limited private;
type Servlet_Access is access all Servlet'Class;
-- Get the servlet name.
function Get_Name (Server : in Servlet) return String;
-- Get the servlet context associated with this servlet.
function Get_Servlet_Context (Server : in Servlet) return Servlet_Registry_Access;
-- Called by the servlet container to indicate to a servlet that the servlet
-- is being placed into service.
-- not overriding
procedure Initialize (Server : in out Servlet;
Context : in Servlet_Registry'Class);
-- Receives standard HTTP requests from the public service method and dispatches
-- them to the Do_XXX methods defined in this class. This method is an HTTP-specific
-- version of the Servlet.service(Request, Response) method. There's no need
-- to override this method.
procedure Service (Server : in Servlet;
Request : in out Requests.Request'Class;
Response : in out Responses.Response'Class);
-- Returns the time the Request object was last modified, in milliseconds since
-- midnight January 1, 1970 GMT. If the time is unknown, this method returns
-- a negative number (the default).
--
-- Servlets that support HTTP GET requests and can quickly determine their
-- last modification time should override this method. This makes browser and
-- proxy caches work more effectively, reducing the load on server and network
-- resources.
function Get_Last_Modified (Server : in Servlet;
Request : in Requests.Request'Class)
return Ada.Calendar.Time;
-- Called by the server (via the service method) to allow a servlet to handle
-- a GET request.
--
-- Overriding this method to support a GET request also automatically supports
-- an HTTP HEAD request. A HEAD request is a GET request that returns no body
-- in the response, only the request header fields.
--
-- When overriding this method, read the request data, write the response headers,
-- get the response's writer or output stream object, and finally, write the
-- response data. It's best to include content type and encoding.
-- When using a PrintWriter object to return the response, set the content type
-- before accessing the PrintWriter object.
--
-- The servlet container must write the headers before committing the response,
-- because in HTTP the headers must be sent before the response body.
--
-- Where possible, set the Content-Length header (with the
-- Response.Set_Content_Length method), to allow the servlet container
-- to use a persistent connection to return its response to the client,
-- improving performance. The content length is automatically set if the entire
-- response fits inside the response buffer.
--
-- When using HTTP 1.1 chunked encoding (which means that the response has a
-- Transfer-Encoding header), do not set the Content-Length header.
--
-- The GET method should be safe, that is, without any side effects for which
-- users are held responsible. For example, most form queries have no side effects.
-- If a client request is intended to change stored data, the request should use
-- some other HTTP method.
--
-- The GET method should also be idempotent, meaning that it can be safely repeated.
-- Sometimes making a method safe also makes it idempotent. For example, repeating
-- queries is both safe and idempotent, but buying a product online or modifying
-- data is neither safe nor idempotent.
--
-- If the request is incorrectly formatted, Do_Get returns an HTTP "Bad Request"
procedure Do_Get (Server : in Servlet;
Request : in out Requests.Request'Class;
Response : in out Responses.Response'Class);
-- Receives an HTTP HEAD request from the protected service method and handles
-- the request. The client sends a HEAD request when it wants to see only the
-- headers of a response, such as Content-Type or Content-Length. The HTTP HEAD
-- method counts the output bytes in the response to set the Content-Length header
-- accurately.
--
-- If you override this method, you can avoid computing the response body and just
-- set the response headers directly to improve performance. Make sure that the
-- Do_Head method you write is both safe and idempotent (that is, protects itself
-- from being called multiple times for one HTTP HEAD request).
--
-- If the HTTP HEAD request is incorrectly formatted, doHead returns an HTTP
-- "Bad Request" message.
procedure Do_Head (Server : in Servlet;
Request : in out Requests.Request'Class;
Response : in out Responses.Response'Class);
-- Called by the server (via the service method) to allow a servlet to handle
-- a POST request. The HTTP POST method allows the client to send data of unlimited
-- length to the Web server a single time and is useful when posting information
-- such as credit card numbers.
--
-- When overriding this method, read the request data, write the response headers,
-- get the response's writer or output stream object, and finally, write the
-- response data. It's best to include content type and encoding. When using
-- a PrintWriter object to return the response, set the content type before
-- accessing the PrintWriter object.
--
-- The servlet container must write the headers before committing the response,
-- because in HTTP the headers must be sent before the response body.
--
-- Where possible, set the Content-Length header (with the
-- Response.Set_Content_Length method), to allow the servlet container to use
-- a persistent connection to return its response to the client, improving
-- performance. The content length is automatically set if the entire response
-- fits inside the response buffer.
--
-- When using HTTP 1.1 chunked encoding (which means that the response has a
-- Transfer-Encoding header), do not set the Content-Length header.
--
-- This method does not need to be either safe or idempotent. Operations
-- requested through POST can have side effects for which the user can be held
-- accountable, for example, updating stored data or buying items online.
--
-- If the HTTP POST request is incorrectly formatted, doPost returns
-- an HTTP "Bad Request" message.
procedure Do_Post (Server : in Servlet;
Request : in out Requests.Request'Class;
Response : in out Responses.Response'Class);
-- Called by the server (via the service method) to allow a servlet to handle
-- a PUT request. The PUT operation allows a client to place a file on the server
-- and is similar to sending a file by FTP.
--
-- When overriding this method, leave intact any content headers sent with
-- the request (including Content-Length, Content-Type, Content-Transfer-Encoding,
-- Content-Encoding, Content-Base, Content-Language, Content-Location,
-- Content-MD5, and Content-Range). If your method cannot handle a content
-- header, it must issue an error message (HTTP 501 - Not Implemented) and
-- discard the request. For more information on HTTP 1.1, see RFC 2616 .
--
-- This method does not need to be either safe or idempotent. Operations that
-- Do_Put performs can have side effects for which the user can be held accountable.
-- When using this method, it may be useful to save a copy of the affected URL
-- in temporary storage.
--
-- If the HTTP PUT request is incorrectly formatted, Do_Put returns
-- an HTTP "Bad Request" message.
procedure Do_Put (Server : in Servlet;
Request : in out Requests.Request'Class;
Response : in out Responses.Response'Class);
-- Called by the server (via the service method) to allow a servlet to handle
-- a DELETE request. The DELETE operation allows a client to remove a document
-- or Web page from the server.
--
-- This method does not need to be either safe or idempotent. Operations requested
-- through DELETE can have side effects for which users can be held accountable.
-- When using this method, it may be useful to save a copy of the affected URL in
-- temporary storage.
--
-- If the HTTP DELETE request is incorrectly formatted, Do_Delete returns an HTTP
-- "Bad Request" message.
procedure Do_Delete (Server : in Servlet;
Request : in out Requests.Request'Class;
Response : in out Responses.Response'Class);
-- Called by the server (via the service method) to allow a servlet to handle a
-- OPTIONS request. The OPTIONS request determines which HTTP methods the server
-- supports and returns an appropriate header. For example, if a servlet overrides
-- Do_Get, this method returns the following header:
--
-- Allow: GET, HEAD, TRACE, OPTIONS
--
-- There's no need to override this method unless the servlet implements new
-- HTTP methods, beyond those implemented by HTTP 1.1.
procedure Do_Options (Server : in Servlet;
Request : in out Requests.Request'Class;
Response : in out Responses.Response'Class);
-- Called by the server (via the service method) to allow a servlet to handle
-- a TRACE request. A TRACE returns the headers sent with the TRACE request to
-- the client, so that they can be used in debugging. There's no need to override
-- this method.
procedure Do_Trace (Server : in Servlet;
Request : in out Requests.Request'Class;
Response : in out Responses.Response'Class);
-- Called by the server (via the service method) to allow a servlet to handle
-- a PATCH request (RFC 5789).
procedure Do_Patch (Server : in Servlet;
Request : in out Requests.Request'Class;
Response : in out Responses.Response'Class);
-- JSR 315 9. Dispatching Requests
type Request_Dispatcher is limited private;
-- Forwards a request from a servlet to another resource
-- (servlet, or HTML file) on the server. This method allows one servlet to do
-- preliminary processing of a request and another resource to generate the response.
--
-- For a Request_Dispatcher obtained via Get_Request_Dispatcher(),
-- the ServletRequest object has its path elements and parameters adjusted
-- to match the path of the target resource.
--
-- forward should be called before the response has been committed to the
-- client (before response body output has been flushed). If the response
-- already has been committed, this method throws an IllegalStateException.
-- Uncommitted output in the response buffer is automatically cleared before
-- the forward.
--
-- The request and response parameters must be either the same objects as were
-- passed to the calling servlet's service method or be subclasses of the
-- RequestWrapper or ResponseWrapper classes that wrap them.
procedure Forward (Dispatcher : in Request_Dispatcher;
Request : in out Requests.Request'Class;
Response : in out Responses.Response'Class);
-- Includes the content of a resource (servlet, or, HTML file) in the response.
-- In essence, this method enables programmatic server-side includes.
--
-- The Response object has its path elements and parameters remain
-- unchanged from the caller's. The included servlet cannot change the response
-- status code or set headers; any attempt to make a change is ignored.
--
-- The request and response parameters must be either the same objects as were
-- passed to the calling servlet's service method or be subclasses of the
-- RequestWrapper or ResponseWrapper classes that wrap them.
procedure Include (Dispatcher : in Request_Dispatcher;
Request : in out Requests.Request'Class;
Response : in out Responses.Response'Class);
-- Returns the servlet that will be called when forwarding the request.
function Get_Servlet (Dispatcher : in Request_Dispatcher) return Servlet_Access;
-- Returns a Request_Dispatcher object that acts as a wrapper for the resource
-- located at the given path. A Request_Dispatcher object can be used to forward
-- a request to the resource or to include the resource in a response.
-- The resource can be dynamic or static.
function Get_Request_Dispatcher (Context : in Servlet_Registry;
Path : in String)
return Request_Dispatcher;
-- Returns a Request_Dispatcher object that acts as a wrapper for the named servlet.
--
-- Servlets may be given names via server administration or via a web application
-- deployment descriptor. A servlet instance can determine its name using
-- ServletConfig.getServletName().
function Get_Name_Dispatcher (Context : in Servlet_Registry;
Name : in String)
return Request_Dispatcher;
-- Returns the context path of the web application.
-- The context path is the portion of the request URI that is used to select the context
-- of the request. The context path always comes first in a request URI. The path starts
-- with a "/" character but does not end with a "/" character. For servlets in the default
-- (root) context, this method returns "".
function Get_Context_Path (Context : in Servlet_Registry) return String;
-- Returns a String containing the value of the named context-wide initialization
-- parameter, or null if the parameter does not exist.
--
-- This method can make available configuration information useful to an entire
-- "web application". For example, it can provide a webmaster's email address
-- or the name of a system that holds critical data.
function Get_Init_Parameter (Context : in Servlet_Registry;
Name : in String;
Default : in String := "") return String;
function Get_Init_Parameter (Context : in Servlet_Registry;
Name : in String;
Default : in String := "")
return Ada.Strings.Unbounded.Unbounded_String;
-- Set the init parameter identified by <b>Name</b> to the value <b>Value</b>.
procedure Set_Init_Parameter (Context : in out Servlet_Registry;
Name : in String;
Value : in String);
-- Set the init parameters by copying the properties defined in <b>Params</b>.
-- Existing parameters will be overriding by the new values.
procedure Set_Init_Parameters (Context : in out Servlet_Registry;
Params : in Util.Properties.Manager'Class);
-- Get access to the init parameters.
procedure Get_Init_Parameters (Context : in Servlet_Registry;
Process : not null access
procedure (Params : in Util.Properties.Manager'Class));
-- Returns the absolute path of the resource identified by the given relative path.
-- The resource is searched in a list of directories configured by the application.
-- The path must begin with a "/" and is interpreted as relative to the current
-- context root.
--
-- This method allows the servlet container to make a resource available to
-- servlets from any source.
--
-- This method returns an empty string if the resource could not be localized.
function Get_Resource (Context : in Servlet_Registry;
Path : in String) return String;
-- Registers the given servlet instance with this ServletContext under
-- the given servletName.
--
-- If this ServletContext already contains a preliminary
-- ServletRegistration for a servlet with the given servletName,
-- it will be completed (by assigning the class name of the given
-- servlet instance to it) and returned.
procedure Add_Servlet (Registry : in out Servlet_Registry;
Name : in String;
Server : in Servlet_Access);
-- Registers the given filter instance with this Servlet context.
procedure Add_Filter (Registry : in out Servlet_Registry;
Name : in String;
Filter : in Filter_Access);
-- Add a filter mapping with the given pattern
-- If the URL pattern is already mapped to a different servlet,
-- no updates will be performed.
procedure Add_Filter_Mapping (Registry : in out Servlet_Registry;
Pattern : in String;
Name : in String);
-- Add a servlet mapping with the given pattern
-- If the URL pattern is already mapped to a different servlet,
-- no updates will be performed.
procedure Add_Mapping (Registry : in out Servlet_Registry;
Pattern : in String;
Name : in String);
-- Add a servlet mapping with the given pattern
-- If the URL pattern is already mapped to a different servlet,
-- no updates will be performed.
procedure Add_Mapping (Registry : in out Servlet_Registry;
Pattern : in String;
Server : in Servlet_Access);
-- Add a route associated with the given path pattern. The pattern is split into components.
-- Some path components can be a fixed string (/home) and others can be variable.
-- When a path component is variable, the value can be retrieved from the route context.
-- Once the route path is created, the <tt>Process</tt> procedure is called with the route
-- reference.
procedure Add_Route (Registry : in out Servlet_Registry;
Pattern : in String;
ELContext : in EL.Contexts.ELContext'Class;
Process : not null access
procedure (Route : in out Routes.Route_Type_Ref));
-- Set the error page that will be used if a servlet returns an error.
procedure Set_Error_Page (Server : in out Servlet_Registry;
Error : in Integer;
Page : in String);
-- Send the error page content defined by the response status.
procedure Send_Error_Page (Server : in Servlet_Registry;
Request : in out Requests.Request'Class;
Response : in out Responses.Response'Class);
-- Report an error when an exception occurred while processing the request.
procedure Error (Registry : in Servlet_Registry;
Request : in out Requests.Request'Class;
Response : in out Responses.Response'Class;
Ex : in Ada.Exceptions.Exception_Occurrence);
-- Register the application represented by <b>Registry</b> under the base URI defined
-- by <b>URI</b>. This is called by the Web container when the application is registered.
-- The default implementation keeps track of the base URI to implement the context path
-- operation.
procedure Register_Application (Registry : in out Servlet_Registry;
URI : in String);
-- Start the application.
procedure Start (Registry : in out Servlet_Registry);
-- Get the application status.
function Get_Status (Registry : in Servlet_Registry) return Status_Type;
-- Disable the application.
procedure Disable (Registry : in out Servlet_Registry);
-- Enable the application.
procedure Enable (Registry : in out Servlet_Registry);
-- Stop the application.
procedure Stop (Registry : in out Servlet_Registry);
-- Finalize the servlet registry releasing the internal mappings.
overriding
procedure Finalize (Registry : in out Servlet_Registry);
-- Dump the routes and filter configuration in the log with the given log level.
procedure Dump_Routes (Registry : in out Servlet_Registry;
Level : in Util.Log.Level_Type);
private
use Ada.Strings.Unbounded;
type Filter_Chain is limited record
Filter_Pos : Natural;
Filters : Filter_List_Access;
Servlet : Servlet_Access;
end record;
type Request_Dispatcher is limited record
Context : aliased Routes.Route_Context_Type;
Filters : Filter_List_Access;
Servlet : Servlet_Access := null;
Pos : Natural := 0;
end record;
type Servlet is new Ada.Finalization.Limited_Controlled with record
Name : Unbounded_String;
Context : Servlet_Registry_Access := null;
end record;
package Filter_Maps is new
Ada.Containers.Indefinite_Hashed_Maps (Key_Type => String,
Element_Type => Filter_Access,
Hash => Ada.Strings.Hash,
Equivalent_Keys => "=");
package Filter_List_Maps is new
Ada.Containers.Indefinite_Hashed_Maps (Key_Type => String,
Element_Type => Filter_List_Access,
Hash => Ada.Strings.Hash,
Equivalent_Keys => "=");
package Servlet_Maps is new
Ada.Containers.Indefinite_Hashed_Maps (Key_Type => String,
Element_Type => Servlet_Access,
Hash => Ada.Strings.Hash,
Equivalent_Keys => "=");
function Hash (N : Integer) return Ada.Containers.Hash_Type;
package Error_Maps is new
Ada.Containers.Indefinite_Hashed_Maps (Key_Type => Integer,
Element_Type => String,
Hash => Hash,
Equivalent_Keys => "=");
use Routes;
type Servlet_Registry is new Sessions.Factory.Session_Factory with record
Config : Util.Properties.Manager;
Servlets : Servlet_Maps.Map;
Filters : Filter_Maps.Map;
Filter_Rules : Filter_List_Maps.Map;
Filter_Patterns : Util.Strings.Vectors.Vector;
Error_Pages : Error_Maps.Map;
Context_Path : Unbounded_String;
Routes : Router_Type;
Status : Status_Type := Ready;
end record;
-- Install the servlet filters after all the mappings have been registered.
procedure Install_Filters (Registry : in out Servlet_Registry);
type Filter_Config is record
Name : Unbounded_String;
Context : Servlet_Registry_Access := null;
end record;
end Servlet.Core;
| 49.45 | 97 | 0.655568 |
1a82f9fdb189f23fef9a819a5473f2ace2bf80f7 | 3,755 | ads | Ada | Ada95/samples/sample-menu_demo-handler.ads | mvaisakh/android_external_libncurses | d44c8a16d7f1ed276d0de0b3f6f1a5596c5f556f | [
"DOC",
"Unlicense"
] | 35 | 2015-03-07T13:26:22.000Z | 2021-11-06T16:18:59.000Z | Ada95/samples/sample-menu_demo-handler.ads | mvaisakh/android_external_libncurses | d44c8a16d7f1ed276d0de0b3f6f1a5596c5f556f | [
"DOC",
"Unlicense"
] | 3 | 2017-04-07T21:02:48.000Z | 2017-04-08T17:59:35.000Z | Ada95/samples/sample-menu_demo-handler.ads | mvaisakh/android_external_libncurses | d44c8a16d7f1ed276d0de0b3f6f1a5596c5f556f | [
"DOC",
"Unlicense"
] | 19 | 2015-06-16T06:13:44.000Z | 2021-07-24T02:37:45.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding Samples --
-- --
-- Sample.Menu_Demo.Handler --
-- --
-- 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: Juergen Pfeifer, 1996
-- Version Control
-- $Revision: 1.9 $
-- Binding Version 01.00
------------------------------------------------------------------------------
with Terminal_Interface.Curses;
use Terminal_Interface.Curses;
with Terminal_Interface.Curses.Panels;
use Terminal_Interface.Curses.Panels;
with Terminal_Interface.Curses.Menus;
use Terminal_Interface.Curses.Menus;
generic
with function My_Driver (Men : Menu;
K : Key_Code;
Pan : Panel) return Boolean;
package Sample.Menu_Demo.Handler is
procedure Drive_Me (M : in Menu;
Lin : in Line_Position;
Col : in Column_Position;
Title : in String := "");
-- Position the menu at the given point and drive it.
procedure Drive_Me (M : in Menu;
Title : in String := "");
-- Center menu and drive it.
end Sample.Menu_Demo.Handler;
| 57.769231 | 78 | 0.443675 |
ad766842885315b74af1af3b9de19c9a49ac5e89 | 46 | ads | Ada | tests/nonsmoke/functional/CompileTests/experimental_ada_tests/function_declaration.ads | ucd-plse/rose | 17db6454e8baba0014e30a8ec23df1a11ac55a0c | [
"BSD-3-Clause"
] | 488 | 2015-01-09T08:54:48.000Z | 2022-03-30T07:15:46.000Z | tests/nonsmoke/functional/CompileTests/experimental_ada_tests/function_declaration.ads | ucd-plse/rose | 17db6454e8baba0014e30a8ec23df1a11ac55a0c | [
"BSD-3-Clause"
] | 174 | 2015-01-28T18:41:32.000Z | 2022-03-31T16:51:05.000Z | tests/nonsmoke/functional/CompileTests/experimental_ada_tests/tests/function_declaration.ads | passlab/rexompiler | 5494df3766ab606e230c5f1785b438a019c9e353 | [
"BSD-3-Clause"
] | 146 | 2015-04-27T02:48:34.000Z | 2022-03-04T07:32:53.000Z | function Function_Declaration return Integer;
| 23 | 45 | 0.891304 |
ad296c1c5dc1f379ec87bc1ca4b82de5a976ef65 | 9,854 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/s-mmosin-mingw.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/ada/s-mmosin-mingw.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/s-mmosin-mingw.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . M M A P . O S _ I N T E R F A C E --
-- --
-- S p e c --
-- --
-- Copyright (C) 2007-2016, AdaCore --
-- --
-- This library is free software; you can redistribute it and/or modify it --
-- under terms of the GNU General Public License as published by the Free --
-- Software Foundation; either version 3, or (at your option) any later --
-- version. This library is distributed in the hope that it will be useful, --
-- but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHAN- --
-- TABILITY or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- OS pecularities abstraction package for Win32 systems.
package System.Mmap.OS_Interface is
-- The Win package contains copy of definition found in recent System.Win32
-- unit provided with the GNAT compiler. The copy is needed to be able to
-- compile this unit with older compilers. Note that this internal Win
-- package can be removed when GNAT 6.1.0 is not supported anymore.
package Win is
subtype PVOID is Standard.System.Address;
type HANDLE is new Interfaces.C.ptrdiff_t;
type WORD is new Interfaces.C.unsigned_short;
type DWORD is new Interfaces.C.unsigned_long;
type LONG is new Interfaces.C.long;
type SIZE_T is new Interfaces.C.size_t;
type BOOL is new Interfaces.C.int;
for BOOL'Size use Interfaces.C.int'Size;
FALSE : constant := 0;
GENERIC_READ : constant := 16#80000000#;
GENERIC_WRITE : constant := 16#40000000#;
OPEN_EXISTING : constant := 3;
type OVERLAPPED is record
Internal : DWORD;
InternalHigh : DWORD;
Offset : DWORD;
OffsetHigh : DWORD;
hEvent : HANDLE;
end record;
type SECURITY_ATTRIBUTES is record
nLength : DWORD;
pSecurityDescriptor : PVOID;
bInheritHandle : BOOL;
end record;
type SYSTEM_INFO is record
dwOemId : DWORD;
dwPageSize : DWORD;
lpMinimumApplicationAddress : PVOID;
lpMaximumApplicationAddress : PVOID;
dwActiveProcessorMask : PVOID;
dwNumberOfProcessors : DWORD;
dwProcessorType : DWORD;
dwAllocationGranularity : DWORD;
wProcessorLevel : WORD;
wProcessorRevision : WORD;
end record;
type LP_SYSTEM_INFO is access all SYSTEM_INFO;
INVALID_HANDLE_VALUE : constant HANDLE := -1;
FILE_BEGIN : constant := 0;
FILE_SHARE_READ : constant := 16#00000001#;
FILE_ATTRIBUTE_NORMAL : constant := 16#00000080#;
FILE_MAP_COPY : constant := 1;
FILE_MAP_READ : constant := 4;
FILE_MAP_WRITE : constant := 2;
PAGE_READONLY : constant := 16#0002#;
PAGE_READWRITE : constant := 16#0004#;
INVALID_FILE_SIZE : constant := 16#FFFFFFFF#;
function CreateFile
(lpFileName : Standard.System.Address;
dwDesiredAccess : DWORD;
dwShareMode : DWORD;
lpSecurityAttributes : access SECURITY_ATTRIBUTES;
dwCreationDisposition : DWORD;
dwFlagsAndAttributes : DWORD;
hTemplateFile : HANDLE) return HANDLE;
pragma Import (Stdcall, CreateFile, "CreateFileW");
function WriteFile
(hFile : HANDLE;
lpBuffer : Standard.System.Address;
nNumberOfBytesToWrite : DWORD;
lpNumberOfBytesWritten : access DWORD;
lpOverlapped : access OVERLAPPED) return BOOL;
pragma Import (Stdcall, WriteFile, "WriteFile");
function ReadFile
(hFile : HANDLE;
lpBuffer : Standard.System.Address;
nNumberOfBytesToRead : DWORD;
lpNumberOfBytesRead : access DWORD;
lpOverlapped : access OVERLAPPED) return BOOL;
pragma Import (Stdcall, ReadFile, "ReadFile");
function CloseHandle (hObject : HANDLE) return BOOL;
pragma Import (Stdcall, CloseHandle, "CloseHandle");
function GetFileSize
(hFile : HANDLE; lpFileSizeHigh : access DWORD) return DWORD;
pragma Import (Stdcall, GetFileSize, "GetFileSize");
function SetFilePointer
(hFile : HANDLE;
lDistanceToMove : LONG;
lpDistanceToMoveHigh : access LONG;
dwMoveMethod : DWORD) return DWORD;
pragma Import (Stdcall, SetFilePointer, "SetFilePointer");
function CreateFileMapping
(hFile : HANDLE;
lpSecurityAttributes : access SECURITY_ATTRIBUTES;
flProtect : DWORD;
dwMaximumSizeHigh : DWORD;
dwMaximumSizeLow : DWORD;
lpName : Standard.System.Address) return HANDLE;
pragma Import (Stdcall, CreateFileMapping, "CreateFileMappingW");
function MapViewOfFile
(hFileMappingObject : HANDLE;
dwDesiredAccess : DWORD;
dwFileOffsetHigh : DWORD;
dwFileOffsetLow : DWORD;
dwNumberOfBytesToMap : SIZE_T) return Standard.System.Address;
pragma Import (Stdcall, MapViewOfFile, "MapViewOfFile");
function UnmapViewOfFile
(lpBaseAddress : Standard.System.Address) return BOOL;
pragma Import (Stdcall, UnmapViewOfFile, "UnmapViewOfFile");
procedure GetSystemInfo (lpSystemInfo : LP_SYSTEM_INFO);
pragma Import (Stdcall, GetSystemInfo, "GetSystemInfo");
end Win;
type System_File is record
Handle : Win.HANDLE;
Mapped : Boolean;
-- Whether mapping is requested by the user and available on the system
Mapping_Handle : Win.HANDLE;
Write : Boolean;
-- Whether this file can be written to
Length : File_Size;
-- Length of the file. Used to know what can be mapped in the file
end record;
type System_Mapping is record
Address : Standard.System.Address;
Length : File_Size;
end record;
Invalid_System_File : constant System_File :=
(Win.INVALID_HANDLE_VALUE, False, Win.INVALID_HANDLE_VALUE, False, 0);
Invalid_System_Mapping : constant System_Mapping :=
(Standard.System.Null_Address, 0);
function Open_Read
(Filename : String;
Use_Mmap_If_Available : Boolean := True) return System_File;
-- Open a file for reading and return the corresponding System_File. Return
-- Invalid_System_File if unsuccessful.
function Open_Write
(Filename : String;
Use_Mmap_If_Available : Boolean := True) return System_File;
-- Likewise for writing to a file
procedure Close (File : in out System_File);
-- Close a system file
function Read_From_Disk
(File : System_File;
Offset, Length : File_Size) return System.Strings.String_Access;
-- Read a fragment of a file. It is up to the caller to free the result
-- when done with it.
procedure Write_To_Disk
(File : System_File;
Offset, Length : File_Size;
Buffer : System.Strings.String_Access);
-- Write some content to a fragment of a file
procedure Create_Mapping
(File : System_File;
Offset, Length : in out File_Size;
Mutable : Boolean;
Mapping : out System_Mapping);
-- Create a memory mapping for the given File, for the area starting at
-- Offset and containing Length bytes. Store it to Mapping.
-- Note that Offset and Length may be modified according to the system
-- needs (for boudaries, for instance). The caller must cope with actually
-- wider mapped areas.
procedure Dispose_Mapping
(Mapping : in out System_Mapping);
-- Unmap a previously-created mapping
function Get_Page_Size return File_Size;
-- Return the number of bytes in a system page.
end System.Mmap.OS_Interface;
| 41.754237 | 79 | 0.56373 |
04501a6f2248b92ddbb92f2db5997ea723b61f69 | 3,058 | ads | Ada | src/graphe.ads | GauBen/Arbre-Genealogique | 410dfd4e783871846a87aa2198ab37e05413f5b6 | [
"MIT"
] | 1 | 2021-01-26T16:03:10.000Z | 2021-01-26T16:03:10.000Z | src/graphe.ads | GauBen/Arbre-Genealogique | 410dfd4e783871846a87aa2198ab37e05413f5b6 | [
"MIT"
] | null | null | null | src/graphe.ads | GauBen/Arbre-Genealogique | 410dfd4e783871846a87aa2198ab37e05413f5b6 | [
"MIT"
] | null | null | null | -- Package Graphe
-- Gère le stockage et la manipulation de graphes orientés.
-- Généricité :
-- Les sommets et les arêtes sont étiquetés par les éléments des types
-- T_Etiquette_Sommet et T_Etiquette_Arete
generic
type T_Etiquette_Sommet is private;
type T_Etiquette_Arete is private;
package Graphe is
-- Type accessibles de l'extérieur : le graphe et la liste d'adjacence,
-- pour explorer les arêtes sortant d'un sommet
type T_Graphe is limited private;
type T_Liste_Adjacence is limited private;
-- Type public pour la lecture de la liste d'adjacence
type T_Arete_Etiquetee is record
Etiquette : T_Etiquette_Arete;
Destination : T_Etiquette_Sommet;
end record;
-- Exceptions : une étiquette donnée ne correspond � aucun sommet
Sommet_Non_Trouve : exception;
-- La liste donnée est vide
Vide : exception;
-- Initialise un graphe vide.
procedure Initialiser (Graphe : out T_Graphe);
-- Libère l'espace mémoire occupé par un graphe.
procedure Detruire (Graphe : in out T_Graphe);
-- Ajoute un sommet au graphe avec l'étiquette donnée.
procedure Ajouter_Sommet
(Graphe : in out T_Graphe; Etiquette : T_Etiquette_Sommet);
-- Ajoute une arête entre deux sommets donnés.
procedure Ajouter_Arete
(Graphe : in out T_Graphe; Origine : in T_Etiquette_Sommet;
Etiquette : in T_Etiquette_Arete; Destination : in T_Etiquette_Sommet);
-- Renvoie la liste des arêtes sortant du sommet donné.
procedure Chaine_Adjacence
(Adjacence : out T_Liste_Adjacence; Graphe : in T_Graphe;
Origine : in T_Etiquette_Sommet);
-- Renvoie vrai si on peut continuer à itérer.
function Adjacence_Non_Vide (Adjacence : T_Liste_Adjacence) return Boolean;
-- Lit l'arête suivante et avance la lecture.
procedure Arete_Suivante
(Adjacence : in out T_Liste_Adjacence; Arete : out T_Arete_Etiquetee);
procedure Supprimer_Arete
(Graphe : in T_Graphe; Origine : in T_Etiquette_Sommet;
Etiquette_Arete : in T_Etiquette_Arete;
Destination : in T_Etiquette_Sommet);
function Indiquer_Sommet_Existe
(Graphe : T_Graphe; Etiquette : T_Etiquette_Sommet) return Boolean;
function Est_Vide (Graphe : T_Graphe) return Boolean;
-- Applique une procédure P sur tous les éléments du registre.
generic
with procedure P (Cle : in T_Etiquette_Sommet; Liste : in out T_Liste_Adjacence);
procedure Appliquer_Sur_Tous_Sommets (Graphe : in T_Graphe);
private
-- Un graphe est représenté par une liste chaînée de sommets
-- et les arêtes par une liste chaînée aussi
type T_Sommet;
type T_Arete;
type T_Graphe is access T_Sommet;
type T_Liste_Adjacence is access T_Arete;
type T_Sommet is record
Etiquette : T_Etiquette_Sommet;
Arete : T_Liste_Adjacence;
Suivant : T_Graphe;
end record;
type T_Arete is record
Etiquette : T_Etiquette_Arete;
Destination : T_Graphe;
Suivante : T_Liste_Adjacence;
end record;
end Graphe;
| 32.531915 | 87 | 0.723349 |
0424f5ea400f20c9c1a6e875547ef74ad7356bd8 | 8,830 | adb | Ada | examples/src/bitmapped_drawing.adb | ellamosi/Ada_BMP_Library | c1de8ce0127dd6b264a6e5abcd721a26bf005c3f | [
"BSD-3-Clause"
] | null | null | null | examples/src/bitmapped_drawing.adb | ellamosi/Ada_BMP_Library | c1de8ce0127dd6b264a6e5abcd721a26bf005c3f | [
"BSD-3-Clause"
] | null | null | null | examples/src/bitmapped_drawing.adb | ellamosi/Ada_BMP_Library | c1de8ce0127dd6b264a6e5abcd721a26bf005c3f | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015-2016, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with Bitmap.Color_Conversion; use Bitmap.Color_Conversion;
package body Bitmapped_Drawing is
---------------
-- Draw_Char --
---------------
procedure Draw_Char
(Buffer : in out Bitmap_Buffer'Class;
Start : Point;
Char : Character;
Font : BMP_Font;
Foreground : UInt32;
Background : UInt32)
is
begin
for H in 0 .. Char_Height (Font) - 1 loop
for W in 0 .. Char_Width (Font) - 1 loop
if (Data (Font, Char, H) and Mask (Font, W)) /= 0 then
Buffer.Set_Pixel
((Start.X + W, Start.Y + H), Foreground);
else
Buffer.Set_Pixel
((Start.X + W, Start.Y + H), Background);
end if;
end loop;
end loop;
end Draw_Char;
-----------------
-- Draw_String --
-----------------
procedure Draw_String
(Buffer : in out Bitmap_Buffer'Class;
Start : Point;
Msg : String;
Font : BMP_Font;
Foreground : Bitmap_Color;
Background : Bitmap_Color)
is
Count : Natural := 0;
FG : constant UInt32 := Bitmap_Color_To_Word (Buffer.Color_Mode,
Foreground);
BG : constant UInt32 := Bitmap_Color_To_Word (Buffer.Color_Mode,
Background);
begin
for C of Msg loop
exit when Start.X + Count * Char_Width (Font) > Buffer.Width;
Draw_Char
(Buffer,
(Start.X + Count * Char_Width (Font), Start.Y),
C,
Font,
FG,
BG);
Count := Count + 1;
end loop;
end Draw_String;
-----------------
-- Draw_String --
-----------------
procedure Draw_String
(Buffer : in out Bitmap_Buffer'Class;
Start : Point;
Msg : String;
Font : Hershey_Font;
Height : Natural;
Bold : Boolean;
Foreground : Bitmap_Color;
Fast : Boolean := True)
is
FG : constant UInt32 := Bitmap_Color_To_Word (Buffer.Color_Mode,
Foreground);
procedure Internal_Draw_Line
(X0, Y0, X1, Y1 : Natural;
Width : Positive);
procedure Internal_Draw_Line
(X0, Y0, X1, Y1 : Natural;
Width : Positive)
is
begin
Draw_Line (Buffer,
FG,
(X0, Y0),
(X1, Y1),
Width,
Fast => Fast);
end Internal_Draw_Line;
procedure Draw_Glyph is new Hershey_Fonts.Draw_Glyph
(Internal_Draw_Line);
Current : Point := Start;
begin
for C of Msg loop
exit when Current.X > Buffer.Width;
Draw_Glyph
(Fnt => Font,
C => C,
X => Current.X,
Y => Current.Y,
Height => Height,
Bold => Bold);
end loop;
end Draw_String;
-----------------
-- Draw_String --
-----------------
procedure Draw_String
(Buffer : in out Bitmap_Buffer'Class;
Area : Rect;
Msg : String;
Font : Hershey_Font;
Bold : Boolean;
Outline : Boolean;
Foreground : Bitmap_Color;
Fast : Boolean := True)
is
Length : constant Natural :=
Hershey_Fonts.Strlen (Msg, Font, Area.Height);
Ratio : Float;
Current : Point := (0, 0);
Prev : UInt32;
FG : constant UInt32 := Bitmap_Color_To_Word (Buffer.Color_Mode,
Foreground);
Blk : constant UInt32 := Bitmap_Color_To_Word (Buffer.Color_Mode,
Black);
procedure Internal_Draw_Line
(X0, Y0, X1, Y1 : Natural;
Width : Positive);
procedure Internal_Draw_Line
(X0, Y0, X1, Y1 : Natural;
Width : Positive)
is
begin
Draw_Line (Buffer,
Foreground,
(Area.Position.X + Natural (Float (X0) * Ratio),
Area.Position.Y + Y0),
(Area.Position.X + Natural (Float (X1) * Ratio),
Area.Position.Y + Y1),
Width,
Fast);
end Internal_Draw_Line;
procedure Draw_Glyph is new Hershey_Fonts.Draw_Glyph
(Internal_Draw_Line);
begin
if Length > Area.Width then
Ratio := Float (Area.Width) / Float (Length);
else
Ratio := 1.0;
Current.X := (Area.Width - Length) / 2;
end if;
for C of Msg loop
Draw_Glyph
(Fnt => Font,
C => C,
X => Current.X,
Y => Current.Y,
Height => Area.Height,
Bold => Bold);
end loop;
if Outline and then Area.Height > 40 then
for Y in Area.Position.Y + 1 .. Area.Position.Y + Area.Height loop
Prev := Buffer.Pixel ((Area.Position.X, Y));
if Prev = FG then
Buffer.Set_Pixel ((Area.Position.X, Y), Black);
end if;
for X in Area.Position.X + 1 .. Area.Position.X + Area.Width loop
declare
Col : constant UInt32 := Buffer.Pixel ((X, Y));
Top : constant UInt32 := Buffer.Pixel ((X, Y - 1));
begin
if Prev /= FG
and then Col = FG
then
Buffer.Set_Pixel ((X, Y), Blk);
elsif Prev = FG
and then Col /= FG
then
Buffer.Set_Pixel ((X - 1, Y), Blk);
elsif Top /= FG
and then Top /= Blk
and then Col = FG
then
Buffer.Set_Pixel ((X, Y), Blk);
elsif Top = FG
and then Col /= FG
then
Buffer.Set_Pixel ((X, Y - 1), Blk);
end if;
Prev := Col;
end;
end loop;
end loop;
end if;
end Draw_String;
end Bitmapped_Drawing;
| 34.901186 | 78 | 0.458437 |
13281f3f2c064568555ea2203b5f2ed4db93f171 | 8,967 | adb | Ada | awa/src/awa-commands-start.adb | twdroeger/ada-awa | 77b824773747aecb912c37b1b7b59ea414679b80 | [
"Apache-2.0"
] | null | null | null | awa/src/awa-commands-start.adb | twdroeger/ada-awa | 77b824773747aecb912c37b1b7b59ea414679b80 | [
"Apache-2.0"
] | null | null | null | awa/src/awa-commands-start.adb | twdroeger/ada-awa | 77b824773747aecb912c37b1b7b59ea414679b80 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- awa-commands-start -- Command to start the web server
-- Copyright (C) 2020 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with System;
with Servlet.Core;
with Servlet.Server;
with GNAT.Sockets;
with AWA.Applications;
package body AWA.Commands.Start is
use Ada.Strings.Unbounded;
use GNAT.Sockets;
use type System.Address;
-- ------------------------------
-- Start the server and all the application that have been registered.
-- ------------------------------
overriding
procedure Execute (Command : in out Command_Type;
Name : in String;
Args : in Argument_List'Class;
Context : in out Context_Type) is
begin
Command.Configure_Server (Context);
Command.Configure_Applications (Context);
Command.Start_Server (Context);
Command.Wait_Server (Context);
end Execute;
-- ------------------------------
-- Configure the web server container before applications are registered.
-- ------------------------------
procedure Configure_Server (Command : in out Command_Type;
Context : in out Context_Type) is
Config : Servlet.Server.Configuration;
begin
-- If daemon(3) is available and -d is defined, run it so that the parent
-- process terminates and the child process continues.
if Command.Daemon and Sys_Daemon'Address /= System.Null_Address then
declare
Result : constant Integer := Sys_Daemon (1, 0);
begin
if Result /= 0 then
Context.Console.Error ("Cannot run in background");
end if;
end;
end if;
Config.Listening_Port := Command.Listening_Port;
Config.Max_Connection := Command.Max_Connection;
Config.TCP_No_Delay := Command.TCP_No_Delay;
if Command.Upload'Length > 0 then
Config.Upload_Directory := To_Unbounded_String (Command.Upload.all);
end if;
Command_Drivers.WS.Configure (Config);
end Configure_Server;
-- ------------------------------
-- Configure all registered applications.
-- ------------------------------
procedure Configure_Applications (Command : in out Command_Type;
Context : in out Context_Type) is
procedure Configure (URI : in String;
Application : in Servlet.Core.Servlet_Registry_Access);
Count : Natural := 0;
procedure Configure (URI : in String;
Application : in Servlet.Core.Servlet_Registry_Access) is
begin
if Application.all in AWA.Applications.Application'Class then
Configure (AWA.Applications.Application'Class (Application.all),
URI (URI'First + 1 .. URI'Last),
Context);
Count := Count + 1;
end if;
end Configure;
Config : Servlet.Server.Configuration;
begin
Command_Drivers.WS.Iterate (Configure'Access);
if Count = 0 then
Context.Console.Error (-("There is no application"));
return;
end if;
end Configure_Applications;
-- ------------------------------
-- Start the web server.
-- ------------------------------
procedure Start_Server (Command : in out Command_Type;
Context : in out Context_Type) is
begin
Context.Console.Notice (N_INFO, "Starting...");
Command_Drivers.WS.Start;
end Start_Server;
-- ------------------------------
-- Wait for the server to shutdown.
-- ------------------------------
procedure Wait_Server (Command : in out Command_Type;
Context : in out Context_Type) is
procedure Shutdown (URI : in String;
Application : in Servlet.Core.Servlet_Registry_Access);
procedure Shutdown (URI : in String;
Application : in Servlet.Core.Servlet_Registry_Access) is
begin
if Application.all in AWA.Applications.Application'Class then
AWA.Applications.Application'Class (Application.all).Close;
end if;
end Shutdown;
Address : GNAT.Sockets.Sock_Addr_Type;
Listen : GNAT.Sockets.Socket_Type;
Socket : GNAT.Sockets.Socket_Type;
begin
GNAT.Sockets.Create_Socket (Listen);
Address.Addr := GNAT.Sockets.Loopback_Inet_Addr;
if Command.Management_Port > 0 then
Address.Port := Port_Type (Command.Management_Port);
else
Address.Port := 0;
end if;
GNAT.Sockets.Bind_Socket (Listen, Address);
GNAT.Sockets.Listen_Socket (Listen);
loop
GNAT.Sockets.Accept_Socket (Listen, Socket, Address);
exit;
end loop;
GNAT.Sockets.Close_Socket (Socket);
GNAT.Sockets.Close_Socket (Listen);
Command_Drivers.WS.Iterate (Shutdown'Access);
end Wait_Server;
-- ------------------------------
-- Setup the command before parsing the arguments and executing it.
-- ------------------------------
overriding
procedure Setup (Command : in out Command_Type;
Config : in out GNAT.Command_Line.Command_Line_Configuration;
Context : in out Context_Type) is
begin
GC.Set_Usage (Config => Config,
Usage => Command.Get_Name & " [arguments]",
Help => Command.Get_Description);
GC.Define_Switch (Config => Config,
Output => Command.Management_Port'Access,
Switch => "-m:",
Long_Switch => "--management-port=",
Initial => Command.Management_Port,
Argument => "NUMBER",
Help => -("The server listening management port on localhost"));
GC.Define_Switch (Config => Config,
Output => Command.Listening_Port'Access,
Switch => "-p:",
Long_Switch => "--port=",
Initial => Command.Listening_Port,
Argument => "NUMBER",
Help => -("The server listening port"));
GC.Define_Switch (Config => Config,
Output => Command.Max_Connection'Access,
Switch => "-C:",
Long_Switch => "--connection=",
Initial => Command.Max_Connection,
Argument => "NUMBER",
Help => -("The number of connections handled"));
GC.Define_Switch (Config => Config,
Output => Command.Upload'Access,
Switch => "-u:",
Long_Switch => "--upload=",
Argument => "PATH",
Help => -("The server upload directory"));
GC.Define_Switch (Config => Config,
Output => Command.TCP_No_Delay'Access,
Switch => "-n",
Long_Switch => "--tcp-no-delay",
Help => -("Enable the TCP no delay option"));
if Sys_Daemon'Address /= System.Null_Address then
GC.Define_Switch (Config => Config,
Output => Command.Daemon'Access,
Switch => "-d",
Long_Switch => "--daemon",
Help => -("Run the server in the background"));
end if;
AWA.Commands.Setup_Command (Config, Context);
end Setup;
-- ------------------------------
-- Write the help associated with the command.
-- ------------------------------
overriding
procedure Help (Command : in out Command_Type;
Name : in String;
Context : in out Context_Type) is
pragma Unreferenced (Command, Context);
begin
null;
end Help;
begin
Command_Drivers.Driver.Add_Command ("start",
-("start the web server"),
Command'Access);
end AWA.Commands.Start;
| 40.391892 | 90 | 0.532174 |
4d2bd1264c07711a1c55f8d69b65852988d359e2 | 3,955 | ads | Ada | 3-mid/impact/source/3d/collision/shapes/impact-d3-shape-convex-internal-polyhedral-box.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/impact/source/3d/collision/shapes/impact-d3-shape-convex-internal-polyhedral-box.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/impact/source/3d/collision/shapes/impact-d3-shape-convex-internal-polyhedral-box.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | with impact.d3.Shape.convex.internal.polyhedral;
package impact.d3.Shape.convex.internal.polyhedral.box
--
-- The impact.d3.Shape.convex.internal.polyhedral.box is a box primitive around the origin, its sides axis aligned with length specified by half extents, in local shape coordinates.
--
-- When used as part of a impact.d3.Object or impact.d3.Object.rigid it will be an oriented box in world space.
--
is
type Item is new impact.d3.Shape.convex.internal.polyhedral.item with private;
type View is access all Item'Class;
function to_box_Shape (boxHalfExtents : in math.Vector_3) return Item;
overriding function localGetSupportingVertex (Self : in Item; vec : in math.Vector_3) return math.Vector_3;
overriding function localGetSupportingVertexWithoutMargin (Self : in Item; vec : in math.Vector_3) return math.Vector_3;
overriding procedure batchedUnitVectorGetSupportingVertexWithoutMargin (Self : in Item; vectors : in Vector_3_array;
supportVerticesOut : out Vector_3_array;
numVectors : in Integer);
overriding procedure getAabb (Self : in Item; t : in Transform_3d;
aabbMin, aabbMax : out math.Vector_3);
overriding procedure getAabbSlow (Self : in Item; t : in Transform_3d;
aabbMin, aabbMax : out math.Vector_3);
function getHalfExtentsWithMargin (Self : in Item) return math.Vector_3;
function getHalfExtentsWithoutMargin (Self : in Item) return math.Vector_3;
overriding procedure setMargin (Self : in out Item; collisionMargin : in math.Real);
overriding procedure setLocalScaling (Self : in out Item; scaling : in math.Vector_3);
overriding procedure calculateLocalInertia (Self : in Item; mass : in math.Real;
inertia : out math.Vector_3);
overriding procedure getPlane (Self : in Item; planeNormal : out math.Vector_3;
planeSupport : out math.Vector_3;
i : in Integer);
overriding function getNumPlanes (Self : in Item) return Integer;
overriding function getNumVertices (Self : in Item) return Integer;
overriding function getNumEdges (Self : in Item) return Integer;
overriding procedure getVertex (Self : in Item; i : in Integer;
vtx : out math.Vector_3);
procedure getPlaneEquation (Self : in Item; plane : out math.Vector_4;
i : in Integer);
overriding procedure getEdge (Self : in Item; i : in Integer;
pa, pb : out math.Vector_3);
overriding function isInside (Self : in Item; pt : in math.Vector_3;
tolerance : in math.Real) return Boolean;
overriding function getName (Self : in Item) return String; -- for debugging
overriding function getNumPreferredPenetrationDirections (Self : in Item) return Integer;
overriding procedure getPreferredPenetrationDirection (Self : in Item; index : in Integer;
penetrationVector : out math.Vector_3);
private
type Item is new impact.d3.Shape.convex.internal.polyhedral.item with
record
null;
-- impact.d3.Vector m_boxHalfExtents1; -- use m_implicitShapeDimensions instead
end record;
end impact.d3.Shape.convex.internal.polyhedral.box;
| 32.418033 | 182 | 0.581037 |
3daff0f7f5e739e95c47d2e1014e9f1d2b36fa20 | 7,531 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-ztdeau.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-ztdeau.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-ztdeau.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . W I D E _ W I D E _ T E X T _ I O . D E C I M A L _ A U X --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Wide_Wide_Text_IO.Generic_Aux; use Ada.Wide_Wide_Text_IO.Generic_Aux;
with Ada.Wide_Wide_Text_IO.Float_Aux; use Ada.Wide_Wide_Text_IO.Float_Aux;
with System.Img_Dec; use System.Img_Dec;
with System.Img_LLD; use System.Img_LLD;
with System.Val_Dec; use System.Val_Dec;
with System.Val_LLD; use System.Val_LLD;
package body Ada.Wide_Wide_Text_IO.Decimal_Aux is
-------------
-- Get_Dec --
-------------
function Get_Dec
(File : File_Type;
Width : Field;
Scale : Integer) return Integer
is
Buf : String (1 .. Field'Last);
Ptr : aliased Integer;
Stop : Integer := 0;
Item : Integer;
begin
if Width /= 0 then
Load_Width (File, Width, Buf, Stop);
String_Skip (Buf, Ptr);
else
Load_Real (File, Buf, Stop);
Ptr := 1;
end if;
Item := Scan_Decimal (Buf, Ptr'Access, Stop, Scale);
Check_End_Of_Field (Buf, Stop, Ptr, Width);
return Item;
end Get_Dec;
-------------
-- Get_LLD --
-------------
function Get_LLD
(File : File_Type;
Width : Field;
Scale : Integer) return Long_Long_Integer
is
Buf : String (1 .. Field'Last);
Ptr : aliased Integer;
Stop : Integer := 0;
Item : Long_Long_Integer;
begin
if Width /= 0 then
Load_Width (File, Width, Buf, Stop);
String_Skip (Buf, Ptr);
else
Load_Real (File, Buf, Stop);
Ptr := 1;
end if;
Item := Scan_Long_Long_Decimal (Buf, Ptr'Access, Stop, Scale);
Check_End_Of_Field (Buf, Stop, Ptr, Width);
return Item;
end Get_LLD;
--------------
-- Gets_Dec --
--------------
function Gets_Dec
(From : String;
Last : not null access Positive;
Scale : Integer) return Integer
is
Pos : aliased Integer;
Item : Integer;
begin
String_Skip (From, Pos);
Item := Scan_Decimal (From, Pos'Access, From'Last, Scale);
Last.all := Pos - 1;
return Item;
exception
when Constraint_Error =>
Last.all := Pos - 1;
raise Data_Error;
end Gets_Dec;
--------------
-- Gets_LLD --
--------------
function Gets_LLD
(From : String;
Last : not null access Positive;
Scale : Integer) return Long_Long_Integer
is
Pos : aliased Integer;
Item : Long_Long_Integer;
begin
String_Skip (From, Pos);
Item := Scan_Long_Long_Decimal (From, Pos'Access, From'Last, Scale);
Last.all := Pos - 1;
return Item;
exception
when Constraint_Error =>
Last.all := Pos - 1;
raise Data_Error;
end Gets_LLD;
-------------
-- Put_Dec --
-------------
procedure Put_Dec
(File : File_Type;
Item : Integer;
Fore : Field;
Aft : Field;
Exp : Field;
Scale : Integer)
is
Buf : String (1 .. Field'Last);
Ptr : Natural := 0;
begin
Set_Image_Decimal (Item, Buf, Ptr, Scale, Fore, Aft, Exp);
Put_Item (File, Buf (1 .. Ptr));
end Put_Dec;
-------------
-- Put_LLD --
-------------
procedure Put_LLD
(File : File_Type;
Item : Long_Long_Integer;
Fore : Field;
Aft : Field;
Exp : Field;
Scale : Integer)
is
Buf : String (1 .. Field'Last);
Ptr : Natural := 0;
begin
Set_Image_Long_Long_Decimal (Item, Buf, Ptr, Scale, Fore, Aft, Exp);
Put_Item (File, Buf (1 .. Ptr));
end Put_LLD;
--------------
-- Puts_Dec --
--------------
procedure Puts_Dec
(To : out String;
Item : Integer;
Aft : Field;
Exp : Field;
Scale : Integer)
is
Buf : String (1 .. Field'Last);
Fore : Integer;
Ptr : Natural := 0;
begin
-- Compute Fore, allowing for Aft digits and the decimal dot
Fore := To'Length - Field'Max (1, Aft) - 1;
-- Allow for Exp and two more for E+ or E- if exponent present
if Exp /= 0 then
Fore := Fore - 2 - Exp;
end if;
-- Make sure we have enough room
if Fore < 1 then
raise Layout_Error;
end if;
-- Do the conversion and check length of result
Set_Image_Decimal (Item, Buf, Ptr, Scale, Fore, Aft, Exp);
if Ptr > To'Length then
raise Layout_Error;
else
To := Buf (1 .. Ptr);
end if;
end Puts_Dec;
--------------
-- Puts_LLD --
--------------
procedure Puts_LLD
(To : out String;
Item : Long_Long_Integer;
Aft : Field;
Exp : Field;
Scale : Integer)
is
Buf : String (1 .. Field'Last);
Fore : Integer;
Ptr : Natural := 0;
begin
Fore :=
(if Exp = 0 then To'Length - 1 - Aft else To'Length - 2 - Aft - Exp);
if Fore < 1 then
raise Layout_Error;
end if;
Set_Image_Long_Long_Decimal (Item, Buf, Ptr, Scale, Fore, Aft, Exp);
if Ptr > To'Length then
raise Layout_Error;
else
To := Buf (1 .. Ptr);
end if;
end Puts_LLD;
end Ada.Wide_Wide_Text_IO.Decimal_Aux;
| 28.526515 | 78 | 0.483601 |
2255d9fc9b76e6d691ee468f186579a0fb730c09 | 5,563 | adb | Ada | applet/aide/source/editors/aide-editor-of_derived_type.adb | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | 3 | 2017-04-29T14:25:22.000Z | 2017-09-29T10:15:28.000Z | applet/aide/source/editors/aide-editor-of_derived_type.adb | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | null | null | null | applet/aide/source/editors/aide-editor-of_derived_type.adb | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | null | null | null | with
aIDE.GUI,
aIDE.Editor.of_enumeration_literal,
AdaM.a_Type.enumeration_literal,
glib.Error,
gtk.Builder,
gtk.Handlers;
with Ada.Text_IO; use Ada.Text_IO;
package body aIDE.Editor.of_derived_type
is
use Gtk.Builder,
Glib,
glib.Error;
function on_subtype_name_Entry_leave (the_Entry : access Gtk_Entry_Record'Class;
Target : in AdaM.a_Type.derived_type.view) return Boolean
is
the_Text : constant String := the_Entry.Get_Text;
begin
Target.Name_is (the_Text);
return False;
end on_subtype_name_Entry_leave;
procedure on_type_name_Button_clicked (the_Entry : access Gtk_Button_Record'Class;
the_Editor : in aIDE.Editor.of_derived_type.view) -- return Boolean
is
-- the_Text : constant String := the_Entry.get_Text;
begin
put_Line ("YAYAYAYAY AHOY");
aIDE.GUI.show_types_Palette (Invoked_by => the_Entry.all'Access,
Target => the_Editor.Target.parent_Subtype.main_Type);
-- Target.Name_is (the_Text);
end on_type_name_Button_clicked;
procedure on_rid_Button_clicked (the_Button : access Gtk_Button_Record'Class;
the_Editor : in aIDE.Editor.of_derived_type.view)
is
pragma Unreferenced (the_Editor);
begin
the_Button.get_Parent.destroy;
end on_rid_Button_clicked;
package Entry_return_Callbacks is new Gtk.Handlers.User_Return_Callback (Gtk_Entry_Record,
Boolean,
AdaM.a_Type.derived_type.view);
package Button_Callbacks is new Gtk.Handlers.User_Callback (Gtk_Button_Record,
aIDE.Editor.of_derived_type.view);
function on_is_Label_clicked (the_Label : access Gtk_Label_Record'Class;
Self : in aIDE.Editor.of_derived_type.view) return Boolean
is
pragma Unreferenced (the_Label);
begin
-- Self.Target.add_Literal ("literal");
Self.freshen;
return False;
end on_is_Label_clicked;
package Label_return_Callbacks is new Gtk.Handlers.User_Return_Callback (Gtk_Label_Record,
Boolean,
aIDE.Editor.of_derived_type.view);
package body Forge
is
function to_Editor (the_Target : in AdaM.a_Type.derived_type.view) return View
is
use AdaM,
Glib;
Self : constant Editor.of_derived_type.view := new Editor.of_derived_type.item;
the_Builder : Gtk_Builder;
Error : aliased GError;
Result : Guint;
pragma Unreferenced (Result);
begin
Self.Target := the_Target;
Gtk_New (the_Builder);
Result := the_Builder.Add_From_File ("glade/editor/derived_type_editor.glade", Error'Access);
if Error /= null then
raise Program_Error with "Error: adam.Editor.of_derived_type ~ " & Get_Message (Error);
end if;
Self.top_Box := gtk_Box (the_Builder.get_Object ("top_Box"));
Self.name_Entry := Gtk_Entry (the_Builder.get_Object ("name_Entry"));
Self.derived_type_Button := Gtk_Button (the_Builder.get_Object ("derived_type_Button"));
-- Self.is_Label := Gtk_Label (the_Builder.get_Object ("is_Label"));
Self.rid_Button := gtk_Button (the_Builder.get_Object ("rid_Button"));
Self.name_Entry.Set_Text (+Self.Target.Name);
Entry_return_Callbacks.connect (Self.name_Entry,
"focus-out-event",
on_subtype_name_Entry_leave'Access,
the_Target);
Self.derived_type_Button.set_Label (+Self.Target.parent_Subtype.main_Type.Name);
button_Callbacks.connect (Self.derived_type_Button,
"clicked",
on_type_name_Button_clicked'Access,
Self);
Button_Callbacks.Connect (Self.rid_Button,
"clicked",
on_rid_Button_clicked'Access,
Self);
-- Label_return_Callbacks.Connect (Self.is_Label,
-- "button-release-event",
-- on_is_Label_clicked'Access,
-- Self);
Self.freshen;
return Self;
end to_Editor;
end Forge;
procedure destroy_Callback (Widget : not null access Gtk.Widget.Gtk_Widget_Record'Class)
is
begin
Widget.destroy;
end destroy_Callback;
overriding
procedure freshen (Self : in out Item)
is
begin
null;
-- Self.first_Entry.set_Text (Self.Target.Indication.First);
-- Self.last_Entry .set_Text (Self.Target.Indication.Last);
end freshen;
overriding
function top_Widget (Self : in Item) return gtk.Widget.Gtk_Widget
is
begin
return gtk.Widget.Gtk_Widget (Self.top_Box);
end top_Widget;
end aIDE.Editor.of_derived_type;
| 33.512048 | 114 | 0.563904 |
1a8056a2fc872375ec834eda58c17b3ab0fb1592 | 855 | adb | Ada | Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/type_coercion/assign.adb | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/type_coercion/assign.adb | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/type_coercion/assign.adb | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | -- Copyright 2008-2017 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with Ident;
procedure Assign is
Q: array (1..5) of Integer := (2, 3, 5, 7, 11);
begin
Q(1) := Ident (Q(3)); -- START
end Assign;
| 32.884615 | 73 | 0.707602 |
22dfa12cb1705154f209ebb9e6ac9f1923976a15 | 7,671 | ads | Ada | orka/src/orka/interface/orka-rendering-programs-uniforms.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 52 | 2016-07-30T23:00:28.000Z | 2022-02-05T11:54:55.000Z | orka/src/orka/interface/orka-rendering-programs-uniforms.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 79 | 2016-08-01T18:36:48.000Z | 2022-02-27T12:14:20.000Z | orka/src/orka/interface/orka-rendering-programs-uniforms.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 4 | 2018-04-28T22:36:26.000Z | 2020-11-14T23:00:29.000Z | -- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2017 onox <[email protected]>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
with GL.Low_Level.Enums;
with GL.Objects.Programs.Uniforms;
with GL.Objects.Textures;
with GL.Pixels.Extensions;
with GL.Types;
with Orka.Rendering.Textures;
with Orka.Types;
package Orka.Rendering.Programs.Uniforms is
pragma Preelaborate;
package LE renames GL.Low_Level.Enums;
package PE renames GL.Pixels.Extensions;
use type LE.Texture_Kind;
use type LE.Resource_Type;
use type PE.Format_Type;
-----------------------------------------------------------------------------
function Texture_Kind (Sampler : LE.Resource_Type) return LE.Texture_Kind;
function Image_Kind (Image : LE.Resource_Type) return LE.Texture_Kind;
function Sampler_Format_Type (Sampler : LE.Resource_Type) return PE.Format_Type;
function Image_Format_Type (Image : LE.Resource_Type) return PE.Format_Type;
-----------------------------------------------------------------------------
type Uniform (Kind : LE.Resource_Type) is tagged private;
procedure Set_Matrix (Object : Uniform; Value : Types.Singles.Matrix4)
with Pre => Object.Kind = LE.Single_Matrix4;
procedure Set_Matrix (Object : Uniform; Value : Types.Doubles.Matrix4)
with Pre => Object.Kind = LE.Double_Matrix4;
procedure Set_Vector (Object : Uniform; Value : Types.Singles.Vector4)
with Pre => Object.Kind = LE.Single_Vec4;
procedure Set_Vector (Object : Uniform; Value : Types.Doubles.Vector4)
with Pre => Object.Kind = LE.Double_Vec4;
-----------------------------------------------------------------------------
procedure Set_Vector
(Object : Uniform;
Data : GL.Types.Int_Array)
with Pre => (case Object.Kind is
when LE.Int_Vec2 => Data'Length = 2,
when LE.Int_Vec3 => Data'Length = 3,
when LE.Int_Vec4 => Data'Length = 4,
when others => raise Constraint_Error);
procedure Set_Vector
(Object : Uniform;
Data : GL.Types.UInt_Array)
with Pre => (case Object.Kind is
when LE.UInt_Vec2 => Data'Length = 2,
when LE.UInt_Vec3 => Data'Length = 3,
when LE.UInt_Vec4 => Data'Length = 4,
when others => raise Constraint_Error);
procedure Set_Vector
(Object : Uniform;
Data : GL.Types.Single_Array)
with Pre => (case Object.Kind is
when LE.Single_Vec2 => Data'Length = 2,
when LE.Single_Vec3 => Data'Length = 3,
when LE.Single_Vec4 => Data'Length = 4,
when others => raise Constraint_Error);
procedure Set_Vector
(Object : Uniform;
Data : GL.Types.Double_Array)
with Pre => (case Object.Kind is
when LE.Double_Vec2 => Data'Length = 2,
when LE.Double_Vec3 => Data'Length = 3,
when LE.Double_Vec4 => Data'Length = 4,
when others => raise Constraint_Error);
-----------------------------------------------------------------------------
procedure Set_Single (Object : Uniform; Value : GL.Types.Single)
with Pre => Object.Kind = LE.Single_Type;
procedure Set_Double (Object : Uniform; Value : GL.Types.Double)
with Pre => Object.Kind = LE.Double_Type;
procedure Set_Int (Object : Uniform; Value : GL.Types.Int)
with Pre => Object.Kind = LE.Int_Type;
procedure Set_UInt (Object : Uniform; Value : GL.Types.UInt)
with Pre => Object.Kind = LE.UInt_Type;
procedure Set_Integer (Object : Uniform; Value : Integer)
with Pre => Object.Kind = LE.Int_Type;
procedure Set_Boolean (Object : Uniform; Value : Boolean)
with Pre => Object.Kind = LE.Bool_Type;
-----------------------------------------------------------------------------
type Uniform_Sampler (Kind : LE.Resource_Type) is tagged private;
procedure Verify_Compatibility
(Object : Uniform_Sampler;
Texture : GL.Objects.Textures.Texture) is null
with Pre'Class =>
(Texture.Kind = Texture_Kind (Object.Kind) or else
raise Constraint_Error with
"Cannot bind " & Rendering.Textures.Image (Texture) & " to " &
Texture_Kind (Object.Kind)'Image & " sampler")
and then
-- If the texture is a depth texture, the sampler can be a normal or shadow sampler
-- (The bound Sampler object must have comparison mode enabled iff the sampler in the
-- shader is a shadow sampler)
(Texture.Compressed
or else
(if PE.Texture_Format_Type (Texture.Internal_Format) = PE.Depth_Type then
Sampler_Format_Type (Object.Kind) in PE.Depth_Type | PE.Float_Or_Normalized_Type
else
Sampler_Format_Type (Object.Kind) =
PE.Texture_Format_Type (Texture.Internal_Format))
or else raise Constraint_Error with
"Cannot bind " & Rendering.Textures.Image (Texture) & " to " &
Object.Kind'Image & " sampler");
-----------------------------------------------------------------------------
type Uniform_Image (Kind : LE.Resource_Type) is tagged private;
procedure Verify_Compatibility
(Object : Uniform_Image;
Texture : GL.Objects.Textures.Texture) is null
with Pre'Class =>
(Texture.Kind = Image_Kind (Object.Kind) or else
raise Constraint_Error with
"Cannot bind " & Rendering.Textures.Image (Texture) & " to " &
Image_Kind (Object.Kind)'Image & " image sampler")
and then
-- If the texture is a depth texture, the sampler can be a normal or shadow sampler
-- (The bound Sampler object must have comparison mode enabled iff the sampler in the
-- shader is a shadow sampler)
(Texture.Compressed
or else
Sampler_Format_Type (Object.Kind) = PE.Image_Format_Type (Texture.Internal_Format)
or else raise Constraint_Error with
"Cannot bind " & Rendering.Textures.Image (Texture) & " to " &
Object.Kind'Image & " image sampler");
-----------------------------------------------------------------------------
function Create_Uniform_Sampler
(Object : Program;
Name : String) return Uniform_Sampler;
function Create_Uniform_Image
(Object : Program;
Name : String) return Uniform_Image;
function Create_Uniform_Variable
(Object : Program;
Name : String) return Uniform;
Uniform_Inactive_Error : exception renames GL.Objects.Programs.Uniform_Inactive_Error;
Uniform_Type_Error : exception;
private
type Uniform (Kind : LE.Resource_Type) is tagged record
GL_Uniform : GL.Objects.Programs.Uniforms.Uniform;
end record;
type Uniform_Sampler (Kind : LE.Resource_Type) is tagged record
GL_Uniform : GL.Objects.Programs.Uniforms.Uniform;
end record;
type Uniform_Image (Kind : LE.Resource_Type) is tagged record
GL_Uniform : GL.Objects.Programs.Uniforms.Uniform;
end record;
end Orka.Rendering.Programs.Uniforms;
| 38.547739 | 95 | 0.615826 |
ad388437ce3f05628b976ba21afb71aec72addfb | 2,158 | ads | Ada | boards/stm32f0_nrf24/stm32gd-board.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 1 | 2021-04-06T07:57:56.000Z | 2021-04-06T07:57:56.000Z | boards/stm32f0_nrf24/stm32gd-board.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | null | null | null | boards/stm32f0_nrf24/stm32gd-board.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 2 | 2018-05-29T13:59:31.000Z | 2019-02-03T19:48:08.000Z | with STM32GD.GPIO;
with STM32GD.GPIO.Pin;
with STM32GD.USART;
with STM32GD.USART.Peripheral;
with STM32GD.SPI;
with STM32GD.SPI.Peripheral;
with STM32GD.GPIO;
with STM32GD.RTC;
with STM32GD.Clock;
with STM32GD.Clock.Tree;
with Drivers.Text_IO;
with Drivers.NRF24;
package STM32GD.Board is
package CLOCKS is new STM32GD.Clock.Tree;
package GPIO renames STM32GD.GPIO;
package BUTTON is new GPIO.Pin (Pin => GPIO.Pin_0, Port => GPIO.Port_A);
package LED is new GPIO.Pin (Pin => GPIO.Pin_1, Port => GPIO.Port_A, Mode => GPIO.Mode_Out);
package LED2 is new GPIO.Pin (Pin => GPIO.Pin_0, Port => GPIO.Port_F, Mode => GPIO.Mode_Out);
package SCLK is new GPIO.Pin (Pin => GPIO.Pin_5, Port => GPIO.Port_A, Mode => GPIO.Mode_AF);
package MISO is new GPIO.Pin (Pin => GPIO.Pin_6, Port => GPIO.Port_A, Mode => GPIO.Mode_AF);
package MOSI is new GPIO.Pin (Pin => GPIO.Pin_7, Port => GPIO.Port_A, Mode => GPIO.Mode_AF);
package CSN is new GPIO.Pin (Pin => GPIO.Pin_4, Port => GPIO.Port_A, Mode => GPIO.Mode_Out);
package CE is new GPIO.Pin (Pin => GPIO.Pin_1, Port => GPIO.Port_B, Mode => GPIO.Mode_Out);
package TX is new GPIO.Pin (Pin => GPIO.Pin_9, Port => GPIO.Port_A, Pull_Resistor => GPIO.Pull_Up, Mode => GPIO.Mode_AF, Alternate_Function => 1);
package RX is new GPIO.Pin (Pin => GPIO.Pin_10, Port => GPIO.Port_A, Pull_Resistor => GPIO.Pull_Up, Mode => GPIO.Mode_AF, Alternate_Function => 1);
package IRQ is new GPIO.Pin (Pin => GPIO.Pin_3, Port => GPIO.Port_A, Mode => GPIO.Mode_In);
package SPI is new STM32GD.SPI.Peripheral (SPI => STM32GD.SPI.SPI_1);
package USART is new STM32GD.USART.Peripheral (USART => STM32GD.USART.USART_1, Speed => 115200,
Clock_Tree => CLOCKS, Clock => STM32GD.Clock.PCLK);
package RTC is new STM32GD.RTC (Clock_Tree => STM32GD.Board.Clocks, Clock => STM32GD.Clock.LSI);
package Radio is new Drivers.NRF24 (SPI => SPI, Chip_Select => CSN, Chip_Enable => CE, IRQ => IRQ);
package Text_IO is new Drivers.Text_IO (USART => STM32GD.Board.USART);
procedure Init;
end STM32GD.Board;
| 50.186047 | 157 | 0.675162 |
134f935d4a64de5535d2e1a2116f225590216b4f | 1,836 | adb | Ada | memsim-master/src/device.adb | strenkml/EE368 | 00f15bce9e65badddc613355643b1061fd4a8195 | [
"MIT"
] | null | null | null | memsim-master/src/device.adb | strenkml/EE368 | 00f15bce9e65badddc613355643b1061fd4a8195 | [
"MIT"
] | null | null | null | memsim-master/src/device.adb | strenkml/EE368 | 00f15bce9e65badddc613355643b1061fd4a8195 | [
"MIT"
] | null | null | null |
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
package body Device is
type Device_Property_Type is record
name : Unbounded_String;
bram_width : Positive;
bram_depth : Positive;
max_path : Positive;
end record;
type Device_Property_Array_Type is
array (Device_Type) of Device_Property_Type;
properties : constant Device_Property_Array_Type := (
ASIC => (To_Unbounded_String("asic"), 1, 1, 64),
Virtex_4 => (To_Unbounded_String("virtex4"), 36, 512, 64),
Virtex_5 => (To_Unbounded_String("virtex5"), 72, 512, 64),
Virtex_6 => (To_Unbounded_String("virtex6"), 72, 512, 64),
Virtex_7 => (To_Unbounded_String("virtex7"), 72, 512, 64)
);
device : Device_Type := ASIC;
address_bits : Positive := 32;
procedure Set_Device(name : in String) is
begin
for d in Device_Property_Array_Type'Range loop
if properties(d).name = name then
device := d;
return;
end if;
end loop;
raise Invalid_Device;
end Set_Device;
procedure Set_Address_Bits(b : in Positive) is
begin
address_bits := b;
end Set_Address_Bits;
function Get_Device return Device_Type is
begin
return device;
end Get_Device;
function Get_BRAM_Width return Positive is
begin
return properties(device).bram_width;
end Get_BRAM_Width;
function Get_BRAM_Depth return Positive is
begin
return properties(device).bram_depth;
end Get_BRAM_Depth;
function Get_Max_Path return Positive is
begin
return properties(device).max_path;
end Get_Max_Path;
function Get_Address_Bits return Positive is
begin
return address_bits;
end Get_Address_Bits;
end Device;
| 26.608696 | 73 | 0.649782 |
13d58b16033a4e697cdcaebdf14fa035fc8eeab8 | 3,778 | adb | Ada | source/nodes/program-nodes-defining_character_literals.adb | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/nodes/program-nodes-defining_character_literals.adb | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/nodes/program-nodes-defining_character_literals.adb | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | 1 | 2019-10-16T09:05:27.000Z | 2019-10-16T09:05:27.000Z | -- SPDX-FileCopyrightText: 2019 Max Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
package body Program.Nodes.Defining_Character_Literals is
function Create
(Character_Literal_Token : not null Program.Lexical_Elements
.Lexical_Element_Access)
return Defining_Character_Literal is
begin
return Result : Defining_Character_Literal :=
(Character_Literal_Token => Character_Literal_Token,
Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
function Create
(Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Defining_Character_Literal is
begin
return Result : Implicit_Defining_Character_Literal :=
(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 Character_Literal_Token
(Self : Defining_Character_Literal)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Character_Literal_Token;
end Character_Literal_Token;
overriding function Image (Self : Defining_Character_Literal) return Text is
begin
return Self.Character_Literal_Token.Image;
end Image;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Defining_Character_Literal)
return Boolean is
begin
return Self.Is_Part_Of_Implicit;
end Is_Part_Of_Implicit;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Defining_Character_Literal)
return Boolean is
begin
return Self.Is_Part_Of_Inherited;
end Is_Part_Of_Inherited;
overriding function Is_Part_Of_Instance
(Self : Implicit_Defining_Character_Literal)
return Boolean is
begin
return Self.Is_Part_Of_Instance;
end Is_Part_Of_Instance;
overriding function Image
(Self : Implicit_Defining_Character_Literal)
return Text is
pragma Unreferenced (Self);
begin
return "";
end Image;
procedure Initialize
(Self : in out Base_Defining_Character_Literal'Class) is
begin
null;
end Initialize;
overriding function Is_Defining_Character_Literal
(Self : Base_Defining_Character_Literal)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Defining_Character_Literal;
overriding function Is_Defining_Name
(Self : Base_Defining_Character_Literal)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Defining_Name;
overriding procedure Visit
(Self : not null access Base_Defining_Character_Literal;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is
begin
Visitor.Defining_Character_Literal (Self);
end Visit;
overriding function To_Defining_Character_Literal_Text
(Self : in out Defining_Character_Literal)
return Program.Elements.Defining_Character_Literals
.Defining_Character_Literal_Text_Access is
begin
return Self'Unchecked_Access;
end To_Defining_Character_Literal_Text;
overriding function To_Defining_Character_Literal_Text
(Self : in out Implicit_Defining_Character_Literal)
return Program.Elements.Defining_Character_Literals
.Defining_Character_Literal_Text_Access is
pragma Unreferenced (Self);
begin
return null;
end To_Defining_Character_Literal_Text;
end Program.Nodes.Defining_Character_Literals;
| 30.467742 | 79 | 0.729751 |
ad5fa45c6dc459ac2f4917a6b758b0562e28a73b | 14,779 | adb | Ada | clients/ada/src/model/-models.adb | theunifai/unifai-sdk | b010bd37e5a418881ee3747bd8ec6e8e18e08234 | [
"MIT"
] | 1 | 2022-03-30T11:33:28.000Z | 2022-03-30T11:33:28.000Z | clients/ada/src/model/-models.adb | gladiaio/gladia-sdk | b010bd37e5a418881ee3747bd8ec6e8e18e08234 | [
"MIT"
] | null | null | null | clients/ada/src/model/-models.adb | gladiaio/gladia-sdk | b010bd37e5a418881ee3747bd8ec6e8e18e08234 | [
"MIT"
] | null | null | null | -- FastAPI
-- No description provided (generated by Openapi Generator https://github.com/openapitools/openapi-generator)
--
-- The version of the OpenAPI document: 0.1.0
--
--
-- NOTE: This package is auto generated by OpenAPI-Generator 4.0.0.
-- https://openapi-generator.tech
-- Do not edit the class manually.
package body .Models is
use Swagger.Streams;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in ValidationErrorType) is
begin
Into.Start_Entity (Name);
Serialize (Into, "loc", Value.Loc);
Into.Write_Entity ("msg", Value.Msg);
Into.Write_Entity ("type", Value.P_Type);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in ValidationErrorType_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out ValidationErrorType) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Swagger.Streams.Deserialize (Object, "loc", Value.Loc);
Swagger.Streams.Deserialize (Object, "msg", Value.Msg);
Swagger.Streams.Deserialize (Object, "type", Value.P_Type);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out ValidationErrorType_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : ValidationErrorType;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in HTTPValidationErrorType) is
begin
Into.Start_Entity (Name);
Serialize (Into, "detail", Value.Detail);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in HTTPValidationErrorType_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out HTTPValidationErrorType) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Swagger.Streams.Deserialize (Object, "detail", Value.Detail);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out HTTPValidationErrorType_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : HTTPValidationErrorType;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageImageBackgroundRemovalPostType) is
begin
Into.Start_Entity (Name);
Serialize (Into, "image", Value.Image);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageImageBackgroundRemovalPostType_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageImageBackgroundRemovalPostType) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Swagger.Streams.Deserialize (Object, "image", Value.Image);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageImageBackgroundRemovalPostType_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : BodyApplyImageImageBackgroundRemovalPostType;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageImageColorizationPostType) is
begin
Into.Start_Entity (Name);
Serialize (Into, "image", Value.Image);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageImageColorizationPostType_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageImageColorizationPostType) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Swagger.Streams.Deserialize (Object, "image", Value.Image);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageImageColorizationPostType_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : BodyApplyImageImageColorizationPostType;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageImageFaceBluringPostType) is
begin
Into.Start_Entity (Name);
Serialize (Into, "image", Value.Image);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageImageFaceBluringPostType_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageImageFaceBluringPostType) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Swagger.Streams.Deserialize (Object, "image", Value.Image);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageImageFaceBluringPostType_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : BodyApplyImageImageFaceBluringPostType;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageImageSuperResolutionPostType) is
begin
Into.Start_Entity (Name);
Serialize (Into, "image", Value.Image);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageImageSuperResolutionPostType_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageImageSuperResolutionPostType) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Swagger.Streams.Deserialize (Object, "image", Value.Image);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageImageSuperResolutionPostType_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : BodyApplyImageImageSuperResolutionPostType;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageImageUncolorizationPostType) is
begin
Into.Start_Entity (Name);
Serialize (Into, "image", Value.Image);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageImageUncolorizationPostType_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageImageUncolorizationPostType) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Swagger.Streams.Deserialize (Object, "image", Value.Image);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageImageUncolorizationPostType_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : BodyApplyImageImageUncolorizationPostType;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageTextAsciifyPostType) is
begin
Into.Start_Entity (Name);
Serialize (Into, "image", Value.Image);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageTextAsciifyPostType_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageTextAsciifyPostType) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Swagger.Streams.Deserialize (Object, "image", Value.Image);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageTextAsciifyPostType_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : BodyApplyImageTextAsciifyPostType;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageTextOcrPostType) is
begin
Into.Start_Entity (Name);
Serialize (Into, "image", Value.Image);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BodyApplyImageTextOcrPostType_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageTextOcrPostType) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Swagger.Streams.Deserialize (Object, "image", Value.Image);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BodyApplyImageTextOcrPostType_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : BodyApplyImageTextOcrPostType;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
end .Models;
| 33.896789 | 110 | 0.606266 |
2e60a8ba6e9d0f6c36a4d0d3f54c36a99f807e6f | 657 | ada | Ada | examples/Ada/wuclient.ada | dcramer/zguide | a07fe97c4c597e6401b4281ae07c3a156590f4c6 | [
"Zed",
"X11",
"MIT"
] | 2 | 2015-09-24T19:53:04.000Z | 2015-11-06T10:22:53.000Z | examples/Ada/wuclient.ada | gaubert/zguide | e24c02481c47b129a37f261d1109140572f255f4 | [
"Zed",
"X11",
"MIT"
] | null | null | null | examples/Ada/wuclient.ada | gaubert/zguide | e24c02481c47b129a37f261d1109140572f255f4 | [
"Zed",
"X11",
"MIT"
] | null | null | null | No-one has translated the wuclient example into Ada yet. Be the first to create
wuclient in Ada and get one free Internet! If you're the author of the Ada
binding, this is a great way to get people to use 0MQ in Ada.
To submit a new translation email it to [email protected]. Please:
* Stick to identical functionality and naming used in examples so that readers
can easily compare languages.
* You MUST place your name as author in the examples so readers can contact you.
* You MUST state in the email that you license your code under the MIT/X11
license.
Subscribe to this list at http://lists.zeromq.org/mailman/listinfo/zeromq-dev.
| 46.928571 | 80 | 0.776256 |
2ede66bc4bb235b197d529643b833b63cdfe201f | 2,591 | ads | Ada | 3-mid/impact/source/3d/collision/broadphase/impact-d3-collision-algorithm.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/impact/source/3d/collision/broadphase/impact-d3-collision-algorithm.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/impact/source/3d/collision/broadphase/impact-d3-collision-algorithm.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | with impact.d3.Manifold,
impact.d3.Dispatcher,
impact.d3.Object,
impact.d3.collision.manifold_Result,
ada.containers.Vectors;
package impact.d3.Collision.Algorithm
--
-- impact.d3.collision.Algorithm is an collision interface that is compatible with the Broadphase and impact.d3.Dispatcher.
-- It is persistent over frames.
--
is
-- type btManifoldArray is array (Natural range <>) of access impact.d3.Manifold.Item;
type Manifold_view is access all impact.d3.Manifold.Item'Class;
package btManifoldArrays is new ada.containers.Vectors (Positive, Manifold_view);
subtype btManifoldArray is btManifoldArrays.Vector;
type AlgorithmConstructionInfo is
record
m_dispatcher1 : access impact.d3.Dispatcher.item'Class;
m_manifold : access impact.d3.Manifold.Item;
-- int getDispatcherId();
end record;
function to_AlgorithmConstructionInfo (dispatcher : access impact.d3.Dispatcher.item'Class; temp : in Integer) return AlgorithmConstructionInfo;
type Item is abstract tagged private;
-- function to_impact.d3.collision.Algorithm (ci : in impact.d3.collision.AlgorithmConstructionInfo) return Item'Class;
procedure define (Self : in out Item; ci : in AlgorithmConstructionInfo);
procedure destruct (Self : in out Item);
procedure processCollision (Self : in out Item; body0, body1 : access impact.d3.Object.item'Class;
dispatchInfo : in impact.d3.Dispatcher.DispatcherInfo;
resultOut : out impact.d3.collision.manifold_Result.item) is abstract;
function calculateTimeOfImpact (Self : in Item; body0, body1 : access impact.d3.Object.item'Class;
dispatchInfo : in impact.d3.Dispatcher.DispatcherInfo;
resultOut : access impact.d3.collision.manifold_Result.item) return math.Real is abstract;
procedure getAllContactManifolds (Self : in out Item; manifoldArray : out btManifoldArray) is abstract;
procedure set_m_dispatcher (Self : in out Item; To : access impact.d3.Dispatcher.item'Class);
function get_m_dispatcher (Self : in Item) return access impact.d3.Dispatcher.item'Class;
private
type Item is abstract tagged
record
m_dispatcher : access impact.d3.Dispatcher.item'Class;
-- int getDispatcherId();
end record;
end impact.d3.Collision.Algorithm;
| 32.797468 | 149 | 0.668854 |
ad99e9b7c954295619db5272a14a39ba482c7a06 | 5,058 | ads | Ada | utils/src/dijkstra.ads | Heziode/aoc-ada-2021 | fd2fcb177a930d16a16da888e89aeca8946cc615 | [
"BSD-2-Clause"
] | 3 | 2021-12-02T10:21:33.000Z | 2021-12-25T13:31:55.000Z | utils/src/dijkstra.ads | Heziode/aoc-ada-2021 | fd2fcb177a930d16a16da888e89aeca8946cc615 | [
"BSD-2-Clause"
] | null | null | null | utils/src/dijkstra.ads | Heziode/aoc-ada-2021 | fd2fcb177a930d16a16da888e89aeca8946cc615 | [
"BSD-2-Clause"
] | 1 | 2021-12-06T22:47:02.000Z | 2021-12-06T22:47:02.000Z | with Ada.Containers.Doubly_Linked_Lists,
Ada.Containers.Hashed_Maps,
Ada.Containers.Vectors;
with Utils; -- For Long_Long_Natural type
generic
type Node is private;
with function Hash (Coord : Node) return Ada.Containers.Hash_Type is <>;
with function Equivalent_Keys (Left, Right : Node) return Boolean is <>;
with procedure Put (Elt : Node);
Is_Directed : Boolean := True;
package Dijkstra is
use Utils;
type Graph_T is tagged limited private;
type Graph_Access is access all Graph_T;
type Edge is record
Start_Node : Node;
End_Node : Node;
Cost : Long_Long_Natural;
end record;
-- This exception is raised when there is no path between two nodes
Not_Path : exception;
-- overriding function "=" (Left, Right : Edge) return Boolean is
-- (Equivalent_Keys (Left.Start_Node, Right.Start_Node)
-- and Equivalent_Keys (Left.End_Node, Right.End_Node)
-- and Left.Cost = Right.Cost);
package Edges_Lists is new Ada.Containers.Vectors (Index_Type => Long_Long_Natural,
Element_Type => Edge,
"=" => "=");
-- package Node_Lists is new Ada.Containers.Vectors (Index_Type => Long_Long_Natural,
-- Element_Type => Node,
-- "=" => Equivalent_Keys);
package Path_List is new Ada.Containers.Doubly_Linked_Lists (Element_Type => Node,
"=" => Equivalent_Keys);
-- Heuristict to be used with Dijkstra (so, transform them more like A*) to imporve the graph exploration.
-- @param Current Current vertex where the exploration is
-- @param To the vertex to reach
-- @return Return the value of the estimation. It is used in the priority queue, so lower value is better.
type Heuristic_Access is access function (Current, To : Node) return Long_Long_Natural;
-- This heuristic is means that the algorithm do not make an a priori estimation. So this is a pure Dijkstra's.
--
-- @note
-- The use of Current and To in the expression is to prevent "Unreferenced" warning.
-- Indeed, before GNAT 202X, we cannot use "pragma Unreferenced" (it is logic because outside of declaration) nor
-- the aspect form. The support of aspect form was introduce in GNAT 202X and needs "-gnat2022" switch.
-- @see AdaCore GNAT Reference Manual > 3. Implementation Defined Aspects > Aspect Unreferenced
function Default_Heuristic (Current, To : Node) return Long_Long_Natural is
(if Current = Current and To = To then 0 else 0);
-- Constructor of Graph_T
function Initialize (Edges : Edges_Lists.Vector) return Graph_T;
-- Compute the shortest path between From and To using Dijkstra algorithm.
-- It returns a Doubly_Linked_Lists of Node where the begining of this list is the node From and the end is To.
function Shortest_Path (Graph : Graph_T; From, To : Node; Heuristic : Heuristic_Access := Default_Heuristic'Access)
return Path_List.List;
-- Compute the shortest path between From and To using Dijkstra algorithm.
-- It only returns the shortest cost.
function Shortest_Cost (Graph : Graph_T; From, To : Node; Heuristic : Heuristic_Access := Default_Heuristic'Access)
return Long_Long_Natural;
-- To display the graph like:
-- Node_A:
-- - Node_x (from Node_A -> Node_x)
-- - Node_y (from Node_A -> Node_y)
-- Node_B:
-- - Node_x (from Node_B -> Node_x)
procedure Put (Graph : Graph_T);
private
package Vertices_Cost_Maps is new Ada.Containers.Hashed_Maps (Key_Type => Node,
Element_Type => Long_Long_Natural,
Hash => Hash,
Equivalent_Keys => Equivalent_Keys,
"=" => "=");
type Vertex_Info is record
Cumulated_Cost : Long_Long_Natural := Long_Long_Natural'Last;
Visited : Boolean := False;
Neighbors : Vertices_Cost_Maps.Map := Vertices_Cost_Maps.Empty_Map;
end record;
package Vertices_Maps is new Ada.Containers.Hashed_Maps (Key_Type => Node,
Element_Type => Vertex_Info,
Hash => Hash,
Equivalent_Keys => Equivalent_Keys,
"=" => "=");
type Graph_T is tagged limited record
Vertices : Vertices_Maps.Map;
end record;
end Dijkstra;
| 46.833333 | 119 | 0.573349 |
ad5247302054567f4e27647d5fef5fee91332be7 | 2,773 | ads | Ada | g-socket.ads | ytomino/gnat4drake | 945795d8705ba4024b07a41b7efe0a9513b441c1 | [
"MIT"
] | null | null | null | g-socket.ads | ytomino/gnat4drake | 945795d8705ba4024b07a41b7efe0a9513b441c1 | [
"MIT"
] | null | null | null | g-socket.ads | ytomino/gnat4drake | 945795d8705ba4024b07a41b7efe0a9513b441c1 | [
"MIT"
] | null | null | null | pragma License (Unrestricted);
with Ada.Streams.Stream_IO.Sockets;
private with Ada.Strings.Unbounded_Strings;
package GNAT.Sockets is
procedure Initialize is null;
type Socket_Type is access Ada.Streams.Stream_IO.File_Type; -- non-limited
type Family_Type is (Family_Inet);
type Mode_Type is (Socket_Stream);
subtype Port_Type is Ada.Streams.Stream_IO.Sockets.Port_Number;
type Inet_Addr_Type (Family : Family_Type := Family_Inet) is private;
type Sock_Addr_Type (Family : Family_Type := Family_Inet) is record
Addr : Inet_Addr_Type (Family);
Port : Port_Type;
end record;
type Host_Entry_Type (<>) is private;
function Addresses (E : Host_Entry_Type; N : Positive := 1)
return Inet_Addr_Type;
function Get_Host_By_Name (Name : String) return Host_Entry_Type;
type Level_Type is (Socket_Level);
type Option_Name is (Keep_Alive, Reuse_Address, Receive_Buffer);
type Option_Type (Name : Option_Name := Keep_Alive) is record
case Name is
when Keep_Alive | Reuse_Address =>
Enabled : Boolean;
when Receive_Buffer =>
Size : Natural;
end case;
end record;
type Request_Name is (Non_Blocking_IO, N_Bytes_To_Read);
type Request_Type (Name : Request_Name := Non_Blocking_IO) is record
case Name is
when Non_Blocking_IO =>
Enabled : Boolean;
when N_Bytes_To_Read =>
Size : Natural;
end case;
end record;
type Request_Flag_Type is (No_Request_Flag);
procedure Create_Socket (
Socket : out Socket_Type;
Family : Family_Type := Family_Inet;
Mode : Mode_Type := Socket_Stream);
procedure Close_Socket (Socket : in out Socket_Type);
procedure Connect_Socket (
Socket : Socket_Type;
Server : in out Sock_Addr_Type);
procedure Control_Socket (
Socket : Socket_Type;
Request : in out Request_Type) is null;
-- Non-blocking mode is not implemented in drake.
procedure Receive_Socket (
Socket : Socket_Type;
Item : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset;
Flags : Request_Flag_Type := No_Request_Flag);
procedure Set_Socket_Option (
Socket : Socket_Type;
Level : Level_Type := Socket_Level;
Option : Option_Type) is null;
-- The detailed options are not implemented in drake.
subtype Stream_Access is Ada.Streams.Stream_IO.Stream_Access;
function Stream (Socket : Socket_Type) return Stream_Access;
private
type Inet_Addr_Type (Family : Family_Type := Family_Inet) is record
Host_Name : Ada.Strings.Unbounded_Strings.Unbounded_String;
end record;
type Host_Entry_Type is new String;
end GNAT.Sockets;
| 28.587629 | 77 | 0.698161 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.